From World90@21:1/5 to All on Wed Dec 23 10:53:27 2020
Hello..
About hash function collision and scalability..
About Birthday’s
paradox(https://en.wikipedia.org/wiki/Birthday_problem): Wikipedia gives
us an approximation to the collision probability assuming that the
number of objects r is much smaller than the number of possible values
N: 1-exp(-r**2/(2N)).
This is a so important result, since my good 32 bit hash functions
in my following software projects can attain only a probability of 50%
for a collision at around 77000 cores and and 77000 threads, so it is
good for scalability even if i am not using a good 64 bit hash function,
(but i will soon upgrade them to a good 64 bit hash function),
so here is my following software projects: