This computer took about 6 hours, 46 minutes to complete the probable prime (PRP) test using GeneferOCL2.
#Boinc windows windows 10#
The prime was verified on, 19:12:23 UTC, by Albert Pastuszka ( User of Poland using a GeForce GTX 750 in an AMD Athlon(tm) II X3 445 Processor with 6GB RAM, running Microsoft Windows 10 Professional 圆4 Edition. Tom Greer is a member of Antarctic Crunchers. This GPU took about 1 hour, 1 minute to complete the probable prime (PRP) test using GeneferOCL2. The discovery was made by Tom Greer ( tng) of the United States using an GeForce RTX 3060 in an Intel(R) Core(TM) i7-6700 CPU 3.40GHz with 24GB RAM, running Microsoft Windows 10 Core 圆4 Edition. Ranked 3 rd for Generalized Fermat primes and 97 th overall. The prime is 3,507,424 digits long and enters Chris Caldwell's The Largest Known Primes Database AP27 Search: searching for record length arithmetic progressions of primes.The Riesel problem: helping to solve the Riesel Problem.Sophie Germain Prime Search: searching for primes p and 2p+1.Sierpinski/Riesel Base 5: helping to solve the Sierpinski/Riesel Base 5 Problem.Seventeen or Bust: helping to solve the Sierpinski Problem.Fermat Divisor Search: a subset of the Proth Prime Search specificically searching for divisors of.Proth Prime Search: searching for primes of the form k♲ n+1.Prime Sierpinski Project: helping the Prime Sierpinski Project solve the Prime Sierpinski Problem.Generalized Fermat Prime Search: searching for.Extended Sierpinski Problem: helping solve the Extended Sierpinski Problem.Generalized Cullen-Woodall Search: searching for mega primes of forms n.PrimeGrid is currently running several sub-projects: MT Multithreading via web-based preferences is available. Many of these are no longer in the top 5000.į Uses fast proof tasks so no double check is necessary. 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".Ħ Includes all primes ever reported by PrimeGrid to Top 5000 Primes list.
#Boinc windows manual#
If B is infinite (∞), there's essentially an unlimited amount of work available.ĥ 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. If the B number is not underlined, new candidates (B) are also automatically created from sieve files, which typically contain millions of candidates. If both numbers are 0, we've run out of work.Ĥ Underlined work is loaded manually. If the first number (A) is 0, something is broken. "5K+" means the primes are too small to make the list.Ģ First "Available Tasks" number (A) is the number of tasks immediately available to send.ģ Second "Available Tasks" number (B) is additional candidates that have not yet been turned into workunits. Generalized Fermat Prime Search (n=17 mega)ġ "Prime Rank" is where the leading edge candidate, if prime, would appear in the Top 5000 Primes list. Pi Approximation Day Challenge (PPS-LLR): Individuals | Teams