Showing cs.CRShow all
2 papers · 1 filter
cs.CR2025
Optimal Good-Case Latency for Sleepy Consensus
Yuval Efron, Joachim Neu, Ling Ren +1
In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a…
cs.CR2025
On the Limits of Consensus under Dynamic Availability and Reconfiguration
Javier Nieto, Joachim Neu, Ling Ren
Proof-of-stake blockchains require consensus protocols that support Dynamic Availability and Reconfiguration (which we call the DAR model). Here, Dynamic Availability means that th…