p. 472 — every orbit enters a cycle within r steps
ProvedCarryRNG.SWB.periodic_after_rp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-number-generationsubtract-with-borrow
For every base , lags , and Method 1 seed , the state reached after steps is periodic under the same step map:
Equivalently, the initial transient has length at most . This is the paper’s explicit bound on when the periodic cycle begins; it includes the two trivial seeds.
Preamble
import Definitions.Def_CarryRNG_SWB_step
Formal statement
namespace CarryRNG.SWB
/-- Page 472: the orbit is strictly periodic after at most `r` steps. -/
theorem periodic_after_r (b : ℕ) (L : CarryRNG.AWC.Lags) (hb : 2 ≤ b) (z : CarryRNG.AWC.State b L.r) :
(step b L hb)^[L.r] z ∈ Function.periodicPts (step b L hb) := by sorry
end CarryRNG.SWB
Source
G. Marsaglia and A. Zaman, A new class of random number generators, Ann. Appl. Probab. 1 (1991), p. 472, Section 4.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.