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

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

Round 03 (v0.3): the five- and seven-link values reproduce; the seven-link family contains every five-link curve, so seven below five is a search's shortfall

PARTIAL — what the round computes reproduces, and one of its two conclusions does not hold as stated.

PARTIAL This page is the second layer: the finite claims of the layer-1 package "Round 3" 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 3 · Contact-Ledger Reverse Generation, Mirror-Symmetric Multi-Link Curves, and a Degrees-of-Freedom Validity Test

Previous roundRound 2 · II · Computation and Reproduction

Next roundRound 4 · II · Computation and Reproduction

Recompute reports · Runs

RUN-004Round 03 (v0.3): the five- and seven-link values reproduce; the seven-link family contains every five-link curve, so seven below five is a search's shortfall

Verdict: PARTIAL — what the round computes reproduces, and one of its two conclusions does not hold as stated.

The report, the code and the gate log: report RUN-004.md · corpus.py · run004_round03_symmetric_links.py · gate.py · gate log run004-round03-symmetric-links.json

Loads when opened…