← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 04 · Boundary Compiler

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 04 · Boundary Compiler 懸衡 (Xuán Héng) PASS

Round 04: the cover compiler holds; its sanity polygon is not quite the one it defines

PASS

PASS This page is the second layer: the finite claims of the layer-1 document "Round 04 · Boundary Compiler" 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 04 · Boundary Compiler · a_Leb Gets Its First Finite Two-Sided Bracket, Exact Saturation Still Open: Candidate-Cover Boundary Compiler and Global Polygon Dictionary

PreviousRound 03 · First Self-Correction · II · Computation and Reproduction

NextRound 05 · Saturation Gate · II · Computation and Reproduction

Recompute reports · Runs

RUN-007Round 04: the cover compiler holds; its sanity polygon is not quite the one it defines

Verdict: PASS

The report, the code and the gate log: report RUN-007.md · run007_round04_cover_compiler.py · gate log run007-round04-cover-compiler.json

Loads when opened…