Binary and Bitwise Tools
Explore binary arithmetic and digital logic with five free online tools. Calculate byte checksums, simulate logic gates, work with bitwise operators, calculate even parity bits, and add binary numbers.
1. Simple Checksum Calculator (Modulo 256)
Calculate an 8-bit additive checksum by summing the UTF-8 bytes of your input and keeping the result modulo 256. This is a simple checksum, not a cryptographic hash or a complete error-detection protocol.
2. Logic Gate Simulator
Test AND, OR, NOT, XOR, NAND, NOR, and XNOR logic gates using binary inputs. Each input must be either 0 or 1.
Logic gate truth table
| A | B | AND | OR | XOR | NAND | NOR | XNOR |
|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
3. Bitwise Operation Calculator
Apply AND, OR, XOR, NOT, left shift, or right shift to signed 32-bit integers. Results include decimal, binary, and hexadecimal representations.
4. Even and Odd Parity Bit Calculator
Count the 1 bits in a binary string and calculate the parity bit. Even parity makes the total number of 1 bits even; odd parity makes that total odd.
5. Binary Addition Calculator
Add two non-negative binary numbers and display the binary sum, decimal equivalents, and carry-aware addition result. Leading zeros are accepted.
What Are Binary and Bitwise Operations?
Binary numbers use only 0 and 1. Computers use binary representations to store data and perform arithmetic and logical operations. Bitwise operators act on individual bits within integer representations.
How Does a Modulo 256 Checksum Work?
A simple additive checksum adds the input bytes and takes the remainder after division by 256. The result is between 0 and 255, so it can be represented using one byte. Different messages can have the same checksum, which means this method is not suitable for security-sensitive integrity verification.
What Is a Parity Bit?
A parity bit is an extra bit used for basic error detection. With even parity, the data bits plus the parity bit contain an even number of ones. With odd parity, that total is odd. Parity can detect some transmission errors but cannot reliably correct errors or detect every possible multi-bit error.
Binary Addition Example
In binary, 1011 represents decimal 11 and 1101
represents decimal 13. Their sum is 11000, which represents
decimal 24.
These tools perform calculations locally in your browser. They are designed for learning, quick checks, and basic digital-logic work.