[ncc-erik]

Found in 2700 core-years, verified in < 1 core-second

    >>> 64135289477071580278790190170577389084825014742943447208116859632024532344630238623598752668347708737661925585694639798853367*33372027594978156556226010605355114227940760344767554666784520987023841729210037080257448673296881877565718986258036932062711 == 2140324650240744961264423072839333563008614715144755017797754920881418023447140136643345519095804679610992851872470914587687396261921557363047454770520805119056493106687691590019759405693457452230589325976697471681738069364894699871578494975937497937
    True

[svnpenn]

That a ratio of 85 billion to 1, ouch

[londons_explore]

The point of RSA is to have a much higher ratio than that...

[ncc-erik]

My measurement was imprecise and that probably throws things off:

    python -m timeit '64135289477071580278790190170577389084825014742943447208116859632024532344630238623598752668347708737661925585694639798853367*33372027594978156556226010605355114227940760344767554666784520987023841729210037080257448673296881877565718986258036932062711 == 2140324650240744961264423072839333563008614715144755017797754920881418023447140136643345519095804679610992851872470914587687396261921557363047454770520805119056493106687691590019759405693457452230589325976697471681738069364894699871578494975937497937'
    500000 loops, best of 5: 496 nsec per loop

So roughly 2 verifications per core-millisecond, ~170 quadrillion ratio?