20070421, 10:43  #45  
Sep 2004
2×5×283 Posts 
Quote:
Carlos 

20070421, 14:17  #46 
Jun 2005
373 Posts 
That means that we can keep sieving fo rhte moment. But we can start LLR as well and take out the lower numbers from the sieve.

20070423, 20:48  #47 
Sep 2004
5416_{8} Posts 
What's our goal on sieve, going up to 10T, 20T....?
Carlos Last fiddled with by em99010pepe on 20070423 at 20:48 
20070423, 23:12  #48 
Jun 2003
3×503 Posts 
I don't think more than 5T.
2.5T might be enough. As long as you can find 1 factor a day on a fast athlon, then you should sieve, else start with LLR. edit: If we are removing candidates as we are LLRing them, then this would change things and we might be able to go deeper as the sieve would become faster. Last fiddled with by Citrix on 20070423 at 23:13 
20070424, 08:40  #49 
Jun 2005
373 Posts 
We don't even need to LLR to take candidates out. We can take them out just like this as well. That's what I'm going to do with the next import, as we almost don't find any factors below 2M, thanks to P1. As for the rest, I vote for sieving rather too deep than too shallow (native speeker assistance please!), as there are too many undersieved projects and I'd like to invert this.
But as usual, everybody is free to do whatever he is pleased to do. H. 
20070424, 11:36  #50 
Sep 2004
B0E_{16} Posts 
I'm going to finish the current ranges then I am out.
Carlos 
20070424, 20:38  #51 
Jun 2005
373 Posts 

20070426, 04:00  #52 
Mar 2003
New Zealand
13·89 Posts 
On my 2.9GHz P4, LLR with exponent 3,250,000 should take about 32500 seconds (9 hours) at 10.0 ms/bit. LLR with exponent 5,000,000 should take about 82500 sec (23 hours) at 16.5 ms/bit.
I think sieving up to 2.5T3T is probably about right, if we are not taking double checking into account. Maybe up to 5T allowing for double checks. If the project doesn't find a prime below exponent 5,000,000 then my guess is that there won't be a lot of interest in double checking, people would be more interested in doing first time tests on higher ranges to find the first prime. If a prime is found below exponent 5,000,000 then there could be more interest in double checking, to prove that it is the smallest such prime. 
20070426, 06:50  #53 
Jun 2003
3×503 Posts 
Tests at different levels take different amount of time. I think we are still under sieved for the tests with n=4M to 5M.
The best approach would be to continue sieving and removing candidates as they are LLRed. For example, I think we are sieved well to n=2.5M. So we should assign all these candidates to LLR and then remove them from the sieve. This will make the sieve client much faster and the time per factor should drop, thus we can effectively sieve beyond 2.5T. I created a dat file, only above 2.4M, if any one wants to try it to see what speeds and time per factor we get. (see attached) 
20070426, 07:50  #54 
Sep 2004
2·5·283 Posts 
Please decide which approach is better because I'm really inclined to move to another project.
Carlos 
20070426, 11:38  #55 
Jun 2005
373_{10} Posts 
Up to 2M, we have sieved nicely and done a decent P1, such that we almost don't find factors by sieve anymore.
Up to 2.5M, I'm going to write out a decent P1 as well. So I vote for just deleting the lines below 2.5M from the sieve.txt, and to continue sieving. This way, we won't be getting more factors per time, but the factors we are going to find will be worth more, on average. For the moment, everybody feel free to use the sieve.txt Citrix posted. The next official release will be truncated at 2.5M anyways. This is to be sure that no cycles are wasted. Yours H. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
SIEVE GAP  pepi37  Other Mathematical Topics  2  20160319 06:55 
Advantage of lattice sieve over line sieve  binu  Factoring  3  20130413 16:32 
Combined Sieve Guide Discussion  Joe O  Prime Sierpinski Project  35  20060901 13:44 
Sieve discussion Meaning of first/second pass, combined  Citrix  Prime Sierpinski Project  14  20051231 19:39 
New Sieve Thread Discussion  Citrix  Prime Sierpinski Project  15  20050829 13:56 