rich1.0SatsAndSports (npub1zt…wxm56)https://nostr.ae/npub1zthq85gksjsjthv8h6rec2qeqs2mu0emrm9xknkhgw7hfl7csrnq6wxm56njumphttps://nostr.aeThanks Johnathan! I think I understand much of that already thanks, including the split-horizon stuff, thanks the your excellent docs that you already have. I'm just trying to identify some simple invariants which might also help when I'm trying to share my understanding with others If there are N nodes in total in a (connected) network, then there will be at least 2N-2 (possibly distinct) Bloom Filters, right? I.e. two for each spanning-tree-edge I ask because some people say N, instead of 2N-2, in that statement