Zero-Knowledge Proof Referencia
Referencia para interactive y non-interactive zero-knowledge proof sistemas y sus aplicaciones.
Core Properties
A zero-knowledge proof convinces a verifier of a statement's truth without revealing any information beyond validity. Completeness ensures honest provers convince honest verifiers. Soundness ensures cheating provers cannot convince verifiers of false statements. Zero-knowledge ensures the verifier learns nothing beyond the statement being true. The simulator paradigm formalizes the last property.
- completeness
- True statements accepted
- soundness
- False statements rejected
- zero-knowledge
- No info leaked
high probabilitynegligible cheatsimulator existsModern Systems
zk-SNARKs produce succinct, constant-size proofs with fast verification but require a trusted setup. zk-STARKs eliminate trusted setup and are post-quantum secure but have larger proofs. Bulletproofs enable efficient range proofs without setup. These systems underpin privacy coins and scalable rollups on blockchains. Groth16 remains the smallest known SNARK for arithmetic circuits.
- zk-SNARK
- Succinct, trusted setup
- zk-STARK
- No setup, post-quantum
- Bulletproof
- No setup range proofs
Groth16, PLONKlarger proofslogarithmic size