20210929, 04:58  #12 
"Curtis"
Feb 2005
Riverside, CA
5632_{10} Posts 
One more thing, since I didn't mention it in my "3 steps":
For numbers smaller than 5055 digits, steps 12 alone are enough; ECM will crack the number as fast or faster than a sieve method, and the time spent is less than a second anyway. For 55ish95ish digits, the quadratic sieve is faster than GNFS one would run the QS via Yafu (or msieve, if you didn't acquire yafu) after running some ECM. For numbers 95+ digits, the 3 steps I wrote and you quoted are appropriate. The factoring forum posts and advice generally assume 100+ digit numbers as inputs, else one shouldn't be trying GNFS. For 9299 digits, which software is faster depends on your specific machine, the parameters passed to CADO, and the version of yafu. It doesn't matter a whole lot, unless you're doing a bunch of jobs of that size then you might care that one package is 10% faster than another, and you might compare software to find out. 
20211002, 03:18  #13  
"Felix"
Sep 2021
Indonesia
7 Posts 
It's a following question
Quote:
I already installing yafu 2 and I already try it, it work like i expected... but when I try to factor 15 I get this result: Code:
Applying tune_info entry for LINUX64  Intel(R) Core(TM) i78750H CPU @ 2.20GHz YAFU Version 2.07 Built with GCC 11 Using GMPECM 7.0.5dev, Powered by GMP 6.2.1 Detected Intel(R) Core(TM) i78750H CPU @ 2.20GHz Detected L1 = 32768 bytes, L2 = 9437184 bytes, CL = 64 bytes Using 1 random witness for RabinMiller PRP checks Cached 664579 primes; max prime is 9999991 =============================================================== ======= Welcome to YAFU (Yet Another Factoring Utility) ======= ======= bbuhrow@gmail.com ======= ======= Type help at any time, or quit to quit ======= =============================================================== >> factor(15) fac: factoring 15 fac: using pretesting plan: normal fac: using specified qs/gnfs crossover of 100 digits fac: using specified qs/snfs crossover of 75 digits input from file = 1802716097522165018257858828415111497060066282677325501816640492782221110851604465066510547671104729 input to yafu = 15 div: primes less than 10000 div: found prime factor = 3 div: found prime factor = 5 Total factoring time = 0.0528 seconds ***factors found*** P1 = 3 P1 = 5 ans = 1 

20211002, 03:24  #14  
Jun 2003
2^{2}×3^{2}×151 Posts 
Quote:
Code:
div: primes less than 10000 div: found prime factor = 3 div: found prime factor = 5 For a larger number, it would've performed additional steps like Pollard's rho, P1, ECM, and eventually would've finished it off by either SIQS or NFS (depending on the size of the composite and the qs/nfs crossover points). 

20211002, 03:49  #15  
"Curtis"
Feb 2005
Riverside, CA
2^{9}×11 Posts 
Quote:
If you'd like to see an NFS job, I can send you a number of 110 digits or so that I'd like factors for. It'll take you an hour or less on an older desktop or modern laptop. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Parameter explorations for CADO 165170 digits  VBCurtis  CADONFS  98  20230111 13:19 
Some CADONFS Work At Around 175180 Decimal Digits  EdH  CADONFS  127  20201007 01:47 
How to set the limit of digits of qs in yafu ...  rockzur  Factoring  1  20190824 15:40 
How I Run a Larger Factorization Via CADONFS on Several Ubuntu Machines  EdH  EdH  0  20180225 18:00 
CADO workshop on integer factorization  akruppa  Factoring  14  20080918 23:52 