xxHash Hash Calculator
hash
All hashing runs in your browser. Data is never sent to any server.
Text Input
File Input
Drag & drop a file or click to select
1. How to Use
- Select xxHash32 or xxHash64 variant.
- Enter text or upload a file to generate xxHash.
- Click 'Generate xxHash' for the result.
- Use for fast checksum comparison or deduplication hashing.
- File upload supported for large-file hashing.
2. How It Works
xxHash uses a combination of multiplications, rotates, and XORs. No cryptographic operations—optimized purely for speed.
xxHash32: 32-bit state, primes p1=2654435761, p2=2246822519, p3=3266489917, p4=668265263, p5=374761393. Process 4-byte blocks: h = ROL(h + block·p3, 17) · p4. Final: avalanche (mix and shift) for better distribution.
xxHash64: Same idea with 64-bit arithmetic and different primes. Processes 8-byte blocks. Final 64-bit value.
Avalanche step: h ^= h >> 33; h *= 0xff51afd7ed558ccd; h ^= h >> 33; h *= 0xc4ceb9fe1a85ec53; h ^= h >> 33.
3. About xxHash
xxHash is an extremely fast non-cryptographic hash by Yann Collet. xxHash32 and xxHash64 are used for deduplication, caching, and content-addressable storage.
This xxHash calculator supports both 32-bit and 64-bit variants. Choose based on output size and collision requirements.
All hashing runs locally—no server involvement.
4. Advantages
- Extreme speed: Among the fastest hashes available; often 10× faster than MD5.
- Good distribution: Despite non-cryptographic, has low collision rate for similar inputs.
- Deduplication: Used in databases and storage for content addressing.
- Flexibility: 32-bit and 64-bit variants for different needs.
5. Real-World Use Cases
- Deduplication: Identify duplicate files or blocks quickly.
- Caching: Cache keys for distributed systems.
- Checksums: Fast integrity checks for large datasets.
- LZ4/Zstd: xxHash used internally in some compression libraries.