Bitwise XOR compares each bit position across all inputs and outputs 1 when an odd number of bits in that position are 1. For two inputs this simplifies to: 1 when the bits differ, 0 when they are equal. XOR is commutative and associative, so the order of operands doesn't matter for the final result.
XOR is its own inverse. If A ⊕ B = C, then C ⊕ B = A and C ⊕ A = B. To recover a lost operand, simply XOR the result with the other known operand. This property makes XOR fundamental to simple symmetric encryption, error-correction codes and checksums.
| A | B | A XOR B |
|---|---|---|
| 0 | 0 | 0 |
| 1 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 1 | 0 |
XOR (exclusive OR) outputs 1 when the two input bits differ, and 0 when they are the same. For multi-input XOR, the result bit is 1 when an odd number of inputs have a 1 in that position.
Set Input Base to Hex, paste your hex strings (e.g. DEAD and BEEF) and click Calculate. The result appears in hex and all other bases.
Yes — paste as many values as you like. The tool applies XOR successively: A⊕B, then (A⊕B)⊕C, and so on. Enable Show Intermediate Results to see each step.
XOR is its own inverse. If A ⊕ B = C then C ⊕ B = A. Paste the result and one operand to recover the other.
See also: NAND Calculator, NOR Calculator, NOT Calculator, Bitwise Calculator, XOR Encryptor.