REVIEW 1 cited by
Cross-Chain State Machine Replication
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
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.
Forward citations
Cited by 1 Pith paper
-
$\mathsf{CRATE}$: Cross-Rollup Atomic Transaction Execution
CRATE is a trust-minimized protocol for atomic, serializable cross-rollup transactions on distinct L1 chains, with formal models, security proofs, and an implementation.
Discussion (0). Continue with ORCID to comment.