-
See https://github.com/rurban/smhasher/issues/31 .
-
There are massive collisions on ELF symbols (which are functions names found in binaries and shared libraries).
```
05c3bcfaf53bd8d1816832569ec6482f imdi_k488_gentab
05c3bcfaf53bd8d181683256…
-
## summary
https://github.com/nim-lang/Nim/pull/11203 (/cc @narimiran) introduced a performance regression where tables (and anything that uses hashes, eg StringTable etc) can become 100X slower (see…
-
I add wyhash hash function into [my benchmark](https://github.com/hungptit/AquaHash/blob/master/benchmark/random_string.cpp) and below are my observations:
1. myhash is the fastest for the key size…
-
```
[9789/20285] x86_64-pc-linux-gnu-g++ -MMD -MF obj/net/net/quic_framer.o.d -DUSE_UDEV -DUSE_AURA=1 -DUSE_GLIB=1 -DUSE_NSS_CERTS=1 -DUSE_X11=1 -D_FILE_OFFSET_BITS=64 -D_LARGEFILE_SOURCE -D_LAR
GEF…
-
Hi Reini,
please consider taking a look at my latest-n-fastest etude - 'Yorikke':
The source code along with the superheavy (1 trillion unique keys) benchmark is freely downloadable at:
www.sanma…
-
@hmakholm has a smhasher test called LongNeighbors. This test creates similar strings by flipping bits and looking for collisions. I ran Meow 128 through this test and it fails that.
A descriptio…
-
What would be representative set of strings to test the hash?
Should they be long or short?
I thought to run it million/billion times with that strings to see whether it is a difference between hash…
tansy updated
4 years ago
-
Hi Yann,
wanted to share my experience with XXH64 (taken from xxHash-0.7.0.zip) with short keys.
First off, I wasn't able make the binary, had to comment the last line in xxhash.c:
```
//#includ…
-
Hi, I used Lemire's https://github.com/lemire/testingRNG to break t1ha.
The trick is to transform a hash function to a PRNG, and test it using mature PRNG tests, such as testU01 and practrand.
I e…