Adler-32 Checksum
Calculate Adler-32
0 characters
0 characters
About Adler-32
Adler-32 is a checksum algorithm developed by Mark Adler. It is used in zlib compression library. Faster than CRC32 but with slightly weaker error detection properties. The algorithm maintains two 16-bit sums: A is the sum of all bytes plus 1, and B is the sum of all A values. Both sums are taken modulo 65521 (the largest prime smaller than 2^16). The final checksum is (B * 65536) + A. Adler-32 is used in the zlib compression library.