← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 20 · First Counterexample

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 20 · First Counterexample 懸衡 (Xuán Héng) PARTIAL PASS

Round 20: every tree, marker and placement rebuilds; the package ships no code; its search minima are not minima; with exact cores B7 closes all seven marked cells it was run on

PASS for the markers, the twelve lift trees and their streams, the counterexample theorem and B23, the recorded placements, the efficiency scans, the deep comparison and the tail counts; PARTIAL for the mixed shard grammar as specified, for the horizon-dependent ranking, and for "B7 full closure of marked cell: NOT YET ACHIEVED", which holds only of the pilot's sampled lift bound.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 20 · First Counterexample" 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 20 · First Counterexample · First Concrete Counterexample Found, the Global Bound Unmoved: B23 Disqualified for One Cell, and the Witness Counterexample Theorem
PreviousRound 19 · Lazy Proof Cascade · II · Computation and Reproduction
NextRound 21 · Two-Lobe Phase-Lock · II · Computation and Reproduction

Recompute reports · Runs

RUN-023Round 20: every tree, marker and placement rebuilds; the package ships no code; its search minima are not minima; with exact cores B7 closes all seven marked cells it was run on

Verdict: PASS for the markers, the twelve lift trees and their streams, the counterexample theorem and B23, the recorded placements, the efficiency scans, the deep comparison and the tail counts; PARTIAL for the mixed shard grammar as specified, for the horizon-dependent ranking, and for "B7 full closure of marked cell: NOT YET ACHIEVED", which holds only of the pilot's sampled lift bound.

The report, the code and the gate log: report RUN-023.md · run023_round20_mixed_escalation.py · gate log run023-round20-mixed-escalation.json

Loads when opened…