Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 (exact part) — the Circuit SAT proof is perfectly complete, perfectly sound and a perfect proof of knowledge

Proved
GOSNIZK.CircuitSound.theorem_6

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

circuit-satcryptographyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1zero-knowledge

Let (Kbinding,Khiding,com,Topen,P01,V01)(K_{\mathrm{binding}},K_{\mathrm{hiding}},\mathrm{com},\mathrm{Topen},P_{01},V_{01})(Kbinding​,Khiding​,com,Topen,P01​,V01​) be a homomorphic proof commitment scheme whose message space M\mathcal MM is cyclic of order N≥4N\ge4N≥4, with the homomorphic property, perfect binding, and perfectly complete and perfectly sound proofs that a commitment contains 000 or 111. Then the Circuit SAT proof (K,P,V)(K,P,V)(K,P,V) of Figure 3, with common reference string σ=ck\sigma=ckσ=ck for (ck,xk)←Kbinding(ck,xk)\leftarrow K_{\mathrm{binding}}(ck,xk)←Kbinding​:

  1. has perfect completeness, on keys output by KbindingK_{\mathrm{binding}}Kbinding​ and on keys output by KhidingK_{\mathrm{hiding}}Khiding​;
  2. has perfect soundness: on every key output by KbindingK_{\mathrm{binding}}Kbinding​, no proof for an unsatisfiable circuit is accepted;
  3. is a perfect proof of knowledge if the scheme also has perfect extractability: on every (ck,xk)(ck,xk)(ck,xk) output by KbindingK_{\mathrm{binding}}Kbinding​, the wires wi=[Extxk(ci)=1]w_i=[\mathrm{Ext}_{xk}(c_i)=1]wi​=[Extxk​(ci​)=1] extracted from any accepted proof satisfy the circuit.
completeness ∧ soundness ∧ (perfect extractability⇒perfect knowledge extraction).\text{completeness}\ \wedge\ \text{soundness}\ \wedge\ \big(\text{perfect extractability}\Rightarrow\text{perfect knowledge extraction}\big).completeness ∧ soundness ∧ (perfect extractability⇒perfect knowledge extraction).

Theorem 6 is the paper's NIZK proof for Circuit SAT; instantiated with the commitments of Sections 4 and 5 it gives the perfectly sound NIZK proofs for Circuit SAT of Corollaries 9 and 10.

Formalization Note Only the exact clauses of Theorem 6 are stated. "Computational zero-knowledge" and "computational non-erasure zero-knowledge" are dropped: they rest on the computational indistinguishability of binding and hiding keys; their exact core, perfect zero-knowledge on hiding keys (Lemma 8), is a separate mission. Every "for all adversaries, Pr⁡=1\Pr=1Pr=1 / Pr⁡=0\Pr=0Pr=0" is stated for every key in the support of the generator and every choice of the adversary. Perfect completeness is stated on keys of both modes; on binding keys it is Theorem 6's, on hiding keys Theorem 11's. M\mathcal MM is ZMod N and 4 ≤ N is the paper's restriction on p. 14 ("we focus on the case where the message space ... has order at least 4").

Preamble
import Mathlib
import Definitions.Def_GOSNIZK_CircuitSound_Protocol
Formal statement
namespace GOSNIZK.CircuitSound

/-- Theorem 6, exact part (Groth, Ostrovsky, Sahai, *New Techniques for Noninteractive
Zero-Knowledge*, J. ACM 59(3) (2012), authors' version of March 7, 2011, p. 14). For a homomorphic
proof commitment scheme with message space of order at least 4, perfect binding, and perfectly
complete and perfectly sound 0/1 proofs, the protocol of Figure 3 has perfect completeness (on keys
of either mode) and perfect soundness; if the scheme also has perfect extractability, it is a
perfect proof of knowledge. The computational zero-knowledge clauses are not formalized. -/
theorem theorem_6 {N : ℕ} {R C CK XK TK Rp Prf : Type} [AddCommGroup R] [Fintype R] [CommGroup C] [Fintype C]
    [Fintype Rp] [Nonempty Rp] (S : Scheme N R C CK XK TK Rp Prf)
    (hN : 4 ≤ N) (hhom : S.Homomorphic) (hbind : S.PerfectBinding)
    (hcomp01 : S.PerfectCompleteness01) (hsound01 : S.PerfectSoundness01) :
    S.CircuitPerfectCompleteness ∧ S.CircuitPerfectSoundness ∧
      (S.PerfectExtractability → S.CircuitPerfectKnowledgeExtraction) := by sorry

end GOSNIZK.CircuitSound
Source
Groth, Ostrovsky, Sahai, New Techniques for Noninteractive Zero-Knowledge, J. ACM 59(3) (2012), authors' version of March 7, 2011, p. 14, Theorem 6 (exact part: perfect completeness, perfect soundness, perfect proof of knowledge)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me