MOTOCROSS — WHAT EXACTLY BLOCKS THE ADAPTIVE FRONTIER?
25 October2026. Exact bounded CPU only; no network writes/GPU/SYMBIOSE.

MAIN SAFE LEMMA: CONTRACTING SOURCE CYLINDERS HAVE ONLY FINITE EXCEPTIONS
At a validated shortcut-word node write original source n=c*t+d and current
state x=a*t+b, t an integer>=L, c>0. The exact endpoint descent guard is
(a-c)*t+(b-d)<0. If a<c, every t>floor((b-d)/(c-a)) descends at this endpoint;
all survivors are the FINITE interval
L<=t<=floor((b-d)/(c-a)). In original source coordinates these survivors satisfy
n<=T=(c*b-a*d)/(c-a). The threshold is independent of any declared upper input
bound N. The strict boundary stays in the surviving set. For a validated
first-coefficient-contraction word (a_j>=c_j at earlier prefixes), all earlier
positive states exceed the source, so the certified endpoint clock is the exact
first actual descent. With a>=c and a genuine parity word, the positive
intercept rules out descent at THIS endpoint. In our first-coefficient scanner
every earlier prefix also has slope>=1, so all those sources survive the whole
prefix. An unbounded retained interval then remains unbounded; a finite interval
inherited from an earlier constraint stays finite even if the new slope grows.
No size-independent contracting tail can yet be emitted from this endpoint.

This is the classical affine stopping-sieve contract, not a new theorem about
Collatz. In particular a<c alone is NOT silently identified with actual descent:
the finite exceptional interval must be computed and checked.

BOUNDED UNIFORM FRONTIER DEMONSTRATION
frontier_scan.py builds first-coefficient-contraction branches, starting from
all positive odd sources>=3. Contracting leaves emit a uniform tail plus all
finite source exceptions. At depth20 it visited63461 symbolic nodes, found4403
contracting leaves and27328 still-noncontracting classes modulo2^20. Refined to
that common modulus,496960 of524288 odd classes descend uniformly. Every
contracting leaf had EMPTY positive exception interval, so this is also an exact
bounded coefficient-stopping-time verification through length20. It is not an
all-length statement. The covered odd-source density is496960/524288, about
94.7876percent; measure shrinking does not imply the residual is empty.

Table depth : nodes / contracting leaves / surviving odd classes / all odd classes
2 :3 /1 /1 /2
4 :9 /2 /3 /8
8 :65 /14 /19 /128
12 :563 /56 /226 /2048
16 :5807 /790 /2114 /32768
20 :63461 /4403 /27328 /524288

The common-depth measure is checked exactly by summing2^(D-k) over contracting
leaves and adding surviving depthD classes. A separate ballot-style dynamic
program counts parity words whose every prefix has3^(odd count)>=2^(length),
matching every survivor count.2500 distant source lifts, including quotient
shifts2^64, were directly replayed.

INDEPENDENT EXHAUSTIVE UNIFORM-LIFT AUDIT
common_residue_verify.py does NOT import the tree generator. It runs each of
the524288 odd residues modulo2^20 at its smallest allowed source>1 (for residue1,
that source is1048577), finds the first coefficient drop or reachesdepth20,
and checks the actual first-descent clock. It independently finds496960 closed
and27328 open classes, using2745688 actual shortcut transitions. In a closed
class the derivative of the endpoint map with respect to the source is<1;
therefore descent at its least allowed representative implies descent at ALL
larger lifts of that common-depth class. Every earlier prefix has slope>=1 and
positive intercept, so no earlier drop was missed. This is how finite exact
arithmetic certifies these infinite tails, rather than merely checking n<2^20.

WHAT STILL DOES NOT CLOSE
All remaining branches in this demonstration have not yet had a coefficient
contraction. Their finite word may itself force arbitrary long growth. The
all-ones parity class n=2^20-1 mod2^20 is one explicit surviving branch, with
current coefficients a=3^20=3486784401,b=a-1,c=1048576,d=c-1.
For every fixed depthD the analogous positive source2^D-1 survives, but the
source changes withD. The nested 2-adic limit is-1, not a positive integer.
Thus neither a nonempty frontier at every depth nor a rapidly shrinking density
proves the existence or absence of one positive infinite survivor.

For finite-range trees, once a frontier leaf has one candidate integer left,
cardinality-based splitting has no decreasing rank left to spend. Following
that singleton is still the real Collatz question for that source. A finite
exception set is an honest separate obligation, not automatic termination.

PRIOR-ART / CONJECTURE WARNING
An initial finite exploration found first coefficient contraction matching actual
first descent for499999 oddn<1m. The parent identified this as the classical
Coefficient Stopping Time conjecture (Terras/Garner); no universal inference was
made, and it must NOT be promoted to a theorem. The uniform depth20 audit above
is likewise a finite certificate only. The parent supplied the standard
bibliography pointer https://websites.umich.edu/~lagarias/doc/3x%2B1bib.pdf,
entry69, and Garner Proc.AMS82(1981),19-22; this worker did not independently
browse those sources and makes no exact quotation or full prior-art audit claim.

USE / NEXT STEP
The useful output is a two-kind frontier contract: contract-and-emit a uniform
large-source tail, retaining a fully explicit finite exception interval; or
keep a genuinely noncontracting cylinder open. A proof that every positive
source eventually leaves the second kind, plus verified handling of every
finite exception, would close this mechanism. We have not proved either global
obligation. These files may serve as an implementation cross-check; a new
standalone mathematical paper is not justified by this classical sieve exercise.

REPLAY
python frontier_scan.py
python common_residue_verify.py
Both are bounded; default depths are at most20. All jobs have finished.
