20120630, 04:46  #34 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×3×1,657 Posts 
6,447 (snfs difficulty 232) is waiting for a knight in shining armor and a reasonably modern home bread maker or a pressure cooker. I heard that those have ridiculously strong CPUs recently.
Seriously, a good project for a home computer (a month on a quadcore, less on a hexa)! Write to Sam before too late. 
20120630, 05:54  #35 
Sep 2009
2×3×163 Posts 
SNFS 232 would be in the reach of RSALS, if the polynomial is quintic or sextic; but before I reserve this, I'd like to make some test sieving.
What's the best SNFS polynomial for that number ? 
20120630, 06:18  #36 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
23326_{8} Posts 
Like,
Code:
n: 616206951833849099509404360836151448327434546464783674219667801836184526666386100726932863976883607096993792653424911139417437242190871728765383549637572368393220053069548102628443735964624521073 type: snfs skew: 1.82 Y1: 1 Y0: 808281277464764060643139600456536293376 c6: 1 c3: 6 c0: 36 rlim: 55000000 alim: 55000000 lpbr: 30 lpba: 30 mfbr: 60 mfba: 60 rlambda: 2.6 alambda: 2.6 Last fiddled with by Batalov on 20120630 at 06:42 
20120630, 08:21  #37 
Sep 2009
2·3·163 Posts 
On one core of an otherwise idle i72670QM, at q=rlim/2, 2LP sieving and 3LP sieving produce the same yield at the same speed (only the fifth digit after the comma changes, which is way below noise). It doesn't hurt to make a 3LP sieving.
I've sent an email to Sam Wagstaff for reserving 6,447. 
20120630, 19:54  #38 
Sep 2009
3D2_{16} Posts 
BTW, before I queue it to the bread makers, pressure cookers and whatever else composes RSALS: how much ECM has 6,447 received ?
I can't find the information (or at least, it's not obvious to me ^^) through http://homes.cerias.purdue.edu/~ssw/cun/ . 
20120630, 20:02  #39 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
10011011010110_{2} Posts 
Tons. Rest assured.
S.S.W. himself found very large factors in this portion while it was still in the future extension stage. Also Bouvier recently added many more curves (supposedly with the GPUGMPECM) and found some impressive factors. There's no direct evidence, though; but it has been observed that they ECMd even less snfsdifficult numbers very heavily in the past. I'd like to reserve the postprocessing. Last fiddled with by Batalov on 20120630 at 20:10 
20120630, 20:48  #40 
May 2008
3×5×73 Posts 

20130912, 04:49  #41 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·3·1,657 Posts 
6 tables were officially extended. (from 451 to 500)
There may be some projects accessible to homestyle enthusiasts, e.g. 6,471. 
20160804, 04:24  #42 
Jul 2003
So Cal
2^{2}·3^{3}·23 Posts 
6,383 is done.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
7+ table  garo  Cunningham Tables  87  20220325 19:16 
5+ table  garo  Cunningham Tables  100  20210104 22:36 
6+ table  garo  Cunningham Tables  80  20210104 22:33 
3+ table  garo  Cunningham Tables  150  20200323 21:41 
5 table  garo  Cunningham Tables  82  20200315 21:47 