Reveal-machine encoding simulates every ReciprocalTest step
ProvedCountingLLL.ReciprocalTest.reciprocal_reveal_simulatesalgorithmsprobability
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 sorrySource
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