A Fast Confirmation Rule for Ethereum
11-14, 16:40–17:10 (Asia/Bangkok), Stage 1

In this talk, we present an algorithm that, assuming good network conditions, reliably determines in less than a minute whether a proposed block will always be part of the canonical chain.
This represents a considerable speedup compared to waiting for the full security guarantees provided by block finalization, which takes 13 minutes in the best-case scenario.
Also, this algorithm provides a far better metric than chain depth, which some services still use. Paper https://arxiv.org/abs/2405.00549

Roberto is a researcher specializing in distributed systems and formal verification, with extensive involvement in the Ethereum ecosystem since 2017. His early work includes the design and formal verification of Byzantine Fault Tolerant (BFT) consensus protocols, such as QBFT, as well as contributions to Distributed Validator Technology (DVT). More recently, his focus has shifted to advancing the Ethereum consensus layer protocol and ensuring its security.

I am a research scientist at the Ethereum Foundation where I am involved in the long-term improvements of Ethereum’s consensus protocol. My research is currently centered around faster finality protocols for Ethereum. More generally, my research interests include blockchains, distributed systems, and consensus protocols.