Fast non-cryptographic hash function with excellent distribution properties. Designed for hash tables, bloom filters, and general purpose hashing.
| Property | Value |
|---|---|
| Category | Hash Functions |
| Sub-category | Fast Hash |
| Security status | 🎓 Educational Only |
| Complexity | Not specified |
| Inventor | Austin Appleby |
| Year | 2008 |
| Origin | 🇺🇸 United States |
| Source | algorithms/hash/murmurhash3.js |
| Parameter | Supported values |
|---|---|
| Output sizes | 4 bytes (32 bits) |
Status: 🎓 Educational Only
No vulnerabilities are recorded for this implementation.
3 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — MurmurHash3 Empty String
| Field | Value |
|---|---|
input |
(empty) |
expected |
00000000 |
Vector 2 — MurmurHash3 Single character ‘a’
| Field | Value |
|---|---|
input |
61 |
expected |
3c2569b2 |
Vector 3 — MurmurHash3 Short string ‘abc’
| Field | Value |
|---|---|
input |
616263 |
expected |
b3dd93fa |