Agreement is a foundational problem in distributed computing that have been studied extensively for over four decades. Recently, Meir, Mirault, Peleg and Robinson introduced the notion of \emph{Energy Efficient Agreement}, where the goal is to solve Agreement while minimizing the number of round a party participates in, thereby reducing the energy cost per participant. We show a recursive Agreement algorithm that has $O(\log f)$ active rounds per participant, where $f<n$ represents the maximum number of crash faults in the system.

翻译：共识问题是分布式计算领域的基础性问题，已历经四十余年的深入研究。近期，Meir、Mirault、Peleg与Robinson提出了"能量高效共识"的概念，其目标是在解决共识问题的同时，最小化参与方实际参与执行的轮次数量，从而降低每个参与者的能耗成本。我们提出了一种递归式共识算法，该算法使每个参与者仅需参与$O(\log f)$轮有效计算，其中$f<n$代表系统中可能出现的最大崩溃故障数量。