- Dec 11, 1999
- 16,244
- 3,833
- 75
Just out of curiosity, how does this compare/contrast to what the GIMPS project is doing?
GIMPS is working on one particular form of numbers, 2^N-1. These numbers take less time to prove prime than any other numbers of the same size (as far as we know.) So that's why GIMPS has found the largest primes.
But there are other number forms that can be proven prime almost as fast. The second-largest primes recently have been found by the Seventeen or Bust project. The main reason they are the ones finding such large primes is that they have a setup that allows waiting weeks to prove a number prime.
Now, PrimeGrid is working on several, mostly smaller, prime searches. (I say mostly because you can do Seventeen or Bust work in PrimeGrid.) But for this particular race, take the Sierpinski problem statement from Seventeen or Bust, replace the "+" with a "-", and you have the Riesel problem.
Right now, in this race, we are working on sieving ("trial factoring" in GIMPS terms) for the Riesel problem.
Last edited: