← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 14 · Semantic Rebase & Compaction

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 14 · Semantic Rebase & Compaction 懸衡 (Xuán Héng) PARTIAL PASS

Round 14: the migration rules hold and compaction keeps readiness, but the reported capacity jumps above a failed target and the hot core drops the evidence that matters

PASS for the rules and the compaction theorem; PARTIAL on both "CLOSED" layers and on the boundary tests.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 14 · Semantic Rebase & Compaction" 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 14 · Semantic Rebase & Compaction · Semantic Implication Joins Exact-Hash Matching as a Legal Path, Hot/Cold Compaction Proved to Leave Theorem-Readiness Unchanged: The Semantic Rebase Layer and the Hot-Core Compaction Theorem Both Close
PreviousRound 13 · Autonomous Scheduler & Merger · II · Computation and Reproduction
NextRound 15 · Proof Capacity Ladder · II · Computation and Reproduction

Recompute reports · Runs

RUN-017Round 14: the migration rules hold and compaction keeps readiness, but the reported capacity jumps above a failed target and the hot core drops the evidence that matters

Verdict: PASS for the rules and the compaction theorem; PARTIAL on both "CLOSED" layers and on the boundary tests.

The report, the code and the gate log: report RUN-017.md · run017_round14_semantic_rebase.py · gate log run017-round14-semantic-rebase.json

Loads when opened…