# Making Asynchronous Distributed Computations Robust to Noise

## TL;DR

This paper introduces a fully distributed interactive coding scheme that makes asynchronous distributed computations resilient to adversarial message corruptions, without prior knowledge of network topology, with optimal noise tolerance and manageable communication overhead.

## Contribution

It presents the first fully distributed coding scheme for asynchronous networks that tolerates adversarial noise without requiring network topology knowledge beforehand.

## Key findings

- Tolerates a (1/n) fraction of message corruptions.
- Achieves an O(node log^2 n) increase in communication complexity.
- Works in arbitrary asynchronous networks without a central coordinator.

## Abstract

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $\Theta(1/n)$ fraction of all messages while incurring a moderate blowup of $O(n\log^2 n)$ in the communication complexity. Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coordinating node to be connected to all other nodes in the network or assumed a synchronous network in which all nodes already know the complete topology of the network.