Did you know?

"An Elliptic Curve Primality Proving (ECPP) algorithm was used via a primality proving program, Primo 4.3.0 - LX64, to generate a primality certificate which deterministically verifies the primality of p. The certification process took 39 days and 8 hours to complete using an AMD Ryzen Threadripper 2950X (16-Core, 32-Thread, 3.5GHz Base)."

http://www.primepairs.com/primo-B3F56036B033B.out

#didyouknow #ellipticcurve #primality #mathematics

Did you know?

"An Elliptic Curve Primality Proving (ECPP) algorithm was used via a primality proving program, Primo 4.3.0 - LX64, to generate a primality certificate which deterministically verifies the primality of p. The certification process took 39 days and 8 hours to complete using an AMD Ryzen Threadripper 2950X (16-Core, 32-Thread, 3.5GHz Base)."

http://www.primepairs.com/primo-B3F56036B033B.out

#didyouknow #ellipticcurve #primality

From the 70's, Shanks' SQUFOF algorithm for prime factorising using square forms, with a mention of the HP-65...

"""
...to prove this I had only a hand-held HP-65 with its very small memory (100 steps in the program). Obviously, one cannot put the huge BRIMOR on such a machine. But one can put on the simple algorithm...
... factor the 19-digit N₀ as
(22) N₀ = 139001459 · 8294312261
even though the HP-65 only computes with 10-digit numbers.
"""

https://homes.cerias.purdue.edu/~ssw/shanks.pdf

#hpcalc #hp65
#primality