Third track frozen before computations. Target a linear lookahead lower bound for raw unresolved candidates in a fixed central source shell. Choose one exact linearly positive endpoint height at the original cutoff. Tilt the bits to its odd proportion. The complete-clock late branch should now be exponentially rare because the tilted count drifts strictly above the old critical slope. The safe seed mechanism is unchanged. Preserve the run count in the record and use bounded differences under the fixed-height law. Optimize the resulting sufficient linear fraction by entropy. Do not identify candidates with eventual survivors.

Checks. Use exact binomial tails in positive-drift rational proxies at s=32,64,128,256 for the late branch. Verify deterministic height and quota persistence for all four-bit continuations from several strict positive prefix states, compare to literal lifted integer paths. Compute a descriptive high-precision value of the limiting entropy boundary using the centered tilt equations. These checks are finite, CPU only, bounded below 90 seconds.
