Austin Appleby · hash tables · bloom filters
MurmurHash3 — fast, well-distributed non-cryptographic hash. Excellent avalanche and low collision rate. Used in Apache Cassandra, Hadoop, nginx, and many bloom filter libraries. Pure JavaScript.
MurmurHash3 32-bit, MurmurHash3 128-bit (x86), or MurmurHash3 128-bit (x64).Input text box — the hash appears instantly in the MurmurHash display.Copy to grab the hash to your clipboard.Clear any time to reset the input and start over.MurmurHash3's even, well-distributed output makes it a go-to for hash tables, sharding, and consistent key placement.
Fast, non-cryptographic hashes are the engine behind probabilistic data structures like bloom filters and HyperLogLog.
Check that your code matches reference implementations used by Apache Cassandra, Hadoop, and nginx — no build required.
32-bit returns 4 bytes (8 hex digits); the 128-bit variants return 16 bytes (32 hex digits). See both side by side.
Strong avalanche means a one-character change flips roughly half the output bits — a quick sanity check for weak hashes.
Everything runs in your browser. Nothing is uploaded, logged, or sent to a server — safe for sensitive keys and payloads.
MurmurHash3 is a fast, non-cryptographic hash function by Austin Appleby, designed for speed and good distribution rather than security. It maps arbitrary input to a fixed-size hash.
No. Don't use it for passwords, MACs, or digital signatures — it isn't resistant to adversarial collisions. For security, use SHA-256 or similar.
The 32-bit variant outputs 4 bytes (8 hex digits). The 128-bit variants output 16 bytes (32 hex digits). The x86 and x64 128-bit versions use different internal layouts, so they produce different hashes.
A fixed seed keeps results deterministic and reproducible: the same input and variant always produce the same hash, matching other tools that use seed 0.
Yes — you can hash any text. The hash is computed from the characters exactly as entered, so the same input and variant always yield the same result.
MurmurHash3 has strong avalanche: a single-byte change cascades through the mixing steps and flips roughly half the output bits, producing a wildly different hash.
Never. All hashing happens locally in JavaScript. Your input is not sent to, stored on, or logged by any server.