Leaderless replication has no designated leader. Any node accepts writes:
Write process:
- Client writes to nodes
- Write succeeds if acknowledge
Read process:
- Client reads from nodes
- Return value with highest version
Quorum formula: guarantees overlap (fresh read)
Examples: Amazon DynamoDB, Apache Cassandra, Riak
Trade-offs:
- High availability (no leader election)
- Tunable consistency ( and values)
- Complex conflict resolution
- Read repair and anti-entropy needed