Primegrid

TPSieve is a sieving program for Proth and Reisel numbers (k.2^n +/- 1), written by Ken Brazier with Mac Port by Iain Bethune. It replaces PPSieve since it can simultaneously sieve for the + and - forms, making it extremely useful for twin prime searching. TPSieve (and GPU variants) currently... Platforms: Mac

AP26 searches for Arithmetic Progressions of prime numbers. The code was written by Jaroslaw Wroblewski and Geoff Reynolds, with the Mac port by Iain Bethune. To date, the largest known progression contains 26 primes, and was found in 2010 by Benoat Perichon using the AP26 software as part of... Platforms: Mac

CWPSieve is a CUDA-accelerated sieving program for Generalised Cullen and Woodall primes (n.b^n +/- 1). It is written by Ken Brazier, with the Mac port by Iain Bethune. CWPSieve is used by PrimeGrid's Cullen/Woodall (Sieve) sub-project. Platforms: Mac

GCWSieve is the CPU-equivalent of CWPSieve. It is written by Geoff Reynolds, with the Mac port by Iain Bethune. GCWSieve is used by PrimeGrid's Cullen/Woodall (Sieve) sub-project. Platforms: Mac

PPSieve is a sieving program for Proth and Reisel numbers (k.2^n +/- 1), written by Ken Brazier with Mac Port by Iain Bethune. It was used by Primegrid for the Proth Prime Search sub-project but has since been obsoleted by TPSieve, and is included here mainly for historical interest. CUDA and... Platforms: Mac

SR2Sieve is a program developed by Geoffrey Reynolds to sieve composite numbers of the forms k*b^n+/-1 or b^n+/-k. It is used by PrimeGrid for a number of sieve sub-projects, including the Prime Sierpinski Problem, Reisel Problem and 321 Prime Search. The Mac port is provided by Iain Bethune.... Platforms: Mac