News for hackers. Stuff that matters.
Re:Google's “Director of Engineering” Hiring Test by dekhn on Thursday October 13, 2016 @04:47PM (#12703902)
both types of hash convert an input space to an output space where (typically) the input space is much larger.

What matters is whether similar inputs get mapped to the same output. For the case where you want to minimize the probability that two inputs which are highly similar land in the same bucket, you want a crypto hash, although those are expensive so you want a cheaper approximation, which is exactly what fingerprint hashes do. The problem is that as the input values counts approach sqrt(output value size), you're going to start getting collisions, and ideally, you want those collisions to be evenly spaced.

In the case of a similarity hash function, you want the opposite, the closer things are in some metric space, the more likely they end in up in the same bucket.

Re:Google's “Director of Engineering” Hiring Test by bogomipz on Thursday October 13, 2016 @07:15PM (#12704979)
"For the case where you want to minimize the probability that two inputs which are highly similar land in the same bucket, you want a crypto hash"

That's what I was trying to say:

"a tiny change in the input causes a substantial change in the output."

But I probably didn't articulate that very well. I think we are saying the same thing.

You mentioned:

"The problem is that as the input values counts approach sqrt(output value size), you're going to start getting collisions"

Can you elaborate on the significant a square root here? Does this relate to the load factor?

Re:Google's “Director of Engineering” Hiring Test by dekhn on Thursday October 13, 2016 @07:32PM (#12705069)
https://en.wikipedia.org/wiki/Birthday_problem Basically, you get 50% chance of collision around sqrt(size of table).
Re:Google's “Director of Engineering” Hiring Test by bogomipz on Friday October 14, 2016 @03:02PM (#12710335)
Ah right, a probability theory classic. Thanks, cheers.