Files
wuffs/std/crc32
Nigel Tao 58cd282138 Unroll the std/crc32 loop
name                          old speed      new speed      delta
wuffs_crc32_ieee_10k/clang    2.30GB/s ± 1%  2.37GB/s ± 0%  +3.31%  (p=0.016 n=5+4)
wuffs_crc32_ieee_100k/clang   2.30GB/s ± 0%  2.35GB/s ± 0%  +2.39%  (p=0.008 n=5+5)
wuffs_crc32_ieee_10k/gcc      2.49GB/s ± 1%  2.72GB/s ± 0%  +9.19%  (p=0.008 n=5+5)
wuffs_crc32_ieee_100k/gcc     2.50GB/s ± 0%  2.70GB/s ± 1%  +8.18%  (p=0.008 n=5+5)
wuffs_gzip_decode_10k/clang    206MB/s ± 2%   207MB/s ± 0%    ~     (p=1.000 n=5+5)
wuffs_gzip_decode_100k/clang   231MB/s ± 2%   235MB/s ± 0%  +1.57%  (p=0.008 n=5+5)
wuffs_gzip_decode_10k/gcc      234MB/s ± 0%   235MB/s ± 1%    ~     (p=0.095 n=5+5)
wuffs_gzip_decode_100k/gcc     267MB/s ± 0%   266MB/s ± 2%    ~     (p=0.690 n=5+5)
2018-05-04 14:00:04 +10:00
..
2018-05-04 14:00:04 +10: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.