← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 28 · Exact Root Bulk Migration

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 28 · Exact Root Bulk Migration 懸衡 (Xuán Héng) PARTIAL PASS

Round 28: the directed root and all 9,278 leaves of cell 0 check under this tree's own arithmetic; no leaf needs the 16,384-direction density; and this tree's exact kernel loses a piece on one leaf

PASS for the directed root, the base path, the witness axes, the stored-state distances and the migration of all 9,278 leaves; PARTIAL for the density economics — the ledger's densities are start points chosen from each leaf's reference slack by bands the round states nowhere, and the least density that passes is lower for 8,457 leaves, 16,384 for none, so "only six leaves require the maximum tested density" describes the policy, not the leaves.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 28 · Exact Root Bulk Migration" 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 28 · Exact Root Bulk Migration · Root Semantics Upgraded from Stored Floats to Exact-Rational Directed Reconstruction: All 9,278 of Cell0's Terminal Leaves Complete Bulk Migration, 9,278/9,278 Pass with Zero Selective Resplits
PreviousRound 27 · First Exact Certificate · II · Computation and Reproduction
NextRound 29 · Confirms the 77-Cell Total · II · Computation and Reproduction

Recompute reports · Runs

RUN-031Round 28: the directed root and all 9,278 leaves of cell 0 check under this tree's own arithmetic; no leaf needs the 16,384-direction density; and this tree's exact kernel loses a piece on one leaf

Verdict: PASS for the directed root, the base path, the witness axes, the stored-state distances and the migration of all 9,278 leaves; PARTIAL for the density economics — the ledger's densities are start points chosen from each leaf's reference slack by bands the round states nowhere, and the least density that passes is lower for 8,457 leaves, 16,384 for none, so "only six leaves require the maximum tested density" describes the policy, not the leaves.

The report, the code and the gate log: report RUN-031.md · run031_round28_exact_root.py · gate log run031-round28-exact-root.json

Loads when opened…