Home > Resources
ZKP Resources¶
Curated external resources for Zero-Knowledge Proofs — 63 entries across papers, blogs, books, wikis, docs, and code repositories.
This file is auto-generated. Run devbox run summaries to update.
By Type¶
By Topic¶
By Type¶
Papers¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) | 2026 | Weijie Wang et al. | snark, non-interactive, applications |
| HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) | 2023 | Binyi Chen et al. | snark, arithmetization, lookup, linear-time-prover |
| Ligero: Lightweight Sublinear Arguments Without a Trusted Setup | 2022 | Scott Ames et al. | linear-time-prover, transparent, iop |
| ZKAttest: Ring and Group Signatures for Existing ECDSA Keys | 2022 | Gregor Seiler, Kasra Abbaszadeh, Azam Soleimanian | attestation, zkp, elliptic-curves, applications |
| ZKProof Sigma Protocol Proposal (Workshop 4) | 2021 | ZKProof Community | sigma, standard, non-interactive |
| Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) | 2020 | Heewon Chung et al. | transparent, range-proof, discrete-log, logarithmic |
| Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) | 2020 | Rishabh Bhadauria et al. | linear-time-prover, transparent, iop |
| Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) | 2020 | Ariel Gabizon, Zachary J. Williamson | lookup, arithmetization, snark |
| Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) | 2019 | Eli Ben-Sasson et al. | snark, transparent, iop, post-quantum |
| LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) | 2019 | Matteo Campanelli et al. | snark, commit-and-prove, composition, pairing |
| PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge | 2019 | Ariel Gabizon, Zachary J. Williamson, Oana Ciobotaru | snark, universal-setup, arithmetization |
| Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) | 2019 | Mary Maller et al. | snark, universal-setup, trusted-setup |
| Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) | 2019 | Srinath Setty | snark, transparent, iop |
| TurboPLONK Proposal (ZKProof Workshop 3) | 2019 | Ariel Gabizon, Zachary J. Williamson | standard, arithmetization, snark |
| Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) | 2018 | Eli Ben-Sasson et al. | stark, reed-solomon, iop, transparent, post-quantum |
| Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) | 2018 | Jens Groth et al. | snark, universal-setup, trusted-setup, foundational |
| Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) | 2017 | Benedikt Bünz et al. | snark, transparent, logarithmic, discrete-log, range-proof, commitment |
| Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) | 2017 | Riad S. Wahby et al. | snark, transparent, iop, scalable, commitment |
| Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) | 2017 | Scott Ames et al. | linear-time-prover, transparent, iop, reed-solomon |
| On the Size of Pairing-Based Non-interactive Arguments (Groth16) | 2016 | Jens Groth | snark, pairing, trusted-setup, foundational |
| Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) | 2013 | Bryan Parno et al. | snark, trusted-setup, foundational |
| Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) | 2012 | Rosario Gennaro et al. | snark, foundational, trusted-setup |
| Scalable Secure Multiparty Computation (Damgård-Ishai 2006) | 2006 | Ivan Damgård, Yuval Ishai | mpc, scalable, theory, linear-time-prover |
| On Sigma Protocols (Damgård) | 2004 | Ivan Damgård | sigma, interactive-proof, foundational, theory |
| Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) | 1999 | Jan Camenisch, Markus Michels | sigma, cryptography, discrete-log, range-proof |
| Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) | 1997 | Jan Camenisch, Markus Stadler | sigma, discrete-log, foundational, cryptography |
| Algebraic Methods for Interactive Proof Systems | 1992 | Carsten Lund et al. | zkp, interactive-proof, mathematics, foundational |
| Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) | 1991 | Torben Pryds Pedersen | commitment, cryptography, foundational, discrete-log |
| Non-Interactive Zero-Knowledge and Its Applications (BFM88) | 1988 | Manuel Blum, Paul Feldman, Silvio Micali | non-interactive, foundational, zkp, theory |
| How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) | 1986 | Amos Fiat, Adi Shamir | non-interactive, sigma, transformation, foundational |
| The Knowledge Complexity of Interactive Proof Systems (GMR85) | 1985 | Shafi Goldwasser, Silvio Micali, Charles Rackoff | interactive-proof, foundational, zkp, theory |
| Fast Probabilistic Algorithms for Verification of Polynomial Identities | 1980 | Jacob T. Schwartz | mathematics, foundational, information-theoretic |
Blogs & Explainers¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| A Deep Dive into Axiom's Halo2 Circuits | 2025 | Trail of Bits | circuit, implementations, explainer |
| Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines | 2024 | zkvm, implementations, overview, stark | |
| Groth16 (Alin Tomescu) | 2024 | Alin Tomescu | snark, pairing, trusted-setup, explainer |
| Noir's Circuit Backend | 2023 | JT Riley | circuit-dsl, prover-backend, explainer |
| PLONKish Arithmetization | 2022 | arithmetization, explainer, circuit | |
| Cryptographic Principles (Alin Tomescu) | 2021 | Alin Tomescu | zkp, cryptography, reference, elliptic-curves, pairing |
| Note: PLONK / TurboPLONK / UltraPLONK Family | 2021 | zkp, explainer | |
| Understanding PLONK | 2019 | Vitalik Buterin | snark, universal-setup, explainer |
| The Evolution of Zero Knowledge Proofs | 2018 | zkp, overview, history, learning |
Books¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| Proofs, Arguments, and Zero-Knowledge | 2023 | Justin Thaler | zkp, book, foundational, learning |
Wikis & Standards¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| ZKProof Wiki of Concrete ZKP Schemes | 2020 | zkp, overview, reference |
Documentation¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| DockNetwork Crypto Library Analysis | 2026 | eid-privacy project | library, implementations, sigma, commitment, eid |
| Ligetron Marketplace Documentation | 2024 | Ligetron | implementations, prover-backend |
| OpenVM Documentation | 2024 | Axiom / OpenVM Team | zkvm, implementations, stark, llvm |
| SP1 Documentation (Succinct Labs) | 2024 | Succinct Labs | zkvm, implementations, stark, llvm |
| RISC Zero Documentation | 2023 | RISC Zero | zkvm, implementations, stark, llvm |
| Noir Documentation | 2022 | Aztec / Noir Team | circuit-dsl, implementations |
| PLONKish Arithmetization — ZK Jargon | 2022 | arithmetization, reference, circuit | |
| R1CS Explainer (0xPARC / Circom) | 2022 | 0xPARC | arithmetization, learning, circuit |
| Circom2 Documentation | 2021 | iden3 / Circom Team | circuit-dsl, implementations, snark, wasm |
| gnark Documentation (Consensys) | 2021 | Consensys / gnark Team | go, library, implementations, snark |
| Halo2 Documentation (Zcash) | 2021 | Zcash / Electric Coin Company | implementations, circuit-dsl, arithmetization, transparent |
| STARK 101 — AIR Tutorial (StarkWare) | 2021 | StarkWare | stark, arithmetization, learning, tutorials |
| ZoKrates Documentation | 2018 | ZoKrates Team | circuit-dsl, implementations, snark |
Code & Repositories¶
| Resource | Year | Authors | Tags |
|---|---|---|---|
| AztecProtocol: Aztec Packages (UltraHONK Audit Scope) | 2023 | Aztec Protocol | prover-backend, implementations |
| Microsoft Crescent Credentials (Spartan-t256 Fork) | 2023 | Microsoft Research | eid, applications, elliptic-curves |
| Microsoft Spartan2 | 2022 | Microsoft Research | implementations, library, transparent, snark |
| noir-lang/noir — ACVM Repository | 2022 | Aztec / Noir Team | circuit-dsl, implementations, prover-backend |
| Microsoft Spartan — Commit History | 2020 | Srinath Setty, Microsoft Research | implementations, library, transparent |
| Microsoft Spartan (Original) | 2020 | Srinath Setty, Microsoft Research | implementations, library, transparent |
| Sonic Reference Implementation (ebfull/sonic) | 2019 | Sean Bowe | snark, implementations, library, universal-setup |
By Topic¶
applications¶
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) (paper, 2026)
- Microsoft Crescent Credentials (Spartan-t256 Fork) (code, 2023)
- ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (paper, 2022)
arithmetization¶
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- PLONKish Arithmetization (blog, 2022)
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- R1CS Explainer (0xPARC / Circom) (doc, 2022)
- Halo2 Documentation (Zcash) (doc, 2021)
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)
- TurboPLONK Proposal (ZKProof Workshop 3) (paper, 2019)
attestation¶
book¶
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
circuit¶
- A Deep Dive into Axiom's Halo2 Circuits (blog, 2025)
- PLONKish Arithmetization (blog, 2022)
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- R1CS Explainer (0xPARC / Circom) (doc, 2022)
circuit-dsl¶
- Noir's Circuit Backend (blog, 2023)
- Noir Documentation (doc, 2022)
- noir-lang/noir — ACVM Repository (code, 2022)
- Circom2 Documentation (doc, 2021)
- Halo2 Documentation (Zcash) (doc, 2021)
- ZoKrates Documentation (doc, 2018)
commit-and-prove¶
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
commitment¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
composition¶
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
cryptography¶
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
discrete-log¶
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
eid¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- Microsoft Crescent Credentials (Spartan-t256 Fork) (code, 2023)
elliptic-curves¶
- Microsoft Crescent Credentials (Spartan-t256 Fork) (code, 2023)
- ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (paper, 2022)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
explainer¶
- A Deep Dive into Axiom's Halo2 Circuits (blog, 2025)
- Groth16 (Alin Tomescu) (blog, 2024)
- Noir's Circuit Backend (blog, 2023)
- PLONKish Arithmetization (blog, 2022)
- Note: PLONK / TurboPLONK / UltraPLONK Family (blog, 2021)
- Understanding PLONK (blog, 2019)
foundational¶
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)
- On Sigma Protocols (Damgård) (paper, 2004)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing (Pedersen 1991) (paper, 1991)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities (paper, 1980)
go¶
- gnark Documentation (Consensys) (doc, 2021)
history¶
- The Evolution of Zero Knowledge Proofs (blog, 2018)
implementations¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- A Deep Dive into Axiom's Halo2 Circuits (blog, 2025)
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- Ligetron Marketplace Documentation (doc, 2024)
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- AztecProtocol: Aztec Packages (UltraHONK Audit Scope) (code, 2023)
- RISC Zero Documentation (doc, 2023)
- Microsoft Spartan2 (code, 2022)
- Noir Documentation (doc, 2022)
- noir-lang/noir — ACVM Repository (code, 2022)
- Circom2 Documentation (doc, 2021)
- gnark Documentation (Consensys) (doc, 2021)
- Halo2 Documentation (Zcash) (doc, 2021)
- Microsoft Spartan — Commit History (code, 2020)
- Microsoft Spartan (Original) (code, 2020)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
- ZoKrates Documentation (doc, 2018)
information-theoretic¶
interactive-proof¶
- On Sigma Protocols (Damgård) (paper, 2004)
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
iop¶
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (paper, 2022)
- Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) (paper, 2020)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) (paper, 2019)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
learning¶
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
- R1CS Explainer (0xPARC / Circom) (doc, 2022)
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
- The Evolution of Zero Knowledge Proofs (blog, 2018)
library¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- Microsoft Spartan2 (code, 2022)
- gnark Documentation (Consensys) (doc, 2021)
- Microsoft Spartan — Commit History (code, 2020)
- Microsoft Spartan (Original) (code, 2020)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
linear-time-prover¶
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (paper, 2022)
- Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) (paper, 2020)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
- Scalable Secure Multiparty Computation (Damgård-Ishai 2006) (paper, 2006)
llvm¶
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- RISC Zero Documentation (doc, 2023)
logarithmic¶
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
lookup¶
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
mathematics¶
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities (paper, 1980)
mpc¶
non-interactive¶
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) (paper, 2026)
- ZKProof Sigma Protocol Proposal (Workshop 4) (paper, 2021)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
overview¶
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- ZKProof Wiki of Concrete ZKP Schemes (wiki, 2020)
- The Evolution of Zero Knowledge Proofs (blog, 2018)
pairing¶
- Groth16 (Alin Tomescu) (blog, 2024)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
post-quantum¶
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
prover-backend¶
- Ligetron Marketplace Documentation (doc, 2024)
- AztecProtocol: Aztec Packages (UltraHONK Audit Scope) (code, 2023)
- Noir's Circuit Backend (blog, 2023)
- noir-lang/noir — ACVM Repository (code, 2022)
range-proof¶
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
reed-solomon¶
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
reference¶
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- ZKProof Wiki of Concrete ZKP Schemes (wiki, 2020)
scalable¶
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Scalable Secure Multiparty Computation (Damgård-Ishai 2006) (paper, 2006)
sigma¶
- DockNetwork Crypto Library Analysis (doc, 2026)
- ZKProof Sigma Protocol Proposal (Workshop 4) (paper, 2021)
- On Sigma Protocols (Damgård) (paper, 2004)
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999) (paper, 1999)
- Proof Systems for General Statements about Discrete Logarithms (Camenisch-Stadler 1997) (paper, 1997)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
snark¶
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026) (paper, 2026)
- Groth16 (Alin Tomescu) (blog, 2024)
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- Microsoft Spartan2 (code, 2022)
- Circom2 Documentation (doc, 2021)
- gnark Documentation (Consensys) (doc, 2021)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (paper, 2019)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) (paper, 2019)
- TurboPLONK Proposal (ZKProof Workshop 3) (paper, 2019)
- Understanding PLONK (blog, 2019)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
- ZoKrates Documentation (doc, 2018)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)
standard¶
- ZKProof Sigma Protocol Proposal (Workshop 4) (paper, 2021)
- TurboPLONK Proposal (ZKProof Workshop 3) (paper, 2019)
stark¶
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- RISC Zero Documentation (doc, 2023)
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
theory¶
- Scalable Secure Multiparty Computation (Damgård-Ishai 2006) (paper, 2006)
- On Sigma Protocols (Damgård) (paper, 2004)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
transformation¶
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir) (paper, 1986)
transparent¶
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (paper, 2022)
- Microsoft Spartan2 (code, 2022)
- Halo2 Documentation (Zcash) (doc, 2021)
- Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger (Chung et al. 2020) (paper, 2020)
- Ligero++: A New Optimized Sublinear IOP (Bhadauria et al. 2020) (paper, 2020)
- Microsoft Spartan — Commit History (code, 2020)
- Microsoft Spartan (Original) (code, 2020)
- Aurora: Transparent Succinct Arguments for R1CS (Ben-Sasson et al. 2019) (paper, 2019)
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup (Setty 2020) (paper, 2019)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) (paper, 2018)
- Bulletproofs: Short Proofs for Confidential Transactions and More (Bünz et al. 2018) (paper, 2017)
- Doubly-Efficient zkSNARKs Without Trusted Setup (Hyrax) (paper, 2017)
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (Ames et al. 2017) (paper, 2017)
trusted-setup¶
- Groth16 (Alin Tomescu) (blog, 2024)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (paper, 2019)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
- On the Size of Pairing-Based Non-interactive Arguments (Groth16) (paper, 2016)
- Pinocchio: Nearly Practical Verifiable Computation (Parno et al. 2013) (paper, 2013)
- Quadratic Span Programs and Succinct NIZKs without PCPs (GGPR 2013) (paper, 2012)
tutorials¶
- STARK 101 — AIR Tutorial (StarkWare) (doc, 2021)
universal-setup¶
- PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge (paper, 2019)
- Sonic Reference Implementation (ebfull/sonic) (code, 2019)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (paper, 2019)
- Understanding PLONK (blog, 2019)
- Updatable and Universal Common Reference Strings with Applications to zk-SNARKs (Groth et al. 2018) (paper, 2018)
wasm¶
- Circom2 Documentation (doc, 2021)
zkp¶
- Proofs, Arguments, and Zero-Knowledge (book, 2023)
- ZKAttest: Ring and Group Signatures for Existing ECDSA Keys (paper, 2022)
- Cryptographic Principles (Alin Tomescu) (blog, 2021)
- Note: PLONK / TurboPLONK / UltraPLONK Family (blog, 2021)
- ZKProof Wiki of Concrete ZKP Schemes (wiki, 2020)
- The Evolution of Zero Knowledge Proofs (blog, 2018)
- Algebraic Methods for Interactive Proof Systems (paper, 1992)
- Non-Interactive Zero-Knowledge and Its Applications (BFM88) (paper, 1988)
- The Knowledge Complexity of Interactive Proof Systems (GMR85) (paper, 1985)
zkvm¶
- Comparative Analysis of SP1 and RISC Zero Zero-Knowledge Virtual Machines (blog, 2024)
- OpenVM Documentation (doc, 2024)
- SP1 Documentation (Succinct Labs) (doc, 2024)
- RISC Zero Documentation (doc, 2023)