• Home
 · 
• Files/File Controls/Input/Output
 · 
• Adler-32 algorithm

Adler-32 algorithm

Pure visual basic implementation of the Adler-32 algorithm. It is much faster than the CRC32 algorithm yet still provides an extremely low probability of undetected errors. Commonly used in the ZLIB/Deflate Compressed Data Format Specification version 3.3. More info can be found at https://www.info-zip.org/pub/infozip/zlib/rfc-zlib.htm

Assumes
When passing byte arrays be carefull of the file size. It is best to break the file into chunks and call Adler32 multiple times. Byte array is limited to the amount of addressable memory in the process space. The outcome is, pass a 712 meg array and watch your machine grind to a halt while the hard disk tries to page things in and out of memory. Use chunks!

Rate Adler-32 algorithm

• 1
• 2
• 3
• 4
• 5

(9(9 Vote))

Download Adler-32 algorithm