Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, p. 470 — the first-round lower bound of m accesses

Proved
ObliviousRAM.LowerBound.length_ge_m

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

access-patternlower-boundoblivious-ramp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix a hand capacity bbb, mmm balls and cells, and at least one request round. Let PPP be a correct oblivious randomized player. For any request sequence rrr and any run aaa that PPP performs with positive probability on rrr,

∣a∣≥m.|a|\ge m.∣a∣≥m.

This is the first component of the access lower bound: even a run serving one particular request must cover all initially occupied cells because its visible pattern is possible for every request sequence.

Formalization Note Correctness holds for every positive-probability run, and obliviousness is equality of visible-pattern distributions. The at-least-one-round condition makes the first-round observation applicable.

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

theorem length_ge_m {b m t : ℕ} (ht : 1 ≤ t) (P : ObliviousPlayer b m t)
    (r : Fin t → Fin m) (a : List (Action m)) (ha : a ∈ (P.play r).support) :
    m ≤ a.length := 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, first-round 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