Computes a 32-bit cyclic redundancy check over a byte stream using GF(2) polynomial division (reflected polynomial 0xEDB88320) to detect accidental data corruption.
Compact metadata for implementation and discovery.
CRC-32 treats a message as a giant binary polynomial over GF(2) and divides it by the IEEE 802.3 generator polynomial. Using a 256-entry precomputed lookup table processes 8 bits per step in O(n) time, standard across Ethernet, gzip, PNG, and ZIP archives.
Quick facts
Runtime and memory behavior at a glance.
Best
O(n)
Average
O(n)
Worst
O(n)
Space
O(1)
Interactive Runtime & Memory Budget Calculator
Estimate wall-clock latency, operation count, and working memory for CRC-32 (IEEE 802.3 Checksum) across input scales.
428.6 µs
428.6 µs
128 B
R(x) = M(x) \cdot x^{32} \bmod G(x)Polynomial division remainder over GF(2).
Tested TypeScript and Python 3 implementations paired with unit tests covering edge cases, duplicate keys, and boundary conditions.
/**
* CRC-32 Checksum (IEEE 802.3 Polynomial 0xEDB88320) — UTF-8 byte stream + 256-entry lookup table
*/
const CRC32_TABLE = (() => {
const table = new Uint32Array(256);
for (let i = 0; i < 256; i++) {
let c = i;
for (let k = 0; k < 8; k++) {
c = (c & 1) !== 0 ? 0xedb88320 ^ (c >>> 1) : c >>> 1;
}
table[i] = c >>> 0;
}
return table;
})();
export function crc32(input: string | Uint8Array): number {
const bytes = typeof input === "string" ? new TextEncoder().encode(input) : input;
let crc = 0xffffffff;
for (let i = 0; i < bytes.length; i++) {
const byte = bytes[i];
crc = CRC32_TABLE[(crc ^ byte) & 0xff] ^ (crc >>> 8);
}
return (crc ^ 0xffffffff) >>> 0;
}Byte-wise shift-register lookup with pre- and post-inversion.
Standard IEEE 802.3 check value for ASCII "123456789" is 0xCBF43926.
What each reference supports for this entry.
Reference C implementation and polynomial specification for IEEE CRC-32.
Open sourceGood next jumps from the relationship graph, ranked for useful discovery.
Gzip and PNG pair DEFLATE compression with CRC-32 integrity footers.