Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge |
|---|---|
| What the text proposes | A SNARK with a universal and updatable structured reference string. One setup can serve many circuits. The proofs are larger than Groth16, and there is still a setup. |
| Who may write | Ariel Gabizon, Zachary J. Williamson and Oana Ciobotaru |
| What is settled | A permutation argument checks that wires are the same value in different gates. |
| Load-bearing assumption | PLONK is not a STARK. Transparency is a different property. |
| What this library says afterwards | A universal string does not audit the circuit. A wrong circuit is honestly proved. |
| Rights | Official external source only |