-
Notifications
You must be signed in to change notification settings - Fork 4
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
Better algorithms for the multiplication and division functions #45
Comments
As a reminder to myself, I need to check that my unrolling is actually making a difference in the multiplication function |
Based on problems I have encountered so far, the Karatsuba versions will have to wait for the better constructors and related PRs. However, I am preparing rewrites of the O(n^2) multiplication and division functions using lessons I learned from my slice rotation function. They should be dramatically faster and also reduce cognitive complexity problems. |
Maybe this can be some inspiration for you: paritytech/parity-common#126 |
A new |
This is a continuation of #18 and #27. I am tracking this in one issue, because the specific division algorithm I have in mind uses Karatsuba multiplication. I will post updates here as I experiment more. I will also fix the sprawling technical debt of the division function.
The text was updated successfully, but these errors were encountered: