Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
utopcell
on Jan 30, 2020
|
parent
|
context
|
favorite
| on:
Some Useful Probability Facts for Systems Programm...
If you are hashing k unique elements, N=2lg(k) is a good rule of thumb for sizing your hash functions. A Birthday Attack [1] analysis provides the exact collision probabilities for arbitrary (k, N).
[1]
https://en.m.wikipedia.org/wiki/Birthday_attack
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] https://en.m.wikipedia.org/wiki/Birthday_attack