[QUOTE=fivemack;416735]Sounds good to me; since you call it a 'slow sieving candidate' I guess you have a polynomial and parameters already. Post them here and I'll add them to the queue.[/QUOTE]

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.

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.

More than 8 hours and a half later, still 0 received. I'll kill the current entry and create a new one.

Oscar aka Lorgix has done sufficient ECM on 4261^67-1. A P55 was found, but the residual C183 is now ready for SNFS

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 :smile:

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 ?

[QUOTE=debrouxl;417671]At long last, I have gone through the posts by William and Rich ... Hopefully, I haven't missed any numbers :smile:[/QUOTE]

I think that 4261^67-1, already sieving, and 4261_67_minus1, last number queued, are the same number, although they show slight differences in parameters.

Oops. Indeed, so they were. I have erased the superfluous entry.
Thanks for the heads-up :smile:

15e queue emergency refill
 

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).

Would you all be OK with trying a 198-digit GNFS to finish off some loose ends in the Euclid-Mullin graph project? [url]http://mersenneforum.org/showpost.php?p=417885&postcount=145[/url]

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 ...)

GNFS difficulty 198-200 on 15e works for me. I can't meaningfully help for polynomial selection, as usual.

[QUOTE=fivemack;417876]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).[/QUOTE]

I can think of quite a few, such as these Oddperfect related numbers in the most wanted list with particularly large weights:
(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