Skip to content

Attain the sharp Gaussian rounding budget at exact least period - #7743

Open
petalas wants to merge 2 commits into
CrocSwap:mainfrom
petalas:research/w2-1118d-gaussian-exact-period
Open

petalas wants to merge 2 commits into
CrocSwap:mainfrom
petalas:research/w2-1118d-gaussian-exact-period

Conversation

@petalas

@petalas petalas commented Nov 18, 2026 •

Copy link
Copy Markdown
Contributor

Result

Scoped proof. An exact-sum Gaussian-pair rounder with Euclidean error at most one can have finite global least period m exactly when 4 divides m. Its sharp outward norm slack is

sqrt((R^2+2R+3)/2) - sqrt((R^2+1)/2)

where R is the least odd integer at least five that does not divide m. The proof joins m/4 four-cycles in the sum-one fiber into one cycle of length m). Alternating the switches between opposite sides of adjacent rings keeps all new edges at error one. The chosen position places their absolute radial changes below the sharp bound. At exact period eight the optimum is sqrt(19)-sqrt(13)`.

This contribution was produced by Nick Petalas. aliromman's #7714 at ba5e006ed70119b23d6ef9e2e8627e43a3f4f18b supplies the lower bound and starting map. CubeJerry's #7570 supplies the annular matching, and aliromman's #7699 and #6509 supply the ring lower-bound framework and the Gaussian transform. Advance claim

Evidence and reproduction

Both verifier modes checked 20 orbits through period 13,860, 16,940 Gaussian edges, 8,430 switched successors and four controls. Each registered command took under 0.1 seconds locally on macOS arm64. The written proof covers all admissible periods.

Run from the repository root with CPython 3.12.15 and the standard library.

pkg=research/gaussian-rounder-exact-period
python3.12 -B scripts/research_package.py --package "$pkg"
python3.12 -B scripts/check_research_commit.py --package "$pkg" --check-source-history
python3.12 -I -W error -B "$pkg/verify.py"
python3.12 -I -W error -O -B "$pkg/verify.py"

The two verifier modes print PASS_GAUSSIAN_ROUNDER_EXACT_PERIOD. The metadata and commit preflight print PASS_REGISTERED_RESEARCH_PACKAGE and PASS_RESEARCH_COMMIT_BYTES.

Limitations

The proof uses the iterate theorem as a cited premise. The predecessor replays, selected cold replay, Lean, Docker and physical caller checks were unrun. Independent human and formal proof-kernel review are unclaimed. Physical caller admission, tape and stock pricing and any change to κ remain open.

Open next questions

Identify a physical caller that requires a prescribed least period. The first step is to specify its row and address schedule before pricing the splice predicate, coordinate arithmetic and workspace restoration.

Related open work

CI notes

The registered normal and optimized replays and the committed-byte/source-history preflight passed locally. The plan job and both package replays passed on 5f51e20e702c99f2bf1c878e17c72efac98f2136. Hosted run 44400042294

This PR carries the shared CI-doc and replay-gap sync used by other open PRs. The current-status tests and historical replay-gap package passed locally.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant