zkPi: Proving Lean Theorems in Zero-Knowledge

ePrint Report: zkPi: Proving Lean Theorems in Zero-Knowledge

Evan Laufer, Alex Ozdemir, Dan Boneh

Interactive theorem provers (ITPs), such as Lean and Coq, can express
formal proofs for a large category of theorems, from abstract math to
software correctness. Consider Alice who has a Lean proof for some
public statement $T$. Alice wants to convince the world that she has
such a proof, without revealing the actual proof. Perhaps the proof
shows that a secret program is correct or safe, …

alex alice can correctness dan eprint report evan express knowledge large lean math proof public report software statement