Fifty-six years later the name is still open. This page shows what the symbols actually constrain, every approach thrown at them, the most probable reading and why it can't be proven, and a tool to try a name yourself.
Best-supported is not proven. The case · the arithmetic
Proposed by Robert Graysmith in 2002, endorsed by cryptologist Craig Bauer in Unsolved! (2017). Thirteen letters exactly; the cipher opens with his initials; the only published reading within one symbol of fitting.
| Document | What he got wrong | Why it matters here |
|---|---|---|
| 408 cipher, 31 July 1969 | Four symbols used for two different letters each (one symbol serves both T and O, another S and A, another E and S, another A and S). Plaintext spellings "anamal", "forrest", "experence", "sloi down", "paradice", "thae". The final eighteen symbols decode to nothing readable. | Symbol-level slips at a rate of about one per hundred, in the cipher he had the most time to prepare. |
| 340 cipher, 8 November 1969 | The 2020 solvers had to correct several substitution slips ("lots of fan", "e now have" for "I now have"), shift a misaligned block in the second section by one position, and relocate a stranded "LIFE IS" fragment to read the end. | Even his most careful cipher needed error correction to be read at all. |
| "My name is" letter, 20 April 1970 | "cerous", "wipped out", "meannie", "doo", "teritory", "buss bomb was a dud". | The very letter carrying Z13 is written with the same looseness. |
| Map letter with Z32, 26 June 1970 | "promiced", "anilating", "School Buss", "untill", "punnished them in an another way". | Same hand, same month as the second unsolved cipher. |
| Other letters, 1969 to 1974 | "Christmass", "shure", "complane", "saterical comidy", "soloving", "lovly", "cheep", "wont" for "won't", scores that do not add up. | Whether affectation or habit, the pattern is consistent: he did not proofread. |
The arithmetic: at roughly one slip per hundred symbols, the chance of at least one slip in thirteen is about one in five, and about one in eight at the lower end. A thirteen-symbol cipher with exactly one bad symbol is therefore ordinary for this author, not an anomaly. It cuts both ways: it rescues ALFRED E NEUMAN, and it also means half a million other name forms fit "with one error".
Against it: no letter names Mad, and with thousands of near-fits, choosing the famous one after the fact is a selection effect. The claim is narrow: of all proposed readings, this alone matches his habits, initials, error rate and humour at once. Fifty-five other taunts and gag names were tested; the best fails three rules.

Thirteen symbols, eight distinct, mailed after the words "My name is". In a homophonic cipher the only hard information is that repeated symbols share a letter: 1=12, 3=11, 5=7=9, 8=13. Nothing else is fixed.

Sent with a Phillips 66 map, Mt. Diablo circled: "The map coupled with this code will tell you where the bomb is set." Thirty-two symbols, twenty-nine distinct, three repeats: about 12 bits of structure on a 40-plus-bit message, so roughly a billion readings survive.
Thirteen letters. The tool fills the slots, checks the four rules, and lets you toggle the readings a careful adversary might have used.
A random thirteen-letter string passes about once in 700,000 tries; our lists still hold 26,472 US and 15,745 international name forms that pass, because there are hundreds of millions of combinations. Passing is necessary, never sufficient.
| # | Hypothesis | What was done | Result | Status |
|---|---|---|---|---|
| 1 | Plain homophonic substitution of a name | SSA first names 1890 to 1955, Census surnames, every form, both directions | 26,472 forms fit | open, underdetermined |
| 2 | An English phrase | Two and three word phrases, 60,000-word vocabulary | 8,714 phrases fit | open, underdetermined |
| 3 | Reuses the Z408 or Z340 key | Keys rebuilt, 60 reading orders | Gibberish | rejected |
| 4 | Letters stand for themselves or are shifted | Identity, Atbash, 25 Caesar shifts | No name or word fits | rejected |
| 5 | A known suspect's name | 33 suspects, 150 variants, with errors and nulls | Nothing within one symbol | rejected |
| 6 | Z13 and Z32 share a key | Five shared symbols joined against 16,387 Z32 sentences | 217 meaningless pairs | no signal |
| 7 | One encoding error | One rule relaxed | 609,307 forms; ALFRED E NEUMAN the only published reading this close | open |
| 8 | Circled symbols are nulls or separators | 10-letter name; 4+initial+initial+4 | 13,298 forms; no suspect | open, very loose |
| 9 | Transposed before substitution | Rail fence, 2 to 5 rails | 10,508 forms; 41 people; none plausible | no signal |
| 10 | One circled symbol is a different glyph | Each as the odd one; all three different | 186 men of plausible age | open, see map |
| 11 | Foreign-born | 17-country lists | 15,745 more forms; one more person, a woman | no signal |
| 12 | Z32 reads "N radians, M inches, direction" | 142 million sentences generated | 16,387 fit, both published readings included | open, underdetermined |
| 13 | Z32 yields to statistics | Annealing, 120 restarts, quadgram model | 120 different "solutions" | below unicity distance |
| 14 | Real people with fitting names, placed | Death files 2013 and 2010, ZIP-coded | 1,283 people, mapped | done |
Each pin is a deceased person whose recorded name fits the cipher under some reading, anonymous, placed at last residence (solid) or at the state that issued their Social Security number (hollow). Crosshairs: the four confirmed attacks, numbered by date; the four attributed cases, lettered; and the Mt. Diablo origin he gave for Z32. Scroll to zoom, drag to pan, hover anything, slide the date.
The confirmed count stopped at five in October 1969. His own went 3, 5, 7, 8, 10 in the "My name is" letter, 12 with the map code, 13, "4-TEEN", "17+", and "37" in 1974. Hover a point for the letter.
| # | Date | Place | Victims | Status | Confirmed dead after | Zodiac's count at the time |
|---|
His postscript said the map code "concerns radians and # inches along the radians". 142 million sentences of that shape were generated and filtered against the cipher's three repeats. Every one below is a valid decryption. Both published readings are in the list.
Unicity. U = H(K)/D, D = log₂26 − H(L). A homophonic key with m symbols has H(K) ≤ 4.70 m bits: 37.6 for Z13, 136.3 for Z32. Prose carries 1.3 to 1.5 bits per letter, so D ≈ 3.2 to 3.4: U(Z13) ≈ 11 to 12, U(Z32) ≈ 40 to 43. Letters in American names have unigram entropy 4.23 bits, so for a name D ≤ 0.47 and U(Z13) ≥ 80.
Chance of a fit. Two positions agree with probability Σfᵢ², three with Σfᵢ³. From the name lists, 0.0642 and 0.00518. Z13: three pairs and one triple, P = 0.0642³ × 0.00518 = 1.37 × 10⁻⁶. Z32: three pairs, P = 0.0656³ = 2.8 × 10⁻⁴. A Monte Carlo of two million random name-like strings produced one Z13 fit.
Expected versus observed. 110,689,423 thirteen-letter first+last strings × 1.37 × 10⁻⁶ ≈ 152 expected; 59 observed, fewer because real names repeat letters less freely. An excess would have been the signature of a cipher built around a real name. There is none.
What would overturn this. A name that fits with zero assumptions and is tied to the case by evidence that has nothing to do with the cipher. Then the fit is confirmation, never discovery.
Linkage. Every fitting form was matched against the Social Security Death Master File of 31 May 2013 (88.7 million records) on exact surname and first name, with middle initial where required. Last-residence ZIPs joined from the 17 November 2010 edition (32,553 of 33,950 candidate records); coordinates from the Census 2020 ZCTA gazetteer. Tiers combine assumptions, sex of first name from SSA birth records, age in 1969, and geography.
Limits. Deaths after May 2013, unreported deaths and people without a Social Security number are invisible. Nicknames, transliterations and names absent from the lists are missed. Last residence is not 1969 residence; the issuing state is where someone first worked. None of these creates a false positive; all could hide a true one, so the result is a bound, not a verdict.
Data. Transcriptions from the letter scans, cross-checked with David Oranchak's Zodiac Killer Ciphers wiki. Z408 key from the Harden solution; Z340 key by reproducing the 2020 Blake, Van Eycke and Oranchak transposition. First names: SSA 1890 to 1955, Census 1990, a 17-country list (22,202). Surnames: Census 2010 plus the same list (211,789). English quadgrams and Google unigram and bigram counts for scoring.
Sources. C. E. Shannon, "Communication Theory of Secrecy Systems", 1949 · Oranchak, Blake, Van Eycke, Z340 solution, Dec 2020 · C. P. Bauer, Unsolved!, 2017 · F. Foxon, IACR ePrint 2023/982 · Zodiac Killer Ciphers wiki · Cipher Mysteries on the Neuman mismatch · Death Master File, Internet Archive. Every hypothesis is a script that can be rerun from these inputs.
| Step | Question | Done | Produced |
|---|---|---|---|
| 01 | What exactly did he write? | Both ciphers transcribed from scans, reconciled with the standard transcription, glyphs compared | 13 and 32 symbols, 8 and 29 distinct |
| 02 | Do we have his keys? | Z408 key from the Harden plaintext; Z340 key by reproducing the 2020 transposition | 54 and 63 symbol keys |
| 03 | Did he reuse them? | Both keys, 60 reading orders | No. Fresh keys. |
| 04 | Which names fit at all? | Every name form from US lists, both directions | 26,472 forms |
| 05 | Is a suspect in there? | 33 suspects, 150 variants, letter transforms | None, none within one symbol |
| 06 | What if he slipped or tricked? | One error, nulls, separators, rail fence, odd glyph | Hundreds of thousands of forms, no suspect |
| 07 | What if he was foreign-born? | 17-country lists | 15,745 more forms |
| 08 | Were any real people? | 88.7 million death records scanned | 1,283 people |
| 09 | Where did they live? | ZIPs from the 2010 file, mapped | 877 placed by residence |
| 10 | Who is worth a second look? | Adversary-aware tiers | 2 High, 12 Medium, none above chance |
| 11 | What does Z32 say? | 142 million map sentences filtered | 16,387 valid readings |
| 12 | Unsolvable by design? | Unicity computed, chance rate checked against observed fits | Yes. Observed equals expected. |