Vitor Pamplona on Nostr: Aren't bloom filters faster than string comparisons? Maybe they aren't faster than ...
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.
Published at
2024-08-19 17:34:34Event JSON
{
"id": "9bbbb0e5202cb23702c8cecfb12334a0aca15c9be456ba9663e54f0a92e5a636",
"pubkey": "460c25e682fda7832b52d1f22d3d22b3176d972f60dcdc3212ed8c92ef85065c",
"created_at": 1724088874,
"kind": 1,
"tags": [
[
"e",
"75f8b4e77cad6eb2d5dcdef11e195954baa6b0f97405e353a4a051af9291c80a",
"",
"root"
],
[
"e",
"437f4d14b9794da37ab91ae4efa397aa2e2d3c51e094701f38328af64f0fe90a"
],
[
"e",
"2721672a4550189b6c36693ef926de49600817721d95cd53ccf2548937340404",
"",
"reply"
],
[
"p",
"460c25e682fda7832b52d1f22d3d22b3176d972f60dcdc3212ed8c92ef85065c"
],
[
"p",
"5b459807bf935ddc2f83405821bced1c8a05dfee7c80b000c337ba6bd0ad78ed"
],
[
"p",
"46fcbe3065eaf1ae7811465924e48923363ff3f526bd6f73d7c184b16bd8ce4d"
]
],
"content": "Aren't bloom filters faster than string comparisons? Maybe they aren't faster than pre-computed indexes?\n\nAlso, I assume relays would pre-compute and store the set of hashes needed for a standard Nostr Bloom filter. ",
"sig": "f60dc1be665c0a6273c3cf9a8669bb2ba2a0054533ae976e6f36fdb381bee375b184004938342dc747ef49a13dac4e982a4c98e4482e508a23fae68ce4c7f7c1"
}
