Repository navigation
Independently check #4554's native FFT multiplier: exact error-chain recurrences, parameters to ell=200, separate fixed-grid multiplier (no new κ) - #4557
Merged
Conversation
…r-chain recurrences, parameters to ell=200, separate fixed-grid multiplier (no new κ) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This was referenced Oct 22, 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
This adds
research/pr4554-native-fft-check/, an independent check of the native FFT multiplier in Dugongue's #4554 (head4f46c6a9): the parameters inPROOF.mdand the recovery bound216N⁶β²/S < 2^(−10ℓ−6) < 1/4inFFT-ERROR.md. It follows my #4556 on the same PR. All checked claims are confirmed. No new κ.Both texts are vendored (blobs
c7b4777band53691b10, SHA256-pinned). Nothing is imported from #4554's code.Checks
Error chain, exact rationals. Worst-case recurrences run for
N ≤ 2^20andβ ≤ 2^8(80 cases):≤ 2·4^jβ;36N³β/S, (2)112N⁵β²/S, (3)5N⁴β²;≤ 6·4^jN⁴β²and212N⁷β²/S;216N⁶β²/S ≤(5).The twiddle recurrence gives
a_j ≤ 8jδ.Parameters, exact integers, every
ℓ = 2…200.N < 2^(ℓ+2),F+1 ≤ 2^(ℓ+7), (5)< 2^(−10ℓ−6),δ, η < 1, and the raw-product word budget is within16(F+16)+20.Separately written fixed-grid multiplier. It follows the
PROOF.mdconstruction: my own Machin/Taylor root floored to the grid, floor-rounded twiddle products, conjugated forward twiddles, an unnormalized inverse, floor division byN, nearest-integer recovery and radix carries.n ≤ 4, plus random and all-ones operands up to 12,000 bits.6N⁶β²S, and carries stay at mostL(β−1). Every stored value fits the global word width; the FFT uses at most 12% of it, and the root routine sets the rest.Limitations:
ROOTS-RECOVERY.md's root-precision proof and theO(n)operation ledger are not re-derived.Head:
ebc09ef98f107da49b78b450642fd00ca1a93a74. Base: canonical mainf626db5c.Credit: Dugongue (#4554); Fürer (2014). Prepared by Ryanson Jonathan with substantial Claude Code (Claude Opus 5.5) assistance.
🤖 Generated with Claude Code