Knuth Hash for byte[]

Question

Can I use the Knuth Hash to generate a unique hash number for a byte[]?

The normal Knuth Hash algorithm looks like this:

int KnuthHsh(int v)
{
    v *= 2654435761;
    return v >> 32;
}

Is there also a way to input a byte[] and generate a unique Hash value for it?

"a unique Hash"? Not unless your byte[] is guaranteed no larger than your hash - remember the pigeon-hole principle. — Blorgbeard, May 25 '15 at 20:29
Possible duplicate of http://cstheory.stackexchange.com/questions/9639/how-did-knuth-derive-a — Pieter Geerkens, May 26 '15 at 00:09

score 1 · Answer 1 · answered Mar 08 '22 at 18:11

1

    public static ulong CalculateHash(byte[] bytes)
    {
        var hashedValue = 3074457345618258791UL;
        foreach (var b in bytes)
        {
            hashedValue += b;
            hashedValue *= 3074457345618258799UL;
        }
        return hashedValue;
    }

answered Mar 08 '22 at 18:11

giorgizek

21
1

1

How does this answer the question? – Etienne de Martel Mar 08 '22 at 18:12

Knuth Hash for byte[]

1 Answers1