Home > Resources > papers > GWC19-PLONK
PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge¶
Summary¶
Introduces PLONK, a universal and updatable zkSNARK that avoids circuit-specific trusted setups. Uses a permutation argument over Lagrange bases to encode copy constraints, enabling a single powers-of-tau ceremony for all circuits of bounded size. PLONK is the foundation of TurboPLONK, UltraPLONK, Halo2, and the entire PLONK family.
Used by¶
Related resources¶
- Halo2 Documentation (Zcash) (doc, 2021)
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates (Chen et al. 2023) (paper, 2023)
- LegoSNARK: Modular Design and Composition of Efficient Zero-Knowledge Proofs (Campanelli et al. 2019) (paper, 2019)
- Note: PLONK / TurboPLONK / UltraPLONK Family (blog, 2021)
- PLONKish Arithmetization (blog, 2022)
- PLONKish Arithmetization — ZK Jargon (doc, 2022)
- Plookup: A Simplified Polynomial Protocol for Lookup Tables (Gabizon-Williamson 2020) (paper, 2020)
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings (Maller et al. 2019) (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)