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

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

Round 04 (v0.4.1): the equalized five-link reproduces; its four branch minima sit at exact phases, and re-equalized there they level to 10⁻¹⁵, 6.7×10⁻⁹ higher

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

PARTIAL This page is the second layer: the finite claims of the layer-1 package "Round 4" 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 4 · Phase-Branch Ledger, Sensitivity Matrix, and Four-Branch Equalization

Previous roundRound 3 · II · Computation and Reproduction

Next roundRound 5 · II · Computation and Reproduction

Recompute reports · Runs

RUN-005Round 04 (v0.4.1): the equalized five-link reproduces; its four branch minima sit at exact phases, and re-equalized there they level to 10⁻¹⁵, 6.7×10⁻⁹ higher

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

The report, the code and the gate log: report RUN-005.md · corpus.py · run005_round04_branch_equalization.py · gate.py · gate log run005-round04-branch-equalization.json

Loads when opened…