← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 15 · Proof Capacity Ladder

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 15 · Proof Capacity Ladder 懸衡 (Xuán Héng) PARTIAL PASS

Round 15: the capacity algebra is exact, but the local proof's capacity is 0.835, not 0.8350003545 — its B7 lift root was sized for 0.835

PASS for the capacity algebra; PARTIAL for the reference planner and the ladder automation.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 15 · Proof Capacity Ladder" 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 15 · Proof Capacity Ladder · Proof Capacity Algebra and Automatic Threshold Ladder Both Ruled Closed: the Global Capacity Theorem and Free Promotion Theorem Are Established, but the Global 0.835 Heavy Certificate Remains COMPUTE-DEFERRED
PreviousRound 14 · Semantic Rebase & Compaction · II · Computation and Reproduction
NextRound 16 · Global Master-Root Pilot · II · Computation and Reproduction

Recompute reports · Runs

RUN-018Round 15: the capacity algebra is exact, but the local proof's capacity is 0.835, not 0.8350003545 — its B7 lift root was sized for 0.835

Verdict: PASS for the capacity algebra; PARTIAL for the reference planner and the ladder automation.

The report, the code and the gate log: report RUN-018.md · run018_round15_capacity_ladder.py · gate log run018-round15-capacity-ladder.json

Loads when opened…