Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6 — the protocol of Figure 3 has perfect completeness

Proved
GOSNIZK.CircuitSound.completeness

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

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

Let a homomorphic proof commitment scheme satisfy the homomorphic property and perfect completeness of the 0/1 proof. Then the Circuit SAT proof of Figure 3 has perfect completeness on keys of either mode: for every key ckckck output by KbindingK_{\mathrm{binding}}Kbinding​ or KhidingK_{\mathrm{hiding}}Khiding​, every NAND circuit CCC, every www with C(w)=1C(w)=1C(w)=1 and every choice of the prover's randomness,

V(ck, C, P(ck,C,w))=1.V\big(ck,\ C,\ P(ck,C,w)\big)=1.V(ck, C, P(ck,C,w))=1.

Completeness on hiding keys is the completeness clause of Theorem 11 (p. 16), which refers back to the proof of Theorem 6.

Formalization Note No order bound on M\mathcal MM is needed: for a satisfied gate the gate message wi+wj+2wk−2w_i+w_j+2w_k-2wi​+wj​+2wk​−2 equals wi⊕wj∈{0,1}w_i\oplus w_j\in\{0,1\}wi​⊕wj​∈{0,1} in every Z/NZ\mathbb Z/N\mathbb ZZ/NZ.

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

/-- Perfect completeness of the protocol of Figure 3 (Groth, Ostrovsky, Sahai, *New Techniques for
Noninteractive Zero-Knowledge*, J. ACM 59(3) (2012), authors' version of March 7, 2011, proof of
Theorem 6, pp. 14–15): it follows from the homomorphic property and the perfect completeness of the
0/1 proofs, and holds on keys of either mode. -/
theorem completeness {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)
    (hhom : S.Homomorphic) (hcomp01 : S.PerfectCompleteness01) :
    S.CircuitPerfectCompleteness := 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, pp. 14–15, proof of Theorem 6 (first paragraph); p. 16, Theorem 11
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