SNARK¶
Description¶
Succinct Non-interactive ARguments of Knowledge. Tags proof systems that achieve sub-linear proof size and fast verification, often with a trusted setup.
Entries tagged¶
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018)
- Circom 2
- Circom2 Documentation
- Designated-Verifier Dynamic zk-SNARKs
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax)
- gnark Documentation (Consensys)
- Groth16
- Groth16 (Alin Tomescu)
- HONK
- HyperPlonk
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023)
- Hyrax
- LegoGroth16
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019)
- Libra
- Microsoft Spartan2
- On the Size of Pairing-Based Non-interactive Arguments (Groth16)
- Pinocchio
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013)
- PLONK
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020)
- QSP: Quadratic Span Programs and Succinct NIZKs without PCPs
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013)
- R1CS — Rank-1 Constraint System
- Sonic
- Sonic Reference Implementation (ebfull/sonic)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019)
- SP1
- Spartan
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020)
- TurboPLONK
- TurboPLONK Proposal (ZKProof Workshop 3)
- UltraHonk
- Understanding PLONK
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018)
- ZoKrates Documentation