← 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.

Every round's README states on its own that it "does not constitute a new upper or lower bound for the Moser problem" — 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.