arnaucube 9964cf37e9 | 4 months ago | |
---|---|---|
circuit | 6 months ago | |
src | 4 months ago | |
.gitignore | 6 months ago | |
Cargo.toml | 6 months ago | |
README.md | 4 months ago | |
compile-circuit.sh | 7 months ago |
Repo showcasing usage of Sonobe with Arkworks and Circom circuits.
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.
Proves a chain of SHA256 hashes, using the arkworks/sha256 circuit, with Nova+CycleFold.
cargo test --release sha_chain -- --nocapture
Proves a chain of keccak256 hashes, using the vocdoni/keccak256-circom circuit, with Nova+CycleFold.
Assuming rust and circom have been installed:
./compile-circuit.sh
cargo test --release keccak_chain -- --nocapture
Note: the Circom variant currently has a bit of extra overhead since at each folding step it uses Circom witness generation to obtain the witness and then it imports it into the arkworks constraint system.