|
|
1 year ago | |
|---|---|---|
| circuit | 1 year ago | |
| src | 1 year ago | |
| .gitignore | 1 year ago | |
| Cargo.toml | 1 year ago | |
| README.md | 1 year ago | |
| compile-circuit.sh | 1 year ago | |
Repo showcasing usage of Sonobe with Circom circuits.
Proves a chain of keccak256 hashes, using the vocdoni/keccak256-circom circuit, with Nova+CycleFold.
The main idea is to prove $z_n = H(H(...~H(H(H(z_0)))))$, where $n$ is the number of Keccak256 hashes ($H$) that we compute. Proving this in a 'normal' R1CS circuit for a large $n$ would be too costly, but with folding we can manage to prove it in a reasonable time span.
For more info about Sonobe, check out Sonobe's docs.
Assuming rust and circom have been installed:
./compile-circuit.shcargo test --release -- --nocapture