A new Lean tactic automates bitvector-finite field equivalence proofs and solves 19% more ZKP arithmetization benchmarks than state-of-the-art SMT solvers.
Theorem 2.Soundness: For any contextΓ, the bitvector translationΓ ′ pro- duced byto_Nandto_BVfromΓis valid if and only ifΓ ′ is valid
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.