Expand description
Single-Shot Miller-Rabin (SSMR) is a specially designed primality test that uses only a single fermat test to check the primality of some integer less than 1099620565341 (approximately 1.09 trillion or 2^40). This means that it has the lowest computational complexity known and is in practice the fastest published primality test for the provided interval.
Like Machine-prime SSMR was constructed using F-Analysis
Functionsยง
- is_
prime - Fast primality in the average case, for all integers less than 1099620565341
- is_
prime_ wc - Fast primality in the worst case for all odd integers less than 1099620565341