Stingray: Fast Concurrent Transactions Without Consensus

• URL: http://arxiv.org/abs/2501.06531v1
• Date: Sat, 11 Jan 2025 12:41:46 GMT
• Title: Stingray: Fast Concurrent Transactions Without Consensus
• Authors: Srivatsan Sridhar, Alberto Sonnino, Lefteris Kokoris-Kogias,
• Abstract summary: Recent advances have improved the throughput and latency of blockchains by processing transactions accessing different parts of the state concurrently. We present Stingray, a novel blockchain architecture that addresses these limitations. We prove Stingray's security in an asynchronous network with Byzantine faults and demonstrate on a global testbed that Stingray achieves 10,000 times the throughput of prior systems for commutative workloads.
• Score: 3.664375550590193
• License:
• Abstract: Recent advances have improved the throughput and latency of blockchains by processing transactions accessing different parts of the state concurrently. However, these systems are unable to concurrently process (a) transactions accessing the same state, even if they are (almost) commutative, e.g., payments much smaller than an account's balance, and (b) multi-party transactions, e.g., asset swaps. Moreover, they are slow to recover from contention, requiring once-in-a-day synchronization. We present Stingray, a novel blockchain architecture that addresses these limitations. The key conceptual contributions are a replicated bounded counter that processes (almost) commutative transactions concurrently, and a FastUnlock protocol that uses a fallback consensus protocol for fast contention recovery. We prove Stingray's security in an asynchronous network with Byzantine faults and demonstrate on a global testbed that Stingray achieves 10,000 times the throughput of prior systems for commutative workloads.

Related papers

• Streaming DiLoCo with overlapping communication: Towards a Distributed Free Lunch [66.84195842685459]
  Training of large language models (LLMs) is typically distributed across a large number of accelerators to reduce training time. Recently, distributed algorithms like DiLoCo have relaxed such co-location constraint. We show experimentally that we can distribute training of billion-scale parameters and reach similar quality as before.
  arXiv  Detail & Related papers  (2025-01-30T17:23:50Z)
• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency. Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things [38.94331838546716]
  Current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. Results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead.
  arXiv  Detail & Related papers  (2024-12-17T09:43:37Z)
• Validated Strong Consensus Protocol for Asynchronous Vote-based Blockchains [4.79997217554732]
  Vote-based blockchains use Byzantine Fault Tolerance consensus protocols to transition from one state to another. This paper proposes a emphvalidated strong BFT consensus model that allows leader-based coordination in asynchronous settings. Our protocol greatly reduces message complexity and is the first one to achieve linear view changes without relying on threshold signatures.
  arXiv  Detail & Related papers  (2024-09-12T15:54:40Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Recurrent Complex-Weighted Autoencoders for Unsupervised Object Discovery [62.43562856605473]
  We argue for the computational advantages of a recurrent architecture with complex-valued weights. We propose a fully convolutional autoencoder, SynCx, that performs iterative constraint satisfaction.
  arXiv  Detail & Related papers  (2024-05-27T15:47:03Z)
• Multichain Taprootized Atomic Swaps: Introducing Untraceability through Zero-Knowledge Proofs [14.379311972506791]
  Taprootized Atomic Swaps is an extension for Atomic Swaps that enables the untraceability of transactions in a particular swap. Based on Schnorr signatures, Taproot technology, and zero-knowledge proofs, the taprootized atomic swaps hide swap transactions between regular payments.
  arXiv  Detail & Related papers  (2024-02-26T16:57:29Z)
• Cuttlefish: Expressive Fast Path Blockchains with FastUnlock [4.483666331132052]
  Cuttlefish addresses limitations of existing consensus-less and consensus-minimized decentralized ledgers. Key insight of Cuttlefish is that consensus is necessary due to contention, rather than multiple owners of an asset as suggested by prior work. Cuttlefish introduces collective objects and multi-owner transactions that can offer most of the functionality of classic blockchains.
  arXiv  Detail & Related papers  (2023-09-22T08:56:32Z)
• Synchro: Block-generation Protocol to Synchronously Process Cross-shard Transactions in State Sharding [0.0]
  Nightshade in the NEAR Protocol, a type of state sharding, provides a rollback protocol to cancel the generation of blocks containing inconsistent transaction results. We present a new attack that interferes with the generation of new blocks by repeatedly executing CSTXs. We also propose a block-generation protocol called Synchro to incorporate all the state changes of each CSTX into the same block.
  arXiv  Detail & Related papers  (2023-09-04T03:20:49Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.