How this instrument works
Parity checking is a basic error-detection scheme: alongside a block of data bits, a system sends one extra bit chosen so that the total count of 1-bits, data plus parity together, always follows a fixed rule. Under even parity, that total must always come out even. Under odd parity, it must always come out odd. If a receiver recounts the 1-bits it received and the result breaks the agreed rule, it knows at least one bit was corrupted in transit — a single-bit error has been caught.
For any given data byte, the even-parity bit and the odd-parity bit are always exact opposites of each other — whichever one is 0, the other is 1 — since they're solving the same counting problem in opposite directions. This instrument computes both at once for the same 8-bit byte, rather than committing to one convention, making that complementary relationship directly visible instead of needing to check two separate calculators to see it.
Real systems pick one convention and stick to it: old RS-232 serial connections let both ends configure a parity setting of None, Even, or Odd, and both sides had to agree, since a receiver checking for even parity against a sender transmitting odd parity would flag every single byte as corrupted, even when nothing was actually wrong — a classic, easily-missed source of communication errors caused by mismatched configuration rather than any real data corruption.
This site also offers dedicated single-purpose Even Parity and Odd Parity calculators for the same fixed 8-bit byte, plus a general-length Parity Bit instrument for data blocks other than exactly 8 bits — this instrument sits between them, showing both parity conventions together for a byte-sized block specifically.
- Toggle Bit 1 through Bit 8 to set the 8-bit data byte you want to check.
- Read Number of 1-bits in the data for the raw count of bits currently set to 1.
- Read Even parity bit — the bit that makes the total count of 1s, data plus parity, come out even.
- Read Odd parity bit — the bit that makes that same total come out odd instead.
- Notice that Even parity bit and Odd parity bit are always exact opposites (0 vs 1) for any byte you enter.
Worked example — data byte 1,0,1,1,0,0,0,0
Set bit1=1, bit2=0, bit3=1, bit4=1, bit5=0, bit6=0, bit7=0, bit8=0. Number of 1-bits in the data reads 3 — an odd count. Even parity bit reads 1, because adding one more 1 to an odd count of 3 brings the total to 4, an even number. Odd parity bit reads 0, because a count of 3 is already odd, so no extra 1 is needed to keep the total odd.
The two parity bits, 1 and 0, are exact opposites, as they always are for the same data — whichever convention a real system is configured to use, this side-by-side view makes it clear at a glance what each one would produce for this specific byte, without needing to check two separate tools or mentally flip one result to get the other.
Questions
What's the difference between even parity and odd parity?
Both schemes add one extra bit to a data block so the total 1-bit count, data plus parity, follows a fixed rule — even parity forces that total to always be even, while odd parity forces it to always be odd. For any given piece of data, the two conventions always produce opposite parity bits, since they're solving the identical counting problem toward opposite target totals.
Why compute both conventions at once instead of picking one?
Seeing both side by side makes their complementary relationship directly visible — for any byte you enter, Even parity bit and Odd parity bit are always exactly opposite values, and comparing them together makes that immediately obvious rather than requiring two separate lookups or a mental flip. It's also a quick way to check both possibilities at once if you're not yet sure which convention a specific system or protocol is configured to use.
What happens if a serial connection's parity setting doesn't match on both ends?
Every single byte gets flagged as an error, even when nothing was actually corrupted in transmission. If one side is configured for even parity and the other for odd, the receiver's parity check will disagree with every incoming byte's parity bit, since the two ends are computing the check against opposite target totals — a classic, often confusing source of communication failures caused entirely by configuration mismatch, not real data corruption.
Can a parity bit detect more than one flipped bit?
No — a single parity bit, under either convention, reliably catches any odd number of bit flips (one, three, five, and so on), because an odd number of flips always changes whether the total 1-count is even or odd. It completely misses an even number of flips (two, four, and so on), since those cancel out and the total's evenness or oddness stays exactly what it was before, leaving the corrupted data undetected by parity alone.
How is this different from the site's dedicated Even Parity and Odd Parity calculators?
The underlying math is identical — this instrument just computes both conventions together for the same 8-bit byte on one screen, rather than committing to a single convention the way the dedicated single-purpose calculators do. Use this one when you want to compare even and odd parity directly; use the dedicated tools when you already know which convention a specific system uses and just want that one figure.