# Complete CALM: A Coordination Criterion for Specifications

arXiv: https://arxiv.org/abs/2602.09435 · HTML: https://mlsanity.com/paper/2602.09435/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Feb 2026.

## Built on by (most cited first, 1 of 1)

- [Fault-Tolerant Budget Conservation in Distributed Multi-Agent Delegation](https://mlsanity.com/paper/2610.00349/) (2026)

## Abstract (arXiv)

The CALM theorem connects coordination-freedom to monotonicity, but is tied to relational transducers and set-inclusion growth. We generalize it to arbitrary concurrent specifications. A specification maps execution histories to outcome sets under a declared refinement order; we prove it admits coordination-free implementation if and only if its outcomes are monotone (Complete CALM). The criterion subsumes CALM, CRDTs, I-confluence, and HATs as instances, enables verification of proper coordination, and yields a Complete CAP companion: a specification admits a consistent, available, partition-tolerant implementation if and only if it is distributed-monotone.