Before candidate selection/tests: Target D_k=2k-S_k on actual odd Collatz path before FIRST descent below original source. Try to refute candidate D<=4*initial_bitlength, using primary published first-drop records and total-delay record seeds as adversarial proposals. Exact integer replay only; all records treated as candidates, not validated externally here. If no counterexample, finite pass is not theorem. Secondary test reverse/inverse lifts around long witnessed excursions, preserving original source semantics. Hard bounds:<=100000 candidate starts,<=20000oddsteps each,<=32768bit states, CPUonly, no APIwrite/GPU/paid/SYMBIOSE. Wildcard foil: temporal layers can constructively stack debt before an eventual high-valuation release; do not infer optical physics gives Collatz law.
