3 ms·
> I don't know if a hashing algorithm that has no collisions exists (I suspect the answer is no, maybe other than the identity function). There is no hash func
by walrus 11y ago
> I don't know if a hashing algorithm that has no collisions exists (I suspect the answer is no, maybe other than the identity function).
There is no hash function without collisions. The set of inputs is infinite but the set of outputs is finite. (The identity function isn't a hash function--its output isn't a fixed length.)
- hardwaresofton 11y agoThanks for the correction! Somehow forgot the fixed length output requirement of hashing functions.