The article introduces a new framework for understanding consensus algorithms, focusing on their role in ensuring distributed durability and high availability. Traditional algorithms like Paxos and Raft have been foundational but come with limitations. Paxos is often difficult to understand, while Raft, despite being more accessible, has a rigid structure that doesn't adapt well to modern cloud environments. The authors argue that existing consensus discussions miss the mark by emphasizing algorithms over the actual problems they solve. The framework redefines consensus in practical terms: it requires that every request be saved before acknowledgment, allowing systems to recover seamlessly from failures. It then critiques the rigid majority quorum requirements that don’t fit today's complex cloud architectures, proposing pluggable durability policies that can be tailored to specific needs. The article lays out a set of governing rules for consensus implementations—ensuring durability and consistency—without tying them to a single algorithm. The series consists of 11 parts, starting with problem framing and moving through practical applications. It illustrates how existing algorithms can fit into this broader framework, offering insights into flexible durability, separation of concerns, and real-world system building. This work is particularly relevant for Multigres, which aims to enhance Postgres by integrating more adaptable consensus mechanisms. By leveraging this generalized approach, Multigres can improve its replication model and scalability without compromising performance.