This nostr:npub1y0gja7r4re0wyelmvdqa03qmjs62rwvcd8szzt4nf4t2...

12ee03d11684a125...

npub1zthq85gksjsjthv8h6rec2qeqs2mu0emrm9xknkhgw7hfl7csrnq6wxm56

hex

21b2966d0e053d6356e97d2ebcb6b73d1fc37cc51b59432a5c3006be50ab6406

nevent

nevent1qqszrv5kd58q20tr2m5h6t4uk6mn687r0nz3kk2r9fwrqp472z4kgpsprpmhxue69uhhyetvv9ujuem4d36kwatvw5hx6mm9qgsp9msr6ytgfgf9mkrmapuu9qvsg9d78ua3ajntfmt580t5llvgpesynqcgd

Kind-1 (TextNote)

2026-03-17T16:59:30Z

This nostr:npub1y0gja7r4re0wyelmvdqa03qmjs62rwvcd8szzt4nf4t2hd43969qj000ly 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?

https://image.nostr.build/9acb8f4a09555d7d97994096ccc39ec16551ba23765a7bc8b563a308cf1de411.png

nostr:npub19wavu4f7l6l43h24jyskn7fvzy37kcfp67aqjtmv2qgy4lp34nhsda8p6k

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

原始 JSON

{
  "kind": 1,
  "id": "21b2966d0e053d6356e97d2ebcb6b73d1fc37cc51b59432a5c3006be50ab6406",
  "pubkey": "12ee03d11684a125dd87be879c28190415be3f3b1eca6b4ed743bd74ffd880e6",
  "created_at": 1773766770,
  "tags": [
    [
      "imeta",
      "url https://image.nostr.build/9acb8f4a09555d7d97994096ccc39ec16551ba23765a7bc8b563a308cf1de411.png",
      "ox 9acb8f4a09555d7d97994096ccc39ec16551ba23765a7bc8b563a308cf1de411",
      "x c3b4317248245b28a4996cfc1803b85c0dd49cdb7ac3ae5f4c364ca3d6d33ba9",
      "m image/png",
      "dim 1115x827",
      "bh L03IegoyxvRQITRjNGax_3jcM{X5",
      "blurhash L03IegoyxvRQITRjNGax_3jcM{X5",
      "thumb https://image.nostr.build/thumb/9acb8f4a09555d7d97994096ccc39ec16551ba23765a7bc8b563a308cf1de411.png"
    ],
    [
      "p",
      "23d12ef8751e5ee267fb6341d7c41b9434a1b99869e0212eb34d56abb6b12e8a"
    ],
    [
      "p",
      "2bbace553efebf58dd55912169f92c1123eb6121d7ba092f6c50104afc31acef"
    ]
  ],
  "content": "This nostr:npub1y0gja7r4re0wyelmvdqa03qmjs62rwvcd8szzt4nf4t2hd43969qj000ly network has N=six nodes and therefore five (N-1) spanning-tree-edges\n\nSo we have two blooms filters for each spanning-tree-edge, i.e. 10 (possibly distinct) Bloom filters\n\nDo 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?\n\nhttps://image.nostr.build/9acb8f4a09555d7d97994096ccc39ec16551ba23765a7bc8b563a308cf1de411.png\n\nnostr:npub19wavu4f7l6l43h24jyskn7fvzy37kcfp67aqjtmv2qgy4lp34nhsda8p6k\n\nI'm pretty sure I know the answer (Yes), but I'm not 100% sure\n\nThis diagram is from the intro: https://github.com/jmcorgan/fips/blob/master/docs/design/fips-intro.md",
  "sig": "22c4e2e5e71d8a7b112c70547025a3c9b398493620a6bcb6aa0cda7af4414cc800a6f1432c525372fd235a18b3fee1ac07df2ddeb9d5140459f97057d6ed1b15"
}