Show HN: BEBB4185 – simple hash that passes SMHasher, 2-5GB/s
github.com
github.com
Also the ECRYPT benchmark is 4x faster than Blake3^1.
0: https://rurban.github.io/smhasher/doc/BEBB4185.txt
1: https://bench.cr.yp.to/impl-hash/bebb4185.html
I could hack around with it but I have no firm ideas on how to improve these metrics, and I just wheeled it out on a whim, if anyone wants to try? I was thinking maybe adding an OR into the round function, something like:
state[0] |= 0b0000000000010000000000000
For example, just to add a bit of fixed input or whatever in each round, and contrast with the entropy of mixing, but this is untested and I have no idea how it would test in SMHasher. Anyway, just throwing this out there. If you wanna try, I recommend you fork SMHasher and develop the BEBB4185 code in there and see if you get better results!