It has recently been shown (PODC 2019) 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 shows that money transfers do not need to explicitly capture the causality relation that links individual transfers. A simple FIFO order between each pair of processes is sufficient. To this end, the article presents a generic money transfer algorithm that can be instantiated in both the crash failure model and the Byzantine failure model. 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 that the construction of a read/write register in the asynchronous message-passing crash-prone model.

中文翻译：

---

汇款变得简单

最近表明（PODC 2019），与普遍看法相反，在存在错误（拜占庭）流程的情况下进行汇款不需要达成共识等强有力的协议。本文更进一步：即，它表明货币转移不需要明确捕捉连接个人转移的因果关系。每对进程之间的简单 FIFO 顺序就足够了。为此，本文提出了一种通用的汇款算法，该算法可以在崩溃故障模型和拜占庭故障模型中进行实例化。通用性维度在于底层可靠的广播抽象，它必须适合适当的故障模型。有趣的是，无论失败模型是什么，汇款算法只需要在其消息中添加一个序列号作为控制信息。此外，作为所提出算法的副作用，货币转移是一个较弱的问题，因为在异步消息传递容易崩溃的模型中构建读/写寄存器。