CVE-2025-24802 Soundness issue with Plonky2 look up tables
A malicious prover can forge proofs for lookup tables not divisible by 26, bypassing cryptographic soundness in Plonky2 SNARKs.
- Exploited in the wild
- Not known
- Login needed
- Not needed
- Attackable
- Over the internet
- Victim action needed
- Not needed
- Fix
- Available
What is CVE-2025-24802?
CVE-2025-24802 is a high-severity vulnerability in 0xPolygonZero plonky2, published on 30 Jan 2025. An attacker can exploit it over the internet without logging in, with no action from the victim.
Official 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.
Weakness: CWE-1240
Which versions are affected by CVE-2025-24802?
2 open source packages ship an affected version, including plonky2.
| Package | Affected | Fixed in |
|---|---|---|
plonky2 crates.io | From 1.0.0 | 1.0.1 |
plonky2 crates.io | From 1.0.0 | 1.0.1 |
How do I fix CVE-2025-24802?
Upgrade plonky2 to 1.0.1 or later.
Is CVE-2025-24802 being exploited?
There is no known exploitation of CVE-2025-24802 in the wild and no public exploit code.
Sources
Also known as GHSA-hj49-h7fq-px5h.