Luca Zanolini

Luca Zanolini

Consensus & Distributed Systems Researcher
prev. Research Scientist, Ethereum Foundation
Seoul, Korea

I work on consensus protocols, Byzantine fault tolerance, and the security foundations of distributed systems — the formal question of how mutually distrusting machines agree, and when a network can irreversibly commit to a decision.

Until September 2026 I was a Research Scientist on the Ethereum Foundation's Protocol Consensus team, working on the long-term evolution of Ethereum's consensus layer: I co-designed 3-Slot Finality, Ethereum's planned faster-finality upgrade, co-authored the security analysis of its fork-choice rule (RLMD-GHOST, IEEE CSF 2024), and contributed the security analysis of enshrined proposer–builder separation. I hold a PhD from the University of Bern, where I developed the theory of asymmetric trust under Prof. Christian Cachin; my background is in Mathematics (Università Cattolica del Sacro Cuore), with a focus on abstract algebra and cryptography.

I teach the way I like to learn — by building. As a Visiting Scholar at the University of Cambridge (2025–26) I supervised students in Concurrent and Distributed Systems, and my open course Concurrent and Distributed Systems in Rust implements the field's classical protocols from scratch as executable, adversarially tested artifacts. My current research direction applies distributed-systems rigor to autonomous AI: reliable infrastructure for cooperating agent systems.


Recent

News

Sep 2026
Released Concurrent and Distributed Systems in Rust — a 12-module open course building Raft, PBFT, Byzantine broadcast, concurrency control, and CRDTs from scratch.
Aug 2026
Invited research seminar at KAIST School of Computing: What Does ePBS Actually Guarantee?
Apr 2026
Talks in Seoul: The Whys Behind Ethereum's Consensus Design at BUIDL Asia 2026, and the closing talk at Ethereum Korea One.
2026
Two papers at Financial Cryptography 2026: Majorum and Low-Latency Dynamically Available Total Order Broadcast.
Nov 2025
Finality Is in the Eye of the Behodler, with Vitalik Buterin and Ittai Abraham, on Decentralized Thoughts.
2025
Accountable Liveness at ACM CCS 2025 · DAG-based Consensus with Asymmetric Trust at PODC 2025 · TOB-SVD at ICDCS 2025.

Selected Work

Research highlights

Consensus · 2025
Proved when and how validators can be formally identified as responsible for stalling Ethereum. Rigorous foundations for Ethereum's inactivity leak mechanism. Published at ACM CCS 2025.
Ethereum · 2024
Reduces Ethereum's finalization from 64–95 slots to just 3, combining a dynamically available protocol with a partially synchronous finality gadget.
Writing · 2025
With Vitalik Buterin and Ittai Abraham. A framework for the multiple layers of finality — probabilistic, cryptoeconomic, and social. Published on Decentralized Thoughts.
Collaborators
I work with researchers across academia and industry, including:
Vitalik Buterin · Ethereum Ittai Abraham · VMware Research Joachim Neu · a16z crypto Research Tim Roughgarden · Columbia / a16z crypto Andrew Lewis-Pye · LSE Kartik Nayak · Duke University Christian Cachin · University of Bern
Research Interests
Consensus Protocols
Designing and analyzing protocols for distributed agreement, with a focus on finality, safety, and liveness under adversarial conditions. Includes dynamically available protocols, ebb-and-flow consensus, and fast confirmation rules for Ethereum.
Distributed Systems
Theoretical foundations of fault-tolerant distributed computation and Byzantine fault tolerance. Particular interest in models of trust — asymmetric and heterogeneous trust assumptions — and their formal treatment.
Reliable Agent Systems
An emerging direction: applying distributed-systems rigor — consensus, leases, idempotency, Byzantine fault models, verifiable evidence — to infrastructure where autonomous AI agents cooperate across machines.

Teaching

Teaching by building

Open Course · 2026
Concurrent and Distributed Systems in Rust
A 12-module course that teaches distributed systems by implementing them: every module is a self-standing lecture — formal system model, property specifications, algorithm and correctness argument, exercises, verified references — paired with working Rust implementations and reproducible failure demos. The classical anomalies and attacks are not described but exhibited: deadlocks freeze on screen, Byzantine equivocation splits naive protocols, forged certificates bounce off signatures, write skew breaks invariants that every participant honestly checked.
Replication & quorums Failure detectors Causal broadcast Raft 2PC 2PL · OCC · MVCC Bracha broadcast PBFT-style consensus CRDTs & gossip
Visiting Scholar · 2025–2026
University of Cambridge — Concurrent and Distributed Systems
Weekly small-group supervisions for Cambridge's Concurrent and Distributed Systems course, Department of Computer Science and Technology; invited seminar and guest teaching on blockchain and Ethereum.
Teaching Assistant · 2019–2023
University of Bern — Cryptography · Privacy and Data Security
Tutorials, exercises, and assessment for the Cryptology and Data Security group's courses, alongside doctoral research on asymmetric trust and Byzantine quorum systems.

Academic service: program committees and reviewing for DISC (2022, 2025), OPODIS (2024, 2025), PaPoC (2025), Science of Blockchain Conference (2026), IEEE SRDS (2026), Financial Cryptography (2026), Asiacrypt (2020), and Distributed Computing (2021). Mentoring of EF research interns, an industrial PhD intern, and master's students.


Projects

Software & analyses

Security Analysis · Ethereum
ePBS Security Analysis
Security analysis of enshrined proposer–builder separation (EIP-7732) for the Ethereum consensus layer — published under the official Ethereum organization.
Open Course · Rust
distributed-systems-in-rust
The course repository: twelve implemented modules, from a durable key-value store to Raft, PBFT with signed view changes, transactional concurrency control, and convergent replicated data types — with verdict-printing failure demos throughout.
In Progress · 2026
Reliable Distributed Agent Systems
Ongoing work: infrastructure for autonomous AI agents that cooperate across machines — consistent task state, crash and Byzantine fault tolerance, no duplicate irreversible actions, verifiable outcomes. Distributed-systems rigor applied to agent infrastructure.

Coverage

In the press


Publications

Research output

2025
ACM CCS 2025
Proves when liveness accountability is achievable, providing rigorous foundations for Ethereum's inactivity leak mechanism.
2024
EF Research
Reduces Ethereum finalization from 64–95 slots to 3, combining dynamic availability with partial synchrony.
2024
Preprint
Derives conditions for fast confirmation with a proved β < 1/4 safety threshold.
2024
IEEE CSF 2024
Introduces RLMD-GHOST, a dynamically available protocol that maintains safety during bounded asynchrony. Foundation for Ethereum's 3SF design.
2024
Distributed Computing, 2024
2023
PhD ThesisUniversity of Bern, 2023
Develops the theory of asymmetric trust in secure distributed systems — a formal model where participants hold different, possibly incompatible trust assumptions about each other.
2022
Financial Cryptography 2022
Full list on Google Scholar, DBLP, and arXiv.

Talks & Presentations

Where I've spoken

Aug 2026
Daejeon
What Does ePBS Actually Guarantee?
InvitedKAIST School of Computing — Research Seminar
Apr 2026
Seoul
The Whys Behind Ethereum's Consensus Design
BUIDL Asia 2026
Apr 2026
Seoul
What Comes Next for Institutions on Ethereum
Ethereum Korea One · Closing Talk
Mar 2025
Rotterdam
Towards a Faster Finality Protocol for Ethereum
KeynotePaPoC 2025 — Principles and Practice of Consistency for Distributed Data
Watch →
2024
Bangkok
A Fast Confirmation Rule for the Ethereum Consensus Protocol
Devcon
2023
Yale
The Ethereum Consensus Protocol
InvitedYale University
2023
a16z crypto
Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience
a16z crypto Research Summer School
Watch on YouTube →
Aug 2023
Stanford
Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience
Science of Blockchain Conference (SBC 2023)
Dec 2022
Brussels
Modeling Resources in Permissionless Longest-chain Total-order Broadcast
OPODIS 2022
Nov 2022
Los Angeles
Quorum Systems in Permissionless Networks
ConsensusDay 2022
May 2022
Grenada
Quick Order Fairness
Financial Cryptography 2022
Oct 2021
Remote
Asymmetric Asynchronous Byzantine Consensus
CBT @ ESORICS 2021
Sep 2021
Remote
How to Trust Strangers: Composition of Byzantine Quorum Systems
SRDS 2021

Writing

Posts & research notes

2025
With Vitalik Buterin · Ittai Abraham
A conceptual framework exploring the multiple layers of finality in blockchains — probabilistic, cryptoeconomic, threshold, and social — and how finality strengthens over time. Published on Decentralized Thoughts.
2025
ethresear.ch
On the fundamental reasons why Ethereum's consensus layer must remain live even as validator participation fluctuates — and what that demands from protocol design.
2024
ethresear.ch
Technical analysis of how the 3-Slot Finality protocol interacts with other major protocol upgrades on Ethereum's near-term roadmap.
2024
ethresear.ch
Introducing the 3SF protocol and reframing the single-slot finality goal around practical network constraints and validator set scale.
2023
ethresear.ch
Formal analysis of a fast confirmation rule for Ethereum's proof-of-stake consensus protocol, including the β < 1/4 safety threshold.
2023
ethresear.ch
Introduces RLMD-GHOST combined with Casper-FFG to achieve single-slot finality, showing how honest proposals can be finalized within the same slot they are proposed.
More on ethresear.ch.

Contact

Get in touch

I'm happy to hear from researchers, builders, and anyone working on consensus, distributed systems, or reliable agent infrastructure.

Email
GitHub
X / LinkedIn
Based in
Seoul, Korea