ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge

ePrint Report: ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge

Daniel Luick, John Kolesar, Timos Antonopoulos, William R. Harris, James Parker, Ruzica Piskac, Eran Tromer, Xiao Wang, Ning Luo

Verification of program safety is often reducible to proving the unsatisfiability (i.e., validity) of a formula in Satisfiability Modulo Theories (SMT): Boolean logic combined with theories that formalize arbitrary first-order fragments. Zero-knowledge (ZK) proofs allow SMT formulas to be validated without revealing the underlying formulas or their proofs to …

daniel eprint report james john knowledge program report safety smt verification wang zero knowledge