&gt; <i>I don&#x27;t know if a hashing algorithm that has no collisions exists (I suspect the answer is no, maybe other than the identity function).</i><p>There is no hash function without collisions. The set of inputs is infinite but the set of outputs is finite. (The identity function isn&#x27;t a hash function--its output isn&#x27;t a fixed length.)