Cross-Chain State Machine Replication

06/14/2022
by   Yingjie Xue, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/22/2020

TaiJi: Longest Chain Availability with BFT Fast Confirmation

Most state machine replication protocols are either based on the 40-year...
research
09/22/2020

A Formally Verified Protocol for Log Replication with Byzantine Fault Tolerance

Byzantine fault tolerant protocols enable state replication in the prese...
research
02/04/2022

Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance

Traditional Byzantine Fault Tolerance (BFT) state machine replication pr...
research
06/24/2021

Stream-based State-Machine Replication

Developing state-machine replication protocols for practical use is a co...
research
04/11/2023

EESMR: Energy Efficient BFT-SMR for the masses

Modern Byzantine Fault-Tolerant State Machine Replication (BFT-SMR) solu...
research
12/10/2019

Cross-Chain Payment Protocols with Success Guarantees

In this paper, we consider the problem of cross-chain payment whereby cu...
research
11/18/2019

Can 100 Machines Agree?

Agreement protocols have been typically deployed at small scale, e.g., u...

Please sign up or login with your details

Forgot password? Click here to reset