Skip to content
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

Make *_poly_mulhigh available and as efficient as *_poly_mullow #2187

Open
fredrik-johansson opened this issue Jan 26, 2025 · 1 comment
Open

Comments

@fredrik-johansson
Copy link
Collaborator

Mulhigh for polynomials is exactly the same operation as mullow, just reindexed, so we ought to make it exactly as performant in all cases.

Upside: in Newton division and reduction with precomputed inverses, we could just do a mulhigh instead of reversing the operands, doing a mullow, and reversing the result.

@albinahlback
Copy link
Collaborator

+1, in case this was not indicated enough by my reaction already

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

No branches or pull requests

2 participants