Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 6.2.1 — compatibility and overlap with activation bits; the sampler (15) is uniform on Ri+\mathcal R^+_iRi+​

Proved
ITPIRPreproc.MatchVec.claim_6_2_1

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographymatching-vectorsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1private-information-retrieval

Let m=2hm=2^hm=2h with h≥3h\ge3h≥3, and let ua,va∈Z6du_a,v_a\in\mathbb Z_6^dua​,va​∈Z6d​ (a∈[m]a\in[m]a∈[m]) satisfy (7) with the vectors va mod 2v_a\bmod2va​mod2 pairwise distinct. Consider the key space R+=F2h×d×F2d\mathcal R^+=\mathbb F_2^{h\times d}\times\mathbb F_2^dR+=F2h×d​×F2d​ with S(R,ρ)={(a,Rva):a∈[m], ⟨ρ,va⟩2=1}S(R,\rho)=\{(a,Rv_a): a\in[m],\ \langle\rho,v_a\rangle_2=1\}S(R,ρ)={(a,Rva​):a∈[m], ⟨ρ,va​⟩2​=1} and Ri+\mathcal R^+_iRi+​ the keys compatible with iii. For every pair of distinct positions i=(a,b)i=(a,b)i=(a,b) and j=(a′,b′)j=(a',b')j=(a′,b′) in [m]×F2h[m]\times\mathbb F_2^h[m]×F2h​,

Pr⁡(R,ρ)←R+[i∈S(R,ρ)]=12m,Pr⁡(R,ρ)←Ri+[j∈S(R,ρ)]≤12m.\Pr_{(R,\rho)\leftarrow\mathcal R^+}[i\in S(R,\rho)]=\frac1{2m},\qquad \Pr_{(R,\rho)\leftarrow\mathcal R^+_i}[j\in S(R,\rho)]\le\frac1{2m}.(R,ρ)←R+Pr​[i∈S(R,ρ)]=2m1​,(R,ρ)←Ri+​Pr​[j∈S(R,ρ)]≤2m1​.

Moreover, if (R0,ρ0)←R+(R_0,\rho_0)\leftarrow\mathcal R^+(R0​,ρ0​)←R+ is uniform, the output of the sampler (15) is uniform on Ri+\mathcal R^+_iRi+​.

This is property (i) of Definition 4.1 for the activation-bit primitive: the first inequality of (3) holds with equality, and the overlap probability 1/(2m)1/(2m)1/(2m) is below the required 2/m2/m2/m.

Differences from the source:

  • encoding: probabilities over R ← R and R ← R_i; the sampler returns a uniform key from R_i → normalized counts (#R)⁻¹·#{…} and averages (#R_i)⁻¹·Σ_{R∈R_i}; the image law of the uniform R₀ under the sampler equals the uniform law on R_i; reason: uniform laws on finite sets; same probabilities
Preamble
import Mathlib
import Definitions.Def_ITPIRPreproc_MatchVec_ActivationPrimitive

open scoped ENNReal
Formal statement
namespace ITPIRPreproc.MatchVec

/-- Claim 6.2.1, printed p.22 (PDF p.24). For a matching-vector family (7) with distinct
`v_a mod 2`, `m = 2^h`, the key space `R⁺ = F₂^{h×d} × F₂^d` and the set (14): for distinct
positions `i, j`, `Pr_{(R,ρ)←R⁺}[i ∈ S(R, ρ)] = 1/(2m)` and `Pr_{(R,ρ)←R⁺_i}[j ∈ S(R, ρ)] ≤ 1/(2m)`;
the sampler (15) maps the uniform law on `R⁺` to the uniform law on `R⁺_i`. -/
theorem claim_6_2_1 (h d : ℕ) (u v : Fin (2 ^ h) → Fin d → ZMod 6) (hh : 3 ≤ h)
    (hmv : IsMVFamily (2 ^ h) d u v) :
    (∀ i j : Pos h, i ≠ j →
      (Fintype.card (ActKey h d) : ℝ≥0∞)⁻¹ * (actCompat v i).card = (2 * 2 ^ h : ℝ≥0∞)⁻¹ ∧
      avgOver (actCompat v i) (fun K => if actSel v K j then 1 else 0) ≤
        (2 * 2 ^ h : ℝ≥0∞)⁻¹) ∧
    ∀ (i : Pos h) (K : ActKey h d),
      (Fintype.card (ActKey h d) : ℝ≥0∞)⁻¹ *
          (Finset.univ.filter fun K₀ => actSampler u v i K₀ = K).card =
        if actSel v K i then ((actCompat v i).card : ℝ≥0∞)⁻¹ else 0 := by sorry

end ITPIRPreproc.MatchVec
Source
Jesko Dujmovic, Zhengnan Lai, Daniel Wichs, Nearly Optimal Information-Theoretic PIR with Client Preprocessing, STOC 2027 submission #572 (October 2026), Claim 6.2.1, printed p.22 (PDF p.24)
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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