fiatjaf _@fiatjaf.com 2 months ago Daniel Lemire's blogXor Filters: Faster and Smaller Than Bloom FiltersIn software, you frequently need to check whether some objects is in a set. For example, you might have a list of forbidden Web addresses. As someo... seems to be a good fit. I have the impression that there is a single design and everybody can implement it the same way. And it's made for static filters, which they will be if we share them in events.
Vitor Pamplona _@vitorpamplona.com 2 months ago People can use many hash types, rounds, sizes and so on. We need to specify it.