Riesel Sieve Project, поиск простых чисел Налаштування

[nikelong]

Help the Riesel Sieve's efforts to solve the Riesel problem by "removing prime candidates for the remaining k's from a huge .dat file.... The .dat file contains n values from a current low of about 1,700,000 to a high of 20,000,000 per remaining k. Individual sieving efforts per single k can take two weeks to a month to sieve to a sufficient level. This coordinated sieving effort will allow us to sieve 100 times deeper and much quicker. No more sieving to 3T and stopping in frustration as the hours per factor mount, now we can go to 300T and beyond..." Before the project began, there were 101 candidate k's and over 11 million k/n pairs. See the status of all remaining k values. See an overview of the tests remaining to be completed.

Note: the project website was unreachable between July, 2008 and October, 2008. The status of the project is unknown. Look for news updates in the News column of the PrimeGrid project main web page and in the Riesel Sieve "backup forums."

As of February 18, 2005, the project has sieved all of its ks to 100T. As of June 18, 2005, the project has 5,488,686 k/n pairs left to test. As of March 22, 2006, the project has completed the 2^20 to 2^21 stage of its first run. As of February 27, 2007, the project has sieved all of its ks to 500T.

On September 16, 2005, the project offered a US$100 prize to the person who found the next prime for the project. Project participant NeoLogic found the prize-winning prime, 357659 * 2^1779748 - 1, on September 24. On September 26, the project began a Prime Bounty Contest, which rewards both prime hunter and sieve participants in the project. On September 28, 2005, the project began a Riesel Sieve Prime and Sieve Bounty donation fund at fundable. This fund will be used for rewards for project participants who find primes and who sieve significant factors for the project, according to the contest rules.

The project has found the following prime numbers recently: 417643 * 21800787 - 1 October 5, 2005
467917 * 2^1993429 - 1 December 24, 2005
450457 * 2^2307905 - 1 March 28, 2006
196597 * 2^2178109 - 1 May 9, 2006
114487 * 2^2198389 - 1 May 23, 2006
275293 * 2^2335007 - 1 September 22, 2006
26773 * 2^2465343 - 1 December 1, 2006
342673 * 2^2639439 - 1 April 24, 2007
469949 * 2^1649228 - 1 October 28, 2007
113983 * 2^3201175 - 1 May 1, 2008


The project offers the independent LLRNet client and a BOINC-based Sieve client.

To participate in the project, follow the BOINC Sieve client instructions, or use the LLRNet client to automatically download ranges of numbers and to submit results (see instructions for using it), or view instructions on the download page to use the rieselsieve.exe client. Basically you download the rieselsieve.exe executable and the riesel.dat data file (about 6 MB compressed and 27 MB fully expanded). Then you reserve a range of numbers through the automated reservation page, process them with rieselsieve.exe, and submit your resulting factors. The riesel.dat file is updated regularly and gets smaller as prime candidates are removed.

Version 0.42 of the Proth_sieve client is available for Windows and Linux as of February 12, 2004. This version is 5-10% faster than the previous version. A client should be available for FreeBSD soon. Version 3.5 of LLRNet is available as of May 2, 2005. Version 5.27 of the BOINC Sieve client is available for Windows as of August 27, 2006. The riesel.dat file was last updated on December 3, 2006. An updated Windows GUI client should be available soon.