arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2508.03418cs.DCcs.LO
收藏

最优同步拜占庭协议、公共知识与有限信息交换

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange

School of Computer Science and Engineering, UNSW Sydney(新南威尔士大学计算机科学与工程学)

Ron van der Meyden

AI总结:

本文针对全信息协议效率不足的问题,重新开展同步拜占庭协议的认知分析,厘清相关概念分歧,证明基于知识的程序在特定信息交换下的最优性,同时指出该最优性并非普遍成立。

摘要:

为开发能尽早执行动作的解决方案,采用认知逻辑的分布式算法分析通常聚焦于“全信息协议”,这类协议在空间占用和计算时间方面可能效率低下。本文针对更弱但更实用的信息交换方式,重新开展了同步拜占庭协议(Simultaneous Byzantine Agreement)问题的认知分析。论文首先厘清了该问题的规范定义、以及表征其解决方案的基于知识的程序相关的若干问题,涉及文献中存在分歧的“无故障”与“尚未故障”概念的区分。随后研究表明,当基于给定故障模型、且满足特定条件的信息交换协议实现时,该基于知识的程序所生成的协议,相对于采用相同信息交换方式的解决方案是最优的。本文还确定了该实现同样具备最优性的若干条件,但也提供了一个示例,表明这一最优性并非普遍成立。

英文摘要:

In order to develop solutions that perform actions as early as possible, analysis of distributed algorithms using epistemic logic has generally concentrated on ``full information protocols'', which may be inefficient with respect to space and computation time. The paper reconsiders the epistemic analysis of the problem of Simultaneous Byzantine Agreement with respect to weaker, but more practical, exchanges of information. The paper first clarifies some issues concerning both the specification of this problem and the knowledge based program characterizing its solution, concerning the distinction between the notions of ``nonfaulty'' and ``not yet failed'', on which there are variances in the literature. It is then shown that, when implemented relative to a given failure model and an information exchange protocol satisfying certain conditions, this knowledge based program yields a protocol that is optimal relative to solutions using the same information exchange. Conditions are also identified under which this implementation is also an optimum, but an example is provided that shows this does not hold in general.

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

↑