ADIDAS — CANONICAL INTERFACES ALWAYS INJECT RESERVE
25 October2026. Exact bounded CPU; no API/GPU/paid/SYMBIOSE/child agents.

MAIN STRUCTURAL RESULT
For the canonical maximal-one-run block, an actual change of block type always
increases the selected pin reserve. Thus the dangerous/resonant residue at a
switch is not a rare event once the next motif has been selected from the
actual orbit: every canonical switch lies in it by construction. A Haar-density
sieve must not be turned into a fresh-random-orbit argument.
The result is elementary exact algebra, not a global Collatz debt ceiling.

DEFINITIONS
For positive odd x, let r=v2(x+1), m=(x+1)/2^r, and
s=v2(3^r*m-1). The maximal-run block word is
 (1 repeated r-1 times, then s+1), r>=1,s>=1.
Its affine endpoint is
 F_(r,s)(x)=[3^r*x+(3^r-2^r)]/2^(r+s).
Its debt increment is r-s and its division cost is r+s.
Its rational periodic pin is
 alpha_(r,s)=(3^r-2^r)/(2^(r+s)-3^r)=p/q,
in lowest terms,q>0. Both p and q are odd. Define V_(r,s)(x)=v2(q*x-p).
All finite-reserve assertions exclude x=alpha_(r,s); such an integer pin is a
separate finite cycle witness, not a reason to assign a finite valuation to0.

1. EXACT RESERVE LOSS AND DEBT LEDGER
For a block of its OWN type, pin homogenization gives
 q*F(x)-p=(3^r/2^(r+s))*(q*x-p).
Consequently V_after=V_before-(r+s)>=1, because the actual endpoint and pin
are odd2adic, and therefore
 (D_after+V_after)-(D_before+V_before)=-2s.
One can verify the reserve without forming a rational number:
 V_before=r+s+v2(x-F(x)), V_after=v2(x-F(x)).

Consider m actual blocks, typesP_i, sourcesx_i, endpointsx_(i+1), i0..m-1.
At interface i>=1 define T_i=V_(P_i)(x_i)-V_(P_(i-1))(x_i).
If no relevant reserve is infinite, the EXACT identity is
 D_m+V_(P_(m-1))(x_m)
 =V_(P_0)(x_0)-2*sum_i s_i+sum_(i>=1)T_i.
For arbitrary dictionaries T can have either sign; for the canonical parse
used here every actual type-change T is STRICTLY POSITIVE (proved below),
and same-type interfaces have T0. Thus this is already
 D_m=V_initial-V_final-2*sum s_i+sum J_i,
where J_i=max(0,T_i). In particular
 D_m<=V_initial-1-2*sum s_i+sum J_i.
This does not upper-bound sumJ: the latter is the remaining dynamical input.

2. RESULTANT ATOMS FOR ANY TWO ODD PINS
Let alpha=p/q,beta=u/v be distinct odd2adic rationals with odd denominators.
Set t=v2(v*p-q*u)=v2(alpha-beta)>=1. For oddx away from the pins, write
A=v2(q*x-p), B=v2(v*x-u). The ultrametric possibilities are exactly:
- A<t: B=A;
- A>t: B=t;
- A=t: B>t.
The last strict inequality is specific to2adic units: normalized odd terms
cancel to an even value. Therefore positive incoming credit J=max(0,B-A)
satisfies, for each integerh>=1,
 J>=h iff x=beta modulo2^(t+h).
This is one exact odd residue; pin beta itself is the excluded infinite case.
For a finite interval[L,U], count that residue by
 max(0,floor((U-r)/M)-ceil((L-r)/M)+1), M=2^(t+h),r=beta modM.
Unconditional odd-class density is2^[-(t+h-1)]. No probabilistic independence
of actual orbit states is implied.
If J>0, then J=B-t<=floorlog2|v*x-u|-t. This charges one observed interface
to its current state and target-pin height, not to the initial source alone.

3. EXPLICIT CANONICAL SEPARATION AND FORCED POSITIVE SWITCHES
The pin identity
 alpha_(r,s)+1=2^r*(2^s-1)/(2^(r+s)-3^r)
gives v2(alpha+1)=r. Hence distinct types (r,s) and(u,v) have separation
 t=min(r,u), ifr!=u;
 t=r+min(s,v), ifr=u ands!=v.
For the second case, subtract the two pin fractions; their common odd numerator
3^r-2^r times2^r(2^v-2^s) is divided by odd denominators. This proves the formula
and also that distinct types have distinct pins.

At an actual incoming(u,v) block, V_new>=u+v+1>t. The pair-atom theorem then
forces V_old=t, so T=J=V_new-t>0. Every actual switch is on the incoming
resonant ball. Conditioned on selecting the next type from the actual block,
the eventJ>=1 has probability1 as a deterministic assertion, not the small
unconditional Haar fraction. In fact J>=u+v+1-t is forced.

This also means that for an old block followed by a different canonicaltype,
 v2(x_i-x_(i+1))=t(oldtype,newtype).
The incoming reserve contains precision for the UPCOMING same-type run;
measuring J can encode that future run's realized length. A prospective bound
on totalJ cannot simply be assumed from this bookkeeping identity.

4. EXACT COUNT ON THE FOUR-BIT COUNTEREXAMPLE
Source12235060455,126 canonicalblocks,28 distinct(r,s) types,113 typechanges.
All113 changed interfaces inject reserve; none gives a negative credit.
Initial reserve9. Full sumJ541, 2*sum s404, final reserve3:
 D_final=9+541-404-3=143, at oddstep345, the first descent.
At boundary117 (oddstep333),104 changes, sumJ510, 2*sum s370, final reserve1:
 D=9+510-370-1=148.
At boundary111 (oddstep316), sumJ485, tax354, reserve1 givesD139.
The largest individual incoming toll in this witness is14. The toll maxima
are data about this finite path, not constants valid for every input.

5. A FIXED-PAIR TOLL CANNOT BE BOUNDED BY ITS TYPE LABELS ALONE
Oldtype(2,1), pin-5; newtype(3,1), pin-19/11; separationt2.
ChooseL>=5 and positiveoddy satisfyingy=4mod9 andv2(11y+19)=L (CRT).
Setx=(8y-5)/9. Thenx realizes the oldblock(1,2), whose endpointisy;
V_old(x)=5,V_old(y)=2,V_new(y)=L, so the SINGLE switch toll isL-2.
The newperiod(1,1,2) can repeatfloor((L-1)/4) times and every prefix has slope
above1 with positive offset. Thus this switch lies on a genuinely non-descending
entrance. Input size grows withL, so this does NOT refute a ceiling charged
jointly to source size and interfaces. The parent/Pina received the construction;
this file's script audits the general atoms and actual record rather than
claiming an independent exhaustive portal scan.

REPLAY / CONTROLS
python interface_sieve.py
INTERFACE_CERTIFICATE.json supplies everyblock and everycharge. Independent
repeated-halving replay validates all actual blocks, the original source and
every prefix ledger. AUDIT.json records126blocks,113switches,56086 pair-atom
checks,1176 canonicalpin-separation checks and six rejected corruptions:
source,pin,jump,totalpositivecharge,s,divisiontotal. Fixed bounded loops only.
The residue-count interpretation is mathematical, not a claim that the orbit
resamples residues independently. No universal debt ceiling, stopping-time
bound, new record, proof-assistant certification or external validation is
claimed. All recorded CPU jobs terminated; no API write was performed.
