mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Five or Bust - The Dual Sierpinski Problem

Reply
 
Thread Tools
Old 2020-11-17, 06:13   #1
bbb120
 
bbb120's Avatar
 
Feb 2019
China

2·29 Posts
Default How can I run PRP test?

Quote:
Originally Posted by engracio View Post
Well guys it was nice while it lasted. Pending on more rigorous testing by Phil, we have BUSTED nummer funf.

I thought I might post this prior to more verification to let others go on to other projects on their queue.
which software can give a PRP test ?
how long does it cost ?
bbb120 is offline   Reply With Quote
Old 2020-11-17, 06:41   #2
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

112×37 Posts
Default

LLR, or pfgw. Time taken depends rather heavily on hardware, just like it does for Prime95.
A prp test is about the same speed as what P95 would take on that same size of exponent.
VBCurtis is offline   Reply With Quote
Old 2020-11-17, 06:43   #3
firejuggler
 
firejuggler's Avatar
 
Apr 2010
Over the rainbow

46518 Posts
Default

at this size, primo isn't practical
firejuggler is online now   Reply With Quote
Old 2020-11-17, 16:18   #4
sweety439
 
sweety439's Avatar
 
Nov 2016

9B916 Posts
Default

Quote:
Originally Posted by firejuggler View Post
at this size, primo isn't practical
Well, primo cannot handle numbers > 2^65536, or the repunit R49081 (=(10^49081-1)/9) will be already proven to be prime.
sweety439 is offline   Reply With Quote
Old 2020-11-17, 16:56   #5
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

105758 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Well, primo cannot handle numbers > 2^65536, or the repunit R49081 (=(10^49081-1)/9) will be already proven to be prime.
https://primes.utm.edu/top20/page.php?id=27 suggests you're mistaken about the size of numbers Primo can handle.

Maybe you should run that Primo proof yourself- it's just 25% or so more digits than the current record holder. Shouldn't take you long, right?
VBCurtis is offline   Reply With Quote
Old 2020-11-17, 21:23   #6
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

31810 Posts
Post

I would happily certify it if I had the resources. Unfortunately for Primo (which can run about 64 concurrent tasks at a time), the time complexity for certifying N prime is at least O(ln(N)^4). I had asked about how long it would take to run some time ago.

In A PM, I was given these averages times for certifying a 25k digit number.

64 cores (22.5 days)
32 cores (45 days)
16 cores (3 months)
8 cores (6 months)
4 cores (1 year)

So for 50k digits, we have

64 cores (360 days) Almost a year!!!
32 cores (720 days)
16 cores (1440 days)
8 cores (2880 days)
4 cores (5760 days)

At best, you could probably certify R49081 in just a little under a year.
carpetpool is offline   Reply With Quote
Old 2020-11-24, 17:03   #7
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

2A416 Posts
Default

Primo has a built-in limit on the candidate size. Marcel Martin increases the limit from time to time as better hardware allows for bigger tests. At the moment the limit is 132,928 bits which is about 40,000 decimal digits. So at least for now, no chance. Maybe in a future update it will be possible to certify R49081.



PS: on the other hand that means the next three numbers in the probable primes thread are now within the primo limit but with numbers that close to the theoretical limit there is still a chance of primo being unable to provide a proof.

Last fiddled with by Puzzle-Peter on 2020-11-24 at 17:17
Puzzle-Peter is offline   Reply With Quote
Old 2020-11-24, 17:21   #8
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

23·19·23 Posts
Default

Quote:
Originally Posted by Puzzle-Peter View Post
Maybe in a future update it will be possible to certify R49081.
I have an experimental version of Primo
paulunderwood is offline   Reply With Quote
Old 2020-11-25, 14:27   #9
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

22×132 Posts
Default

Quote:
Originally Posted by paulunderwood View Post
I have an experimental version of Primo

Cool. I've had my share of XXL certificates. No more...
Puzzle-Peter is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
I found the primality test, there seems to be no composite numbers that pass the test sweety439 sweety439 7 2020-02-11 19:49
Modifying the Lucas Lehmer Primality Test into a fast test of nothing Trilo Miscellaneous Math 25 2018-03-11 23:20
Double check LL test faster than first run test lidocorc Software 3 2008-12-03 15:12
Will the torture test, test ALL available memory? swinster Software 2 2007-12-01 17:54
A primality test for Fermat numbers faster than P├ępin's test ? T.Rex Math 0 2004-10-26 21:37

All times are UTC. The time now is 19:25.

Thu Nov 26 19:25:53 UTC 2020 up 77 days, 16:36, 4 users, load averages: 1.13, 1.15, 1.20

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.