News for hackers. Stuff that matters.
Re:SeaHash: Explained by chadaustin on Friday December 09, 2016 @11:04AM (#13139480)
Hi,

I recently used a hash function like this as part of a React-style delta calculation engine but for Swift / iOS.

I needed a hash function that was fast but collision-resistant, and I did not need a cryptographic hash, as all data is trusted (and a hash collision would not actually matter that much).

I chose SpookyHash V2 based on the advice of some peers and http://aras-p.info/blog/2016/08/09/More-Hash-Function-Tests/

Hope that helps, Chad

Re:SeaHash: Explained by libeclipse on Friday December 09, 2016 @11:13AM (#13139557)
Even when I've not needed a cryptographic hash, I've still used one, because why not? I've never not needed one so bad as to resort to some barely studied, homemade hashing algorithm.

> A hash collision wouldn't matter that much.

Interesting. What was the use for the hash function then?

Re:SeaHash: Explained by ticki_ on Friday December 09, 2016 @11:26AM (#13139641)
In hash tables, you never use cryptographic hash functions. Why? Because they're slower.

Take SHA3, which is around 50x slower than SeaHash. That is really really bad for hash tables.

When hash collisions happen in hash tables, they're resolved through collision-resolution strategy, such a linear proping.

Fingerprints are one very narrow usecase for hash functions, and there are tousands of other uses.

Re:SeaHash: Explained by jjaredsimpson on Friday December 09, 2016 @11:34AM (#13139697)
> Even when I've not needed a cryptographic hash, I've still used one, because why not?

To avoid wasting cpu cycles preserving a property you don't need. Seahash should be 50x faster than sha3

Re:SeaHash: Explained by falcolas on Friday December 09, 2016 @11:47AM (#13139819)
A trade off between collision potential vs. speed. Sometimes you need speed more than you need cryptographic levels of collision avoidance.

For example, finding unique files on the file system. After looking at size, first and last bytes, it would be better to filter quickly on an imperfect hash (with, say, a 1 in 1^56 chance of collision) than slowly on a perfect hash (with a 1 in 1^256 chance).

Re:SeaHash: Explained by mdergosits on Friday December 09, 2016 @12:12PM (#13139986)
I hope you mean 2^56 and 2^256 :)
Re:SeaHash: Explained by stcredzero on Friday December 09, 2016 @12:25PM (#13140079)
We can increase that by one to the fourth power!

http://aperiodical.com/2013/05/the-maths-of-star-trek-the-or...

Re:SeaHash: Explained by zeveb on Friday December 09, 2016 @12:53PM (#13140336)
> Even when I've not needed a cryptographic hash, I've still used one, because why not?

Performance. Take a look at djb's (non-cryptographic) hash, with a constant multiplier chosen to be implemented with a shift and an add — that's the level of performance a non-cryptographic hash (e.g. for hash tables & similar purposes) needs.

https://gist.github.com/hmic/1676398

Re:SeaHash: Explained by ticki_ on Friday December 09, 2016 @03:48PM (#13141706)
Please don't. DJB2 is a poor hash function. It's similar to FNV: Entropy only moves upwards, so flipping higher bits doesn't affect lower bits.

In other words, you risk mapping `n` and `-n` to the same value under some modulus.

Re:SeaHash: Explained by matt4077 on Friday December 09, 2016 @11:40AM (#13139757)
Caching often relies on hash functions. If you run the Cloudflare cache, you'll start caring, considering hashing is usually >50% of the CPU workload and an optimized non-cryptographic hash function can be 20x faster.