20120622, 07:50  #111  
Mar 2006
Germany
7·13·31 Posts 
Quote:
Example: the testfile "test.txt" contains two entries: Code:
3999*130^721 100542585*2^351 Screen output: Code:
Output logging to file pfgw.out No factoring at all, not even trivial division Switching to Exponentiating using GMP 3999*130^721 is 3PRP! (0.0046s+0.0008s) 100542585*2^351 is 3PRP! (0.0000s+0.0033s) Code:
3999*130^721 100542585*2^351 The "pfgw.ini" contains a line with Code:
CurLineNum=3 Calling "pfgw l tp f test.txt" will produce these: Screen output: Code:
Output logging to file pfgw.out No factoring at all, not even trivial division Primality testing 3999*130^721 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Calling BrillhartLehmerSelfridge with factored part 51.45% 3999*130^721 is prime! (0.0257s+0.0031s) Primality testing 100542585*2^351 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Calling BrillhartLehmerSelfridge with factored part 57.38% 100542585*2^351 is prime! (0.0058s+0.0046s) Code:
3999*130^721 100542585*2^351 Before running pfgw.exe, delete all files or copy them in another folder. 

20120622, 12:19  #112 
Sep 2005
Raleigh, North Carolina
337 Posts 
Thanks everyone. What I did was delete my .ini file then I had to copy and paste the pfgw.log with my prp's to a new file test.txt then it worked.

20120828, 01:18  #113 
Aug 2012
25_{10} Posts 
Trouble with {number_primes} option in PFGW
After lurking a bit and getting tired of BOINC doing its own thing, I've come to CRUS to do some cool stuff.
Once I get all the software and such figured out, I'd like to wind up reserving one of the recommended bases (S391 to 25k). However, I've got a couple questions. First, I can't seem to get the {number_primes,$a,1} option working correctly. I'm using the following input file (modified to test just this functionality)  ABCD 1456*391^$a+1 [2529] // {number_primes,$a,1} 1539 8 3 7 20 7 30 2 1 14 6 7 6 9 And then I throw this into WinPFGW: pfgw f0 l t sievesierpbase3912.5K25Kcgk2.txt My understanding of the {number_primes} functionality is that it should stop after the third test (where it finds that 1456*391^4076+1 is a prime), but it doesn't. With the standard screen logging, it says that "ABCD File Processing for at most 1 Primes." If someone could explain where my error is here, that would be fantastic. Secondly, how do I leverage multiple cores? Is it as simple as splitting up the range and opening multiple instances of WinPFGW? Thanks a lot, Caz 
20120828, 03:10  #114  
Nov 2009
2·5^{2}·7 Posts 
Welcome CGKIII,
I am not sure if pfgw likes the .abcd fromat (this is the one you are currently using). What you can do instead of using the .abcd format is use the pfgw format by doing the following command: Code:
srfile w sievesierpbase3912.5K25Kcgk2.txt Code:
//{number_primes,$a,1} This will then stop on: Code:
1456*391^4076+1 is 3PRP! Quote:
Also, You do not want to do Code:
pfgw f0 l t pfgw_filename Code:
pfgw f0 l pfgw_filename Hope this helps, Mathew 

20120828, 04:15  #115 
Aug 2012
5^{2} Posts 
Got it. Thanks a lot Mathew. Currently up and running on 2 cores with a manual split. Later this week I'll look more into PRPNet, since I've got another machine or two and would like to get things a bit more automated.

20120828, 04:26  #116 
May 2008
Wilmington, DE
3×947 Posts 
Welcome CGKIII. There are many ways to do this testing. I personally use PRPNET, but is is tricky to set up unless you already know how to install MYSQL.
An alternative is that we do have private PRPNET ports set up for the server side of PRPNET. You would only have to get the client side running pointing to that port. You could then have multiple cores going against your range. I have done ranges for 2.5K25K using this method and it works just fine as long as you configure the clients for at least a cache of 10. Any lower and the server will get bogged down because the tests @ 2.5 k are only about 1 sec in duration. I am not a PFGW or WinPFGW guru but I'm sure there are enough people around that can get you rolling if that's what you choose. I do know that if you bust it into multiple cores, all tests for a k must stay together otherwise if you find a prime on one core, the other cores won't know about it. //(number_primes,$a,1) is telling PFGW to flag the primedk and don't test that k anymore. The program doesn't actually stop. Again, welcome and ask all the questions you need to. 
20120828, 04:38  #117 
May 2007
Kansas; USA
2·5^{2}·7·29 Posts 
Hi CGK,
I'm sorry I didn't respond to your PM. I was out of town until late yesterday with limited online time. It looks like Ian (MyDogBuster) and Mathew got you started. I wanted to add one more thing: If you decide to reserve S391, there is a sieve file already available. The file will probably need to be sieved further but it would be a very good start. Take a look at our Sierp reservations page at http://www.noprimeleftbehind.net/cru...ereserves.htm. Go down to base 391 and there will be a link to the file out to the right. To make your reservation "official", just post it in the bases 251500 thread. Good luck! Gary 
20120828, 04:51  #118 
May 2008
Wilmington, DE
3·947 Posts 
I also need to point out that PRPNET will run on Linux or Windows. I know nothing of Linux but could probably get you started on Windows. Another poster here, Rogue, actually wrote PRPNET so we have the ultimate source of knowledge.
Last fiddled with by MyDogBuster on 20120828 at 04:51 
20120915, 21:58  #119 
Aug 2012
5^{2} Posts 
Is sieving machinedependent?
So I've run the new base script on S282 to n = 2500 (going to take it to n = 25,000). Now, it's my understanding that I run srsieve for the remaining k's up to  P 100e6 (magic number I saw somewhere and wrote down). And then I run sr2sieve until I get to a removal rate ~ time it takes to do an LLR test at about 60/70% of the range, for an "average" k. I've got four machines with four different average testing times. If I sieve on one machine and stop at the average testing time for that one, will that roughly correspond to the same sieve depth, had I used another machine? I assume so, because we have sieve files that get passed back and forth between people, but if that's not the case, then I'd like to figure out how to choose which machine will do the sieving. 
20120915, 23:31  #120  
May 2007
Kansas; USA
2×5^{2}×7×29 Posts 
Quote:
Last fiddled with by gd_barnes on 20120915 at 23:33 

20120921, 09:03  #121 
Aug 2012
25_{10} Posts 
I'd like to modify the new base script to handle notquitenew bases, since it seems to do a bunch of nice things already.
Is it as simple as adding "DIM min_n, xxxx" to the section where all the variables are declared, and then change "SET n, 0" to "SET n, min_n" Testing it myself might be the way to go, but I'll be out of town this weekend and won't have time to troubleshoot. I want to get more granular with my sieving (rather than optimizing sr2sieve removal rates for a large range, chunk it better and optimize within those smaller chunks), but I don't currently have a good way to use PFGW to test from A to B, where A != 0. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Useless SSE instructions  __HRB__  Programming  41  20120707 17:43 
Questions about software licenses...  WraithX  GMPECM  37  20111028 01:04 
Software/instructions/questions  gd_barnes  No Prime Left Behind  48  20090731 01:44 
Instructions to manual LLR?  OmbooHankvald  PSearch  3  20050805 20:28 
Instructions please?  jasong  Sierpinski/Riesel Base 5  10  20050314 04:03 