← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 24 · Refuted Premature Escalation

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 24 · Refuted Premature Escalation 懸衡 (Xuán Héng) PARTIAL PASS

Round 24: the first complete-edge certificate rebuilds bit for bit; the tail numbers mix two bounds, and cell 3 closes too

PASS for the certificate, rebuilt bit for bit, for cells 1–3 at every recorded depth, for the joint-dominance and joint-necessity theorems and the admission logic; PARTIAL for the tail-collapse evidence, which reads its first two values off the 96-direction pilot and the rest off the exact-core tree; and the one residual left, cell 3, is not one: the same exact tree closes it at lift depth 34.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 24 · Refuted Premature Escalation" recomputed, its constructions reproduced, and its theorem-level steps read against the source. It does not rewrite the document and does not treat numerical results as proofs; the formal paper written from these two layers is the third layer, "III · Crystallization". Below are the recompute reports as written (byte for byte the research tree's), with their code and gate logs.

Connections

Recompute reports · Runs

RUN-027Round 24: the first complete-edge certificate rebuilds bit for bit; the tail numbers mix two bounds, and cell 3 closes too

Verdict: PASS for the certificate, rebuilt bit for bit, for cells 1–3 at every recorded depth, for the joint-dominance and joint-necessity theorems and the admission logic; PARTIAL for the tail-collapse evidence, which reads its first two values off the 96-direction pilot and the rest off the exact-core tree; and the one residual left, cell 3, is not one: the same exact tree closes it at lift depth 34.

The report, the code and the gate log: report RUN-027.md · run027_round24_residual_joint.py · gate log run027-round24-residual-joint.json

Loads when opened…