CVE-2025-24802
Soundness issue with Plonky2 look up tables
- State
- Published
- Severity
- 8.6 High
- Published
- Jan 30, 2025
- Updated
- Jan 30, 2025
- Reserved
- Jan 23, 2025
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.
Scores
| CVSS | Score | Vector | Source |
|---|---|---|---|
| 3.1 | 8.6 High | CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:C/C:N/I:H/A:N | GitHub_M |
Weaknesses
- CWE-1240 Use of a Cryptographic Primitive with a Risky Implementation
Affected Products
| Product | Versions |
|---|---|
plonky20xPolygonZero |
|
References
Every record here comes from the CVE Program’s CVE List. © 1999–2026 The MITRE Corporation. CVE is a registered trademark of The MITRE Corporation. The records are reproduced under the CVE Program terms of use.