CVE-2025-24802 is a high-severity (CVSS 8.6) CWE-1240 vulnerability in plonky2. A fix is available for plonky2 — see the affected versions and patch details below.
Soundness issue with Plonky2 look up tables
Exploitation Status
No confirmed exploitation observed yet
- CISA assesses this as automatable — exploitation doesn’t require manual, per-target effort, which raises the odds of mass scanning and opportunistic attacks.
- CISA’s own triage has not observed active exploitation or public proof-of-concept code for this CVE as of its last assessment.
Exploitation and automatability from CISA’s SSVC triage for CVE-2025-24802.
EPSS Exploitation Probability
Probability of exploitation in the next 30 days, from FIRST.org EPSS.
How urgent is this, really
Where this sits among everything scored
Real-World Exposure
plonky2Real-time download stats are indexed for npm and PyPI packages. This vulnerability affects crates.io packages — download data is not available via public APIs for these ecosystems.
Description
Impact
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.
The fix is done by padding with an existing table pair, similarly to LookupGate.
A workaround from the user side is to extend the table (by repeating some entries) so that its length becomes divisible by 26.
Fortunately, the seemingly most common use case, namely, hash functions with table-based sbox-es, are not vulnerable:
- both Monolith's and Tip5/Tip4's s-box tables already map 0 to 0;
- more generally, forcing several (0,0) pairs inside such a hash function appears to be a too strong restriction to find an otherwise valid trace.
A malicious prover exploiting this could cheat a circuit which statement is the following:
- output
x + f(x)for some private inputx, wheref(x) := 100 - xis implemented by a lookup table.
A malicious prover would be able to convince an honest verifier that they know an 0 <= x < 64 such that x + (100 - x) = 0.
Patches
Yes, upgrade to v1.0.1
Workarounds
No
References
Affected Packages
| Ecosystem | Package | Vulnerable range | Fix |
|---|---|---|---|
| 🦀crates.io | plonky2 | ≥ 1.0.0&&< 1.0.1 | 1.0.1cargo update -p plonky2 --precise 1.0.1 |
Detection & mitigation playbook
Open-source dependencyDetect
Scan your dependency tree (package-lock.json, pnpm-lock.yaml, requirements.txt, go.sum, etc.) for plonky2, including transitive dependencies — a direct dependency you never call can still pull in a vulnerable version.
Fix
Update plonky2 to 1.0.1 or later, then make sure no transitive (indirect) dependency still pins the vulnerable range — O3 confirms CVE-2025-24802 is resolved across your whole dependency graph.
Workarounds
If you can't upgrade right away: gate or disable the affected feature, validate untrusted input at the boundary, and avoid passing attacker-controlled data into the vulnerable path. O3's runtime protection blocks exploitation in production as an interim safeguard until the upgrade lands.
Frequently Asked Questions
Is CVE-2025-24802 in your dependencies?
Find it across crates.io, including transitive dependencies.