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