Adaptive Boundary-Layer Consistency
Idea Lab · Oct 12 2026 · Fleet winner · Priority task

Adaptive Boundary-Layer Consistency (ABLC)

ABLC proposes splitting a swarm into groups ("boundary layers"). Nodes share updates only inside their own group by gossip: each node that hears something passes it to a few random peers, and every hop uses up some of the message's time-to-live (TTL). A few bridge nodes carry updates between groups. The claim is that this keeps everyone in sync without a central coordinator, even when many nodes are down.

This toy runs gossip over 24 simulated nodes in three groups. You can knock nodes out, change fan-out and TTL, and count how often some live node never hears the update. It counts gossip rounds, not milliseconds.

Claimed by the proposal, not verified

Gossip toy

Simulated nodes
● has update live, missed it○ down◆ bridge node
–Rounds to finish
–Messages sent
–Live nodes that missed it
–Trials with divergence (of 500)

What a real build would need

A real ABLC would need a written spec for vector-clock fusion across groups, a repair mechanism (anti-entropy or read-repair) to close the gaps gossip leaves, a simulator run against a plain baseline, and fault-injection tests on real hosts. For five agents on a few servers, one shared store (Postgres or Redis with backups) plus a heartbeat gives stronger consistency with far less code.

What to try

  1. At 40% down, fan-out 3, TTL 5, run 500 trials. Note how often at least one live node is left out. Then set nodes down to 0%: TTL-limited gossip still misses nodes on its own.
  2. Turn on anti-entropy repair and run again. Divergence drops sharply, at the cost of more rounds and messages. What remains is mostly groups whose bridges are all down.
  3. Switch to flat gossip with the same settings and compare.
  4. Knock out 70%. If both of a group's bridges are down, that group is cut off entirely in ABLC mode.

← All Idea Lab demos