-
Notifications
You must be signed in to change notification settings - Fork 287
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
Implement Fast CIOS for Montgomery modular multiplication #869
Comments
Hey @chfast, thanks for redirecting me from #777. Since I can't open a PR, let me present my work here. Here is the mul method from the
Here are the benchmarks performed after applying these changes starting from commit 01eca77. Build: Benchmarks: Comparison:
As you can see, the results do not seem to indicate a performance improvement. Could you review the proposed code and make suggestions? If there are no suggestions, could you also run the benchmarks? |
Why can't you? |
My bad; it's my first open source contribution, I am discovering the processes 😢 |
Hey @chfast, may I ask you to review the associated PR? |
EdMSM: Multi-Scalar-Multiplication for SNARKs and Faster Montgomery multiplication
Here is an example project that has applied the algorithm from the paper above: privacy-scaling-explorations/halo2curves#134.
The text was updated successfully, but these errors were encountered: