pishleback / pishleback/Algebraeon
NTT implementation for polynomial multiplication
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 82
- Forks
- 10
- PR merge metrics
- No merged PRs in 30d
Description
Currently the polynomial multiplication is done with the classical O(n^2) algorithm.
Would be nice to use the Number theoretic transform to speed it up to O(n log(n)) in finite ring.
It does not apply to all finite ring but only to some related to prime numbers.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by locating the existing polynomial multiplication entry point and understanding how finite rings and prime-related constraints are represented. Determine which rings support the transform, then compare the implementation against the current classical multiplication and define completion with tests or benchmarks showing correct results and improved scaling.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100