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

货币转移变得简单:规范,通用算法及其证明

Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof

Alex Auvolat, Davide Frey, Michel Raynal, François Taïani

摘要:

最近的研究表明,与人们普遍认为的相反,在存在错误(拜占庭)过程的情况下进行货币转移并不需要像共识这样的强有力的协议。本文更进一步:即,首先提出了一个非顺序规范的货币转移对象,然后提出了一个泛型算法的基础上,一个简单的FIFO顺序之间的每对进程,实现它的genericitydimension在于底层的可靠的广播抽象,必须适合适当的故障模型。有趣的是,无论失败模型是什么,资金转移算法只需要在其消息中添加一个序列号作为控制信息。此外,作为所提出的算法的一个副作用,它遵循的货币转移是一个较弱的问题,比一个安全的/定期的/原子读/写寄存器的异步消息传递崩溃倾向模型的建设。

英文摘要:

It has recently been shown that, contrarily to a common belief, money transfer in the presence of faulty (Byzantine) processes does not require strong agreement such as consensus. This article goes one step further: namely, it first proposes a non-sequential specification of the money-transfer object, and then presents a generic algorithm based on a simple FIFO order between each pair of processes that implements it. The genericity dimension lies in the underlying reliable broadcast abstraction which must be suited to the appropriate failure model. Interestingly, whatever the failure model, the money transfer algorithm only requires adding a single sequence number to its messages as control information. Moreover, as a side effect of the proposed algorithm, it follows that money transfer is a weaker problem than the construction of a safe/regular/atomic read/write register in the asynchronous message-passing crash-prone model.

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

↑