20140905, 00:42  #144 
Jun 2003
11^{2}·13 Posts 
Serge,
I understand your point, but one of the reasons I like prime testing/distributed computing is to be as efficient I can. I like and value efficiency. Why don't you go ahead with the range. I have stumbled across something very interesting that I am currently working on and won't have the CPU resources to work on GM search for the next few months to a whole year. I will join back once I have some free resources. I can pick up a smaller range in the 5M+ region, when I have some free computing resources. 
20140905, 01:00  #145 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
21646_{8} Posts 
Ok. I will start by GPU sieving de novo (I want to give gmqfaktc a good test).
We can compare the survivor candidates, later. We can compare some residues later, too. I will run the AVX binary on the survivors. After that I will finish the 4.75M GQonly PRP tests as well. Those are enormous. (Caldwell's double check with PFGW took 6.7 days, as far as I remember. but of course that was before they got a new, shiny, fast server for UTM.) For this particular project, I was on a hiatus since April, too. 
20140906, 16:34  #146 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×3^{3}×13^{2} Posts 
2^{3704053} + 2^{1852027} + 1 is prime
There is ~5 AVX CPUyears of work in this interval (or ~8 nonAVX years), and this was waiting in the middle of it. Last fiddled with by Batalov on 20140906 at 17:01 Reason: formatting 
20140906, 22:05  #147 
Jun 2003
11^{2}×13 Posts 
Congratulations.

20140906, 22:38  #148 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9126_{10} Posts 
Thanks! ;)
Granted, the expected number of GM+GQs was << 1 in this interval. You mentioned that you had ~8 cores? With them, you could have reached this number, from end of Feb to mid or end of summer. But aw well. 
20140907, 02:22  #149 
Jun 2003
11^{2}·13 Posts 
I did not do the work sequentially. I had done part of that range. Just a matter of luck.

20140907, 08:44  #150 
May 2005
2·809 Posts 
Congratulations

20140908, 01:16  #151 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9126_{10} Posts 
3.53.85M range is complete
The 3.53.85M range is complete. The report is attached. 1 GM was found.
The J.Penne file <<gmfcandidates.txt>> had 1537 candidates removed out of 23172 prime numbers in this interval. For QC, these were doublechecked and the tiny factors are included in an addendum(<<RES_GMQ_35_to32bit.txt>>). Each of the 23172 prime numbers in this interval is accounted for, on both GM and GQ sides. Prefactoring was done using gmqfaktc0.20 to 60 bits. All factors are validated with Pari/GP. Light doublecheck for randomly chosen candidates (n=40) produced full agreement in the 80 RES64s with the initial run (of note: LLR implements random bitshifts for tests of GM candidates, so these were independent just like within GIMPS). More doublechecks are, of course, welcome. 
20150101, 00:29  #152 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·3^{3}·13^{2} Posts 
I'll have a look at adapting the Cyclo program for Gaussian (and Eisenstein)Mersennes.
Then we may have a great boost to find the next sequence members on GPUs. And we already have a GPU sieve. 
20150102, 10:52  #153 
May 2005
2×809 Posts 

20150102, 16:17  #154 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·3^{3}·13^{2} Posts 
Well, I have modified mfaktc, but I have never looked at mfakto.
I don't know how different they are. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
New PC dedicated to Mersenne Prime Search  Taiy  Hardware  12  20180102 15:54 
Gaussian integers use of norms  devarajkandadai  Number Theory Discussion Group  11  20171028 20:58 
Low clock speeds on Mersenne Prime search  Ammonia  Hardware  2  20160121 17:46 
Testing Mersenne cofactors for primality?  CRGreathouse  Computer Science & Computational Number Theory  18  20130608 19:12 
Can I specify the range to search the Mersenne Prime?  Unregistered  Information & Answers  22  20120320 11:38 