MATHEMATICS, COMPUTING, AND GAMES

Attachment 432

Description: Collatz Conjecture is a research project that uses Internet-connected computers to do research in mathematics, specifically testing the Collatz Conjecture also known as 3x+1 or HOTPO (half or triple plus one). You can participate by downloading and running a free program on your computer.

Attachment 436

Attachment 441

Description: Moo! Wrapper brings together BOINC volunteer computing network resources and the Distributed.net projects. It allows a BOINC Client to participate in the RC5-72 challenge.

The "Bovine" RC5 effort was formed to take the responsibilities of coordinating and maintaining the RC5 servers that are needed to distribute key blocks to work on to all of the participating client programs. We depend heavily (entirely) on the participation of people like yourself, as we intend to solve this project via the use of brute force, trying every possible key there is.
We know this method works! On 19 October 1997 at 1325 UTC, we found the correct solution for the RSA Labs 56-bit secret-key challenge (RC5-32/12/7). The key was 0x532B744CC20999, and it took us 250 days to locate.
Then, on 14 July 2002 at 0150 UTC we found the winning key for the RSA Labs 64-bit secret-key challenge (RC5-32/12/8). That key was 0x63DE7DC154F4D039 and took us 1,757 days to locate. As of 03 December 2002, we're now working on the 72-bit RSA Labs secret-key challenge (RC5-32/12/9). In summary:

• RC5-56: 'The unknown message is: It's time to move to a longer key length'
• RC5-64: 'The unknown message is: Some things are better left unread'
• RC5-72: ??? (in progress; you can help!)

In May 2007, RSA Labs announced that Secret Key Challenge would be discontinued. Fortunately, due to the continued interest in our RC5-72 project we have decided to privately sponsor the prize and operate the RC5-72 project as before. You can read about this in bovine's 2008-Sep-08 plan and in bovine's 2007-May-21 plan.


Institution: Private.


Official Launch: 02-05-2011.


Project Status: Active. Be warned that there are some controversy surrounding the legitimacy of this project. Read the Message Board to see the current situation.


Client Programs: Moo! Wrapper currently has the following applications. When you participate in Moo! Wrapper, work for one or more of these applications will be assigned to your computer. The current version of the application will be downloaded to your computer. This happens automatically; you don't have to do anything.




Statistics: View Detailed Information and statistics on Team SETI.USA Here


Current Team Scores:

Attachment 443

Description: NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers. As a young school student, you gained your first experience at breaking an integer into prime factors, such as 15 = 3 * 5 or 35 = 5 * 7. NFS@Home is a continuation of that experience, only with integers that are hundreds of digits long. Most recent large factorizations have been done primarily by large clusters at universities. With NFS@Home you can participate in state-of-the-art factorizations simply by downloading and running a free program on your computer.
Integer factorization is interesting from both mathematical and practical perspectives. Mathematically, for instance, the calculation of multiplicative functions in number theory for a particular number require the factors of the number. Likewise, the integer factorization of particular numbers can aid in the proof that an associated number is prime. Practically, many public key algorithms, including the RSA algorithm, rely on the fact that the publicly available modulus cannot be factored. If it is factored, the private key can be easily calculated. Until quite recently, RSA-512, which uses a 512-bit modulus (155 digits), was commonly used but can now be easily broken.
The numbers what we are factoring are chosen from the Cunningham project. Started in 1925, it is one of the oldest continuously ongoing projects in computational number theory. The third edition of the book, published by the American Mathematical Society in 2002, is available as a free download. All results obtained since, including those of NFS@Home, are available on the Cunningham project website.


Home Page:http:// http://escatter11.fullerton.edu/nfs/


Project Status: Run by California State University Fullerton and is Active.


Client programs: NFS@Home currently has the following applications. When you participate in NFS@Home, work for one or more of these applications will be assigned to your computer. The current version of the application will be downloaded to your computer. This happens automatically; you don't have to do anything.

11e Lattice Sieve
Linux running on an AMD x86_64 or Intel EM64T CPU
12e Lattice Sieve
Microsoft Windows (98 or later) running on an Intel x86-compatible CPU
Linux running on an Intel x86-compatible CPU
Linux running on an AMD x86_64 or Intel EM64T CPU
13e Lattice Sieve
Microsoft Windows (98 or later) running on an Intel x86-compatible CPU
Linux running on an Intel x86-compatible CPU
Linux running on an AMD x86_64 or Intel EM64T CPU
14e Lattice Sieve
Microsoft Windows (98 or later) running on an Intel x86-compatible CPU
Linux running on an Intel x86-compatible CPU
Linux running on an AMD x86_64 or Intel EM64T CPU
15e Lattice Sieve
Microsoft Windows (98 or later) running on an Intel x86-compatible CPU
Linux running on an Intel x86-compatible CPU
Linux running on an AMD x86_64 or Intel EM64T CPU
16e Lattice Sieve
Microsoft Windows (98 or later) running on an Intel x86-compatible CPU
Linux running on an Intel x86-compatible CPU
Linux running on an AMD x86_64 or Intel EM64T CPU


Statistics: View Detailed Information and statistics on Team SETI.USA Here


Current Team Scores:

Attachment 504

Institution: NumberFields@home is based at the school of mathematics at Arizona State University. The final results of this project will be complete tables of number fields. The results are given in table form or as a searchable database.

Home Page: http://stat.la.asu.edu/NumberFields/

Project Status: Active in Alpha Phase.

Applications: NumberFields@home currently has the following applications. When you participate in NumberFields@home, work for one or more of these applications will be assigned to your computer. The current version of the application will be downloaded to your computer. This happens automatically; you don't have to do anything.

Get Decic Fields
Platform Version Installation time
Get Decics with Bounded Discriminant
Platform Version Installation time
Microsoft Windows (98 or later) running on an Intel x86-compatible CPU 1.04 27 Aug 2011 23:50:20 UTC
Linux running on an AMD x86_64 or Intel EM64T CPU 1.03 21 Aug 2011 18:04:36 UTC

Statistics: View Detailed Information on Team SETI.USA Here

Current Team Scores:

Attachment 445

Description: This project concerns itself with two hypotheses in number theory. Both are conjectures for the identification of prime numbers. The first conjecture (Agrawal’s Conjecture) was the basis for the formulation of the first deterministic prime test algorithm in polynomial time (AKS algorithm). Hendrik Lenstras and Carl Pomerances heuristic for this conjecture suggests that there must be an infinite number of counterexamples. So far, however, no counterexamples are known. This hypothesis was tested for n< 10¹⁰ without having found a counterexample. The second conjecture (Popovych’s conjecture) adds a further condition to Agrawals conjecture and therefore logically strengthens the conjecture. If this hypothesis would be correct, the time of a deterministic prime test could be reduced from O(log N)⁶ (currently most efficient version of the AKS algorithm) to O(log N)³.


Institution: Hocschute RheinMain University of Applied Sciences Wiesbaden.


Home Page:http://www.primaboinca.com/


Project Status Active.


Client Programs: The project supports the following Applications:
Windows 32bit.
Linux 32bit.
Mac OS.
Cell BE.


Statistics View Detailed Information and statistics about Team SETI.USA Here


Current Team Scores: