CVE-2025-24802HIGH 8.6EPSS p21.1%
CVE-2025-24802CVE-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.
Scoring
| CVSS 3.1 | 8.6 (HIGH) |
| Vector | CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:C/C:N/I:H/A:N |
| EPSS | 0.30% probability of exploitation · percentile 21.1% · 2026-06-19T12:03:05Z |
| Published | 2025-01-30 |
| Last modified | 2026-04-15 |
Underlying weaknesses· 1
References
1
| Type | Target | Confidence | Tier |
|---|---|---|---|
| Weakness | Use of a Cryptographic Primitive with a Risky Implementationcwe-1240 | 0% | live |
Related by meaning· 6
Nearest entities by semantic similarity across the cs-graph corpus.