Thanks Johnathan!

12ee03d11684a125...
npub1zthq85gksjsjthv8h6rec2qeqs2mu0emrm9xknkhgw7hfl7csrnq6wxm56
hex
f53b56ce1acacf14c8379edadac97fb8485b8ec9551e15bd836d1932bad43af6nevent
nevent1qqs02w6kecdv4nc5eqmeakk6e9lmsjzm3my428s4hkpk6xfjht2r4asprpmhxue69uhhyetvv9ujuem4d36kwatvw5hx6mm9qgsp9msr6ytgfgf9mkrmapuu9qvsg9d78ua3ajntfmt580t5llvgpesxmkgdeKind-1 (TextNote)
↳ Reply to Event not found
6fcb7e033ec863f364aae0d9e4f43ab62b40bdeb20a0633dcd181a048e0ecfff...
Thanks 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
Raw JSON
{
"kind": 1,
"id": "f53b56ce1acacf14c8379edadac97fb8485b8ec9551e15bd836d1932bad43af6",
"pubkey": "12ee03d11684a125dd87be879c28190415be3f3b1eca6b4ed743bd74ffd880e6",
"created_at": 1773774180,
"tags": [
[
"alt",
"A short note: Thanks Johnathan!\n\nI think I understand much of th..."
],
[
"e",
"21b2966d0e053d6356e97d2ebcb6b73d1fc37cc51b59432a5c3006be50ab6406",
"wss://nos.lol/",
"root",
"12ee03d11684a125dd87be879c28190415be3f3b1eca6b4ed743bd74ffd880e6"
],
[
"e",
"6fcb7e033ec863f364aae0d9e4f43ab62b40bdeb20a0633dcd181a048e0ecfff",
"wss://bitcoiner.social/",
"reply",
"2bbace553efebf58dd55912169f92c1123eb6121d7ba092f6c50104afc31acef"
],
[
"p",
"23d12ef8751e5ee267fb6341d7c41b9434a1b99869e0212eb34d56abb6b12e8a",
"wss://relay.damus.io/"
],
[
"p",
"2bbace553efebf58dd55912169f92c1123eb6121d7ba092f6c50104afc31acef",
"wss://bevo.nostr1.com/"
],
[
"p",
"12ee03d11684a125dd87be879c28190415be3f3b1eca6b4ed743bd74ffd880e6",
"wss://nos.lol/"
]
],
"content": "Thanks Johnathan!\n\nI think I understand much of that already thanks, including the split-horizon stuff, thanks the your excellent docs that you already have.\n\nI'm just trying to identify some simple invariants which might also help when I'm trying to share my understanding with others\n\nIf 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\n\nI ask because some people say N, instead of 2N-2, in that statement",
"sig": "577a0d949d2a8078e95dcacf21e2f7746ba056c20ffc988632e05b74e9cce65d280f8b3e23f8e29bdaf3fda1a69a4fb37c863e62b166ef7cec724a1d3e3f3fa6"
}