Investigates and implements algorithms which may yield to distributed computation of the mathematical constant Pi.

A distributed computing project currently trying to take the RSA challenge of RC5-64, and also working on OGR-24 and 25 (Optimal Golomb Rulers). Previous projects included CSC and DES.

Project to factor numbers using the elliptic curve method. Client and server software.

Cash prizes for discovery of very large prime numbers through Cooperative Computing Awards program.

Primo, a primality proving program based on the ECPP algorithm. With Primo one can check crypto-primes and prove whether or not they are actually prime.

Project provides software to search for primes of a specific form. Coordinated via email.

Algebraic Factoring of the Cryptography Modulus and Proof of Goldbach's Conjecture

Online search for Mersenne prime numbers, found largest several primes.

Attempt at factoring the huge Mersenne number 2^(2^61-1)-1. Software for Windows, DOS and Linux. Work reservation via email.

Monetary prizes for factoring certain large numbers ("RSA Numbers"), as well as breaking RSA and DES encryption schemes; announcements mailing list.

An internet group to help find the 5th largest prime number, coordinated by William Garnett. Windows/Linux software available.

A distributed attack on the Sierpinski problem, trying to find the last remaining 17 numbers.

Prof. Chris Caldwell's database of virtually every large or otherwise interesting prime number known; includes the 5,000 largest known prime numbers and records for specific types.

Mathematical project to find the smallest prime Sierpinski number.

Distributed project to help solve the Riesel problem through the use of donated unused CPU cycles.