LATENT REFERENCES / TAG1
Assembly-Language Tanka
Original title: アセンブラ短歌
This reference note belongs to Tag1 in Latent References, an archive curated by Keigo Yoshida. Its archive region is Stax Records. The note preserves its source text and links so that readers can trace the material behind the 3D map.
- Collection
- Tag1
- Archive region
- Stax Records
Archived reference note
English translation of the archived note. JP shows the original text. Source links and literal code are retained; the translation does not update or independently verify the source claims.
https://kozos.jp/asm-tanka/
Assembler tanka is a game creating programs in 31 bytes (5·7·5·7·7) of machine code and likening their behavior and sequences of mnemonics to tanka's poetic feeling.
Basic rules of assembly-language tanka
Byte-count constraint: 31 bytes in total (or adjusted so 1 instruction is 5, 7, 5, 7, 7 bytes).
Operation and appreciation: Beyond simply functioning, the beauty of disassembled code and changes in registers are likened to scenery or emotions.
https://kozos.jp/asm-tanka/
アセンブラ短歌は、31バイト（5・7・5・7・7）の機械語コードでプログラムを作り、その動作やニーモニックの並びを短歌の情緒になぞらえる遊びです。
アセンブラ短歌の基本ルール
バイト数の制約：全体で31バイト（または1命令が5・7・5・7・7バイトになるよう調整）。
動作と鑑賞：単に動くだけでなく、逆アセンブルした際のコードの美しさや、レジスタの増減の様子を景色や感情に見立てます。
Source updated 2026-05-23 · Snapshot 2026-10-08