The authors introduce a novel solution to the Byzantine Generals problem that provides deterministic and unconditional safety guarantees in an environment with unknown and dynamic participation, avoiding the high energy consumption and latency associated with traditional proof-of-work and longest chain protocols. By eliminating proof-of-work and leveraging the "Sleepy" model's principles of continuity and honest majority, the authors propose a streamlined Byzantine agreement protocol requiring a two-thirds honest participation threshold. This approach ensures safety and a small constant expected latency, simplifying the consensus process compared to previous models. The solution includes a detailed protocol for binary agreement using unique, transferable quorum properties, promising advancements in future applications such as multi-valued consensus and atomic broadcast problems. Notably, it maintains synchrony and security through authenticated channels and public key infrastructure, emphasizing the practicality of permissionless consensus in dynamic settings.