![]() |
|
|
#56 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
250416 Posts |
Ah, I see now, Borys. GQs are those cofactors*, and that's of course something that comes for free with LLR (because the whole calculation is done in 2^2p+1 and only the last modulo is taken mod GM and GQ). I am done with 2-2.3M GM/GQs, and I guess I will proactively reserve 2.5-3.5M at this time.
______________ *For a moment I was thinking that you were referring to EMs. If I understand correctly, these are still being done in general form (in both pfgw and llr) and are quite slow. Come to think of it, maybe I'll try to hack LLR into doing EMs; all that's needed is to do squarings modulo 3^3p+1 and the last step mod 3^p+1, and mod |
|
|
|
|
|
#57 | ||
|
May 2005
31308 Posts |
Quote:
Code:
TestGM=1 TestGQ=1 FactorOverride=54 As for PRPnet server, I don't think it can properly handle the input file structure required by LLR to perform GM+GQ search, e.g.: Code:
ABC 4^$a+1 1950017 48 1950037 48 Quote:
Last fiddled with by Cruelty on 2014-01-25 at 08:59 |
||
|
|
|
|
|
#58 | |
|
Jun 2003
2×7×113 Posts |
Quote:
I would like to reserve 3.5-5.0M. Is it possible to do trial factor on GPU? What range of GQ is not-tested for which a factor of the GM has been found. I am somewhat more interested in GQ than GM. Is there a list of all the known GQ primes? Last fiddled with by Citrix on 2014-01-26 at 00:20 |
|
|
|
|
|
|
#59 |
|
Jun 2003
2×7×113 Posts |
What does the 48 in
Code:
ABC 4^$a+1 1950017 48 1950037 48 |
|
|
|
|
|
#60 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
224048 Posts |
Yes. You can use the 32-bit LLR executable for prefactoring; it then produces the output file in this format. If you later use the output file as input and increase the FacTo=54 parameter (e.g.), the program will factor from 48 to 54 bits.
In the meantime, I found one of them GQs, submitted to the PRP top. It may take a few days to be approved. Ok, here it is: Quote:
Last fiddled with by Batalov on 2014-01-26 at 08:59 |
|
|
|
|
|
|
#62 |
|
May 2005
23·7·29 Posts |
Congratulations!
|
|
|
|
|
|
#63 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
224048 Posts |
Channeling the inner davieddy: It's (going to be) number 9.
|
|
|
|
|
|
#64 |
|
May 2005
110010110002 Posts |
Since reservations have recently jumped from 2M to 5M I would like to reserve 5M-6M range. I'll start with pre-factoring and first I have to figure out the optimal depth - any suggestions for that?
![]() Batalov and Citrix: should you by any chance give up your ranges just let me know
|
|
|
|
|
|
#65 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
224048 Posts |
My range is now finished. There was just one GQ PRP.
Citrix: do you have an estimate how much time it will take you to finish your reservation? In general, it should be in good form to reserve something that one can do in a week, a month... not 10 years. |
|
|
|
|
|
#66 |
|
Jun 2003
2×7×113 Posts |
I am going to put 2 i7 Haswell on it for sure.. maybe couple more if I can somehow get PRPnet to work for these numbers. I am not sure how long it is going to take.. I need to run some tests first. I don't think the range is large enough that it will take 10 years. If we can have GPU factoring.. that will save alot of time.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| New PC dedicated to Mersenne Prime Search | Taiy | Hardware | 12 | 2018-01-02 15:54 |
| Gaussian integers- use of norms | devarajkandadai | Number Theory Discussion Group | 11 | 2017-10-28 20:58 |
| Low clock speeds on Mersenne Prime search | Ammonia | Hardware | 2 | 2016-01-21 17:46 |
| Testing Mersenne cofactors for primality? | CRGreathouse | Computer Science & Computational Number Theory | 18 | 2013-06-08 19:12 |
| Can I specify the range to search the Mersenne Prime? | Unregistered | Information & Answers | 22 | 2012-03-20 11:38 |