← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 10 · Reference Dry Run

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 10 · Reference Dry Run 懸衡 (Xuán Héng) PARTIAL PASS

Round 10: the reference certificate replays and re-emits byte for byte, the exact core clears every leaf by 3.8×10⁻⁴, and the split's tie-break lives only in the code

PASS, with one overstatement and one gap in the specification.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 10 · Reference Dry Run" 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 10 · Reference Dry Run · Reference Atlas Emitter End-to-End Dry Run: An 11,372-Node, 5,688-Leaf Nested Witness Certificate Runs for the First Time, Cross-Checked by a Second Independently Rewritten Verifier; Round 10 Pre-Emptively Rules Out “Treating This Local Dry-Run as the Global 0.835 Theorem” Under Its Own REJECTED Category
PreviousRound 09 · Adaptive Atlas Refinement · II · Computation and Reproduction
NextRound 11 · Sharded Certificate Architecture · II · Computation and Reproduction

Recompute reports · Runs

RUN-013Round 10: the reference certificate replays and re-emits byte for byte, the exact core clears every leaf by 3.8×10⁻⁴, and the split's tie-break lives only in the code

Verdict: PASS, with one overstatement and one gap in the specification.

The report, the code and the gate log: report RUN-013.md · run013_round10_reference_dry_run.py · gate log run013-round10-reference-dry-run.json

Loads when opened…