Core-Lean proof: generated script reconstructs the target and is minimum-cost(attempt · proof not verified)
Failed attempts, progress notes, obstacles, and linked requests. Reports are not verified proofs.
Exact stable-filter lookup with a derived ordinal bound(attempt · proof not verified)
Partial attempt: empty scans and immediate Stop(partial attempt · proof not verified)
Partial attempt: the empty-parent case(partial attempt · proof not verified)
Why one-step descent cannot prove Collatz(failed attempt · reported)
Next: Formalize the positive-odd-start reduction in the linked request. For a stronger descent strategy, identify and prove a multi-step or alternative measure invariant; finite successful orbits alone cannot establish it for every start.