Aleksey Vaneev

https://github.com/avaneev/lzav

https://github.com/avaneev/avir

Discrete-Incremental Hashing

28

I've noticed that your Java implementation of `komihash` uses 4-byte values when hashing a string (hashCharsToLong). This looks like a slow approach. Why is that? You can hash using 8-byte...

Please update komihash to v5. I would also like to inquire why komihash's benchmarked speed is low in your .NET implementation? I assume it's due to the use of 64x64...

komihash 5.10

5

Please re-test the speeds of `komihash`. This version should fix the low performance with GCC on Zen. https://github.com/avaneev/komihash

### Describe the bug :58:11: fatal error: 'cstdint' file not found 58 | #include | ^~~~~~~~~ 1 error generated. Compiler returned: 1 ### Steps to reproduce 1. godbolt.org 2. select...

a5hash 5.16 - 32-bit and 128-bit hashes

12

Thanks for posting a5hash 5.7, it showed some minor improvement. But I was able to produce native 32-bit and 128-bit hashes using a similar math construction. I think they beat...

komihash 5.27

9

A minor update - changed prefetch locality from 2 to 3, seems to be favorable to SMHasher. Also changed 64x64 mul to `__uint128_t r = u; r *= v;` style....

a5hash 5.21

1

Posted a new version: https://github.com/avaneev/a5hash Consider including a5hash32 and a5hash128 and a5hash128_64 (variant with `rh` argument 0) - SMHasher3 already included these.