MOTOCROSS — EXACT CHARGES AT PERIODIC-PIN INTERFACES
25 October2026. Standard-library bounded CPU. No network/API writes/GPU or
SYMBIOSE. No extra agent used. Preregistered route is in PREREG.txt.

MAIN RESULT / SCOPE
There is an exact interface ledger and a genuine non-resonant bound. They
identify where extra available binary reserve enters, but do not bound its
total by the starting size independently of the actual trajectory. The local
ingredient is classical fixed-point homogenization / ultrametric valuation,
already present separately in paper8, paper15 and our prior reset fixtures.
This assembly is useful as a checked consumer contract, not a new Collatz
theorem or priority claim.

1. WHAT CHANGES OF MOTIF DO NOT ADD
The actual debt D=2k-S is unchanged by relabelling the same endpoint. A motif
switch adds zero physical odd steps and zero divisions. Thus it does NOT add
instantaneous debt. What may jump is the available reserve for following a
new periodic template. Treating this reserve jump as literal creation of D
would be a bookkeeping error.

2. PHASE-AWARE EXACT RESERVE LAW
For a periodic word w, let its rational odd2-adic cycle phases be alpha_j=p_j/q
in lowest terms, q>0 odd. The phase denominator is constant because q is prime
to6. At an integer state x distinct from that pin, put
 V_alpha(x)=v2(q*x-p).
It is a finite integer>=1 for odd x. If the actual next exponent is e and the
active phase has the same exponent, set alpha'=(3alpha+1)/2^e. Then
 q*U(x)-p'=(3/2^e)*(q*x-p),
so V_alpha'(U(x))=V_alpha(x)-e EXACTLY.
This works for arbitrary finite factors, cyclic phases and terminal cuts,
not merely complete copies. A positive integer pin hit is a separate event
(infinite reserve), not a finite credit value. Negative pins cannot be hit by
a positive integer. The trivial pin1 is explicitly rejected in the checker.

3. INTERFACE LEDGER FOR ARBITRARY PHASE-CODED PREFIXES
At each genuine switch of labels at actual state x_i, write
 Delta_i=V_new(x_i)-V_old(x_i).
For a finite prefix whose active phase matches every actual exponent, summing
the reserve law gives
 S_total=V_initial(n)-V_final(x_end)+sum Delta_i.
Since every actual exponent>=1, k<=S and D=2k-S<=S. Also V_final>=1. Hence
 D <= S <= V_initial(n)-1+sum max(Delta_i,0).
This is a valid bound with explicit computed interface charges, and it works
with any number of pieces while those charges and pin-hit conditions are kept.
It is NOT a source-only ceiling: the right-hand sum needs independent control.

4. ONLY ONE VALUATION SHELL CAN CREATE POSITIVE RECHARGE
Let old pin a=p/q and new pin b=r/s, q,s odd, both different from integer x.
Put K=s*p-q*r. If K=0, the pins/reserves coincide and Delta=0.
If K!=0, let t=v2(K). The exact identity
 q*(s*x-r)-s*(q*x-p)=K
and the ultrametric valuation law imply
 - if V_old(x)!=t, V_new(x)=min(V_old(x),t);
 - therefore Delta>0 is possible ONLY if V_old(x)=t.
At that critical shell the new reserve is not bounded by t or by the mere
number of switches. The determinant is the reduced-pin version of the affine
block commutator; odd reductions do not change its2-adic valuation.

COROLLARY (genuine conditional bound).
If every switch is noncritical, then every Delta<=0 and
 S_total<=V_initial(n)-1<=floor(log2(abs(q_initial*n-p_initial)))-1.
This holds regardless of the number of noncritical interfaces. It also holds
when some critical switches happen to have Delta<=0. No infinite matching
dictionary path can continue without positive recharge after this initial
reserve is spent. It may exit the dictionary, encounter a pin, or require a
critical recharge; this does not prove a descent at that point.

5. A CRITICAL SWITCH HAS UNBOUNDED CHARGE, EVEN ON VALID GROWING PATHS
Take w=(1,2), pin-5, and v=(1,1,2,1), pin-73/49. Then K=-172 and t=2.
For L>=6 choose positive m by CRT:
 49m+73=2^L mod2^(L+1),  m=4 mod9,
and set n=(8m-5)/9. The known exact portal realizes w, then B=floor((L-1)/5)
copies of v, with every odd prefix above original n. At the switch m,
 V_old(m)=2, V_new(m)=L, Delta=L-2.
Initial reserve is5; final isL-5B. Thus
 S=3+5B=5-(L-5B)+(L-2)
is verified exactly. The debt is1+3B. A single switch therefore cannot receive
a uniform CONSTANT surcharge. Its size is paid by source bitlength~L; this
does not refute a bound involving initial size and switch count.
Nine portals with L6..256 are independently replayed, including all prefixes.

6. EXACT DEBT-ADJUSTED LEDGER FOR COMPLETE PERIOD PIECES
For a piece w_i^L_i define r_i=length, s_i=division sum,
d_i=2r_i-s_i and beta_i=d_i/s_i. This rational beta_i is allowed to be signed.
Its actual debt equals beta_i*(V_i(entry)-V_i(exit)). At each piece interface
 Gamma_i=beta_next*V_next(x_i)-beta_old*V_old(x_i).
Telescoping gives the exact identity
 D_total=beta_initial*V_initial(n)-beta_final*V_final(end)+sum Gamma_i.
This answers 'what do switches add' relative to that CHOSEN potential.
For a safe upper bound with negative-debt pieces, use beta_i^+=max(beta_i,0).
Then D_total<=beta_initial^+V_initial+sum max(Gamma_i^+,0), where Gamma_i^+
denotes the switch difference of the CLIPPED potentials. Here0<=beta_i^+<=1.
The final clipped potential was nonnegative and discarded in that upper bound.

These quantities depend on segmentation/potential. Inserting label-only loops
can inflate the sum of positive charges. Choosing an entire observed path as
one word can remove interfaces while hiding its description in a large pin.
Therefore predeclare coding/dictionary and charge anchor constants. This is
not an intrinsic source-only physical energy. Unit-fraction bookkeeping is a
useful analogy, not an Erdos-Straus theorem. A sieve can identify critical
modular shells; it does not show that the integer orbit avoids them.

EXACT DEMONSTRATIONS
500 actual odd sources3..1001,1802 odd steps:
754 positive recharges, all754 in the predicted critical shell.250 sources
need no positive recharge before their actual first descent. Four pure
templates followed through all cyclic phases have zero label recharge.
Six signed/clipped weighted-ledger traces include the C4 counterexample:
n12235060455,345 steps,S547,D143, initial weighted reserve3, and the computed
positive clipped interface bound301. It holds, but it is an a posteriori
ledger, not a replacement global bound or an improvement over direct replay.
Same-pin interfaces K0 and exact positive-pin hits are explicitly controlled.

REPLAY
python interface_ledger.py
Produces CHECKS.json, including exact portals, complete per-step interface
examples and signed weighted charges. No floating point occurs in the proof
controls. All loops are bounded and all jobs have ended.

NEXT USE
Track critical-shell visits/charges as a concrete obligation; do not claim that
counting interfaces alone bounds total recharge. A useful global advance would
need an independent bound on that critical occupation/precision recovery, or
a proved coding policy preventing its repeated use on positive integers.
