Search Results

Documents authored by Nieto, Javier


Document
Fully Fluctuating Sleepy Consensus from Minimal Assumptions

Authors: Javier Nieto, Yuval Efron, Joachim Neu, and Ling Ren

Published in: LIPIcs, Volume 397, 40th International Symposium on Distributed Computing (DISC 2026)


Abstract
Bitcoin’s proof-of-work (PoW)-based protocol is remarkable for how little it asks of its participants. Not only can miners take breaks from work whenever they please, but it is almost unique in offering a path of contrition: corrupt miners can reclaim honest status simply by resuming mining on the longest chain. The protocol only requires that honest miners hold the majority of computational power at any given time. Analogous proof-of-stake (PoS) protocols, usually formalized via the sleepy model of [Pass and Shi, 2017], have fallen short of matching this robustness. In fact, sleepy consensus protocols in the plain PKI model must heavily restrict fluctuations in adversarial participation over time. The recent work of [Efron et al., 2025] enables fully fluctuating participation in the sleepy model by introducing the external adversary model. Their protocol, however, relies on verifiable delay functions (VDFs), a strong cryptographic primitive that somewhat resembles PoW, by assuming that the adversary cannot compute sequential work significantly faster than honest nodes. In this work, we design a sleepy consensus protocol for fully fluctuating participation with an external adversary under an honest majority, from minimal assumptions: a public key infrastructure (PKI) and a verifiable random function (VRF). In particular, we make no VDF or hardware assumptions. Our key technique is graded wakeness, a novel primitive that allows nodes to form consistent opinions on which other nodes are awake. We further extend our protocol to handle uncorruption, where corrupt nodes return to honesty. This extension requires only a mild additional assumption on the unpredictability of VRF outputs for liveness.

Cite as

Javier Nieto, Yuval Efron, Joachim Neu, and Ling Ren. Fully Fluctuating Sleepy Consensus from Minimal Assumptions. In 40th International Symposium on Distributed Computing (DISC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 397, pp. 44:1-44:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{nieto_et_al:LIPIcs.DISC.2026.44,
  author =	{Nieto, Javier and Efron, Yuval and Neu, Joachim and Ren, Ling},
  title =	{{Fully Fluctuating Sleepy Consensus from Minimal Assumptions}},
  booktitle =	{40th International Symposium on Distributed Computing (DISC 2026)},
  pages =	{44:1--44:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-454-3},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{397},
  editor =	{Moses Jr., William K. and Censor-Hillel, Keren},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2026.44},
  URN =		{urn:nbn:de:0030-drops-281503},
  doi =		{10.4230/LIPIcs.DISC.2026.44},
  annote =	{Keywords: Byzantine agreement, proof of stake, sleepy model, fluctuating participation, graded wakeness, verifiable random function}
}

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail