Compare to this prior to "fix": 1. Insert N elems into a HT. 2. Force copy of those elems into a new HT. Both O(n**2)?
-
-
just seems like one guy kicking up shit about SipHash tbh (I only skimmed his arguments, seem kinda confused).
-
50% certain that
@veorq can easily dismiss their concerns -
SipHash is a *keyed hash*, aka pseudorandom function (PRF), not a keyless hash like SHA3 or BLAKE2
End of conversation
New conversation
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.