SatsAndSports on Nostr: This fips network has N=six nodes and therefore five (N-1) spanning-tree-edges So we ...

This fips (npub1y0g…00ly) network has N=six nodes and therefore five (N-1) spanning-tree-edges

So we have two blooms filters for each spanning-tree-edge, i.e. 10 (possibly distinct) Bloom filters

Do we also have two more Bloom filters for each of the *non-spanning-tree* peer connections? For example, if B and C peered with each other here, would we therefore have 12 Bloom filters?



jcorgan (npub19wa…8p6k)

I'm pretty sure I know the answer (Yes), but I'm not 100% sure

This diagram is from the intro: https://github.com/jmcorgan/fips/blob/master/docs/design/fips-intro.md