Assess learners' ability to apply SMT-based formal verification and model checking to prove correctness properties (safety and liveness) of distributed consensus algorithms in production systems. Scope: modeling Raft/Paxos-like protocols, writing invariants and temporal specifications, using SMT solvers for inductive proofs and counterexample analysis, employing model checkers for bounded/unbounded state exploration and parameterized reasoning, handling fault models (crashes, message loss, timing), and mapping verification results to implementation-level mitigations and deployment trade-offs.