Vulnerability in 0xpolygonzero Plonky2
CVE-2025-24802
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.
Published · last modified .
CVSS v3 metric
CVSS v3 base score 8.6 (High). Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:C/C:N/I:H/A:N.
EPSS exploit prediction
EPSS 0.003, 26.4th percentile (last changed ); unchanged over 30 days. About EPSS.
Affected products
- 0xpolygonzero Plonky2 — versions = 1.0.0
Weakness classification (CWE)
Public exploits and proof-of-concept code
Also mentioned in 1 other repository (DependencyTrack/vuln-db). These reference the CVE in a list, notes or a scanner and are not exploit code for it.