← Lebesgue Universal Covering Problem / II · Computation and Reproduction / Round 24 · Refuted Premature Escalation
PASS for the certificate, rebuilt bit for bit, for cells 1–3 at every recorded depth, for the joint-dominance and joint-necessity theorems and the admission logic; PARTIAL for the tail-collapse evidence, which reads its first two values off the 96-direction pilot and the rest off the exact-core tree; and the one residual left, cell 3, is not one: the same exact tree closes it at lift depth 34.
Verdict: PASS for the certificate, rebuilt bit for bit, for cells 1–3 at every recorded depth, for the joint-dominance and joint-necessity theorems and the admission logic; PARTIAL for the tail-collapse evidence, which reads its first two values off the 96-direction pilot and the rest off the exact-core tree; and the one residual left, cell 3, is not one: the same exact tree closes it at lift depth 34.
Loads when opened…