AI 中文总结
研究解决完全异步环境中确定性容错共识可能性与FLP不可能性结果间的矛盾，用严格形式化框架弥合差距，证明一个协议阶段的作用，还给出容忍多故障新算法并严格证明正确性。
AI 中文摘要
在本文中，我们解决了在完全异步环境中确定性容错共识已被证明的可能性与Attiya、Castañeda和Rajsbaum对FLP不可能性结果的再次确认之间的明显矛盾。通过使用扩展他们推理的严格形式化框架，我们弥合了这一理论上的基本差距。具体而言，我们证明一个协议阶段使他们的发现得出相反结论。另一个重要成果是一种能容忍多个故障的新算法。我们提供严格的正确性证明来验证结果。
英文摘要
In this paper, we resolve the apparent contradiction between the proven possibility of deterministic crash-tolerant consensus in a fully asynchronous environment and the reconfirmation of the FLP impossibility result by Attiya, Castañeda, and Rajsbaum. With the use of a strictly formal framework that extends their reasoning, we close this fundamental gap in theory. Specifically, we demonstrate that a single protocol phase separates their findings from reaching the exact opposite conclusion. Another important outcome is a novel algorithm with ability to tolerate multiple crash faults. We provide a rigorous, strictly formal proof of correctness to validate our results.
CommentsThis is an Accepted Manuscript of an article published by Taylor & Francis Group in the International Journal of Parallel, Emergent & Distributed Systems on 22/07/2026, available online: https://www.tandfonline.com/doi/10.1080/17445760.2026.2694348
Journal ref2026. International Journal of Parallel, Emergent and Distributed Systems, July, 1-24
DOI：10.1080/17445760.2026.2694348
