Lean formal verification library for Reed–Solomon proximity proofs
This project implements a mechanized theory of interactive oracle reductions and formalizes Reed–Solomon proximity gaps for the Ethereum Foundation Proximity Prize. It provides executable specifications, completeness and soundness proofs, and a pipeline to transform interactive protocols into non‑interactive arguments via BCS and Fiat‑Shamir transforms. Targeted at cryptographers and formal methods researchers, it offers a reusable, rigorously verified foundation for SNARK constructions. Compared to ad‑hoc proofs, it delivers fully machine‑checked guarantees, reducing human error in protocol design.
View on GitHub →elizaOS/proximityprize