Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

30
  • 12
    For what purpose, security or other? Commented Feb 19, 2011 at 0:05
  • 37
    @Orbling, for implementation of a hash dictionary. So collisions should be kept to a minimal, but it has no security purpose at all. Commented Feb 19, 2011 at 0:06
  • 5
    Note that you will need to expect at least some collisions in your hash table, otherwise the table will need to be enormous to be able to handle even a relatively small number of keys... Commented Feb 19, 2011 at 1:14
  • 25
    Great post! Could you also check's Yann Collet's xxHash (creator or LZ4), which is twice as fast as Murmur? Homepage: code.google.com/p/xxhash More info: fastcompression.blogspot.fr/2012/04/… Commented May 29, 2012 at 12:35
  • 27
    @zvrba Depends on the algorithm. bcrypt is designed to be slow. Commented Oct 31, 2013 at 19:20