← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 16 · Global Master-Root Pilot

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 16 · Global Master-Root Pilot 懸衡 (Xuán Héng) PARTIAL PASS

Round 16: every pilot number rebuilds, but its frontier profile measures its 40-direction sampling; APR can never fire on this root, and 19 HARD cells hold configurations below 0.835

PASS for the pilot's computations and its three decisions; PARTIAL for the near-frontier profile and its proxy; §7's reading of APR is wrong.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 16 · Global Master-Root Pilot" 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 16 · Global Master-Root Pilot · First Full Pilot Run on the Global Master Root: Raw HARD Vastly Outnumbers the True Near-Minimizer Frontier, B7 Lift Deferred, Base-First Policy Adopted
PreviousRound 15 · Proof Capacity Ladder · II · Computation and Reproduction
NextRound 17 · D₃ Symmetry Reduction · II · Computation and Reproduction

Recompute reports · Runs

RUN-019Round 16: every pilot number rebuilds, but its frontier profile measures its 40-direction sampling; APR can never fire on this root, and 19 HARD cells hold configurations below 0.835

Verdict: PASS for the pilot's computations and its three decisions; PARTIAL for the near-frontier profile and its proxy; §7's reading of APR is wrong.

The report, the code and the gate log: report RUN-019.md · run019_round16_global_pilot.py · gate log run019-round16-global-pilot.json

Loads when opened…