title: Ruby internals and how to guarantee unique hash values
body: <p>Hash in Ruby just uses its hash value (for strings and numbers). Internally, it uses <a href="http://preshing.com/20110504/hash-collision-probabilities/" rel="nofollow">the Murmur hash function</a>. I wonder <strong>how it can can be done given that the probability of having the same hash value for two different keys is not zero</strong>.</p>