Oddbean

Very costly for the server then. But I think there are DBs that support probabilistic filters. Cuckoo filters maybe. Redis appears to support Cuckoo and Bloom. On the other hand, a 1/10000 FPP would give you the events of 1/10000 users which hopefully will be a lot. Yet on the other hand, these filters are typically used with much lower FPP.

Aren't bloom filters faster than string comparisons? Maybe they aren't faster than pre-computed indexes? Also, I assume relays would pre-compute and store the set of hashes needed for a standard Nostr Bloom filter.

Bloom filters use sort of string comparisons. They use bitmask comparisons. I'm not sure how an index could work for such a bitmask but apparently redis does something there. Pre-computing the hashes would make things super expensive again. In your example of a 67kB Bloom filter, pubkeys extended with hashes would be 67kB each, too. I tried to do this myself but the best I got was to use probabilistic filters to save memory for active filters, not for querying the DB and thus not for the communications neither. The nice part is that you can mix event IDs and authors in the same filter. https://github.com/Giszmo/NostrPostr/blob/master/nostrpostrlib/src/main/java/nostr/postr/Filter.kt#L195

Leo, I need to define a bloom/cuckoo filter format for pubkeys so that implementation A creates the filter that implementation B will use. Do you have any recommendations on how to encode the resulting filter itself? The filter will be saved in every event as a tag, so it must be something the other client can easily decode and apply. Bonus if the writer of the filter can specify the precision. Any tips?

I'm not sure what you want to achieve exactly but bloom filters are really trivial in how they work and thus easy to serialize. Now as you are talking about use across implementations, you would need some serialization standard or come up with one. I know there are libraries that allow serialization but apparently the serializations they consume or produce are not compatible from one library to the other. If you have a compelling use case for a nip for example, I bet we can come up with a standard for nostr. Are you working on something? With regards to your original question, I think it's easier and more efficient to maybe tag lists in queries so you can refer to these tags in subsequent queries as 67kB big data structures aren't great to keep around with every pubkey for example and neither are 67kB great to index.

Summary of Blackwell and Klukowski: States Should Pass Proof of Citizenship Laws to Register to Vote nostr:nevent1qqsvy5ejvl3366k5glrz99pqn0jv5ugm55aslgdyktnthv8jhmp33uqzyrcs35mdw74l9rxpcrf4r4ltpg27a0pwd7kjj7xpzuc636tv4g22gqcyqqqqqqgnp9ha9 The Supreme Court has ruled that states can require proof of citizenship to register to vote, and Republican governors and lawmakers should pass such election integrity measures ahead of Election Day. The court's decision suggests that requiring proof of citizenship to register to vote is allowed under federal law, and over 86% of Americans agree that noncitizens should not participate in U.S. elections. Republican governors should call special sessions to pass similar laws, which would strengthen voter confidence and election security.

vmess://eyJhZGQiOiAiMjAyLjc4LjE2Mi41IiwgImFpZCI6IDAsICJob3N0IjogInBlbmRhci5vbnRoZXdpZmkuY29tIiwgImlkIjogIjcxNmVkZWQ2LTIyMDEtNGRiZC05ZDYzLTE2MzhjOWU4ZTY3NyIsICJuZXQiOiAid3MiLCAicGF0aCI6ICIvQGZvcndhcmR2MnJheSIsICJwb3J0IjogNDQzLCAicHMiOiAiZ2l0aHViLmNvbS9mcmVlZnEgLSBcdTUzNzBcdTVlYTYgIDEwIiwgInRscyI6ICJ0bHMiLCAidHlwZSI6ICJhdXRvIiwgInNlY3VyaXR5IjogImF1dG8iLCAic2tpcC1jZXJ0LXZlcmlmeSI6IHRydWUsICJzbmkiOiAiIn0=

Giving my new vortex a try. Let’s see how they come out. https://www.diningandcooking.com/1441659/giving-my-new-vortex-a-try-lets-see-how-they-come-out/ #WeberGrills #WeberStephenGrills #WeberStephenProductsLLC https://media.vive.im/media_attachments/files/112/593/353/368/030/921/original/d4b3cacf518ec096.jpeg