20071104, 14:10  #1 
Jul 2003
Behind BB
3^{3}·73 Posts 
fun with snfs
We have 1 candidate in our dat file with n < 200. If anybody wants to try to factor them, please post here so we don't have duplicate efforts occurring.
Code:
325846*5^1591 done: p54*p63 (michaf) 322498*5^1631 done: p47*p74 (michaf) 177742*5^1651 done: p59*p63 (konrad127123) 146756*5^1721 done: p58*p68 (konrad127123) 313126*5^1831 done: p45*p89 (michaf) 254*5^1861 done: p57*p77 (michaf) 146264*5^1941 done: p56*p85 (michaf) 37714*5^172+1 done: p53*p73 (michaf) 51208*5^176+1 done: p44*p85 (konrad127123) 71098*5^176+1 done: p47*p82 (konrad127123) 24032*5^181+1 reserved (michaf) 81556*5^184+1 done: p47*p74 (michaf) Reservations beyond 200: 53546*5^2001: konrad127123 Last fiddled with by michaf on 20071109 at 09:32 Reason: less numbers left 
20071104, 17:16  #2 
Jan 2005
479 Posts 
doing 37714*5^172+1 at this moment

20071104, 22:05  #3  
Jan 2005
479_{10} Posts 
37714*5^172+1 done:
Quote:


20071105, 06:31  #4 
Jun 2005
3·11 Posts 
I'll have a go at 322498*5^1631.

20071105, 18:51  #5  
Jan 2005
479 Posts 
A nice p54 in there:
Quote:
Last fiddled with by michaf on 20071105 at 18:52 Reason: Reservation added 

20071105, 22:59  #6 
A Sunny Moo
Aug 2007
USA (GMT5)
3×2,083 Posts 
Where would I find a copy of SNFS to possibly try factoring one of these? Or, would the number field sieve (not the quadratic sieve) included with msieve do fine?

20071105, 23:15  #7 
Jan 2005
737_{8} Posts 
The numbers are still fine for msieve.Ggnfs is a way quicker with the sieving.
(With gnfs the flipover is around 100 digits for my computer, never actually tested that with snfs). You can check for ggnfs at http://tech.groups.yahoo.com/group/ggnfs/ msieve is obtainable at http://www.boo.net/~jasonp/qs.html 
20071105, 23:27  #8  
A Sunny Moo
Aug 2007
USA (GMT5)
3×2,083 Posts 
Quote:
Also, how would I go about setting up ggnfs for use with these types of numbers? I've heard it's quite complex and confusing. 

20071106, 10:57  #9  
Jan 2005
479 Posts 
Oh, my apologies,
the files can be gotten from http://sourceforge.net/projects/ggnfs/ It's not very easy to set up, but once you are there, the factlat script has most of the work done for you. Below are the results of my latest snfsnumber, the .poly file needs to contain: n: .... upto Y1: .... Quote:
146264*5^1941 I wanted a degree 5 polynomial for this size numbers: 5*146264*5^1941 = 146264*5^1955 now, 146264 is c5 (c5 because it's a degree 5 polynomial 5 is c0 Y0:  5^(195/5) Y1: 1 (I'm still confused about which one needs to be negative, but ggnfs seems to prefer Y1 positive :>) skew: (c0/c5)^(1/5) On this forum, and on the ggnfs mailinglist a lot of info can be found on how and what, but the best thing to learn from, is from making errors. 

20071106, 12:20  #10  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2·7^{3}·17 Posts 
Quote:
If you can show you've made an honest attempt to correct your errors and are still stuck a number of people here will attempt to help you, even (especially) those who don't suffer fools gladly. Paul 

20071106, 15:47  #11  
A Sunny Moo
Aug 2007
USA (GMT5)
3×2,083 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
SNFS targets which need more ECM  XYYXF  XYYXF Project  57  20170704 19:15 
SNFS(27x) How much ECM before switching to NFS?  YuL  Factoring  24  20150608 01:26 
SNFS polynomials for k*b^n+1  mdettweiler  Factoring  15  20100114 21:13 
SNFS Sample(10^4+1)  nuggetprime  Factoring  1  20070611 16:31 
Completed my first SNFS job  schickel  Factoring  0  20070527 05:42 