# CVE-2025-24802

## Summary

- **CVE ID:** CVE-2025-24802
- **Severity:** HIGH
- **CVSS Score:** 8.6 (CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:C/C:N/I:H/A:N)
- **CWE:** CWE-1240
- **Published:** Jan 30, 2025
- **Last Modified:** Mar 12, 2026

## 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.

## Affected Products

- 0xPolygonZero — plonky2 (= 1.0.0)

## References

- [CNA](https://github.com/0xPolygonZero/plonky2/security/advisories/GHSA-hj49-h7fq-px5h)
- [CNA](https://github.com/0xPolygonZero/plonky2/commit/091047f7f10cae082716f3738ad59a583835f7b6)
- [CNA](https://github.com/0xPolygonZero/plonky2/blob/main/plonky2/src/plonk/prover.rs#L97)

## Exploitation Prediction (EPSS)

- **EPSS Score:** 0.32%
- **EPSS Percentile:** 24.8

---
_Exported from OnDuty AI Vulnerability Intelligence on 2026-09-10._