The Seventeen or Bust team is in a very heated battle right now to try and take over first place from Team Prime Rib. Pentium 4's do very well in Seventeen or Bust. Here is some info taken from another site about the project:
Help find the smallest Sierpinski number in Seventeen or Bust, a distributed attack on the Sierpinski problem. The project looks for Proth prime numbers in which, for a number k, if every possible choice of n results in a composite (non-prime) Proth number N, k is a Sierpinski number.
The project began its k=33661 project on November 21, 2002, and fifteen additional projects on November 23, 2002. It has found the following primes:
Prime Number of digits Date found
46157 * 2698207 + 1 210,186 November 27, 2002
65567 * 21013803 + 1 305,190 December 3, 2002
44131 * 2995972 + 1 299,823 December 5, 2002
69109 * 21157446 + 1 348,431 December 7, 2002
54767 * 21337287 + 1 402,569 December 22, 2002
To participate in the project, sign up for an account, download the client, add your account name to the client configuration, and run it. The client does Proth tests on individual numbers. Each number should take a few hours to test on an average machine. When the project server assigns you a number, it waits for up to 10 days for you to return your search results, and reassigns the number to someone else if it doesn't receive your results within that time.
The client supports users behind firewalls and proxy servers. Version 1.10 of the client is available for Windows as of June 6, 2003. This version includes many new features and bug fixes. Version 1.0.2 is available for Linux, BeOS and FreeBSD as of November 27, 2002. Note: as of October 5, 2002, results from version 0.9.0 or earlier of the client are not accepted by the server. Please upgrade if you are running an older version. Windows users with dual-CPU machines can download a special copy of the 0.9.9 Windows client which will allow them to run the client on both CPUs.
Seventeen or Bust also has a supporting project to sieve numbers for the main project: sieving finds n numbers with small factors and removes them from the pool of prime number candidates which need to be tested by Seventeen or Bust. Two clients are available for sieving: SoBSieve (for Windows) and NBeGone (for multiple platforms). To reserve a range of numbers to sieve, post a message to the sieve coordination thread. Then submit the results from the range to the "sieve numbers" page mentioned above.
