Lamport Exchange: Adopt the Max, Then Sort Diagram

The two Lamport rules

Each process keeps a local counter starting at 0; a stamp is the pair (counter, processID)
Local event or send: counter += 1, then stamp the event with (counter, processID)
Receive: adopt counter = max(local, seen) so the clock never moves backwards

What happens at B

A posts first: 0 -> 1, message carries (1,A); B adopts max(0,1) = 1
C posts next: 0 -> 1, message carries (1,C); B adopts max(1,1) = 1
B replies (a send): 1 + 1 = 2, reply carries (2,B); A adopts max(1,2) = 2

What the order does NOT say

Sorted stamps (1,A) < (1,C) < (2,B) are a total order, not a proof of cause
Two events with no messages between them may carry ANY pair of stamps
Seeing concurrency needs vector clocks: one entry per process, O(n) state