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 MEASURED2MACHINES2COMPARABLE PAIRS2
WHERE NUMBERS EXIST6 of 8 cells measured
fairmath-fpga
fairmath-general-runner
A Chebyshev series to T₇₇, after Aikata
One Chebyshev series on a scaled domain, over Poulpy
every seed passedsome seeds failedclaimed, not measurednot claimed
N1024 on fairmath-general-runner
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 series on a scaled domain, over Poulpygurgen2ckkspoulpyrust893 msfastest here100.00%worst 2.9e-5128-bitestimated16384330 bitstorusnone299 MBpeak3 of 3
02A Chebyshev series to T₇₇, after Aikataaikatackksopenfhepolycircuit1.69 s×1.90 of fastest100.00%worst 3.7e-5128-bitenforced327687 levels6 spentnone213 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.