ADIDAS — DEBT, HEIGHT, OCCUPATION AND THE THIN-FILM WILDCARD
25 October 2026. CPU / exact standard-library arithmetic only.

STATUS
No source-only debt ceiling proved, and no positive integer counterexample to
the proposed4*initial-bitlength ceiling found or claimed by this worker.
Useful outputs: an exact occupation-dependent cap, a circularity diagnosis for
height arguments, layered affine interface algebra, and an independent repair
of the peer's3-unit packing lemma. These elementary facts alone do not justify
a new mathematical paper or a claim of historical novelty.

1. THE EXACT GROWTH LEDGER AND WHAT A HEIGHT CAP DOES NOT GIVE
For odd map U(x)=(3x+1)/2^a, along k actual odd steps from n let S=sum a and
D=2k-S. The exact product identity is
 x_k/n =3^k*2^(-S)*prod_(j=0)^(k-1)(1+1/(3*x_j)).
Writing E_k=sum log2(1+1/(3*x_j)) gives
 D_k=(2-log2(3))*k+log2(x_k/n)-E_k.
A height cap controls the endpoint term, but leaves a positive linear time
term. It does not automatically bound debt by a logarithm of height.

More directly, on ANY no-descent prefix from fixed n>=3, every source x_j>=n
and x_k>=n. Thus
 2^S <=(3+1/n)^k,
 D_k >= k*log2(4*n/(3*n+1)) >0.
No distinctness assumption is used. An infinite no-descent path would have
linearly growing debt. Therefore the existence of SOME finite fixed-source
ceiling (without an independently derived explicit formula) is equivalent to
finite first descent: the forward implication follows from this inequality,
and the reverse implication takes the finite maximum along the stopped path.
Measuring that maximum after reaching descent is not an a priori invariant.
Allowing the proposed ceiling to grow with the current height can also evade
the fixed-source clock, so its height growth must itself be controlled.

2. A GENUINE CONDITIONAL HEIGHT/OCCUPATION CEILING
Suppose the k odd SOURCE states are distinct and belong to[n,M]. Each exponent
a=1 contributes+1 to D; a=2 contributes0; a>=3 contributes negatively. The
positive sites are exactly x=3 mod4. Hence
 D_k <=#visited source sites congruent3mod4
     <=Q(n,M):=floor((M+1)/4)-floor(n/4).
This is an explicit height-dependent debt ceiling, derived without knowing
the descent clock. If each positive site can be visited at most R times, the
same proof gives D<=R*Q. This isolates the missing information as occupation
of the positive-debt sites. It is only linear in the height range, notO(log n).
A dyadic-shell decomposition simply adds these site credits; it does not
magically replace the occupancy bound by constant credit per shell.
The distinctness condition concerns ALL odd source states, not just compressed
block boundaries. A consumer must discharge it or retain a repeat alternative.

With an independently valid height cap and no repeats, ordinary pigeonhole
already forces a descent/cap-exit/repeat event in a finite number of states.
Our cap interface does not establish such a height cap for all integers.

3. CYCLE BARRIER / EXPLICIT RELAXED-MODEL CONTROL
Any hypothetical positive INTEGER odd cycle whose minimum is>=3 satisfies
 2^S=prod(3+1/x_j)<4^k,
so its debt increment2k-S is a positive integer. Repeating the cycle leaves
height bounded and makes debt unbounded. Consequently a universal bounded
height-only debt assertion would already exclude every such cycle. We do
NOT assume or exhibit a nontrivial positive integer cycle.

The relaxed odd-rational model supplies an exact negative control:
 283/13 ->431/13 ->653/13 ->493/13 ->373/13 ->283/13,
with exponents(1,1,2,2,2), k5,S8, hence debt+2 per lap. Every denominator is
odd, every exponent is exact2-adically, and height remains653/13. Tests replayed
1,2,3,10,50 laps. This is NOT an integer counterexample and does not refute a
theorem that specifically exploits integer realization costs.

4. WHAT THE THIN-FILM WILDCARD TRANSLATES TO EXACTLY
Use projective layer matrix M_a=[[3,1],[0,2^a]]. A word has map
 F_w(x)=(3^k*x+C_w)/2^S.
The debt2k-S is invariant under permutations of the same exponent multiset.
Layer ordering changes the positive affine intercept C_w and the exact input
cylinder, so it changes the source-integer realization cost, not debt directly.
For an adjacent swap,
 F_b(F_a(x))-F_a(F_b(x))=(2^a-2^b)/2^(a+b).
The original affine matrices have positive entries and no complex amplitude
phases. Thus optical destructive interference cannot simply be asserted for
the debt itself. A constructive use of the analogy is to optimize input cost
via interface ordering while keeping k,S fixed, and then replay every claimed
integer valuation word. This complements Motocross's layered-word route.

5. INDEPENDENT REPAIR OF PEER3-UNIT PACKING
Read the complete peer comment uTSPWOYugAky6rV4 from peer_audit.json supplied
by the parent. Lemma1's STATIC source-list condition is insufficient as written:
the actual prefix3->5->1 has two distinct sources3,5>=3, but the claimed
n=3mod6 lower bound for its second source is n+4=7>5.
This does NOT refute Theorem3, whose proof assumes NO DESCENT INCLUDING ENDPOINT.

Under that stronger condition, the parent's repair is valid. If initial n is
1mod4, it descends at its first odd step (n>1), so a no-descent prefix must have
n=3mod4. When also n=3mod6, this means n=3mod12. A source n+2 would have
valuation>=2 and
 U(n+2)<=(3n+7)/4<n for n>7,
contradicting the next endpoint's no-descent condition. The remaining n3 case
is explicitly3->5->1: k>=2 already descends, and k1 has no second source.
Thus in the relevant n>=15 case all other sources are>=n+4=1mod6. Odd3-units
thereafter have alternating gaps4,2; sorting gives x_(i)>=n+1+3i for i>=1.
The peer should strengthen/correct Lemma1 and insert this dynamical argument,
not claim the packing bound follows from3-unit density alone. No claim of a
counterexample to the final9th-power guard is made.

EXACT CONTROLS
python debt_height.py
3000 integer starts,10344 pre-descent prefixes: occupation cap and exact
no-descent rate inequality passed.36 adjacent-swap identities checked; four
fixed-multiset words replayed at their least positive exact cylinder sources.
2430 actual no-descent prefixes checked the repaired n=3mod6 packing law.
Positive odd-rational cycle laps and the actual n3 lemma fixture passed.
The general claims follow from the proofs, not those finite checks.

Files: PREREGISTER.txt, debt_height.py, CHECKS.json, REPORT.txt.
No network/API write, GPU, paid calculation, SYMBIOSE boot or child agent.
All recorded tests terminated. External novelty review and peer validation of
this worker report were not sought; parent should assess usefulness for sharing.
