mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Twin Prime Search

Reply
 
Thread Tools
Old 2007-01-12, 19:38   #12
MooooMoo
Apprentice Crank
 
MooooMoo's Avatar
 
Mar 2006

2·227 Posts
Thumbs up

Quote:
Originally Posted by Rytis View Post
A few highlights:

total credit is available on every stats page (whereas RAC is not) (please correct me if I'm wrong);
when a twin is found, the total contribution from both manual LLRing and PG (if the user moved over to PG) should be counted. LLR test count done is being recorded, and we can approximately calculate work done by multiplying M done in the original TPS by 360 (or dividing PG work done by 360, to get approximate M);
the option to see current k/n pair will be available some day.
Sounds good.
MooooMoo is offline   Reply With Quote
Old 2007-01-15, 16:09   #13
Rytis
 
Rytis's Avatar
 
Nov 2006

83 Posts
Default

For now I have switched to normal primegens to keep cruncher's computers busy while we prepare for the new n. I think it would be ideal to start working on the new n in about a week (I will only have time to modify required scripts in PG at about then), although the sieve depth is not very deep. PG removes candidates at about 2 per second, so it's faster than sieving ;)

A week would also let the current LLR queue clear, so I can archive current TPS status and restart with the new n and new empty scores without much additional work to prevent old n and new n stats mixing up. I will also create a system to allow sievers insert work directly into PrimeGrid (it will only be available to set amount of people, preferably no more than two).

I have also tested range k=2003M to k=2004M (n=195000) to see if the twin would be reported to me, and it was.
Rytis is offline   Reply With Quote
Old 2007-01-15, 17:14   #14
jmblazek
 
jmblazek's Avatar
 
Nov 2006
Earth

4016 Posts
Default

So here's a summary:

1. PG empty current queue and archive n=195000
2. PG send primegen WUs until new k for n=333333 is available
3. We get our act together and have a few M of k available in a week.

Quote:
Originally Posted by Rytis View Post
although the sieve depth is not very deep. PG removes candidates at about 2 per second, so it's faster than sieving ;)
This is good to know. However, sieving is still more "efficient" use of computing power. With that said, I see no harm in releasing several 100M of k as soon as it's available. Reason being, in about six weeks, as long as sieving continues (and we throw a few more PCs into the effort), efficiency will no longer matter. We'll probably be around 32,000,000 k left (~4,000,000 sieved & ~2,000,000 LLR'd) That's down from 38,000,000 at 205T.

What do y'all think?

Quote:
Originally Posted by Rytis View Post
I have also tested range k=2003M to k=2004M (n=195000) to see if the twin would be reported to me, and it was.
That's good to know!
jmblazek is offline   Reply With Quote
Old 2007-01-15, 19:47   #15
pacionet
 
pacionet's Avatar
 
Oct 2005
Italy

3·113 Posts
Default

Is it possible for me to sieve one exponent from scratch (the next after n=333,333) and regularly upload pre-sieved files on twinprimesearch.org ?

This way, Rytis have one single point where download pre-sieved files.

I have a maximum space of 200 MB on the site, but soon I think to switch to more space.

Last fiddled with by pacionet on 2007-01-15 at 19:50
pacionet is offline   Reply With Quote
Old 2007-01-15, 23:01   #16
biwema
 
biwema's Avatar
 
Mar 2004

3·127 Posts
Default

You can start sieving whatever you want, if the community is interested.
For the time being, it might make more sense to help out on 333333. It needs much more effort there (if we are not that lucky).

If you start a new exponent, choose the range large enough.
100G * (yournewexp / 333333)^2 might be appropriate.
biwema is offline   Reply With Quote
Old 2007-01-15, 23:18   #17
pacionet
 
pacionet's Avatar
 
Oct 2005
Italy

33910 Posts
Default

Somebody told that the next exponent should be n=582,192
pacionet is offline   Reply With Quote
Old 2007-01-20, 11:22   #18
KEP
Quasi Admin Thing
 
KEP's Avatar
 
May 2005

24×59 Posts
Default

Quote:
Originally Posted by pacionet View Post
Somebody told that the next exponent should be n=582,192
I remember suggesting that, as you also pointed out, when you pointed out and referred to my "roadmap". This exponent (n=582,192) was suggested, because it will land us in the middle of the 500,000 n (which was the lower goal) and the exponent yielding a 200,000 digit prime. Thanks for using my roadmap, I think it is quite likely to have an increase in the exponents, following the increase in computing power. So my suggestion to you is that you go for n=582,192 if the voters decide to have an exponent above 500,000. Also we need a fair increase in the n exponent, otherwise our smooth project will never really make any progress, and the only thing we will do is to flood the top 5,000 primelist, but the primes wan't be noticed by other than the TPS users, so to make ourself noticed we have to follow the roadmap not exactly, but with only a few differences in n.

Regards!

KEP

Ps. How many G you should sieve I really wouldn't have a clue, but it seems that no more than 50 should be sieved to start with
KEP is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Soapbox Discussions only_human Soap Box 41 2019-11-16 15:46
Our discussions here: how can we improve things? Brian-E Soap Box 105 2013-11-10 12:26
Sieve reservation discussions jmblazek Twin Prime Search 27 2007-01-31 21:41
Distributed sieving discussions michaf Sierpinski/Riesel Base 5 76 2006-09-12 18:37
Automated PRP discussions ltd Sierpinski/Riesel Base 5 20 2006-09-02 22:19

All times are UTC. The time now is 23:21.

Sat Dec 5 23:21:36 UTC 2020 up 2 days, 19:32, 0 users, load averages: 1.77, 1.80, 1.83

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.