PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge

Paper identity: The IACR Cryptology ePrint Archive identifies PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge as paper 2019/953 by Ariel Gabizon, Zachary J. Williamson and Oana Ciobotaru. The archive records its receipt in 2019 and subsequent revisions. This summary describes that paper, not every later system that uses “PLONK” in its name.

What the Paper Contributes

PLONK is a zk-SNARK construction for arithmetic-circuit satisfiability. The paper presents a universal construction with succinct verification and an updatable structured reference string (SRS). Its main arithmetization idea evaluates polynomials over a multiplicative subgroup and uses a permutation argument to enforce copy constraints between circuit wires. This gives the prover and verifier a compact way to check that values that should be equal across gates are consistent.

The paper builds on earlier work on universal, updatable reference strings and compares its construction with Sonic. The authors report improvements for a specified fully succinct verification setting; the result is tied to the paper’s construction and comparison, not a benchmark guarantee for every implementation or circuit.

Universal and Updatable Setup

A universal SRS is prepared for circuits up to a chosen size bound and can then support multiple circuits within that bound. “Updatable” means participants can contribute new randomness to the SRS. The security argument relies on at least one contributor in the update sequence behaving honestly and destroying their secret randomness. This reduces dependence on trusting one named setup operator, but it is still a setup assumption; it is not a transparent, setup-free proof system.

The exact SRS format, supported circuit size, polynomial commitment scheme, cryptographic assumptions and update transcript are properties of a particular construction or implementation. A public ceremony for a different protocol does not automatically provide compatible parameters for a PLONK deployment.

Reading the Name Carefully

The title’s “permutations over Lagrange-bases” points to the paper’s representation of circuit constraints and permutation argument. The word “Oecumenical” is part of the paper’s title, not evidence that one set of parameters works without bounds for every circuit.

Many later protocols and implementations use PLONK-style arithmetization or related design ideas. They may change gates, lookup arguments, polynomial commitments, recursion, proof formats and setup assumptions. The original PLONK paper should not be used as a blanket source for performance, adoption, compatibility or security claims about every member of that later family.

Limitations and Assumptions

  • Universal setup is bounded by its configured circuit size, and this construction still relies on an updatable SRS assumption.
  • Security depends on the paper’s cryptographic assumptions and correct implementation of the proof system and polynomial commitments.
  • Proof size, prover time, verifier cost and supported features depend on the concrete implementation, circuit and parameters.
  • The name PLONK alone does not establish compatibility with Ethereum’s separate KZG ceremony or with any specific deployed system.

Related Terms

See Also

Sources