Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim B.1.2, p. A:44 — the GGG admitting a good SG⊆SS_G\subseteq SSG​⊆S number at most B⋅2−cK1−7δB\cdot2^{-cK^{1-7\delta}}B⋅2−cK1−7δ

Proved
ObfImpossibility.PseudoOracle.claim_B_1_2

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

compression-argumentcountingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pseudorandomness

There is δ0>0\delta_0>0δ0​>0 such that for every 0<δ≤δ00<\delta\le\delta_00<δ≤δ0​ there are c>0c>0c>0 and K0K_0K0​ with the following property. Let K≥K0K\ge K_0K≥K0​, L≥K2L\ge K^2L≥K2, let DDD make at most KδK^\deltaKδ oracle queries, and let S⊆[K]S\subseteq[K]S⊆[K] have ⌊K1−5δ⌋\lfloor K^{1-5\delta}\rfloor⌊K1−5δ⌋ elements. Let BBB be the number of injective functions [K]→[L][K]\to[L][K]→[L]. Then the number of injective G:[K]→[L]G:[K]\to[L]G:[K]→[L] for which some SGS_GSG​ satisfies Properties (1)–(3) of Claim B.1.1 (with this SSS and γ=K−3δ\gamma=K^{-3\delta}γ=K−3δ) is at most

B⋅2−c K1−7δ.B\cdot 2^{-c\,K^{1-7\delta}} .B⋅2−cK1−7δ.

The paper states this as a description length: every such GGG "can be uniquely described by (log⁡B)−Ω(K1−7δ)(\log B)-\Omega(K^{1-7\delta})(logB)−Ω(K1−7δ) bits given DDD". A set whose members each have a distinct description of at most mmm bits has at most 2m+12^{m+1}2m+1 members, so the counting form is equivalent up to the constant ccc. It is the compression step of the Gennaro–Trevisan style argument: the set SGS_GSG​, the values of GGG off SGS_GSG​, one sign bit and the image T=G(SG)T=G(S_G)T=G(SG​), which inequality (9) confines to a small fraction of the candidates, determine GGG.

Formalization Note The paper states the claim for the set G′\mathcal G'G′ of Claim B.1.1; since every G∈G′G\in\mathcal G'G∈G′ admits a good SG⊆SS_G\subseteq SSG​⊆S, the bound here covers G′\mathcal G'G′. The existence of δ0\delta_0δ0​ renders the paper's "for a sufficiently small δ\deltaδ, whose value is implicit in the proof"; ccc depends only on δ\deltaδ and K0K_0K0​ only on δ\deltaδ and ccc. Property (1) is read as ∣SG∣≥(1−γ)∣S∣|S_G|\ge(1-\gamma)|S|∣SG​∣≥(1−γ)∣S∣.

Preamble
import Mathlib
import Definitions.Def_ObfImpossibility_PseudoOracle_Setting
Formal statement
namespace ObfImpossibility.PseudoOracle

open Classical in
/-- Claim B.1.2, p. A:44, counting form: for every sufficiently small `δ > 0` there is
`c > 0` such that for all large `K`, all `L ≥ K²`, every `D` making at most `K^δ` queries
and every `S ⊆ [K]` of size `⌊K^{1-5δ}⌋`, the injective `G : [K] → [L]` that admit a set
`S_G ⊆ S` with Properties (1)–(3) of Claim B.1.1 number at most `B · 2^{-c K^{1-7δ}}`,
where `B` is the number of injective functions `[K] → [L]` ("each such `G` is described by
`log B - Ω(K^{1-7δ})` bits given `D`"). -/
theorem claim_B_1_2 :
    ∃ δ₀ : ℝ, 0 < δ₀ ∧ ∀ δ : ℝ, 0 < δ → δ ≤ δ₀ → ∃ c : ℝ, 0 < c ∧ ∃ K₀ : ℕ,
      ∀ K L : ℕ, K₀ ≤ K → K ^ 2 ≤ L →
        ∀ D : Fin L → QTree K L, (∀ y, ((D y).depth : ℝ) ≤ (K : ℝ) ^ δ) →
          ∀ S : Finset (Fin K), S.card = ⌊(K : ℝ) ^ (1 - 5 * δ)⌋₊ →
            ((Finset.univ.filter fun G : Fin K ↪ Fin L =>
                ∃ SG : Finset (Fin K), GoodSubset D δ S G SG).card : ℝ) ≤
              (Fintype.card (Fin K ↪ Fin L) : ℝ) *
                (2 : ℝ) ^ (-(c * (K : ℝ) ^ (1 - 7 * δ))) := by sorry

end ObfImpossibility.PseudoOracle
Source
Barak et al., On the (Im)possibility of Obfuscating Programs, J. ACM 59(2) (2012), author's copy, p. A:44, Appendix B, Claim B.1.2 (counting form; proof on pp. A:44–A:45)
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