EPR: A Factoring and Primality checking library for C++

ne plus ultra primality testing for machine-sized integers

A prime k-tuple finder based on the rug crate.

Test if a value is a prime number.

A high-performance library for primality testing using Miller-Rabin and Fermat algorithms.

Implementation of the Miller-Rabin primality test.

Ultra-Fast O(L) Deterministic Primality Testing — Multi-Architectural Pass Engine (MAPE-V3) Deterministic multi-layer prime testing for giant numbers using single-pass linear mod engines (Muamer Engine).

Test if a value is a composite number.

Test if a number is composite.

An implementation of the Miller-Rabin primality test for `num_bigint::BigUint`

Test if a number is prime.

Convenience wrapper for machine-prime

Discover prime numbers without math

Implementation of Solovay-Strassen Test Primality with GMP

Generate Euler Shift Primes

Lean 4 formalization of the golden moment and certified structural constraints for Agrawal's conjecture at r = 5.

Maths stuff, including cryptographic attacks implementations, and others useful algorithms

Source-available Rust GUI and CLI for MAX Prime Challenge: structured distributed probable-prime search with reproducible local verification and result exports.

A python script that would check the primality of positive integers.

Simply put, this program is a primality test program, it tests whether a number you input is prime or not using one of today's most modern efficient methods of primality testing: miller's test.