Euclid Primes computed based on the Miller-Rabin Algorithm and Pollard's Rho Algorithm

Euclid Numbers are a special sequence of numbers defined by taking the product of the first n prime numbers and adding 1. Some Euclid Numbers are prime. These are called Euclid Primes. Not all Euclid Numbers are prime, but the construction guarantees that each new Euclid number is coprime with all previous primes. This idea was first used by Euclid in his proof that there are infinitely many prime numbers. Whether or not Euclid Primes are infinite is still an open problem and requires proof. This dataset was generated using the Miller-Rabin Algorithm and Pollard's Rho Algorithm. The codes used to generate the data are available in this GitHub repository. The dataset is updated as the number of calculations increases. Found primes (by number of primes used, idx): 1, 2, 3, 4, 5, 11, 75, 171, 172, 384, 457, 616, 643, 1391, 1613, 2122 (16 integer)Numer of primes used (calculated): 2636