snarkjs VS circomlibjs

git clone https://github.com/iden3/snarkjs cd snarkjs npm ci cd ../simple-zk

The generated wasm and r1cs files are available in the build folder. To generate the proof, we need a proving key file, and to generate this file, we need a ptau file. This ptau file can be generated by snarkjs, or you can download a pregenerated one (you can find the links in the snarkjs repo). For testing, the generated one is good for us, but in your production app, it’s recommended to do the ceremony and generate your own ptau file. (You can read about it in my previous article.)

Their goal was to teach how to use Circom to build zero-knowledge circuits and SnarkJS to compile them into solidity smart contracts.

Oh yeah, this is a known issue with windows; it's perfect on Mac. Do the steps here resolve it: https://github.com/iden3/snarkjs/issues/57 ?

The project mentions that it uses snarkjs and I thought I'd link it directy here. [1] What's interesting in the setup of systems like this one is the "Powers of Tau" ceremony which in decentralized manner (secure multi-party computation) avoid the "trusted setup" problem in non-interactive variants of zero knowledge proof systems like this one. [2]

[1] https://github.com/iden3/snarkjs

[2] https://github.com/ebfull/powersoftau

The advantage of SMT over the general Merkle tree is that it not only allows us to provide an inclusion proof but also an exclusion proof. This means that we can prove that a tree does not contain a value for the given key. Thanks to this, we can prove any operation (insert, delete, update), which will be a very important property of our rollup. Fortunately, Circomlib (and CircomlibJS) includes an SMT implementation, so we do not need to implement this ourselves.

Circomlib has a JS implementation that can be used for this. Let’s install it: