通过多播广播的正确性:图形和形式
Correctness of Broadcast via Multicast: Graphically and Formally
摘要:
保持多方之间的数据一致性需要节点重复向所有其他节点发送数据。例如,区块链网络的节点必须在整个网络中传播他们创建的区块。科学文献通常采取理想的观点,即这种数据分发是通过直接广播到所有节点来执行的,而在实践中,数据是通过重复的多播来分发的。由于一致性维护协议的正确性和安全性通常仅针对理想设置而建立,因此证明这些属性可以应用于现实世界的实现是至关重要的。因此,需要证明理想行为和真实行为是等价的。在本文所描述的工作中,我们采取了重要的一步,证明了一个更简单的变体,这个等价声明这样的证明。简化是,我们只考虑一个具体的网络拓扑对,但它说明了遇到任意拓扑的重要现象。为了描述分发数据的系统,我们使用了一个特定于域的语言的过程,对应于一类Petri网,并嵌入在一个通用的过程演算。这样,我们可以使用直观的图形符号概述我们的证明,并在实际证明中利用丰富的过程演算理论,这是使用Isabelle证明助手进行机器检查的。
英文摘要:
Maintaining data consistency among multiple parties requires nodes to repeatedly send data to all other nodes. For example, the nodes of a blockchain network have to disseminate the blocks they create across the whole network. The scientific literature typically takes the ideal perspective that such data distribution is performed by broadcasting to all nodes directly, while in practice data is distributed by repeated multicast. Since correctness and security of consistency maintenance protocols usually have been established for the ideal setting only, it is vital to show that these properties carry over to real-world implementations. Therefore, it is desirable to prove that the ideal and the real behavior are equivalent. In the work described in this paper, we take an important step towards such a proof by proving a simpler variant of this equivalence statement. The simplification is that we consider only a concrete pair of network topologies, which nevertheless illustrates important phenomena encountered with arbitrary topologies. For describing systems that distribute data, we use a domain-specific language of processes that corresponds to a class of Petri nets and is embedded in a general-purpose process calculus. This way, we can outline our proof using an intuitive graphical notation and leverage the rich theory of process calculi in the actual proof, which is machine-checked using the Isabelle proof assistant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。