← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 25 · Single-Witness Full Closure
PASS for all twelve closures, node for node, for every checkpoint of the ledger, for cell 7's volumes and the monotonicity theorem, and for the singleton cover and its empty joint residual; PARTIAL for the closure-depth statistics: sec. 1 defines D_j as the least complete depth, but the ledger records the first even checkpoint, so D_max is 35 and not 36, and the median is 31.5 and not 32.
Verdict: PASS for all twelve closures, node for node, for every checkpoint of the ledger, for cell 7's volumes and the monotonicity theorem, and for the singleton cover and its empty joint residual; PARTIAL for the closure-depth statistics: sec. 1 defines D_j as the least complete depth, but the ledger records the first even checkpoint, so D_max is 35 and not 36, and the median is 31.5 and not 32.
Loads when opened…