Vector Clocks & Happens-Before

Simulate causal ordering across 3 distributed nodes. Observe local increments, message vector piggybacking, and element-wise max() merges.

Distributed Node Vector State

Node 1 (Alpha)

[0, 0, 0]

Node 2 (Beta)

[0, 0, 0]

Node 3 (Gamma)

[0, 0, 0]

Causal Happens-Before Definition ($A \to B$)

Event $A$ happened before $B$ ($A \to B$) if and only if:

$\forall k: V_A[k] \le V_B[k]$ and $\exists k: V_A[k] < V_B[k]$

If neither $A \to B$ nor $B \to A$, events are concurrent ($A \parallel B$), requiring CRDT join-semilattice resolution.

[INIT] 3-Node Vector Clock Mesh initialized at [0, 0, 0].

[READY] Trigger local events or send network messages between nodes.

Loading SYNC::COSMOS...