Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

Difference between revisions of "Category:Distributed computing project"

From Prime-Wiki
Jump to: navigation, search
(update status of SoB)
(So many of those links are dead (and may be unsafe) that it's better to clear it out and start fresh (and with separate pages for each project).)
(Tag: Replaced)
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
==A list of DC projects==
+
Distributed computing projects.
*[[12121 Search]] (finds primes of the form 121 &times; 2<sup>n</sup>-1 and 121 &times; 2<sup>n</sup>+1) http://www.bodang.com/12121/
 
*[[3xPlus1|3x+1]] (find ever higher 3x+1 class records) http://www.ericr.nl/wondrous/index.html
 
*[[27121 Search]] (finds primes of the form 27 &times; 2<sup>n</sup>-1, 27 &times; 2<sup>n</sup>+1, and 121 &times; 2<sup>n</sup>+1) http://www.primegrid.com/forum_thread.php?id=1229
 
*[[BOINC]] Common platform for many Distributed Computing projects http://boinc.berkeley.edu/
 
**Climateprediction.net (simulating the Earth's weather patterns) http://www.climateprediction.net
 
**Einstein@Home (searches for pulsars and stuff in space) http://einstein.phys.uwm.edu/
 
**LHC@Home (simulates a Large Hadron Collider) http://lhcathome.cern.ch/
 
**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/
 
*[[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'''''
 
*DIMES (study the Internet) http://www.netdimes.org/
 
*Distributed.net (breaking crypto and finding Optimal Golomb Rulers) http://www.distributed.net
 
*DPAD Muon1 (simulates a particle accelerator) http://stephenbrooks.org/muon1/
 
*[[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/
 
*eOn (calculating chemical reactions and stuff) http://eon.cm.utexas.edu/
 
*[[Minimal Equal Sums of Like Powers|Euler]] (computing minimal equal sums of like powers) http://euler.free.fr/
 
*Evolution@Home (studies evolution and genetic causes of extinction) http://www.evolutionary-research.org/
 
*[[Factor Tables]] (finding factors of numbers a<sup>n</sup> +- 1, for a < 100) http://wwwmaths.anu.edu.au/~brent/factors.html
 
*Factoring and Identifying Prime Repunits http://gmplib.org/~tege/repunit.html
 
*Factorizations of near-repdigit-related numbers (collecting prime factorizations of near-repdigit-related numbers such as repunit numbers, near-repdigit numbers, plateau and depression numbers, quasi-repdigit numbers, and so on) http://homepage2.nifty.com/m_kamada/math/factorizations.htm
 
*Factorizations of Repunit Numbers of the form (10<sup>n</sup>-1)/9 (111111...) http://www.kurtbeschorner.de/
 
*Factors of k&times;2<sup>n</sup>±1 (Finding factors of k &times; 2<sup>n</sup>±1 for k=3,5,7,9,11,13,15 and N < 1000) http://mklasson.com/factors/
 
*Factors of Repunit Numbers http://www.h4.dion.ne.jp/~rep/
 
*[[FermatSearch]] (searching for [[Fermat number]] divisors) http://www.fermatsearch.org/
 
*Fibonacci and Lucas Factorizations (finding factors of Fibonacci numbers and Lucas numbers) http://mersennus.net/fibonacci/index.html
 
*FightAIDS@Home (take a guess...) http://fightaidsathome.scripps.edu/
 
*Find-A-Drug (searching for drugs) http://www.find-a-drug.org/
 
*Folding@Home (protein folding simulation) http://folding.stanford.edu/
 
*[[Free-DC's Prime Search]] (searching for prime numbers of the form k&times;2<sup>n</sup>-1 to find many Top 5000 prime numbers) http://www.free-dc.org/forum/forumdisplay.php?f=148
 
*[[Generalized Fermat Prime Search]] (searching for <----. When the hell does this get updated???) http://perso.wanadoo.fr/yves.gallot/primes/status.html - '''''on hold'''''
 
*[[Generalized Woodall Number Search]] (finding Generalized Woodall Primes and related forms) http://harvey563.tripod.com/
 
*Goldbach Conjecture Verification (take a guess...) http://www.ieeta.pt/~tos/goldbach.html
 
*Gomez (evaluate performance of websites and earn money. Not always work to do) https://peer.gomez.com/
 
*[[Great Internet Mersenne Prime Search]] (GIMPS - searching for Mersenne primes) http://www.mersenne.org
 
*GRUB (crawls the web and updates search index) http://www.grub.org
 
*Integer Factorizations And (Cyclotomic) Polynomials http://www.alfredreich.com/
 
*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/
 
*[[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
 
*[[NFS@Home]] (doing the lattice sieving step in the Number Field Sieve factorization of large integers) http://escatter11.fullerton.edu/nfs/
 
*[[NFSNET]] (searching for factors for large numbers like Cunningham Most Wanted Numbers) http://www.nfsnet.org - '''''ended'''''
 
*[[Odd Perfect number search]] (searching for odd perfect numbers) http://www.oddperfect.org
 
*[[Operation Billion Digits]] (attempts to find factors of Mersenne numbers that have prime exponents and at least a billion digits) http://home.earthlink.net/~elevensmooth/Billion.html
 
*Parabon Computation (commercial shit) http://www.parabon.com/
 
*Paul Leyland's factorization page (finding factors of several kinds of numbers) http://www.leyland.vispa.com/numth/factorization/main.htm
 
*[[PCP@Home]] (solving Post's correspondance problem. Haven't been updated for ages) http://www.informatik.uni-leipzig.de/~pcp/pcpcontest_en.html- '''''on hold'''''
 
*[[PrimeGrid]] (bringing the excitement of prime finding to the "everyday" computer user) http://primegrid.com/
 
*[[Prime Internet Eisenstein Search|Prime Internet Eisenstein Search (P.I.E.S)]] (search for Generalised Eisenstein Fermat numbers, numbers of form Phi(2<sup>s</sup>&times;3<sup>t</sup>,b)) http://fatphil.org/maths/PIES/ - '''''on hold'''''
 
*[[Primesearch]] (searching for primes of the form k &times; 2<sup>n</sup> - 1) http://www.myjavaserver.com/~primesearch/ - '''''now called No Prime Left Behind'''''
 
*[[Prothsearch]] (rarely updated site about primes) http://www.prothsearch.net/
 
*[[PRP Repunit Search]] http://individual.utoronto.ca/mvoznyy/
 
*[[PSearch]] (searching for the 23rd largest prime) http://mysite.verizon.net/wfgarnett3/ - '''''on hold'''''
 
*Red Library DLV (validating links) http://www.readyresponse.org/index.php?option=com_distcomp&Itemid=52&opt=2
 
*Repdigit Prime Problems (searches for prime numbers of the form n &times; k) http://www.freewebs.com/dries5/Prime_problems.htm
 
*[[Repunit Primes Project]] http://www.repunit.org/
 
*[[Riesel Sieve]] Project (tries to prove the [[Riesel conjecture]]) http://www.rieselsieve.com/ - '''''now a part of PrimeGrid'''''
 
*[[Search for Multifactorial Primes]] (take a guess...) http://mfprimes.free-dc.org/
 
*[[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
 
*[[Seventeen or Bust]] (attacking the [[Sierpiński problem]]) http://www.seventeenorbust.com - '''''now a part of PrimeGrid'''''
 
*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'''''
 
*Virtual Lab Project (screening molecules) http://www.buyya.com/vlab/
 
*[[WEP-MPlus2 Project|WEP-M+2 Project]] (finding factors of Mersenneplustwo numbers) http://bearnol.is-a-geek.com/wanless2/
 
*[[World Integer Factorization Center|World Integer Factorization Center (WIFC)]] (finding factors of several kinds of numbers) http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/
 
*XGrid@Stanford (studying pharmacology) http://cmgm.stanford.edu/~cparnot/xgrid-stanford/index.html - '''''on hold'''''
 
*[[XYYXF Project]] (factors numbers of the form x<sup>y</sup> + y<sup>x</sup>) http://xyyxf.at.tut.by/
 
*[[yoyo@home]] (bringing existing distributed computing projects to the Boinc world using the Boinc Wrapper technology) http://www.rechenkraft.net/yoyo/
 
  
==Mersenneforum.org hosts the following projects==
 
*[[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/
 
*[[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 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
 
*[[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
 
*[[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 Sierpiński Project]] (searches for the smallest [[Sierpiński number]]) http://www.mersenneforum.org/forumdisplay.php?f=48
 
*[[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
 
*[[Multifactorial Prime Search]] searches for [[multifactorial prime]]s of the form <math>n!_j{±}1</math>
 
 
==Other stuff==
 
*Distributed.RU Russian Distributed Computing Portal http://distributed.ru/
 
*Distributedcomputing.info (keeps a list of DC project and activly follows project news) http://www.distributedcomputing.info/
 
*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
 
 
[[Category:Project]]
 
[[Category:Project]]

Latest revision as of 17:46, 25 November 2022

Distributed computing projects.