PINA COLADA — THE FOUR-BIT GROWTH-DEBT CEILING BREAKS
25 October2026. CPUonly, no APIwrites, GPU, paidcompute or SYMBIOSE.

MAIN RESULT
The proposed pre-first-descent ceiling D_k=2k-S_k <=4*bitlength(n) is FALSE.
An exact witness is the positive odd source
 n=12235060455, bitlength34, proposed ceiling136.
At oddstep313 the actual path has S489 and endpoint1670671127879, soD137.
All earlier oddstates remain above the original source. The first odd descent
is only atstep345, S547, endpoint10740669913<n.
The maximum debt is148 atstep332, S516, endpoint14467214613905.

This is NOT an artifact of sampling interior points of compressed blocks:
boundary111 has k316,S493,D139; boundary117 has k333,S518,D148.
Thus restricting the ceiling to the parent's actual pit-stop checkpoints does
not rescue it.

CURRENT SIZE DOES NOT RESCUE THE SAME COEFFICIENT
At step344 the endpoint is14320893217>n, also34bits, with S545 andD143>136.
Thus D<=4*CURRENT bitlength also fails before firstdescent. The earlier odd
height maximum is345766120364645 atstep227, where debt was only109. Debt can
rise substantially AFTER the height maximum, while the path comes back near
its initial size. This does not refute a ceiling based on RUNNING PEAK size,
elapsed time, a different coefficient, or a richer arithmetic invariant.

WHY THE MECHANISM MATTERS
The exact orbit-product identity gives
 D_k=(2-log2(3))*k + log2(x_k/n)
      -sum_{j=0}^{k-1}log2(1+1/(3*x_j)).
The correction sum is positive. Debt therefore includes elapsed-clock drift;
it is not just a measure of instantaneous excursion height. A late descent
toward source size need not erase debt accumulated across many layers.
This is an exact identity, not a stochastic or optical claim.

The wildcard 'crystal foam / thin-film interference' inspired the layered
adversarial viewpoint: compounding positive transfer blocks and checking
whether a later layer really cancels earlier debt. It is not evidence for
the inequality. The actual witness has126 compressed blocks; local decreases
and renewed growth do not force a source-size debt reserve to stay capped.

SELECTION AND PRIOR ART
Before tests, PREDICTION.txt froze the4*sourcebits target and planned use of
primary stopping-time/excursion record seeds. A bounded500000-source test in
the preceding run had not refuted it; that finite pass was never a theorem.

Primary source actually consulted:
https://sweet.ua.pt/tos/3x%2B1.html
The author's linked stopping-record table:
https://sweet.ua.pt/tos/3x%2B1/t1.txt.gz
The source12235060455 is an OLD known stopping-time record in that table,
not our new computational record. The table selected the candidate only;
our proof needs no trust in its record status or the historical computation.
RECORD_AUDIT.json stores exact replays of34 odd record candidates, including
several further4-bit-ceiling violations. The first violation in THIS table is
not asserted to be the smallest integer violating the proposed ceiling.
Largest tested debt/bit ratio in that table is236/50 at1008932249296231.
No claim of exhaustive novelty search or that no one has noticed this
inequality failure before is made. It is useful as a regression fixture for
our explicitly proposed invariant.

VERIFICATION
python debt_counterexample.py
This self-contained standard-library script builds the actual345-exponent
word, then verifies it with a separate repeated-halving integer implementation.
It independently reconstructs every affine endpoint identity
 3^k*n+C_k=2^S*x_k, C_{k+1}=3*C_k+2^S.
It explicitly rejects any earlier odd descent, checks the exact first debt
violation, maximum and terminal firstdescent, and checks the compressed
block-boundary variant. Six corruptions were rejected: exponent, source,
claimed violation step, endpoint, division sum and float exponent.
The code refuses Python-O, requires exact integer fields, and uses bounded
loops. COUNTEREXAMPLE.json contains the full word; COUNTEREXAMPLE_AUDIT.json
contains the reported exact claims; BLOCK_LAYERS.json contains126 block rows.

SCOPE
This refutes both4*initialbits and4*currentbits as pre-first-descent debt
ceilings. It does not refute Collatz, any larger coefficient, a running-peak
bound, a time-dependent bound or a bound with additional history. The orbit
actually DOES descend. The counterexample is scientifically more useful than
silently changing the coefficient to5 after the finite test fails; a new
coefficient would need its own hypothesis and independent support.
No publication was made by this worker. No job is left running.

RETAINED SOURCE-ACCESS FAILURE
The web tool could not read thegzip MIME type. Python's default TLS trust
store rejected the site's chain; Windows Invoke-WebRequest then fetched it
using its normal certificate validation. Certificate checking was not disabled.
