arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2208.11241cs.PLcs.LOcs.NI
收藏

您的区块链不必关心消息如何传播

Your Blockchain Needn't Care How the Message is Spread

Wolfgang Jeltsch, Javier Díaz

摘要:

在区块链系统中,节点定期将数据分发给其他节点。科学文献中采用的理想观点是数据直接广播到所有节点,而在实践中数据通过重复组播进行分发。由于正确性和安全性通常仅针对理想设置建立,因此证明这些属性可以应用于现实世界的实现是至关重要的。这可以通过证明理想行为和真实行为是等价的来实现。在本文所描述的工作中,我们通过证明上述等价声明的一个更简单的变体,向这样的证明迈出了重要的一步。简化是,我们只考虑一个具体的网络拓扑对,但它说明了遇到任意拓扑的重要现象。为了描述分发数据的系统,我们使用嵌入在通用进程演算中的特定于域的进程语言。这使我们能够在我们的证明中利用丰富的过程演算理论,这是使用Isabelle证明助手进行机器检查的。

英文摘要:

In a blockchain system, nodes regularly distribute data to other nodes. The ideal perspective taken in the scientific literature is that data is broadcast to all nodes directly, while in practice data is distributed by repeated multicast. Since correctness and security typically have been established for the ideal setting only, it is vital to show that these properties carry over to real-world implementations. This can be done by proving 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 the above 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 is embedded in a general-purpose process calculus. This allows us to leverage the rich theory of process calculi in our proof, which is machine-checked using the Isabelle proof assistant.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑