# Trade-offs in Distributed Interactive Proofs

## TL;DR

This paper explores the capabilities and limitations of distributed interactive proofs, analyzing trade-offs among key parameters like interaction rounds, certificate size, and randomness, and linking them to distributed verification.

## Contribution

It introduces a structured analysis of distributed interactive proofs, establishing trade-offs between parameters and connecting them to existing distributed verification frameworks.

## Key findings

- Trade-offs between interaction rounds, certificate size, and randomness are characterized.
- Distributed interactive proofs are connected to distributed verification, enriching the theoretical landscape.
- The study provides a structured understanding of the power and limitations of distributed interactive proofs.

## Abstract

The study of interactive proofs in the context of distributed network computing is a novel topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018]. In the spirit of sequential interactive proofs theory, we study the power of distributed interactive proofs. This is achieved via a series of results establishing trade-offs between various parameters impacting the power of interactive proofs, including the number of interactions, the certificate size, the communication complexity, and the form of randomness used. Our results also connect distributed interactive proofs with the established field of distributed verification. In general, our results contribute to providing structure to the landscape of distributed interactive proofs.