Local Verification of Global Proofs

Laurent Feuilloley, Juho Hirvonen

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

9 Downloads (Pure)


In this work we study the cost of local and global proofs on distributed verification. In this setting the nodes of a distributed system are provided with a nondeterministic proof for the correctness of the state of the system, and the nodes need to verify this proof by looking at only their local neighborhood in the system. Previous works have studied the model where each node is given its own, possibly unique, part of the proof as input. The cost of a proof is the maximum size of an individual label. We compare this model to a model where each node has access to the same global proof, and the cost is the size of this global proof. It is easy to see that a global proof can always include all of the local proofs, and every local proof can be a copy of the global proof. We show that there exists properties that exhibit these relative proof sizes, and also properties that are somewhere in between. In addition, we introduce a new lower bound technique and use it to prove a tight lower bound on the complexity of reversing distributed decision and establish a link between communication complexity and distributed proof complexity.
Original languageEnglish
Title of host publication32nd International Symposium on Distributed Computing (DISC 2018)
EditorsUlrich Schmid, Juho Hirvonen
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl-Leibniz-Zentrum für Informatik
Number of pages17
ISBN (Electronic)978-3-95977-092-7
Publication statusPublished - 1 Oct 2018
MoE publication typeA4 Article in a conference publication
EventInternational Symposium on Distributed Computing - New Orleans, United States
Duration: 15 Oct 201819 Oct 2018
Conference number: 32

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
ISSN (Electronic)1868-8969


ConferenceInternational Symposium on Distributed Computing
Abbreviated titleDISC
Country/TerritoryUnited States
CityNew Orleans
Internet address


  • proof-labeling schemes
  • distributed verification
  • non-determinism
  • local proofs


Dive into the research topics of 'Local Verification of Global Proofs'. Together they form a unique fingerprint.

Cite this