A recent surge in Multiparty Session Types (MPST) has vastly increased the expressivity and practicality of the theory. New theories have introduced notions of failure and failure-handling mechanisms into session types, with the aim of making them viable for distributed computing. This work asks the question: Is MPST theory capable of accurately describing consensus protocols? We answer this question by attempting to express the Raft consensus algorithm in MAGπ, a generalised MPST theory capable of modelling non-Byzantine faults. We highlight how, even with a theory so general, MAGπ session types cannot accurately describe the protocol. Towards achieving session-typed consensus, we propose a conservative and minimal extension to MAGπ, introducing the common distributed-computing concept of terms (a.k.a. time-periods or rounds) into types.