A stateless distributed demo using erasure instead of history

This is a small experimental demo exploring stateless convergence in distributed systems.

Instead of relying on logs, replay, or historical coordination, nodes exchange full state and correctness emerges through selection and erasure. Multiple candidate states may exist briefly; one survives, the rest are discarded.

The demo runs five independent nodes over UDP. A node can be severed mid-run and later rejoin without replaying history. The repository includes a short screen capture showing the system running live.

This is not production-ready and intentionally surfaces failure modes like packet loss and jitter rather than hiding them behind retries or buffering.

I’m posting this as an exploration of a primitive, not a finished system. Happy to answer technical questions or hear critiques.

(For longer technical follow-ups, I’ve enabled GitHub Discussions in the repo.)

A quick note to orient readers: this demo is intentionally small and exploratory.

The core idea is not to hide network messiness, but to make it visible early. The system does not rely on logs, replay, or historical coordination for correctness; instead, candidate states compete briefly and one survives via selection and erasure.

I’ve enabled GitHub Discussions in the repo for longer technical follow-ups if that’s useful.