Home > Resources > papers > PHGR13-Pinocchio

Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013)

URL: https://eprint.iacr.org/2013/279.pdf

Summary

Pinocchio is the first practical pairing-based SNARK, reducing the cost of verifiable computation to near-practical levels. Introduces the QAP (Quadratic Arithmetic Program) framework for encoding computations, a trusted setup CRS, and sub-millisecond verification. Direct predecessor of Groth16 and the basis for Zcash's original Sprout circuit.

Used by

• Pinocchio

Related resources

• On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
• Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)