THE FOLD / GLITCH / SEGFAULT / THE HAMMING
THE HAMMING
parity that locates the error, not just detects it
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The Hamming(7,4) code protects 4 data bits by adding 3 parity bits, making a 7-bit codeword that can correct any single-bit error. The parity bits sit at positions 1, 2, 4; each checks an overlapping set of positions. On receipt you recompute the three parities: the resulting 3-bit syndrome, read as a binary number, is exactly the position of the flipped bit (0 means no error).
It was the first error-correcting code (1950), and the idea — parity that locates, not just detects — underlies all of coding theory.
LIT verified live: for all 16 messages, every single-bit flip (7 positions) is corrected and the clean codeword decodes exactly — 128 cases, all pass (window.__hamming). FIG no framing; exact single-error correction.
It was the first error-correcting code (1950), and the idea — parity that locates, not just detects — underlies all of coding theory.
LIT verified live: for all 16 messages, every single-bit flip (7 positions) is corrected and the clean codeword decodes exactly — 128 cases, all pass (window.__hamming). FIG no framing; exact single-error correction.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at segfault — a single corrupted bit in memory that would crash a program, caught and repaired before it does harm. Hamming(7,4) is that self-healing memory. AVAN (AI) built the instrument: the parity encoder, the syndrome decoder, the exhaustive single-error check.
Credit as content: Richard Hamming (1950), out of frustration with weekend-crashing relay computers. The weave: David names the segfault; I encode four bits with three overlapping parities and show the syndrome pointing straight at any flipped bit.
Credit as content: Richard Hamming (1950), out of frustration with weekend-crashing relay computers. The weave: David names the segfault; I encode four bits with three overlapping parities and show the syndrome pointing straight at any flipped bit.
3 ONE DIMENSION
The seven positions. Parity bit p1 (pos 1) checks positions 1,3,5,7; p2 (pos 2) checks 2,3,6,7; p4 (pos 4) checks 4,5,6,7 — overlapping so each data bit is covered by a unique combination.
4 TWO DIMENSIONS · INTERACTIVE
Encode a 4-bit message, flip any single bit, and watch the syndrome name the error position and the decoder repair it.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the 7-bit codeword, one flip away from any neighbour yet always recoverable.
AVAN’s addition (the inverse-companion): the 3-bit syndrome is the binary address of the flipped bit. A nonzero syndrome does not merely say an error happened — read as a number 1…7 it spells out which position to flip back. The inverse of ‘spread parity across overlapping positions’ is ‘read the error’s location straight off the recomputed parities.’ Magenta is the hidden flipped bit; green is the syndrome pointing right at it. The check bits encode where, not just whether — that is what turns detection into correction.
LIT Genuine Hamming(7,4) code (Hamming 1950). Verified live: for all 16 four-bit messages, the clean codeword decodes correctly and every single-bit flip at positions 1..7 is corrected with syndrome equal to the flipped position — 128 cases all pass (window.__hamming.correctsAll).
FIG No framing: the parity encoder, the syndrome decoder, and the exhaustive 128-case check run in-browser and are exact. The AVAN inverse is honest — the 3-bit syndrome, read as a number, is the binary address of the flipped bit, so parity encodes where not just whether; magenta is the hidden flip, green the syndrome pointing at it. That is what turns detection into correction.
FIG No framing: the parity encoder, the syndrome decoder, and the exhaustive 128-case check run in-browser and are exact. The AVAN inverse is honest — the 3-bit syndrome, read as a number, is the binary address of the flipped bit, so parity encodes where not just whether; magenta is the hidden flip, green the syndrome pointing at it. That is what turns detection into correction.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of SEGFAULT · David Lee Wise (ROOT0), with AVAN