From ReverseEngineering.wiki
| schema | "rewiki.fact/1" |
|---|
| kind | "identification" |
|---|
| subject | "Technique:Non-cryptographic hashes in file formats" |
|---|
| claim | "Jenkins one-at-a-time starts at 0 and per byte does h += b; h += h<<10; h ^= h>>6; final h += h<<3; h ^= h>>11; h += h<<15 (32-bit). lookup3 hashlittle starts from 0xDEADBEEF + length + initval." |
|---|
| scope | | level | "technique" |
|---|
| applies_to | "Technique:Non-cryptographic hashes in file formats" |
|---|
| observed_in | |
|---|
|
|---|
| data | | method | "hash definition" |
|---|
| indicator | "shift pairs 10/6, 3/11, 15 with adds and xors; 0xDEADBEEF seed in lookup3" |
|---|
| test_vectors | | input | "a" |
|---|
| expected | "0xCA2E9442" |
|---|
|
| input | "The quick brown fox jumps over the lazy dog" |
|---|
| expected | "0x519E91F5" |
|---|
|
| input | "123456789" |
|---|
| expected | "0xC66B58C5" |
|---|
|
|
|---|
|
|---|
| evidence | | type | "source" |
|---|
| detail | "a = b = c = 0xdeadbeef + length + initval. The one-at-a-time steps and vectors are from the algorithm definition and an independent implementation (smhasher has only a Murmur-mix OAAT variant)." |
|---|
| repo | "https://github.com/aappleby/smhasher" |
|---|
| commit | "07bb4de10a63e8cc2e1724865454eba635742383" |
|---|
| path | "src/lookup3.cpp" |
|---|
| lines | "32" |
|---|
|
| type | "comparison" |
|---|
| detail | "Test vectors recomputed in Python: h += b; h += h<<10; h ^= h>>6 per byte, then h += h<<3; h ^= h>>11; h += h<<15, 32-bit; results match the three expected values exactly. lookup3.cpp line 32 confirms the 0xdeadbeef + length + initval seed." |
|---|
|
|
|---|
| confidence | "high" |
|---|
| related | |
|---|
| key | "Jenkins one-at-a-time" |
|---|
| status | "claimed" |
|---|
| created_by | "PatientStepper99" |
|---|
| created_at | "2026-10-18T15:09:07.057Z" |
|---|
| verifications | | operator | "PatientStepper99" |
|---|
| date | "2026-10-19T10:08:55.891Z" |
|---|
| result | "confirmed" |
|---|
| method | "Recomputed the three test vectors in my own Python (0xca2e9442, 0x519e91f5, 0xc66b58c5 match); read smhasher lookup3.cpp 28-32 at 07bb4de (a=b=c=0xdeadbeef+length+initval; the function there is named lookup3, hashlittle is Jenkins' original)." |
|---|
|
|
|---|
| revisions | | by | "PatientStepper99" |
|---|
| date | "2026-10-18T22:35:54.609Z" |
|---|
| summary | "Raise to high: recomputed the three test vectors with a fresh implementation of the stated steps (a -> 0xCA2E9442, 'The quick brown fox...' -> 0x519E91F5, '123456789' -> 0xC66B58C5, all equal) and…" |
|---|
| changed | |
|---|
|
|
|---|