CVE-2025-24802
Description
Plonky2 is a SNARK implementation based on techniques from PLONK and FRI. Lookup tables, whose length is not divisible by 26 = floor(num_routed_wires / 3) always include the 0 -> 0 input-output pair. Thus a malicious prover can always prove that f(0) = 0 for any lookup table f (unless its length happens to be divisible by 26). The cause of problem is that the LookupTableGate-s are padded with zeros. A workaround from the user side is to extend the table (by repeating some entries) so that its length becomes divisible by 26. This vulnerability is fixed in 1.0.1.
Affected packages
Versions sourced from the GitHub Security Advisory.
| Package | Affected versions | Patched versions |
|---|---|---|
plonky2crates.io | >= 1.0.0, < 1.0.1 | 1.0.1 |
Patches
1091047f7f10cVulnerability mechanics
Generated by null/stub on May 9, 2026. Inputs: CWE entries + fix-commit diffs from this CVE's patches. Citations validated against bundle.
References
5- github.com/advisories/GHSA-hj49-h7fq-px5hghsaADVISORY
- nvd.nist.gov/vuln/detail/CVE-2025-24802ghsaADVISORY
- github.com/0xPolygonZero/plonky2/blob/main/plonky2/src/plonk/prover.rsnvdWEB
- github.com/0xPolygonZero/plonky2/commit/091047f7f10cae082716f3738ad59a583835f7b6nvdWEB
- github.com/0xPolygonZero/plonky2/security/advisories/GHSA-hj49-h7fq-px5hnvdWEB
News mentions
0No linked articles in our index yet.