Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reveal-machine encoding simulates every ReciprocalTest step

Proved
CountingLLL.ReciprocalTest.reciprocal_reveal_simulates

by wcysai · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsprobability

For every machine entropy tape and every finite step count, the program-state component of the generic reveal-machine encoding of ReciprocalTest equals the state of the original small-step operational model. This establishes deterministic simulation only; preservation of the entropy law and freshness of the next queried coordinate remain separate.

Preamble
import Definitions.Def_CountingLLL_ReciprocalReveal
open CountingLLL.ReciprocalTest CountingLLL.RevealMachine
Formal statement
theorem CountingLLL.ReciprocalTest.reciprocal_reveal_simulates (ω : Entropy) (n : ℕ) :
    (CountingLLL.RevealMachine.run revealProgram (entropyCode ω) initial n).1 =
      CountingLLL.ReciprocalTest.run ω n := by sorry
Source
Liu, Wang, Yin, Zhang and Zhou, A Counting and Sampling Lovász Local Lemma, STOC #442, Algorithm 6, pp. 27–28, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/442.pdf

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