Current collected state Current
Observed since 20 Oct, 17:47 UTC
No superseded metadata states collected. Unchanged observations do not create new revisions.
An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations and subtraction.
hex · 2 observations shown. Missing days are unknown.
| Date / source period | Value | Observed at |
|---|---|---|
| 2026-10-22 | 4 | 2026-10-22T12:56:55.0033625Z |
| 2026-10-20 | 4 | 2026-10-20T18:54:50.6911114Z |
| Version | Published | Direct dependencies | Open version |
|---|---|---|---|
| 1.1.0Registry latest | 19 Jul 2025 | 1 |
This describes our collected data; it is not a security assessment.
Observed since 20 Oct, 17:47 UTC
No superseded metadata states collected. Unchanged observations do not create new revisions.
package:1c491d7d739ddda98b88eca529534337e194d6e03b901e7dc65173a977ad951e