Disclaimer: This page summarizes a cryptographic research draft and later project documentation for education. It is not investment, security, or legal advice. Check the exact software version and configuration before relying on any implementation claim.
| Original paper | Original paper |
|---|---|
| Directories | Ethereum Whitepapers & Research |
Paper at a glance
| Authors | Polygon Zero Team |
|---|---|
| Document | “Plonky2: Fast Recursive Arguments with PLONK and FRI,” public draft dated September 7, 2022 |
| Project | Polygon Zero |
| Paper license | No paper license is stated in the draft. The code repository is separately dual-licensed under MIT or Apache 2.0. |
| Paper and code | Plonky2 draft in the official repository |
The paper is explicitly marked “DRAFT.” Its measurements are research results from the authors’ 2022 setup, while the later project blog and repository describe separate claims and implementation status. [1][2][3]
What Plonky2 is
Plonky2 is a recursive proof system that combines a PLONK-style arithmetization with FRI-based polynomial testing. PLONK-style constraints describe the computation being proved; FRI checks that committed evaluations behave like low-degree polynomials. The design targets fast proof composition without the pairing-based polynomial commitment setup used by some other SNARKs. The details still depend on the chosen field, hash function, security parameters, and software configuration. [1][2]
Recursion means a proof circuit can verify earlier proofs. A system can prove smaller pieces separately, then prove that a later computation correctly checked those earlier proofs. Repeating this can aggregate a large proof workload into a smaller final proof. This is different from Nova’s folding scheme: Plonky2 recursively verifies proofs, while Nova folds compatible computation instances. Neither design automatically means that a particular rollup is deployed or that every user input is private. [1]
Why the Goldilocks field matters
The paper uses the prime field with modulus 2^64 − 2^32 + 1, commonly called the Goldilocks field. Its elements fit in a 64-bit word, and the modulus was selected to make arithmetic and reduction efficient on ordinary processors. The paper also uses an extension field for parts of the protocol that need it for soundness. These choices help explain the prover-speed goal; they are not a universal claim that 64-bit arithmetic is as strong as every larger-field configuration. [1]
Security is configuration-dependent. The current repository says its defaults generally target about 100 bits of security, describes that FRI estimate as conjectural, and notes that the default Poseidon parameterization may be closer to 95 bits according to a cited analysis. Do not reuse the paper’s speed number while silently assuming a different security target or configuration. [3]
How to read the performance numbers
The 2022 draft reports about 300 milliseconds for a recursive proof on a 2021 MacBook Air under a speed-oriented configuration: a recursion threshold of 2^12 gates, codeword rate 1/8, and about 100 bits of conjectured security. Its size-oriented setting reports a proof of about 43 KB at codeword rate 1/256, taking about 11.6 seconds on the same laptop. The paper says the exact compressed size depends on the verifier’s random tape. Those are configuration-specific measurements, not fixed performance guarantees. [1]
Polygon’s launch blog separately reported a 170 ms recursive proof on a MacBook Pro and described it as roughly 100 times faster than its earlier comparison. That is a project benchmark with different stated hardware and potentially different settings; it should not be treated as a like-for-like independent comparison with the paper’s MacBook Air measurement. The blog also estimated Ethereum verifier gas costs, which were estimates at publication rather than current measured fees. [2]
Setup, privacy, and trade-offs
Using FRI avoids a trusted setup for the polynomial commitment step in the way KZG-based systems require a setup ceremony. That does not mean “no assumptions”: security still depends on the hash function, soundness analysis, field and extension-field parameters, and transcript construction. The paper contains a separate zero-knowledge section, but a system’s privacy depends on its full protocol and what it exposes as public input. The words SNARK or zero-knowledge in a project description do not establish that every application hides every input. [1][3]
Fast proving and small proofs are also different operating points. The draft’s speed-oriented setting is much faster but yields a larger proof than the size-oriented configuration. A developer must choose a configuration for the application’s prover resources, verifier cost, latency, and target security rather than assume a single Plonky2 number covers all of them. [1]
Current software status and a version-specific warning
The current Plonky2 repository says the project is being deprecated and will no longer receive updates or support, and recommends Plonky3 for new work. Its current README lists the code as dual-licensed under MIT or Apache 2.0; neither license should be attributed to the research draft unless a separate paper license is provided. [3]
The repository’s security advisory documents CVE-2025-24802: a soundness issue in version 1.0.0 for certain lookup tables whose length is not divisible by 26. The advisory says version 1.0.1 fixes the issue. This is a software-version flaw, not a finding that every Plonky2 version or the mathematical paper is broken. Anyone assessing a deployed system should identify its exact dependency version and lookup-table configuration, and verify the relevant fix. [4]
Plonky3 is related, but not the same system
Polygon presents Plonky3 as the next-generation proving toolkit. Its current repository describes a modular set of primitives, including FRI-based polynomial commitments, for constructing proving systems; it is not simply the same fixed Plonky2 protocol under a new name. Polygon’s 2024 announcement says Succinct Labs’ SP1 adopted Plonky3. That does not support the older claim that RISC Zero uses Plonky3, nor does it make Plonky3’s current status a property of the 2022 Plonky2 draft. [3][5]
Community Sentiment
An archived r/ethereum thread about Plonky2’s January 2022 announcement drew attention, but many visible comments focused on how dense the PLONK, FRI, SNARK, and STARK acronyms were; some readers asked for a simpler explanation. This small historical sample reflects interest mixed with an accessibility barrier. It is not a current opinion poll, a technical review, or evidence of adoption or security. [6]
Last updated: 2026-10
Related Terms
- Zero-Knowledge Proof — the broader category of cryptographic proofs that includes zero-knowledge systems.
- Recursive Proofs — the proof-composition approach Plonky2 uses.
- ZK-SNARK — a broader category of succinct proof systems.
See Also
- PLONK — the arithmetization family Plonky2 adapts.
- STARKs — background on transparent proof systems and FRI-related design choices.
- Nova — a distinct recursive-proof approach based on folding computation instances.
Sources
- Polygon Zero Team, “Plonky2: Fast Recursive Arguments with PLONK and FRI,” draft dated September 7, 2022 — primary source for the design, field, configurations, measurements, and stated draft status.
- Polygon Zero, “Introducing Plonky2” — project announcement and its separately reported MacBook Pro benchmark and Ethereum-verifier estimates.
- Polygon Zero, Plonky2 repository README — current deprecation notice, supported examples, security configuration notes, and code licenses.
- Polygon Zero, GHSA-hj49-h7fq-px5h / CVE-2025-24802 — affected 1.0.0 lookup-table configurations and the 1.0.1 fix.
- Polygon Labs, “Polygon Plonky3, the Next Generation of ZK Proving Systems, is Production Ready” — how the project distinguishes Plonky3 from Plonky2 and its stated SP1 integration.
- r/ethereum participants, discussion of the Plonky2 announcement, January 2022 — historical community context about interest and acronym-heavy explanations, not technical evidence.