CAP theorem states: you can have at most 2 of consistency, availability, partition tolerance

eventual consistency means: all replicas converge to the same state given enough time

Eventual consistency: All replicas converge to the same state given enough time

the union bound says: P(A∪B) ≤ P(A) + P(B)

The union bound states: P(A∪B) ≤ P(A) + P(B)

consistent hashing solves: minimizes key redistribution when servers are added/removed

Consistent hashing minimizes key redistribution when servers are added/removed

the minimax theorem says: in zero-sum games, there's a saddle point strategy

In zero-sum games, minimax theorem guarantees a saddle point strategy

consistent hashing does: minimizes remapping when nodes join/leave

Consistent hashing distributes data across nodes, minimizing remapping when nodes join/leave

ACID

ACID guarantees data validity in transactions