-
-
Notifications
You must be signed in to change notification settings - Fork 1.7k
factor: Optimize factor command with advanced factorization algorithms #9587
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?
Conversation
561e1cf to
3673060
Compare
|
Can this close #1456 ? |
|
GNU testsuite comparison: |
|
Wow, this looks awesome to see a highly optimized version of the factor command. I won't have time to look at it today (most likely tomorrow afternoon), but this is good stuff right here |
3673060 to
78e5601
Compare
|
GNU testsuite comparison: |
78e5601 to
e92a74c
Compare
|
GNU testsuite comparison: |
e92a74c to
e4125bf
Compare
|
cool a few things:
|
e4125bf to
52d1aa4
Compare
CodSpeed Performance ReportMerging #9587 will not alter performanceComparing Summary
Benchmarks breakdown
Footnotes
|
|
GNU testsuite comparison: |
f2e738b to
2ae7cdd
Compare
|
GNU testsuite comparison: |
2ae7cdd to
57ca461
Compare
|
GNU testsuite comparison: |
baeabd8 to
7884538
Compare
|
GNU testsuite comparison: |
7884538 to
cffa831
Compare
cffa831 to
7c62885
Compare
|
GNU testsuite comparison: |
|
GNU testsuite comparison: |
90f5f44 to
69e10cf
Compare
|
GNU testsuite comparison: |
69e10cf to
21a1ae4
Compare
|
GNU testsuite comparison: |
bb23135 to
55b9f46
Compare
|
GNU testsuite comparison: |
55b9f46 to
b2c4afa
Compare
|
GNU testsuite comparison: |
aecb589 to
2140911
Compare
|
GNU testsuite comparison: |
4a0f720 to
fa4e1a5
Compare
|
GNU testsuite comparison: |
fa4e1a5 to
a46baa4
Compare
|
GNU testsuite comparison: |
a46baa4 to
3085bac
Compare
|
GNU testsuite comparison: |
3085bac to
5b70e0a
Compare
|
GNU testsuite comparison: |
5b70e0a to
fe6b0e5
Compare
|
GNU testsuite comparison: |
|
next phase for 400bit |
Implement modular factorization architecture with Pollard-Rho, ECM, and Fermat algorithms. Adds Montgomery arithmetic optimization and u64 fast-path for improved u128 performance. Dynamic algorithm selection based on input size routes through unified entry point.
Fixes #1456
All inputs processed in ~35-36ms consistently