|
2005-06-06, 20:00
|
#1 |
|
17×281 Posts |
Lucas test for billion bit prime
 Hello Does anyone know if i can use prime95 version 24.11 for a billion bit lucas-lehmer testing or any other such software?
|
|
|
2005-06-06, 20:36
|
#2 | |
|
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2E5E16 Posts |
Quote:
You can't use Prime95 itself for gigabit LL-testing, but other multiprecision math libraries could be used. How long are you prepared to wait for a single test to run? Paul |
|
|
|
|
2005-06-06, 22:06
|
#3 |
"Curtis"
Feb 2005
Riverside, CA
53×113 Posts |
You understand that LL testing a billion-bit number would take roughly double your lifetime on current hardware, yes?
I believe Prime is not coded to factor *or* LL test above n=80 million; I've never heard of anyone trying such a power, but I know of no specific limitations on Proth for exponent size. However, as Proth is much less efficient code, expect it to take something near 3 lifetimes to complete one test instead of a mere 2 lifetimes, if it indeed can handle the exponent. If it is mere curiosity about the program's limits, plug such a power in to Proth and see if it spits out an error (may as well find time per iteration while you're at it, for entertainment). -Curtis |
|
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Modifying the Lucas Lehmer Primality Test into a fast test of nothing | Trilo | Miscellaneous Math | 25 | 2018-03-11 23:20 |
| Question on Lucas Lehmer variant (probably a faster prime test) | MrRepunit | Math | 9 | 2012-05-10 03:50 |
| question range 1 billion to 2 billion? | Unregistered | Information & Answers | 7 | 2010-08-12 06:25 |
| Billion digit prime? | lfm | Operation Billion Digits | 6 | 2009-01-07 01:17 |
| about Lucas-Lehmer test and Prime 95 | Annunaki | Math | 22 | 2003-08-05 21:52 |
