-
Notifications
You must be signed in to change notification settings - Fork 12.9k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[WIP] Use buffered aHash as StableHasher #59598
Conversation
The job Click to expand the log.
I'm a bot! I can only do what humans tell me to, so if this was not helpful or you have suggestions for improvements, please ping or otherwise contact |
The job Click to expand the log.
I'm a bot! I can only do what humans tell me to, so if this was not helpful or you have suggestions for improvements, please ping or otherwise contact |
Is this hash function documented anywhere? Does it provide roughly the same collision probability as a random function? Are its results platform independent? Some previous discussion on which hash function to use: #41215 |
I just aimed for a simpler question? Is it faster? Local testing says no, at least with the buffering scheme and runtime AES instruction detection used here. |
Yes, I'm always interested in numbers there Although ideally, it would be great to get rid of hashing altogether in the long run: #58155 |
@michaelwoerister You can see the documentation here: https://github.com/tkaitchuck/ahash |
@tkaitchuck That looks pretty neat! I don't think it's a good fit for the |
@michaelwoerister I don't see a reason for why we need platform independent results (at least for incremental compilation hashes), but a software fallback producing the same result is always possible. |
The |
Ok. Sounds like this isn't the right fit. |
cc @tkaitchuck
r? @michaelwoerister