Privacy-preserving computation and blockchain scaling
Zero-Knowledge Proofs allow one party (the prover) to prove to another (the verifier) that a statement is true, without revealing any information beyond the validity of the statement itself.
If the statement is true, an honest prover can convince an honest verifier
If the statement is false, no cheating prover can convince the verifier
The verifier learns nothing except that the statement is true
Succinct Non-interactive Arguments of Knowledge
Constant-size proofs, requires trusted setup
Pros
Cons
Scalable Transparent Arguments of Knowledge
No trusted setup, quantum-resistant
Pros
Cons
Short Non-interactive Zero-knowledge Proofs
No trusted setup, logarithmic proof size
Pros
Cons
Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge
Universal trusted setup, flexible
Pros
Cons
Circuit compiler for ZK
JavaScript ZK library
Rust ZK ecosystem
ZK proving system
DSL for ZK circuits
TypeScript ZK framework