A new Lean tactic automates bitvector-finite field equivalence proofs and solves 19% more ZKP arithmetization benchmarks than state-of-the-art SMT solvers.
MTZK: Testing and Exploring Bugs in Zero-Knowledge (ZK) Compilers
2 Pith papers cite this work, alongside 7 external citations. Polarity classification is still indexing.
2
Pith papers citing it
7
external citations · Crossref
years
2026 2verdicts
UNVERDICTED 2representative citing papers
zkCraft combines LLM-guided mutations with R1CS-aware localization and Violation IOP proofs to detect under- and over-constrained faults in zero-knowledge circuits while reducing solver queries.
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.
-
zkCraft: Prompt-Guided LLM as a Zero-Shot Mutation Pattern Oracle for TCCT-Powered ZK Fuzzing
zkCraft combines LLM-guided mutations with R1CS-aware localization and Violation IOP proofs to detect under- and over-constrained faults in zero-knowledge circuits while reducing solver queries.