I've been having some really bad luck with the ranges recently..

Submissions: 3858 * p(30)#[sup]120[/sup] + 1 (5584 digits)

Verification:


Primality testing 3858*p(30)#^120+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 131
Generic modular reduction using generic reduction FFT length 1792 on A 18549-bit number
Calling Brillhart-Lehmer-Selfridge with factored part 34.37%
3858*p(30)#^120+1 is prime! (1.5863s+0.0010s)

[QUOTE=3.14159]I've been having some really bad luck with the ranges recently..
[/QUOTE]

Bad luck keeps going. I recently had my first no-hit range in a while: k * 2[sup]18890[/sup] + 1; 60k to 80k.

Maybe I should go back to using unreasonably large ranges again.

Also; Did anyone happen to find anything top-5000 worthy?

[QUOTE=3.14159;229508]Also; Did anyone happen to find anything top-5000 worthy?[/QUOTE]
Not yet (at least not recently), but the k*211^n-1 search that my last prime came from is in top-5000 territory now. Namely, at n=~83K; I'm going until 100K. Hopefully I'll turn out something before then.

[QUOTE=Max]Not yet (at least not recently), but the k*211^n-1 search that my last prime came from is in top-5000 territory now. Namely, at n=~83K; I'm going until 100K. Hopefully I'll turn out something before then.
[/QUOTE]

Is it part of a conjectured k search?

[quote=3.14159;229640]Is it part of a conjectured k search?[/quote]
Not a conjectured k search per se; the conjectured k's have been known for a long time. It is part of a search to find a prime for each of the k's belowed the conjectured k--in other words, to prove the conjecture for that base. That's what Conjectures 'R Us primarily does (since for its scope, bases <1030 on both +1 and -1 sides, all of the conjectured k's have already been determined).

Submissions: 698046 * 1999[sup]10480[/sup] + 1 (34599 digits)

Verification:
Primality testing 698046*1999^10480+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using zero-padded FFT length 20K on 698046*1999^10480+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.98%
698046*1999^10480+1 is prime! (49.1412s+0.0025s)

Submissions: 147645 * 2[sup]54000[/sup] + 1 (16261 digits)

Verification:
Primality testing 147645*2^54000+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 13
Special modular reduction using zero-padded FFT length 5K on 147645*2^54000+1
Calling Brillhart-Lehmer-Selfridge with factored part 99.97%
147645*2^54000+1 is prime! (4.8469s+0.0007s)

I think I'll simply stockpile for top 5k-worthy primes.

The only active test is k * 2[sup]552600[/sup] + 1, which will become non-top 5k material in about 7-15 days; So I'll get rid of that.

I'm pretty much on a long-stage sieving project; I've sieved up to 6.7 trillion for k * 2[sup]594800[/sup] + 1. From 1000000 candidates, I am down to a mere 37700 candidates.

[code]19:12:07 37700 k's remaining. p=6735609053237 divides k=2189697[/code]