This paper considers the classical state machine replication (SMR) problem in a distributed system model inspired by cross-chain exchanges. We propose a novel SMR protocol adapted for this model. Each state machine transition takes $O(n)$ message delays, where $n$ is the number of active participants, of which any number may be Byzantine. This protocol makes novel use of path signatures to keep replicas consistent. This protocol design cleanly separates application logic from fault-tolerance, providing a systematic way to replace complex ad-hoc cross-chain protocols with a more principled approach.
翻译:本文审视了由跨链交换所启发的分布式系统模型中典型的国家机器复制(SMR)问题。 我们提出了适合该模型的新型SMR协议。 州机器转换需要美元(n)的电文延迟, 美元是活跃参与者的数量, 其中任何数字都可能是拜占庭。 该协议新用路径签名来保持复制的一致性。 该协议将应用逻辑和过错容忍区分开来, 提供了一个系统化的方法, 以更具原则性的方法取代复杂的 ad- hoc 跨链协议 。