20190205, 13:46  #144 
"Mark"
Apr 2003
Between here and the
1011010101000_{2} Posts 

20190311, 16:32  #145 
"Dylan"
Mar 2017
1E4_{16} Posts 

20190413, 10:31  #146 
"Dylan"
Mar 2017
2^{2}·11^{2} Posts 

20190415, 13:01  #147 
Banned
"Luigi"
Aug 2002
Team Italia
1293_{16} Posts 

20190415, 16:22  #148 
"Dylan"
Mar 2017
744_{8} Posts 
For the lowish n’s I use feromant_cuda (at or below n=80, mmff should be used but that still doesn’t work on Pascal cards and I haven’t heard back from TheJudger yet). I haven’t done one in the range between the range of applicability of feromant_cuda and gfndsieve.
For the high n’s (like the one in the post above) I use gfndsieve from the mtsieve suite to sieve and pfgw with the gx flag to primality test and check for GFN’s. 
20190418, 21:33  #149 
"Dylan"
Mar 2017
744_{8} Posts 
Reserving n = 16001699, k = 600e8700e8.

20190419, 08:53  #150 
Banned
"Luigi"
Aug 2002
Team Italia
3·5·317 Posts 
As Feromant_CUDA can't work on this range, I assume you are using gfndsieve+pfgw.
For such "low" N the use of a fast drive (SSD or NVMe) is strongly suggested,a as the overhead imposed by the I/O operations is quite high. Obviously I am not answering directly to Dylan, but to all the readers. Last fiddled with by ET_ on 20190419 at 08:54 
20190428, 01:27  #151 
"Dylan"
Mar 2017
2^{2}·11^{2} Posts 

20190521, 00:08  #152 
"Dylan"
Mar 2017
2^{2}·11^{2} Posts 

20190629, 17:31  #153 
"Dylan"
Mar 2017
484_{10} Posts 

20190718, 20:13  #154 
"Dylan"
Mar 2017
744_{8} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Reservations  ET_  Operazione Doppi Mersennes  484  20200323 19:13 
Reservations  kar_bon  Riesel Prime Data Collecting (k*2^n1)  129  20160905 09:23 
Reservations?  R.D. Silverman  NFS@Home  15  20151129 23:18 
Reservations  R.D. Silverman  Cunningham Tables  15  20110304 21:01 
45M Reservations  paulunderwood  3*2^n1 Search  15  20080608 03:29 