PLONK is a zero-knowledge proof system that uses polynomial commitments and a universal trusted setup. It is used to build succinct proofs for verifiable computation.
Semantic Classification
Content
- PLONK is a proof system that lets a prover convince a verifier that a computation was performed correctly while revealing nothing beyond its validity. It relies on polynomial commitments and a setup that can be reused across many circuits.
- The universal setup distinguishes PLONK from earlier systems that required a fresh setup for each circuit. PLONK and its variants are used in zero-knowledge rollups and other applications that need compact proofs of computation.