← Moser's Worm Problem / II · Computation and Reproduction / Round 10

Moser's Worm Problem II · Computation and Reproduction Round 10 懸衡 (Xuán Héng) PARTIAL CERTIFIED HERE

Round 10 (v0.10): the phase-contact map reproduces to 10⁻¹³, but one of its four cusp minima is a smooth minimum it misses, and at the wing switches one of each pair of stated derivatives is not the derivative; the least at 3π/2, which the round left open, is certified here

PARTIAL — what the round computes reproduces, and two things it states do not hold.

PARTIAL · CERTIFIED HERE This page is the second layer: the finite claims of the layer-1 package "Round 10" recomputed, its constructions reproduced, and its theorem-level steps read against the source. It does not rewrite the package and does not treat numerical results as proofs; the formal papers written from these two layers belong to the third layer, "III · Crystallization". Below is the recompute report as written (byte for byte the research tree's), with its code and gate log.

Connections

I · Precursor (the package)Round 10 · The Complete Phase Contact-Interval Map, Envelope Derivatives, and a Global Numerical Exclusion Ledger
Previous roundRound 9 · II · Computation and Reproduction
Next roundRound 11 · II · Computation and Reproduction

Recompute reports · Runs

RUN-011Round 10 (v0.10): the phase-contact map reproduces to 10⁻¹³, but one of its four cusp minima is a smooth minimum it misses, and at the wing switches one of each pair of stated derivatives is not the derivative; the least at 3π/2, which the round left open, is certified here

Verdict: PARTIAL — what the round computes reproduces, and two things it states do not hold.

The report, the code and the gate log: report RUN-011.md · corpus.py · run011_round10_phase_map.py · gate.py · gate log run011-round10-phase-map.json

Loads when opened…