PrimeGrid’s
Generalized Fermat Prime Search
On 8 June 2023, 01:41:31 UTC, PrimeGrid's Generalized Fermat Prime Search foundthe Mega Prime:6339004524288 + 1
The prime is 3,566,218 digits long and will enter Chris Caldwell's “The Largest Known
Primes Database” (https://t5k.org/primes) ranked 9th for Generalized Fermat primes and70th overall.
The discovery was made by Ken Glennie of Australia using an NVIDIA GeForce GTX
1080 Ti in an Intel(R) Xeon(R) CPU E5-2690 0 @ 2.90GHz with 32GB RAM, running
Ubuntu 20.04.5 LTS. This GPU took about 1 hour, 31 minutes to complete the probableprime (PRP) test using Genefer22. Ken Glennie is a member of the SW QLD team.
The PRP was confirmed prime on 8 June 2023 by an AMD Ryzen 9 5950X @ 3.4GHz,
running Linux Mint. This computer took about 9 hours, 33 minutes to complete theprimality test using LLR2.
The credits for the discovery are as follows:
1.
2.
3.
4.
5.
6.

Ken Glennie (Australia), discoverer
PrimeGrid, et al.
AthGFNSieve, sieve program developed by David Underbakke
GFNSvCUDA, sieve program developed by Anand NairGenefer22, probable prime program developed by Yves Gallot
LLR, primality program developed by Jean Penné
7. LLR2, primality program developed by Pavel Atnashev

Entry in “The Largest Known Primes Database” can be found here:
https://t5k.org/primes/page.php?id=136150
Using a single PC would have taken years to find this prime. So this timely discovery
would not have been possible without the hundreds of volunteers who contributed theirspare CPU cycles. A special thanks to everyone who offered their advice and/or
computing power to the search - especially Yves Gallot, Iain Bethune, DavidUnderbakke, Anand Nair, Mark Rodenkirch and Geoff Reynolds who were major forcesin moving the project forward. Also, thank you to all the sievers, especially Honza Choltand Jim Breslin. A final thanks to Michael Goetz for porting to BOINC.
The Generalized Fermat Prime Search will continue to seek even larger primes. To join
the search please visit PrimeGrid: https://www.primegrid.com

PrimeGrid’s
Generalized Fermat Prime Search
About PrimeGrid
PrimeGrid is a distributed computing project, developed by Rytis Slatkevičius andcurrently managed by Tyler Bredl, Scott Brown, Michael Goetz, Michael Gutierrez,Darren Li, Dao Heng Liu, Reginald McLean, Rytis Slatkevičius, Roman Trunov, andChristian Wallbaum.
PrimeGrid utilizes BOINC and PRPNet to search for primes with the primary goal ofbringing the excitement of prime finding to the "everyday" computer user. Simply
download the software and let your computer do the rest. Participants can choose from avariety of prime forms to search. With a little patience, you may find a large or evenrecord-breaking prime.
BOINCThe Berkeley Open Infrastructure for Network Computing (BOINC) is a software
platform for distributed computing using volunteered computer resources. It allows
users to participate in multiple distributed computing projects through a single
program. Currently BOINC is being developed by a team based at the University ofCalifornia, Berkeley led by David Anderson.
This platform currently supports projects from biology to math to astronomy. For
more information, please visit BOINC: https://boinc.berkeley.edu/
PRPNet
PRPNet is a client/server application written by Mark Rodenkirch that is specificallydesigned to help find prime numbers of various forms. It is easily ported between
various OS/hardware combinations. PRPNet does not run each PRP test itself, butrelies on helper programs, such as LLR, PFGW, phrot, wwww, and genefer to dothe work.
For more information, please visit PrimeGrid’s PRPNet forum thread:

https://www.primegrid.com/forum_thread.php?id=1215
For more information about PrimeGrid and a complete list of available prime search
projects, please visit: https://www.primegrid.com