* Only 6 tasks, 1 affecting scoring positions, of Euler's Number Challenge (AP27) cleanup work is currently available! *
1 "Prime Rank" is where the leading edge candidate, if prime, would appear in the Top 5000 Primes list. "5K+" means the primes are too small to make the list.
2 First "Available Tasks" number (A) is the number of tasks immediately available to send.
3 Second "Available Tasks" number (B) is additional candidates that have not yet been turned into workunits. If the first number (A) is 0, something is broken. If both numbers are 0, we've run out of work.
4 Underlined work is loaded manually. If the B number is not underlined, new candidates (B) are also automatically created from sieve files, which typically contain millions of candidates. If B is infinite (∞), there's essentially an unlimited amount of work available.
5 One or two tasks (A) are generated automatically from each candidate (B) when needed, so the total number of tasks available without manual intervention is either A+B or A+2*B. Normally two tasks are created for each candidate, however only 1 task is created if fast proof tasks are used, as designated by an "F" next to "CPU" or "GPU".
6 Includes all primes ever reported by PrimeGrid to Top 5000 Primes list. Many of these are no longer in the top 5000.
F Uses fast proof tasks so no double check is necessary. Everyone is "first". MT Multithreading via web-based preferences is available. MT-A Multithreading via app_config.xml is available.
About
PrimeGrid's primary goal is to advance mathematics by enabling everyday computer users to contribute their system's processing power towards prime finding. By simply
downloading and installing BOINC and attaching to the PrimeGrid project,
participants can choose from a variety of prime forms to search. With a little patience, you may find a large or even record
breaking prime and enter into Chris Caldwell's The Largest Known Primes Database with a multi-million digit prime!
PrimeGrid's secondary goal is to provide relevant educational materials about primes. Additionally, we wish to contribute to the
field of mathematics.
Lastly, primes play a central role in the cryptographic systems which are used for computer security. Through the study of prime
numbers it can be shown how much processing is required to crack an encryption code and thus to determine whether current
security schemes are sufficiently secure.
PrimeGrid is currently running several sub-projects:
321 Prime Search: searching for
mega primes of the form 3·2n±1.
Cullen-Woodall Search: searching for
mega primes of forms n·2n+1 and
n·2n−1.
Generalized Cullen-Woodall Search: searching for mega primes of forms n·bn+1 and
n·bn−1 where n + 2 > b.
The discovery was made by Marc Wiseler (McDaWisel) of Ireland using an AMD Ryzen 9 5900X 12-Core Processor with 16GB RAM, running Microsoft Windows 10 Professional x64 Edition.
This computer took about 2 hours and 41 minutes to complete the primality test using LLR2. Marc Wiseler is a member of the Storm team.
On 28 August 2021, 09:10:17 UTC, PrimeGrid's Generalized Cullen/Woodall Prime Search found the largest known Generalized Cullen prime
2525532·732525532+1
The prime is 4,705,888 digits long and enters Chris Caldwell's The Largest Known Primes Database
ranked 1st for Generalized Cullen primes and 24th overall.
The discovery was made by Tom Greer (tng) of the United States using an Intel(R) Core(TM) i9-10920X CPU @ 3.50GHz with 16GB RAM, running Microsoft Windows 10 Professional x64 Edition.
This computer took about 10 hours and 40 minutes to complete the primality test using LLR2. Tom Greer is a member of the Antarctic Crunchers team.
The prime was verified on 28 August 2021, 18:01 UTC, by an Intel(R) Core(TM) i7-9800X CPU @ 3.80GHz with 32GB of RAM, running CentOS. This computer took 3 hours and 39 minutes to complete the primality test using LLR2.
The discovery was made by Tom Greer (tng) of the United States using an Authentic AMD Ryzen 9 5950X CPU @ 4.90GHz with 32GB RAM, running Microsoft Windows 10 Professional.
This computer took about 2 hours and 46 minutes to complete the primality test using LLR2. Tom Greer is a member of the Antarctic Crunchers team.
Geminids Shower Challenge starts December 7th The ninth and final challenge of the 2021 Series will be a 10-day challenge marking the yearly Geminids Meteor Shower. The challenge will be offered on the GFN-21, GFN-22, and GFN-DYFL subprojects, beginning 7 December 07:00 UTC and ending 17 December 07:00 UTC.
SR5 Mega Prime Find! On 8 October 2021, 01:38:53 UTC, PrimeGrid’s Sierpinski/Riesel Base 5 Problem project eliminated k=102818 by finding the mega prime:
The discovery was made by Wes Hewitt (emoga) of Canada using an AMD Ryzen 9 5950X 16-Core Processor with 32GB RAM, running Microsoft Windows 10 Professional x64 Edition. This computer took about 1 hour, 29 minutes to complete the primality test using LLR2. Wes Hewitt is a member of TeAm AnandTech team.
The prime was verified on 10 October 2021, 20:14 UTC, by an Intel(R) Core(TM) i7-9800X CPU @ 3.80GHz with 32GB of RAM, running CentOS. This computer took 20 hours and 39 minutes to complete the primality test using LLR2.
Euler's Number Challenge starts November 23rd The eighth challenge of the 2021 Series will be a 3-day challenge in Thanksgiving™ of the anniversary of the introduction of e, or Euler's Number! The challenge will be offered on the AP27 Search subproject, beginning 23 November 05:00 UTC and ending 26 November 05:00 UTC.
To participate in the Challenge, please select only the AP 27 (AP27) project in your PrimeGrid preferences section.
Martin Gardner's Birthday Challenge starts October 21 The seventh challenge of the 2021 Series will be a 7-day challenge in celebration of the 107th (prime number!) birthday of beloved American science communicator, Martin Gardner. The challenge will be offered on the GCW-LLR application, beginning 21 October 00:00 UTC and ending 28 October 00:00 UTC.
To participate in the Challenge, please select only the Generalized Cullen/Woodall Prime Search LLR (GCW) project in your PrimeGrid preferences section.
