Expand description
Vector clock for causal ordering in distributed agent systems.
§Responsibility
Provide a per-node logical timestamp that allows agents to establish causal ordering of events without relying on synchronized wall clocks.
§Guarantees
- Merge is commutative, associative, and idempotent.
tickis non-blocking and O(1).compareis O(n) in the number of distinct nodes.
Structs§
- Vector
Clock - A vector clock: maps node_id to logical timestamp.
Enums§
- Clock
Order - The causal ordering relationship between two vector clocks.