April 18, 2026
When the internet’s locksmith dies
Michael Rabin Has Died
Internet mourns “father of modern secrets” as programmers cry, reminisce and ask for a black ribbon
TLDR: Legendary mathematician Michael O. Rabin, whose work underpins much of modern online security, has died at 94. The tech community is treating it like the loss of a hidden superhero, with heartfelt tributes, calls for a black‑ribbon memorial, and stories of his unforgettable classroom presence.
News that Michael O. Rabin has died at 94 hit the tech world like a quiet earthquake, and the online comments turned into a digital memorial service. Rabin wasn’t a celebrity to the general public, but to programmers and cryptography geeks he was the man who helped invent how we keep things secret on the internet. One commenter flat-out ranked him just behind the pioneers of public‑key encryption — basically the math that makes online banking, messaging and passwords possible — while noting how overshadowed he was by the more famous RSA trio.
The emotional core of the thread? Respect mixed with a bit of outrage that such a giant isn’t a household name. People called him “the great soul” and wrote blessings, while another user demanded the site slap a black ribbon on the front page, turning a normally dry tech forum into a shiva‑style wake. The standout moment came from someone who casually dropped, like a humblebrag eulogy, that they’d actually taken his intro to cryptography class and described him as an “old‑school chalkboard” legend — the kind of professor movies try to copy. There’s no big flame war here, just a rare internet moment: geeks united in grief, reverence, and a shared feeling that the world owes this quiet math hero a louder goodbye.
Key Points
- •Michael O. Rabin (1931–2026) was an Israeli mathematician and computer scientist, co-recipient with Dana Scott of the 1976 ACM Turing Award for work on computational complexity and automata theory.
- •Rabin was born in Breslau (now Wrocław, Poland) in 1931, emigrated with his family to Mandatory Palestine in 1935, and pursued early studies in Haifa and Jerusalem, eventually earning a Ph.D. from Princeton University in 1956 under Alonzo Church.
- •His academic career included positions at the University of California, Berkeley, MIT, the Hebrew University of Jerusalem (where he became head of the Institute of Mathematics at age 29), and Harvard University as Gordon McKay Professor of Computer Science.
- •Rabin and Dana Scott wrote the influential paper “Finite Automata and Their Decision Problems” while doing summer research for IBM at the Lamb Estate in Westchester County, New York, and Rabin later authored “Degree of Difficulty of Computing a Function and Hierarchy of Recursive Sets.”
- •Rabin is credited with numerous major contributions such as the Rabin cryptosystem, Rabin–Karp string search algorithm, Adian–Rabin theorem, Miller–Rabin primality test, nondeterministic finite automata, and oblivious transfer, and received many prestigious awards including the Weizmann Prize, Turing Award, Israel Prize, EMET Prize, Dan David Prize, and Dijkstra Prize.