Hacker GitHub

← All repos

lemire/StronglyUniversalStringHashing

View on GitHub ↗ ★ 137 C++

Benchmark showing the we can randomly hash strings very quickly with good universality

3 mentions on Hacker News by 2 people: 0 stories, 3 comments · first 2015-11-21 · latest 2017-03-19

Mentions per year 3 mentions · busiest year 2015 (1)
20082026
AllStoriesComments NewestTopOldest
  1. …good for large data; in our tests it outperformed other algorithms for inputs larger than 1kB. [1] https://github.com/lemire/StronglyUniversalStringHashing
    comment by wmu · 2017-03-19 · in Computing multiple hash values in parallel with AVX2
  2. …delta universal, at a cost of 0.16 cycles per byte on Haswell and 0.10 cycles per byte on Skylake. https://github.com/lemire/StronglyUniversalStringHashing http://arxiv.org/abs/1503.03465
    comment by jbapple · 2016-03-03 · in HighwayHash: Strong hashing at 0.3 clock cycles per byte
  3. …a patch to the repo you linked. The benchmarks from the "Faster 64-bit ..." paper are available at https://github.com/lemire/StronglyUniversalStringHashing . The iterated string hash I referenced is https://github.com/lemire/StronglyUnivers…
    comment by jbapple · 2015-11-21 · in Math.random in V8 is broken