Drag gates onto the canvas, wire them together, toggle inputs — watch signals propagate live. Build any combinational circuit right in your browser.
| Gate | Symbol | Boolean | Truth (A=1,B=1) | Use case |
|---|---|---|---|---|
| AND | & | Y = A·B | 1 | Enable / mask |
| OR | ≥1 | Y = A+B | 1 | Combine signals |
| NOT | ¬A | Y = Ā | 0 (A=1) | Invert |
| NAND | ¬(A·B) | Y = (A·B)̄ | 0 | Universal gate |
| NOR | ¬(A+B) | Y = (A+B)̄ | 0 | Universal gate |
| XOR | A⊕B | Y = A'B+AB' | 0 | Parity / adder |
| XNOR | ¬(A⊕B) | Y = AB+A'B' | 1 | Comparator |
| MUX 2:1 | — | Y = S'A+SB | — | Data selection |
A 2:1 MUX selects between two inputs A and B using a select line S: Y = S'·A + S·B.
Gates needed: 1× NOT (invert S), 2× AND (S'·A and S·B), 1× OR (combine). Try loading the example above!
Sum = A ⊕ B (XOR gate), Carry = A·B (AND gate). Two gates total — simplest binary adder circuit.
Sum = A ⊕ B ⊕ Cin. Carry-out = A·B + Cin·(A⊕B). Built from two half adders + one OR gate (5 gates total).