A new Lean tactic automates bitvector-finite field equivalence proofs and solves 19% more ZKP arithmetization benchmarks than state-of-the-art SMT solvers.
Certifying Zero-Knowledge Circuits with Refinement Types
1 Pith paper cite this work, alongside 9 external citations. Polarity classification is still indexing.
1
Pith paper citing it
9
external citations · Crossref
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automating Bitvector and Finite Field Equivalence Proofs in Lean
A new Lean tactic automates bitvector-finite field equivalence proofs and solves 19% more ZKP arithmetization benchmarks than state-of-the-art SMT solvers.