mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Operazione Doppi Mersennes

Reply
 
Thread Tools
Old 2012-10-12, 04:58   #12
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3·29·83 Posts
Default

Quote:
Originally Posted by LaurV View Post
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).
Dubslow is offline   Reply With Quote
Old 2012-10-12, 05:06   #13
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·3·1,571 Posts
Default

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.
Batalov is offline   Reply With Quote
Old 2012-10-12, 10:09   #14
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

2·29·83 Posts
Default

Quote:
Originally Posted by Batalov View Post
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
ET_ is online now   Reply With Quote
Old 2012-10-12, 10:21   #15
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

223228 Posts
Default

No, WK only takes reservations for the whole ensemble cast (as in a sieve followed by pfgw -gxo), not GFN separately.
Batalov is offline   Reply With Quote
Old 2012-10-12, 12:40   #16
flashjh
 
flashjh's Avatar
 
"Jerry"
Nov 2011
Vancouver, WA

1,123 Posts
Default

Quote:
Originally Posted by Batalov View Post
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
_______________________

S.B. EDIT: uploading to the mmff-gfn/ folder...
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
flashjh is offline   Reply With Quote
Old 2012-10-13, 21:16   #17
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·3·1,571 Posts
Default

The Russian expression 'biting elbows' will be painfully learnt by those who will come late to the party.
Batalov is offline   Reply With Quote
Old 2012-10-14, 08:26   #18
lalera
 
lalera's Avatar
 
Jul 2003

11428 Posts
Default

hi,
i have found a factor
and now i need an explanation on
how to get the cannonical form using factordb
lalera is offline   Reply With Quote
Old 2012-10-14, 09:04   #19
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·3·1,571 Posts
Default

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
Batalov is offline   Reply With Quote
Old 2012-10-23, 01:28   #20
firejuggler
 
firejuggler's Avatar
 
Apr 2010
Over the rainbow

22·641 Posts
Default

a factor - not composite - would be really nice.
firejuggler is online now   Reply With Quote
Old 2012-10-23, 01:36   #21
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

24D216 Posts
Default

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
Batalov is offline   Reply With Quote
Old 2012-10-23, 01:40   #22
flashjh
 
flashjh's Avatar
 
"Jerry"
Nov 2011
Vancouver, WA

1,123 Posts
Default

Quote:
Originally Posted by firejuggler View Post
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.
flashjh is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
GFN factoring with mmff-gfn | Results Batalov Operazione Doppi Mersennes 126 2016-11-12 12:22
mmff checkpoints houding Factoring 1 2015-09-02 19:32
mmff parameters MattcAnderson Operazione Doppi Mersennes 2 2015-07-08 15:28
Output bug in mmff ATH Operazione Doppi Mersennes 8 2012-09-18 15:57
P minus 1 factoring - information and reservations philmoore Five or Bust - The Dual Sierpinski Problem 1 2010-04-07 22:25

All times are UTC. The time now is 16:41.

Tue May 11 16:41:03 UTC 2021 up 33 days, 11:21, 1 user, load averages: 3.17, 2.78, 2.58

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.