20200831, 08:58  #1 
Dec 2017
111111_{2} Posts 
Maximum prime for sieving
Sorry, couldn't find a suitable thread for this.
If I was to use gfndsieve to sieve a range of potential candidates, does anyone have any rules of thumb as to when it is best to stop sieving and start running pfgw? Presumably more sieving would be advantageous for large values of n where pfgw would take longer, so a larger P value would quicken the overall time by reducing the number of candidates. 
20200831, 09:01  #2 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
1001100111010_{2} Posts 
What’s your factor elimination rate? What Is your testing rate on your last candidate of the sieve file when running pfgw?

20200831, 13:20  #3 
Dec 2017
3^{2}·7 Posts 
Is that the strategy? I need to run pfgw first to get a timing a d then filter until the elimination rate is less than the time to check?

20200831, 14:52  #4  
Banned
"Luigi"
Aug 2002
Team Italia
2×29×83 Posts 
Quote:
Put the number of working threads into the formula, sa you can launch as many pfgw programs as you have cores from the respective directories. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Maximum number of prime factors (3 questions)  siegert81  Factoring  31  20180129 10:41 
What maximum DLP bitprime size can CADONFSDLP solve?  tayboonsiang90  CADONFS  2  20170720 17:44 
twin prime, but sieving n instead of k. Possible?  jasong  Software  20  20071128 03:48 
Maximum memory usage of Prime?  cl55amg  Software  8  20070327 14:03 
Sieving for 10M prime for odd k, 331  jasong  Lounge  33  20061031 01:34 