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

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

Round 11 (v0.11): the exact boundaries and the 120°/270° enclosures hold, and the 579 derivative boxes and the root boxes hold where sampled; the switch neighbourhoods' derivative intervals leave out the 2×10⁻¹⁰ rad beside each switch, and three exclusions rest on them

PARTIAL — what the round computes mostly holds, and two things it states do not.

PARTIAL This page is the second layer: the finite claims of the layer-1 package "Round 11" 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 11 · Exact Contact Boundaries, Derivative Interval Boxes, and a Dedicated 120°/270° Difference Certificate
Previous roundRound 10 · II · Computation and Reproduction
Next roundRound 12 · II · Computation and Reproduction

Recompute reports · Runs

RUN-012Round 11 (v0.11): the exact boundaries and the 120°/270° enclosures hold, and the 579 derivative boxes and the root boxes hold where sampled; the switch neighbourhoods' derivative intervals leave out the 2×10⁻¹⁰ rad beside each switch, and three exclusions rest on them

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

The report, the code and the gate log: report RUN-012.md · corpus.py · run012_round11_box_certificate.py · gate.py · gate log run012-round11-box-certificate.json

Loads when opened…