4 ms·

I think it is probably universal, but I have to show it to know for sure. I'm going to keep calling it universal until I know more. I think I note it in the RE

I think it is probably universal, but I have to show it to know for sure. I'm going to keep calling it universal until I know more. I think I note it in the README, but some reasons I think it is probably universal are because tifuhash can be parameterized, and it has good independence properties ( passes PractRand ). Showing it is universal or not is another step. I suppose I could experiment, to see if the collision probabilities match the criteria for universal or k-universal. Or maybe I could show it. For showing it, my next step is to read over this paper[1] to see if I can use its methods to show universality. I think it is using properties of the bits under multiplication. And I believe one avenue would be to show it using properties of the bits under division. I don't know how to approach the bits under division right now. [1]: https://arxiv.org/abs/1504.06804 https://arxiv.org/abs/1504.06804

lorenzhs 9y ago
I admire your confidence but I don't share it - showing universality for a complex construct like yours is rather nontrivial. You should really start by testing with SMHasher, though. Best of luck.
- 19eightyfour 9y ago
  Okay, I'll start with that next time, thanks
- 19eightyfour 9y ago
  Maybe i ought to have just said that the title includes the qualifier, " - that's the aim anyway," reinforcing the notion that even if we don't know if tifuhash is universal, it aims to be. So work is ongoing in that area, and you're welcome to contribute code or work on an approach to prove it is universal at some point. If you have more you'd like to contribute, you could become co author potentially. Please try to see it like that. That's the idea I'm going for here. Thanks
- 19eightyfour 9y ago
  Thanks for encouraging me to use SMHahser. I posted the SMHasher results here: https://github.com/dosaygo-coder-0/smhasher/blob/master/tifuhash.results.txt https://github.com/dosaygo-coder-0/smhasher/blob/master/tifu... And my SMHasher fork testing tifuhash is here: https://github.com/dosaygo-coder-0/smhasher https://github.com/dosaygo-coder-0/smhasher

lorenzhs 9y ago

I admire your confidence but I don't share it - showing universality for a complex construct like yours is rather nontrivial. You should really start by testing with SMHasher, though. Best of luck.

19eightyfour 9y ago
Okay, I'll start with that next time, thanks
19eightyfour 9y ago
Maybe i ought to have just said that the title includes the qualifier, " - that's the aim anyway," reinforcing the notion that even if we don't know if tifuhash is universal, it aims to be. So work is ongoing in that area, and you're welcome to contribute code or work on an approach to prove it is universal at some point. If you have more you'd like to contribute, you could become co author potentially. Please try to see it like that. That's the idea I'm going for here. Thanks
19eightyfour 9y ago
Thanks for encouraging me to use SMHahser. I posted the SMHasher results here: https://github.com/dosaygo-coder-0/smhasher/blob/master/tifuhash.results.txt https://github.com/dosaygo-coder-0/smhasher/blob/master/tifu... And my SMHasher fork testing tifuhash is here: https://github.com/dosaygo-coder-0/smhasher https://github.com/dosaygo-coder-0/smhasher