What a Hash Actually Is, Explained Without Jargon
Published
A hash is a fixed-length string of characters generated from any input — a word, a password, an entire file — using a mathematical function designed so that even a tiny change in the input produces a completely different hash output. Change a single letter in a sentence, and the resulting hash looks nothing like the hash of the original sentence, even though only one character changed.
This property makes hashing useful for verification rather than encryption — the two are often confused, but they solve different problems. Encryption is meant to be reversed with the right key; a good hash function is specifically designed to be a one-way street, where you can't work backward from the hash to recover the original input. This is exactly why websites store a hash of your password rather than the password itself: if their database is ever breached, the attacker gets hashes, not usable passwords.
Hashing is also how file integrity checks work: if you download a large file and the provider publishes its hash, you can hash your downloaded copy and compare the two values. If they match exactly, you can be confident the file wasn't corrupted or tampered with in transit.