This category is for distributed computing projects to either discover prime numbers, or factor very large numbers.
Related categories 1
Investigates and implements algorithms which may yield to distributed computation of the mathematical constant Pi.
A distributed computing project currently working on RC5-72 and OGR-27 (Optimal Golomb Rulers). Previous projects included CSC and DES.
Project to factor numbers using the elliptic curve method. Client and server software.
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.
Generalized Fermat Primes Search
Project provides software to search for primes of a specific form. Coordinated via email.
Goldbach's Conjecture and Factoring the Cryptographic Modulus
Algebraic Factoring of the Cryptography Modulus and Proof of Goldbach's Conjecture
Great Internet Mersenne Prime Search
Online search for Mersenne prime numbers, found largest several primes.
The Prime Sierpinski Problem
Mathematical project to find the smallest prime Sierpinski number.
Seventeen Or Bust
A distributed attack on the Sierpinski problem, trying to find the last remaining 17 numbers.
Last update:December 22, 2016 at 9:15:05 UTC