It is so fast, I wonder what the algorithm behind it is.
[0]: https://code.jsoftware.com/wiki/Vocabulary/pco
Noted in the details section of the link you provided:
"Primality testing on numbers larger than (2^31) uses the probabilistic Miller-Rabin algorithm."
p: 100999999, the prime numbers is 2059519669
It is so fast, I wonder what the algorithm behind it is.
[0]: https://code.jsoftware.com/wiki/Vocabulary/pco