PARI's commands

[3.14159]

Originally Posted by 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).

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

[3.14159]

Originally Posted by 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.

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

[3.14159]

Originally Posted by CRGreathouse

I don't know what that means.

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^75325247 - 1. I should be finished in 9-11 hours.

[3.14159]

Ongoing searches: k * 2⁹³⁵⁶⁰ + 1 (≈28170 digits)

[CRGreathouse]

Originally Posted by 3.14159

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

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

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

[CRGreathouse]

Originally Posted by 3.14159

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.

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

Originally Posted by 3.14159

You'd have to depend on the odds, though.

[3.14159]

Originally Posted by CRGreathouse

You'd have to depend on the odds, though.

I just answered that.

[Mini-Geek]

Originally Posted by CRGreathouse

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.

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.

[3.14159]

Originally Posted by 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.

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

[CRGreathouse]

Originally Posted by 3.14159

I just answered that.

I hope you got whatever information you needed.

[CRGreathouse]

Originally Posted by Mini-Geek

mersenne.org and PrimeNet are down right now

Originally Posted by 3.14159

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

http://downforeveryoneorjustme.com/mersenne.org