Zk-SNARK
A zk-SNARK is a zero-knowledge, succinct, non-interactive argument of knowledge that enables efficient verification of a prover’s knowledge of a computation’s secret witness without revealing it.
Real-World Cryptography
A zero-knowledge succinct non-interactive argument of knowledge that lets a prover demonstrate knowledge of a computation's secret witness with a short proof that can be checked efficiently.
- How it is used
- Deploys succinct non-interactive proofs to validate outsourced or partially hidden program executions.
- How deep it goes
- Explains polynomial relations, arithmetic constraints, random-point checking, and setup risks without detailing a complete construction.
- Examples
- Uses outsourced computation, solvable Sudoku, polynomial roots, and a branching arithmetic function as teaching examples.
- What you can do after
- Evaluate/understand when succinct proofs fit a use case and recognize polynomial translation, verification, and setup tradeoffs.
Elliptic Curve Cryptography for Developers
A zk-SNARK is a zero-knowledge SNARK that proves knowledge of a witness without revealing the witness.
- How it is used
- Establishes private knowledge claims with compact, noninteractive proofs that verify quickly.
- How deep it goes
- Develops QAP gates, wires, interpolant functions, CRS setup, proof generation, and verification through a five-program implementation.
- Examples
- Uses Ali Baba’s cave and four C programs for QAP construction, CRS generation, proof creation, and verification.
- What you can do after
- Evaluate/understand how a QAP, CRS, witness, proof, and verification equation form a zk-SNARK workflow.
Read how Elliptic Curve Cryptography for Developers explains zk-SNARK →
Related concepts
- bilinear pairinguses · A bilinear pairing is a map from two groups into a third group that preserves the group operation in each argument separately.
- trusted setupused by · A trusted setup is a cryptographic parameter-generation process that creates public evaluation parameters from secret randomness and requires that randomness to be destroyed or kept unknown.
- proof of knowledgekind of · A proof of knowledge is a cryptographic proof in which a prover demonstrates knowledge of a witness satisfying a specified statement.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.