Lachesis: Scalable Asynchronous BFT on DAG Streams
Quan Nguyen, Andre Cronje, Michael Kong, Egor Lysenko, Alex Guzev

TL;DR
Lachesis is a novel asynchronous BFT consensus protocol using DAG streams, integrated with Proof-of-Stake, to achieve low finality times and high scalability for distributed ledgers.
Contribution
The paper introduces Lachesis, a leaderless, permissionless BFT protocol on DAGs with integrated PoS, dynamic participation, and optimized storage, advancing scalable distributed ledger technology.
Findings
Achieves low time to finality for transactions.
Supports dynamic node participation.
Ensures consistency and security in asynchronous environments.
Abstract
This paper consolidates the core technologies and key concepts of our novel Lachesis consensus protocol and Fantom Opera platform, which is permissionless, leaderless and EVM compatible. We introduce our new protocol, so-called Lachesis, for distributed networks achieving Byzantine fault tolerance (BFT)~\cite{lachesis01}. Each node in Lachesis protocol operates on a local block DAG, namely \emph{OPERA DAG}. Aiming for a low time to finality (TTF) for transactions, our general model considers DAG streams of high speed but asynchronous events. We integrate Proof-of-Stake (PoS) into a DAG model in Lachesis protocol to improve performance and security. Our general model of trustless system leverages participants' stake as their validating power~\cite{stakedag}. Lachesis's consensus algorithm uses Lamport timestamps, graph layering and concurrent common knowledge to guarantee a consistent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Blockchain Technology Applications and Security · Cloud Computing and Resource Management
