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 MEASURED2MACHINES1COMPARABLE PAIRS0
WHERE NUMBERS EXIST2 of 2 cells measured
fairmath-fpga
Row-wise, after Aikata
every seed passedsome seeds failedclaimed, not measurednot claimed
N8 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
01Row-wise, after Aikataaikatackksopenfhepolycircuit53.3 msfastest here—worst 3.3e-10128-bitenforced163842 levels1 spent80274 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.