Skip to content

CONCEPT Cited by 1 source

Gossip protocol

What it is

A gossip protocol (a.k.a. epidemic protocol) is a class of distributed-systems communication primitives where nodes periodically exchange state with a random subset of peers. Over logarithmic-in-N rounds, information reaches every node. Two classic use-shapes:

  • Membership — which nodes are alive? (SWIM, Serf.)
  • State reconciliation — which updates does each node have? (anti-entropy, Dynamo-style, Corrosion.)

Why it works

  • Scalable: per-round cost at a node is O(fanout), not O(N).
  • Robust to partial failure: any one message loss is absorbed by the next round's random-peer choice.
  • No leader, no quorum — gossip converges without distributed consensus.

Trade-offs

Canonical wiki instance — Fly.io Corrosion

Fly.io's Corrosion combines SWIM for membership with QUIC for update broadcast and cr-sqlite CRDT conflict resolution on a shared SQLite database. Convergence in seconds across thousands of workers worldwide, with no central servers, no leader elections, no distributed consensus. See sources/2025-10-22-flyio-corrosion for the full architectural argument. Architectural inspiration: link-state routing protocols like OSPF.

Seen in

  • sources/2025-10-22-flyio-corrosion — canonical primary source. "SWIM converges on global membership very quickly." Fly.io describes gossip as "efficient" given their pre-existing fully-connected WireGuard mesh.
Last updated · 200 distilled / 1,178 read