← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 37 · Latest Progress

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 37 · Latest Progress 懸衡 (Xuán Héng) UNMEASURED PASS

Round 37: the three depth-32 certificates are this tree's own, leaf for leaf; cell 33's continuation to depth 42 is this tree's, every checkpoint and all 166 segment files byte for byte; the merge never checks the premise its theorem rests on

PASS for eleven of Round 37's twelve judgments — the three trees, the three lower bounds and three byte replays, the promotion, the conservative geometry status and the two readings of the global claim. UNMEASURED for the MPFR marker replay, whose records are not shipped and whose arithmetic is not here.

UNMEASURED · PASS This page is the second layer: the finite claims of the layer-1 document "Round 37 · Latest Progress" 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-040Round 37: the three depth-32 certificates are this tree's own, leaf for leaf; cell 33's continuation to depth 42 is this tree's, every checkpoint and all 166 segment files byte for byte; the merge never checks the premise its theorem rests on

Verdict: PASS for eleven of Round 37's twelve judgments — the three trees, the three lower bounds and three byte replays, the promotion, the conservative geometry status and the two readings of the global claim. UNMEASURED for the MPFR marker replay, whose records are not shipped and whose arithmetic is not here.

The report, the code and the gate log: report RUN-040.md · run040_round37_depth32.py · gate log run040-round37-depth32.json

Loads when opened…