jmblazek
12-17-2006, 06:26 AM
Just wanted to update the description of PrimeGrid. It is no longer "trying to recover messages encoded with the md5 algorithm." The old description is a bit out-dated.
From the PrimeGrid (PG) home page:
PrimeGrid is currently running two sub-projects:
* Primegen: generating a public sequential prime number database.
* Twin Prime Search (testing): searching for large twin primes of the form k*2n + 1 and k*2n - 1.
PrimeGrid is running PerlBOINC server software. PerlBOINC is an attempt to implement BOINC server system in Perl programming language.
Twin Prime Search (TPS) was added late November. The n they have chosen guarantees that when it finds a twin prime, it will be a RECORD. So far so good...PG TPS has already tested more k's in 3 weeks than the whole project did in the last 6 months (it was started in April 2006). Still, PG TPS has a very small user base.
Rytis, the creator of PrimeGrid, is also the creator of the PerlBOINC software. From the Riesel Sieve (RS) donation page: "He has provided us with numerous hours of tech support, assistance with our wrapper, and spent the time creating PerlBOINC - help us say Thank You to him!"
Why not say thank you by slipping a few cycles over to PG. Even better, enable test applications through the project preferences page and exclusively run TPS LLR...just like RS LLR.
Currently AMD Users is #1 at RS and #6 at PG. As far as I can tell, Virux-X is running neck and neck as the top PG TPS producer. We could use some more heavy hitters.
p.s. If PG TPS can have a sustained rate of 1G a week (~143M/day), we'd have an 85% chance of finding the RECORD twin prime within 6 months. Right now PG TPS is doing about 150M a week. See this post in the TPS forum: http://www.mersenneforum.org/showpost.php?p=94020&postcount=11
Thanks for your help.
From the PrimeGrid (PG) home page:
PrimeGrid is currently running two sub-projects:
* Primegen: generating a public sequential prime number database.
* Twin Prime Search (testing): searching for large twin primes of the form k*2n + 1 and k*2n - 1.
PrimeGrid is running PerlBOINC server software. PerlBOINC is an attempt to implement BOINC server system in Perl programming language.
Twin Prime Search (TPS) was added late November. The n they have chosen guarantees that when it finds a twin prime, it will be a RECORD. So far so good...PG TPS has already tested more k's in 3 weeks than the whole project did in the last 6 months (it was started in April 2006). Still, PG TPS has a very small user base.
Rytis, the creator of PrimeGrid, is also the creator of the PerlBOINC software. From the Riesel Sieve (RS) donation page: "He has provided us with numerous hours of tech support, assistance with our wrapper, and spent the time creating PerlBOINC - help us say Thank You to him!"
Why not say thank you by slipping a few cycles over to PG. Even better, enable test applications through the project preferences page and exclusively run TPS LLR...just like RS LLR.
Currently AMD Users is #1 at RS and #6 at PG. As far as I can tell, Virux-X is running neck and neck as the top PG TPS producer. We could use some more heavy hitters.
p.s. If PG TPS can have a sustained rate of 1G a week (~143M/day), we'd have an 85% chance of finding the RECORD twin prime within 6 months. Right now PG TPS is doing about 150M a week. See this post in the TPS forum: http://www.mersenneforum.org/showpost.php?p=94020&postcount=11
Thanks for your help.