20100527, 22:56  #1 
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
Some help needed with GGNFS syntax.
Syntax = <number file : polynomial file : msieve polynomial file>
I already have the number file, I just need the other two files. Any suggestions? (That do not include ad hominems?) 
20100527, 23:01  #2 
(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 125digit number, eighty hours for 135 digits, 300 hours for larger) it will give you a polynomial.

20100527, 23:08  #3 
May 2010
Prime hunting commission.
2^{4}·3·5·7 Posts 
worktodo.ini is a text file, correct? yes
Last fiddled with by fivemack on 20100527 at 23:26 
20100527, 23:09  #4 
Jun 2003
2^{2}·3^{2}·151 Posts 
you only need the .n file. just running factmsieve.pl/py should do the rest.

20100527, 23:15  #5 
May 2010
Prime hunting commission.
11010010000_{2} Posts 
"you only need the .n file. just running factmsieve.pl/py should do the rest."
Don't you mean, polyselect? 
20100527, 23:26  #6 
(loop (#_fork))
Feb 2006
Cambridge, England
6454_{10} Posts 
No, factmsieve.pl/.py runs all the other tools for you in the right order.

20100527, 23:47  #7 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10267_{8} 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 Code:
n: 5393165364156033842058422235206821326759903094697482605822376776383843195054519804159 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 20100527 at 23:53 
20100527, 23:48  #8 
May 2010
Prime hunting commission.
690_{16} Posts 
The number I'm attempting to factor is actually just a meager 100 digits or so.
Syntax = <example.n : polynomial file : worktodo.ini> [1] ? Last fiddled with by 3.14159 on 20100527 at 23:54 
20100527, 23:56  #9  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
1000010110111_{2} Posts 
Quote:
Have you read http://gilchrist.ca/jeff/factoring/n...ers_guide.html ? 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 20100527 at 23:58 

20100528, 00:00  #10 
May 2010
Prime hunting commission.
2^{4}·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 20100528 at 00:08 
20100528, 00:02  #11 
May 2010
Prime hunting commission.
2^{4}×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 20100528 at 00:07 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Manual Testing LL result syntax (where to find documentation)  preda  GPU Computing  15  20170417 15:02 
C++ template function syntax issues  ewmayer  Programming  4  20130413 17:45 
GGNFS & 512 BIT i can puke.  silentfrog  Factoring  1  20090910 08:57 
GGNFS or something better?  ZetaFlux  Factoring  1  20070807 22:40 
ggnfs  ATH  Factoring  3  20060812 22:50 