Home > Resources > papers > Set19-Spartan
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020)¶
Summary¶
Presents Spartan, a transparent zkSNARK for R1CS that achieves the fastest known prover for general-purpose zero-knowledge proofs without a trusted setup. Combines a sum-check-based R1CS satisfiability argument with a polynomial commitment scheme. Published at CRYPTO 2020; the basis for the Microsoft Spartan and Spartan2 libraries.
Used by¶
Related resources¶
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Microsoft Spartan (Original) (code, 2020)
- Microsoft Spartan2 (code, 2022)