binary_lehmer_gcd 1.0.0
A high-performance implementation of the greatest common divisor (GCD) algorithm that combines binary GCD with Lehmer's algorithm for optimal performance on large integers.
Links
License
Apache-2.0Downloads
-
5
5
this version -
5
5
yesterday -
5
5
last 7 days -
5
5
all time
Versions (1)
- 1.0.0 Jul 20, 2025
Dependencies (3)
- bit_length ~> 1.0
- nstandard ~> 0.1
- trailing_zeros ~> 1.0
Recent Activity
- Jul 20, 2025 Publish documentation for release 1.0.0
- Jul 20, 2025 Publish release 1.0.0
zacky1972