Share N+/-1 Primality Proofs

[MDaniello]

2651751025...69   N-1   319 digits
1165310011...01   N-1   320 digits
6184084914...01   N-1   349 digits
10^358*2002+1    N-1   362 digits
6342716177...01   N-1   1002 digits
2030576991...01   N-1   1008 digits
1132190901...01   N-1   1010 digits
7702839945...01   N-1   1011 digits
1537698526...01   N-1   1012 digits
2^100013*133603707-1   N+1*   30116 digits
2^263957*226005-1      N+1*   79465 digits
2^327844*2904473715-1  N+1*   98701 digits
2^406996*22932195-1   N+1*   122526 digits
2^408989*11361-1      N+1*  123123 digits

*Recently, while checking the db, I found out a handful of known primes that were classified there as U (Unknown status), and assigning them to a worker for a PRP test automatically proved them prime by N+1 test.

Assigning numbers for a PRP test used to be available for U integers with less than 150k digits. However, it looks like yesterday the threshold was lowered to 100k digits.
I have spotted another similar prime in the U list today, but it has >100k digits, so I am unable to assign it to a PRP test.

[MDaniello]

7438146428...21   N-1   300 digits
(136##/569+1)*1194-1   N+1   322 digits
2^1063*77777+1      N-1   325 digits
(1538^356+1)/(1538^4+1)  N-1  1122 digits
(7023^1153-1)/7022   N-1   4432 digits
fibonacci(12652)^2+2   N-1   5288 digits
(2^20757-3)*19140-1   N+1   6253 digits
(1507^2521+1)/1508   N-1   8009 digits
117371^2015*2+1   N-1   10216 digits
1025139165*60013#+1   N-1   25992 digits
1027676400*60013#+1   N-1   25992 digits
2^224947*139-1   N+1   67718 digits
2^281095*80555475-1   N+1   84626 digits
2^294163*5169615-1   N+1   88559 digits

[MDaniello]

(36^195*11+11329)/8015   N+1   301 digits
33413^746-2   N+1   3375 digits
(2^10367+1)^2-2   N+1   6242 digits
(92^1795+1)^2-2   N+1   7050 digits
(156^1663-1)^2-2   N+1   7295 digits
(4847393^2048+1)/2   N-1   13692 digits
2^249279*1222853775-1   N+1   75050 digits
2^252736*317372055-1    N+1   76090 digits
2^305693*1694614845-1   N+1   92032 digits

[MDaniello]

(56^1698-1)^2-2   N+1   5937 digits
(60^1717+1)^2-2   N+1   6107 digits
(252^1330-1)^2-2   N+1   6388 digits
(432^1227+1)^2-2   N+1   6468 digits
(154^1495-1)^2-2   N+1   6541 digits
(2^21701-1)*138769890-1   N+1   6541 digits
(2^21701-1)*138769890+1   N-1   6541 digits
(86^2053-1)^2-2   N+1   7944 digits
(58^2354+1)^2-2   N+1   8303 digits
(10^4299-1)^2-2   N+1   8598 digits
2^233370*317372055-1   N+1   70260 digits
2^241271*151-1   N+1   72632 digits
2^271193*2037910875-1   N+1   81647 digits
2^284790*14549535-1   N+1   85738 digits
2^295705*212270565-1   N+1   89025 digits
2^301816*445419975-1   N+1   90865 digits

[chris2be8]

Is anyone on this list submitting Primo certificates? I'm running a script to prove 300+ digit PRPs and had a load of near collisions between 480 and 495 digits. But I can't tell if whoever submitted them had any of their work wasted because I'd just submitted a certificate.

I've downloaded one, it was submitted by "Anonymous", made with Primo 4.3.3 - LX64 and the input file was /home/user/Downloads/primo/4/primo_1100000004583465610.in (does anyone recognise this?)

My script works on the smallest PRPs over 299 digits. So if you keep above the first 1000 PRPs you should be safe.

[MDaniello]

5386827937...01   N-1   3176 digits
(1209!-97)/97      N+1   3202 digits
2^254563*406033-1   N+1   76637 digits
2^259951*135-1       N+1  78256 digits
2^284851*406033-1   N+1   85755 digits
2^290565*14549535-1   N+1   87476 digits
2^296822*155-1       N+1   89355 digits
2^310281*663301485-1   N+1   93413 digits
2^312214*1222853775-1   N+1   93995 digits
2^315661*2022381375-1   N+1   95033 digits
2^321975*3276742755-1   N+1   96934 digits
2^324527*779602395-1   N+1   97702 digits