Ra/poly factorization 10 - #141
Merged
Merged
Conversation
spaceships
approved these changes
Aug 21, 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
2 participants
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.
Add blocked Kaltofen–Shoup distinct-degree factorization as the production alternative to the existing reference implementation of #140 .
The algorithm reduces the number of Frobenius steps relative to reference distinct-degree factorization. Large Fq12 performance remains limited by the existing polynomial multiplication backends.
BN254 Fq12, degree 96:
- Crypto3 mixed-radix: 154.035 s
- FLINT: 8.287 s
- FLINT is 18.6x faster.
The gap with FLINT is getting bigger, probably for a composition effect. I analyzed the differences in the algorithm (which are unrelated to the polynomial multiplication backend) and they did not seem to explain the discrepancy.
Related to #114