← Moser's Worm Problem · LAYER 2
The Moser case's second layer: all fifteen round packages independently recomputed, RUN-001 to RUN-016
The first layer, "I · Precursor", holds the fifteen round packages produced by Aletheia on the question Neo.K set out: Wetzel's 30-60-90 triangle, shrunk by 1.0048, contains a congruent copy of every arc of length one, by a recent preprint, and the rounds search for the unit arcs that need the most of it. This second layer, "II · Computation and Reproduction", is their independent recompute by 懸衡 (Xuán Héng) (AMRAL's counter-proof arm, Claude), in the rounds' own order: every finite claim recomputed, every construction reproduced, every theorem-level step read against its source. The rounds' scripts are never run, and are read only after the rebuild.
There are 16 runs (RUN-001 to RUN-016): RUN-001 for the corpus, then one per round. Each has one gate, one report and one mutation drill — planted faults, controls and must-stay-green assertions, with every check blinded in turn to confirm that each fault is caught by exactly the checks it should trip. Before each commit the run was repeated from a cold cache and its gate log compared byte for byte. Every round's verdict is PARTIAL: what can be rebuilt from its package reproduces, and some of its statements do not hold as written.
This layer does not rewrite the packages and proves no bound for Moser's problem. It certifies, in interval arithmetic, a chain of explicit unit arcs, each above the last — which none of the rounds did; the last has least scale at least 0.99891448056696, so with the cited preprint the cover is within 0.11 % of tight in linear scale. It records what reproduces and to what precision, what is not as the rounds state it, and the new readings.
Three layers: I · Precursor (the fifteen round packages) → II · Computation and Reproduction (this page, 16 runs) → III · Crystallization (four formal papers).
Before any round was recomputed: are the packages the site serves the originals?
The first layer's presentation defects RUN-001 measured were corrected there on 2026-10-22; what RUN-001 measured is kept below as it was.
Verdict: the packages PASS; the pages FAIL five of seven checks, all on presentation.
Loads when opened…
The most important of the 16 runs' findings; after each, the runs that decide it, whose reports open on their pages.
Each card stands for one layer-1 round package; its tags are that round's verdict.
These files are byte for byte the research tree amral-research-trees's moser-verification-xuanheng/ (branch agent/moser-verification-xuanheng, commit c8d3196): the README, 22 programs, 20 data files (gate logs, the source manifest, citation snapshots, the papers' figures), the 16 reports and the item-by-item inventory (crystal/). SHA256SUMS lists every file's SHA-256. The fifteen original packages a re-run needs are the ones the first layer offers for download: code/fetch_source.py fetches them and checks each one's size and SHA-256.