![]() |
![]() |
#67 |
Feb 2003
101011102 Posts |
![]()
248M-252M Complete. 5419978 relations in the range, 5408212 unique. Uploading now.
|
![]() |
![]() |
![]() |
#68 | |
Oct 2004
Austria
1001101100102 Posts |
![]() Quote:
206-207 (or ~25% of it because it has crashed): http://www.sendspace.com/file/32x18n 207-208 (should be (almost?) complete): http://www.sendspace.com/file/vn7xbe |
|
![]() |
![]() |
![]() |
#69 |
(loop (#_fork))
Feb 2006
Cambridge, England
6,379 Posts |
![]()
207-208 appears complete; 206-207 is indeed 25% done.
I'll finish up 206-207 and 19.0-19.8, and start the linear algebra at the weekend. |
![]() |
![]() |
![]() |
#70 |
Sep 2009
22×32×5×11 Posts |
![]()
I think we can un-sticky this thread now.
Chris K |
![]() |
![]() |
![]() |
#71 |
(loop (#_fork))
Feb 2006
Cambridge, England
18EB16 Posts |
![]()
15-252 is now fully sieved, msieve with target density 100 is poring through 47492098338 bytes of relations (407997768 relations, 318653904 unique)
Last fiddled with by fivemack on 2010-09-04 at 09:15 |
![]() |
![]() |
![]() |
#72 |
(loop (#_fork))
Feb 2006
Cambridge, England
18EB16 Posts |
![]() Code:
Sat Sep 4 14:53:53 2010 matrix is 19514425 x 19514673 (7528.6 MB) with weight 1925523041 (98.67/col) Sat Sep 4 14:53:53 2010 sparse part has weight 1778442998 (91.13/col) Sat Sep 4 14:59:46 2010 linear algebra at 0.0%, ETA 865h14m linear algebra completed 22997 of 19514673 dimensions (0.1%, ETA 869h28m) 10131 nfsslave 20 0 8496m 8.3g 1048 R 343 70.3 609:04.83 msieve |
![]() |
![]() |
![]() |
#73 |
(loop (#_fork))
Feb 2006
Cambridge, England
11000111010112 Posts |
![]()
Unfortunately, the timing has not worked out perfectly: the linalg would finish on Saturday afternoon, but I am going to China for two weeks on Saturday morning and will turn the computers off. So expect factors on about 26 October.
|
![]() |
![]() |
![]() |
#74 |
(loop (#_fork))
Feb 2006
Cambridge, England
6,379 Posts |
![]() Code:
Wed Oct 27 12:00:11 2010 prp85 factor: 8022468609453611665082019221530953944163549137920344510245747854780835146671963776777 Wed Oct 27 12:00:11 2010 prp184 factor: 9688789919483838708810358343444188308059016146046561072836401903385375007156741636000015490808770627835181274383093018972359887003518258190829470483941361347766634033284584062134510727 (from the fifth dependency, at eight hours per sqrt) Last fiddled with by wblipp on 2010-11-06 at 11:24 Reason: Code tags |
![]() |
![]() |
![]() |
#75 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
33×73 Posts |
![]()
Congrats! That was some heavy-lifting!
|
![]() |
![]() |
![]() |
#76 |
Sep 2009
977 Posts |
![]()
Great, congratulations
![]() |
![]() |
![]() |
![]() |
#77 |
"William"
May 2003
New Haven
44708 Posts |
![]() ![]() Wow! This was a BIG project that I had not expected to see this year. Oddperfect.org had been advancing ECM on this most-limiting obstruction, but mostly in hope of finding a factor. The base 2801 isn't of interest outside of the OPN community, and the number strains resources. But in April Tom grabbed the bull by the horns and said "let's do it!" Nearly six months later, with huge contributions by dozens of people, it's finished. Thanks, Tom, and all the other contributors. There are ways to push OPN proofs higher without specific factorizations, but the result is always a higher limit that is constrained by the same missing factorization. This factorization would have determined the limitation of all OPN proofs - all OPN researchers rejoice at this factorization. ![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Four more primes contest! -Closed | Joe O | Sierpinski/Riesel Base 5 | 9 | 2010-11-16 00:11 |
Run to the Top Contest - Closed | Joe O | Sierpinski/Riesel Base 5 | 12 | 2010-10-11 16:22 |
2801^79-1; thoughts on duplication sampling | fivemack | Factoring | 0 | 2010-04-15 22:23 |
5^421-1 sieving (reservations closed) | fivemack | Factoring | 124 | 2008-11-18 22:24 |
Is P.I.E.S. still closed to some users? | jasong | Information & Answers | 9 | 2005-10-23 19:04 |