![]() |
![]() |
#12 |
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
![]() |
![]() |
![]() |
#13 |
A Sunny Moo
Aug 2007
USA (GMT-5)
141518 Posts |
![]()
First, you need to make sure the file is in ABC format. A NewPGen file can actually be converted to ABC quite easily without the need for conversion tools: for example on Sierp. base 3, you'd simply change the first like of the file to "ABC $a*3^$b+1" rather than the NewPGen header (the thing with all the colons in it).
Next, you need to specify the "number_primes" option as a comment in the file. To do this, you need to change the ABC header to something like this: "ABC $a*3^$b+1 // {number_primes,$a,1}". That tells PFGW that it should stop searching a particular $a value (that is, the k) if 1 prime is found for that value. At this point, you're all ready to run it through PFGW. Navigate to the PFGW directory through the command prompt and run the following command (or, use WinPFGW and give it the following command line): pfgw -l name-of-sieve-file.txt Note that the -l is quite important--without it, PFGW will not log its composite results to a file (in this case, pfgw.out; to change the name, specify the -l option as something like "-lfile.txt" instead). One note on stopping/restarting with the number_primes option: if you stop and restart, PFGW will "forget" which k's it's stopped searching. It will still pick up exactly where it's left off, but it won't remember to leave out the k's which it's found a prime for prior to the restart. Thus, if you need to restart, you'll have to remove prior-primed k's from the sieve file (be sure to adjust the line # accordingly in pfgw.ini). |
![]() |
![]() |
#14 | |
Mar 2006
Germany
2·1,433 Posts |
![]() Quote:
i've tested this with the Sierp Base 3 file with the header Code:
ABC $a*3^$b+1 // {number_primes,$a,1} WinPFGW won't stop! |
|
![]() |
![]() |
#15 | |
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
![]() Quote:
Edit: Possibly it doesn't work with WinPFGW? Try it with command-line PFGW and see if it works then. It *should* work with both, but it's possible there's a bug in WinPFGW. Last fiddled with by mdettweiler on 2009-08-01 at 14:58 |
|
![]() |
![]() |
#16 |
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
![]()
Thanks guys!
![]() |
![]() |
![]() |
#17 | |
Mar 2006
Germany
2·1,433 Posts |
![]() Quote:
Code:
PFGW Version 20090723.Win_Dev (Beta 'caveat utilitor') [GWNUM 25.12] Output logging to file pfgw.out Recognized ABC Sieve file: ABC File Processing for at most 1 Primes 196996994*3^25147+1 is 3-PRP! (2.6909s+0.0006s) PRP: 196853336*3^25152+1 10000/39892 same in pfgw.exe! |
|
![]() |
![]() |
#18 | |
A Sunny Moo
Aug 2007
USA (GMT-5)
3×2,083 Posts |
![]() Quote:
|
|
![]() |
![]() |
#19 |
May 2007
Kansas; USA
19·541 Posts |
![]()
I know for a fact that the stop on prime works for the new version of Linux PFGW. I haven't tried it with the new version of WinPFGW.
Max and Karsten, I think there may be a miscommunication based on the two lines that Karsten displayed. Karsten, it should stop processing that k-value for all future occurrences in the file but should continue processing the file for all other k's. That's what's so cool about PFGW. The two lines that you displayed have different k-values. I guess my question is: Why have you showed lines for 2 different k-values? It doesn't demonstrate the problem that you appear to be talking about. Also, please note what Max said. If you stop and restart PFGW, it won't remember what k-values it has found primes for. You'll need to manually remove them from the sieve file. Personally, I never stop it. I just pick the range that I want and let it rip until it's done. But you have to plan your work amount carefully ahead of time. Gary |
![]() |
![]() |
#20 | |
Mar 2006
Germany
2·1,433 Posts |
![]() Quote:
if so, i was wrong. i had in mind the StopOnSuccess option from LLR/cllr when it really stops if a prime was found! i'll check this now! |
|
![]() |
![]() |
#21 |
Mar 2006
Germany
2·1,433 Posts |
![]()
ok, pfgw stops testing the same k-value a prime/PRP was found for, not stop testing at all!
so my fault, sorry! |
![]() |
![]() |
#22 |
May 2007
Kansas; USA
19·541 Posts |
![]()
I'm surprised at how little is known about PFGW. How have people been starting new bases? Manually with srsieve and LLR or Phrot? I hope not. That is hard and takes too much time!
![]() IMHO, PFGW with the stop-on-prime option set on is the only reasonable way to start a new base. You could sieve ALL k's below the conjecture immediately and let srsieve eliminate the k's with trivial factors but you'd still have a file that you'd want LLR/Phrot/PFGW/whatever to stop processing a k once it found a prime. Else, you'd have to eliminate tons of k's manually yourself if the conjecture was big...not something that I want to do. I'm asking because is there some other reasonable way to start a new base that's possibly good that I'm not aware of? |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Sierp base 16 - team drive #1 | gd_barnes | Conjectures 'R Us | 254 | 2014-06-10 16:00 |
Riesel base 3 - mini-drive I | gd_barnes | Conjectures 'R Us | 199 | 2009-09-30 18:44 |
Sierp base 3 - mini-drive Ib | gd_barnes | Conjectures 'R Us | 43 | 2009-03-06 08:41 |
Sierp base 3 - mini-drive Ia | gd_barnes | Conjectures 'R Us | 170 | 2008-11-11 05:10 |
mini-drive for high-n testing on Sierp base 4 | gd_barnes | Conjectures 'R Us | 43 | 2008-07-16 10:12 |