June 14, 2026
This article got hashed in public
Chopped, Stored, Secured – The Story of the Hash Function
The internet loved the history lesson—then dragged the crypto part into the comments
TLDR: The article explains where hashing began in the 1950s and how it turned words into numbered storage slots. But commenters say the history is fine while the modern security explanation is badly wrong, turning the discussion into a correction-fest over what these digital fingerprints really do.
This story starts as a surprisingly charming history lesson: back in 1956, Arnold Dumey described a way to turn words into numbers and tuck them into memory faster, basically the early ancestor of what we now call hashing. The article walks readers through a cute example using the word “BOX,” prime numbers, and simple math, then traces how the word hash came from the French for “to chop.” So far, so wholesome. But the second the piece wanders into modern security, the comments go from polite nodding to full red-pen mode.
The biggest reaction? “Nice history, but the crypto explanation is a mess.” One commenter says the modern way to understand these digital fingerprints is through another security building block entirely, arguing the article misses the real picture. Another is even sharper, saying it “goes completely off the rails” once it starts describing how secure hashing supposedly works. Translation for non-experts: readers were fine with the origin story, but when the article tried to explain today’s lock-the-door version of hashing, the crowd basically yelled, “Teacher, check the homework.”
That clash became the real entertainment. You can almost hear the split-screen reactions: half the audience enjoying a nerdy museum tour, the other half storming in with correction pens and side-eye. The unintentional meme of the moment is that the article itself got hashed by the comments—chopped, mixed, and judged in public.
Key Points
- •The article says hashing was first defined in 1956 by Arnold Dumey, who called the method "indexing."
- •Dumey’s approach transforms a word into a numeric value, then uses a prime modulus to map that value to a memory address.
- •Using the example "BOX," the article computes a base-37 value of 3317 and maps it to address 19 using modulo 97.
- •The article states that early indexing and hashing are effectively the same idea and identifies the method as a polynomial hash.
- •It distinguishes ordinary hashing for storage and lookup from cryptographic hashing, which adds protection against attackers and is linked to Diffie and Hellman’s 1976 work.