On: Python sets and dictionaries can have quadratic-time performance

[progval]

Ouch, that's a big footgun. Why was the lack of randomization considered a vulnerability, but not this?

[minitech → progval]

I haven’t looked into the history, but my understanding from the comments is that it exists to preserve `x == y -> hash(x) == hash(y)` for `x` and `y` with different numeric types (int, float, decimal) – which seems like it should be solvable, but isn’t a constraint I’d want to be working under, so I sympathize.