mersenneforum.org GFN factoring with mmff-gfn | Reservations
 Register FAQ Search Today's Posts Mark Forums Read

2012-10-12, 04:58   #12
Dubslow

"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

11100001101012 Posts

Quote:
 Originally Posted by LaurV 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).
They aren't substantially different. mfaktc just has a few more C files (non CUDA).

 2012-10-12, 05:06 #13 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 9,257 Posts I've PMd Jerry 'Flash' H. He built excellent mmff binaries for both 32 and 64 flavors. We'll need a mmff folder like mfaktc, I'll PM Xyzzy.
2012-10-12, 10:09   #14
ET_
Banned

"Luigi"
Aug 2002
Team Italia

112668 Posts

Quote:
 Originally Posted by Batalov I've PMd Jerry 'Flash' H. He built excellent mmff binaries for both 32 and 64 flavors. We'll need a mmff folder like mfaktc, I'll PM Xyzzy.
What about reservation on Keller's GFN tables? I think we should communicate the range on which we worked as well...

Luigi

 2012-10-12, 10:21 #15 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 100100001010012 Posts No, WK only takes reservations for the whole ensemble cast (as in a sieve followed by pfgw -gxo), not GFN separately.
2012-10-12, 12:40   #16
flashjh

"Jerry"
Nov 2011
Vancouver, WA

1,123 Posts

Quote:
 Originally Posted by Batalov I've PMd Jerry 'Flash' H. He built excellent mmff binaries for both 32 and 64 flavors. We'll need a mmff folder like mfaktc, I'll PM Xyzzy.
See here
_______________________

Ok, everyone, you are all set.

For Windows, get the
mmff-gfnX-0.26-win32-win64.zip and tests_and_cudart.zip files.
Use separate folders for each base. Use sample worktodo.txt files from the tests_and_cudart.zip file.

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 12.1, so they may not work for you). The rest is the same: Use separate folders for each base. Use the tests from tests_and_cudart.zip file.

Good luck!

Last fiddled with by Batalov on 2012-10-13 at 08:29

 2012-10-13, 21:16 #17 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 9,257 Posts The Russian expression 'biting elbows' will be painfully learnt by those who will come late to the party.
 2012-10-14, 08:26 #18 lalera     Jul 2003 11418 Posts hi, i have found a factor and now i need an explanation on how to get the cannonical form using factordb
 2012-10-14, 09:04 #19 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 925710 Posts 1. Put it in factordb -> hopefully it is prime/PRP 2. add -1 to the end of the factordb input line -> observe 2^N (and you may know N from the output logs anyway) 3. Add "(" around the factor "-1)/2^N" (use the value of N) -> you will learn the k value. 4. Run pfgw -gxo -q"k*2^N+1" You can also post the "has" string in the results thread - we will walk you through this. This only seems hard the first time, and then is like riding a bike. Last fiddled with by Batalov on 2012-10-14 at 09:16
 2012-10-23, 01:28 #20 firejuggler     Apr 2010 Over the rainbow 5×503 Posts a factor - not composite - would be really nice.
 2012-10-23, 01:36 #21 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 9,257 Posts There are some left. I am sure of it! Try the probability of success calculator in gp: Code: # gp k1=2e12; k2=10e12; n=102 p = log(k2/k1) / (log(k1*k2)/2 + n*log(2)-1) %1 = 0.01628 # so you'd need ~60 of similar ranges to strike gold # When I started, I'be been luckier: k1=1e11; k2=2e12; n=102 p = log(k2/k1) / (log(k1*k2)/2 + n*log(2)-1) %6 = 0.031035 
2012-10-23, 01:40   #22
flashjh

"Jerry"
Nov 2011
Vancouver, WA

112310 Posts

Quote:
 Originally Posted by firejuggler a factor - not composite - would be really nice.
Agreed.

How does one calculate the bit level of the factors? I get the 'k' value, but I'm not able to come up with the actual bit levels for the factors that would be found.

 Similar Threads Thread Thread Starter Forum Replies Last Post Batalov Operazione Doppi Mersennes 126 2016-11-12 12:22 houding Factoring 1 2015-09-02 19:32 MattcAnderson Operazione Doppi Mersennes 2 2015-07-08 15:28 ATH Operazione Doppi Mersennes 8 2012-09-18 15:57 philmoore Five or Bust - The Dual Sierpinski Problem 1 2010-04-07 22:25

All times are UTC. The time now is 00:00.

Sat Jan 16 00:00:19 UTC 2021 up 43 days, 20:11, 0 users, load averages: 3.40, 2.72, 2.43