Hey folks,

I built PrimeLab, a Java library for prime number computations and number theory utilities.

It includes:

• Deterministic Miller–Rabin up to 2⁶⁴
• Baillie–PSW test for arbitrary large integers
• Random prime & safe prime generation
• Segmented/multithreaded prime sieves
• Integer factorization (trial division, Pollard Rho, Pollard p−1, ECM sketch)
• Primality certificates (Pratt, Pocklington)
• Modular arithmetic helpers (CRT, gcd, lcm, modPow, modInverse)

Repo + tests here: https://github.com/rlNkoo/PrimeLab

Would love feedback on API design, performance, or ideas for the roadmap (e.g. full ECM).
And if you find it useful, a ⭐ on GitHub would mean a lot!