I know that one of the most important features of hashing algorithms, is that minor changes in the input should reflect great change in the hash itself (the avalanche effect), but I'm currently searching for a solution that doesn't implement this.
I've read this answer on the cryptography stackexchange, but it doesn't seem to offer exactly what I need.
I still need the input to be obscured so that reversion is impossible/improbable, but I'd like for similar input values to output similar hashes.
I imagine an algorithm with something like this (pseudo-example):
Input: Is this possible? Output: 5e2a9d8a8f02c07c20142a571f1785c2 Input: Is this impossible? Output: 5e2a9d8a8f02c07c20142a671f1785d2
Does something like this exist at all?