Logic Gate Cipher

1 2 3 4 5 6 7

difficulty levels — click green to claim

The idea in plain English: Imagine a bunch of light switches connected by wires to a light bulb. Flipping certain switches turns the bulb on or off. Now imagine many bulbs, each connected to different sets of switches through different logic rules. The pattern of ON/OFF bulbs spells a binary number, and that number is a letter in the answer. This is exactly how every computer processor works — billions of tiny switches (logic gates) turning ON/OFF to compute everything from 1+1=2 to rendering this webpage.

Why this really exists: Every CPU, GPU, calculator, and digital watch is built from these same logic gates. AND, OR, NOT, XOR, NAND — they're the alphabet of computing. The processor in your phone has billions of them. When you type a letter on your keyboard, logic gates convert it into binary.

▸ Concrete Example

You have a circuit with 3 input bits (A, B, C), and the gates work like this:

Inputs: A=1, B=0, C=1

Gate 1: A AND B → 1 AND 0 = 0
Gate 2: B OR C → 0 OR 1 = 1
Gate 3: NOT (Gate 1) → NOT 0 = 1
Gate 4: Gate 2 XOR Gate 3 → 1 XOR 1 = 0

Output bit from Gate 4: 0
(This is one bit of a 5-bit output. 4 more circuits produce the other 4 bits.)

The 5 output bits (one from each circuit) form a binary number:

Bits: 0 0 1 1 1 = binary 00111 = decimal 7
Letter 7 in 0-indexed A-Z = H (A=0, B=1, ..., H=7)

Repeat for all letters in the answer word. Each letter comes from a different set of logic circuits.

▸ The Four Basic Gates (Everything You Need)

Each gate takes 1 or 2 binary inputs (0 or 1) and produces 1 binary output:

Gate	Name	Output = 1 when...	Example
AND	Both inputs must be 1	Both A AND B are 1	1 AND 0 = 0 \| 1 AND 1 = 1
OR	At least one input is 1	Either A OR B (or both) is 1	0 OR 1 = 1 \| 0 OR 0 = 0
NOT	Invert the input	Input is 0	NOT 1 = 0 \| NOT 0 = 1
XOR	Exactly one input is 1	Inputs are different	1 XOR 0 = 1 \| 1 XOR 1 = 0

💡 Memory trick:

AND = both (like "you AND me" = both of us)

OR = either (like "coffee OR tea" = pick one or both)

NOT = opposite (like "NOT happy" = unhappy)

XOR = different (like "salty XOR sweet" — can't be both)

▸ How to Solve It (Simulating the Circuit)

1. The puzzle gives you a DAG (Directed Acyclic Graph) of logic gates. This is just a fancy way of saying "a circuit where signals flow one direction — no loops."

2. Each gate has inputs (either from the original puzzle inputs or from other gates) and a type (AND/OR/NOT/XOR)

3. Start from the original inputs and compute gates in order: you can only compute a gate after all its inputs are computed.

4. The final output bits (usually 5 bits) form a binary number 0-31

5. Letter = chr(65 + number) — 0=A, 1=B, ..., 25=Z

▸ Difficulty Scaling

Difficulty	Gates per letter	Circuit depth	Word length
1	3-4	2-3 layers	3-4
3	8-12	4-5 layers	4-5
5	15-25	5-7 layers	5-7
7	30-50	7-10 layers	5-7

▸ Real-World Applications

Every CPU ever made — from your phone to a supercomputer — is just billions of logic gates
Digital watches use logic gates to count seconds and drive the display
Traffic lights use simple logic circuits to decide when to change colors
Calculators convert button presses into binary, compute with gates, convert back to numbers
Error correction in hard drives and SSDs uses XOR gates to detect and fix corrupted data

← Back to all ciphers