PRPnet 2nd drive-51 bases with <= 5 k's to n=250K

[gd_barnes]

This is CRUS PRPnet team drive #2 for all bases <= 200 with <= 5 k's remaining. We will be testing all k's to n=250K or until primed. Included in the drive are 51 bases and we may include more as bases are released or more bases are found with <= 5 k's remaining. The bases have each been sieved to their optimum depth for testing up to n=250K.

We will be running the drive entirely on CRUS PRPnet server port 1400. The server will hand out work by n-value so several bases will not be tested until we reach n=150K or 200K.

Instructions for running a PRPnet server and download links can be found here. The info. specific to this server that needs to be entered into your prpclient.ini file is:

server=G1400:100:1:noprimeleftbehind.net:1400

Server info.:

CRUS PRPnet server #2 (updated 2013-08-12 02:30 GMT):
maintained by mdettweiler on gd_barnes machine
Short identification: G1400
server: noprimeleftbehind.net
port: 1400
51 bases <= 200 with <= 5 k's remaining to n=250K
n-range: 50K-250K
currently processing at n= 250K (complete)
Server summary: http://noprimeleftbehind.net:1400/all.html

Primes:

 Prime found         by
1004*133^238300-1  Mathew
778*73^220782+1    mdettweiler
62*107^219967+1    Mathew
486*187^212627+1   Mathew
3303*112^210284+1  mdettweiler
194*165^196199+1   Mathew
2018*162^194314-1  Mathew
1886*67^177962-1   Mathew
86*123^176510-1    MyDogBuster
948*112^173968-1   MyDogBuster
18*189^171175+1    Mathew
4119*70^157484+1   Siemelink
576*172^132695-1   Mathew
38*200^131900-1    mdettweiler
584*103^131076-1   Mathew
304*135^114227+1   Lennart
94*107^105926+1    MyDogBuster
242*67^105312-1    Lennart
10968*61^102738-1  Lennart
58*200^102363-1    Lennart
2954*162^95124-1   Lennart
1308*162^82803-1   Lennart
693*172^61919-1    Lennart
178*191^52494+1    Lennart

Base / starting n / k's remain / # primes

 R61  100K  4k  1
 R67  100K  5k  2
 R70  100K  3k
 R80  200K  3k
 R93  200K  1k
 R94  200K  1k
R100  200K  1k
R103  100K  2k  1
R109  200K  1k
R112  150K  3k  1
R123  100K  2k  1
R133  100K  2k  1
R152  200K  1k
R158  100K  3k
R160  200K  1k
R162   50K  5k  3
R163  100K  1k
R172   50K  5k  2
R173  100K  1k
R177  100K  1k
R181  100K  1k
R182  100K  1k
R191  100K  2k
R200  100K  2k  2  (proven)
 S37  200K  3k
 S55  200K  4k
 S68  200K  2k
 S70  100K  5k  1
 S73  200K  2k  1
 S75  100K  2k
 S86  200K  1k
S100  100K  5k
S102  100K  3k
S107  100K  4k  2
S112  150K  2k  1
S118  200K  1k
S122  200K  1k
S133  100K  3k
S135   50K  5k  1
S140  100K  2k
S148  150K  1k
S155  200K  1k
S157  100K  3k
S165  100K  4k  1
S173  200K  1k
S174  200K  1k
S183  150K  1k
S185  100K  1k
S187  100K  1k  1  (proven)
S189  100K  1k  1  (proven)
S191   50K  4k  1

Good luck everyone and let's go prove some conjectures! :-)

The drive is now complete. Thanks to all who participated!


Gary

[gd_barnes]

All four n=50K bases have now been loaded into the server for a total of 22 bases. It's off to the races now!

[Lennart]

693*172^61919-1 is Prime

[Lennart]

2954*162^95592-1 is prime! (P = 3) Time : 3353.472 sec.

Lennart

[Lennart]

178*191^52494+1 is prime! Time : 284.562 sec.

[Lennart]

1308*162^82803-1 is Prime

[Lennart]

2954*162^95124-1 is prime! (P = 3) Time : 3338.565 sec.

This one is on a lower n.

Lennart

[gd_barnes]

Wow, what a run after a slow start.

I wonder why the clients only proved 2 out of the 5 PRP's? Mark, do you have any thoughts on that?

[rogue]

Originally Posted by gd_barnes

Wow, what a run after a slow start.

I wonder why the clients only proved 2 out of the 5 PRP's? Mark, do you have any thoughts on that?

I can't access the NPLB PRPNet server from work, so I will investigate when I get home later.

Until then, can someone tell me which were not proven and which program was used to determine that they are PRP?

There are some possibilities, which might account for that.

1) Running LLR only, but LLR can't prove primality due to running an older version of LLR.
2) Running LLR only with current LLR, but PRPNet client is incorrectly parsing the LLR output.
3) Running phrot on non-x86 computer as phrot can't prove primality.
4) Running phrot on x86 computer as pfgw and llr are not available.
5) Running pfgw, but primality test fails (least likely cause).

[gd_barnes]

Originally Posted by rogue

Until then, can someone tell me which were not proven and which program was used to determine that they are PRP?

Primes:
693*172^61919-1
1308*162^82803-1

PRPs:
178*191^52494+1
2954*162^95124-1
2954*162^95592-1

Lennart will have to answer about LLR or Phrot. Based on your response, if I had to speculate, he may have an older version of LLR in a couple of clients.

[rogue]

Originally Posted by gd_barnes

Lennart will have to answer about LLR or Phrot. Based on your response, if I had to speculate, he may have an older version of LLR in a couple of clients.

That information will be in the database.

Note that if running on a 64-bit OS that 64-bit pfgw is much faster than 32-bit llr for non-power of 2 bases. By much faster I mean more than 1 or 2 percent. pfgw can be 10 percent or more faster than llr, depending upon various factors. I understand that a separate primality test will be needed if a PRP is found, but since so few primality tests are needed (less than 1 in 1000), it is far better to use pfgw on a 64-bit OS. Now if they are all on 32-bit OS's then 32-bit llr is better than 32-bit pfgw.