Repository navigation
Paper and reproducibility snapshot
The 39-page paper A computer-assisted upper bound for the de Bruijn–Newman constant is attached as dbn-upper-bound.pdf.
The tagged source includes the exact certificates, numerical reproduction tools, pinned dependencies, and the reviewed Lean companion. It includes complete P8 kernel checks, finite-head propagation, and the reviewed auxiliary analytic lemmas.
Verification scope
The paper is a conventional computer-assisted argument with a partial Lean formalization. The headline Lean theorem remains conditional on explicitly listed analytic inputs. This release does not claim complete formalization or external peer review.
Preparation checks passed: complete numerical reproduction with fresh matrix regeneration, 51 tests, 27 kernel-trust audits, and an independent complete P8 kernel replay. See VERIFICATION.md and lean/README.md in the tagged source for the exact remaining assumptions and reproduction commands.
Downloads and integrity
dbn-upper-bound.pdf: the paper, available without GitHub's file previewer.MANIFEST.json: SHA-256 hashes and sizes for the tagged publication files.- GitHub's source archives: the code, certificates, manuscript source, and PDF at this tag.
PDF SHA-256: a3aa065e723841fa178f25c4a15a3c3060d89d86680b0577361da6b4eb0e0eb0.
For a permanent reference, use this release's version-specific PDF asset URL. The README's releases/latest/download/dbn-upper-bound.pdf link follows the latest published release.