ExploreTrendingAnalytics
Nostr Archives
ExploreTrendingAnalytics
Johnathan Corgan1h ago
Well, to be clear, with k peers the node only stores one bloom filter from each one. During the gossip protocol updates the ones sent up and down the spanning tree are calculated on-the-fly as needed, not stored. So they are 'possible' bloom filters but not stored bloom filters.
💬 1 replies

Thread context

Root: 21b2966d0e05…

Replying to: f53b56ce1aca…

Replies (1)

SatsAndSports1h ago
This diagram has N=6 nodes and 2*N-2 = 10 Bloom filters
0000 sats