Grassroots Distributed Systems for Digital Sovereignty: Proofs

cover
13 May 2024

This paper is available on arxiv under CC BY-NC-ND 4.0 DEED license.

Authors:

(1) Ehud Shapiro, Department of Computer Science and Applied Math, Weizmann Institute of Science, Israel and ehud.shapiro@weizmann.ac.il.

Proofs

A GCD configuration records explicitly all the dependencies among the block occurrences in it, with one exception – if the same block message is sent to the same agent by several agents, the configuration does not record which of the messages was received. Hence the cordial dependency graph has some nondeterminism.