mersenneforum.org Some help needed with GGNFS syntax.
 Register FAQ Search Today's Posts Mark Forums Read

 2010-05-27, 22:56 #1 3.14159     May 2010 Prime hunting commission. 24·3·5·7 Posts Some help needed with GGNFS syntax. Syntax = I already have the number file, I just need the other two files. Any suggestions? (That do not include ad hominems?)
 2010-05-27, 23:01 #2 fivemack (loop (#_fork))     Feb 2006 Cambridge, England 2×7×461 Posts To get the msieve polynomial, put the number you want in a file called worktodo.ini and run "msieve -v -np"; after a little while (eight hours for a 125-digit number, eighty hours for 135 digits, 300 hours for larger) it will give you a polynomial.
 2010-05-27, 23:08 #3 3.14159     May 2010 Prime hunting commission. 24·3·5·7 Posts worktodo.ini is a text file, correct? yes Last fiddled with by fivemack on 2010-05-27 at 23:26
 2010-05-27, 23:09 #4 axn     Jun 2003 124748 Posts you only need the .n file. just running factmsieve.pl/py should do the rest.
 2010-05-27, 23:15 #5 3.14159     May 2010 Prime hunting commission. 24×3×5×7 Posts "you only need the .n file. just running factmsieve.pl/py should do the rest." Don't you mean, polyselect?
 2010-05-27, 23:26 #6 fivemack (loop (#_fork))     Feb 2006 Cambridge, England 11001001101102 Posts No, factmsieve.pl/.py runs all the other tools for you in the right order.
 2010-05-27, 23:47 #7 TimSorbet Account Deleted     "Tim Sorbera" Aug 2006 San Antonio, TX USA 11×389 Posts Msieve is the best GNFS polynomial finder, the GGNFS tools are the best for sieving, and Msieve is the best for filtering, LA, and square root. (at least for numbers of the sort of size you're likely to be trying to run, and assuming a common CPU architecture) If this is a GNFS factorization (as opposed to SNFS), then you don't need to generate the polynomial separately. Just put the n in the right file and run factmsieve.py (I'm not sure if the .pl version will run msieve instead of the slower polyselect). By "right file", I mean that it works like this: You run "python factmsieve.py example" (or replace "example" throughout this post with the name you want all this to run as) with a file "example.n" in the current folder with the file contents being: Code: n: TheDecimalDigitsOfYourNumber e.g. Code: n: 5393165364156033842058422235206821326759903094697482605822376776383843195054519804159 And to be safe, include a blank line after that one. Assuming it's set up right, factmsieve.py will then read the n, use msieve to find a GNFS poly for it, then continue with the NFS (sieving and then finishing). Alternately, you can put the n in worktodo.ini (I think just the n on a single line, with no "n: " or similar before it), use msieve to generate a poly as mentioned previously, then save it as "example.fb" and run "python factmsieve.py example" like above. Last fiddled with by TimSorbet on 2010-05-27 at 23:53
 2010-05-27, 23:48 #8 3.14159     May 2010 Prime hunting commission. 69016 Posts The number I'm attempting to factor is actually just a meager 100 digits or so. Syntax = [1] ? Last fiddled with by 3.14159 on 2010-05-27 at 23:54
2010-05-27, 23:56   #9
TimSorbet
Account Deleted

"Tim Sorbera"
Aug 2006
San Antonio, TX USA

11·389 Posts

Quote:
 Originally Posted by 3.14159 The number I'm attempting to factor is actually just a meager 100 digits or so.
Ok, so use factmsieve.py. GNFS is right for numbers that are about 100 digits. I recommend using a .n file.

One way to make this all much easier, assuming you can get it set up without too much trouble, is to run it through aliqueit. With aliqueit set up to be able to run GNFS using factmsieve.py, run "aliqueit -e -q [your number, without these brackets]" (optionally with a -p at the start to say you want it to run at a low priority. Aliqueit will then see that it's large enough to do GNFS and make factmsieve.py start doing that.

Last fiddled with by TimSorbet on 2010-05-27 at 23:58

 2010-05-28, 00:00 #10 3.14159     May 2010 Prime hunting commission. 24·3·5·7 Posts "Ok, so use factmsieve.py. GNFS is right for numbers that are about 100 digits. I recommend using a .n file. Have you read http://gilchrist.ca/jeff/factoring/n...ers_guide.html ?" Yeah, that's how I got the app running in the first place :P Last fiddled with by 3.14159 on 2010-05-28 at 00:08
 2010-05-28, 00:02 #11 3.14159     May 2010 Prime hunting commission. 24×3×5×7 Posts I just need to get past the damn syntax, and misc setup to begin factoring anything The number I want to begin factoring is 4612788901088241110489338309885610592729008898152693541020459649741762187222672923167872911223544489 (100 digits) And on that note: Please refrain from posting the prime factors of the above. -.- Last fiddled with by 3.14159 on 2010-05-28 at 00:07

 Similar Threads Thread Thread Starter Forum Replies Last Post preda GPU Computing 15 2017-04-17 15:02 ewmayer Programming 4 2013-04-13 17:45 silentfrog Factoring 1 2009-09-10 08:57 Zeta-Flux Factoring 1 2007-08-07 22:40 ATH Factoring 3 2006-08-12 22:50

All times are UTC. The time now is 20:19.

Tue Jan 31 20:19:41 UTC 2023 up 166 days, 17:48, 0 users, load averages: 1.49, 1.08, 1.02