Home > Resources > papers > Gro16-Groth16

On the Size of Pairing-Based Non-interactive Arguments (Groth16)

URL: https://eprint.iacr.org/2016/260.pdf

Summary

Presents Groth16, the most proof-size-efficient pairing-based SNARK known. Achieves constant proof size (3 group elements) and fast verification using a circuit-specific trusted setup. Groth16 is the most widely deployed SNARK in production systems (Zcash Sapling, Filecoin, Tornado Cash) due to its minimal proof size.

Used by

• Groth16

Related resources

• Groth16 (Alin Tomescu) (blog, 2024)
• LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
• Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)