In this livestream, we will wrap up the series with an investigation into how CAP Theorem works in a distributed system, specifically addressing "partition tolerance". Partition tolerance is the "P" in CAP and it guarantees that ”the system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes”. We cover: • What are the challenges to dealing with network failures and dropped messages? • How to mitigate this risk in a distributed database. • What is the effect of lost messages in a distributed database? • How CockroachDB meets this guarantee.