primeTest

primeTest is a software library and command-line tool designed to determine whether integers are prime. It is used in cryptography, number theory research, and education, providing single-number checks and batch processing.

The core implements both deterministic and probabilistic primality tests. For numbers within 32- and 64-bit ranges, it uses established deterministic bases to produce exact results. For larger integers, it employs probabilistic methods such as Miller-Rabin with configurable rounds and the Baillie-PSW test, yielding results with adjustable confidence. The toolkit uses fast modular arithmetic, including Montgomery multiplication, to handle large operands efficiently.

PrimeTest is typically implemented with a performance-focused core in C or C++, with bindings for languages such as Python, Java, and JavaScript. A command-line interface supports quick checks, while a library API enables integration into software pipelines. It may also include utilities to generate probable primes of a given size and to perform batch testing.

Performance depends on the input size and the number of probabilistic rounds; deterministic options cover certain ranges but are not universally scalable. While suitable for educational and non-cryptographic work, cryptographic deployments should choose parameters that meet security requirements and use verified libraries.

Related topics include primality testing, Miller-Rabin, Baillie-PSW, AKS primality test, and modular arithmetic.