PINA COLADA — UNKNOWN frontier: exact target, a conditional clock, and traps
25 October2026. CPU only, no API writes/GPU/SYMBIOSE/children.

STATUS
No global closure theorem. The useful output is a conservative explicit progress
contract, a concrete failure of natural source-size budgets, and exact frontier
diagnostics. The algebra is elementary/classical and is not a newpaper claim.

1. WHAT MUST EMPTY?
For odd n>=3 let tau(n) be first odd descent below n, allowing infinity. Define
F_h={n>=3 odd:tau(n)>h}. These sets are nested. Their GLOBAL emptiness at one
finite h is neither necessary for Collatz nor possible: n=2^(h+1)-1 has at least
h increasing all-one valuation steps. A finite source bound N changes this:
F_h intersect[3,N] is finite; it eventually becomes empty iff every source in
that interval eventually descends. Taking N larger is a separate obligation.

The right global progress metric is m_h=min F_h (infinity if empty):
 every fixed n eventually leaves iff m_h tends to infinity.
Proof: forward implication closes finitely many sources below each N, so choose
the largest of their finite descent clocks. Reverse implication choose N=n.
This equivalence is only a restatement of the missing pointwise coverage input,
NOT a proof. A lower bound on m_h tending to infinity would be substantive.

2. SURVIVOR DENSITY IS NOT THAT METRIC
A decreasing survivor fraction or2-adic cylinder measure is insufficient to
control the least survivor. In a nested family the balls1 mod2^q have measure
2^-q tending to zero yet retain integer1; the balls-1 mod2^q have the same
measure but their least positive representatives tend to infinity. Their2-adic
limits differ in whether there is a fixed positive integer realization.
The positive1 example is also a genuine Collatz cycle negative control. Its
exact all-two cylinders contain finite non-descending exception1, which has
zero density. Source1 is excluded in the actual problem; the example diagnoses
the logic of discarding zero-density exceptions, not an unknown nontrivial cycle.
Do not imply that arbitrary balls about integer3 are actual no-descent branches.

Exact finite demonstration:100000 odd sources3..200001, max120 odd steps.
At depth4,20311 are unresolved and the least is27. At depth36, only414 remain,
yet the least is STILL27. At depth37 the least jumps to703; at depth80 only2
remain, least35655. At depth100 all sources within this interval close. This
last fact gives global m_100>200001, not global F_100 empty. Every count/minimum
is from actual integer replay, not independent random valuations.

3. AN EXPLICIT NONCIRCULAR CONDITIONAL CLOCK
For a validated prefix from odd n>=3, k>=1, division sumS, the previously proved
simple integer guard says2^S*n^k >=(3n+1)^k implies some prefix has descended.
Consequently, if integer C>=0 and
 S>=2k-C,  k>=max(1,4C),
then a prefix has descended. Indeed,
 [2^S*n^k]/[(3n+1)^k] >=2^-C [4n/(3n+1)]^k
 >=2^-C (6/5)^k,
and(6/5)^4=1296/625>2. For C=0 the margin is strict at anyk>=1.
This is an exact integer sufficient condition, requiring no distinctness, no
probabilistic drift assumption and no coefficient-stopping-time conjecture.

Let deficit D_k=2k-S_k. If an INDEPENDENT invariant established D_k<=C through
all prefixes of a surviving path, its UNKNOWN would close withinmax(1,4C)
odd steps. The word INDEPENDENT matters: setting C to a maximum only after a
trajectory descends does not establish an a priori clock. No such universal
invariant is proved here. This condition is stronger than necessary and is not
claimed equivalent to Collatz.
In the parent's compressed block(r-1 ones, then s+1), k increases byr, S byr+s,
so D increases byr-s. Resetting blocks can replenish the deficit. The size-aware
tool can measure that event; its mere measurement does not supply a bound.

4. A NATURAL SIZE BUDGET ALREADY FAILS AT27
n27 has5 bits. At k9,S12,x137, deficitD6 exceeds bitlength(n). It reaches20
before its actual first descent(k37,S59,x23). Therefore hard budgets C=initial
bitlength,2*bitlength or3*bitlength all fail already on27. This is a real finite
counterexample to those proposed deficit invariants, not a Collatzcounterexample.
Similar recorded fixtures: n63(bits6) reaches deficit18, n703(bits10) reaches25.
No claim is made that a larger constant multiple can or cannot work globally.

5. PRECISE CAUTION ABOUT COEFFICIENT STOPPING
Do NOT claim that2^S>3^k has a known positive-integer no-descent counterexample.
Parent identified this as touching the separate coefficient-stopping-time
conjecture. My bounded scan of100000 starts found no such counterexample before
first descent. That negative finding is not a theorem. The safe algebraic claim
is that a contracting affine multiplier leaves an additive threshold/finite
exception obligation; one must not discard it without a separate justification.
Actual integer1 is a cycle control. The existing positive RATIONAL anchor
283/13 for word(1,1,2,2,2) shows why a formal multiplier alone cannot certify
descent in a relaxed rational model. It is not an integercounterexample.

REPLAY AND SCOPE
python frontier_check.py
Produces AUDIT.json with the finite frontier table,20 nested-anchor controls,
10000 sources checking8846 instances of the conditional deficit-clock guard.
These checks corroborate the identities and reported finite witnesses; the
universal conditional statement follows from the proof. Earlier one-off scripts
also wrote FRONTIER_AUDIT.json and DEFICIT_AUDIT.json; frontier_check.py is the
portable consolidated reproducer. All computations terminate under hard loops.
No claim of external novelty search or external validation for this note.
