This online tool allows you to generate the hash murmur3a of any string.
MURMUR3A length is 8 characters
Hash available
MD2 Hash, MD4 Hash, MD5 Hash, SHA1 Hash, SHA224 Hash, SHA256 Hash, SHA384 Hash, SHA512/224 Hash, SHA512/256 Hash, SHA512 Hash, SHA3-224 Hash, SHA3-256 Hash, SHA3-384 Hash, SHA3-512 Hash, RIPEMD128 Hash, RIPEMD160 Hash, RIPEMD256 Hash, RIPEMD320 Hash, WHIRLPOOL Hash, TIGER128,3 Hash, TIGER160,3 Hash, TIGER192,3 Hash, TIGER128,4 Hash, TIGER160,4 Hash, TIGER192,4 Hash, SNEFRU Hash, SNEFRU256 Hash, GOST Hash, GOST-CRYPTO Hash, ADLER32 Hash, CRC32 Hash, CRC32B Hash, CRC32C Hash, FNV132 Hash, FNV1A32 Hash, FNV164 Hash, FNV1A64 Hash, JOAAT Hash, MURMUR3A Hash, MURMUR3C Hash, MURMUR3F Hash, XXH32 Hash, XXH64 Hash, XXH3 Hash, XXH128 Hash, HAVAL128,3 Hash, HAVAL160,3 Hash, HAVAL192,3 Hash, HAVAL224,3 Hash, HAVAL256,3 Hash, HAVAL128,4 Hash, HAVAL160,4 Hash, HAVAL192,4 Hash, HAVAL224,4 Hash, HAVAL256,4 Hash, HAVAL128,5 Hash, HAVAL160,5 Hash, HAVAL192,5 Hash, HAVAL224,5 Hash, HAVAL256,5 Hash,
What is Murmur3A?
Murmur3A is a high-performance, non-cryptographic hash function belonging to the MurmurHash3 family, developed by Austin Appleby. It is specifically designed to be extremely fast and effective for hash-based lookup tables (hash maps). Because it is non-cryptographic, it is not intended for security or protecting data against malicious attacks; instead, it excels at distributing keys uniformly across a hash table, minimizing collisions in high-load data structures.
How does Murmur3A hash works?
The algorithm processes input data in 4-byte chunks, performing a series of bitwise operations to mix the input bits thoroughly:
- Initialization: It starts with a seed value (a 32-bit integer) to initialize the hash state.
- Body Processing: The input is broken into 32-bit blocks. For each block, the algorithm performs a multiplication by a large constant (the "magic constant"
0xcc9e2d51), a left bit-rotation (ROL), and another multiplication by a second constant (0x1b873593). - Mixing: The result is XORed with the current hash state, and the hash state itself is rotated and multiplied to ensure avalanche effects (where changing one bit in the input changes many bits in the output).
- Finalization: After processing all blocks (and handling any remaining tail bytes), the algorithm performs a final "mix" or "avalanche" step, which uses XOR-shifts to ensure that even small differences in input produce significantly different output hash values.
Difference between Murmur3A and CRC32C
While both are fast, non-cryptographic hash functions, they are optimized for different tasks:
- Collision Resistance: Murmur3A is significantly better at distributing keys uniformly, making it superior for use in hash tables and data structures. CRC32C is designed for error detection in data streams, so it is mathematically tuned to catch corruption patterns rather than distribute keys.
- Performance: CRC32C relies heavily on specific hardware instructions (SSE4.2 on modern CPUs) to be fast. Murmur3A is designed to be highly efficient in pure software implementation, making it faster on older hardware or platforms where hardware-accelerated CRC is unavailable.
- Avalanche Effect: Murmur3A has a much stronger "avalanche effect," meaning the output is much more sensitive to input changes than CRC32C, which is a key requirement for avoiding clusters in hash-based data storage.
