Hacker News new | ask | show | jobs
by Freaky 3267 days ago
That seems a roundabout way of sizing a bloom filter. Here's what I came up with when I first implemented them for Newzbin: https://hur.st/bloomfilter

    m = ceil((n * log(p)) / log(1.0 / (pow(2.0, log(2.0)))));
    k = round(log(2.0) * m / n);
1 comments

Thank you for this!

I actually used this site today. Found it on google...

Glad you found it useful :)