This category is for distributed computing projects to either discover prime numbers, or factor very large numbers.
More information
More information
Related categories 1
Sites 9
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.
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.
Mathematical project to find the smallest prime Sierpinski number.
A distributed attack on the Sierpinski problem, trying to find the last remaining 17 numbers.
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.
A distributed computing project currently working on RC5-72 and OGR-27 (Optimal Golomb Rulers). Previous projects included CSC and DES.
Mathematical project to find the smallest prime Sierpinski number.
Project provides software to search for primes of a specific form. Coordinated via email.
Investigates and implements algorithms which may yield to distributed computation of the mathematical constant Pi.
Project to factor numbers using the elliptic curve method. Client and server software.
A distributed attack on the Sierpinski problem, trying to find the last remaining 17 numbers.
Online search for Mersenne prime numbers, found largest several primes.
Algebraic Factoring of the Cryptography Modulus and Proof of Goldbach's Conjecture
