Open staltz opened 3 years ago
Like, prefix indexes are basically similar to bloom filters, because they behave the same regarding false positives. But maybe we could have a bloom filter for "I follow X" foreach X and another for "I block X" foreach X. Maaaybe. But there are also other data structures there.
Yes that library is very interesting. Will have a look when I get better time :)
I was reading up on set replication and was reading Kleppmann's algorithm for this. It has this interesting graph:
That said, it seems the graph is based on 10bit truncation.
Hah, I'm trying to run his python script on 32 bits and I think there is a hidden crypto miner in there, or it's just very inefficient. There is a very big difference between 32 and 10.
Not sure if we can/should use bloom filters, but this library looks good and supports export/import to JSON string. https://callidon.github.io/bloom-filters/