Repository navigation
Conversation
This was referenced Nov 18, 2026
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.
Summary
Scoped proof with an exact finite witness. An injective Gaussian-pair rounder that preserves the exact sum and has Euclidean error at most one needs forward outward norm slack at least
sqrt(5)-sqrt(3). In the sum-one fiber, eight inputs of squared norm at most five have only six distinct legal outputs under a strictly smaller bound. An explicit matching attains equality on those eight inputs.The lower bound uses no square identity, phase covariance, periodicity or surjectivity. Global attainment, physical implementation and an actual caller binding remain open. Independent human and formal proof-kernel review are unclaimed.
This contribution was produced by Nick Petalas. aliromman's #6509 supplies the ideal pair and exact-sum contract. CubeJerry's #7570 supplies the fixed-sum context and leaves this forward lower bound open. Advance claim
Evidence and reproduction
Normal and optimized CPython 3.12.15 checks enumerate 32 error-one edges, 16 strict edges to six outputs, four threshold edges and the eight-edge matching. Both direct modes and the registered package replay pass locally. The committed-byte and source-history preflight passes. The two registered commands took 0.01 and 0.02 seconds when timed directly on macOS arm64.
From the repository root, with CPython 3.12 and its standard library. The first line records the exact local interpreter path. At another checkout, use the local CPython 3.12 path.
Expected statuses are
PASS_GAUSSIAN_EXACT_SUM_FORWARD_SLACK,PASS_REGISTERED_RESEARCH_PACKAGEandPASS_RESEARCH_COMMIT_BYTES.Open next questions
Can a global exact-sum map attain
sqrt(5)-sqrt(3)? A first step is to check complete neighborhoods beyond squared norm five at this exact threshold. The square-to-swap construction gives a global upper bound ofsqrt(19)-sqrt(13). #7570 proofRelated open work
CI notes
This PR carries the shared CI-doc and replay-gap sync used by other open PRs.
All three hosted checks passed at
317fecee459888f4e4fecd8ca62adeb7583f696din run 44199854171. plan, replay (research/gaussian-exact-sum-forward-slack), replay (research/historical-selected-replay-gap). The six current-status tests and the registered historical replay also passed locally.Merge Danger
Two-way. One commit adds the research package. A separate commit syncs the CI guide and the historical verifier.