Riesel Sieve

From Mersennewiki
Jump to: navigation, search

The Riesel Sieve Project is a distributed computing project. It is now a part of PrimeGrid.


Riesel Sieve is a distributed effort to prove the Riesel conjecture (which states that k=509203 is the smallest possible Riesel number). To do that, they have to find primes for all the remaining k values to prove that they are not Riesel numbers.

How to participate

There are two ways of contributing to Riesel Sieve: sieving and LLR Testing.


To sieve, people reserve ranges on the website and then use Mikael Klassons proth_sieve program. Instructions on how to use proth_sieve can be found on Omboo Hankvalds guidesites

LLR Testing

To perform LLR tests, people use LLRNet to automatically download tests, test them for primality and upload the results. Instructions on how to use LLRNet can be found on Omboo Hankvalds guidesites].


As of 2005-11-22, 74 k values are left as possible candidates, which need to be eliminated. All 74 are being sieved by Riesel Sieve, but only 69 of them are being LLR tested by Riesel Sieve. The remaining 5 k values are being tested by individuals independent of the Riesel Sieve project. Those values are left over from the time before Riesel Sieve started, when all testing was done independently. As values have been released from testing by individuals, the Riesel Sieve project has taken over testing them.


The sieve(n<50M) reached the optimal sieve zone and it's now suspended.

External links