20150102, 07:59  #1 
Sep 2002
Database er0rr
2×11×167 Posts 
Future directions
When I started this little project, I hadn't expected the Batalov Effect. We are grateful to Serge for his huge crunching efforts and he has been rewarded with finding those 4 primes for base 10 and expoenent 388080. It is a pity about the dearth for exponent 471240.
The use of generic modular reduction for such large exponents and bigger ones is a big disadvantage to the project. However I have a few ideas about what to do next: (A) Shelve the project. (B) Do another submillion exponent for base 10  will require a few weeks of Ksieve. (C) Do a mega exponent for base 10 using the magic formula which leaves a lot in the sieve  will require quite a while with Ksieve. (D) Do base 10 with exponent 1000000. (E) Do a base 2 search using the magic formula  can be engineered to leave a lot in the sieve; has a bigger domain to search, with more primes per exponent. Fast at subsemimega biggerthanPGtwinsearch. (F) Choose another base such as 3 or 2015 etc. (G) Go for a world record prime  fanciful. (H) Search for NeRDs which use only special modular reduction. My favourites are (A) or (E). Last fiddled with by paulunderwood on 20150102 at 08:02 
20150102, 08:40  #2 
"Curtis"
Feb 2005
Riverside, CA
7·683 Posts 
C, E, and H all sound good. I haven't contributed yet, but I like to sieve, so I'd be willing to help with that for the next step in the project.

20150102, 08:51  #3 
Sep 2002
Database er0rr
2×11×167 Posts 
Is there a sieve for (H)

20150102, 09:47  #4 
Sep 2002
Database er0rr
2·11·167 Posts 
Code:
? 2^5*3^2*5*7*11*13*log(2)/log(10) 433916.67694988905402889179241167322850 ? 2^5*3^2*5*7*11*13 1441440 
20150102, 17:45  #5 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·5·23·41 Posts 
Someone else is apparently thinking about F), independently.

20150102, 17:52  #6 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·5·23·41 Posts 
I think about A), and possibly redirecting the CPU power into the soon to emerge "Cyclo"tomicbased project. It is similar to F)+H), and indeed, only focuses on numbers for which special FFT exists.
Initially, it will probably be on PrimeGrid's PRPnet, as most budding projects are. I can provide my LLR implementation for their CPU participants, and Cyclo is OpenCL so it will run on any modern* GPU. ______________ *this excludes only very old and cheap cards that don't have double float. 
20150102, 19:12  #7  
"Mark"
Apr 2003
Between here and the
2^{2}·19·83 Posts 
Quote:


20150107, 02:26  #8 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9430_{10} Posts 
They will probably take care of that (or it can be disguised as a flavor of the genefer[OCL]search).
Initially they will have a sieving period which is mostly manual (and only Windows sieve existed so far, just like for GNFSv). They have an existing workedout way of coordinating that. The sieve is dataless, and they have a result collection upload server. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
What does net neutrality mean for the future?  jasong  jasong  1  20150426 08:55 
The future of Msieve  jasonp  Msieve  23  20081030 02:23 
Future of Primes.  mfgoode  Lounge  3  20061118 23:43 
The future of NFSNET  JHansen  NFSNET Discussion  15  20040601 19:58 
15k Future?  PrimeFun  Lounge  21  20030725 02:50 