20210403, 00:10  #1 
Apr 2021
17 Posts 
Résumé factoring?
If you keep all the log files and the poly (polynomial) file, if you exit out and start it back up again will it resume where it left off? Using the GGNFS/Msieve windows implementation.

20210403, 02:35  #2 
"Curtis"
Feb 2005
Riverside, CA
2^{8}×19 Posts 
It depends. ggnfs/msieve are usually called by some other program which one are you using?
If it's the python script factmsieve, and you're still in the sieving phase, it'll pick back up at the start of the Qrange you were doing when it left off (so, if you have 10,000 blocks, it'll rewind no more than 10,000). If you're in the matrix phase, I think it restarts the matrix unless you invoke msieve manually with ncr instead of nc2 (ncr = resume matrix solving, rather than restart it). 
20210403, 04:02  #3 
Apr 2021
17 Posts 
Thank you! Yes factmsieve.py. Most of that went over my head as a beginner, so the answer is you don't loose all of your progress which is good. For a 140 digit number would you loose less than say 25% of your progress would you say? Assuming you are in sieving as that is the longest step afaik.
So I would do python factmsieve0.86.py RSA140.n ncr to resume from the log files? And does matrix refer to polynomial selection? That said, a "pause" feature would be awesome because sometimes you need to use a processor intensive application without waiting days for the factoring to finish ;). Last fiddled with by Unitome on 20210403 at 04:09 
20210403, 05:39  #4 
"Curtis"
Feb 2005
Riverside, CA
2^{8}×19 Posts 
You should do some small jobs, like C100110, to see how everything works before doing C140+. The matrix is the last long step.
Don't use ncr to resume your job just use the same command you used originally. factmsieve figures out it's partway done with the job, and picks up with the same GGNFS command it left off with. You know how every so often the GGNFS sievers finish their work and there's some steps that show a number of relations gathered and maybe a percent done? You only lose the most recent partlycompleted one of those steps. Small jobs might only have 35 rounds of those GGNFS siever steps, but a C140 likely has a bunch so you're barely losing any work in the big picture maybe 30 min on a 1day job? 
20210404, 15:03  #5 
Apr 2021
21_{8} Posts 
Wow that's awesome! Yes, I started at RSA100, 110, 120, 130, have just completed RSA140. That took my PC about 40 hours so now am thinking how to progress from here lol, I think perhaps generating some random 140 digit numbers and benchmarking those against the 40hr RSA. With 2.5gb of log files for RSA 140, that's no joke!
Last fiddled with by Unitome on 20210404 at 15:04 
20210404, 16:20  #6 
"Curtis"
Feb 2005
Riverside, CA
2^{8}·19 Posts 
If you're asking for numbers to factor, I can keep you fed with C135150 sized numbers from aliquotsequence project for some amount of time (maybe a dozen numbers before I point you at the project itself and show you where to get them/ what to do other than factor one).
PM me if interested. 
20210404, 20:31  #7 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2510_{16} Posts 
You might be saving some needless logs. E.g. stdout is totally expendable, you can simply run factmsieve.py ${myc140} &> /dev/null &
If you are saving stdout into a file, that is nearly definitely a waste. On the other hand, the issue is that data files are large  this data is indeed essential for factorization (all files with *.dat* in the name); don't delete them until your project is completed. These are not 'log files'; that is a (so to say) witness data that when it will have passed the watershed limit  will solve the factorization problem. You can use the compressed data option  this will use approximately half the disk space, and nearly the same speed. 
20210405, 00:27  #8 
Apr 2021
17 Posts 
Thanks very much for that, good to know what is expendable and not, and it is the dat files that are the biggest.
Running into another problem, when I make up a number to try I get the error: Error: evaluated polynomial value polyval is not a multiple of n! Do we have to use special numbers to work in this program or is there some setting I am missing, again RSA numbers have worked fine but numbers I come up with invariably don't work... 
20210405, 00:42  #9 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{4}×593 Posts 
Error: evaluated polynomial value polyval is not a multiple of n!
This message means that the polynomial file is inconsistent. (e.g. n: data row contradicts the c*: rows... or other data is contradictory.) You have to start each project in separate 'namespace'. meaning: you can still use the same folder but you cannot use the same project "root"name. Best practice is to use separate folders. Start from a new empty folder, and start from a fresh input number. From an input number a polynomial is built first, the sieving happens, then matrix is built, then linear algebra problem is solved. You probably have data lingering from the previous project. Any number can be factored given appropriate time. 
20210405, 07:03  #10  
Apr 2021
11_{16} Posts 
Quote:
Also I am now working on a 134 digit number by VBCurtis and it makes it through polynomial selection just fine. What is it about made up numbers that don't seem to work out? Last fiddled with by Unitome on 20210405 at 07:30 

20210405, 08:44  #11 
Romulan Interpreter
Jun 2011
Thailand
23·419 Posts 
If you took the RSA number and changed a 1 into a 2, you have a 50% chance you got a number divisible by 3, plus a ~16% chance your number is divisible by 7, etc, so a quite high chance your new number has very small prime factors. You will need to run a lot of other stuff (TF, P1, ECM) on it to make it "NFSready", before attempting to find any (enough) independent relations... Try yafu on your new number and see what factors will it come with.
Last fiddled with by LaurV on 20210405 at 08:46 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
factoring 2ⁿ2 equivalent to factoring 2ⁿ1(I think)  baih  Miscellaneous Math  9  20200921 07:11 
OpenCL GPU P1 Factoring and ECM Factoring  xx005fs  GPU Computing  3  20181027 14:49 