🛩️🇵🇹 #39

The kids are alright.

Lol, and people say the US is ultra-capitalist.

GM 🤎 ✈️

GM ☕ I've learned way too much about Bluetooth in the last week, but FIPS nodes can now auto-discover each other and peer over BLE to create or join a FIPS mesh network. No IP needed 😏

Sometimes, all you can be is one of those small, newfangled, warm-blooded mammals just staying out of the way of those giant dinosaurs fighting among themselves until the meteor arrives.

One bloom filter advertised by and received from each peer is kept locally. Whenever an update comes from a peer, if it is different from what is already stored, the node will update its local copy, then: For each remaining peer that is either a spanning tree parent or child, calculate a new bloom filter consisting of the union (XOR) of all the other peers and send it. This is called "split horizon" routing and essentially means that after convergence each node has a bloom filter for each of its peers containing all nodes reachable through that peer. Later, at the routing stage, the node can examine all its peers' bloom filters to identify candidate next hops for routing.

Nah. Just tell them it's a game where they have to line up all three sticks.

GM ☕ It's good to be back working on open source after so many years away.

running fips

Yes, the squares are actually what get dynamically generated and transmitted on updates. I'm not sure what the point is that you're trying to clear up.

We are perhaps describing two different things.

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.