Miller-Rabin Primality Test

The `miller-rabin` package provides an implementation of the probabilistic Miller-Rabin primality test algorithm for JavaScript. This algorithm efficiently determines if a given large number is likely prime, although it carries a small, exponentially decreasing chance of falsely identifying a composite number as prime (a 'strong liar'). The current stable version, 4.0.1, was last published 8 years ago, indicating a maintenance-only or abandoned status. It relies on the `bn.js` library for arbitrary-precision integer arithmetic, rather than native JavaScript `BigInt` introduced in later Node.js and browser versions. While functional, developers initiating new projects requiring primality testing might consider more recently updated alternatives that leverage native `BigInt` for potentially better performance and modern API integration. The package's release cadence is effectively non-existent, given its age.