It keeps flipping back to 'monic' from e.g. 'ln(1+x)' when switching between algorithms, and then seems to lock to 'monic'? (Am I missing something?)
Also I am curious, in your version vs. horner , how do both algorithms map onto number of fmadd operations?
gowld 2 hours ago [-]
"monic" is a separate switch from the example functions radio-selector. Enabling "monic" removes the leading coefficient.
vlovich123 2 hours ago [-]
Would this be applicable to fast hashes like WyHash and xxh3 or are those not using polynomials? Is this mainly for faster cryptographic hashes?
20 hours ago [-]
aetherspawn 3 hours ago [-]
I guess it’s not faster than using a table for CRC8?
gowld 2 hours ago [-]
From the abstract, a name that many on HN would recognize:
> We also give an injective polynomial construction for universal hashing that uses N multiplications to hash 2N values with a single random key. This improves the best previous construction by Daniel J. Bernstein (this http URL).
gowld 2 hours ago [-]
What is the tradeoff between multiplication and addition?
nraynaud 1 hours ago [-]
Just a few years ago, mults were slower, but I think now (Intel i9) mult, add and fma are the same.
Also I am curious, in your version vs. horner , how do both algorithms map onto number of fmadd operations?
> We also give an injective polynomial construction for universal hashing that uses N multiplications to hash 2N values with a single random key. This improves the best previous construction by Daniel J. Bernstein (this http URL).
https://stackoverflow.com/a/39135689