![]() |
![]() |
#1 |
Dec 2017
7610 Posts |
![]()
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. |
![]() |
![]() |
![]() |
#2 |
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
2·33·5·19 Posts |
![]()
What’s your factor elimination rate? What Is your testing rate on your last candidate of the sieve file when running pfgw?
|
![]() |
![]() |
![]() |
#3 |
Dec 2017
10011002 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?
|
![]() |
![]() |
![]() |
#4 | |
Banned
"Luigi"
Aug 2002
Team Italia
3·1,619 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 | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Maximum number of prime factors (3 questions) | siegert81 | Factoring | 31 | 2018-01-29 10:41 |
What maximum DLP bit-prime size can CADO-NFS-DLP solve? | tayboonsiang90 | CADO-NFS | 2 | 2017-07-20 17:44 |
twin prime, but sieving n instead of k. Possible? | jasong | Software | 20 | 2007-11-28 03:48 |
Maximum memory usage of Prime? | cl55amg | Software | 8 | 2007-03-27 14:03 |
Sieving for 10M prime for odd k, 3-31 | jasong | Lounge | 33 | 2006-10-31 01:34 |