Files
wuffs/std/crc32
Nigel Tao 99597e1ff1 Raise the N in crc32's slicing-by-N from 8 to 16
name                          old speed      new speed      delta
wuffs_crc32_ieee_10k/clang    2.35GB/s ± 0%  2.86GB/s ± 1%  +21.45%  (p=0.000 n=47+5)
wuffs_crc32_ieee_100k/clang   2.35GB/s ± 0%  2.86GB/s ± 2%  +21.84%  (p=0.000 n=48+5)
wuffs_crc32_ieee_10k/gcc      2.69GB/s ± 0%  3.36GB/s ± 1%  +25.10%  (p=0.000 n=47+5)
wuffs_crc32_ieee_100k/gcc     2.68GB/s ± 1%  3.39GB/s ± 0%  +26.39%  (p=0.000 n=44+5)
wuffs_gzip_decode_10k/clang    213MB/s ± 0%   215MB/s ± 0%   +0.95%  (p=0.000 n=46+5)
wuffs_gzip_decode_100k/clang   237MB/s ± 0%   240MB/s ± 0%   +1.31%  (p=0.000 n=48+5)
wuffs_gzip_decode_10k/gcc      241MB/s ± 1%   246MB/s ± 0%   +2.00%  (p=0.000 n=45+5)
wuffs_gzip_decode_100k/gcc     283MB/s ± 1%   290MB/s ± 0%   +2.25%  (p=0.000 n=48+5)
2018-10-07 21:01:18 +11:00
..
2018-03-25 16:58:23 +11:00

CRC32

Crc32 (Cyclic Redundancy Check 32) is a checksum algorithm that hashes byte sequences to 32 bit values.

The algorithm is based on polynomial division. In theory, a variety of polynomials can be used. In practice, only two are widely used. The IEEE polynomial is used by Bzip2, Ethernet (IEEE 802.3), Gzip, MPEG-2, PNG, SATA, Zip and other formats. The Castagnoli polynomial is used by Btrfs, Ext4, iSCSI, SCTP and other formats.

TODO: a worked example.