← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 33 · Self-Refused Promotion

Lebesgue Universal Covering Problem II · Computation and Reproduction Round 33 · Self-Refused Promotion 懸衡 (Xuán Héng) PARTIAL UNMEASURED PASS

Round 33: the dominance theorem is right and the four new trees rebuild node for node; its audits rest on MPFR, not recomputed here — and the certificates the ledgers do not keep, this tree regenerates from density and rule

PASS for the dominance theorem and its polygon corollary (read), the audits' state counts, the trees of cells 48, 68, 75 and 76, all 9,285 leaves of cell 48, marker 48's upper bound, the ledgers' vertex totals and the stage counts; UNMEASURED for the audits' own results, which compare mpmath enclosures with MPFR ones and MPFR is not on this machine (PARTIAL for their root containment: t₃, t₅, t₇ yes, π and √3 not recomputable); PASS for keeping cells 47 and 48 below publication-candidate, with one correction to its reason — the missing certificates are reproducible without their bytes.

PARTIAL · UNMEASURED · PASS This page is the second layer: the finite claims of the layer-1 document "Round 33 · Self-Refused Promotion" 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 33 · Self-Refused Promotion · Cells 47 and 48 Pass Dominance Audit with Zero Failures, Yet Promotion to Publication-Candidate Is Still Refused: Cross-Backend Enclosure Dominance Cuts Re-Verification Scale to About One-Sixth
PreviousRound 32 · Bulk Publication-Candidate Migration · II · Computation and Reproduction
NextRound 34 · RHCert Origin · II · Computation and Reproduction

Recompute reports · Runs

RUN-036Round 33: the dominance theorem is right and the four new trees rebuild node for node; its audits rest on MPFR, not recomputed here — and the certificates the ledgers do not keep, this tree regenerates from density and rule

Verdict: PASS for the dominance theorem and its polygon corollary (read), the audits' state counts, the trees of cells 48, 68, 75 and 76, all 9,285 leaves of cell 48, marker 48's upper bound, the ledgers' vertex totals and the stage counts; UNMEASURED for the audits' own results, which compare mpmath enclosures with MPFR ones and MPFR is not on this machine (PARTIAL for their root containment: t₃, t₅, t₇ yes, π and √3 not recomputable); PASS for keeping cells 47 and 48 below publication-candidate, with one correction to its reason — the missing certificates are reproducible without their bytes.

The report, the code and the gate log: report RUN-036.md · run036_round33_dominance.py · gate log run036-round33-dominance.json

Loads when opened…