![]() |
|
|
#309 |
|
Jun 2012
309110 Posts |
I must retract this suggestion - my database of xyyx composites has a value of 23 weeks to sieve this number based on some test sieving performed in the past. However I just reran the poly for verification before posting it here and found the sieving time to be substantially shorter: < 3 weeks on a single machine! Not really worthy of NFS@Home. Apologies for wasting your time.
|
|
|
|
|
|
#310 |
|
Sep 2009
977 Posts |
The number of received results for C222_117_100 doesn't seem to be raising above 0, and I see that there's no "type: snfs" line in the poly. If the number of received results doesn't raise by tonight, I'll have to kill this entry and create a new one.
|
|
|
|
|
|
#311 |
|
Sep 2009
977 Posts |
More than 8 hours and a half later, still 0 received. I'll kill the current entry and create a new one.
|
|
|
|
|
|
#312 |
|
"William"
May 2003
New Haven
2×7×132 Posts |
Oscar aka Lorgix has done sufficient ECM on 4261^67-1. A P55 was found, but the residual C183 is now ready for SNFS
|
|
|
|
|
|
#313 |
|
Sep 2009
3D116 Posts |
At long last, I have gone through the posts by William and Rich on pages 6 and 7, and queued all OP numbers but the GNFS 147. Factors for the GNFS 153-155 tasks weren't in FactorDB yet, three-four weeks later.
Hopefully, I haven't missed any numbers ![]() The entry for C222_117_100 seems to have been completely erased (as opposed to set to completed state), so I can't requeue a fixed version of that one. Tom ? |
|
|
|
|
|
#314 |
|
"William"
May 2003
New Haven
2·7·132 Posts |
|
|
|
|
|
|
#315 |
|
Sep 2009
97710 Posts |
Oops. Indeed, so they were. I have erased the superfluous entry.
Thanks for the heads-up
|
|
|
|
|
|
#316 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
23×11×73 Posts |
I've queued up Fibonacci(1297) and 131^97+97^131.
If anyone has a 26x-difficulty SNFS, or C18x GNFS job of particular interest, now would be a good time to tell me about it (and start the polynomial selection, for GNFS). |
|
|
|
|
|
#317 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
23×11×73 Posts |
Would you all be OK with trying a 198-digit GNFS to finish off some loose ends in the Euclid-Mullin graph project? http://mersenneforum.org/showpost.ph...&postcount=145
It's probably twice as much work as the C194 from aliquot sequence 4788, but that number went pretty smoothly. (obviously there's a decent amount of polynomial selection to be done, and one GTX970 for a month probably isn't enough ...) |
|
|
|
|
|
#318 |
|
Sep 2009
3D116 Posts |
GNFS difficulty 198-200 on 15e works for me. I can't meaningfully help for polynomial selection, as usual.
|
|
|
|
|
|
#319 | |
|
Sep 2009
24·131 Posts |
Quote:
(4051^71-1)/4050 (4091^71-1)/4090 Sadly, I've no idea if they have had enough ECM run against them. And the difficulty is a bit low although the largish coefficients will make them seem harder. Chris Last fiddled with by chris2be8 on 2015-12-01 at 18:22 Reason: Note about difficulty. |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| System management notes | kriesel | kriesel | 7 | 2020-10-21 18:52 |
| Improving the queue management. | debrouxl | NFS@Home | 10 | 2018-05-06 21:05 |
| Script-based Primenet assignment management | ewmayer | Software | 3 | 2017-05-25 04:02 |
| Do normal adults give themselves an allowance? (...to fast or not to fast - there is no question!) | jasong | jasong | 35 | 2016-12-11 00:57 |
| Power Management settings | PrimeCroat | Hardware | 3 | 2004-02-17 19:11 |