Yeah I always like to think of hashing as a functions that maps an infinitely large namespace (all possible sequences of data) in to bounded namespace (usually

Yeah I always like to think of hashing as a functions that maps an infinitely large namespace (all possible sequences of data) in to bounded namespace (usually 128-bits). Find that makes it obvious why hash collisions are a thing and also why hashes are useful. A limited namespace is much easier to work with, assuming you don’t need the actual data.