Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, p. 470 — every visible pattern serves every request sequence

Proved
ObliviousRAM.LowerBound.visible_satisfies_all

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

access-patternoblivious-ramp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let PPP be a correct oblivious randomized player for ttt rounds and mmm balls. If a run aaa occurs with positive probability for one request sequence rrr, then for every other request sequence r′r'r′ there is a positive-probability run a′a'a′ of PPP on r′r'r′ with the same visible cell sequence as aaa, and a′a'a′ satisfies r′r'r′:

∀r′, ∃a′∈supp⁡(P(r′)):V(a′)=V(a)anda′⊨r′.\forall r',\ \exists a'\in\operatorname{supp}(P(r')):\quad V(a')=V(a)\quad\text{and}\quad a'\models r'.∀r′, ∃a′∈supp(P(r′)):V(a′)=V(a)anda′⊨r′.

This gives the common visible pattern the capacity to serve all mtm^tmt possible request sequences.

Formalization Note The player may randomize and know the complete sequence. Obliviousness equates the full distributions of visible patterns, rather than only their supports.

Preamble
import Mathlib
import Definitions.Def_ObliviousRAM_LowerBound_Game
Formal statement
namespace ObliviousRAM.LowerBound

theorem visible_satisfies_all {b m t : ℕ} (P : ObliviousPlayer b m t)
    (r : Fin t → Fin m) (a : List (Action m)) (ha : a ∈ (P.play r).support)
    (r' : Fin t → Fin m) :
    ∃ a' ∈ (P.play r').support, visible a' = visible a ∧ Satisfies b a' r' := by sorry

end ObliviousRAM.LowerBound
Source
Goldreich and Ostrovsky, Software protection and simulation on oblivious RAMs, J. ACM 43 (1996), p. 470, §6, proof of THEOREM 6.1, obliviousness observation; https://doi.org/10.1145/233551.233553
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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