This post is really great but also 
https://twitter.com/nelhage/status/801472446121422848 …
-
-
People are putting much effort into making it harder for an attacker to trigger worst case, at significant cost of avg & best case.
-
But, the point of using a hash table is really to get the very best best- and average- case behavior. So, what's the point now?
-
the defenses in place also protect against accidentally bumbling into the worst case, as was the case for the Rust issue.
-
If you clone a HashMap then will both HashMaps have equivalent RandomState? Why wasn't Clone impl modified too?
-
sorry I have no idea how they actually addressed the issue; I don't really follow Rust dev anymore (can't contrib).
-
it's common for a quick fix to land without thinking about all the issues. e.g. my mem::forget fixes to Rc/Arc missed some funcs
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.