Nomadic Labs Research Seminars #19 | Tenderbake: bringing deterministic finality to Tezos

Описание: The Nomadic Labs Research Seminars series is dedicated to promoting and discussing the extensive list of Tezos research and development projects.

The series includes live presentations from major research projects happening within the Tezos ecosystem. These hour-long sessions consist of an expert-led presentation for 45 minutes plus a 15 minutes live Q&A between developers, academics, and members of the Tezos community.

This session features a presentation by Vincent Botbol and Eugen Zalinescu who introduce the algorithm of Tenderbake and its integration in Tezos.
Tenderbake is a so-called classic BFT consensus algorithm. This means that it provides deterministic finality --- no fork is possible ---, regardless of network delays and partitions, assuming at most one third of the total stake is Byzantine.

Tenderbake is an adaption of Tendermint for Tezos. One important difference is its reliance on loosely synchronized clocks which allows nodes to synchronize with each other without exchanging messages, by only leveraging information stored in the blockchain. Tenderbake is designed such that the synchronization mechanism is decoupled from the consensus logic. Such a separation of concerns allows for cleaner proofs and a simpler algorithm.

Vincent Botbol is a R&D architect at Nomadic Labs. He has previously worked as a researcher at Sorbonne Université and CEA LIST on formal verification of concurrent systems.
Eugen Zalinescu is a research engineer at Nomadic Labs, working in the consensus team. He has previously worked as a researcher at TU München, ETH Zurich, and INRIA on various topics in formal verification.