Protocol Overview
High-level specification of KAALASTRA's temporal ordering and conflict resolution protocol. Authored by Aditya Yadav at Millimo Inc.
Hybrid Logical Clocks
Each node maintains an HLC combining physical timestamps with logical counters. Sub-microsecond ordering without perfect clock synchronization. Guarantees: if A causally precedes B, then HLC(A) < HLC(B).
Intent Priority Weighting
Conflict resolution chain: (1) temporal priority — earlier HLC wins, (2) intent weight — higher priority wins if timestamps equal, (3) node ID — deterministic tiebreaker. No ambiguity, ever.
CRDT-Based Merge
G-Counters for counters, OR-Set for sets, LWW-Register with HLC timestamps for registers. Automatic merging without coordination — even after network partitions.
Adaptive Gossip
Configurable fan-out (default: 3). Anti-entropy mechanisms ensure eventual consistency after partitions. Adaptive interval — increases during high-throughput, decreases during idle.
Read the Full Specification
The complete protocol specification with message formats, state machine diagrams, and formal consistency proofs is available in the Millimo documentation.