I'm collecting such inverters at
<a href="https://github.com/rurban/smhasher/tree/inverse/inverse" rel="nofollow">https://github.com/rurban/smhasher/tree/inverse/inverse</a><p>But only 3 so far.
Is there a category of hash functions that hash a 64/32 bit input to exactly 64/32 bits output, such that all inputs are uniquely preserved? This could be an interesting property for a hash table of integers, because a hash match implies a key match.
> otherwise you could simply trace backwards and generate an input that produces a specific hash<p>This is when I know for sure that I'm not included in that "you".
Excellent tutorial for bitwise arithmetic this is. The key is the motivation you receive from the prospect of being able to do something that seems "l33t".