Register FAQ Search Today's Posts Mark Forums Read

2014-02-05, 21:42   #12
RichD

Sep 2008
Kansas

3,449 Posts

Quote:
 Originally Posted by RichD In the coming weeks/months I will continue working on all the numbers below C200 in the list of most difficult numbers.
Wow, a lot more in the C190s. All the other "ten" ranges only had 4 or 5 composites. This range still has 21 remaining. I've generated all the SNFS polynomials. Most are Sigma(n^46) which is most suitable for degree-6.

PM me if you would like one or more to work on and I will send you the poly file. Each will take 5-6 days on a dedicated Core-i5. Just start factMsieve with the poly file and let it run. Let me know if anyone is interested, or you can pick one from the file itself. Just let me know which you choose so we don't duplicate work.

They range from SNFS-192 to SNFS-204 difficulty.

 2014-02-11, 16:35 #13 chris2be8     Sep 2009 88316 Posts Will the "most difficult" composites need ECM running against them before SNFS? I can do it either way, but needs to be allowed for. Chris
2014-02-11, 16:52   #14
RichD

Sep 2008
Kansas

3,449 Posts

Quote:
 Originally Posted by chris2be8 Will the "most difficult" composites need ECM running against them before SNFS? I can do it either way, but needs to be allowed for
In my last correspondence with Pascal, he said a decent number of curves have been run but he doesn't keep track. So far, I haven't had an "ECM miss".

I will stop before getting to a C200. Though a C198 may be an SNFS-204 difficulty.

 2014-02-12, 01:10 #15 ThomRuley     May 2003 23×31 Posts Could I talk you into making a few polys from the t500 file? Mine are taking forever, but the actual NFS seems to be moving reasonably.
 2014-02-12, 02:31 #16 wombatman I moo ablest echo power!     May 2013 23×223 Posts Thom, which ones from the t500 file are you looking at? I've cleared a few from there (and am working my way down the list).
 2014-02-12, 14:51 #17 ThomRuley     May 2003 23·31 Posts I'll take these for now: 6115909044841454629 12 321381569252585866953628783126948367071187906389518216907098417372109834635071531 2 9235379541700294893241592533312191410548921 4 18855337777262169791 10 42223362249943191270479011547514088211349705097809873373648793992949125900561049993 2 33579221106357041 12 Let me know if anyone else is already working on these. Thanks Thom
 2014-02-12, 16:15 #18 wombatman I moo ablest echo power!     May 2013 23·223 Posts I'll have to double check when I get home, but I believe I'm currently on: 53041017196666952234619819994982127672443220243418249007541741030212106804476059 2 No idea if anybody else is working on the file, but I'll take those off my batch list if you want them. Roughly how long will each of them take, do you think?
2014-02-12, 20:22   #19
ThomRuley

May 2003

23×31 Posts

Quote:
 Originally Posted by wombatman I'll have to double check when I get home, but I believe I'm currently on: 53041017196666952234619819994982127672443220243418249007541741030212106804476059 2 No idea if anybody else is working on the file, but I'll take those off my batch list if you want them. Roughly how long will each of them take, do you think?
No problem, I'll just take that one off my list. This is why we need to communicate with each other about composites. Thanks

 2014-02-13, 03:24 #20 wombatman I moo ablest echo power!     May 2013 110111110002 Posts Well, I'm getting forgetful already, but I'm actually working on: 20241187^29-1 C151 It should be finished by Friday evening.
 2014-02-13, 04:25 #21 RichD     Sep 2008 Kansas 3,449 Posts I can't seem to locate the wiki page on degree halving but I will post two polys from the t500.txt file if anyone is interested. Code: 82932783659784864101 10 n: 14668426862825327643478642613752190334921815625710231530196536758731353111989670069823132151031683951702388087602570541194382925113356037064684273416829280380908509371047337 # 82932783659784864101^11-1, difficulty: 199.19, skewness: 1.00, alpha: 2.22 # cost: 1.3144e+17, est. time: 62.59 GHz days (not accurate yet!) skew: 1.000 c5: 1 c4: 1 c3: -4 c2: -3 c1: 3 c0: 1 Y1: -82932783659784864101 Y0: 6877846605560679357661513062775038538202 m: 6638302919148143756548444023751343110512646774028322539454017523519024748726117291987933565320356252394470990730374728987385239556102040293564160261777386744194135007509561 type: snfs 1949751789915161 12 n: 178582760001354166553578106439433291393431180054089262671541219332034706214132826774027843833802708445291048587466523534490409654996494041174800154595618546224102815160715367622393 # 1949751789915161^13-1, difficulty: 183.48, skewness: 1.00, alpha: 3.10 # cost: 3.21513e+16, est. time: 15.31 GHz days (not accurate yet!) skew: 1.000 c6: 1 c5: 1 c4: -5 c3: -4 c2: 6 c1: 3 c0: -1 Y1: -1949751789915161 Y0: 3801532042277374115783577655922 m: 178582759999806160677961385995543625559262607541818145383600310736688148336500964108316190094531539174959912589299553133029586112864519785072165516315129152499838566672770974464982 type: snfs
 2014-02-13, 04:31 #22 wombatman I moo ablest echo power!     May 2013 23×223 Posts I'll tackle that second one (1949751789915161^13-1). How did you generate those SNFS polys? Edit: I must be doing something wrong. When I use that generated poly, I get really huge sec/rel times (like 2 to 5 sec/rel). What am I forgetting? This is with the 64-bit GGNFS sievers. Last fiddled with by wombatman on 2014-02-13 at 05:01

 Similar Threads Thread Thread Starter Forum Replies Last Post Xyzzy GPU Computing 1 2017-05-17 20:22 Mark Rose GPU Computing 52 2016-07-02 12:11 firejuggler GPU Computing 12 2016-02-23 06:55 Elhueno Homework Help 5 2008-06-12 16:37 jchein1 Factoring 30 2005-05-30 14:43

All times are UTC. The time now is 22:49.

Mon Oct 25 22:49:31 UTC 2021 up 94 days, 17:18, 0 users, load averages: 1.57, 1.88, 2.12