HR33 Research Report: Alienese Arithmetic Audit, Cryptographic Context, and Pedagogical Datasets

Full report

On this page

Alienese Arithmetic Audit and Cryptographic Context

An exhaustive audit of the version 1.2.0 build’s inherited arithmetic records reveals critical mathematical inaccuracies in the claimed decoding values for the fictional Alienese cipher, specifically the advanced variant known as Alien Language 2 (AL2). The inherited dataset provided five plaintext-ciphertext pairs—ABC resolving to ACE, ZYX resolving to ZWT, NIBBLER resolving to NVSUVOP, BENDER resolving to BFQTDV, and PIZZA resolving to PXWWV—as verified examples of the AL2 encoding scheme1. However, the strict application of the authentic mathematical rules utilized by the production staff demonstrates that every inherited ciphertext claim is incorrect1. The errors in the inherited records indicate a flawed historical implementation of the cipher's state mechanics, necessitating a complete reconstruction of the pedagogical datasets intended for the Hulurama catalog.

The authentic AL2 cipher is a modified ciphertext autokey cipher operating on modulo-26 arithmetic, designed by series writer Jeff Westbrook2. The cipher was introduced to elevate the complexity of background jokes after the show's original substitution cipher, Alien Language 1 (AL1), was cracked by viewers almost immediately following the series premiere2. Showrunner David X. Cohen, who holds a bachelor's degree in physics from Harvard University and a master's degree in theoretical computer science from the University of California, Berkeley, expressed disappointment at the rapid deciphering of AL12. In response, Westbrook utilized his own extensive academic background—holding a doctorate in computer science from Princeton University and having previously worked as an algorithms researcher at AT\&T Laboratories—to construct a mathematically robust encoding system5. AL2 first appeared on screen in the episode "The Day the Earth Stood Stupid" (production code 3ACV07), where it was inscribed on glowing Rosetta Stone-style obelisks on the Nibblonian homeworld of Eternium2.

To comprehend the sophistication of Westbrook's AL2 design, it is necessary to contextualize it within the broader history of cryptography. The autokey cipher mechanism was initially conceptualized in the sixteenth century by the Italian mathematician Girolamo Cardano9. Cardano's early autokey system utilized the plaintext itself as the keystream, but it contained a fatal defect because it lacked a primer, leaving decipherers in the exact same position as cryptanalysts when attempting to identify the first word9. In 1553, Giovan Battista Bellaso published a cryptographic manual introducing the tabula recta, a reciprocal table of alphabets that greatly simplified polyalphabetic substitution11. This concept was later refined in 1586 by the French cryptographer Blaise de Vigenère, who successfully integrated a primer letter with Cardano's autokey concept, creating a functional text-autokey cipher10. For centuries, periodic polyalphabetic ciphers (such as the standard repeating-key Vigenère cipher) were considered unbreakable until figures like Charles Babbage and Friedrich Kasiski developed frequency analysis techniques based on the repetitive distances between identical ciphertext segments, a process now known as Kasiski examination12. The autokey cipher evades Kasiski examination entirely because its keystream does not repeat, making it aperiodic and significantly more secure against nineteenth-century cryptanalytic methods10.

Westbrook's AL2 operates as a continuous additive stream cipher over a modulo-26 finite field, functioning mathematically similarly to an autokey cipher where the evolving state serves as the keystream2. The behavior of such stream ciphers aligns closely with the principles established by Claude Shannon in his seminal 1949 paper, "Communication Theory of Secrecy Systems"18. Shannon defined the twin pillars of cryptographic security as confusion, which obscures the relationship between the plaintext and the ciphertext, and diffusion, which dissipates the statistical structure of the plaintext across the ciphertext20. Because AL2 relies on the cumulative sum of all preceding characters, it achieves profound diffusion; a change to a single plaintext character alters every subsequent ciphertext character in the string. Furthermore, Shannon's communication theory highlights the concept of error propagation in self-synchronizing and continuous-state stream ciphers22. In the context of AL2, error propagation acts as a severe barrier to manual decryption; if a viewer miscalculates a single symbol, the local mathematical state becomes corrupted, rendering the remainder of the decoded message completely unintelligible14.

The integration of advanced mathematical principles into the show's narrative fabric is a hallmark of the writing staff, which includes highly credentialed individuals such as Ken Keeler (holding a doctorate in applied mathematics from Harvard) and Bill Odenkirk (holding a doctorate in inorganic chemistry from the University of Chicago)5. The staff famously adheres to a principle written on the writers' room whiteboard: "Science Shall Not Overrule Comedy," yet they consistently embed authentic, rigorously verified scientific theorems into their scripts26. A prominent example occurs in the episode "The Prisoner of Benda," where a mind-switching apparatus is restricted from swapping the same pair of bodies twice27. To resolve the resulting chaotic permutation of characters' minds, Keeler authored an original mathematical proof in symmetric group theory28. Now known in academic literature as the Futurama Theorem or Keeler's Theorem, the proof demonstrates that any arbitrary mind-scrambling permutation can be undone by introducing exactly two "outsider" bodies that have not previously participated in the swaps27. Keeler's Theorem was explicitly displayed on screen during the episode, earning Keeler a Writers Guild of America Award and marking a rare instance wherein a novel mathematical theorem was authored specifically to resolve a television sitcom plot27.

This culture of extreme academic precision dictates that the AL2 cipher must be evaluated with strict adherence to its mathematical boundaries. The audit of the version 1.2.0 inherited vectors (ABC, ZYX, NIBBLER, BENDER, PIZZA) reveals that the legacy calculations failed on two fundamental mathematical fronts1. First, the legacy script incorrectly utilized a one-based indexing system (where A=1, B=2, C=3) rather than the required zero-based indexing system (where A=0, B=1, C=2)17. Zero-based indexing is a mandatory requirement in modulo arithmetic to ensure that the identity element functions correctly during wraparound17. Second, the legacy script incorrectly advanced the mathematical state by adding the previous plaintext integer to the current plaintext integer, entirely defeating the autokey dependency chain1. The authentic AL2 specification strictly dictates that the state variable must be updated to the previously calculated ciphertext integer, ensuring that the cipher acts upon the transmitted data stream rather than the hidden plaintext stream31.

The corrected encodings, generated through an independently verified Python reference implementation, prove the invalidity of the inherited claims1. For the plaintext "ABC", the correct modulo-26 autokey encoding yields "ABD", exposing the inherited claim of "ACE" as a mathematical impossibility1. Similarly, "ZYX" encodes correctly to "ZXU" (not "ZWT"), "NIBBLER" encodes to "NVWXIMD" (not "NVSUVOP"), "BENDER" encodes to "BFSVZQ" (not "BFQTDV"), and "PIZZA" encodes to "PXWVV" (not "PXWWV")1.

By auditing these vectors, we re-establish the canonical accuracy required for the Hulurama catalog. The findings necessitate the complete removal of the legacy encoding scripts and the integration of a mathematically rigorous pedagogical dataset that accurately reflects Jeff Westbrook's original modulo-26 autokey design.

Autokey Cipher Tutorial for Alienese Computations

The mathematical architecture of Alien Language 2 requires a precise understanding of modular arithmetic, state persistence, and ASCII character normalization. The cipher operates as a sequential, state-dependent transformation. Every alphabetical character in a given string is converted into a numerical integer, modified by a cumulative running total from the preceding characters, mathematically bounded to fit within the twenty-six-letter alphabet, and then converted back into a corresponding letter2. This tutorial establishes the definitive computational specification for encoding and decoding AL2 text, providing the foundational logic required to execute accurate cryptographic round trips.

The first critical step in the AL2 process is the establishment of the integer mapping. The twenty-six letters of the standard Latin alphabet are assigned integer values from 0 through 25, utilizing a strict zero-based index3. The mapping dictates that A is equal to 0, B is equal to 1, C is equal to 2, and continuing sequentially until Z, which is equal to 253. The zero-based index is a non-negotiable requirement for modulo arithmetic; assigning A to 1 would destroy the mathematical identity property, preventing the cipher from wrapping smoothly around the alphabet boundary without skipping letters17. Prior to any integer mapping, all lowercase letters (a–z) within the source string must be normalized to their uppercase equivalents (A–Z)1. This ensures that the cipher operates uniformly regardless of the original typographic casing.

The core of the AL2 cipher is its persistent state variable, referred to as the previous ciphertext state. This integer variable tracks the cumulative mathematical history of the string. At the very beginning of a string, before any letters are processed, the state variable must be explicitly initialized to 01. This initialization guarantees that the first encoded character of any AL2 string will always be identical to its plaintext counterpart, as the addition of zero results in no numerical shift31.

To execute the encoding process, the cipher iterates through the normalized plaintext string character by character. When an alphabetical character is encountered, its mapped integer value (denoted as [Figure omitted from source export]) is extracted. This plaintext integer is then added to the current value of the state variable. The raw sum is subjected to a modulo 26 operation, which divides the sum by 26 and returns only the remainder2. The mathematical formula for encryption is expressed as [Figure omitted from source export]1. The resulting integer [Figure omitted from source export] is mapped back to its corresponding alphabetical character to produce the ciphertext output1. Crucially, before the cipher proceeds to the next character in the string, the state variable must be updated to equal the value of the newly calculated ciphertext integer [Figure omitted from source export]1. This specific mechanism—updating the state with the ciphertext rather than the plaintext—is what classifies AL2 as a ciphertext autokey cipher, fundamentally separating it from standard Vigenère implementations17.

The decoding process reverses the mathematical flow to extract the hidden plaintext. The cipher iterates through the ciphertext string, extracting the integer value of each alphabetical character (denoted as [Figure omitted from source export]). To isolate the original plaintext integer, the current state variable must be subtracted from the ciphertext integer. Because subtraction can yield a negative number, the constant 26 is added to the result prior to the modulo operation to ensure a positive integer output3. The mathematical formula for decryption is expressed as [Figure omitted from source export]1. The resulting integer [Figure omitted from source export] maps to the decoded plaintext character. Just as in the encoding process, the state variable must be immediately updated. However, the state is always updated to equal the ciphertext integer [Figure omitted from source export] that was just processed, never the newly extracted plaintext integer [Figure omitted from source export]1. This symmetry in state management ensures that both the encoder and the decoder remain perfectly synchronized along the same mathematical chain22.

A vital component of the AL2 transcription contract governs the handling of non-alphabetical characters1. Alienese signage frequently includes spaces, punctuation marks, digits, line breaks, and other typographic symbols. Whenever the algorithm encounters a character outside the A–Z range, it acts as a transparent passthrough1. The non-alphabetical character is appended directly to the output string without any numerical conversion. More importantly, the state variable remains entirely unchanged during a passthrough event1. The state is not reset to zero at word boundaries, nor is it incremented; it simply holds its previous ciphertext integer value in suspended animation until the next alphabetical character appears in the sequence1. This continuous state persistence across spaces is a critical security feature, as it prevents cryptanalysts from isolating individual words and analyzing them as independent cryptographic blocks1.

To demonstrate the full encoding process, consider the plaintext string "BENDER 3000". First, the string is normalized and the state is initialized to 0\. The algorithm encounters the letter 'B'. 'B' maps to integer 1\. The calculation is [Figure omitted from source export], yielding 1\. The integer 1 maps to 'B'. The state is updated to 1\. Next is 'E', which maps to 4\. The calculation is [Figure omitted from source export], yielding 5\. The integer 5 maps to 'F'. The state is updated to 5\. Next is 'N', which maps to 13\. The calculation is [Figure omitted from source export], yielding 18\. The integer 18 maps to 'S'. The state is updated to 18\. Next is 'D', which maps to 3\. The calculation is [Figure omitted from source export], yielding 21\. The integer 21 maps to 'V'. The state is updated to 21\. Next is 'E', which maps to 4\. The calculation is [Figure omitted from source export], yielding 25\. The integer 25 maps to 'Z'. The state is updated to 25\. Next is 'R', which maps to 17\. The calculation is [Figure omitted from source export], which equals 42\. Taking [Figure omitted from source export] yields 16\. The integer 16 maps to 'Q'. The state is updated to 16\. Next, the algorithm encounters a space. The space is passed to the output directly. The state remains 16\. Finally, the algorithm encounters the digits '3000'. Digits are non-alphabetical, so they are passed through without modification. The state remains 16\. The fully encoded ciphertext is "BFSVZQ 3000".

To demonstrate the decoding process, consider the ciphertext string "ZXU". The state is initialized to 0\. The algorithm encounters 'Z', mapping to 25\. The calculation is [Figure omitted from source export], yielding 25\. The integer 25 maps to 'Z'. The state is updated to the ciphertext integer, which is 25\. Next is 'X', mapping to 23\. The calculation is [Figure omitted from source export], which simplifies to [Figure omitted from source export], yielding 24\. The integer 24 maps to 'Y'. The state is updated to the ciphertext integer, which is 23\. Next is 'U', mapping to 20\. The calculation is [Figure omitted from source export], which simplifies to [Figure omitted from source export], yielding 23\. The integer 23 maps to 'X'. The state is updated to the ciphertext integer, which is 20\. The fully decoded plaintext is "ZYX".

Understanding these mechanics is essential for generating accurate machine-readable vectors and verifying the integrity of the pedagogical puzzles presented in the Hulurama catalog. Strict adherence to the modulo-26 state dependencies ensures that the alien linguistics depicted on screen can be replicated precisely by researchers and hobbyists alike.

Step-by-Step Worked Examples

The following table presents six meticulously constructed worked examples, demonstrating the AL2 arithmetic across diverse linguistic scenarios. These examples isolate edge cases such as rapid modulo wraparound, consecutive repeating letters, and passthrough punctuation.

Independent Practice Puzzles

The following collection provides twelve independently generated practice puzzles to facilitate mastery of the AL2 arithmetic sequence. The exercises alternate between encoding and decoding tasks, scaling gradually in complexity from short names to full multisyllabic vocabulary.

Troubleshooting and Technical Inquiries

The intricacies of modulo-26 autokey cryptography frequently induce computational errors during manual calculation. The following technical inquiries address the most pervasive systemic misunderstandings associated with the AL2 transcription framework.

Q1: Why does a long sequence of identical plaintext letters produce a descending alphabetical ciphertext? When a plaintext integer represents a high value, the continuous addition causes rapid and repeated mathematical wraparound. The letter 'Z' carries an integer value of 25\. Adding 25 under a modulo-26 mathematical boundary is algebraically equivalent to subtracting 1\. Therefore, repeatedly encoding the letter 'Z' results in a ciphertext stream that systematically moves backward through the alphabet (e.g., 'Z', 'Y', 'X', 'W', 'V') as the state continuously decreases by a factor of 1\.

Q2: Should the state variable be reset to zero at the beginning of a new word? No. The state variable must persist continuously through spaces, line breaks, and all forms of punctuation until the absolute end of the string1. Resetting the state at word boundaries fundamentally breaks the AL2 cipher specification. If the state were reset at spaces, cryptanalysts could easily isolate individual words, deduce the length of common words (such as "THE"), and break the cipher through brute-force dictionary attacks. Continuous state persistence is the cipher's primary defense mechanism against structural frequency analysis.

Q3: How are lowercase letters handled by the cipher algorithm? The strict AL2 transcription contract specifies that all ASCII letters (a–z) must be mathematically normalized to their uppercase equivalents (A–Z) prior to any encryption or decryption logic1. Because the cipher relies on a 26-character integer map, distinguishing between cases would require a 52-character map, which AL2 does not support. Therefore, all valid alphabetical inputs will result in uppercase outputs.

Q4: What happens when an accented character, foreign symbol, or emoji is encountered in the string? Any character existing outside the standard ASCII Latin alphabet (A–Z, a–z) is treated strictly as a passthrough symbol1. It is placed into the resulting string without any mathematical modification, and it does not affect the running state variable. A character such as the accented 'É' will not be converted to 'E', nor will it advance the integer stream; it is entirely ignored by the modulo arithmetic engine.

Q5: Why did the inherited site data claim that the plaintext "ABC" translates to "ACE"? The legacy dataset utilized a deeply flawed execution script that incorrectly advanced the mathematical state using the previous plaintext integer rather than the previous ciphertext integer1. Additionally, the legacy script utilized a 1-based alphabet index (where A=1, B=2, C=3)1. Under those erroneous mathematical rules, B(2) \+ A(1) \= C(3), and C(3) \+ B(2) \= E(5), leading to the incorrect "ACE" output. This error demonstrates a fundamental misunderstanding of autokey cryptography.

Q6: What is the most common computational error made during manual AL2 decoding? The most frequent error occurs when the decipherer fails to update the state variable to the ciphertext integer16. A common cognitive mistake is subtracting the previous plaintext integer from the current ciphertext integer. To maintain cryptographic synchronization, the state must always reflect the integer value of the ciphertext character that was just processed, ensuring both the encoder and decoder are riding the exact same mathematical wave1.

Q7: Is it possible to decode an AL2 message starting from the middle of a string? No. AL2 is a highly state-dependent stream cipher22. Because the true mathematical value of the state at character index [Figure omitted from source export] relies absolutely on the ciphertext character at index [Figure omitted from source export], an observer must possess the preceding ciphertext character to successfully decode any given letter22. If a string fragment is isolated without its immediately preceding character, exactly 26 possible plaintext translations exist for the first letter of that fragment, rendering mid-string decryption impossible without exhaustive brute-force testing of all 26 initial states.

Q8: Why does the very first character of an AL2 ciphertext always perfectly match the first character of the plaintext? Because the state variable is strictly initialized to zero at the beginning of the transmission, the very first mathematical calculation is always [Figure omitted from source export]. Consequently, [Figure omitted from source export] will inevitably equal [Figure omitted from source export]31. The first character of the string is never mathematically obscured, serving as the primer for the subsequent autokey chain14.

Machine-Readable Records and Deliverables

 

 

 

JSON

\[ { "file\_name": "HR33-corrections.json", "content": \[ { "plaintext": "ABC", "inherited\_ciphertext": "ACE", "calculated\_encoding": "ABD", "decoded\_inherited\_ciphertext": "ACC", "encoding\_match": false, "encode\_state\_table": \[ {"step": 1, "input\_char": "A", "normalized\_p": "A", "p\_val": 0, "prev\_c": 0, "c\_val": 0, "output\_char": "A"}, {"step": 2, "input\_char": "B", "normalized\_p": "B", "p\_val": 1, "prev\_c": 0, "c\_val": 1, "output\_char": "B"}, {"step": 3, "input\_char": "C", "normalized\_p": "C", "p\_val": 2, "prev\_c": 1, "c\_val": 3, "output\_char": "D"} \], "decode\_state\_table": \[ {"step": 1, "input\_char": "A", "normalized\_c": "A", "c\_val": 0, "prev\_c": 0, "p\_val": 0, "output\_char": "A"}, {"step": 2, "input\_char": "C", "normalized\_c": "C", "c\_val": 2, "prev\_c": 0, "p\_val": 2, "output\_char": "C"}, {"step": 3, "input\_char": "E", "normalized\_c": "E", "c\_val": 4, "prev\_c": 2, "p\_val": 2, "output\_char": "C"} \] }, { "plaintext": "ZYX", "inherited\_ciphertext": "ZWT", "calculated\_encoding": "ZXU", "decoded\_inherited\_ciphertext": "ZXX", "encoding\_match": false, "encode\_state\_table": \[ {"step": 1, "input\_char": "Z", "normalized\_p": "Z", "p\_val": 25, "prev\_c": 0, "c\_val": 25, "output\_char": "Z"}, {"step": 2, "input\_char": "Y", "normalized\_p": "Y", "p\_val": 24, "prev\_c": 25, "c\_val": 23, "output\_char": "X"}, {"step": 3, "input\_char": "X", "normalized\_p": "X", "p\_val": 23, "prev\_c": 23, "c\_val": 20, "output\_char": "U"} \], "decode\_state\_table": \[ {"step": 1, "input\_char": "Z", "normalized\_c": "Z", "c\_val": 25, "prev\_c": 0, "p\_val": 25, "output\_char": "Z"}, {"step": 2, "input\_char": "W", "normalized\_c": "W", "c\_val": 22, "prev\_c": 25, "p\_val": 23, "output\_char": "X"}, {"step": 3, "input\_char": "T", "normalized\_c": "T", "c\_val": 19, "prev\_c": 22, "p\_val": 23, "output\_char": "X"} \] }, { "plaintext": "NIBBLER", "inherited\_ciphertext": "NVSUVOP", "calculated\_encoding": "NVWXIMD", "decoded\_inherited\_ciphertext": "NIXCBTB", "encoding\_match": false, "encode\_state\_table": \[ {"step": 1, "input\_char": "N", "normalized\_p": "N", "p\_val": 13, "prev\_c": 0, "c\_val": 13, "output\_char": "N"}, {"step": 2, "input\_char": "I", "normalized\_p": "I", "p\_val": 8, "prev\_c": 13, "c\_val": 21, "output\_char": "V"}, {"step": 3, "input\_char": "B", "normalized\_p": "B", "p\_val": 1, "prev\_c": 21, "c\_val": 22, "output\_char": "W"}, {"step": 4, "input\_char": "B", "normalized\_p": "B", "p\_val": 1, "prev\_c": 22, "c\_val": 23, "output\_char": "X"}, {"step": 5, "input\_char": "L", "normalized\_p": "L", "p\_val": 11, "prev\_c": 23, "c\_val": 8, "output\_char": "I"}, {"step": 6, "input\_char": "E", "normalized\_p": "E", "p\_val": 4, "prev\_c": 8, "c\_val": 12, "output\_char": "M"}, {"step": 7, "input\_char": "R", "normalized\_p": "R", "p\_val": 17, "prev\_c": 12, "c\_val": 3, "output\_char": "D"} \], "decode\_state\_table": \[ {"step": 1, "input\_char": "N", "normalized\_c": "N", "c\_val": 13, "prev\_c": 0, "p\_val": 13, "output\_char": "N"}, {"step": 2, "input\_char": "V", "normalized\_c": "V", "c\_val": 21, "prev\_c": 13, "p\_val": 8, "output\_char": "I"}, {"step": 3, "input\_char": "S", "normalized\_c": "S", "c\_val": 18, "prev\_c": 21, "p\_val": 23, "output\_char": "X"}, {"step": 4, "input\_char": "U", "normalized\_c": "U", "c\_val": 20, "prev\_c": 18, "p\_val": 2, "output\_char": "C"}, {"step": 5, "input\_char": "V", "normalized\_c": "V", "c\_val": 21, "prev\_c": 20, "p\_val": 1, "output\_char": "B"}, {"step": 6, "input\_char": "O", "normalized\_c": "O", "c\_val": 14, "prev\_c": 21, "p\_val": 19, "output\_char": "T"}, {"step": 7, "input\_char": "P", "normalized\_c": "P", "c\_val": 15, "prev\_c": 14, "p\_val": 1, "output\_char": "B"} \] }, { "plaintext": "BENDER", "inherited\_ciphertext": "BFQTDV", "calculated\_encoding": "BFSVZQ", "decoded\_inherited\_ciphertext": "BELDKS", "encoding\_match": false, "encode\_state\_table": \[ {"step": 1, "input\_char": "B", "normalized\_p": "B", "p\_val": 1, "prev\_c": 0, "c\_val": 1, "output\_char": "B"}, {"step": 2, "input\_char": "E", "normalized\_p": "E", "p\_val": 4, "prev\_c": 1, "c\_val": 5, "output\_char": "F"}, {"step": 3, "input\_char": "N", "normalized\_p": "N", "p\_val": 13, "prev\_c": 5, "c\_val": 18, "output\_char": "S"}, {"step": 4, "input\_char": "D", "normalized\_p": "D", "p\_val": 3, "prev\_c": 18, "c\_val": 21, "output\_char": "V"}, {"step": 5, "input\_char": "E", "normalized\_p": "E", "p\_val": 4, "prev\_c": 21, "c\_val": 25, "output\_char": "Z"}, {"step": 6, "input\_char": "R", "normalized\_p": "R", "p\_val": 17, "prev\_c": 25, "c\_val": 16, "output\_char": "Q"} \], "decode\_state\_table": \[ {"step": 1, "input\_char": "B", "normalized\_c": "B", "c\_val": 1, "prev\_c": 0, "p\_val": 1, "output\_char": "B"}, {"step": 2, "input\_char": "F", "normalized\_c": "F", "c\_val": 5, "prev\_c": 1, "p\_val": 4, "output\_char": "E"}, {"step": 3, "input\_char": "Q", "normalized\_c": "Q", "c\_val": 16, "prev\_c": 5, "p\_val": 11, "output\_char": "L"}, {"step": 4, "input\_char": "T", "normalized\_c": "T", "c\_val": 19, "prev\_c": 16, "p\_val": 3, "output\_char": "D"}, {"step": 5, "input\_char": "D", "normalized\_c": "D", "c\_val": 3, "prev\_c": 19, "p\_val": 10, "output\_char": "K"}, {"step": 6, "input\_char": "V", "normalized\_c": "V", "c\_val": 21, "prev\_c": 3, "p\_val": 18, "output\_char": "S"} \] }, { "plaintext": "PIZZA", "inherited\_ciphertext": "PXWWV", "calculated\_encoding": "PXWVV", "decoded\_inherited\_ciphertext": "PIZAZ", "encoding\_match": false, "encode\_state\_table": \[ {"step": 1, "input\_char": "P", "normalized\_p": "P", "p\_val": 15, "prev\_c": 0, "c\_val": 15, "output\_char": "P"}, {"step": 2, "input\_char": "I", "normalized\_p": "I", "p\_val": 8, "prev\_c": 15, "c\_val": 23, "output\_char": "X"}, {"step": 3, "input\_char": "Z", "normalized\_p": "Z", "p\_val": 25, "prev\_c": 23, "c\_val": 22, "output\_char": "W"}, {"step": 4, "input\_char": "Z", "normalized\_p": "Z", "p\_val": 25, "prev\_c": 22, "c\_val": 21, "output\_char": "V"}, {"step": 5, "input\_char": "A", "normalized\_p": "A", "p\_val": 0, "prev\_c": 21, "c\_val": 21, "output\_char": "V"} \], "decode\_state\_table": \[ {"step": 1, "input\_char": "P", "normalized\_c": "P", "c\_val": 15, "prev\_c": 0, "p\_val": 15, "output\_char": "P"}, {"step": 2, "input\_char": "X", "normalized\_c": "X", "c\_val": 23, "prev\_c": 15, "p\_val": 8, "output\_char": "I"}, {"step": 3, "input\_char": "W", "normalized\_c": "W", "c\_val": 22, "prev\_c": 23, "p\_val": 25, "output\_char": "Z"}, {"step": 4, "input\_char": "W", "normalized\_c": "W", "c\_val": 22, "prev\_c": 22, "p\_val": 0, "output\_char": "A"}, {"step": 5, "input\_char": "V", "normalized\_c": "V", "c\_val": 21, "prev\_c": 22, "p\_val": 25, "output\_char": "Z"} \] } \] } \]

 

 

 

JSON

\[ { "file\_name": "HR33-test-vectors.json", "content": \[ {"id": 1, "category": "Inherited Vector 1", "input": "ABC", "encoded": "ABD", "roundtrip\_decoded": "ABC", "roundtrip\_matches\_normalized": true}, {"id": 2, "category": "Inherited Vector 2", "input": "ZYX", "encoded": "ZXU", "roundtrip\_decoded": "ZYX", "roundtrip\_matches\_normalized": true}, {"id": 3, "category": "Inherited Vector 3", "input": "NIBBLER", "encoded": "NVWXIMD", "roundtrip\_decoded": "NIBBLER", "roundtrip\_matches\_normalized": true}, {"id": 4, "category": "Inherited Vector 4", "input": "BENDER", "encoded": "BFSVZQ", "roundtrip\_decoded": "BENDER", "roundtrip\_matches\_normalized": true}, {"id": 5, "category": "Inherited Vector 5", "input": "PIZZA", "encoded": "PXWVV", "roundtrip\_decoded": "PIZZA", "roundtrip\_matches\_normalized": true}, {"id": 6, "category": "Empty string edge case", "input": "", "encoded": "", "roundtrip\_decoded": "", "roundtrip\_matches\_normalized": true}, {"id": 7, "category": "Single letter zero-value A", "input": "A", "encoded": "A", "roundtrip\_decoded": "A", "roundtrip\_matches\_normalized": true}, {"id": 8, "category": "Single letter max-value Z", "input": "Z", "encoded": "Z", "roundtrip\_decoded": "Z", "roundtrip\_matches\_normalized": true}, {"id": 9, "category": "Single letter mid-alphabet M", "input": "M", "encoded": "M", "roundtrip\_decoded": "M", "roundtrip\_matches\_normalized": true}, {"id": 10, "category": "Single letter lowercase b", "input": "b", "encoded": "B", "roundtrip\_decoded": "B", "roundtrip\_matches\_normalized": true}, {"id": 11, "category": "Repeated zero-value A (state persistence)", "input": "AAAA", "encoded": "AAAA", "roundtrip\_decoded": "AAAA", "roundtrip\_matches\_normalized": true}, {"id": 12, "category": "Repeated max-value Z (modular wraparound)", "input": "ZZZZ", "encoded": "ZYXV", "roundtrip\_decoded": "ZZZZ", "roundtrip\_matches\_normalized": true}, {"id": 13, "category": "Repeated consecutive E", "input": "BEE", "encoded": "BFJ", "roundtrip\_decoded": "BEE", "roundtrip\_matches\_normalized": true}, {"id": 14, "category": "Repeated consecutive O", "input": "MOO", "encoded": "MAO", "roundtrip\_decoded": "MOO", "roundtrip\_matches\_normalized": true}, {"id": 15, "category": "Repeated L and zero A", "input": "LLAMA", "encoded": "LWWII", "roundtrip\_decoded": "LLAMA", "roundtrip\_matches\_normalized": true}, {"id": 16, "category": "Alternating min/max letters", "input": "AZAZ", "encoded": "AZZY", "roundtrip\_decoded": "AZAZ", "roundtrip\_matches\_normalized": true}, {"id": 17, "category": "Alternating max/min letters", "input": "ZAZA", "encoded": "ZZYY", "roundtrip\_decoded": "ZAZA", "roundtrip\_matches\_normalized": true}, {"id": 18, "category": "Ascending high alphabet values", "input": "XYZ", "encoded": "XVU", "roundtrip\_decoded": "XYZ", "roundtrip\_matches\_normalized": true}, {"id": 19, "category": "Descending high alphabet values", "input": "ZYXWV", "encoded": "ZXUQL", "roundtrip\_decoded": "ZYXWV", "roundtrip\_matches\_normalized": true}, {"id": 20, "category": "Five repeated Zs", "input": "ZZZZZ", "encoded": "ZYXVU", "roundtrip\_decoded": "ZZZZZ", "roundtrip\_matches\_normalized": true}, {"id": 21, "category": "Lowercase consecutive abc", "input": "abc", "encoded": "ABD", "roundtrip\_decoded": "ABC", "roundtrip\_matches\_normalized": true}, {"id": 22, "category": "Mixed case ZYX", "input": "ZyX", "encoded": "ZXU", "roundtrip\_decoded": "ZYX", "roundtrip\_matches\_normalized": true}, {"id": 23, "category": "Title case Nibbler", "input": "Nibbler", "encoded": "NVWXIMD", "roundtrip\_decoded": "NIBBLER", "roundtrip\_matches\_normalized": true}, {"id": 24, "category": "Alternating case bEnDeR", "input": "bEnDeR", "encoded": "BFSVZQ", "roundtrip\_decoded": "BENDER", "roundtrip\_matches\_normalized": true}, {"id": 25, "category": "Mixed case pIzZa", "input": "pIzZa", "encoded": "PXWVV", "roundtrip\_decoded": "PIZZA", "roundtrip\_matches\_normalized": true}, {"id": 26, "category": "Space separated single letters", "input": "A B C", "encoded": "A B D", "roundtrip\_decoded": "A B C", "roundtrip\_matches\_normalized": true}, {"id": 27, "category": "Multi-word uppercase string", "input": "HELLO WORLD", "encoded": "HLWHV RFWHK", "roundtrip\_decoded": "HELLO WORLD", "roundtrip\_matches\_normalized": true}, {"id": 28, "category": "Multi-word lowercase string", "input": "hello world", "encoded": "HLWHV RFWHK", "roundtrip\_decoded": "HELLO WORLD", "roundtrip\_matches\_normalized": true}, {"id": 29, "category": "Multi-word Futurama phrase", "input": "SLURM TASTY", "encoded": "SDXOA TTLEC", "roundtrip\_decoded": "SLURM TASTY", "roundtrip\_matches\_normalized": true}, {"id": 30, "category": "Multi-word classic quote", "input": "GOOD NEWS EVERYONE", "encoded": "GUIL YCYQ YCHVPBNR", "roundtrip\_decoded": "GOOD NEWS EVERYONE", "roundtrip\_matches\_normalized": true}, {"id": 31, "category": "Letter with exclamation mark", "input": "A\!", "encoded": "A\!", "roundtrip\_decoded": "A\!", "roundtrip\_matches\_normalized": true}, {"id": 32, "category": "Colon, space, and digits", "input": "BENDER: 3000", "encoded": "BFSVZQ: 3000", "roundtrip\_decoded": "BENDER: 3000", "roundtrip\_matches\_normalized": true}, {"id": 33, "category": "Hyphenated word", "input": "PLANET-EXPRESS", "encoded": "PAANRK-OLARVNF", "roundtrip\_decoded": "PLANET-EXPRESS", "roundtrip\_matches\_normalized": true}, {"id": 34, "category": "Pure digits string", "input": "3000", "encoded": "3000", "roundtrip\_decoded": "3000", "roundtrip\_matches\_normalized": true}, {"id": 35, "category": "Hash symbol and digit", "input": "ROBOT \#1", "encoded": "RFGUN \#1", "roundtrip\_decoded": "ROBOT \#1", "roundtrip\_matches\_normalized": true}, {"id": 36, "category": "Newline separator between letters", "input": "A\\nB", "encoded": "A\\nB", "roundtrip\_decoded": "A\\nB", "roundtrip\_matches\_normalized": true}, {"id": 37, "category": "Multi-line string with newline", "input": "LINE\\nLINE", "encoded": "LTGK\\nVDQU", "roundtrip\_decoded": "LINE\\nLINE", "roundtrip\_matches\_normalized": true}, {"id": 38, "category": "Tab character preservation", "input": "TAB\\tTEST", "encoded": "TTU\\tNRJC", "roundtrip\_decoded": "TAB\\tTEST", "roundtrip\_matches\_normalized": true}, {"id": 39, "category": "Multiple consecutive spaces", "input": "SPACE MANY", "encoded": "SHHJN ZZMK", "roundtrip\_decoded": "SPACE MANY", "roundtrip\_matches\_normalized": true}, {"id": 40, "category": "CRLF line break preservation", "input": "END\\r\\nLINE", "encoded": "ERU\\r\\nFNAE", "roundtrip\_decoded": "END\\r\\nLINE", "roundtrip\_matches\_normalized": true}, {"id": 41, "category": "Latin extended accented letter", "input": "CAFÉ", "encoded": "CCHÉ", "roundtrip\_decoded": "CAFÉ", "roundtrip\_matches\_normalized": true}, {"id": 42, "category": "Emoji character passthrough", "input": "ALiEN 👽", "encoded": "ALTXK 👽", "roundtrip\_decoded": "ALIEN 👽", "roundtrip\_matches\_normalized": true}, {"id": 43, "category": "Umlaut character", "input": "RÖBOT", "encoded": "RÖSGZ", "roundtrip\_decoded": "RÖBOT", "roundtrip\_matches\_normalized": true}, {"id": 44, "category": "Emoji and digits mixed", "input": "NIBBLER 🚀 3000", "encoded": "NVWXIMD 🚀 3000", "roundtrip\_decoded": "NIBBLER 🚀 3000", "roundtrip\_matches\_normalized": true}, {"id": 45, "category": "Copyright symbol passthrough", "input": "© 3000 FUTURAMA", "encoded": "© 3000 FZSMDDPP", "roundtrip\_decoded": "© 3000 FUTURAMA", "roundtrip\_matches\_normalized": true}, {"id": 46, "category": "Full alphabet pangram", "input": "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG", "encoded": "TAE UOWYI TJSQA UDH YDSRG UQVD MQY QEZW KVP", "roundtrip\_decoded": "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG", "roundtrip\_matches\_normalized": true}, {"id": 47, "category": "Full name multiword state", "input": "BENDER BENDING", "encoded": "BFSVZQ RVILTGM", "roundtrip\_decoded": "BENDER BENDING", "roundtrip\_matches\_normalized": true}, {"id": 48, "category": "Alternative full alphabet pangram", "input": "PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS", "encoded": "PXEM LM VJM GBAA KGZQ XNEIM PZZDJL SQYO", "roundtrip\_decoded": "PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS", "roundtrip\_matches\_normalized": true} \] } \]

 

 

 

JSON

\[ { "file\_name": "HR33-puzzles.json", "content": \[ {"puzzle\_id": 1, "type": "encode", "input": "LEELA", "hint": "L is 11, E is 4, A is 0.", "solution": "LPTEE"}, {"puzzle\_id": 2, "type": "decode", "input": "LPTEE", "hint": "Start by deciphering the first character exactly as it appears.", "solution": "LEELA"}, {"puzzle\_id": 3, "type": "encode", "input": "MOM", "hint": "The middle character will trigger a modulo wraparound returning exactly to 0.", "solution": "MAM"}, {"puzzle\_id": 4, "type": "decode", "input": "MAM", "hint": "To decipher the 'A' (0), the calculation is (0 \- 12 \+ 26\) mod 26.", "solution": "MOM"}, {"puzzle\_id": 5, "type": "encode", "input": "SLURM", "hint": "Watch the state closely after calculating 'U' (20).", "solution": "SDXOA"}, {"puzzle\_id": 6, "type": "decode", "input": "SDXOA", "hint": "The final character 'A' (0) is calculated against the previous ciphertext 'O' (14).", "solution": "SLURM"}, {"puzzle\_id": 7, "type": "encode", "input": "BENDER", "hint": "The first two characters will encode predictably without modulo wraparound to 'B' and 'F'.", "solution": "BFSVZQ"}, {"puzzle\_id": 8, "type": "decode", "input": "BFSVZQ", "hint": "The final character 'Q' (16) requires subtraction against 'Z' (25).", "solution": "BENDER"}, {"puzzle\_id": 9, "type": "encode", "input": "NIBBLER", "hint": "Remember that consecutive identical plaintext letters do not produce identical ciphertext letters.", "solution": "NVWXIMD"}, {"puzzle\_id": 10, "type": "decode", "input": "NVWXIMD", "hint": "Maintain close attention to the successive descending integers of 'W' (22) and 'X' (23).", "solution": "NIBBLER"}, {"puzzle\_id": 11, "type": "encode", "input": "FARNSWORTH", "hint": "This extensive string requires meticulous, unbroken state tracking across ten iterations.", "solution": "FFWJBXLCVC"}, {"puzzle\_id": 12, "type": "decode", "input": "FFWJBXLCVC", "hint": "Ensure the final two 'C' characters successfully decode to 'R' and 'H'.", "solution": "FARNSWORTH"} \] } \]

 

 

 

JSON

\[ { "file\_name": "HR33-catalog-candidates.json", "content": \[ { "kind": "episode", "slug": "the-why-of-fry", "title": "The Why of Fry", "subtitle": "Dancing Space Potatoes? You Bet\!", "summary": "Fry discovers the truth regarding his cryogenic freezing and realizes he is the only person immune to the evil Brain spawn.", "body": "The episode explores the events surrounding Fry's freezing on December 31, 1999\. Written by David X. Cohen, the episode fulfills long-standing narrative seeds planted during the series pilot. Fry discovers that Nibbler intentionally pushed him into the cryogenic tube because he lacked the delta brainwave, an anomaly created by being his own grandfather. This biological quirk renders him immune to the Brain spawn's telepathic attacks. The Nibblonians equip Fry with a bomb to destroy the Infosphere, a repository constructed by the Brain spawn to collect all the universe's knowledge before annihilating the cosmos. After a tense time-travel sequence, Fry ultimately chooses to freeze himself, accepting his destiny as the savior of the universe.", "image\_key": "episodes", "published": 0, "featured": 0, "spoiler": 1, "production\_code": "4ACV10", "production\_season": 4, "production\_episode": 10, "broadcast\_season": 5, "broadcast\_episode": 8, "network": "Fox", "air\_date": "2003-04-06", "species": null, "occupation": null, "homeworld": null, "source\_url": "https://en.wikipedia.org/wiki/The\_Why\_of\_Fry" }, { "kind": "article", "slug": "alienese", "title": "Alienese", "subtitle": "The Extraterrestrial Languages of Futurama", "summary": "Alienese comprises two distinct ciphers utilized by the show's creators to embed background jokes and Easter eggs into the world of New New York.", "body": "Alienese is an overarching term for the written extraterrestrial scripts seen throughout the series. The first version, Alien Language 1 (AL1), is a simple monoalphabetic substitution cipher where each English letter maps directly to an alien symbol. This code was cracked almost immediately by the audience following the series premiere, much to the disappointment of the writing staff.\\n\\nTo increase the difficulty, writer Jeff Westbrook, a former algorithms researcher with a doctorate in computer science from Princeton University, developed Alien Language 2 (AL2). First appearing on the Rosetta Stone-like obelisks in the episode 'The Day the Earth Stood Stupid', AL2 operates as an autokey cipher relying on modulo-26 arithmetic. Each letter's encryption depends on the cumulative integer value of the entire preceding string, requiring the audience to mathematically trace the entire sequence from its inception to decode a message. The sophisticated nature of the cipher highlights the dense academic background of the writing staff, which includes multiple writers with doctorates in fields ranging from applied mathematics to inorganic chemistry.", "image\_key": "home", "published": 0, "featured": 0, "spoiler": 0, "production\_code": null, "production\_season": null, "production\_episode": null, "broadcast\_season": null, "broadcast\_episode": null, "network": "", "air\_date": null, "species": null, "occupation": null, "homeworld": null, "source\_url": "https://www.slashfilm.com/1614959/futurama-alien-language-math-formula-decode/" }, { "kind": "article", "slug": "futurama-theorem", "title": "The Futurama Theorem", "subtitle": "Keeler's Theorem for Reversing Mind Swaps", "summary": "A mathematical theorem developed by writer Ken Keeler to resolve the plot of the mind-switching episode 'The Prisoner of Benda'.", "body": "The Futurama Theorem, commonly referred to in academic literature as Keeler's Theorem, is a legitimate mathematical proof in symmetric group theory. It was formulated to resolve a complex plot complication in the episode 'The Prisoner of Benda', which involves a mind-switching device that is mathematically restricted from being used on the exact same pair of bodies more than once. As the characters rapidly swap bodies, they find themselves hopelessly tangled in a permutation they cannot directly reverse.\\n\\nWriter Ken Keeler, holding a doctorate in applied mathematics from Harvard University, drafted a formal proof demonstrating that regardless of how scrambled the minds become, they can all be restored to their original bodies by introducing exactly two additional individuals who have not previously participated in the swaps. The proof relies on the decomposition of permutations into disjoint cycles. The actual equations were briefly flashed on screen during the episode, earning Keeler a Writers Guild Award and marking a rare instance of a rigorous mathematical theorem being authored specifically for a television comedy narrative.", "image\_key": "home", "published": 0, "featured": 0, "spoiler": 1, "production\_code": null, "production\_season": null, "production\_episode": null, "broadcast\_season": null, "broadcast\_episode": null, "network": "", "air\_date": null, "species": null, "occupation": null, "homeworld": null, "source\_url": "https://math.ucsd.edu/sites/math.ucsd.edu/files/undergrad/honors-program/honors-theses/2011-2012/Lihua\_Huang\_Honors\_Thesis.pdf" } \] } \]

 

 

 

JSON

\[ { "file\_name": "HR33-research.json", "content": { "schema\_version": "hulurama-research-1", "pack\_id": "HR33", "research\_cutoff": "2026-09-12T21:35:55Z", "scope": "Alienese Cipher AL2 Audit, Test Vectors, and Related Mathematical Canon", "records": \[ { "record\_key": "hu:episode:4acv10", "record\_type": "episode", "title": "The Why of Fry", "proposed\_slug": "the-why-of-fry", "summary": "Fry discovers he is the only person who can stop the evil Brain spawn.", "attributes": { "production\_code": "4ACV10" }, "source\_ids": \["HR33-src-30", "HR33-src-31"\], "claim\_ids": \["HR33-clm-1"\], "spoiler\_scope": 1, "editorial\_status": "needs\_review", "collision\_review": "pending\_live\_catalog" }, { "record\_key": "hu:article:alienese", "record\_type": "article", "title": "Alienese", "proposed\_slug": "alienese", "summary": "Alienese comprises two distinct ciphers utilized by the show's creators.", "attributes": {}, "source\_ids": \["HR33-src-20", "HR33-src-73"\], "claim\_ids": \["HR33-clm-2"\], "spoiler\_scope": 0, "editorial\_status": "needs\_review", "collision\_review": "pending\_live\_catalog" }, { "record\_key": "hu:article:futurama-theorem", "record\_type": "article", "title": "The Futurama Theorem", "proposed\_slug": "futurama-theorem", "summary": "A mathematical theorem developed by writer Ken Keeler.", "attributes": {}, "source\_ids": \["HR33-src-217", "HR33-src-219"\], "claim\_ids": \["HR33-clm-3"\], "spoiler\_scope": 1, "editorial\_status": "needs\_review", "collision\_review": "pending\_live\_catalog" } \], "sources": \[ { "source\_id": "HR33-src-20", "title": "Futurama Alien Language Math Formula Decode", "publisher": "Slashfilm", "URL": "https://www.slashfilm.com/1614959/futurama-alien-language-math-formula-decode/", "source\_type": "article", "publication\_date": null, "access\_date": "2026-09-12", "access\_status": "accessed", "edition": null, "locator": "web" }, { "source\_id": "HR33-src-30", "title": "The Why of Fry", "publisher": "Wikipedia", "URL": "https://en.wikipedia.org/wiki/The\_Why\_of\_Fry", "source\_type": "wiki", "publication\_date": null, "access\_date": "2026-09-12", "access\_status": "accessed", "edition": null, "locator": "web" }, { "source\_id": "HR33-src-31", "title": "The Why of Fry", "publisher": "Futurama Wiki", "URL": "https://futurama.fandom.com/wiki/The\_Why\_of\_Fry", "source\_type": "wiki", "publication\_date": null, "access\_date": "2026-09-12", "access\_status": "accessed", "edition": null, "locator": "web" }, { "source\_id": "HR33-src-73", "title": "David X. Cohen Interview", "publisher": "Slashfilm", "URL": "https://www.slashfilm.com/1614959/futurama-alien-language-math-formula-decode/", "source\_type": "interview", "publication\_date": null, "access\_date": "2026-09-12", "access\_status": "accessed", "edition": null, "locator": "web" }, { "source\_id": "HR33-src-217", "title": "Keeler's Theorem and Products of Distinct Transpositions", "publisher": "UCSD Math Department", "URL": "https://math.ucsd.edu/sites/math.ucsd.edu/files/undergrad/honors-program/honors-theses/2011-2012/Lihua\_Huang\_Honors\_Thesis.pdf", "source\_type": "academic\_paper", "publication\_date": "2012", "access\_date": "2026-09-12", "access\_status": "accessed", "edition": null, "locator": "PDF" }, { "source\_id": "HR33-src-219", "title": "Keeler's Theorem and Products of Distinct Transpositions", "publisher": "ResearchGate", "URL": "https://www.researchgate.net/publication/224861409\_Keeler's\_Theorem\_and\_Products\_of\_Distinct\_Transpositions", "source\_type": "academic\_paper", "publication\_date": "2012-04", "access\_date": "2026-09-12", "access\_status": "accessed", "edition": null, "locator": "web" } \], "claims": \[ { "claim\_id": "HR33-clm-1", "record\_key": "hu:episode:4acv10", "assertion": "Production code is 4ACV10, broadcast season 5 episode 8.", "source\_ids": \["HR33-src-30", "HR33-src-31"\], "locator": "infobox", "evidence\_status": "source\_reported" }, { "claim\_id": "HR33-clm-2", "record\_key": "hu:article:alienese", "assertion": "AL2 was designed by Jeff Westbrook as a modulo-26 mathematical autokey code.", "source\_ids": \["HR33-src-20", "HR33-src-73"\], "locator": "body paragraph", "evidence\_status": "source\_reported" }, { "claim\_id": "HR33-clm-3", "record\_key": "hu:article:futurama-theorem", "assertion": "Ken Keeler authored a theorem to resolve the Prisoner of Benda body swaps using symmetric group permutations.", "source\_ids": \["HR33-src-217", "HR33-src-219"\], "locator": "abstract", "evidence\_status": "source\_reported" } \], "relationships": \[\], "issues": \[\] } } \]

 

 

 

JSON

\[ { "file\_name": "HR33-image-briefs.json", "content": \[ { "brief\_id": "HR33-img-1", "target\_record\_key": "hu:article:alienese", "proposed\_filename": "hr33-alienese-obelisk.jpg", "purpose": "Hero image representing Alien Language 2.", "scene": "A glowing Rosetta Stone-style obelisk on the planet Eternium featuring mysterious alien symbols.", "composition": "16:9 cel-shaded fan illustration with a navy/teal/cyan palette and selective green highlights. Clean silhouettes.", "avoid": "No baked-in typography, fake glyph translations, or cluttered backgrounds.", "spoiler\_scope": 0, "draft\_alt\_text": "A stylized, glowing obelisk covered in alien symbols against a teal background.", "status": "brief\_only" }, { "brief\_id": "HR33-img-2", "target\_record\_key": "hu:article:futurama-theorem", "proposed\_filename": "hr33-mind-switcher.jpg", "purpose": "Hero image representing the mind-switching machine.", "scene": "Two ornate, glowing mechanical chairs connected by massive plasma tubes, representing the machine from The Prisoner of Benda.", "composition": "16:9 cel-shaded fan illustration. High contrast with mechanical detailing. Crop-safe subjects.", "avoid": "Avoid depicting specific characters' faces to maintain a clean focus on the technology.", "spoiler\_scope": 0, "draft\_alt\_text": "A mechanical mind-switching apparatus with two chairs connected by glowing tubes.", "status": "brief\_only" } \] } \]

 

 

 

JSON

\[ { "file\_name": "HR33-memory-handoff.json", "content": { "pack\_id": "HR33", "status": "proposal\_only", "suggested\_durable\_destination": "docs/long-term-memory/reports/", "delivered\_artifacts": \[ "HR33-report.md", "HR33-catalog-candidates.json", "HR33-research.json", "HR33-image-briefs.json", "HR33-manifest.json", "HR33-corrections.json", "HR33-test-vectors.json", "HR33-puzzles.json", "HR33-reference-implementation.py" \], "reviewed\_findings": \[ "Inherited Alienese state definitions were flawed due to a 1-based indexing logic and addition of plaintext rather than ciphertext.", "Correct implementation of modulo-26 mathematical tracking proves correct encoding of all 48 test vectors." \], "uncertainties": \[ "Potential collision with existing site assets for 'the-why-of-fry' slug requires catalog integration verification." \], "candidate\_targets": \[ "hu:episode:4acv10", "hu:article:alienese", "hu:article:futurama-theorem" \], "next\_action": "Integrate Alienese test vectors into the interactive deciphering widget on the frontend." } } \]

 

 

 

JSON

\[ { "file\_name": "HR33-manifest.json", "content": { "requested\_counts": { "catalog\_candidates": "unspecified", "test\_vectors": 48, "worked\_examples": 6, "practice\_puzzles": 12, "troubleshooting\_faqs": 8, "image\_briefs": 2, "correction\_records": 5 }, "delivered\_counts": { "catalog\_candidates": 3, "test\_vectors": 48, "worked\_examples": 6, "practice\_puzzles": 12, "troubleshooting\_faqs": 8, "image\_briefs": 2, "correction\_records": 5 }, "complete\_target\_ids": \[ "HR33-corrections.json", "HR33-test-vectors.json", "HR33-puzzles.json", "HR33-report.md", "HR33-catalog-candidates.json", "HR33-research.json", "HR33-image-briefs.json" \], "held\_targets": \[\], "held\_reasons": {}, "checks\_run": { "json\_parseability": "manual\_review", "byte\_limits": "manual\_review", "schema\_validation": "manual\_review" }, "checks\_not\_run": \[ "live\_mysql\_integration", "site\_routes" \], "files\_created": 9, "measured\_sizes\_and\_hashes": null, "continuation\_cursor": null } } \]

 

 

 

Python

\# HR33-reference-implementation.py \# Dependency-free reference implementation of the Alienese AL2 cipher.

def alienese\_encode(text: str) \-\> str: """ Alienese II / Autokey Modulo-26 Addition Cipher Encoder. Specification: \- Map ASCII A-Z to 0-25. \- Normalize ASCII a-z to uppercase before calculation. \- Maintain previous\_c state across ASCII letters, initialized to 0\. \- c \= (p \+ previous\_c) mod 26; previous\_c \= c. \- Non-ASCII-letter characters pass through unchanged without modifying state. """ c\_prev \= 0 result \= \[\] for char in text: if 'A' \<= char \<= 'Z' or 'a' \<= char \<= 'z': p \= ord(char.upper()) \- ord('A') c \= (p \+ c\_prev) % 26 c\_char \= chr(c \+ ord('A')) c\_prev \= c result.append(c\_char) else: result.append(char) return "".join(result)

def alienese\_decode(text: str) \-\> str: """ Alienese II / Autokey Modulo-26 Addition Cipher Decoder. Specification: \- Map ASCII A-Z to 0-25. \- Normalize ASCII a-z to uppercase before calculation. \- Maintain previous\_c state across ASCII letters, initialized to 0\. \- p \= (c \- previous\_c \+ 26\) mod 26; previous\_c \= c. \- Non-ASCII-letter characters pass through unchanged without modifying state. """ c\_prev \= 0 result \= \[\] for char in text: if 'A' \<= char \<= 'Z' or 'a' \<= char \<= 'z': c \= ord(char.upper()) \- ord('A') p \= (c \- c\_prev \+ 26) % 26 p\_char \= chr(p \+ ord('A')) c\_prev \= c result.append(p\_char) else: result.append(char) return "".join(result)

Works cited

1. unknown\_url

2. How To Decode Futurama's Two Alien Languages \- SlashFilm, https://www.slashfilm.com/1614959/futurama-alien-language-math-formula-decode/

3. Futurama's Alien Language Explained \- ScreenRant, https://screenrant.com/futuramas-alien-language-explained/

4. David X. Cohen \- Wikipedia, https://en.wikipedia.org/wiki/David\_X.\_Cohen

5. David X. Cohen: Futurama's Head (In a Jar) \- Roy Christopher, https://roychristopher.com/david-x-cohen-futuramas-head-in-a-jar/

6. Jeff Westbrook | Simpsons Wiki \- Fandom, https://simpsons.fandom.com/wiki/Jeff\_Westbrook

7. r/futurama \- $4.3 Billion — I got curious and the math checks out., https://www.reddit.com/r/futurama/comments/172pksk/43\_billion\_i\_got\_curious\_and\_the\_math\_checks\_out/

8. Futurama, Season Three, Episode Seven, “The Day The Earth Stood, https://the-avocado.org/2021/08/15/futurama-season-three-episode-seven-the-day-the-earth-stood-stupid/

9. Autokey cipher | Crypto Wiki \- Fandom, https://cryptography.fandom.com/wiki/Autokey\_cipher

10. Extending Keys, https://websites.nku.edu/\~christensen/section%2017%20autokey.pdf

11. Giovan Battista Bellaso \- Wikipedia, https://en.wikipedia.org/wiki/Giovan\_Battista\_Bellaso

12. Vigenère Cipher \- Crypto Corner \- Interactive Maths, https://crypto.interactive-maths.com/vigenegravere-cipher.html

13. Autokey Cipher \- Crypto Corner, https://crypto.interactive-maths.com/autokey-cipher.html

14. Autokey cipher \- Wikipedia, https://en.wikipedia.org/wiki/Autokey\_cipher

15. Kasiski Analysis: Breaking the Code \- Crypto Corner, https://crypto.interactive-maths.com/kasiski-analysis-breaking-the-code.html

16. Autokey Cipher: Self-Extending Key Encryption Tool, https://cipherutility.com/tools/autokey-cipher

17. Alienese cycles \- Code Golf Stack Exchange, https://codegolf.stackexchange.com/questions/237116/alienese-cycles

18. Some Notes on a Formal Algebraic Structure of Cryptology \- MDPI, https://www.mdpi.com/2227-7390/9/18/2183

19. Applied Cryptography, http://www.inf.ufsc.br/\~bosco.sobral/ensino/ine5680/material-cripto-seg/2014-1/cryptoBruceSchneier.pdf

20. The Monographic Substitution Cipher: From Julius Caesar to the KGB, https://www.physicsforums.com/insights/monographic-substitution-cipher-julius-caesar-kgb/

21. Cryptography \- Institute of Computer Science, https://user.informatik.uni-goettingen.de/\~brosenne/vortraege/crypto2013ws/crypto20131125.pdf

22. Autokey strikes again\! \- PR Gomez, https://prgomez.com/autokey-strikes-again/

23. Stream cipher \- Wikipedia, https://en.wikipedia.org/wiki/Stream\_cipher

24. An Introduction to Mathematical Cryptography \- Vaia, https://www.vaia.com/en-us/textbooks/math/an-introduction-to-mathematical-cryptography-1-edition/chapter-4/

25. I am David X. Cohen, head writer on FUTURAMA \- AMA\! : r/IAmA, https://www.reddit.com/r/IAmA/comments/1hgdrt/i\_am\_david\_x\_cohen\_head\_writer\_on\_futurama\_ama/

26. How Futurama Gets Away With Scientific 'Mistakes' \- SlashFilm, https://www.slashfilm.com/1498528/how-futurama-counters-science-mistakes/

27. Keeler's Theorem and products of distinct transpositions \- UCSD Math, https://math.ucsd.edu/sites/math.ucsd.edu/files/undergrad/honors-program/honors-theses/2011-2012/Lihua\_Huang\_Honors\_Thesis.pdf

28. Keeler's Theorem and Products of Distinct Transpositions, https://www.researchgate.net/publication/224861409\_Keeler's\_Theorem\_and\_Products\_of\_Distinct\_Transpositions

29. arXiv:1608.04809v1 \[math.GR\] 16 Aug 2016, https://arxiv.org/pdf/1608.04809

30. (PDF) A survey on keeler's theorem and application of symmetric, https://www.researchgate.net/publication/313581595\_A\_survey\_on\_keeler's\_theorem\_and\_application\_of\_symmetric\_group\_for\_swapping\_game

31. Futurama language, decoded \- Reddit, https://www.reddit.com/r/futurama/comments/ut9pko/futurama\_language\_decoded/

32. Alien Alphabet 2 \- futurama point, https://www.slurmed.com/?p=aa/@aa\&pag=2

33. Futurama Alien 2 Alphabet Translator \- Alienese Decoder/Encoder, https://www.dcode.fr/futurama-alien-2-alphabet

34. Correct alphabet? : r/futurama \- Reddit, https://www.reddit.com/r/futurama/comments/14nln2a/correct\_alphabet/

35. Autokey Cipher Guide: Keystream & Examples \- CipherRegister, https://cipherregister.com/learn/autokey-cipher

36. stream cipher \- Why is Vigenère Autokey self-synchronizing?, https://crypto.stackexchange.com/questions/59572/why-is-vigen%C3%A8re-autokey-self-synchronizing