lehmer_gcd

hexv1.0.2

An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.

License Apache-2.0permissive3 versions1 maintainers0 deps3 weekly dl
zacky1972/lehmer_gcd
40
/ 100
Health
safe to use

[email protected] is safe to use (health: 40/100)

Health breakdown0 – 100
10/25
maintenance
0/20
popularity
25/25
security
3/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/hex/lehmer_gcd

First published · 2025-07-20T17:50:32.830639Z

Last updated · 2025-07-21T01:32:47.870899Z

lehmer_gcd — Health Score 40/100 | DepScope