Every ReciprocalTest reveal-machine query is fresh
ProvedCountingLLL.ReciprocalTest.reciprocal_query_freshalgorithmsprobability
For every encoded input array and every step of the reveal-machine representation of ReciprocalTest, if the next atomic step queries an entropy coordinate, that coordinate is not among those read earlier. This holds for oracle bits, fair bits and finite-uniform draws. It is a pathwise freshness invariant; the input law and complete algorithm output remain separate.
Preamble
import Definitions.Def_CountingLLL_ReciprocalReveal open CountingLLL.ReciprocalTest CountingLLL.RevealMachine
Formal statement
theorem CountingLLL.ReciprocalTest.reciprocal_query_fresh (x : ReadIndex → ℕ) (n : ℕ) (a : ReadIndex)
(h : readIndex (CountingLLL.RevealMachine.run revealProgram x initial n).1 = some a) :
a ∉ (CountingLLL.RevealMachine.run revealProgram x initial n).2 := 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