20120330, 21:44  #1 
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3×29×83 Posts 
Bug/request
The bug is slightly bigger, so that's why it's a new thread.
I took the example factor() given in README and ran it: Code:
bill@Gravemind:~∰∂ yafu "factor(2056802480868100646375721251575555494408897387375737955882170045672576386016591560879707933101909539325829251496440620798637813)" factoring 2056802480868100646375721251575555494408897387375737955882170045672576386016591560879707933101909539325829251496440620798637813 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations pp1: starting B1 = 20K, B2 = gmpecm default on C127 pm1: starting B1 = 100K, B2 = gmpecm default on C110 ecm: 30/30 curves on C87 input, at B1 = 2K, B2 = gmpecm default ecm: 25/74 curves on C87 input, at B1 = 11K, B2 = gmpecm default ecm: 48/48 curves on C70 input, at B1 = 11K, B2 = gmpecm default ecm: 56/56 curves on C70 input, at B1 = 50K, B2 = gmpecm default starting SIQS on c70: 3950565477929583959090443657115834369563721138106225828250209513731263 ==== sieving in progress (1 thread): 12208 relations needed ==== ==== Press ctrlc to abort and save state ==== 10154 rels found: 5187 full + 4967 from 52996 partial, (1628.79 rels/sec) freed 2 duplicate relations SIQS elapsed time = 42.1203 seconds. Composite result found, starting refactorization factoring 168120549877635053 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations pp1: starting B1 = 20K, B2 = gmpecm default on C18 pp1: starting B1 = 20K, B2 = gmpecm default on C18 pp1: starting B1 = 20K, B2 = gmpecm default on C18 pm1: starting B1 = 100K, B2 = gmpecm default on C18 ecm: 0/30 curves on C18 input, at B1 = 2K, B2 = gmpecm default Total factoring time = 0.0316 seconds Composite result found, starting refactorization factoring 12479125541750268690323 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations pp1: starting B1 = 20K, B2 = gmpecm default on C23 Total factoring time = 0.0079 seconds Total factoring time = 52.5949 seconds ***factors found*** C18 = 248158049830971629 C35 = 33637310674071348724927955857253537 PRP36 = 117445937227520353139789517076610399 PRP6 = 280673 P12 = 598990818061 PRP10 = 2756163353 PRP13 = 4527716228491 ans = 1 bill@Gravemind:~∰∂ yafu "factor(33637310674071348724927955857253537)" factoring 33637310674071348724927955857253537 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits Total factoring time = 0.0003 seconds ***factors found*** PRP35 = 33637310674071348724927955857253537 ans = 1 bill@Gravemind:~∰∂ yafu "factor(248158049830971629)" factoring 248158049830971629 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations Total factoring time = 0.0013 seconds ***factors found*** PRP18 = 248158049830971629 ans = 1 bill@Gravemind:~∰∂ The bug is that after running factor(), it reports Code:
***factors found*** C18 = 248158049830971629 C35 = 33637310674071348724927955857253537 PRP36 = 117445937227520353139789517076610399 PRP6 = 280673 P12 = 598990818061 PRP10 = 2756163353 PRP13 = 4527716228491 I suppose I do have another scratchmyitch request: Could you print "***factors found***" only when factors are actually found? :P Like above it reports back the input as PRP, but says "FF", and I've had numbers where no factors were found but it instead reports back "Cxxx: [input]" but still says "FF". Sorry for the nitpicky :P:P Edit: This is unrelated to the above, but does anyone know where I can find ggnfs binaries for Linux64? (I suppose source would do, but the less compilation the better.) Edit2: What's the difference between logfile and session? Edit3: Another false composite example. Code:
factoring 133963581130084328933017969077928801246591825821260567693998983142892944737899 using pretesting plan: normal no tune info: using qs/gnfs crossover of 110 digits div: primes less than 10000 fmt: 1000000 iterations rho: x^2 + 3, starting 1000 iterations on C78 rho: x^2 + 2, starting 1000 iterations on C78 rho: x^2 + 1, starting 1000 iterations on C78 pp1: starting B1 = 20K, B2 = gmpecm default on C78 pm1: starting B1 = 100K, B2 = gmpecm default on C51 ecm: 2/30 curves on C51 input, at B1 = 2K, B2 = gmpecm default Composite result found, starting refactorization factoring 176524787773813758992951101 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations pp1: starting B1 = 20K, B2 = gmpecm default on C27 Total factoring time = 0.0275 seconds Total factoring time = 0.1206 seconds ***factors found*** C19 = 2586861932602953721 PRP33 = 293364663397800099317721604912319 PRP16 = 3684180889792499 PRP11 = 47914256399 ans = 1 Code:
factoring 2586861932602953721 using pretesting plan: normal no tune info: using qs/gnfs crossover of 95 digits div: primes less than 10000 fmt: 1000000 iterations Total factoring time = 0.0011 seconds ***factors found*** PRP19 = 2586861932602953721 ans = 1 Last fiddled with by Dubslow on 20120330 at 22:03 
20120331, 02:27  #3  
Sep 2008
Kansas
2^{5}·7·17 Posts 
Quote:
There are many micropatches and work arounds the average newbie will get frustrated. (Including me.) All the other packages can be easily compiled using the MAKE file. (e.g. GMP, MPIR, ECM, msieve, yafu, etc.) Jeff's site may also be helpful. 

20120331, 03:02  #4 
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3×29×83 Posts 
Well, I was only intending to use it through YAFU, so I won't need to bother with the rest, right...? As in, YAFU takes care of what the NFS.pl script is for?
Thank you of course for the link, it seems to be almost impossible to acquire. Last fiddled with by Dubslow on 20120331 at 03:02 
20120331, 03:07  #5 
"Ben"
Feb 2007
7226_{8} Posts 
Yep, once you have the binaries and have added a "ggnfs_dir=" line to your yafu.ini file, yafu will do all of the NFS steps automatically, just like the factMsieve.pl/py scripts. In fact, it may be better  I'm not sure if those scripts use multithreaded poly selection while yafu will (if you use threads N).

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Request  pinhodecarlos  Lounge  3  20171026 18:58 
Odd request?  Xyzzy  Lounge  23  20110308 17:50 
GMPECM Request  rogue  GMPECM  4  20091123 15:07 
A little request  10metreh  Aliquot Sequences  8  20091007 18:13 
Request: P1 79M  PageFault  Marin's Mersennearies  11  20031130 02:47 