-
Notifications
You must be signed in to change notification settings - Fork 154
Feat/fast division #1001
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Feat/fast division #1001
Conversation
a0cd1b6
to
d21d834
Compare
d21d834
to
28a868b
Compare
let d = n - m; // Degree of the quotient | ||
let a_rev = self.reverse(n); | ||
let b_rev = divisor.reverse(m); | ||
let inv_b_rev = Self::invert_polynomial_mod::<F>(&b_rev, d + 1)?; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I don't get why this is faster than just evaluating the divisor polynomial at the FFT points, doing batch inverse and then multiplying everything out and interpolating. The method for inversion seems a bit convoluted
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I don't think your suggestion works when there is a remainder
TITLE
Description
Description of the pull request changes and motivation.
Type of change
Please delete options that are not relevant.
Checklist