20121012, 03:53  #1 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}·3^{2}·7·37 Posts 
GFN factoring with mmffgfn  Reservations
Is anyone hungry for factors?
I was and I now have satisfied my initial thirst and would like to put my GPUs back into Fermat only. GFN (Generalized Fermat numbers) will give you a needed break from proper Fermats! So, I wanted to help out by maintaining a reservation thread. I will post all open ranges (and mark my words, there are factors in 'em!) and you could take a range (and a base), get the binary (flashjh built Windows binaries which are posted here)  and have fun! You would then report factors to W.Keller as "I.Surname & Woltman" (absence of initial means the program author) and here in the GFN factors thread. Is anyone interested? For either Win/Linux, get the tests_and_cudart.zip file. Unzip. Use separate folders for each base. Use sample worktodo.txt files from the tests_and_cudart.zip file. Put the library and mmff.ini in each folder. For Windows, get the mmffgfnX0.26win32win64.zip and tests_and_cudart.zip files. Put the library, mmff.ini and the corresponding EXE file in each folder and start by running sample on the worktodo.txt file. Inspect the results.txt files. For Linux, you will be better off building your own binary (source is posted, too), but you can try the posted binaries (they were built in OpenSuSE, so they may not work for you; and you will need libcudart.so). Note that for N<=25, the limits are k>=10e12 already and furthermore that range of N has been already bombarded with P1 and ECM. The useful range for mmffgfn starts approximately from N>=26, where the previous search limits were 2e12 (N<=50), 1e12 (N<=100) and 0.1e12 (N>100). _______________________ If you find a factor, you can validate it before getting too excited  in a few ways: 1. paste in factorDB. It should be prime or PRP. If it is composite, then both small factors are very likely to be already known. Example: "GF(23,5) has a factor: 3680510522410915594241" (which is = 167772161 * 21937552097281); a pair of valid, known factors 2. Using factorDB (or Pari, or even bc l or dc) get the canonical form k*2^N+1 and then run pfgw f gxo q"k*2^N+1". Expect a message with four exclamation points. 3. Using Pari/GP, you can run Mod(b,f)^(2^m)+1 (and expect a 0) Last fiddled with by Batalov on 20121013 at 09:31 
20121012, 03:57  #2 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}·3^{2}·7·37 Posts 
Reservations for GFN3
Available ranges:
N=2531  k from 1500e12 N=3250  k from 100e12 N=5170  k from 40e12 N=71100  k from 20e12 N=101144  k from 10e12 N=145178  k from 4e12 N=179208  k from 2.199e12 N=209223  _done_ to 252 bits Reservations:  Last fiddled with by Batalov on 20160306 at 07:27 
20121012, 03:57  #3 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}×3^{2}×7×37 Posts 
Reservations for GFN5
Available ranges:
N=2532  k from 200e12 N=3335  k from 150e12 N=3648  k from 70e12 N=4967  k from 20e12 N=68176  k from 10e12 N=177  k from 8.69e12 N=178  k from 4.398e12 N=179209  k from 2.199e12 N=210223  _done_ to 252 bits Reservations:  Last fiddled with by Batalov on 20160308 at 05:30 
20121012, 03:57  #4 
P90 years forever!
Aug 2002
Yeehaw, FL
2^{2}·11·167 Posts 

20121012, 03:57  #5 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
246C_{16} Posts 
Reservations for GFN6
Available ranges:
N=2529  k from 2000e12 N=3049  k from 1200e12 N=5069  k from 300e12 N=7090  k from 200e12 N=91100  k from 100e12 N=101143  k from 35e12 N=144160  k from 20e12 N=161177  k from 6e12 N=178  k from 4.398e12 N=179210  k from 2.199e12 N=211223  _done_ to 252 bits Reservations:  Last fiddled with by Batalov on 20150206 at 18:12 
20121012, 03:57  #6 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}·3^{2}·7·37 Posts 
Reservations for GFN7
Available ranges:
N=25  k from 10e12 N=2629  k from 80e12 N=3034  k from 50e12 N=3539  k from 38e12 N=4046  k from 28e12 N=4750  k from 17.59e12 N=51100  k from 3e12 N=101200  k from 2e12 N=201211  k from 1e12 N=212223  _done_ to 252 bits Reservations: N=2650  k from 2e12 to 17.59e12 Batalov N=51100  k from 2e12 to 3e12 Batalov N=101200  k from 1e11 to 2e12 Batalov Last fiddled with by Batalov on 20161107 at 23:23 
20121012, 03:58  #7 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}·3^{2}·7·37 Posts 
Reservations for GFN10
Available ranges:
N=2531  k from 200e12 N=3239  k from 300e12 N=4049  k from 100e12 N=5099  k from 35e12 N=100144  k from 10e12 N=145209  k from 6e12 N=210223  _done_ to 252 bits Reservations: N=3239  k from 200e12 to 300e12 S.B. Last fiddled with by Batalov on 20160301 at 10:24 
20121012, 03:58  #8 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}×3^{2}×7×37 Posts 
Reservations for GFN11
Available ranges:
N=2550  k from 2e12 N=51100  k from 1e12 N=101200  k from 3e11 N=201211  k from 1e12 N=212223  _done_ to 252 bits Reservations:  Last fiddled with by Batalov on 20161105 at 16:38 
20121012, 03:59  #9 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{2}·3^{2}·7·37 Posts 
Reservations for GFN12
Available ranges:
N=25  k from 100e12 N=2629  k from 200e12 N=3032  k from 150e12 N=3339  k from 100e12 N=4052  k from 50e12 N=5363  k from 30e12 N=6479  k from 20e12 N=80100  k from 10e12 N=101  k from 200e12 N=102110  k from 281.474e12 N=111141  k from 140.737e12 N=142  k from 70.368e12 N=143  k from 35.184e12 N=144  k from 17.592e12 N=145  k from 8.796e12 N=146177  k from 6e12 N=178200  k from 1.099e12 N=201  k from 2e12 N=202209  k from 1.099e12 N=210223  _done_ to 252 bits Reservations:  Last fiddled with by Batalov on 20140627 at 01:09 
20121012, 04:19  #10 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
22154_{8} Posts 
The speed of mmffgfn is similar to mmff, but roughly a chunk 4e1210e12 for some N~=70 is probably ~ 1 hour on GTX570, and a chunk 2e1210e12 for some N~=120 is maybe a few hours. So you may want to take them by N ranges of multiples of 10 easily.
It would be nice to take everything initially to k<=10e12. Remember, the success probability* is ~ 1/kN * O(some pesky logs), so you may probably want the low k's. ____ *per unit of time! ... or even ~ 1/kN^{2} Last fiddled with by Batalov on 20121016 at 06:08 Reason: (footnote) 
20121012, 04:55  #11 
Romulan Interpreter
Jun 2011
Thailand
2431_{16} Posts 
Waiting for a win64 binary and then I may invest some time (like a week or so) and few gtx580 into one or more of those ranges. As you might already noticed, I like to try a bit of everything and this should be my opportunity to tickle the GFN domain. Unfortunately, no time to play with building win64 executables now (I succeeded to compile CL in the past, but never played with mfaktc, though the process would be somehow straight forward).

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
GFN factoring with mmffgfn  Results  Batalov  Operazione Doppi Mersennes  126  20161112 12:22 
mmff checkpoints  houding  Factoring  1  20150902 19:32 
mmff parameters  MattcAnderson  Operazione Doppi Mersennes  2  20150708 15:28 
Output bug in mmff  ATH  Operazione Doppi Mersennes  8  20120918 15:57 
P minus 1 factoring  information and reservations  philmoore  Five or Bust  The Dual Sierpinski Problem  1  20100407 22:25 