NAND GATE
Outputs ON unless ALL inputs are ON. The inverse of an AND gate. NAND is functionally complete, any logic circuit can be built using only NAND gates.
Truth Table
| Input A | Input B | Output |
|---|---|---|
| 0 (OFF) | 0 (OFF) | 1 (ON) |
| 0 (OFF) | 1 (ON) | 1 (ON) |
| 1 (ON) | 0 (OFF) | 1 (ON) |
| 1 (ON) | 1 (ON) | 0 (OFF) |
How to Build
- 1Place two solid blocks side by side.
- 2Run input A into the first block and place a torch on top (NOT A).
- 3Run input B into the second block and place a torch on top (NOT B).
- 4Merge the two torch outputs with redstone dust (OR of NOT A and NOT B).
- 5By De Morgan's Law: NOT(A) OR NOT(B) = NOT(A AND B) = NAND.
Build Variants
- ▸Torch-based NAND (2 torches + OR merge)
- ▸AND gate with trailing NOT gate
- ▸Comparator-based NAND (subtract mode inverted)