arxiv: 2603.11066 · v6 · submitted 2026-03-10 · 🧮 math.DS · cs.AI· cs.HC

Recognition: no theorem link

Exploring Collatz Dynamics with Human-LLM Collaboration

Edward Y. Chang

Authors on Pith no claims yet

Pith reviewed 2026-05-15 14:10 UTC · model grok-4.3

classification 🧮 math.DS cs.AIcs.HC

keywords Collatz conjectureSyracuse mapparadigm exhaustiondistributional convergencepointwise convergencetransfer operatordynamical systemsmathematical obstructions

0 comments

The pith

Every one of 29 mathematical paradigms hits an obstruction when trying to lift almost-all Collatz descent to descent for every orbit.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper applies 29 distinct frameworks, from transfer operators to S-unit equations and modular sieving, to the Syracuse map of the Collatz conjecture. It proves several unconditional statements about spectral gaps, cycle sizes, densities of divergent points, and language properties of sequences. At the same time it shows that none of these frameworks can convert the known distributional convergence into pointwise convergence for all starting values. The work therefore identifies the distributional-to-pointwise gap as the central structural barrier that blocks every tested approach from proving the full conjecture.

Core claim

The Paradigm Exhaustion Theorem states that every known framework for promoting distributional convergence (almost all orbits descend) to pointwise convergence (all orbits descend) encounters an irreducible structural obstruction when applied to the Syracuse map.

What carries the argument

The distributional-to-pointwise gap, proved equivalent to the divergence component, which blocks each of the 29 paradigms from establishing universal descent under the Syracuse map.

If this is right

The Syracuse transfer operator possesses a uniform spectral gap for all M, implying equidistribution modulo any power of 2.
Any nontrivial cycle of length L at least 3 satisfies D greater than 2 to the F, yielding ord_D of 2 greater than F and F plus 1 distinct residues mod D.
Divergent starting points have natural density 0 and Hausdorff dimension approximately 0.68.
The formal language of divergent-compatible v-sequences is not context-free.
Cylinder-averaged density-1 convergence holds unconditionally via spectral contraction on the invariant core I_2.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Any future proof of the full Collatz conjecture must either introduce a paradigm outside the surveyed set or directly resolve the distributional-to-pointwise gap.
The permanent nonempty modular sieve via the Mersenne Bypass indicates that sieving methods face lasting structural limits.
The combination of unconditional density-zero results with the exhaustion theorem narrows the possible locations of any hypothetical cycles or divergent orbits.

Load-bearing premise

The 29 selected paradigms are representative of all possible mathematical approaches that could bridge distributional convergence to pointwise convergence for the Syracuse map.

What would settle it

A new framework that successfully converts distributional convergence of Syracuse orbits into pointwise convergence for every starting point without meeting any of the listed obstructions.

Figures

Figures reproduced from arXiv: 2603.11066 by Edward Y. Chang.

**Figure 1.** Figure 1: Proof dependency diagram. Green nodes form the Route A core spine (linear chain), terminating at the Robustness Corollary; the red WMH node is the sole open hypothesis. Cyan nodes form the Route B spine (v5): Carry Contamination → cross-core alphabet → 2-adic expander → j≥5 bound → anti-correlation → scaling regime (βw≈1.80, computational evidence for j≥3); the CIC is the open hypothesis for this route. Vi… view at source ↗

**Figure 2.** Figure 2: The burst-gap decomposition of a Collatz orbit. Bursts (red) are maximal runs of [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

**Figure 3.** Figure 3: Architecture of the burst–gap conditional framework (Sections 4–6). Green boxes [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗

**Figure 4.** Figure 4: Known-Zone Decay for M = 12. The known zone Zk decreases by at least 2 per odd-to-odd step (generically 3 when a burst step occurs). The worst-case bound Zk ≤ M − 2k reaches zero after ⌈M/2⌉ = 6 odd-to-odd steps. Empirically, typical orbits in the tested residue classes (M ≤ 18) reach Zk = 0 in 1–3 steps. Remark 6.3 (Computational verification). For M = 12: the worst-case bound gives Zk = 0 after ⌈12/2⌉ = … view at source ↗

**Figure 5.** Figure 5: The phantom-cycle analysis. The four green boxes are proved unconditionally in [PITH_FULL_IMAGE:figures/full_fig_p026_5.png] view at source ↗

**Figure 6.** Figure 6: Landscape comparison with Tao [14]. Horizontal axis: structural depth of the analy [PITH_FULL_IMAGE:figures/full_fig_p122_6.png] view at source ↗

**Figure 7.** Figure 7: Touch growth on the bounded window [1, 1024]. Left: the number of touched values in [1, 1024] as the seed cap increases through S = 2k . Right: a heat strip showing the first exponent k for which each value n ∈ [1, 1024] is touched by some seed at most 2 k . The entire window is saturated by S = 1024, so the visually sparse inner region of the onion plot cannot be explained by missing low integers. D.1 Tou… view at source ↗

**Figure 8.** Figure 8: Exact first-passage diagnostics for the below-start criterion. Left: below-start traces [PITH_FULL_IMAGE:figures/full_fig_p198_8.png] view at source ↗

**Figure 9.** Figure 9: Syracuse chord diagram at depth m = 12 (2 11 = 2048 odd residue classes). Gray chords show the full map r 7→ T(r); coloured overlays highlight five phantom family shadows (Theorem 7.15). Each family σ = (k1, . . . , kℓ) occupies 2 m−K residue classes; families with positive log-drift ∆ = ℓ log2 3 − K > 0 (e.g. σ = (1, 1, 1), ∆ ≈ +1.75) are the expanding compositions whose phantom shadow gain is bounded by … view at source ↗

**Figure 10.** Figure 10: Orbit equidistribution evidence (Conjecture 8.2). Four Syracuse orbits with long [PITH_FULL_IMAGE:figures/full_fig_p232_10.png] view at source ↗

**Figure 11.** Figure 11: Syracuse chord structure at scale 2 32 and 2 64. Red chords: expanding steps (v2(3r+1) = 1, per-step gain log2 3 − 1 ≈ 0.585 bits); blue chords: contracting steps (v2 ≥ 2). The near 50–50 split is consistent with the identity E[k] = 2 per Syracuse step (Section 4), which underpins the contraction budget ε = 2−log2 3. The inner void corresponds to the known zone of small residues; the uniform angular filli… view at source ↗

read the original abstract

We present a comprehensive structural analysis of the Collatz conjecture through ~1014 computational experiments yielding 630 formal results. By systematically deploying 29 distinct mathematical paradigms--including transfer operator spectral theory, S-unit equations, p-adic interpolation, martingale methods, modular sieving, formal language theory, cascade algebra, discrete logarithm obstruction, and Diophantine approximation--we establish a Paradigm Exhaustion Theorem: every known framework for promoting distributional convergence ("almost all orbits descend") to pointwise convergence ("all orbits descend") encounters an irreducible structural obstruction when applied to the Syracuse map. On the unconditional side, we prove: (i) the Syracuse transfer operator has a uniform spectral gap for all M, implying equidistribution modulo any power of 2; (ii) any nontrivial cycle of length L satisfies D > 2^F for all L >= 3, giving ord_D(2) > F and F+1 distinct residues mod D; (iii) divergent starting points have natural density 0 and Hausdorff dimension ~0.68; (iv) the formal language of divergent-compatible v-sequences is not context-free; (v) cylinder-averaged density-1 convergence is proved unconditionally via spectral contraction on the invariant core I_2; (vi) a discrete logarithm triple filter achieves 100% cycle blockage for all L tested. We identify the Distributional-to-Pointwise Gap as the irreducible core and prove it equivalent to the divergence component. The modular sieve is permanently nonempty via the Mersenne Bypass. The present work is not a proof of the Collatz conjecture; it characterizes why the conjecture resists proof. The 29-paradigm exhaustion constitutes the most comprehensive structural survey of Collatz attack surfaces to date. Produced through human-LLM collaboration; see Section 12.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This Collatz survey maps proof barriers across 29 paradigms with some solid unconditional results, but the exhaustion theorem rests on an unverified claim that the list is complete.

read the letter

The main takeaway is a broad structural survey that applies many standard techniques to the Syracuse map and flags specific obstructions in each, while proving a few unconditional statements like a uniform spectral gap for the transfer operator and lower bounds on cycle sizes. Those unconditional pieces and the density-zero result for divergent orbits are the parts that stand on their own and could be cited or built on if the derivations check out. The computational volume and the framing of the distributional-to-pointwise gap as the central difficulty give a useful way to organize decades of Collatz work. The paper is explicit that it is not offering a proof, which keeps expectations realistic. The soft spot is the Paradigm Exhaustion Theorem. It asserts that every known framework hits an irreducible obstruction, yet the text supplies no meta-classification or enumeration argument showing that the 29 paradigms really cover all possible approaches. Without that, an unlisted method could slip through and the exhaustion claim would not hold. The 630 formal results from 10^14 experiments also need clearer verification details and error bounds to be fully convincing. This is for readers already working on Collatz or ergodic theory who want a consolidated map of tried approaches rather than a new proof. It is substantial enough to warrant referee time, even if the central theorem needs tightening on the completeness side. I would send it to peer review.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to deliver a structural analysis of the Collatz conjecture through ~10^14 computational experiments that produce 630 formal results. It applies 29 mathematical paradigms (transfer operators, S-unit equations, p-adic interpolation, martingales, modular sieving, formal languages, cascade algebra, discrete logarithms, Diophantine approximation, etc.) to the Syracuse map and establishes a Paradigm Exhaustion Theorem asserting that every known framework for lifting distributional convergence to pointwise convergence meets an irreducible obstruction. It also states several unconditional results: a uniform spectral gap for the transfer operator implying equidistribution mod 2^k; cycle length bounds D > 2^F; zero natural density and Hausdorff dimension ~0.68 for divergent orbits; non-context-freeness of the divergent-compatible language; cylinder-averaged density-1 convergence via spectral contraction; and 100% cycle blockage via a discrete-logarithm filter. The work identifies the distributional-to-pointwise gap as the core obstruction and presents itself as characterizing resistance to proof rather than proving the conjecture.

Significance. If the selection of the 29 paradigms can be shown to be exhaustive or the claim suitably qualified, the Paradigm Exhaustion Theorem would constitute a substantial contribution by mapping the landscape of obstructions across disparate techniques and isolating the distributional-to-pointwise gap as the persistent barrier. The listed unconditional results on spectral gaps, cycle bounds, densities, and formal-language properties would stand as concrete advances in the ergodic and arithmetic dynamics of the map. The scale of the computational survey is noteworthy and, if accompanied by verifiable error analysis, could supply useful empirical constraints.

major comments (2)

[Paradigm Exhaustion Theorem] Abstract and the section stating the Paradigm Exhaustion Theorem: the claim that the 29 paradigms exhaust 'every known framework' for bridging distributional to pointwise convergence is not supported by any meta-classification, enumeration argument, or completeness proof. This completeness assumption is load-bearing for the theorem, since an unlisted paradigm that evades the listed obstructions would falsify the exhaustion statement.
[Computational experiments and formal results] Abstract and the computational-results section: the assertion of 630 formal results derived from ~10^14 experiments lacks any reported error analysis, verification protocol, or demonstration that the obstructions are irreducible rather than artifacts of the chosen formulations. This directly affects the soundness of the individual paradigm applications that underwrite the exhaustion theorem.

minor comments (2)

[Section 12] Section 12: the description of the human-LLM collaboration would benefit from explicit protocols used to validate the 630 formal results and to guard against formulation bias in the paradigm obstructions.
[Notation] Notation for the invariant core I_2 and the Mersenne Bypass is introduced without a preceding definition or reference, reducing readability for readers outside the immediate Collatz literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. The report correctly identifies the load-bearing nature of the Paradigm Exhaustion Theorem and the need for greater transparency in the computational component. We address each major comment below and indicate the revisions that will be incorporated.

read point-by-point responses

Referee: Abstract and the section stating the Paradigm Exhaustion Theorem: the claim that the 29 paradigms exhaust 'every known framework' for bridging distributional to pointwise convergence is not supported by any meta-classification, enumeration argument, or completeness proof. This completeness assumption is load-bearing for the theorem, since an unlisted paradigm that evades the listed obstructions would falsify the exhaustion statement.

Authors: We acknowledge that the manuscript does not contain a formal meta-classification or completeness argument establishing that the 29 paradigms cover every conceivable framework. The selection was guided by a broad literature survey of techniques from ergodic theory, arithmetic dynamics, Diophantine approximation, and formal language theory that have historically been used to address convergence questions of this type. To address the referee's valid concern, we will revise the statement of the Paradigm Exhaustion Theorem to read that every one of the 29 examined paradigms encounters an irreducible obstruction, and that these paradigms constitute a representative survey of the principal known approaches rather than an exhaustive enumeration of all possible frameworks. This qualification removes the unsupported completeness claim while preserving the central observation that the distributional-to-pointwise gap persists across the surveyed methods. revision: partial
Referee: Abstract and the computational-results section: the assertion of 630 formal results derived from ~10^14 experiments lacks any reported error analysis, verification protocol, or demonstration that the obstructions are irreducible rather than artifacts of the chosen formulations. This directly affects the soundness of the individual paradigm applications that underwrite the exhaustion theorem.

Authors: We agree that explicit documentation of computational reliability is required. In the revised manuscript we will add a new subsection (Section 11.3) that details the verification protocol: (i) independent re-implementation of the core transfer-operator and cycle-search routines on a separate codebase for a 10^12-experiment subsample, (ii) cross-validation against known small-cycle enumerations and spectral-gap computations in the literature, (iii) floating-point precision bounds and statistical error estimates for all density and dimension calculations, and (iv) explicit discussion of why the obstructions derived in each paradigm are structural (arising from the form of the Syracuse map) rather than artifacts of particular formulations. These additions will directly support the soundness of the results that underwrite the exhaustion theorem. revision: yes

Circularity Check

1 steps flagged

Paradigm Exhaustion Theorem reduces to selection of 29 paradigms without completeness argument

specific steps

self definitional [Abstract]
"By systematically deploying 29 distinct mathematical paradigms--including transfer operator spectral theory, S-unit equations, p-adic interpolation, martingale methods, modular sieving, formal language theory, cascade algebra, discrete logarithm obstruction, and Diophantine approximation--we establish a Paradigm Exhaustion Theorem: every known framework for promoting distributional convergence (almost all orbits descend) to pointwise convergence (all orbits descend) encounters an irreducible structural obstruction when applied to the Syracuse map."

The theorem asserts that every known framework encounters an obstruction, yet the only evidence offered is the application of the 29 paradigms the paper itself selected. No separate argument shows these paradigms constitute the complete set of known frameworks; therefore 'known framework' is defined by the input list, and the exhaustion claim holds by construction of that list.

full rationale

The paper's central result is the Paradigm Exhaustion Theorem, obtained by applying 29 listed paradigms and identifying obstructions in each. No meta-classification, enumeration proof, or external reference is supplied to establish that these 29 exhaust all known frameworks capable of bridging distributional to pointwise convergence. Consequently the predicate 'every known framework' is coextensive with the authors' chosen list, making the theorem statement equivalent to the input selection. Independent unconditional results (spectral gap, cycle bounds, density statements) remain non-circular, so overall circularity is moderate rather than total.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim depends on the assumption that the 29 paradigms exhaust the relevant proof strategies and that the computational experiments correctly identify obstructions; no explicit free parameters or invented entities are named in the abstract, but the scale of computation implies many implicit modeling choices.

axioms (1)

domain assumption The 29 listed paradigms (transfer operator spectral theory, S-unit equations, p-adic interpolation, etc.) constitute a representative sample of all frameworks capable of bridging distributional to pointwise convergence.
Invoked in the statement of the Paradigm Exhaustion Theorem.

pith-pipeline@v0.9.0 · 5625 in / 1446 out tokens · 49543 ms · 2026-05-15T14:10:08.740083+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

48 extracted references · 48 canonical work pages · 1 internal anchor

[1]

R. R. Bahadur and R. Ranga Rao, On deviations of the sample mean,Ann. Math. Statist., 31(4):1015–1027, 1960

work page 1960
[2]

Barina, Convergence verification of the Collatz problem,J

D. Barina, Convergence verification of the Collatz problem,J. Supercomput., 77:2681–2688, 2021

work page 2021
[3]

E. Y. Chang, SagaLLM: a framework for structured human–LLM research collaboration, Preprint, 2025

work page 2025
[4]

E. Y. Chang, The one-bit reduction: sharpening the Collatz obstruction, Companion paper, 2026

work page 2026
[5]

Chowla,The Riemann Hypothesis and Hilbert’s Tenth Problem, Gordon and Breach, New York, 1965

S. Chowla,The Riemann Hypothesis and Hilbert’s Tenth Problem, Gordon and Breach, New York, 1965

work page 1965
[6]

Dembo and O

A. Dembo and O. Zeitouni,Large Deviations Techniques and Applications, 2nd edition, Springer, 1998

work page 1998
[7]

Kesten, Random difference equations and renewal theory for products of random ma- trices,Acta Math., 131:207–248, 1973

H. Kesten, Random difference equations and renewal theory for products of random ma- trices,Acta Math., 131:207–248, 1973

work page 1973
[8]

D. E. Knuth, Shock! Shock! A note on the Collatz landscape, Unpublished note, 2026

work page 2026
[9]

A. V. Kontorovich and S. J. Miller, Benford’s law, values ofL-functions and the3x+ 1 problem,Acta Arith., 120(3):269–297, 2005. 144

work page 2005
[10]

J. C. Lagarias, The3x+1problem and its generalizations,Amer. Math. Monthly, 92(1):3– 23, 1985

work page 1985
[11]

J. C. Lagarias, The3x+ 1problem: An annotated bibliography (1963–1999), arXiv:math/0309224, 2003

work page internal anchor Pith review Pith/arXiv arXiv 1963
[12]

E. Y. Chang,The Path to AGI, Volume 1, 2025

work page 2025
[13]

E. Y. Chang,The Path to AGI, Volume 2, 2025

work page 2025
[14]

Tao, Almost all orbits of the Collatz map attain almost bounded values,Forum Math

T. Tao, Almost all orbits of the Collatz map attain almost bounded values,Forum Math. Pi, 10:e12, 2022

work page 2022
[15]

Terras, A stopping time problem on the positive integers,Acta Arith., 30(3):241–252, 1976

R. Terras, A stopping time problem on the positive integers,Acta Arith., 30(3):241–252, 1976

work page 1976
[16]

Vervaat, On a stochastic difference equation and a representation of non-negative infinitely divisible random variables,Adv

W. Vervaat, On a stochastic difference equation and a representation of non-negative infinitely divisible random variables,Adv. Appl. Probab., 11(4):750–783, 1979

work page 1979
[17]

above-start

G. J. Wirsching,The Dynamical System Generated by the3n+ 1Function, Lecture Notes in Mathematics, vol. 1681, Springer, 1998. 145 A Modular ranking certificates via DAG analysis All exact distributional laws in this section and the next are modular or uniform-lift statements. Their transfer to deterministic orbit behavior requires additional orbitwise inpu...

work page 1998
[18]

There exists a functionϕ:V→Z≥0such thatϕ(v′)≤ϕ(v)−1for every edge(v,v′)∈E

work page
[19]

length of the longest directed path fromvto a sink

The LP with variables{xv}v∈V, constraintsxv′−xv≤−1for each edge(v,v′)∈E, and boundsx v≥0, is feasible. Moreover, whenGis a DAG, the functionϕ(v) =“length of the longest directed path fromvto a sink” is theminimalsuch ranking. Proof.(1)⇒(2): IfGis a DAG, a topological ordering exists. Defineϕ(v)as the length of the longest path fromvto any sink (vertex wit...

work page
[20]

Net-positive cycles are born atM= 10,11, and12, and die atM= 11,12, and13 respectively (via the carry parity obstruction)

work page
[21]

No net-positive cycle is born at anyM≥13

work page
[22]

drift-sustaining

The only cycle detected in the modular transition graph forM≥13(verified through M= 18) is the trivial length-1fixed pointr= 1withv 2 = 2and negative drift. A further structural observation constrains the possibility of net-positive cycle formation at highM: 149 Proposition A.13(Positive-drift subgraph acyclicity (computational)).For allMfrom10 through18,...

work page
[23]

Row sums are<1because many returns exitI r

˜Br, thesub-stochastic partial return kernel, whose(s,s′)-entry is the probability that one fiber-57return from residue classslands in classs ′while remaining insideIr. Row sums are<1because many returns exitI r. Known-gap Perron root:ρ(˜B2) = 129/1024 (aggregating gap-2and gap-5channels only). 2.P, therow-stochasticversion obtained by normalizing each ro...

work page
[24]

eventually incompatible

the returned quotient isq′= 9m+ 8, henceq′≡m(mod 8). In particular, whenmmod 8is uniform, the destinationq ′mod 8is exactly uniform. The chain map acts as aleft shiftin base8: the lowest digit ofq ′equals the second digit ofq. Afterrconsecutiveq≡7returns, allrlow base-8digits of the quotient have been replaced by higher-order digits originally above the d...

work page
[25]

a Ruffini reduction showing that the depth-2known-gap return kernel˜B2 has maximally degenerate spectrum, with finite-time rank-1collapse (§C.1)

work page
[26]

an unconditional boundρ(˜Bext 2 )≤5/32on thefullextended kernel, valid without any distributional assumption (§C.2)

work page
[27]

an exponential tail on the time to enterI2, derived from the27×27cylinder-averaged mod-64kernel (§C.3)

work page
[28]

an exact stationary massπ(I2) = 10121/65280≈0.15504, giving an unconditional orbit- level sum bound∑ c Pr(ER(c))≤0.011at the cylinder-averaged level (§C.4). The combined claim is acylinder-averagedunconditional TV summability, which upgrades Theorem 9.144 to an unconditional density-1convergence statement without relying on the spectator-bit loop. We do n...

work page
[29]

Proof.Direct symbolic computation using Ruffini’s synthetic-division rule on the5×5rational matrix from Proposition B.1

= 1for allk≥2. Proof.Direct symbolic computation using Ruffini’s synthetic-division rule on the5×5rational matrix from Proposition B.1. The trace identitytr(˜Bk

work page
[30]

no closed walk inThas positive average per-edge log-growth

= (129/1024)k fork= 1,2,3confirms the factorization and pins down the nilpotent part. Finite-time rank collapse to1follows from the Jordan form: the nilpotent block has size at most4but vanishes by the second power since the non-zero singular structure is concentrated on the single row corresponding to theq≡7 residue class. Remark C.2(Interpretation).Prop...

work page 2048
[31]

Hybrid sieve (density-based): insufficient density decay

work page
[32]

Pure density approach: cannot reach pointwise

work page
[33]

Minimum descent rate: tends to0

work page
[34]

Azuma-type concentration: rate insufficient

work page
[35]

Normal-number-like assumptions: circular

work page
[36]

Transfer matrix mod2M: positive-gain modular cycles exist for allM≥10

work page
[37]

Finite modular analysis: always insufficient at any fixedM

work page
[38]

9.k→k+ 4induction on BF depth: no orbit conjugacy (multiplicative, not conjugate structure)

Paired/blocked step analysis: worst-case gain is positive (+0.585L). 9.k→k+ 4induction on BF depth: no orbit conjugacy (multiplicative, not conjugate structure)

work page
[39]

Finite sieve on cumulative gain: holdout tree does not terminate

work page
[40]

almost all

Post-cascade height loss (ηapproach):η <0for all observed BF re-entries; orbitsgrow before re-entry, so the contractionk′≤(1 +α−(1 +α)η/6)k+O(1)withρ<1cannot hold. The surviving approaches are: (a) carry propagation depth bounds (proving3n+ 1carries preventO(logn)-lengthv= 1streaks); (b) ergodic theory (Collatz ergodicity with respect to a suitable measur...

work page
[41]

randomness

reveals that the BF encounter statistics areindistinguishablebetween the two populations: Statistic Post-cascade Generic Pr[max depth= 0] 99.0% 99.4% Pr[max depth= 1] 1.0% 0.56% Pr[max depth= 2] 0.03% 0.02% Pr[k′= 1|re-entry] 97.8% 97.4% Pr[k′= 2|re-entry] 2.2% 2.6% This shows that the AP structure of the post-cascade family isirrelevant: the BF re-entry ...

work page 1988
[42]

episodes,

and the maximum absolute deviation from1/16is below1%. Crucially, branch correlations cannot shiftE[v]below the contraction threshold: the impact is bounded by(2/2 K−1)·K, giving|∆E[v]|<0.22forK≥7, while the marginE[v]−log2 3≈0.42is nearly twice as large. The proof therefore doesnotrequire i.i.d. branches—onlyϕ-mixing with summable coef- ficients. Specifi...

work page 2020
[43]

randomness

No positive integer cycle exists for any non-descending word or compound non-descending word. 209 Table 22: Contribution attribution (Part 10 of 40): v7 — universalization, zero persistence, entropy injection, and Ising formalization. # Level Contribution Primary source 109 Critical Post-cascade universalization (Rem. C.36): BF encounter statistics for po...

work page
[44]

# Level Contribution Primary source 137 High Post-cascade convergence verifiedk≤200(P 200:1275bits)

an aperiodic exhaustion-residue sequence, 212 Table 26: Contribution attribution (Part 14 of 40): v7 — post-cascade structure, A-coordinate framework. # Level Contribution Primary source 137 High Post-cascade convergence verifiedk≤200(P 200:1275bits). De- terministic prefix (47 mod 64) is expansive (period10, ratio3.604). Convergence requires generic Coll...

work page
[45]

unbounded scale growth,

work page
[46]

near-critical behavior governed by Sturmian-typeβ-placement in the Core A regime,

work page
[47]

each_once

persistentcompatibilityofaffinecarrytransformationsacrosssuccessiveexhaustionrounds. Allsimplerescapemechanisms—periodicity, bounded-staterecurrence, combinatorialamplification— have been eliminated within the present framework. 213 Table 28: Contribution attribution (Part 16 of 40): v8 — coupling framework, noise indepen- dence, conditional proof complet...

work page 1988
[48]

275 cumulative results across 203 scripts

all confirm the random-model prediction while leaving the distributional-to-pointwise gap intact. 275 cumulative results across 203 scripts. v10.2 (April 19, 2026).Paradigmexhaustionandgrandsynthesis(Scripts172–181, Results234– 250). CF Structure of Threshold (Result 234): continued fraction oflog 2 3has large partial quotienta 9 = 23; Baker’s theorem yie...

work page 2026