CVE-2025-24802
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.
Scoring
- Severity
- HIGH
- CVSS base score
- 8.6
- CVSS vector
- CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:C/C:N/I:H/A:N
- EPSS probability
- 0.32%
- CWE
- CWE-1240
- Published
- 2025-01-30
- Last modified
- 2026-03-12
Affected products
- 0xPolygonZero plonky2
Weakness type
Related vulnerabilities
- CVE-2025-68833 — HCL Hive is affected by use of a cryptographic primitive with a risky implementation
- CVE-2026-21751 — HCL Hive is affected by use of a cryptographic primitive with a risky implementation
- CVE-2026-50303 — Windows Key Guard Security Feature Bypass Vulnerability
- CVE-2026-46654 — Plonky3 MultiField32Challenger: transcript malleability and challenge entropy loss
- CVE-2026-44410 — Function Abusement Vulnerability in ZTE ZXUniPOS NDS-LTE
- CVE-2025-64647 — Multiple Vulnerabilities in IBM Concert Software
- CVE-2026-27017 — uTLS has a Chrome Parrot Fingerprint Vulnerability due to GREASE ECH Cipher Suite Mismatch
- CVE-2025-62514 — `libparsec_crypto` does not check for weak order point of curve 25519