Proving circuits with ZK - Circom 2 Documentation
After compiling the circuit and running the witness calculator with an appropriate input, we will have a file with extension .wtns that contains all the computed signals and, a file with extension .r1cs that contains the constraints describing the circuit. Both files will be used to create our proof.
Proving circuits After compiling the circuit and running the witness calculator with an appropriate input, we will have a file with extension .wtns that contains all the computed signals and, a file with extension .r1cs that contains the constraints describing the circuit. Both files will be used to create our proof. Now, we will use the snarkjs tool to generate and validate a proof for our input. In particular, using the multiplier2, we will prove that we are able to provide the two factors of the number 33 . That is, we will show that we know two integers a and b such that when we multiply t
related reading
- GitHub - iden3/snarkjs: zkSNARK implementation in JavaScript & WASM · GitHubgithub.com
- 0xPARC0xparc.org
- Collaborative zkSNARKseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Lecture 14: Zero knowledge proofsboazbarak.org
- Background in ZK - Circom 2 Documentationdocs.circom.io
- Circom Workshop 1 | ZK Learning Resourceslearn.0xparc.org
- BattleSnark: Learning zk-SNARK by building Battleshipkunalm.xyz
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- 370.pdfeprint.iacr.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Why and How zk-SNARK Works 1: Introduction & the Medium of a Proof | by Maksym | Mediummedium.com