Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Polyanskii, Nikita, Muller, Sebastian, Raikwar, Mayank
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912339671908352
author Polyanskii, Nikita
Muller, Sebastian
Raikwar, Mayank
author_facet Polyanskii, Nikita
Muller, Sebastian
Raikwar, Mayank
contents This paper introduces Slipstream, a Byzantine Fault Tolerance (BFT) protocol where nodes concurrently propose blocks to be added to a Directed Acyclic Graph (DAG) and aim to agree on block ordering. Slipstream offers two types of block orderings: an optimistic ordering, which is live and secure in a sleepy model under up to 50% Byzantine nodes, and a final ordering, which is a prefix of the optimistic ordering and ensures safety and liveness in an eventual lock-step synchronous model under up to 33% Byzantine nodes. Additionally, Slipstream integrates a payment system that allows for fast UTXO transaction confirmation independently of block ordering. Transactions are confirmed in three rounds during synchrony, and unconfirmed double spends are resolved in a novel way using the DAG structure.
format Preprint
id arxiv_https___arxiv_org_abs_2410_14876
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
Polyanskii, Nikita
Muller, Sebastian
Raikwar, Mayank
Distributed, Parallel, and Cluster Computing
Data Structures and Algorithms
This paper introduces Slipstream, a Byzantine Fault Tolerance (BFT) protocol where nodes concurrently propose blocks to be added to a Directed Acyclic Graph (DAG) and aim to agree on block ordering. Slipstream offers two types of block orderings: an optimistic ordering, which is live and secure in a sleepy model under up to 50% Byzantine nodes, and a final ordering, which is a prefix of the optimistic ordering and ensures safety and liveness in an eventual lock-step synchronous model under up to 33% Byzantine nodes. Additionally, Slipstream integrates a payment system that allows for fast UTXO transaction confirmation independently of block ordering. Transactions are confirmed in three rounds during synchrony, and unconfirmed double spends are resolved in a novel way using the DAG structure.
title Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
topic Distributed, Parallel, and Cluster Computing
Data Structures and Algorithms
url https://arxiv.org/abs/2410.14876