A demo page that implements the Miller-Rabin primality test to accurately detect primes for all numbers less than 318665857834031151167461 and compare its speed against a simple division based primality test algorithm.