The only software someone at PrimeGrid actually writes are the BOINC wrappers for primality and sieving programs that require them. Those wrappers are comparatively simple. As far as the code that actually does the heavy lifting, you might want to look at the Source code repositories thread where we list the locations of all the source code that we know of.

Hi all,

I'm an amateur mathematician with a big interest in prime numbers - I've been posting a bit on the Mersenne Forum over the past few months. I was wondering what method/algorithm is used on PrimeGrid projects? Is it a simple case of trial factoring each potential prime up to a certain limit or is there anything more sophisticated about it?

Thanks :)

Luke

Hi Luke,

I wrote an overview paper here which should answer some of your questions, although it's a bit dated now.

- Iain
____________
Twitter: IainBethune
Proud member of team "Aggie The Pew". Go Aggie!
3073428256125*2^1290000-1 is Prime!