Problemintro
Bit parity
Also called parity of a word, parity bit.
Computing whether a word has an odd or even number of 1-bits, by XOR-folding or table lookup.
Computing whether a word has an odd or even number of 1-bits, by XOR-folding or table lookup.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 5ZBQV5 Edit this page History Report an error