New ECPP record (currently: 59,798 digits)

[Stargate38]

@Paulunderwood: Any chance you could post a FactorDB link for that number, or at least post a zipped .txt attachment with the full decimal expansion? I tried clicking "Show all of the digits", but I just got this:

Partition numbers are too slow to calculate 'on the fly' and should be pre-calculated. Tell the editor this one is
missing and it will be added

[paulunderwood]

Originally Posted by Stargate38

@Paulunderwood: Any chance you could post a FactorDB link for that number, or at least post a zipped .txt attachment with the full decimal expansion? I tried clicking "Show all of the digits", but I just got this:

Partition numbers are too slow to calculate 'on the fly' and should be pre-calculated. Tell the editor this one is
missing and it will be added

The top5000 uses an outdated version of Par/GP to calculate the digits of partition numbers. My version takes a minute or two -- the version the top5000 is using has already taken over 12 hours.

I am just uploading the 79MB certificate to FactorDB. Verification will tie up a core for several days. Somehow factorDB rejected the certificate saying "candidate must be probable prime". It will only be a matter of a couple of days before the certificate appears on ellipsa.eu.

I have almost completed a verification of the certificate here on my 48 core -- it is likely to be around 20 hours in total.

See the attached for the decimal expansion.

[Batalov]

Congrats!

Here is a method that I use to create large entries in FactorDB.
1. Find any unrelated composite.
2. Paste your number in the 'Report factors' text box. ;-)
3. Get the link to the number on the next webpage. It is http://factordb.com/index.php?id=1100000001443762221

Another method is to submit the zipped primo's out file and then find it in your own
http://factordb.com/certoverview.php?userid=${your-uid} but when it is large then what you described likely happens.

[paulunderwood]

Originally Posted by Batalov

Congrats!

Here is a method that I use to create large entries in FactorDB.
1. Find any unrelated composite.
2. Paste your number in the 'Report factors' text box. ;-)
3. Get the link to the number on the next webpage. It is http://factordb.com/index.php?id=1100000001443762221

Another method is to submit the zipped primo's out file and then find it in your own
http://factordb.com/certoverview.php?userid=${your-uid} but when it is large then what you described likely happens.

Thanks for creating the number. I have tried 3 different ways to upload the cert. and am giving up.

I have verified the number in about 15.5 hours on my 48 core.

I await Marcel putting up the cert. to which I will link from UTM.

[Batalov]

When I did a bit of an exploration of Lehmer numbers, I've done those depositions a lot.
I also typically initialize N-1 and N+1, in this case
http://factordb.com/index.php?id=1100000001443795933
http://factordb.com/index.php?id=1100000001443795971

The interesting thing is that for them, the PRP test didn't choke so FDB can properly treat the entries of this size.

[paulunderwood]

The cert has been uploaded to FDB -- it had to change from status "U" to "PRP" before I could upload successfully.

[axn]

Originally Posted by paulunderwood

The cert has been uploaded to FDB -- it had to change from status "U" to "PRP" before I could upload successfully.

Not seeing it, though. Neither under the number nor in the queue (http://factordb.com/certoverview.php...p=0&pending=on)

[paulunderwood]

Originally Posted by axn

Not seeing it, though. Neither under the number nor in the queue (http://factordb.com/certoverview.php...p=0&pending=on)

I don't know why it is not showing up in that queue. The certificate is now on Ellipsa top20.

I am still awaiting UTM to register it so I can link to there from the ECPP Wiki page.

[ewmayer]

Nice work on these, Paul - catching up with the thread:

Originally Posted by paulunderwood

It is with great pleasure that I proudly announce a new record ECPP certification of a 34093 digits prime. Arranged in a 331 by 103 grid the digits of the prime depicts the Mersenne prime exponent 57,885,161.

The certification process took 14 months using a 4 x AMD 6174 (48 cores at 2.2 GHz) and 200 days additionally spent in parallel on an AMD 1090T (6 cores at 3.2 GHz) running phase 2 work.

I see the trailing digits = ...000532669 - how many such candidates did you have to PRP-test to find this one? Your above snip mentions just the ECPP effort, if I read that correctly.

[paulunderwood]

Originally Posted by ewmayer

Nice work on these, Paul - catching up with the thread:



I see the trailing digits = ...000532669 - how many such candidates did you have to PRP-test to find this one? Your above snip mentions just the ECPP effort, if I read that correctly.

That little touch of a prime ending would have been done like this: start with the picture ending zeroes and have pari/gp add primes to the number to form a list in a file -- maybe with some elementary trial division. Then process the file with pfgw64 -f until a PRP shows. As I recollect I had one or two found overnight.

Further, the big digits of the picture were created in text files and stitched together with Perl.

[paulunderwood]

Originally Posted by paulunderwood

I am still awaiting UTM to register it so I can link to there from the ECPP Wiki page.

After nearly 9 days UTM has given "External" status to the partitions number. I can now do the Wiki page.