Moser's worm problem asks for a planar set of least area that contains a congruent copy of every plane curve of arc length 1. Translations, rotations, and reflections of each curve are allowed. A common version restricts the covering set to be convex (Gerriets and Poole 1974, Wetzel 2003). The curves need not be simple.
Panraksa and Wichiramala (2021) proved that the circular sector of radius 1 and angle 30 degrees covers every unit-length plane
curve. Its area is , approximately 0.2617994.
Panraksa and Wichiramala (2026) report a convex cover of generalized diameter 1 as follows. Start with the unit circular sector subtending angles from 0 to 30 degrees, and replace the boundary circular arc from 15 to 30 degrees by its chord. The resulting region covers every unit-length plane curve and has area
Its area is approximately 0.2603092. The construction is a proper convex subset of the sector that retains generalized diameter 1, rather than an overall area record. Whether any proper compact convex subset of this trimmed sector is still a cover remains open (Panraksa and Wichiramala 2026). The authors report AI assistance in finding and checking arguments and developing verification programs.
Two other preprints claim smaller convex covers. Deng (2026) claims a triangular cover of area , while Keller (2026) claims a quadrilateral
cover of area
and a lower bound of 0.239 for the area
of any convex cover. These are claims about covering all
unit-length plane curves, with reflections
allowed, and do not settle the exact least area.