20220119, 17:03  #12 
"Curtis"
Feb 2005
Riverside, CA
5276_{10} Posts 
If you can run linux, use cadonfs. Everything is automated, you simply invoke "cadonfs.py {input number}" and wait / watch. The job will run faster if you first fetch the updated parameters files from the Cadonfs forum here. I recommend 16GB ram if you use CADO for your desired factorization; 8GB might work, but might not be enough.
If all you have is windows, YAFU is the way to go it controls msieve and ggnfs to manage the entire job too. Whatever you use, run a small job like 100110 digits first, to learn what is supposed to happen. It'll take maybe an hour, depending on how fast your machine is. Time to factor doubles every 55.5 digits, so a C154 will take about 4x as long as a C143; around 70 times longer than a C120. I'd run a second job in the 120130 digit range before I tried C150+. 
20220119, 17:36  #13 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
13540_{8} Posts 
If you have windows it is possible to get CADO working on WSL2 although this requires fixing a few broken links.

20220119, 17:55  #14 
"Daniel Jackson"
May 2011
14285714285714285714
1275_{8} Posts 
Once you factor the number, could you please publish the factors? I'm curious as to which number it is.

20220119, 18:21  #15  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2×5×1,129 Posts 
Quote:
Good luck! 

20220119, 18:39  #16 
"Vincent"
Apr 2010
Over the rainbow
2·3·11·43 Posts 
And are you sure it is a product of only 2 factors? cause you know.. if it is not it can ( low prob) be factored by ECM.

20220120, 11:51  #17 
Romulan Interpreter
"name field"
Jun 2011
Thailand
26E9_{16} Posts 
To get the feeling of how it goes, and to learn something in the process. And to gain the patience... For example my computer(s), anything between 6 cores and 18 cores, can factor a 100 digits number in minutes, but the time doubles with every 456 digits, depending on the number and on the system. So, a 154 digits can take anything between few days and few weeks.

20220120, 15:12  #18 
Aug 2020
79*6581e4;3*2539e3
503 Posts 
If you use yafu, make sure it will not attempt ECM! As already mentioned it's useless for your number since there will be no small factors. You can do that by invoking yafu factor(12345) noecm threads n where n is the number of threads.

20220120, 17:06  #19 
"Daniel Jackson"
May 2011
14285714285714285714
2BD_{16} Posts 
You can also do "yafu nfs(number) threads n".
Last fiddled with by Stargate38 on 20220120 at 17:06 Reason: forgot period 
20220120, 17:41  #20 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3·19·113 Posts 
The suggestion to practice on smaller numbers first is very good. No sense in wasting weeks on a large number only to discover your configuration is wrong and it fails.
Here are some numbers you can use to practice: https://en.wikipedia.org/wiki/RSA_numbers 
20220121, 16:12  #21 
Jan 2022
19 Posts 
I ran msieve and ggnfs and looked for 100 digit number
My computer (i9) found it in 12 minutes. I have a question: how to run along with the processor and CUDA? I think it will be even faster. Last fiddled with by Lessiv on 20220121 at 16:13 
20220121, 16:40  #22 
"Curtis"
Feb 2005
Riverside, CA
2^{2}×1,319 Posts 
Only the first step (polynomial selection) is cudaenabled.
If you use a version of msieve compiled for CUDA, it will automatically use the GPU for that step. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Breakthrough in Very Large Integer factorization?  jpcu1237  Tales From the Crypt(o)  18  20200716 22:23 
Methods of attacking a large factorization  CRGreathouse  Factoring  55  20140411 15:05 
An equivalent problem for factorization of large numbers  HellGauss  Math  5  20120412 14:01 
Fermat numbers factorization  ET_  Factoring  15  20080312 21:24 
How do I get LARGE numbers  Bundu  Software  5  20040826 01:56 