v0.5.0

v0.5.0 - 2026-03-14

Performance

• Slice-by-4 CRC-32 Algorithm: Replaced the byte-at-a-time CRC-32 checksum calculation with a Slice-by-4 implementation. By utilizing 4 pre-computed lookup tables (crct, crct1, crct2, crct3), the algorithm processes 4 bytes per loop iteration with independent table lookups, breaking the serial dependency chain of the previous unrolled approach. This yields ~3.1x throughput improvement on CRC-32 operations.

Testing & Chores

• Slice-by-4 Validations: Added test cases covering various alignment boundaries (1, 3, 5, 16 bytes), chunk-based incremental consistency, and sequential data cross-verifications to validate the correctness of the new CRC pipelines.