I find the similarities & diffferences interesting between this and CRDTs.

This seems to be saying that any algorithm with a monotonic output with respect to input information "has a consistent, coordination-free distributed implementation".

As I understand it, for data to be monotonic requires that the data is partially orderable.

CRDTs require partial ordering, as well as a merge() function so as to create a lattice.

This seems then that CRDT's have stronger requirements - this seems to make sense, since CRDT's are about sharing data, whereas this CALM theory is only talking about making a local decision.