← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 13 · Autonomous Scheduler & Merger

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 13 · Autonomous Scheduler & Merger 懸衡 (Xuán Héng) PARTIAL PASS

Round 13: the merge rules are sound and the race replays, but the reference merger never writes the aggregate and cannot hold two valid certificates

PASS for the merge theorems and the race; PARTIAL on the scheduler/merger ABI.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 13 · Autonomous Scheduler & Merger" 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 13 · Autonomous Scheduler & Merger · Certified Ancestor Contraction Theorem Proved: A Late Strong Certificate Can Absorb an Already-Split Subtree, Closing the Autonomous Scheduler/Merger ABI and Passing a Live Concurrency-Race Test
PreviousRound 12 · Checkpoint Crystal · II · Computation and Reproduction
NextRound 14 · Semantic Rebase & Compaction · II · Computation and Reproduction

Recompute reports · Runs

RUN-016Round 13: the merge rules are sound and the race replays, but the reference merger never writes the aggregate and cannot hold two valid certificates

Verdict: PASS for the merge theorems and the race; PARTIAL on the scheduler/merger ABI.

The report, the code and the gate log: report RUN-016.md · run016_round13_autonomous_scheduler.py · gate log run016-round13-autonomous-scheduler.json

Loads when opened…