Repository navigation
Audit Gaussian chirp domain and exact block budgets - #684
Merged
Mister-Meeseeks merged 1 commit intoOct 14, 2026
Merged
Conversation
Contributor
|
Integrated at Restricted generated Gaussian chirp domain and integer-window/precision arithmetic. Scoped source and arithmetic replay passed; #371 grid-rounding issue remains separate. Full analytic error/tape theorem outside scope. The scoped package check passed at |
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.
The Gaussian chirp construction already replaces the broad upstream no-sort hypothesis with
alpha^-2 <= theta <= 1/4before inserting the new lemma. This research note / mathematical audit resolves the domain caveat in PR #371 at its pinned head and verifies the associated integer-window and sufficient-precision arithmetic. No new kappa is claimed.The distinction has a concrete control:
p=101, alpha=2, s=2, t=19satisfies the old header, but the new E-window recipe would omitq_1=10from a block computing only0,...,7. The actual generated domain rejects this tuple. This is not a counterexample to the original slower theorem or to the restricted generated construction. PR #371's separate grid-rounding defect remains genuine; this audit does not incorporate its correction.The new package includes written uniform arithmetic arguments, source and generated-manuscript SHA256 pins, a deterministic receipt, and two independent standard-library arithmetic implementations. The main command checks 21,773 parameter pairs, 968,049 generic correction-window cases plus forward-window residues, and seven negative controls. The second implementation checks 168,093 pairs and five controls using a different exact window-ceiling formula. Finite checks are explicitly distinguished from the written universal arguments and from a formal proof.
Base:
66849e1475c930fd7732b1a0067ffee7e1e95f60. Audited PR #371:988ef67986c313445936fc7103908b6163b9d47e; its generator and upstream resampling file were checked byte-for-byte against the base. The accepted #626/#543 certificate remains unchanged. All additions are confined toresearch/gaussian-chirp-domain-audit/.Validation passed:
The first command prints
PASS_SCOPED_GAUSSIAN_CHIRP_DOMAIN_AUDIT; the second printsPASS_INDEPENDENT_GAUSSIAN_BUDGETS pairs=168093 controls=5. Tested with Python 3.14.7. Gaussian tails, the internal error enclosure, transcendental approximation, packing, tape movement, Neumann evaluation and the full multiplication theorem remain outside the audit. This is scoped evidence for #371's review, not certification of the entire PR.Assignment seed 64, adversarial mathematical audit. No pinned or other sprint coordination issue existed, so the claim is recorded locally. A final refresh of 500 open PRs found no overlapping audit; #479/#481/#489 address distinct Gaussian mechanisms.
Credit eumemic's fast-Gaussian construction, icekylinx's shifted enclosure, Artus Krohn-Grimberghe and PR #371's disclosed GPT-6 Pro/Codex rounding work, and Harvey–van der Hoeven's analytic algorithms. Contribution by Effy Elden (ineffyble), with substantial OpenAI Codex assistance including a separate AI source/arithmetic reviewer; no human peer review or formal verification is claimed. Apache-2.0 and predecessor notices are retained.