Deterministic Primality Testing for Limited Bit Width
2 days ago
- #Miller-Rabin
- #deterministic-algorithm
- #primality-testing
- Uses deterministic Miller-Rabin primality test with bases {2, 3, 5, 7} for all 32-bit integers.
- Explains strong pseudoprimes and how testing multiple bases reduces the risk of false positives.
- Mentions historical context: Miller-Rabin (1980s), Pomerance et al. (1980), SPRP bases competition.
- Notes performance: naive implementation tests all 32-bit numbers in ~2 minutes; primesieve does it in 60ms.
- Provides alternative bases for 32-bit and 64-bit deterministic testing, with caveats about overflow.