Difference between revisions of "Category:Distributed computing project"

From Prime-Wiki
Jump to: navigation, search
m
m
(6 intermediate revisions by the same user not shown)
Line 9: Line 9:
 
**Seti@Home BOINC (newer version of Seti@Home) http://setiathome.berkeley.edu/
 
**Seti@Home BOINC (newer version of Seti@Home) http://setiathome.berkeley.edu/
 
*CapCal (evaluate performance of websites and earn money. Not always work to do) http://www.capcal.com/
 
*CapCal (evaluate performance of websites and earn money. Not always work to do) http://www.capcal.com/
*[[Cunningham Project]] (factoring numbers of the form a<sup>n</sup>+1 or a<sup>n</sup>-1 with a=2, 3, 5, 6, 7, 10, 11, 12, with bounded exponent n) http://homes.cerias.purdue.edu/~ssw/cun/index.html
+
*[[Cunningham project]] (factoring numbers of the form a<sup>n</sup>+1 or a<sup>n</sup>-1 with a=2, 3, 5, 6, 7, 10, 11, 12, with bounded exponent n) http://homes.cerias.purdue.edu/~ssw/cun/index.html
 
*D2OL (searches for cures) http://www.d2ol.com/ - '''''ended'''''
 
*D2OL (searches for cures) http://www.d2ol.com/ - '''''ended'''''
 
*DIMES (study the Internet) http://www.netdimes.org/
 
*DIMES (study the Internet) http://www.netdimes.org/
 
*Distributed.net (breaking crypto and finding Optimal Golomb Rulers) http://www.distributed.net
 
*Distributed.net (breaking crypto and finding Optimal Golomb Rulers) http://www.distributed.net
 
*DPAD Muon1 (simulates a particle accelerator) http://stephenbrooks.org/muon1/
 
*DPAD Muon1 (simulates a particle accelerator) http://stephenbrooks.org/muon1/
*[[ECMNET]] (find factors of [[Cunningham Project|Cunningham numbers]]) http://www.loria.fr/~zimmerma/ecmnet/
+
*[[ECMNET]] (find factors of [[Cunningham project|Cunningham numbers]]) http://www.loria.fr/~zimmerma/ecmnet/
 
*[[ElevenSmooth]] (searching for factors of the Mersenne number M(3326400) = <math>2^{3326400}-1</math>) http://home.earthlink.net/~elevensmooth/
 
*[[ElevenSmooth]] (searching for factors of the Mersenne number M(3326400) = <math>2^{3326400}-1</math>) http://home.earthlink.net/~elevensmooth/
 
*eOn (calculating chemical reactions and stuff) http://eon.cm.utexas.edu/
 
*eOn (calculating chemical reactions and stuff) http://eon.cm.utexas.edu/
Line 40: Line 40:
 
*Majestic-12 Distributed Search Engine project http://www.majestic12.co.uk works towards creation of the largest WWW search engine index on the Internet.
 
*Majestic-12 Distributed Search Engine project http://www.majestic12.co.uk works towards creation of the largest WWW search engine index on the Internet.
 
*[[Mersenne@home]] (finding Mersenne prime numbers) http://mersenneathome.net/
 
*[[Mersenne@home]] (finding Mersenne prime numbers) http://mersenneathome.net/
*[[Mersenneplustwo Factorizations]] (factors numbers of the form 2<sup>p</sup>+1) http://bearnol.is-a-geek.com/Mersenneplustwo/Mersenneplustwo.html
+
*[[Mersenneplustwo factorizations]] (factors numbers of the form 2<sup>p</sup>+1) http://bearnol.is-a-geek.com/Mersenneplustwo/Mersenneplustwo.html
 
*[[MM61]] (a search for a factor of 2<sup>2<sup>61</sup>-1</sup>-1) http://anthony.d.forbes.googlepages.com/mm61.htm
 
*[[MM61]] (a search for a factor of 2<sup>2<sup>61</sup>-1</sup>-1) http://anthony.d.forbes.googlepages.com/mm61.htm
 
*[[NFS@Home]] (doing the lattice sieving step in the Number Field Sieve factorization of large integers) http://escatter11.fullerton.edu/nfs/
 
*[[NFS@Home]] (doing the lattice sieving step in the Number Field Sieve factorization of large integers) http://escatter11.fullerton.edu/nfs/
Line 62: Line 62:
 
*[[RSA Lattice Siever (2.0)|RSA Lattice Siever (2.0) (RSALS)]] (helping others factoring project such as mersenneforum or XYYXf  achieve their academic goals) http://boinc.unsads.com/rsals/
 
*[[RSA Lattice Siever (2.0)|RSA Lattice Siever (2.0) (RSALS)]] (helping others factoring project such as mersenneforum or XYYXf  achieve their academic goals) http://boinc.unsads.com/rsals/
 
*Seti@Home (searches for little green men) http://setiathome.ssl.berkeley.edu
 
*Seti@Home (searches for little green men) http://setiathome.ssl.berkeley.edu
*[[Seventeen or Bust]] (attacking the [[Sierpinski problem]]) http://www.seventeenorbust.com
+
*[[Seventeen or Bust]] (attacking the [[Sierpiński problem]]) http://www.seventeenorbust.com
 
*TSC Childhood Diseases (searching for cures using D2OL) http://www.childhooddiseases.org/community_tsc.html - '''''ended'''''
 
*TSC Childhood Diseases (searching for cures using D2OL) http://www.childhooddiseases.org/community_tsc.html - '''''ended'''''
 
*übero (commercial work) http://www.ubero.com/ - '''''on hold'''''
 
*übero (commercial work) http://www.ubero.com/ - '''''on hold'''''
Line 75: Line 75:
 
*[[100 Million Digit Prefactor Project]] (removes exponents which can be factored from [[GIMPS]]' search) http://www.mersenneforum.org/showthread.php?t=10693
 
*[[100 Million Digit Prefactor Project]] (removes exponents which can be factored from [[GIMPS]]' search) http://www.mersenneforum.org/showthread.php?t=10693
 
*[[321 Search]] (searching for primes of the form 3&times;2<sup>n</sup>-1) http://www.mersenneforum.org/321search/
 
*[[321 Search]] (searching for primes of the form 3&times;2<sup>n</sup>-1) http://www.mersenneforum.org/321search/
*[[Conjectures 'R Us]] (proving many of the Riesel and Sierpinski conjectures for bases 2 thru 1030 that are not currently being worked on by other projects or efforts) http://www.mersenneforum.org/forumdisplay.php?f=81
+
*[[Conjectures 'R Us]] (proving many of the Riesel and Sierpiński conjectures for bases 2 thru 1030 that are not currently being worked on by other projects or efforts) http://www.mersenneforum.org/forumdisplay.php?f=81
*[[Five or Bust|Five or Bust - The Dual Sierpinski Problem]] (solving the dual Sierpinski problem) http://www.mersenneforum.org/forumdisplay.php?f=86
+
*[[Five or Bust|Five or Bust - The Dual Sierpiński Problem]] (solving the dual Sierpiński problem) http://www.mersenneforum.org/forumdisplay.php?f=86
 
*[[Riesel Prime Search]] (searches for primes of the form k<300 &times; 2<sup>n</sup> - 1, as well as some very low and very high weight k's) http://www.mersenneforum.org/forumdisplay.php?s=&forumid=59
 
*[[Riesel Prime Search]] (searches for primes of the form k<300 &times; 2<sup>n</sup> - 1, as well as some very low and very high weight k's) http://www.mersenneforum.org/forumdisplay.php?s=&forumid=59
 
*[[No Prime Left Behind]] (searches for primes of the form 300<k<3200 &times; 2<sup>n</sup>-1) http://www.mersenneforum.org/forumdisplay.php?f=82
 
*[[No Prime Left Behind]] (searches for primes of the form 300<k<3200 &times; 2<sup>n</sup>-1) http://www.mersenneforum.org/forumdisplay.php?f=82
 
*Factoring (factors different kinds of numbers) http://www.mersenneforum.org/forumdisplay.php?f=19
 
*Factoring (factors different kinds of numbers) http://www.mersenneforum.org/forumdisplay.php?f=19
 
*[[Lone Mersenne Hunters]] (searches for [[Mersenne prime]]s outside the normal range of exponents assigned by [[PrimeNet]]) http://www.mersenneforum.org/forumdisplay.php?f=12
 
*[[Lone Mersenne Hunters]] (searches for [[Mersenne prime]]s outside the normal range of exponents assigned by [[PrimeNet]]) http://www.mersenneforum.org/forumdisplay.php?f=12
*[[Prime Sierpinski Project]] (searches for the smallest [[Prime Sierpinski number]]) http://www.mersenneforum.org/forumdisplay.php?f=48
+
*[[Prime Sierpiński Project]] (searches for the smallest [[Sierpiński number]]) http://www.mersenneforum.org/forumdisplay.php?f=48
*[[Sierpinski/Riesel Base 5]] (searches for the smallest [[base 5 Sierpinski number]] and [[base 5 Riesel number]]) http://www.mersenneforum.org/forumdisplay.php?f=54
+
*[[Sierpiński-Riesel Base 5]] (searches for the smallest [[Sierpiński number base 5]] and [[Riesel number base 5]]) http://www.mersenneforum.org/forumdisplay.php?f=54
 
*[[Twin Prime Search]] (searches for large twin primes) http://www.mersenneforum.org/forumdisplay.php?f=65
 
*[[Twin Prime Search]] (searches for large twin primes) http://www.mersenneforum.org/forumdisplay.php?f=65
 +
*[[Multifactorial Prime Search]] searches for [[multifactorial prime]]s of the form <math>n!_j{±}1</math>
  
 
==Other stuff==
 
==Other stuff==
Line 90: Line 91:
 
*Mersenneforum section on Factoring Projects links http://mersenneforum.org/showthread.php?t=9611
 
*Mersenneforum section on Factoring Projects links http://mersenneforum.org/showthread.php?t=9611
 
*Top projects sorted by Number of primes http://primes.utm.edu/en_US/bios/top20.php?type=project&by=PrimesRank
 
*Top projects sorted by Number of primes http://primes.utm.edu/en_US/bios/top20.php?type=project&by=PrimesRank
 
+
[[Category:Project]]
[[Category:Projects]]
 

Revision as of 13:22, 25 March 2019

A list of DC projects

Mersenneforum.org hosts the following projects

Other stuff