Repository navigation
Independent verification: PR890 T21 moment brackets via binomial enclosures - #960
Merged
Mister-Meeseeks merged 1 commit intoOct 13, 2026
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Change and mathematical scope
Independent finite verification; no new kappa. The PR890 T21 construction uses native and conservative complex moment thresholds at adjacent
10^-24grid points. This adds a separate exact-arithmetic implementation confirming all four endpoint decisions without importing the production logarithm, exponential, supplier or owner code.The checker uses positive generalized-binomial terms, integer outward rounding and a geometric tail. It reconstructs the 681,782-child profile from 189 local calls and the idle profile, then binds the assembly, construction claim and proof to the selected record. An optional
--repositorycheck compares eight source files with the checkout without executing those sources. The written enclosure argument, exact certificate, local scope record and validation receipt are included.Concurrent work: navinor's #957, inspected at
65c931415587c444a7a1f48939842c4cf0aa0411, audits these endpoints, their reduction and surcharge attribution using transcriptions of the two retained log/exp engines plus a direct Decimal calculation. This corroborates its complex endpoint conclusions through a different exact enclosure method; it does not claim priority for the endpoint audit. Prior method credit belongs to 0x-chad's #678 for binomial enclosures of the historical PR543 bit moment. Related historical audits include arkfx's #706 and Gareth Davidson / bitplane's #813. Exact predecessor heads and overlap scope are recorded inCLAIM.json.Base:
007664306fff84fbb1c9a1b4053b69f439764034, selecting PR890 at conditional kappa0.001661957774647029. Onlyresearch/t21-binomial-audit/is added. No hypotheses, supplier implementations, selected frontier or upstream sources change.Construction credit remains with Chafik Boukhalfa (#890), Jeremy Kothe (#869/#870), Hao Yan (#858), DreamingOfClouds, eumemic, Rohan Arun, icekylinx and the repository's cumulative lineage. Prepared for David Breslauer with substantial OpenAI Codex assistance, under Apache-2.0. No independent human-review claim.
Validation
Reproduce from the repository root with Python 3.11+ and the standard library:
python3 -I -B research/t21-binomial-audit/verify.py --repository . python3 -I -O -B research/t21-binomial-audit/test_package.pyLocal validation on macOS / CPython 3.14.5 passes:
make selected-record-check, staged whitespace and exact validation-hash checks.The finite tests support the written enclosure argument and frozen numerical consequences. Full
make verify, supplier cold replay, physical admission, bit replay, the 47 outer inequalities, Lean and hosted CI were not run for this standalone addition. All-size/compiler, common-label/mutable-source, whole-call-hosting, precision/tape, analytic and bit H1-H5 obligations remain inherited. This is not a formal proof of the multiplication theorem or a claim of a stronger bound.