Range of Prime95?

iNSiPiD1 · 2010-04-12, 21:27

Can Prime95 test a 215million digit number for primality?

joblack · 2010-04-12, 22:10

Quote:

Originally Posted by iNSiPiD1

Can Prime95 test a 215million digit number for primality?

You can manually add Mersenne numbers up to 990M (~ 300 million digits). The problem is that the time will very long (several years).

petrw1 · 2010-04-12, 22:27

Quote:

Originally Posted by iNSiPiD1

Can Prime95 test a 215million digit number for primality?

Theoretically, maybe.
According to http://www.mersenne.org/primenet/
there are currently 2 LL tests with exponents in the 750M range --- about 233M digits; through the years there have been many more at your size or bigger but none have ever finished.

Practically ... NOT likely.
The current supported maximum range for Prime95 is 596M or about 185M digits. Maybe others can explain how those larger assignments exist...could be they are using a program other than Prime95.

Our current BEST theoretical benchmark would have an Intel i7-980x running all 6 cores NON-stop 2.5 years to test 596000000 ... I could only guess that it may take twice as long or more to complete your proposed test.

Mini-Geek · 2010-04-12, 23:02

No, Prime95 can't run a number that big. It won't run LL on anything above 2^596M (179.4 million digits), which is probably the largest number that will work with the largest supported FFT size: 32M. As others have said, other programs might support larger sizes, but in any case, numbers that big would take years (at least without a supercomputer).
Is there a particular 215M digit number you're considering? What drew you to this number? Have you done any TF on this number? Prime95 or Factor5 (which supports multithreading) should work for that. That would be an easy way to prove it composite (if it is).

lfm · 2010-04-12, 23:10

Quote:

Originally Posted by petrw1

According to http://www.mersenne.org/primenet/
there are currently 2 LL tests with exponents in the 750M range --- about 233M digits; through the years there have been many more at your size or bigger but none have ever finished.

That was me. I was manually trying to get some TFs in that range and clicked the wrong box or something. Then I lost the ID code to cancel them(blush). I thought they would time out when no progress was reported on them but its been nearly 6 months now without any activity, not even check ins and they are still there!

iNSiPiD1 · 2010-04-12, 23:13

Quote:

Originally Posted by Mini-Geek

No, Prime95 can't run a number that big. It won't run LL on anything above 2^596M (179.4 million digits), which is probably the largest number that will work with the largest supported FFT size: 32M. As others have said, other programs might support larger sizes, but in any case, numbers that big would take years (at least without a supercomputer).
Is there a particular 215M digit number you're considering? What drew you to this number? Have you done any TF on this number? Prime95 or Factor5 (which supports multithreading) should work for that. That would be an easy way to prove it composite (if it is).

Well, the story that drew me to this particular number is laughable. I only wish to test the number to satisfy my own curiosity. I have not done a TF on it, but maybe I will sometime.

I suspect that I will have to wait for the computers to get faster, or for a faster algorithm to be found... or something like that. Or start now and wait a few years...

Mini-Geek · 2010-04-12, 23:15

Quote:

Originally Posted by lfm

That was me. I was manually trying to get some TFs in that range and clicked the wrong box or something. Then I lost the ID code to cancel them(blush). I thought they would time out when no progress was reported on them but its been nearly 6 months now without any activity, not even check ins and they are still there!

(I was going to suggest logging in and unreserving them, but I just checked and I see they're reserved as ANONYMOUS)
If you have anything to show/suggest that it was you (or maybe even if you don't), you could email George to get it squared away:

Or, I think 6 months is the time limit, so soon they should expire on their own.

lfm · 2010-04-12, 23:22

Quote:

Originally Posted by Mini-Geek

I don't suppose you checked them out under an account..? If so, you can unreserve them from http://www.mersenne.org/workload/

ya it was anonymous too. I think I was sleep deprived or something at the time. About the only evidence I have that it was me is to note the surrounding TF results are mostly mine. Evidence, not proof of course.

It seems odd to me that this isn't automated yet. I thought there was some discussion about stuff over 90 days without a check-in would be released for re-assignment. Maybe only applies to the more active ranges or something?

CADavis · 2010-04-13, 05:35

i don't think it applies to manual assignments.

Quote:

I don't remember the LMH policy. It might well be that assignments are
cleared after a year.

Regards,
george

ET_ · 2010-04-13, 08:56

Quote:

Originally Posted by iNSiPiD1

Well, the story that drew me to this particular number is laughable. I only wish to test the number to satisfy my own curiosity. I have not done a TF on it, but maybe I will sometime.

I suspect that I will have to wait for the computers to get faster, or for a faster algorithm to be found... or something like that. Or start now and wait a few years...

I can run some trial-factoring for you if you don't mind, just send a PM with the exponent to me

Luigi

joblack · 2010-04-13, 09:45

Quote:

Originally Posted by Mini-Geek

No, Prime95 can't run a number that big. It won't run LL on anything above 2^596M (179.4 million digits), which is probably the largest number that will work with the largest supported FFT size: 32M. As others have said, other programs might support larger sizes, but in any case, numbers that big would take years (at least without a supercomputer).
Is there a particular 215M digit number you're considering? What drew you to this number? Have you done any TF on this number? Prime95 or Factor5 (which supports multithreading) should work for that. That would be an easy way to prove it composite (if it is).

I've got one in that number intervall. With one core it takes around 30 years. You can decrease the time significantly. With an 8- or 12-core system you will get down to 5 - 7 years and with Moore's Law you will have finished around 4 years.

2010-04-12, 21:27	#1
iNSiPiD1 Apr 2010 2·3 Posts	Range of Prime95? Can Prime95 test a 215million digit number for primality?

2010-04-12, 23:02	#4
Mini-Geek Account Deleted "Tim Sorbera" Aug 2006 San Antonio, TX USA 17×251 Posts	No, Prime95 can't run a number that big. It won't run LL on anything above 2^596M (179.4 million digits), which is probably the largest number that will work with the largest supported FFT size: 32M. As others have said, other programs might support larger sizes, but in any case, numbers that big would take years (at least without a supercomputer). Is there a particular 215M digit number you're considering? What drew you to this number? Have you done any TF on this number? Prime95 or Factor5 (which supports multithreading) should work for that. That would be an easy way to prove it composite (if it is). Last fiddled with by Mini-Geek on 2010-04-12 at 23:06

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
OK, how can we get a range now?	thechickenman	Lone Mersenne Hunters	4	2008-12-01 10:45
Status of range M31.3-M33.2	leifbk	Lone Mersenne Hunters	19	2005-09-26 12:00
Dropping my range	Axel Fox	Lone Mersenne Hunters	2	2004-06-22 11:44
Available range for TF to 2^60?	edorajh	Lone Mersenne Hunters	2	2003-12-31 16:04
getting a range?	tom11784	Lone Mersenne Hunters	1	2003-08-29 18:56