A Critical Study of Compute-And-Wait PoW Algorithm

Compute-And-Wait Proof-of-Work (CW-PoW) modifies classical PoW by dividing mining into multiple compute rounds separated by enforced waiting periods, thereby mitigating energy waste. However, this approach introduces challenges such as increased latency, sensitivity to parameter choices, and additional coordination overhead. In this work, we analyze these downsides and improve the CW-PoW algorithm through newly adapted mechanisms, such as adaptive thresholds, pipelined rounds, useful-work substitution, hybrid BFT/PoS committees, and asynchronous coordination via wake-up radios. These enhancements are designed to preserve the energy efficiency of CW-PoW while addressing its limitations in latency, fairness, and communication costs. The contributions are primarily theoretical, offering a refined CW-PoW framework that can achieve a more balanced trade-off between sustainability, performance, and security.