Toggle Menu

Join PrimeGrid

Returning Participants

• Your account
• PRPNet server
• Manual Sieving
• Create or Join a Team
• Download BOINC
• Applications
• Make a donation

Community

• Participant Profiles
• PrimeGrid Message boards
• PrimeGrid Discord chat server [external]
• PrimeGrid Wiki [external]
• Mersenneforum.org Forums [external]

Leader Boards

• Challenge Series
• Top Countries
• Top Participants
• Top Computers
• Top Teams
• Top Prime Finders

Results

• PrimeGrid Mega Primes
• PrimeGrid Primes by Project
• PrimeGrid AP27
• PrimeGrid Wieferich & WSS
• Published results

Other

• Server status
• Subproject status
• Task status
• Fastest GPUs
• Fastest CPUs
• Computer types

Message boards : Problems and Help : hi i am new

Author	Message
LuisCortesGomez Send message Joined: 13 Dec 18 Posts: 1 ID: 1085111 Credit: 2,195,704 RAC: 0	Message 123486 - Posted: 13 Dec 2018 | 17:55:42 UTC
	hi i want to know where i can find information about projects, thank you.
	ID: 123486 |
Michael Goetz Volunteer moderator Project administrator Send message Joined: 21 Jan 10 Posts: 13620 ID: 53948 Credit: 266,216,437 RAC: 301,246	Message 123488 - Posted: 13 Dec 2018 | 18:28:57 UTC - in response to Message 123486.
	hi i want to know where i can find information about projects, thank you. First of all, welcome to PrimeGrid! The forums listed below this forum, under "sub-projects" provide information on all of our subprojects. There's about 25 in total. This is a summary: LLR projects: LLR is a program used to test the primality of large numbers. We have 13 different LLR sub projects, with tasks that range in duration from several minutes to several days. These are CPU tasks. The LLR projects are: 321, Cullen, ESP, GCW, PSP, PPS, PPSE, PPS-MEGA, SoB, SR5, SGS, TRP, and Woodall. All LLR projects search for numbers of the form k*bn±1. Sieving: In support of the LLR projects, we also do sieving. The two current sieving projects are GCW-Sieve and PPS-Sieve. PPS-Sieve has both CPU and GPU tasks, while GCW-Sieve is available for only CPUs. AP27: This project searches for arithmetic sequences of relatively small primes. It has both CPU and GPU tasks available. GFN: GFN (Generalized Fermat Number) is similar to LLR, but operates with a different type of number. GFN's are numbers of the form b2n+1. We have different projects ranging from n=15 to n=22. GFN-15 searches for the smallest primes at PrimeGird (about 250 thousand digits) while GFN-22 searches for the largest primes at PrimeGrid (about 21 million digits). GFN tasks are available for both CPUs and GPUs, except for GFN-15 and GFN-22 which are only available for GPUs. There's also some work we do outside of the BOINC system (PRPNet and manual sieving), but I'd leave that until later and get familiar with our BOINC projects first. ____________ My lucky number is 75898524288+1
	ID: 123488 |

Message boards : Problems and Help : hi i am new