Join a discussion forum about this project.

The project used a command-line client for each of its subprojects and also created a client for the Sony PlayStation 3 game console.

The project generated 29,563,782 total results, and over 7 billion protein folding models. Researchers will use results from the project to learn what functions particular proteins perform in the rice plant.

See a May 19, 2010, interview with Dr. Ram Samudrala, the head of the project, by Alexander Janssen.

This project is discussed in the World Community Grid forums.

See the project's discussion forum.

Phase II began on April 3, 2006. Phase II searched for potential drugs for the protein target Ras homolog enriched in brain (Rheb). "The overexpression of Rheb has been shown to result in unusual overgrowth of various tissues, and is believed to be central to the growth processes underlying tumorgenesis." Phase II is also using new candidate drug libraries. The Phase I targets may be tried with the new libraries in the future. The project published a press release about Phase II on April 13, 2006.

The project tested its 1 billionth conformer in July, 2004.

In the seven years the project ran it produced over 150 million potential disease-fighting drugs. The best of the candidates will be tested in the laboratory to determine their effectiveness. The project owners will provide occasional updates on the progress of the lab testing to the project participants.

See the project's TSC discussion forum.

In the seven years that the project ran it produced over 150 million potential disease-fighting drugs. The best of the candidates will be tested in the laboratory to determine their effectiveness. The project owners will provide occasional updates on the progress of the lab testing to the project participants.

See the project's discussion forum.

See the project's discussion forum.

The project was presented at the 2004 Biomedical Computation at Stanford (bcats) conference on October 16, 2004.

The project's "Tooltip Failure Mode Search Project, conducted by Brian Helfrich and Dr. Damian Allis ran on NHAH from February 2007 through May 2007. It utilized computing cycles donated from over 6,000 computers worldwide and reached a peak performance of nearly 3 teraFLOPS." See an explanation of the project and the project's results.

The project found its first collision on March 10, 2006. On July 1, 2006, the project stopped its birthday search to continue with stage 2: completing a partial collision to a full MD5 collision. On September 12, 2006, the project started using its new application for stage 2 work. It eliminated all 8 bitdifferences for stage 2 as of October 12, 2006.

The project published its MD5 collision results on October 24, 2006: Colliding X.509 Certificates for Different Identities. The project owner published his Master's Thesis, "On Collisions for MD5," based on results from the project, in July, 2008.

On November 26, 2006, this project began collaborating with PrimeGrid.

Join a discussion forum about the project.

On September 22, 2006, 5,374,785 new work units, which included new key spaces for the characters SPACE , . ? !, were added to the project. Counting these work units, the project was about 70% complete as of that date. The project completed Phase 1 (the original keyspace), and began searching the expanded keyspace, on October 8, 2006. The project apparently ended a few months after that. No results were reported.

See status updates for the project. Also see the project's FAQ.

Join a discussion forum about World Community Grid's projects.

The project used the grid.org computing platform.

On November 16, 2004, the project announced that 400 compounds from the LigandFit phase had been synthesized and tested in a lab. Between 2-4% of them showed activity. Typically less than 0.1% of compounds from computer-simulated screening show activity. The next step for the successful compounds was "to persuade pharmaceutical or biotechnology companies to take up these experimentally verified hits and to test them further."

The project used the grid.org computing platform.

The project allows analysis to be carried out for hundreds of tissue microarrays in parallel, "allowing multiple experiments to be conducted simultaneously. This added level of speed and sophistication could potentially enable investigators to detect and track subtle changes in measurable parameters, thereby facilitating discovery of prognostic clues, which are not apparent by human inspection or traditional analysis alone and could advance the fields of cancer biology, drug discovery and therapy planning."

The project generated 5,316,402 total results.

Join a discussion forum about World Community Grid's projects.

The project simulated 160 years of climate change, between the years 1920 and 2080. Work units for the project took about 2.3 times longer to complete than climateprediction.net's sulphur cycle work units, and about 6.6 times longer than climateprediction.net's slab model work units. A work unit typically took six months to complete.

See the project's discussion forum.

The project measured over 8,300 years of total uptime by almost 27,000 users.

• How do probabilities scale with edge ratios?
• How do probabilities depend on elasticity and friction?
• How do final states depend on initial conditions?

Join a discussion forum about the project.

This project was part of the OpenMind Initiative to develop "intelligent" software.

In July, 2003, the project began similar foreign-langauge projects:

• Romanian Open Mind Word Expert
• Multilingual Open Mind Word Expert (English-Hindi)
• Multilingual Open Mind Word Expert (English-French)

The project was part of the OpenMind Initiative to develop "intelligent" software.

From the project owner: "As an increasing number of mission critical tasks are automated, self-checking circuits are of paramount importance. For example in medical applications (heart monitors, pacemakers), transport (aeroplane hardware, traffic lights, car ABS braking), space (satellites, probes) and industrial facilites (nuclear power plants) and more to come in the future as cars start driving themselves, surgical operations are performed remotely, etc.. In all these areas human lives or great economic loss are at risk.

"The circuits produced by this projects are truly better than those of conventional design so would lead to safer controllers in all these applications saving lives and money."

On October 1, 2004, the project successfully evolved a large number "of circuits with full concurrent error detection using only 14% of the overhead required by the conventional approach," and began evolving a new generation of circuits "as big as those used in industry, many of them using hundreds of gates." On October 14, 2004, circuits and overhead figures from the project "were presented to experts in the self-checking field at the International On-Line Testing Symposium IOLTS 2004. One expert said DHEP may be the best method to design self-checking circuits."

The project used Genetic Algorithms and Evolutionary Strategies to design improved circuits. Source code and documentation for the project were available for download.

See the project's discussion forum.

On June 30, 2003, the project announced that it successfully found some potential cancer-inhibiting drugs. After testing over 500 million molecules, it produced a set of candidates. 39 candidates were tested in a laboratory, and 7 of those (20%) showed the desired anti-cancer properties. Only 2-3% were expected to show the desired properties. On November 12, 2003, the project announced that it had found growth inhibitors for 5 anti-cancer protein targets. "42 of the 200 molecules tested [so far] showed the desired anti-cancer properties." On March 22, 2004, the project announced that it had "found more molecules which inhibit the growth of cancer cells," and had now discovered "growth inhibitors for 7 anti-cancer protein targets." On April 16, 2004, the project announced that it had found 18 molecules which inhibit the growth of HIV protease, an AIDS protein. More of its cancer-fighting drugs were confirmed to be effective in laboratory tests as of July 2, 2004. On March 14, 2005, the project published a list of 1,279 molecules, tested in a lab, which showed desired anti-cancer properties. These molecules were discovered by 626 project volunteers.

The project ended on December 16, 2005. Questions about the project's closing are answered in the project FAQ. The project's discussion forum may also remain active for a while.

The project's final statistics:

Users	5,436,301
Results received	2,092,538,656
Total CPU time	2,433,979.781 years
Floating Point Operations	7.745086e+21
Average CPU time per work unit	10 hr 11 min 21.7 sec

SETI@home Classic gave its participants frequent updates about the science the project was performing, and the people, software and hardware behind the project, publishing over 22 newsletters, and publishing frequent technical news reports about the project. The project also provided other information, such as a Glossary of Concepts to explain the project's unique terminology, a list of the project's most promising signal candidates, and pictures of the Arecibo telescope from the SETI@Home team's March, 2003 visit.

As of 2001, SETI@Home Classic was the largest public distributed computing project in terms of computing power: on September 26, 2001 it reached the ZettaFLOP (10²¹ floating point operations) mark--a new world record--performing calculations at an average of 71 TeraFLOPs/second. For comparison, the fastest individual computer in the world is IBM's ASCI White, which runs at 12.3 TeraFLOPs/second. On June 1, 2002, the project completed over 1 million CPU years of computation. On August 19, 2003, the project processed its 1 billionth work unit. As of June 14, 2002, the project had found 3.2 billion spikes and 266 million Gaussians.

View the SETI@home Classic discussion forum.

Read a short research paper, written in 1998, about the origins of SETI and SETI@home Classic.

See a RealPlayer Video interview that Dr. David Anderson gave to CERN's GridCafe on April 30, 2004. The interview lasts 6.5 minutes. See an August 19, 2004, interview of Dan Werthimer, director of the SERENDIP SETI program and chief scientist of SETI@home, by Astroseti.org. Hear a December 6, 2004, interview of David Anderson by Planetary Radio.

The project computed over 1 trillion verified zeros by January 11, 2005, and 1.14 trillion verified zeros overall, collecting over 20 TB of accurate data about the distribution of the zeros, and generated many heuristics about the Riemann Hypothesis which will be published in the Mathematics of Computation journal soon.

Join a discussion forum about the project.

The project used a BOINC-based client. See the BOINC platform information for the latest version of the BOINC client.

The project used a BOINC-based client.

The project used a BOINC-based client. See the BOINC platform information for information about the BOINC client.

The project found a +4 solution to the 41 pancakes stack on July 1, 2004. It found a +5 solution to the 42 pancakes stack on July 18, 2004. It finished all of the stacks it was assigned as of August 26, 2004.

Results of the project can be used "for biodiversity research, education and conservation worldwide, especially to forecast environmental events and inform public policy with leading-edge science." The project collected data for 159,279 species from institutions around the world, and mapped 84,242 of those species.

Anyone can access data and results from the project via the following services:

• Lifemapper Web Mapping Service - "a web service that allows clients to utilize the Lifemapper data without going through the Lifemapper website. With this service, a client can insert an image element into their own web page that will display a map alone or layered on top of other maps of the same area."
• Lifemapper QueryByLocation Service - "an XML web service which allows a client to query the two Lifemapper spatial databases to find the species present in a given area. The first database, DataPoints, consists of cached specimen locations from participating institutions. The second database, Models, consists of predicted habitat maps from our screen saver users. The area can be queried by a point (buffered 0), a circle (a point buffered up to .01 degrees), or a polygon."
• Lifemapper QueryTaxa Service - "an XML web service which allows a client to query the Lifemapper databases to find a species by ScientificName, by CommonName, or by Lifemapper TaxonID. Results can be limited to Lifemapper TaxonID, or can include Scientific Name, Genus, Species, and SubSpecies, DataProviders who provided data points for this species, number of Georeferenced Points and number of Models Computed."

The project provided a Windows and Mac OSX screensaver client which sent fake requests to spam sites targeted by the project. The site also had a button which a visitor could press to send a fake request to one of the spam sites.

Join a discussion forum about World Community Grid's projects.

The project appears to have been abandoned sometime in 2004.

Between May 30, 2002 and September 9, 2002, the project competed in the CASP5 structure prediction contest. Results of the competition were made available in late December, 2002. Between July 6, 2004 and August 31, 2004, the project competed in the CASP6 structure prediction contest. Results of the competition were made available on December 24, 2004.

After the project ended, the project team planned to analyze the results of the proteins it had folded with the current algorithm and to create a better folding algorithm for a possible future distributed computing project.

View a Windows Media Player ASF-format file of a television interview by CityPulse24 of the project coordinators on November 27, 2002.

The project software client ran as a screensaver on Win32 and as a text client on Win32, Linux, Sony PlayStation 2 Linux (it was the first distributed computing client to run on this platform), and many Unix platforms including Mac OS X. The project server and client software was also the first to use a ticketing system for submitting results: when the project server was too busy to receive all of the results clients attempted to submit to it, it would assign each client a numbered "ticket," the clients stored their results locally, and then each client could submit its results when the project server "called its ticket."

See a discussion forum about this project.

On August 23, 2004, the project made its database publicly available. "www.engsoc.org/~jlcooke holds GZipped images, rrd files, php and MySQL scripts for download. www.dp.cx/md5crk/explore.php contains a database browser and www.dp.cx/md5crk/database contains access to phpMyAdmin for custom queries. The Database contains all the reported work for over 170 days (trillions upon trillions of operations) of the project."

MD5CRK was the first project to enable website owners to configure their web pages to link to a MD5CRK distributed Java applet. This feature allowed users to participate in the project just by viewing a web page. The applet had a button to allow a user to disable/enable the applet, so that the user could decide whether to allow it to run on his or her system. 174 websites participated in the project. The project also provided a standalone client.

Join a discussion forum about this project.

See the project's final images.

The three projects listed on the main page were:

• Costa Rica (Mapeche Conservation Area) - protect Costa Rican rainforest
• Amazon (Samauma San Pedro) - protect two forest areas in the heart of the tropical Amazon
• Tanzania (Mkwaja North) - aquire a large extension of the Savannah and donate it to the government of Tanzania

  $k = \log_P Q$ is given by either of the following:
    (base 16) k = f1e0add3449596419c359dbdb7e
    or  (base 10) k = 306616351199823445499046157605758.

Join a discussion forum about this project. ecc2.com, which hosted the discussion forum, also hosted the project stats.

Collatz Phase 1 tested n from 1 to 99,999,999,999. It began on August 22, 2003, and ended on September 3, 2003. Collatz Phase 2 tested n from 100,000,000,000-350,010,009,999. It began on September 2, 2003 and ended on September 10, 2003. Collatz Phase 3 tested n from 350,010,009,999-850,060,009,999. It began on September 10, 2003. Collatz Phase 4 tested n from 850,060,009,999-1,850,160,009,999. Collatz Phase 5 tested n from 1,850,160,009,999-11,851,160,009,999. Collatz Phase 6 tested n from 11,851,160,009,999-21,852,160,009,999. Collatz Phase 7 tested n from 21,852,160,009,999-71,857,160,010,000. Collatz Phase 8 tested n from 71,857,160,010,000-121,862,160,010,001. The project ended before it completed Collatz Phase 9.

Genome@home's first experiment concluded successfully in early March, 2001, with more than 1000 users creating more than 15,000 new genes for 217 proteins. On November 12, 2001, Genome@home began Phase 2 of its protein design experiments. This phase studied "all single-chain proteins in the RCSB Protein Data Bank" with a length up to 150 amino acids--over 3,015 different proteins. As of April, 2003, the project had "used almost 20,000 donated CPU-years to calculate over 6 million new protein sequences." The work done with the version 0.99 client, consisting of nine stages, resulted in 4 major scientific publications.

On May 1, 2002, Genome@Home began a new series of RMSD (root-mean-square deviation) projects to study the structural diversity of "ensembles of protein backbones" used in the design of large proteins.

The following paper was published from the results of this project:
"Thoroughly sampling sequence space: large-scale protein design of structural ensembles." Stefan M. Larson, Jeremy L. England, John R. Desjarlais, & Vijay S. Pande. (2002) Protein Science, Autumn, 2002

See a FAQ about the end of the project and how the project results will be used.

Join a discussion forum (in French) about this project.

Join a discussion forum about the project.

The project's first challenge was the RSA 576-bit factoring challenge. The project's first attemp to solve the challenge was through random guesses. For this attemp, volunteers generated 39,033,522 packets (.154885015296E+15 keys checked) for the project. The attempt ended on January 10, 2003. The project's second attempt, Phase 2, would have used a General Number Field Sieve (GNFS) algorithm.

The second challenge was the MD5 project. The MD5 encryption algorithm is widely used in business, secure websites, Unix systems, and the Internet. The challenge would have demonstrated MD5's vulnerability, forcing people who use it to develop a better algorithm. This project began on January 30, 2003, and was stopped on May 20, 2003, due to a lack of interest from the MD5 developers (who were outside of the NEO project). The challenge tested at least 0.53% of the MD5 keyspace.

The third challenge was the Tellurium project, a physics project in which space-time geometry, specifically Isaac Newton's Equivalence Principle (see a simpler explanation), would be tested with the handedness or chirality property of matter. The principle has never been tested this way: if the test had caused it to fail, then Albert Einstein's General Relativity theory would be shown to be subtly incorrect. This challenge began on May 9, 2003, but the alpha client for the challenge was never publicly released.

The fourth challenge was World TSP, a study of the Traveling Salesman Problem. This challenge attempted to find the shortest route which visits all 1,904,711 populated cities and towns on Earth. "The current best lower bound on the length of a tour for the World TSP [was] 7,510,666,782 (Kilometers)." This bound was established on June 18, 2002. The challenge used an evolving artificial intelligence algorithm to attempt to beat that bound. With 97,820 total routes completed, the shortest route discovered was 13,802,932,609 Kilometers.

Source code for the project is available here and here for anyone who would like to continue the project.

Listen to an April 26, 2003 CBC Radio interview (in RealAudio format) with some of the project coordinators.

The sub-projects:

• BOLERO (Bio Odyssey of Lateen Explorer for Repeated Objects), which searched "for the huge repeat of a human genome," and analyzed "a relation with a cause-of-a-disease gene." (see babelfish translation)
• OPAL (Optical Property AnaLyzer (of photonic crystals)) which looked "for the material which can manufacture an optical microprocessor." (see babelfish translation)

567,847 entries were submitted for the project. See the smallest known spans discovered by the project.

Join a discussion forum about the project.

Version 1 of this project was known as Tivocrack. 320,679 packets were completed for Tivocrack. Tivocrack began from a discussion forum.

Version 2 became active around November 8, 2002.

The project was built on three basic principles:

1. Communities create knowledge
2. Communities determine the worth of knowledge
3. Knowledge is priceless

The project unoficially stopped in April, 2003, and never began again. When it stopped, it had created 91 Courselets in 15 categories.