ADLER32 Hash Generator
Type or paste any text to instantly compute its Adler-32 checksum in decimal and hexadecimal.
Input Text
0 bytes · 0 characters
Adler-32 Checksum
Algorithm Breakdown
Modulus (MOD_ADLER)
65521
Largest prime < 216
Final A (low 16 bits)
—
Final B (high 16 bits)
—
Formula: checksum = (B << 16) | A
Copied!
Summary
Type or paste any text to instantly compute its Adler-32 checksum in decimal and hexadecimal.
How it works
- Type or paste your text into the input area.
- The tool initializes A = 1 and B = 0 (the Adler-32 starting values).
- Each byte of the input updates A = (A + byte) mod 65521 and B = (B + A) mod 65521.
- The final checksum is (B << 16) | A, displayed as a 32-bit value.
- Results appear instantly in decimal, hexadecimal (upper and lower case), and binary.
- Click any result field to copy that value to your clipboard.
Use cases
- Verify the integrity of a small text payload or configuration value.
- Learn how the Adler-32 algorithm works step by step.
- Generate expected checksums for unit tests involving data integrity.
- Cross-check Adler-32 output when debugging compression libraries (zlib uses it).
- Quick sanity-check that two strings are identical without storing either.
- Educational exploration of checksum algorithms for developers.
Frequently Asked Questions
Related tools
Last updated: 2026-05-23 ·
Reviewed by Nham Vu