Reputation
11,622
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
1 9 11
Newest
 Yearling
Impact
~285k people reached

  • 0 posts edited
  • 0 helpful flags
  • 33 votes cast
Nov
9
revised Which hashing algorithm is best for uniqueness and speed?
added 11 characters in body
Nov
9
comment Which hashing algorithm is best for uniqueness and speed?
@Noein The * denotes relative badness, with FNV-1 have no "badness", so there is no * next to it. Meanwhile LoseLose is so bad that the ` spill out over the edge of the chart onto the floor.
Oct
28
awarded  Yearling
Jun
25
comment Which hashing algorithm is best for uniqueness and speed?
@IanDunn It's tucked away in there; but i decided on MurMur2. I wasn't able to implement MurMur3 easily, and so it wasn't tested. Originally i was going to use FNV-1, but changed my mind to Murmur2.
Dec
1
comment Which hashing algorithm is best for uniqueness and speed?
@cciotti I was about to say that i can do that. But then i remembered: that map is 1:1 resolution. There are 216,553 words in the English language, and you see 524,288 pixels (where white is the unfilled hash map). There are no more pixels to show! Were you thinking you'd just like to be able to see a high resolution Hilbert color gradient? 16:10 aspect ratio and 4,000 pixels high?
Oct
28
awarded  Yearling
Sep
12
revised Which hashing algorithm is best for uniqueness and speed?
added 203 characters in body
Sep
12
comment Which hashing algorithm is best for uniqueness and speed?
@KedarMhaswade archive.org has it.
Feb
27
revised Which hashing algorithm is best for uniqueness and speed?
edited body
Oct
28
awarded  Yearling
Oct
24
comment Which hashing algorithm is best for uniqueness and speed?
@yaccz i chewed whatever gum i found laying around. This one i think it was
Oct
17
comment Which hashing algorithm is best for uniqueness and speed?
@JimR i could, but it's Delphi, using various code files of helper routines and classes that i've collected over the years. You're better off to start over in C# or something. The real work was implementing the algorithms. It would be a lot of pain to cull down the relevant files into the required routines; and even then it was only designed for Delphi 7 - using an ide from this decade would require code-rework. In other words: no. :)
Aug
14
awarded  Good Question
Dec
23
awarded  Popular Question
Dec
22
awarded  Announcer
Nov
27
comment How to implement a safe password history
@Mathew Foscarini The downside of generating a password for the user, and forcing them to use it, is that now it has to be written down - completely negating any of the security you were hoping to gain.
Oct
28
awarded  Yearling
May
25
comment Which hashing algorithm is best for uniqueness and speed?
@LouisWasserman CityHash has no 32-bit version; so....no you can't see it covered :)
May
25
revised Which hashing algorithm is best for uniqueness and speed?
added 15 characters in body
May
25
revised Which hashing algorithm is best for uniqueness and speed?
Added mention of old thing article