title: Are there circumstances where a hash algorithm can be guaranteed unique?
body: <p>If I'm hashing size-constrained similar data (social security numbers, for example) using a hash algorithm with a larger byte size than the data (sha-256, for example), will the hash guarantee the same level of uniqueness as the original data?</p>