← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 31 · Cross-Backend Publication Candidate

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 31 · Cross-Backend Publication Candidate 懸衡 (Xuán Héng) PARTIAL PASS

Round 31: the second backend's root, marker and 9,278 leaves pass again here, and its lower ledger is Round 30's leaf for leaf — the same polygons, their membership decided again in MPFR; the queue is this tree's atlas; the wrapper rounds its exact inputs to nearest, so §3's directed rule holds for its outputs only

PASS for the root, marker 70's bound and the false negative behind its correction, all 9,278 lower leaves, the migration queue and the lock. PARTIAL for §3's rule as written: the wrapper loads every exact rational rounded to nearest, and directs only its results.

PARTIAL · PASS This page is the second layer: the finite claims of the layer-1 document "Round 31 · Cross-Backend Publication Candidate" 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 31 · Cross-Backend Publication Candidate · Independent Second Arithmetic Backend libMPFR/GMP Clears Full Replay, marker70/B7 Shard Becomes the Research Line's First Publication Candidate: Root, Upper Bound, and All 9,278 Lower Leaves Pass, Global Bound Still Unproven
PreviousRound 30 · A1 Replay & Backend Pinning · II · Computation and Reproduction
NextRound 32 · Bulk Publication-Candidate Migration · II · Computation and Reproduction

Recompute reports · Runs

RUN-034Round 31: the second backend's root, marker and 9,278 leaves pass again here, and its lower ledger is Round 30's leaf for leaf — the same polygons, their membership decided again in MPFR; the queue is this tree's atlas; the wrapper rounds its exact inputs to nearest, so §3's directed rule holds for its outputs only

Verdict: PASS for the root, marker 70's bound and the false negative behind its correction, all 9,278 lower leaves, the migration queue and the lock. PARTIAL for §3's rule as written: the wrapper loads every exact rational rounded to nearest, and directs only its results.

The report, the code and the gate log: report RUN-034.md · run034_round31_mpfr_replay.py · gate log run034-round31-mpfr-replay.json

Loads when opened…