Iโm reading your NIP-76. It only takes 100 bits to handle 10 million keys without any false positives?? Wow. Very cool ๐คฏ
Login to reply
Replies (3)
๐๐ณ
I am not sure if that math is still good. This site can give you a better idea:
It's all about your probability
Bloom filter calculator
Calculate the optimal size for your bloom filter, see how many items a given filter can hold, or just admire the curvy graphs. Also borrow my MIT ...
I think that math was wrong. The 10,000,000 keys was not the number of keys inside the filter (which for NIP-76 would be 2-3 keys on average). But relays would have to check that filter against 10,000,000 + keys that can connect to them. The false positives claim was based on testing 10,000,000 keys against a simple filter like that.