[QUOTE=henryzz;451550]I recently upgraded from a Q6600. 5x faster per core.[/QUOTE]

Q6600 is really old one :)

[QUOTE=Batalov;451056]P-1 is effective for the inputs that[B] have a known partial factorization[/B] of all future factors. A trivial example is Mersenne primes, as well as Wagstaff's, GFNs, GUs, GMs, EMs, All of them have factors P, with P-1 known to have 20-25 bits already factored. You get this 20-25 bit boost for free and on top of it you get an additional factor of P-1, and as a result you get a factor P which is above what you can get with TF/sieving.

For most CRUS candidates, you only know that P-1 has a factor 2 (which is no new information, and hence no boost), and a P-1 curve will be as effective as 1 curve of ECM. Occasionally, yes, you will get a factor in line with random probability,[/QUOTE]

Can you give me one example of GFN sequence , that I can search with LLR and do srsieve , and where I will got this 20-25 bit boost ( let that sequence be unexplored territory) :)?