From the 1 of 7 linked papers with an AI index.
6 papers · 1 filter
A Fast Confirmation Rule for the Ethereum Consensus Protocol
Roberto Saltini, Mikhail Kalinin, Luca Zanolini +3
The paper proposes a Fast Confirmation Rule for Ethereum's Gasper consensus protocol that can confirm blocks in about 12 seconds under synchrony, offering a much quicker alternativ…
Majorum: Ebb-and-Flow Consensus with Dynamic Quorums
Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran +2
Dynamic availability is the ability of a consensus protocol to remain live despite honest participants going offline and later rejoining. A well-known limitation is that dynamicall…
TOB-SVD: Total-Order Broadcast with Single-Vote Decisions in the Sleepy Model
Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran +1
Over the past years, distributed consensus research has expanded its focus to address challenges in large-scale, permissionless systems, such as blockchains. This shift reflects th…
DAG-based Consensus with Asymmetric Trust [Extended Version]
Ignacio Amores-Sesar, Christian Cachin, Juan Villacis +1
In protocols with asymmetric trust, each participant is free to make its own individual trust assumptions about others, captured by an asymmetric quorum system. This contrasts with…
3-Slot-Finality Protocol for Ethereum
Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran +1
Gasper, the consensus protocol currently employed by Ethereum, typically requires 64 to 95 slots -- the units of time during which a new chain extending the previous one by one blo…
Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
Francesco D'Amato, Giuliano Losa, Luca Zanolini
Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful…