Distributed Systems 102: CRDTs for Poets and Perl Hackers

50 minutes



In which a humanities major reads a bunch of papers on distributed systems theory and attempts to explain them in plain language.

Fortunately, conflict free replicated data types (CRDTs) are just a straightforward monotonically increasing join semi-lattice with a least upper bound accomplished by enforcing idempotent and commutative merge functions (producing strong eventual consistency as long as the transport is eventually reliable). No sweat!

Come learn about conflict free replicated data types, what they can do for you, and why they might be interesting for all kinds of applications, not just for the Amazons and Googles of the world.