Hash function — the avalanche effect

What just happened?

We swapped one character in the input, and the hash changed in nearly half of its bits — with no resemblance to the previous one. This is how a good hash function behaves.

What is a hash function?

It is a mapping that transforms arbitrarily long input data into a hash of fixed length (here: 128 bits, i.e. 32 hex characters). Formally:

Every input — “kot” or a whole sentence — gives a result of the same length $n$. The function is deterministic: the same input always returns the same hash.

The avalanche effect

The key property of cryptographic hash functions: changing one bit of the input changes about half of the output bits, unpredictably:

That is why from the hash alone you cannot “reverse” it to the input, nor guess how a small change will affect the result.

What is it good for?

A hash is a digital “fingerprint” of data. Since every modification changes it, it is used for:

• data integrity — you compare the hash of a downloaded file with the original; a difference = the file changed,
• password storage — the database stores the hash, not the password,
• digital signatures and blockchain — one signs the hash of a document, not the whole document.

Remember:

A hash function: any input → fixed-length output, deterministically, with an avalanche effect. A small change in the input = a large, unpredictable change in the hash.

Note: this is an illustrative model — we used our own simple mixing function (FNV-1a + finalizer) to show the principle. Real functions (e.g. SHA-256) are much stronger, but obey the same avalanche rule.