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.
IMPLEMENTATIONS1POINTS MEASURED1MACHINES1COMPARABLE PAIRS0
WHERE NUMBERS EXIST1 of 1 cells measured
fairmath-fpga
Fermat’s little theorem as a mask
every seed passedsome seeds failedclaimed, not measurednot claimed
N2048 on fairmath-fpga
One number is not a comparison. It is here because it is the only measurement at this point on this machine.
POINT
MACHINE
IMPLEMENTATIONMEDIANACCURACYSECURITYRINGCAPACITYKEYSMEMORYSEEDS
01Fermat’s little theorem as a maskgurgen2bgvopenfhepolycircuit1.26 sfastest hereexactbyte for byte128-bitenforced6553621 levels21 spent121962 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.