Hacker News new | ask | show | jobs
by phinnaeus 63 days ago
Here is a hash function that does not have hash collisions:

  fn hash(data):
    return data
3 comments

Well it no longer constrains the data in a fixed output length.
Sure, but if you constrain to fixed output length, you will definitely have collisions (Pigeon Hole Principle). There's no way around that.
padding with zeroes to a fixed length and prepending the original length would suffice, but you’d have to have a fixed length of double infinity to account for both the length information and the hash information, and the hash is less efficient than the original information.
That is a function, but not a hash function!
what programming language is this?