The text discusses a novel solution to the Byzantine Generals Problem, focusing on achieving deterministic and unconditional security in a scenario where participant identities are unknown and change dynamically. This approach avoids the high energy consumption of Proof-of-Work (PoW) and the latency issues of the longest chain consensus protocols, which are significant challenges in Nakamoto consensus. The authors build on the "Sleepy model," discarding PoW and focusing on two main pillars: continuity of data transfer among active participants and the assumption that more than two-thirds of participants are honest. This new solution ensures a low expected constant latency while maintaining security, even as participant identities and numbers fluctuate. It proposes a method for achieving a one-time binary Byzantine agreement and sets the stage for extending this to multi-value consensus, a series of consensus decisions, and improving round complexity through leadership. The innovative aspect is the Unknown and Dynamic Quorum (UDQ) model, which ensures secure communication and consensus through synchronous channels and a public key infrastructure, requiring that a majority of active nodes be honest.