News for hackers. Stuff that matters.
Re:SeaHash: Explained by llimllib on Friday December 09, 2016 @11:20AM (#13139605)
A good example is for a bloom filter: using sha256 is much too slow for good filter performance, you want something like siphash or some other non-cryptographic hash.

Here's a good story of the performance benefits of switching from cryptographic to non-crypto hashes: https://github.com/bitly/dablooms/pull/19

(But I don't recommend you use murmur anymore: https://emboss.github.io/blog/2012/12/14/breaking-murmur-has... (although tbh I could be wrong on this one, not an expert))

(Shameless plug for my bloom filter tutorial https://llimllib.github.io/bloomfilter-tutorial/ )

Re:SeaHash: Explained by loeg on Friday December 09, 2016 @12:22PM (#13140048)
> But I don't recommend you use murmur anymore

I think xxHash was/is the fastest good non-crypto hash, and now SeaHash may be best. Although I'd like to see a bit more data on that (small keys? large keys? benchmarking methodology) than SeaHash's author is providing.

Re:SeaHash: Explained by llimllib on Friday December 09, 2016 @12:43PM (#13140237)
yeah I should look into that more. aapleby seems to have given some pretty good arguments against SeaHash in the previous discussion: https://news.ycombinator.com/item?id=13058652
Re:SeaHash: Explained by Null-Set on Friday December 09, 2016 @01:13PM (#13140515)
That argument depends on the initial values being the same, you can easily make sure they are not.