Home > Resources > papers > GGPR12-QSP-SNARK

Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013)

URL: https://eprint.iacr.org/2012/215

Summary

Introduces Quadratic Span Programs (QSPs) as an algebraic characterization of NP that avoids PCPs, enabling the construction of efficient SNARKs. This work directly precedes Pinocchio and is one of the foundational papers establishing the QAP/R1CS-based SNARK paradigm.

Used by

• QSP-GGPR13

Related resources

• Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
• R1CS Explainer (0xPARC / Circom) (doc, 2022)