The constants that fold a 128-bit accumulator forward by bits bits with two carry-less
multiplies: (x^(bits + 32), x^(bits - 32)) modulo p(x), reflected, as 33-bit values (the
K1..K4 of specialized/pclmulqdq.rs, which a test checks).
Builds tables that append len zero bytes to a CRC state a byte at a time: the new state is
the XOR of table[k][(state >> (8 * k)) & 0xFF] for k in 0..4.