← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 27 · First Exact Certificate

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 27 · First Exact Certificate 懸衡 (Xuán Héng) PASS

Round 27: at a common depth 40 the residual's lower bounds are exact, 57 by 38 and 63 by 40; the five thinnest leaves certify again under this tree's own integer intervals, and seven more

PASS throughout.

PASS This page is the second layer: the finite claims of the layer-1 document "Round 27 · First Exact Certificate" 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

I · Precursor (the document)Round 27 · First Exact Certificate · First Exact-Arithmetic Leaf Certificates Produced: The Rational Inner-Polygon Theorem Established, Cell 0's Five Thinnest Leaves 5/5 Pass, Scope Still Limited to Stored Reference State
PreviousRound 26 · Full 77-Cell Atlas · II · Computation and Reproduction
NextRound 28 · Exact Root Bulk Migration · II · Computation and Reproduction

Recompute reports · Runs

RUN-030Round 27: at a common depth 40 the residual's lower bounds are exact, 57 by 38 and 63 by 40; the five thinnest leaves certify again under this tree's own integer intervals, and seven more

Verdict: PASS throughout.

The report, the code and the gate log: report RUN-030.md · run030_round27_interval_replay.py · gate log run030-round27-interval-replay.json

Loads when opened…