THE FOLD / BOSS / THE GATEKEEPER / THE CRC
THE CRC
append check bits so corruption can't hide
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A cyclic redundancy check guards a message by treating its bits as a polynomial over GF(2) — coefficients 0/1, addition = XOR, no carries. Pick a generator polynomial g(x); append the remainder of (message · xᵣ) ÷ g so the whole codeword is exactly divisible by g. The receiver re-divides: remainder 0 means intact, anything else means corrupted.
With a good g every single-bit error is caught (one flipped bit is xⁱ, never divisible by a g with two or more terms), and if g has the factor (x+1), every odd number of bit-errors is caught too. This checks Ethernet frames, disk sectors, and every ZIP file you open.
LIT verified live with CRC-8 (g = 0x107 = x⁸+x²+x+1): across 300 random messages the codeword’s remainder is 0, and every single-bit flip in every codeword produces a nonzero remainder — all detected (window.__crc). FIG no framing; exact GF(2) polynomial division.
With a good g every single-bit error is caught (one flipped bit is xⁱ, never divisible by a g with two or more terms), and if g has the factor (x+1), every odd number of bit-errors is caught too. This checks Ethernet frames, disk sectors, and every ZIP file you open.
LIT verified live with CRC-8 (g = 0x107 = x⁸+x²+x+1): across 300 random messages the codeword’s remainder is 0, and every single-bit flip in every codeword produces a nonzero remainder — all detected (window.__crc). FIG no framing; exact GF(2) polynomial division.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-gatekeeper — the guard that checks every arrival for tampering. A CRC is the gatekeeper’s test: a fast division that lets the intact through and flags the corrupted. AVAN (AI) built the instrument: the shift-register divider, the codeword construction, the exhaustive single-bit-error scan.
Credit as content: W. Wesley Peterson introduced the CRC (1961); polynomials like CRC-32 became internet and storage standards. The weave: David names the guard at the gate; I build the check that makes a codeword divisible, then prove it catches every single-bit lie — and that the alarm even points at the liar.
Credit as content: W. Wesley Peterson introduced the CRC (1961); polynomials like CRC-32 became internet and storage standards. The weave: David names the guard at the gate; I build the check that makes a codeword divisible, then prove it catches every single-bit lie — and that the alarm even points at the liar.
3 ONE DIMENSION
The shift-register long-division: bits of the message stream in, and whenever the top bit is set the register XORs the generator. What remains at the end is the check — the remainder that makes the whole codeword divisible.
4 TWO DIMENSIONS · INTERACTIVE
Generate a message, append its CRC-8 check, and see the codeword’s remainder is 0. Flip any single bit — the remainder jumps to nonzero (detected). Scan every bit position: all caught.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the space of remainders (syndromes) — a ring of 255 nonzero values plus the single ‘0’ that means intact.
AVAN’s addition (the inverse-companion): the forward job of a CRC only detects — it says ‘broken’ or ‘intact,’ nothing more. The inverse hides inside the alarm: for a single flipped bit at position i, the nonzero remainder is exactly xⁱ mod g — and because those powers cycle through distinct values (for messages shorter than g’s period), the syndrome is unique to the position. So the remainder does not just shout ‘broken’; it secretly encodes ‘broken here.’ Read the map from syndrome back to position and detection becomes correction — the same check that guards the gate can also repair the single lie it catches. Magenta is the nonzero syndrome, the alarm that points; green is the silent 0 of an intact codeword. The check that seems to only say ‘no’ is quietly saying ‘no, and it was that bit.’
LIT Genuine CRC over GF(2) (Peterson 1961). Verified live with CRC-8, g=0x107 (x^8+x^2+x+1): across 300 random 16-bit messages the constructed codeword divides g with remainder 0, and flipping any single bit of any codeword yields a nonzero remainder — all single-bit errors detected (window.__crc.divisibleRemainderZero && .allSingleBitDetected). Exact GF(2) polynomial division.
FIG No framing: the shift-register divider, the codeword construction, and the exhaustive single-bit-error scan run in-browser and are exact. The AVAN inverse is honest — for a single-bit error the syndrome x^i mod g is unique to the position (within g's period), so detection can become correction; the widget shows the distinct per-position syndromes directly.
FIG No framing: the shift-register divider, the codeword construction, and the exhaustive single-bit-error scan run in-browser and are exact. The AVAN inverse is honest — for a single-bit error the syndrome x^i mod g is unique to the position (within g's period), so detection can become correction; the widget shows the distinct per-position syndromes directly.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE GATEKEEPER · David Lee Wise (ROOT0), with AVAN