The Zodiac Z32 Cipher as a Formally Underdetermined Instruction System

The Zodiac Z32 Cipher as a Formally Underdetermined Instruction System Abstract The Zodiac Killer’s so-called Z32 cipher has been repeatedly interpreted as encoding a physical location through the use of a map and radians. Most proposed solutions presume solvability without first defining what solvability requires. This paper takes a different approach. Using a locked transcription and an explicit operational definition of solvability, Z32 is analyzed as an instruction system rather than a substitution cipher. The analysis compares the degrees of freedom introduced by plausible interpretations with the constraints actually provided by the cipher. The result is a negative but rigorous finding: Z32 is underdetermined by construction. The number of independent geometric and symbolic freedoms exceeds the constraints supplied, producing an infinite solution space. Under reasonable assumptions, Z32 cannot uniquely encode a location, a geometric construction, or a finite terminating procedure. This result reframes Z32 not as a failed or unsolved cipher, but as a technical artifact whose structure prevents closure. 1. Introduction The Zodiac Killer sent multiple cryptographic messages to the press between 1969 and 1970. Among them, the cipher commonly referred to as Z32 occupies a peculiar position. Unlike earlier substitution ciphers, Z32 explicitly references an external map and the use of radians, leading many researchers to assume that it encodes a set of geometric instructions pointing to a buried bomb or other physical location. Despite decades of proposed solutions, no consensus result has emerged. Most attempts share a common flaw: they assume Z32 is solvable in a literal sense without first establishing whether the cipher contains sufficient information to uniquely determine an outcome. This paper addresses that omission. Rather than attempting to decode Z32, it evaluates whether Z32 can, in principle, encode a unique solution at all. The central claim is narrow and structural. Z32 lacks the constraints necessary to collapse its interpretation into a single equivalence class. As a result, it cannot uniquely specify a location or terminating procedure under reasonable analytical assumptions. 2. Transcription and Symbol Model 2.1 Locked Transcription The analysis is based on the following fixed transcription of Z32, preserving symbol order and line breaks: L-C ■ L-J L-I ■ L-O L-K L-T■ L-A L-M L-F L-■ L-U■ L-O L-R L-T L-G L-X ■ L-F L-D L-V L-2■ ■■ L-H L-C L-E L-L ■ L-P L-W ■ 2.2 Symbol Assumptions All symbols are treated as atomic and orientation-specific. Inverted forms are intrinsic symbols, not base characters modified by diacritics. No symbol is assumed to be alphabetic, numeric, or linguistic in function. No legend or key is assumed. 3. Operational Definition of Solvability For the purposes of this analysis, Z32 is considered solvable if it uniquely determines at least one of the following: a geometric construction, a physical location, or a finite, terminating procedure. A solution is valid only if it reduces the space of admissible interpretations to one equivalence class or fewer under reasonable transformations such as rotation, translation, reflection, and scaling. 4. Degrees of Freedom Introduced by Z32 4.1 Geometric Degrees of Freedom Any interpretation of Z32 as a map-based instruction system necessarily introduces unconstrained variables including choice of origin, orientation of the reference axis, handedness, scale, and dimensionality. 4.2 Symbolic Degrees of Freedom Additional freedoms arise from symbol interpretation, including assignment of symbols to roles such as direction or magnitude, numeric interpretation, sequencing rules, and interpretation of orientation as semantic or decorative. 5. Constraints Provided by Z32 Z32 supplies only a limited set of internal constraints: a fixed sequence length of thirty-two symbols, specific symbol repetition counts, two boundary markers formed by the white triangle symbol, and orientation encoded without an accompanying legend. Critically, Z32 does not specify a reference origin, reference axis, units or scale, or a termination or validation condition. 6. Constraint Versus Freedom Analysis For an instruction system to uniquely determine an outcome, the number of constraints must equal or exceed the number of independent degrees of freedom. In Z32, the constraints are discrete and minimal, while the freedoms are numerous and continuous. Because the constraints do not sufficiently restrict the introduced freedoms, the solution space remains infinite. Multiple incompatible interpretations can satisfy all internal constraints simultaneously without contradiction. 7. Invariance Failure A valid geometric instruction should exhibit invariance under a limited set of admissible transformations. In Z32, no invariant structure persists across reasonable choices of origin, rotation, or scale. Transformations generate divergent outcomes without violating any explicit constraint. 8. Termination and Validation Failure Z32 contains no checksum, stopping rule, or external confirmation mechanism. Any interpretation that appears to terminate does so only through arbitrary analyst choice. A procedure that lacks an intrinsic termination condition cannot qualify as a finite instruction set. 9. Comparison with Z13 The contrast between Z32 and the Zodiac’s shorter Z13 cipher is instructive. Z13 is implicitly constrained by linguistic framing, identity semantics, and extreme length pressure, making it amenable to constraint testing. Z32 lacks comparable closure conditions. 10. Discussion The findings presented here do not imply that Z32 is incomplete or corrupted. Instead, they indicate that Z32 is structurally incapable of delivering what it appears to promise. Negative results of this kind are analytically valuable because they eliminate false problem framings. 11. Conclusion Z32 does not encode a uniquely solvable geometric instruction, location, or terminating procedure. This conclusion follows directly from a comparison of constraints and degrees of freedom and does not depend on speculative decoding. Z32 is best understood as a formally underdetermined system whose structure prevents closure.