nstandard

A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.

Published 9 months ago

Configuration parser for libconfuse style config files.

Published 10 months ago

Easy tracing on the BEAM with Elixir

Published about 2 years ago

EpmdUp: A simple Elixir module to check and manage the Erlang Port Mapper Daemon (epmd).

Published 11 months ago

GetHost: A cross-platform Elixir library for retrieving the fully qualified hostname of a system.

Published 11 months ago

A module to activate VM nodes.

Published about 2 years ago

A library for generating delta firmware compatible with fwup

Published 9 months ago

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

Published 9 months ago

A fast implementation of the binary extended GCD algorithm for Elixir.

Published 9 months ago

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...

Published 9 months ago

A fast and efficient Elixir library for prime factorization of integers.

Published 9 months ago

A fast and efficient Elixir library for calculating modular multiplicative inverses.

Published 9 months ago

A fast and efficient Elixir library for counting trailing zeros in the binary representation of integers.

Published 9 months ago

A utility library for finding common factors of 2 between two numbers using efficient bitwise operations.

Published 9 months ago

A pure Elixir implementation of the Crandall reduction algorithm for efficient modular arithmetic.

Published 9 months ago

A high-performance Elixir library for efficient modular arithmetic using Montgomery reduction.

Published 9 months ago

A utility library for calculating the bit length of integers in Elixir.

Published 9 months ago

A mathematical library for detecting perfect powers in Elixir.

Published 9 months ago

A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.

Published 9 months ago

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.

Published 9 months ago