Publications related to Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Planetary-Scale Byzantine Fault Tolerance

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

EPFL2024

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

Enis Ceyhun Alp

Smart contracts have emerged as the most promising foundations for applications of the blockchain technology. Even though smart contracts are expected to serve as the backbone of the next-generation web, they have several limitations that hinder their wide ...

EPFL2024

The Privacy Power of Correlated Noise in Decentralized Learning

Rachid Guerraoui, Martin Jaggi, Youssef Allouah, Anastasiia Koloskova, Aymane El Firdoussi

Decentralized learning is appealing as it enables the scalable usage of large amounts of distributed data and resources (without resorting to any central entity), while promoting privacy since every user minimizes the direct exposure of their data. Yet, wi ...

PMLR2024

Breaking Blockchain Rationality with Out-of-Band Collusion

Bryan Alexander Ford, Verónica del Carmen Estrada Galiñanes, Louis-Henri Manuel Jakob Merino, Haoqian Zhang, Mahsa Bastankhah

Blockchain systems often rely on rationality assumptions for their security, expecting that nodes are motivated to maximize their profits. These systems thus design their protocols to incentivize nodes to execute the honest protocol but fail to consider ou ...

Cham2024

Reliable Microsecond-Scale Distributed Computing

Athanasios Xygkis

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

EPFL2023

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert, Manuel José Ribeiro Vidigueira

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

Nirupam Gupta

In this article, we study the problem of Byzantine fault-tolerance in a federated optimization setting, where there is a group of agents communicating with a centralized coordinator. We allow up to

f

Byzantine-faulty agents, which may not follow a prescr ...

Piscataway2023

DIABLO: A Benchmark Suite for Blockchains

Rachid Guerraoui, Gauthier Jérôme Timothée Voron, Vincent Gramoli, Andrei Lebedev

With the recent advent of blockchains, we have witnessed a plethora of blockchain proposals. These proposals range from using work to using time, storage or stake in order to select blocks to be appended to the chain. As a drawback it makes it difficult fo ...

ASSOC COMPUTING MACHINERY2023

Byzantine Machine Learning: A Primer

Rachid Guerraoui, Nirupam Gupta, Rafaël Benjamin Pinot

The problem of Byzantine resilience in distributed machine learning, a.k.a., Byzantine machine learning, consists in designing distributed algorithms that can train an accurate model despite the presence of Byzantine nodes, i.e., nodes with corrupt data or ...

2023

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Rachid Guerraoui, Andrei Kucharavy, Matteo Monti

Modern machine learning (ML) models are capable of impressive performances. However, their prowess is not due only to the improvements in their architecture and training algorithms but also to a drastic increase in computational power used to train them.|S ...

New York2023

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Graph Chatbot

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

The Privacy Power of Correlated Noise in Decentralized Learning

Breaking Blockchain Rationality with Out-of-Band Collusion

Reliable Microsecond-Scale Distributed Computing

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

DIABLO: A Benchmark Suite for Blockchains

Byzantine Machine Learning: A Primer

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Planetary-Scale Byzantine Fault Tolerance

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

The Privacy Power of Correlated Noise in Decentralized Learning

Breaking Blockchain Rationality with Out-of-Band Collusion

Reliable Microsecond-Scale Distributed Computing

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

DIABLO: A Benchmark Suite for Blockchains

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Byzantine Machine Learning: A Primer