mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > NeRDs

 
 
Thread Tools
Old 2015-01-02, 07:59   #1
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,491 Posts
Default 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 sub-million 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 sub-semi-mega bigger-than-PG-twin-search.

(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 2015-01-02 at 08:02
paulunderwood is online now  
Old 2015-01-02, 08:40   #2
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

41×109 Posts
Default

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.
VBCurtis is offline  
Old 2015-01-02, 08:51   #3
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,491 Posts
Default

Is there a sieve for (H)
paulunderwood is online now  
Old 2015-01-02, 09:47   #4
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

3,491 Posts
Default

Code:
? 2^5*3^2*5*7*11*13*log(2)/log(10)
433916.67694988905402889179241167322850
? 2^5*3^2*5*7*11*13
1441440
So 2^1441440-2^k-1 might be a candidate for (E), where 360360<=k<1441440.
paulunderwood is online now  
Old 2015-01-02, 17:45   #5
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22×3×7×109 Posts
Default

Someone else is apparently thinking about F), independently.
Batalov is offline  
Old 2015-01-02, 17:52   #6
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

100011110001002 Posts
Default

I think about A), and possibly redirecting the CPU power into the soon to emerge "Cyclo"tomic-based 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.
Batalov is offline  
Old 2015-01-02, 19:12   #7
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

177216 Posts
Default

Quote:
Originally Posted by Batalov View Post
I think about A), and possibly redirecting the CPU power into the soon to emerge "Cyclo"tomic-based 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.
I believe that putting this onto PRPNet would require a new server type. I presume that Cyclo would run on the client side and do the PRP testing. That would require additional changes to the client. As PRPNet is open source (via sourceforge) if someone wants to work on it, let me know now I'll give you access to the repository.
rogue is offline  
Old 2015-01-07, 02:26   #8
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22·3·7·109 Posts
Default

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 GNF-Sv).
They have an existing worked-out way of coordinating that. The sieve is data-less, and they have a result collection upload server.
Batalov is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
What does net neutrality mean for the future? jasong jasong 1 2015-04-26 08:55
The future of Msieve jasonp Msieve 23 2008-10-30 02:23
Future of Primes. mfgoode Lounge 3 2006-11-18 23:43
The future of NFSNET JHansen NFSNET Discussion 15 2004-06-01 19:58
15k Future? PrimeFun Lounge 21 2003-07-25 02:50

All times are UTC. The time now is 06:08.

Wed Nov 25 06:08:13 UTC 2020 up 76 days, 3:19, 4 users, load averages: 1.57, 1.46, 1.53

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.