CVE-2025-24802
Plonky2 is a SNARK implementation based on techniques from PLONK …
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.
What to do now
- Check your exposureFind out whether the affected software runs anywhere in your environment, including systems of suppliers.
- UpdateInstall the version in which the vendor fixed the vulnerability. The references lead to the advisory.
- Limit access until thenIf you cannot update at once, take the system off the internet or restrict who can reach it.
References
- github.com/0xPolygonZero/plonky2/blob/main/plonky2/src/plonk/prover.rs#L97
- github.com/0xPolygonZero/plonky2/commit/091047f7f10cae082716f3738ad59a583835f7b6
- github.com/0xPolygonZero/plonky2/security/advisories/GHSA-hj49-h7fq-px5h
- nvd.nist.gov/vuln/detail/CVE-2025-24802
- github.com/advisories/GHSA-hj49-h7fq-px5h
- nvd.nist.gov/vuln/detail/CVE-2025-24802
- cve.org/CVERecord?id=CVE-2025-24802
Data: CVE list and the NVD. This product uses data from the NVD API but is not endorsed or certified by the NVD.