![]() Sun Mar 13 10:40:24 2016 commencing number field sieve (82-digit input) Sun Mar 13 10:40:21 2016 searching for 15-digit factors Hopefully this helps anyone trying to get this to work on their system, using cuda to prep your polynomial def seems to help speed things up. Smaller 70-90 digit factorizations can be done rather quickly just on regular msieve I've run a couple of 118, 119, 123 digit factorization and the second phase takes a good day or two (I have an i7 950). In a dos prompt go to the gnfs diretory and run " example.poly" and hopefully you'll eventually get your factor. You can check this link for reference on converting it from msieve to gnfs: Overwrite these values from the fb file you created in the cuda msieve directory earlier the format uses variables that are different in msieve. Create a file name "example.poly" in this format: Edit in a text editor and modify "$GGNFS_BIN_PATH" to wherever you've got this directory on your computer You'll also need to install a perl program (I used ActivePerl 5.16.3) ![]() Download gnfs into it's own directory, then download msieve 1.51(1.52 isn't stable for me here) and copy/overwrite it's files in the gnfs directory. Make your p (dat) and consequently your fb file when the job terminates with "msieve -npr" ![]() Run this as long as necessary or till completion. Make your ms (dat) file by running "msieve -np1 -nps" (-t 2,4 or 8 may speed up the graphics card threading). Go to that msieve directory in a dos prompt Download the latest cuda msieve 1.52 in it's own directory Here are my cliff notes version of how I got it to work for anyone setting it up for the first time in windows if it'll help anyone wanting to use their nvidia card. So I went thru a lot of trial, error, pain, reading and hours of lost sieving work in order to get msieve cuda and gnfs to work in a stable way on my system. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |