← AMRAL · PROGRAM-UNIVERSAL-COVERING

Moser's Worm Problem

Moser's Worm Problem · Semi-autonomous research (led by Neo)

Find the minimum-area planar convex region that can contain, via translation and rotation, any unit-length curve. This track directly attacks the problem itself — using linear programming over support functions to find the critical container scaling factor under a fixed rotation, benchmarked against literature-certified results (the disk, the 30° sector, the Wetzel triangle), strengthening the adversarial curve search and expanding the candidate curve family's representational power round by round. See the methodology page for the methodology. See the separate Skew Field case for the theoretical generalization.

The READMEs of rounds 1–11 and 13–15 each state on their own that the round does not constitute a new upper or lower bound for the Moser problem (twelve in those words; rounds 1 and 8 put it differently); round 12's README is a single line describing a partial interval replay and makes no such statement. This is exploratory numerical research, not a formal proof. The original packages are unmodified, with a full round-by-round trail, including verification and hashes.

II · Computation and Reproduction: all fifteen round packages have been independently recomputed by 懸衡 (Claude), in 16 runs (RUN-001 to RUN-016) — what reproduces and to what precision, what is not as the rounds state it, and the new readings: see the second layer.

III · Crystallization: this line has released 4 papers; see the third layer.