Security Lunch ⛄ Ed. — Wednesday, Feb 18th, 2026, 12:00 pm @ CoDa E160
Automating Verification of ZKP Arithmetizations in Lean
Elizaveta Pertseva
Can't make it in person? Join us on
zoom.
See our past & upcoming events on our
website!
Abstract:
Many modern Zero-Knowledge Proof (ZKP) systems rely on arithmetizations to encode machine level (bitvector) arithmetic as finite field operations. The correctness of these arithmetizations is crucial for soundness, but constructing
them can be error-prone. Existing verification workflows are either manual, requiring substantial human effort, or rely on SMT solvers, which scale poorly on these problems. In this talk, I will discuss existing verification tools and present our novel automated
Lean-based approach that uses type translation to enable more scalable and trustworthy verification of ZKP arithmetizations.
Bio:
Elizaveta Pertseva is a 3rd year PhD at Stanford advised by Clark Barrett. Her research focuses on automatically formally verifying cryptographic primitives.