Distributed Systems • Module #1

CAP Theorem, PACELC & Raft Consensus

Est. Read: 12 mins• Distributed Systems Core

1. Definition 2. Why It Matters 3. Real Example 4. Visual Diagram 5. Steps 6. Pros/Cons 7. Interview Qs 8. Quiz

1. Definition & Core Concept

The CAP Theorem states that a distributed data store can simultaneously provide at most 2 out of 3 guarantees: Consistency (CP), Availability (AP), or Partition Tolerance (P is mandatory in real networks). Raft is a consensus algorithm for managing a replicated state machine.

2. Why It Matters

Network partitions are inevitable in real cloud networks. Software engineers must deliberately choose CP (e.g. Google Spanner, HBase) or AP (e.g. Cassandra, DynamoDB).

3. Real-World Industry Example

Kubernetes etcd Cluster with Raft Consensus

Kubernetes uses etcd (a distributed key-value store using Raft) to elect a leader and maintain strong consistency for cluster state configurations across master nodes.

Used by: Kubernetes, CockroachDB, Consul, Neo4j

4. Visual Learning & Interactive Blueprint

Concept Visual Blueprint: CAP Theorem, PACELC & Raft Consensus

Architecture & Flow

System Flow & Sequence Blueprint

Visual representation of control loops, memory layout, and execution flow for CAP Theorem, PACELC & Raft Consensus.

Input / StartRequest / Trigger

Core LogicState Transformation

Output / EndVerified Result

5. Step-by-Step Execution Breakdown

Leader Election

When cluster boots or leader heartbeat times out, nodes transition to Candidate state and request votes.

Log Append Request

Client writes to Leader; Leader appends entry to its local log and broadcasts AppendEntries RPCs.

Quorum Commit

Once majority of follower nodes acknowledge writing log entry, Leader commits entry and responds to client.

CP System vs AP System

Side-by-Side Comparison

Feature / Dimension	CP System (Consistency + Partition Tolerance)	AP System (Availability + Partition Tolerance)
Network Partition Behavior	Rejects writes/reads if majority quorum cannot be reached (Prioritizes Data Correctness)	Returns stale or conflicting data rather than failing (Prioritizes Availability)
Example Databases	PostgreSQL HA, etcd, HBase, CockroachDB	Apache Cassandra, Amazon DynamoDB, Couchbase

Key Advantages

Raft provides strong consistency and understandable leader-driven consensus.

Trade-offs & Disadvantages

Requires a strict majority quorum (e.g., 3 out of 5 nodes active); if quorum is lost, writes stall.

Interview Question Bank • CAP Theorem, PACELC & Raft Consensus

Technical Interview Questions

Detailed answers, interviewer pro tips, key takeaway summaries, and code examples formulated for technical rounds.

Mastery Progress0%

0 Mastered 0 Review

Level:

Tag:

•

Common Misconceptions & Mistakes

❌ Common Misconception: "Thinking a system can choose "CA" (Consistency + Availability) without Partition Tolerance in distributed networks."

✅ Correction: Network partitions (dropped cables, router crashes) are inevitable; in distributed systems, "P" is mandatory, so the real choice is CP vs AP.

Rapid Memory Tricks

CAP: Pick 2, but P is mandatory in real networks! PACELC: If Partition -> A or C, Else -> L or C.

Distributed Systems Summary

Rapid Revision Card

Core Summary Definition:

Architectural trade-offs and consensus protocols across network nodes.

High-Yield Key Points

CP: Strong consistency, lower availability during partition.
AP: High availability, eventual consistency.
Raft Roles: Leader, Follower, Candidate.

Exam & Interview Tips

Explain Raft majority quorum formula: Majority = floor(N/2) + 1.

Topic Knowledge Quiz: CAP Theorem, PACELC & Raft Consensus

Question 1 of 1

In a 5-node Raft consensus cluster, what is the minimum number of nodes required to form a majority quorum?

Core Summary & Key Takeaways

CAP Theorem forces trade-off between CP and AP during network partitions.

Raft consensus replicates logs across majority quorum nodes.

Connected Related Topics

concurrency control isolation load balancing firewalls

4. Visual Learning & Interactive Blueprint

Concept Visual Blueprint: CAP Theorem, PACELC & Raft Consensus

Architecture & Flow

System Flow & Sequence Blueprint

Visual representation of control loops, memory layout, and execution flow for CAP Theorem, PACELC & Raft Consensus.

Input / StartRequest / Trigger

Core LogicState Transformation

Output / EndVerified Result

5. Step-by-Step Execution Breakdown

Leader Election

When cluster boots or leader heartbeat times out, nodes transition to Candidate state and request votes.

Log Append Request

Client writes to Leader; Leader appends entry to its local log and broadcasts AppendEntries RPCs.

Quorum Commit

Once majority of follower nodes acknowledge writing log entry, Leader commits entry and responds to client.

Feature / Dimension

CP System (Consistency + Partition Tolerance)

AP System (Availability + Partition Tolerance)

Network Partition Behavior

Rejects writes/reads if majority quorum cannot be reached (Prioritizes Data Correctness)

Returns stale or conflicting data rather than failing (Prioritizes Availability)

Example Databases

PostgreSQL HA, etcd, HBase, CockroachDB

Apache Cassandra, Amazon DynamoDB, Couchbase

Common Misconceptions & Mistakes

❌ Common Misconception: "Thinking a system can choose "CA" (Consistency + Availability) without Partition Tolerance in distributed networks."

✅ Correction: Network partitions (dropped cables, router crashes) are inevitable; in distributed systems, "P" is mandatory, so the real choice is CP vs AP.

CAP Theorem, PACELC & Raft Consensus

1. Definition & Core Concept

2. Why It Matters

3. Real-World Industry Example

Kubernetes etcd Cluster with Raft Consensus

4. Visual Learning & Interactive Blueprint

Concept Visual Blueprint: CAP Theorem, PACELC & Raft Consensus

System Flow & Sequence Blueprint

5. Step-by-Step Execution Breakdown

Leader Election

Log Append Request

Quorum Commit

CP System vs AP System

Key Advantages

Trade-offs & Disadvantages

Technical Interview Questions

What is the PACELC Theorem and how does it extend the CAP Theorem?

Common Misconceptions & Mistakes

Rapid Memory Tricks

Distributed Systems Summary

High-Yield Key Points

Exam & Interview Tips

Topic Knowledge Quiz: CAP Theorem, PACELC & Raft Consensus

In a 5-node Raft consensus cluster, what is the minimum number of nodes required to form a majority quorum?

Core Summary & Key Takeaways

Connected Related Topics

CAP Theorem, PACELC & Raft Consensus

1. Definition & Core Concept

2. Why It Matters

3. Real-World Industry Example

Kubernetes etcd Cluster with Raft Consensus

4. Visual Learning & Interactive Blueprint

Concept Visual Blueprint: CAP Theorem, PACELC & Raft Consensus

System Flow & Sequence Blueprint

5. Step-by-Step Execution Breakdown

Leader Election

Log Append Request

Quorum Commit

CP System vs AP System

Key Advantages

Trade-offs & Disadvantages

Technical Interview Questions

What is the PACELC Theorem and how does it extend the CAP Theorem?

Common Misconceptions & Mistakes

Rapid Memory Tricks

Distributed Systems Summary

High-Yield Key Points

Exam & Interview Tips

Topic Knowledge Quiz: CAP Theorem, PACELC & Raft Consensus

In a 5-node Raft consensus cluster, what is the minimum number of nodes required to form a majority quorum?

Core Summary & Key Takeaways

Connected Related Topics