Machine language is just fields packed into a word. A playing card breaks down the same way: color is the high bit, suit is a 2-bit opcode group (♥♦♠♣ → ALU / MOVE / FLOW / SYS), rank is a 4-bit operand. Deal a card, watch it decode into a 6-bit instruction. The internal ops (compute / move / jump) fire freely; the world-touching SYS / IO ops stop at the gate. The jokers are the two opcodes off the grid: HALT and NOP.
suit<<4 | rank. Color is the top bit of the suit field (red 0 / black 1), so the suit IS the 2-bit opcode group; rank is the 4-bit operand. Honest seam (same as the ternary lattice): color and suit are powers of 2 → clean fields. But rank is 13, and 13 is prime — a 4-bit nibble holds 16, so ranks 1–13 waste codes 0/14/15 in every suit. The 6-bit word holds 64 opcodes; the deck fills 52; the 2 jokers drop into two of the 12 leftover slots as the off-grid meta-ops (HALT / NOP). So the deck is a container for a machine word — clean on the binary fields, lossy on rank — not an isomorphism. The gate is the same j-junction interlock: internal ops (ALU/MOVE/FLOW) are recomputable → fire freely; SYS / IO writes to the world → halt + witness + confirm.