Theoretical analysis and algorithm development for Byzantine Vector Consensus in partially synchronous environments.
This repository contains the paper and presentation of the work "Improving the complexity of Byzantine Vector Consensus", by Manos Chatzakis (emmanouil.chatzakis@epfl.ch), Jovan Komatovic and Rachid Guerraoui, at DCL Lab of EPFL.
In Byzantine vector consensus, every process proposes a value and eventually all correct processes decide a vector of
The best practical solution to this problem is known to have communication complexity of
Our proposed algorithm achieves Byzantine vector consensus with communication complexity of
Our environment is partially synchronous: The message delays are unbounded, till a global stabilization time.
We propose a Byzantine Vector Consensus protocol, which exploits a leader-based vector dissemination module which is responsible for disseminating a vector of
This work was done in collaboration with the Distributing Computing Laboratory lab of EPFL, during the Research Project of Computer Science Master program, during the spring semester of 2023.