← Moser's Worm Problem / Rounds / Round 4

Round 4 v0.4.1 2026-07-26

Phase-Branch Ledger, Sensitivity Matrix, and Four-Branch Equalization

Directly solves the max-min equalization problem for the four lowest phase branches: the five-link critical scale is raised from Round 3's 0.998754371668 to 0.998903750476. The four branches use entirely distinct contact topologies, and the sensitivity matrix shows that no single parameter direction can raise all four branches simultaneously.

Exploratory numerical research; not a formal proof; not a universal covering certificate — Stage status as self-declared by the in-package documents, reproduced verbatim. Curve family: mirror-symmetric five-link curves. Container kernel: the exact three-normal formula for the certified Wetzel triangle.

Connections · Connections

Relationship to other packages, stated as far as possible in the document's own words, not my interpretation.

“Different branches respond to the same parameter in mutually conflicting directions. No local direction can raise all four branches at once, so a max-min equalization point forms… the curve's difficulty is not a single contact ledger, but a multi-ledger balance among a set of competing placement branches.” — excerpted from Sections 5 and 7 of this package's main document.

Core Content of Round 4

The branch-equalization results table, parameter reallocation, the branch contact ledgers (four distinct topologies), the branch sensitivity matrix, the second-layer branch-pressure ledger, the research assessment, and the direction for Round 5 (formalizing contact events as equations).

Loading…

Files · Files

Loading…

Download full package (486.8 KB)

sha256 acc4235cb12e35ef597e353cbfd35c5f054502c463c113ab1d455760bf3b1485