Compare implementations
Two numbers may be put side by side when they came from the same point on the same machine. Everything on this page follows from that.
IMPLEMENTATIONS2POINTS MEASURED7MACHINES3COMPARABLE PAIRS4
WHERE NUMBERS EXIST14 of 42 cells measured
fairmath-fpga
fairmath-general-runner
fherma-general-purpose
Chebyshev to depth ten, after Aikata
One Chebyshev of the ramp, over Poulpy
every seed passedsome seeds failedclaimed, not measurednot claimed
N256 on fairmath-fpga
Same point, same machine, same environment. These times mean the same thing, so they can be read against each other.
POINT
MACHINE
IMPLEMENTATIONMEDIANACCURACYSECURITYRINGCAPACITYKEYSMEMORYSEEDS
01One Chebyshev of the ramp, over Poulpygurgen2ckkspoulpyrust1.24 sfastest here100.00%share inside the bar128-bitestimated16384330 bitstorusnone342 MBpeak3 of 3
02Chebyshev to depth ten, after Aikataaikatackksopenfhepolycircuit7.89 s×6.38 of fastest100.00%share inside the bar128-bitenforced3276810 levels9 spentnone1176 MBpeak3 of 3
HOW ACCURACY IS JUDGED
Every accuracy figure here is the output of the verifier in this specification’s testing bundle — one function, run against what each seed left behind. It travels with the specification, so every implementation is judged by the same code.THE ONE RULE
A time means nothing without the point it was measured at and the machine it ran on. Fixing both gives a comparison; releasing either gives a reading of something else — how an implementation scales, or where it runs. Nothing on this page averages across machines, and no implementation is judged on a point it never claimed.