The field of decentralized systems is moving towards more energy-efficient and fair consensus mechanisms. Recent developments have focused on cooperative approaches, such as Proof of Team Sprint (PoTS), which reduces centralization risks and promotes equitable participation. These mechanisms have shown significant energy savings and improved reward distribution, making them a promising alternative to traditional Proof of Work (PoW) algorithms. Furthermore, researchers have made progress in adapting asynchronous Byzantine fault-tolerant (BFT) consensus protocols to wireless environments, addressing the challenges of high message complexity and network congestion. Notable papers in this area include:

• ED-DAO, which proposes a novel Hybrid Energy Donation algorithm to increase the volume of donated energy and address energy poverty.
• Empirical Evaluation and Scalability Analysis of Proof of Team Sprint, which demonstrates the fairness and energy efficiency of PoTS through large-scale simulations.
• Asynchronous BFT Consensus Made Wireless, which introduces a consensus batching protocol to adapt asynchronous BFT consensus protocols to resource-constrained wireless networks, achieving significant reductions in latency and increases in throughput.