20220419, 16:19  #89 
"Curtis"
Feb 2005
Riverside, CA
2^{2}×3×7×67 Posts 
Hello!
The params for C195 from the post your quoted are good for the first phase of the job, poly select. This phase is about 5% of the total time of the job. You can start that part immediately, if you wish. I'm in the middle of a midterm week at work, so I might need a day or two to get a complete draft of sieving params for C195 posted here. Before I do: If you have no experience with factoring software, you really should run some smaller jobs to see how the software runs, how much memory it takes (and how memory scales with job size), etc. A C120 and a C140 are good starter sizes. Do you understand how long a C195 will take an individual user? Do you have a 64GBmemory machine to run the filtering & matrix steps, or the time to learn how to use CADO for poly select and sieving but msieve for the filtering & matrix steps (msieve will fit on 32GB for this size of job)? I think the factoring as a service thing was designed for RSA512 sized keys, which take a modern desktop something like 2040 coredays to factor. A C193 is a whole lot tougher than that over 100 times harder. 
20220419, 16:51  #90  
Apr 2020
923_{10} Posts 
Quote:


20220420, 06:16  #91 
Apr 2022
3_{8} Posts 
Thanks @VBCurtis!
Mhh sounds reasonable, I will start by factoring some smaller numbers to check my setup. If we are talking ~3K$ then it is okay with me. The big question is what a realistic time estimate would be? (if we use computing power in the a few thousands dollar) Best regards? 
20220420, 12:03  #92  
Apr 2020
39B_{16} Posts 
Quote:
So you could run ~40 cores for ~100 days, but maybe that's too slow for you. To do 193digit GNFS in a day or two you'll need thousands of cores for the sieving step, and then for linear algebra you'll need either a similarsized MPI cluster  not sure if you can get hold of that via the cloud  or more likely a very powerful GPU; see the Msieve GPU linear algebra thread for details on that. 

20220420, 13:05  #93  
Apr 2022
3 Posts 
Quote:
I will do a test tonight on some smaller numbers and see how my setup preforms. Thanks for the answer! 

20220627, 23:22  #94  
Oct 2019
8_{10} Posts 
Quote:
Last fiddled with by Uncwilly on 20220628 at 03:26 Reason: removed excessive blank lines. 

20220627, 23:26  #95  
Oct 2019
2^{3} Posts 
Quote:
Is this another case of a secret number or can you say the number? Maybe with ECM you can factor faster, or is it an RSA key? 

20220810, 05:58  #96 
Aug 2020
79*6581e4;3*2539e3
2×3×109 Posts 
Have you ever posted a draft for C155? I thought so, but now I can't find it. Thanks.
Last fiddled with by bur on 20220810 at 06:00 
20220810, 19:04  #98 
"Curtis"
Feb 2005
Riverside, CA
2^{2}×3×7×67 Posts 
I return home Saturday, I ought to be able to post a faster one Sunday for C150 and C155.
I was nearly done refining C100C130 params when I left on this trip; C135C155 I still have more data to take to see if my "improvements" are noise or actually faster. I'm trying harder this round to make parameters change steadily from file to file, which makes it easier to extend to 150170 digits sizes with reasonable guesses. 
20220811, 13:42  #99 
Aug 2020
79*6581e4;3*2539e3
654_{10} Posts 
Thanks, that sounds very promising. I did a C153 with stock CADO parameters so I could compare the times.
Btw, has it ever been considered to share these findings with the CADO team or generally publish them? 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Posting log files or other text files  Xyzzy  Forum Feedback  3  20181230 19:37 
Improved NFS polynomial selection  jasonp  Operation Kibibit  5  20140907 11:02 
CADONFS  skan  Information & Answers  1  20131022 07:00 
could oddperfect's ecm progress page be improved?  jasong  GMPECM  11  20070530 03:08 
Factoring progress has really improved!  eepiccolo  Lone Mersenne Hunters  3  20030412 02:04 