Energy-efficient lazy group membership protocol implementation in Haskell

In distributed systems, maintaining an up-to-date view of active nodes is essential for ensuring reliable communication, failure detection, and system reconfiguration. Traditional group membership protocols, such as SWIM [3], rely on periodic gossip exchanges, incurring communication and energy overhead. In this work, we implement a "lazy" group membership protocol in Haskell that eliminates periodic messages. We describe the complete implementation and introduce an energy-efficient benchmark. An experiment based on the new benchmark compares our lazy protocol to a standard SWIM implementation. Results show that, despite higher absolute power caused by the secure UDP library and the Haskell runtime, our lazy protocol achieves a lower normalized energy index than SWIM.