  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.
