Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6, §C.3.1, p. 41 — bookend products reduce to (∏α)·s*(∏A)t* and (∏α′)·⟨s*′,t*′⟩

Proved
GGHRSW.ColoredMatrix.bookend_identity

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

cryptographylinear-algebraobfuscationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ppp be prime and BPBPBP a length-nnn branching program, and fix any sample of RNDp(BP)\mathcal{RND}_p(BP)RNDp​(BP). For every choice of bits b1,…,bnb_1,\dots,b_nb1​,…,bn​,

s~(∏i=1nD~i,bi)t~=(∏i∈[n]αi,bi)⋅s∗(∏i∈[n]Ai,bi)t∗\tilde{\mathbf s}\Big(\prod_{i=1}^n \tilde D_{i,b_i}\Big)\tilde{\mathbf t} = \Big(\prod_{i\in[n]}\alpha_{i,b_i}\Big)\cdot \mathbf s^*\Big(\prod_{i\in[n]}A_{i,b_i}\Big)\mathbf t^*s~(i=1∏n​D~i,bi​​)t~=(i∈[n]∏​αi,bi​​)⋅s∗(i∈[n]∏​Ai,bi​​)t∗

and

s~′(∏i=1nD~i,bi′)t~′=(∏i∈[n]αi,bi′)⋅⟨s∗′,t∗′⟩.\tilde{\mathbf s}'\Big(\prod_{i=1}^n \tilde D'_{i,b_i}\Big)\tilde{\mathbf t}' = \Big(\prod_{i\in[n]}\alpha'_{i,b_i}\Big)\cdot \langle \mathbf s^{*\prime},\mathbf t^{*\prime}\rangle .s~′(i=1∏n​D~i,bi​′​)t~′=(i∈[n]∏​αi,bi​′​)⋅⟨s∗′,t∗′⟩.

Here the products of matrices are taken in step order and Ai,bA_{i,b}Ai,b​ denotes the 5×55\times55×5 permutation matrix.

The randomizing matrices RiR_iRi​ cancel, and the zero patterns of s\mathbf ss and t\mathbf tt remove every random diagonal entry, so the value of a 1×11\times11×1 "bookend" product depends only on the bundling scalars, the permutation matrices and the 5-vectors. This is the starting point of the analysis of mixed-input attacks in the proof of Theorem 6.

Formalization Note. Steps are 0-based in Lean; the identity is stated for every sample, as the page's "corresponds to" is a deterministic identity.

Preamble
import Mathlib
import Definitions.Def_GGHRSW_ColoredMatrix_Model
Formal statement
namespace GGHRSW.ColoredMatrix

open Matrix

theorem bookend_identity (p : ℕ) [Fact p.Prime] (bp : BP) (ω : Sample p bp)
    (b : Fin bp.n → Bool) :
    (sTil ω * (List.ofFn fun i => DTil ω i (b i)).prod * tTil ω) 0 0 =
        (∏ i, alpha bp ω.γ i (b i)) *
          (ω.sStar ⬝ᵥ
            ((List.ofFn fun i => (bp.A i (b i)).permMatrix (ZMod p)).prod *ᵥ ω.tStar)) ∧
      (s'Til ω * (List.ofFn fun i => D'Til ω i (b i)).prod * t'Til ω) 0 0 =
        (∏ i, alpha' bp ω.γ i (b i)) * (ω.s'Star ⬝ᵥ ω.t'Star) := by sorry

end GGHRSW.ColoredMatrix
Source
Garg, Gentry, Halevi, Raykova, Sahai and Waters, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, SIAM J. Comput. 45(3), 2016 (authors' version of July 21, 2013), p. 41, proof of Theorem 6, §C.3.1, case LC = 0 and RC = n + 2, second paragraph
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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