Interesting. It looks like the Castagnoli polynomial is optimized assuming independent bit errors, while the "standard" CRC32 is optimized for consecutive burst

Interesting. It looks like the Castagnoli polynomial is optimized assuming independent bit errors, while the "standard" CRC32 is optimized for consecutive bursts of bit errors (e.g. whole-byte errors). I guess it depends on the use case.