PlonK Proof System

Algorithm

PlonK, standing for Permutations over Lagrange-bases for Oecumenical Non-interactive arguments of Knowledge, represents a succinct non-interactive argument of knowledge (SNARK) employed to validate computations. Its architecture facilitates proving the correctness of a computation without revealing the computation itself, a critical feature for privacy-preserving applications within decentralized systems. The system’s efficiency stems from its use of polynomial commitments and permutation arguments, enabling faster proof generation and verification times compared to earlier SNARK constructions. This algorithmic approach is particularly relevant for scaling layer-2 solutions on blockchains, reducing on-chain data requirements and transaction costs.