Miller-Rabin Primality Test

This package provides an efficient JavaScript/TypeScript implementation of the Miller-Rabin primality test. It is a probabilistic algorithm used to determine if a large number (represented as a `BigInt`) is *probably* prime, rather than definitively prime. The current stable version is 1.0.1, indicating a stable API with infrequent updates typical for a specialized mathematical algorithm. Key differentiators include its focus solely on the Miller-Rabin test, making it a lightweight option for applications requiring primality testing without a broader cryptographic suite. It ships with TypeScript types, facilitating its use in modern TypeScript projects and ensuring type safety. The library is suitable for scenarios where a high probability of primality is sufficient, such as in certain cryptographic key generation processes or number theory applications.