[QUOTE=CRGreathouse]That was the meaning of post #925: "vk can do that".

You could produce a specialized script without the exponent, removing the extra operation, but it won't save you much time.

Of course it will be slower to use vk like this: for a given size, it's much faster to use a power (say, n = 856780 or even 100) than a non-power (n = 1).[/QUOTE]

I only use vk when searching for larger bases than NewPGen would allow.

[QUOTE=CRGreathouse]Dunno, change your settings to ask for it and see. My understanding, rightly or wrongly, is that ECM is most needed right now -- that there's an increasingly small pool of ECM'd exponents ready for LL.
[/QUOTE]

I'm guessing the optimal settings are B1 = 1M?; B2 = 100M?

[QUOTE=CRGreathouse]I don't know what that means.
[/QUOTE]

Odds? Chances of a certain cofactor being prime? Based on the assumption that: The candidates have no factor smaller than what was sieved up to.

7.5% done with trial factoring for 2[sup]75325247[/sup] - 1. I should be finished in 9-11 hours.

Ongoing searches: k * 2[sup]93560[/sup] + 1 (≈28170 digits)

[QUOTE=3.14159;227288]I'm guessing the optimal settings are B1 = 1M?; B2 = 100M?[/QUOTE]

If you're ECMing on your own, basic guidelines are here:
[url]http://www.fermatsearch.org/ecm.html[/url]

You run a set number of curves at a given B1, then more at a higher B1, etc.

[QUOTE=3.14159;227289]Odds? Chances of a certain cofactor being prime? Based on the assumption that: The candidates have no factor smaller than what was sieved up to.[/QUOTE]

OK, but I still don't understand what you're telling or asking me here:

[QUOTE=3.14159;227269]You'd have to depend on the odds, though.[/QUOTE]

[QUOTE=CRGreathouse]You'd have to depend on the odds, though.
[/QUOTE]

I just answered that.

[QUOTE=CRGreathouse;227279]That seems to be the typical range for trial division. ECM isn't that far yet, as I recall, and the LL tests are just below the ECM range.[/QUOTE]

mersenne.org and PrimeNet are down right now so I can't verify, but IIRC ECM is only for very small Mersenne numbers, like p<1M, and is intended to find more factors when the primality is already known. ECM isn't cost-effective to run before an LL test, but it's good for finding factors when TF becomes too slow.
By the way, last I heard, TF has more people than needed, and DC needs more people. ECM is a side effort.

[QUOTE=Mini-Geek]mersenne.org and PrimeNet are down right now so I can't verify, but IIRC ECM is only for very small Mersenne numbers, like p<1M, and is intended to find more factors when the primality is already known. ECM isn't cost-effective to run before an LL test, but it's good for finding factors when TF becomes too slow.
By the way, last I heard, TF has more people than needed, and DC needs more people. ECM is a side effort.[/QUOTE]

That's strange. The GIMPS site works just fine for me.

[QUOTE=3.14159;227299]I just answered that.[/QUOTE]

I hope you got whatever information you needed.

[QUOTE=Mini-Geek;227300]mersenne.org and PrimeNet are down right now[/QUOTE]

[QUOTE=3.14159;227301]That's strange. The GIMPS site works just fine for me.[/QUOTE]

[url]http://downforeveryoneorjustme.com/mersenne.org[/url]