[QUOTE=rgiltrap;140830]Now over 55% complete. :spot::spot::spot::spot::spot:[/QUOTE]

I'm just over 50% complete. Must find more power...

[QUOTE=Jeff Gilchrist;140832]I'm just over 50% complete. Must find more power...[/QUOTE]

I understand that the plants around Niagara Falls can provide quite a
bit of power.............

[QUOTE=R.D. Silverman;140835]I understand that the plants around Niagara Falls can provide quite a bit of power.............[/QUOTE]They're growing biofuels around Niagara Falls now?

Paul

[QUOTE=Jeff Gilchrist;140832]I'm just over 50% complete. Must find more power...[/QUOTE] Now about 22 % done. I'm running very fast ! Faster than ernst and Jeff. But I'll probably be the third... Cannot find more power: I run as fast as for M44.
Tony

[QUOTE=xilman;140838]They're growing biofuels around Niagara Falls now?

Paul[/QUOTE]

Well sure!! Haven't you heard of Buffalo chips?

[QUOTE=T.Rex;140840]Now about 22 % done. I'm running very fast ! Faster than ernst and Jeff. But I'll probably be the third... Cannot find more power: I run as fast as for M44.
Tony[/QUOTE]

Can you reveal your iteration time? I'm curious how fast very fast is compared to the computers us normal mortals have access to. :bow:

I don't think we can guess exponent based on that infomation, particularly since as you wrote earlier you started out slow and sped up later when you found your problem.

[QUOTE=ATH;140843]Can you reveal your iteration time? I'm curious how fast very fast is compared to the computers us normal mortals have access to. :bow:[/QUOTE]

Don't forget that "very fast" in this case is for C code, not hand-tuned assembler code for a specific architecture like Prime95 is written for. The code we are running works on Itanium2, Sparc, x86, probably Power too.

It is not going to be orders of magnitude faster than Prime95 on an x86 system.

[quote=Kevin;140816]He's looking at p-1, not p.[/quote]

[quote=akruppa;140824]Some time ago we noticed that for [I]p[/I] s.t. M[I]p[/I] is prime, [I]p[/I]-1 has slightly more small prime factors than primes chosen uniformly at random from a large interval of primes. But with only 44 data points, of which the smallest ones must be excluded to avoid bias, this statistic isn't very meaningful.

Alex[/quote]
Hmm...that's quite interesting. Maybe that clue can be used to hit some more primes more easily in the future? :smile:

[QUOTE=Mini-Geek;140829]Some from the list that catch my eye:[/QUOTE]

An objective measure of factorization smoothness would be more helpful - the kind of productive little exercise in basic number theory which we like to promote among the readership here. [And which is useful even if the speculation about smoothness of p-1 and odds of prime-ness of 2^p - 1 proves unfounded - which is what most betting number theorists would wager, IMO].

End of verifications
 

My guess is that verifications will end this month about the:
- 10th - 9pm for rgiltrap
- 13th - 6am for my-self
- 14th - 9am for Jeff
France time (substract 7h for USA East coast).
(based on information given in this thread and with some computation...).

And NO, I'll not say a word about the number of sec/iter I have. It is obscene ! And that would help to find the exponent of this 45th Mersenne prime (if proved). I'll provide it after.

About Jeff's comment dealing with speed of Glucas, Mlucas and Prime95, my Bull SAS company is working on a new super-computer that will be much faster than the one I have access to now. Mersenne primes are growing, but computer Science too !

Tony

[QUOTE=T.Rex;140852]My guess is that verifications will end this month about the:
- 10th - 9pm for rgiltrap
- 13th - 6am for my-self
- 14th - 9am for Jeff
[/QUOTE]

When will we mere mortals be told the exponent?