Throughout this talk, we will revisit the consensus problem from a local-first perspective and investigate new ways of implementing consensus protocols that work well in a decentralized setting. To this end, we will demonstrate how to use the monotonic properties of CRDTs in a novel strategy for building consensus protocols which allows expressing existing protocols through the composition of simple replicated data types. The talk will show several examples and highlight challenges and opportunities of such a programming model. Additionally, we will examine the applicability of existing protocols to the local-first setting: What are the trade-offs regarding offline periods, network size, and delay-tolerance?