The Sleepy Model of Consensus

The distributed systems literature adopts two primary network models, the synchronous model where honest messages are delivered in the next round, and the partially synchronous (or asynchronous) model where honest messages are subject to unpredictable adversarial delays. In this paper, we show that more nuanced formal models exist beyond the traditional synchrony and asynchrony stratification -- and interestingly, such new models allow us to articulate new robustness properties that traditional models would have failed to capture. More specifically, we articulate a new formal model called “the sleepy model of consensus”, where we classify honest nodes as being either alert or sleepy. Alertness implies that the node is online and has good network connections; whereas sleepiness captures any type of failure or network jitter. We then describe the Sleepy consensus protocol that achieves security as long as at any time, the number of alert nodes outnumber corrupt ones. No classical synchronous or asynchronous protocols attain such robustness guarantees, and yet we show how to leverage Nakamoto’s blockchain protocol, but without proofs-of-work, to achieve these properties, assuming collision resistant hash functions, the existence of a public-key infrastructure and a common reference string

Consensus in the Unknown-Participation Message-Adversary Model

We propose a new distributed-computing model, inspired by permissionless distributed systems such as Bitcoin and Ethereum, that allows studying permissionless consensus in a mathematically regular setting. Like in the sleepy model of Pass and Shi, we consider a synchronous, round-by-round message-passing system in which the set of online processors changes each round. Unlike the sleepy model, the set of processors may be infinite. Moreover, processors never fail; instead, an adversary can temporarily or permanently impersonate some processors. Finally, processors have access to a strong form of message-authentication that authenticates not only the sender of a message but also the round in which the message was sent. Assuming that, each round, the adversary impersonates less than 1/2 of the online processors, we present two consensus algorithms. The first ensures deterministic safety and constant latency in expectation, assuming a probabilistic leader-election oracle. The second ensures deterministic safety and deterministic liveness assuming irrevocable impersonation and eventually-stabilizing participation. The model is unrealistic in full generality. However, if we assume finitely many processes and that the set of faulty processes remains constant, the model coincides with a practically-motivated model: the static version of the sleepy model

Sleepy Consensus in the Known Participation Model

We study sleepy consensus in the known participation model, where replicas are aware of the minimum number of awake honest replicas. Compared to prior works that almost all assume the unknown participation model, we provide a fine-grained treatment of sleepy consensus in the known participation model and show some interesting results. First, we present a synchronous atomic broadcast protocol with $5\Delta+2\delta$ expected latency and $2\Delta+2\delta$ best-case latency, where $\Delta$ is the bound on network delay and $\delta$ is the actual network delay. In contrast, the best-known result in the unknown participation model (MMR, CCS 2023) achieves $14\Delta$ latency, more than twice the latency of our protocol. Second, in the partially synchronous network (the value of $\Delta$ is unknown), we show that without changing the conventional $n \geq 3f+1$ assumption, one can only obtain a secure sleepy consensus by making the stable storage assumption (where replicas need to store intermediate consensus parameters in stable storage). Finally, still in the partially synchronous network but not assuming stable storage, we prove the bounds on $n \geq 3f+2s+1$ without the global awake time (GAT) assumption (all honest replicas become awake after GAT) and $n \geq 3f+s+1$ with the GAT assumption, where $s$ is the maximum number of honest replicas that may become asleep simultaneously. Using these bounds, we transform HotStuff (PODC 2019) into a sleepy consensus protocol via a timeoutQC mechanism and a low-cost recovery protocol

Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience

Dynamic participation has recently become a crucial requirement for devising permissionless consensus protocols. This notion, originally formalized by Pass and Shi (ASIACRYPT 2017) through their sleepy model , captures the essence of a system\u27s ability to handle participants joining or leaving during a protocol execution. A dynamically available consensus protocol preserves safety and liveness while allowing dynamic participation. Blockchain protocols, such as Bitcoin\u27s consensus protocol, have implicitly adopted this concept. In the context of Ethereum\u27s consensus protocol, Gasper, Neu, Tas, and Tse (S&P 2021) presented an attack against LMD-GHOST -- the component of Gasper designed to ensure dynamic availability. Consequently, LMD-GHOST results unable to fulfill its intended function of providing dynamic availability for the protocol. Despite attempts to mitigate this issue, the modified protocol still does not achieve dynamic availability, highlighting the need for more secure dynamically available protocols. In this work, we present RLMD-GHOST, a synchronous consensus protocol that not only ensures dynamic availability but also maintains safety during bounded periods of asynchrony. This protocol is particularly appealing for practical systems where strict synchrony assumptions may not always hold, contrary to general assumptions in standard synchronous protocols. Additionally, we present the generalized sleepy model , within which our results are proven. Building upon the original sleepy model proposed by Pass and Shi, our model extends it with more generalized and stronger constraints on the corruption and sleepiness power of the adversary. This approach allows us to explore a wide range of dynamic participation regimes, spanning from complete dynamic participation to no dynamic participation, i.e., with every participant online. Consequently, this model provides a foundation for analyzing dynamically available protocols

Internal and External Validity of Sluggish Cognitive Tempo in Young Adolescents with ADHD

Adolescents with Sluggish Cognitive Tempo (SCT) show symptoms of slowness, mental confusion, excessive daydreaming, low motivation, and drowsiness/sleepiness. Although many symptoms of SCT reflect internalizing states, no study has evaluated the utility of self-report of SCT in an ADHD sample. Further, it remains unclear whether SCT is best conceptualized as a unidimensional or multidimensional construct. In a sample of 262 adolescents comprehensively diagnosed with ADHD, the present study evaluated the dimensionality of a SCT scale and compared CFA and bifactor model fits for parent- and self-report versions. Analyses revealed the three-factor bifactor model to be the best fitting model. In addition, SCT factors predicted social and academic impairment and internalizing symptoms. Therefore, SCT as a multidimensional construct appears to have clinical utility in predicting impairment. Also, multiple reporters should be used, as they predicted different areas of functioning and were not invariant, suggesting that each rater adds unique information

Dissociative symptoms and sleep parameters: an all-night polysomnography study in patients with insomnia

AbstractBackgroundDissociative disorders encompass a range of symptoms varying from severe absent-mindedness and memory problems to confusion about one's own identity. Recent studies suggest that these symptoms may be the by-products of a labile sleep–wake cycle.MethodsIn the current study, we explored this issue in patients suffering from insomnia (N=46). We investigated whether these patients have raised levels of dissociative symptoms and whether these are related to objective sleep parameters. Patients stayed for at least one night in a specialized sleep clinic, while sleep EEG data were obtained. In addition, they completed self-report measures on dissociative symptoms, psychological problems, and sleep characteristics.ResultsDissociative symptom levels were elevated in patients suffering from insomnia, and were correlated with unusual sleep experiences and poor sleep quality. Longer REM sleep periods and less time spent awake during the night were predictive of dissociation.ConclusionsThis is the first study to show that insomnia patients have raised dissociative symptom levels and that their dissociative symptoms are related to objective EEG parameters. These findings are important because they may inspire sleep-related treatment methods for dissociative disorders

Improving Asynchrony Resilience in Dynamically Available Total-Order Broadcast Protocols

Dynamically available total-order broadcast (TOB) protocols are essential in permissionless systems in which participants may unpredictably go offline and later come back online. Existing dynamically-available protocols are synchronous protocols, and they lose their safety guarantees during periods of asynchrony. This is a major issue in practice. In this paper, we explore the challenge of tolerating bounded periods of asynchrony in dynamically-available TOB protocols that ensure safety deterministically. We propose to trade off assumptions limiting the online/offline churn rate in exchange for tolerating bounded asynchronous periods through the use of a configurable message-expiration period. We show how to apply this idea to a state-of-the-art protocol to make it tolerate bounded periods of asynchrony