Holy mother of god, yes.
Thanks!

Next stop -- Phi(3,-b^524288) ...and before that perhaps Phi(3,-b^393216)

[QUOTE=Batalov;450971]

Next stop -- Phi(3,-b^524288) ...and before that perhaps Phi(3,-b^393216)[/QUOTE]

Around 6 million digits?

Another one with [URL="http://primes.utm.edu/primes/page.php?id=122757"]over 3 million digits[/URL]. Congrats.

:banana: :banana: :banana:

The previous one has yet to be UTM-verified.

[QUOTE=paulunderwood;451151]Another one with [URL="http://primes.utm.edu/primes/page.php?id=122757"]over 3 million digits[/URL]. Congrats.

:banana: :banana: :banana:

The previous one has yet to be UTM-verified.[/QUOTE]

When Batalov finished this work, we dont have any prime to find :) I am not familiar of what kind of monster ( read computer) can do such computation: last one is verified over three days, and it is just one candidate... and now we got new one in matters of days.
That computer power is something it is totally unreachable for us, mortals :)

[QUOTE=pepi37;451158]When Batalov finished this work, we dont have any prime to find :) I am not familiar of what kind of monster ( read computer) can do such computation: last one is verified over three days, and it is just one candidate... and now we got new one in matters of days.
That computer power is something it is totally unreachable for us, mortals :)[/QUOTE]

I believe the actual computation is being performed by a modified P95 (using multihtreading?) or a modified LLR, that is much faster than PFGW (which is being used by T5K site). But the real "secret" is the huge amount of compute power at the disposal of ryanp. I hear that it is bigger than NSA :smile:

[QUOTE=axn;451159]I believe the actual computation is being performed by a modified P95 (using multihtreading?) or a modified LLR, that is much faster than PFGW (which is being used by T5K site). But the real "secret" is the huge amount of compute power at the disposal of ryanp. I hear that it is bigger than NSA :smile:[/QUOTE]

Even that is 500% or 1000 % times faster then PFGW it is still for us mortals, unreachable :) Someone mush push little red button ( and below that button says)- Before you press it please, include a new nuclear power plant just for this purpose :smile:

Ryanp- can you borrow me your computer : I promise I will be finished in two hours :smile:

I feel a disturbance in the force.

[QUOTE=Batalov;451641]I feel a disturbance in the force.[/QUOTE]

:popcorn:

[QUOTE=Batalov;451641]I feel a disturbance in the force.[/QUOTE]

How many midichlorians? :shock:

[CODE][I]TOP12th#[/I] llr -d in >& out &
[I]TOP12th#[/I] tail -f out
Base factorized as : 2^2*...*...
Base prime factor(s) taken : 2, ...
Starting N-1 prime test of 1NNNNN^786432-1NNNNN^393216+1
Using generic reduction FMA3 FFT length 1440K, Pass1=320, Pass2=4608, a = 3
1NNNNN^786432-1NNNNN^393216+1, bit: 10000 / 13XXXXXX [0.0Y%]. Time per bit: 42.735 ms.
...[/CODE]Looks like a 4-5 day verification run...
Perhaps it's time to hack the multithreaded llr binary. :rolleyes:

P.S. [I]Cyclo[/I] is not written for this form: 393216 is not a power of 2, but 3 times a power of 2

[CODE]? 13000000/log(10)*log(2)
3913389.9436317555377786056314184093480
? 14000000/log(10)*log(2)
4214419.9392957367329923445261429023747
[/CODE]

[CODE]
? #digits((100000)^786432)
3932161
? #digits((200000)^786432)
4168900
[/CODE]

Any better sleuths out there? :hello: