A lightweight and decently optimized script for finding Mersenne primes. Uses multi-core processing along with the Sieve of Eratosthenes to generate primes and the PRP/Lucas-Lehmer test to check Mersenne primes. Built-in error handling for the cherry on top.
experimental.py uses PRP to scout Mersenne primes and Lucas-Lehmer to verify them as such, while main.py simply uses Lucas-Lehmer for everything
(code was hastily written within an hour for fun)