⏱️ Vector Clock & Lamport Clock Visualizer

Drop events on a time-space diagram and pass messages between processes. Each event gets a Lamport scalar and a vector clock. Compare any two events to see whether they're causally ordered (a → b) or concurrent (a ∥ b).

🛠️ Build the Timeline

Action

On Process

Processes

🔍 Compare Two Events

Event A

Event B

Pick two events…

📜 Event Log

#	Process	Kind	Lamport	Vector	Detail

Update Rules

Lamport scalar clock — one integer per process.

Local event on P_i: L_i ← L_i + 1
Send from P_i: increment, attach L_i to the message.
Receive at P_j with timestamp t: L_j ← max(L_j, t) + 1

Vector clock — one integer per process in every timestamp.

Local event on P_i: V_i[i] += 1
Send: increment own slot, attach the whole vector.
Receive at P_j with vector V_m: ∀k: V_j[k] ← max(V_j[k], V_m[k]) then V_j[j] += 1
Happens-before: a → b ⟺ V_a[k] ≤ V_b[k] ∀k and V_a ≠ V_b. Otherwise a ∥ b (concurrent).
Lamport scalars give a total order consistent with causality but cannot detect concurrency. Vector clocks can.