MOTOCROSS — LAYERED TRANSFERS AND WHAT GROWTH DEBT MEASURES
25 October2026. CPU only. No API writes, GPU, paid compute, SYMBIOSE or children.

RESULT
No global ceiling established. Parent/Pina supplied an actual C=4*initialbits
counterexample; I independently replayed it and quantified what the debt
contains. The useful wildcard translation is positive triangular layers and
order-dependent source resonance, not physical destructive interference.

1. EXACT LAYER ALGEBRA
For accelerated odd Collatz U_e(x)=(3x+1)/2^e, use homogeneous transfer
 M_e=[[3,1],[0,2^e]].
A word w of k steps and total exponent S has
 M_w=[[3^k,C_w],[0,2^S]], C_w>0,
and endpoint(3^k*x+C_w)/2^S.
For w followed by v,
 C_(wv)=3^|v|*C_w+2^S_w*C_v.
Every actual affine correction contributes positively. Reordering layers does
not change k,S, or final debtD=2k-S. It changes C_w, exact source residue and
prefix debt maximum. Thus there is no direct analogue of destructive optical
phase interference that simply cancels the forward correction or erases debt.
Comparing two orderings may yield a signed difference, but that comparison is
not the evolution of either actual trajectory. A signed/complex representation
would need its own independently proved invariant before importing optics.

The exact word cylinder is one residue r modulo2^(S+1):
 r=(2^S-C_w)*(3^k)^(-1) mod2^(S+1).
Any useful 'resonance' against a source-bit debt bound must make this positive
representative exceptionally small while maintaining every no-descent prefix.
A small matrix remainder or endpoint by itself is not that condition.

2. ORDERING CONTROLS
All1680 orderings of three exponents1, three2 and three3 have k9,S18,Dfinal0.
Exact replay showed prefix debt maxima ranging0..3. Their smallest positive
source representatives above1 vary from619 to523951. The endpoint order is
therefore not a proxy for transient debt or source precision. These are finite
algebra/cylinder controls, not a counterexample to any global ceiling.

For arbitrary L>=1, the words1^L,(L+2) and their reversals both end at debt0,
but their maximum prefix debts areL and0 respectively. Exact controls checked
L1,2,4,8,16,32,64. The first family requires increasingly large source precision;
it does NOT establish a C4 ceiling violation. It only disproves replacing the
prefix maximum by the final net debt when a large block is compiled.

3. DEBT IS NOT SIMPLY CURRENT HEIGHT
For actual odd states x0=n,...,xk with total division exponent S,
 xk/n=(3^k/2^S)*product_(j<k)(1+1/(3xj)).
Equivalently
 2^D=(4/3)^k*(xk/n)/product_(j<k)(1+1/(3xj)),
 D=(2-log2(3))*k+log2(xk/n)-sumlog2(1+1/(3xj)).
Thus D contains a time baseline plus current-height displacement minus the
positive additive correction. A bounded current excursion alone does not
boundD independently of elapsed time. This is a classical exact product
identity, not a new stopping theorem.

4. INDEPENDENT REPLAY OF THE PARENT/PINA C4 COUNTEREXAMPLE
n=12235060455, bitlength34, proposed ceiling136.
First violation: k313,S489,D137,xk1670671127879.
At a pit-stop endpoint: k316,S493,D139,xk2819257528297.
Maximum before descent: D148 at k332,S516,xk14467214613905.
First actual odd descent: k345. Every earlier integer state was>=n.
See COUNTER_LAYER_PROFILE.json, produced by exact integer replay after parent
sent the candidate. This worker did not discover the source.

At the first violation the current height is only between136 and137 times the
source (between7 and8 extra bits). The time factor(4/3)^313 is between2^129
and2^130. The correction product is less than1+10^-8. These latter facts have
an exact rational/integer check in counter_profile.py: under no descent,
 product<= (1+1/(3n))^k <=3n/(3n-k), when k<3n.
The second inequality follows by bounding binomial coefficients by k^j and
the resulting finite sum by the infinite geometric sum.
So the high debt is primarily long-time accumulation, not a gigantic height
relative to the original source. This explains why an amplitude-only thin-film
intuition misses the required resource.

5. BOUNDED SEARCH THAT DID NOT FIND THE COUNTEREXAMPLE
The preregistered inverse-beam route seeded known small long trajectories,
followed exact predecessors(2^a*y-1)/3 with a1..10, depth18,width300,
per-candidate cap500 odd steps and total candidate cap150000. It visited18006
distinct candidates and24936 actual odd steps, no cap exhaustion and no C4
violation. Best ratio stayed20/5 at27. This negative bounded result did not
justify extrapolating C4 and was superseded by the independently supplied
larger explicit witness. Retained in LAYER_CHECKS.json, including all limits.

One implementation assertion initially used an incorrect fixed multiset
{1:4,2:3,3:2} while asking for net debt0; its true debt is2. The check failed.
It was corrected to the intended balanced multiset{1:3,2:3,3:3} before any
reported result. No failed assertion or unsuccessful search was hidden.

PRIOR ART / SCOPE
Affine positive matrices, exact valuation cylinders and the product identity
are classical. The per-period distance-consumption ceiling is being handled
by the parent and already overlaps the previously read paper15. These layer
calculations alone do not justify a separate new research paper. No external
novelty claim or universal growth bound is made. A useful sharing contribution
would be the actual source-size counterexample and the exact interface warning.

REPRODUCE
python layers.py
python counter_profile.py
All calculations bounded, standard library only. All worker jobs terminated.
