[QUOTE=GP2;472684]1. The fact that it is a GUI-only program makes it very inconvenient to run on the cloud, especially with spot instances that can terminate/resume at any time. Is it even possible to start/resume the program automatically without manual intervention?[/QUOTE]

EC2 spot [url=https://aws.amazon.com/blogs/aws/amazon-ec2-update-streamlined-access-to-spot-capacity-smooth-price-changes-instance-hibernation/]hybernation[/url] is a thing now.

Keep in mind a 1090T is literally 6.5 year old technology at this point, and further, even its contemporary Intel processors (Sandy Bridge) were noticeably faster with the same instruction sets. A modern AMD Zen or Intel... whatever-Lake they're on now should be noticeably faster, perhaps even up to an order of magnitude, even if you exclude any new instruction sets from being used.

The 321st fully-factored or probably-fully-factored Mersenne number with prime exponent (not including the Mersenne primes themselves) is [M]M7313983[/M]. It is a semprime.

Congratulations to Oliver Kruse. This is a new record for Mersenne cofactors.

Congrats Oliver :toot:

FWIW, here is my verification:

[CODE]time ./pfgw64 -k -f0 -od -q"(2^7313983-1)/305492080276193" | ../../coding/gwnum/lucasPRP - 1 2 7313983 -1

Lucas testing on x^2 - 9*x + 1 ...
Is Lucas PRP!

real 140m38.679s
user 517m9.572s
sys 16m21.860s
[/CODE]

The 322nd fully-factored or probably-fully-factored Mersenne number with prime exponent (not including the Mersenne primes themselves) is [M]M2789[/M].

Oliver Kruse ran the PRP test, but it was James Hintz who found the most recent factor (44 digits, 144 bits).

Needs a Primo certification from someone, check [URL="http://factordb.com/index.php?id=1100000001112630596"]this FactorDB link[/URL] to see if anyone has submitted it yet.

The 323rd fully-factored or probably-fully-factored Mersenne number with prime exponent (not including the Mersenne primes themselves) is [M]M22193[/M].

I found the most recent factor. For such small assignments, the ECM code of mprime itself does a quick PRP test on the cofactor, and although this doesn't get reported to Primenet, it writes "Cofactor is a probable prime!" to the results.txt file when applicable, which was the case here.

As of this writing, the actual PRP test assignment hasn't completed yet, it's assigned to axn and presumably queued up and will complete almost instantly after it is started.

As usual, someone can call dibs on Primo certification.

I'll run it.

[QUOTE=GP2;484325]As of this writing, the actual PRP test assignment hasn't completed yet, it's assigned to axn and presumably queued up and will complete almost instantly after it is started.[/QUOTE]
And done.

[QUOTE=Batalov;484333]I'll run it.[/QUOTE]

Ya shudda mentioned "ECPP" with your submission and added a link to the certificate in a comment.

:wrong:

It only makes sense to add ECPP if you are contending for a top-20 spot, (You want to have ECPP record # 10 thousand - be my guest and do it.) "Proof method = Primo" obviously implies it.

In order to have a link you have to wait for factordb to ingest it. It hasn't yet.

[QUOTE=Batalov;484389]It only makes sense to add ECPP if you are contending for a top-20 spot, (You want to have ECPP record # 10 thousand - be my guest and do it.) "Proof method = Primo" obviously implies it.

In order to have a link you have to wait for factordb to ingest it. It hasn't yet.[/QUOTE]

I see the link to FactorDB now.

I disagree about not including the ECPP code with non-top-20 ECPP proofs. For example: When [I]searching[/I] for ECPP proven primes yours will be missing. However, I do like it that you have shared the credit with Gord Palameta.