Sui Lutris: A Blockchain Combining Broadcast and Consensus

• URL: http://arxiv.org/abs/2310.18042v5
• Date: Wed, 30 Oct 2024 10:49:30 GMT
• Title: Sui Lutris: A Blockchain Combining Broadcast and Consensus
• Authors: Sam Blackshear, Andrey Chursin, George Danezis, Anastasios Kichidis, Lefteris Kokoris-Kogias, Xun Li, Mark Logan, Ashok Menon, Todd Nowacki, Alberto Sonnino, Brandon Williams, Lu Zhang,
• Abstract summary: Sui Lutris is the first smart-contract platform to achieve sub-second finality. We develop a novel reconfiguration protocol, the first to provably show the safe reconfiguration of a consensusless blockchain.
• Score: 6.922934367879061
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sui Lutris is the first smart-contract platform to sustainably achieve sub-second finality. It achieves this significant decrease by employing consensusless agreement not only for simple payments but for a large variety of transactions. Unlike prior work, Sui Lutris neither compromises expressiveness nor throughput and can run perpetually without restarts. Sui Lutris achieves this by safely integrating consensuless agreement with a high-throughput consensus protocol that is invoked out of the critical finality path but ensures that when a transaction is at risk of inconsistent concurrent accesses, its settlement is delayed until the total ordering is resolved. Building such a hybrid architecture is especially delicate during reconfiguration events, where the system needs to preserve the safety of the consensusless path without compromising the long-term liveness of potentially misconfigured clients. We thus develop a novel reconfiguration protocol, the first to provably show the safe and efficient reconfiguration of a consensusless blockchain. Sui Lutris is currently running in production and underpins the Sui smart-contract platform. Combined with the use of Objects instead of accounts it enables the safe execution of smart contracts that expose objects as a first-class resource. In our experiments Sui Lutris achieves latency lower than 0.5 seconds for throughput up to 5,000 certificates per second (150k ops/s with transaction blocks), compared to the state-of-the-art real-world consensus latencies of 3 seconds. Furthermore, it gracefully handles validators crash-recovery and does not suffer visible performance degradation during reconfiguration.

Related papers

• RAIN: Secure and Robust Aggregation under Shuffle Model of Differential Privacy [46.52109845749167]
  We present Robust Aggregation in Noise (RAIN), a framework that reconciles privacy, robustness, and verifiability under Shuffle-DP.<n>RAIN adopts sign-space aggregation to robustly measure update consistency and limit malicious influence under noise and anonymization.<n>We show that RAIN maintains strong privacy guarantees under Shuffle-DP and remains robust to poisoning attacks with negligible degradation in accuracy and convergence.
  arXiv  Detail & Related papers  (2026-03-03T15:41:54Z)
• SettleFL: Trustless and Scalable Reward Settlement Protocol for Federated Learning on Permissionless Blockchains (Extended version) [17.95957378837296]
  We present SettleFL, a trustless and scalable reward settlement protocol.<n>It offers two interoperable strategies: Commit-and-Challenge and Commit-with-Proof.<n>Results show that SettleFL remains practical when scaling to 800 participants, achieving substantially lower gas cost.
  arXiv  Detail & Related papers  (2026-02-26T16:31:23Z)
• SoK: Speedy Secure Finality [0.0]
  This paper surveys the state of the art in fast finality protocol design.<n>We introduce the core theoretical primitives underlying this space.<n>We then analyze the communication and aggregation bottlenecks faced by single-slot finality protocols.
  arXiv  Detail & Related papers  (2025-12-23T19:25:02Z)
• Sedna: Sharding transactions in multiple concurrent proposer blockchains [42.71280924071485]
  We present Sedna, a user-facing protocol that replaces naive transaction replication with verifiable, rateless coding.<n>We prove Sedna guarantees liveness and emphuntil-decode privacy, significantly reducing MEV exposure.
  arXiv  Detail & Related papers  (2025-12-18T20:12:55Z)
• Odontoceti: Ultra-Fast DAG Consensus with Two Round Commitment [0.0]
  Odontoceti is the latest in DAG-based consensus, operating with a 20% fault tolerance instead of the established 33% level.<n>It is the first DAG-based protocol to achieve commitment in just two communication rounds, delivering median latency of 300 milliseconds.<n>This paper establishes the practical viability of lower fault tolerance consensus protocols for blockchains.
  arXiv  Detail & Related papers  (2025-09-19T15:22:28Z)
• Commit-Reveal$^2$: Securing Randomness Beacons with Randomized Reveal Order in Smart Contracts [25.885166716453153]
  We present Commit-Reveal$2$, a layered design for blockchain deployments that cryptographically randomizes the final reveal order.<n>The protocol is architected as a hybrid system, where routine coordination runs off chain for efficiency.<n>We release a publicly verifiable prototype and evaluation artifacts to support replication and adoption in blockchain applications.
  arXiv  Detail & Related papers  (2025-04-04T21:05:51Z)
• 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)
• Stingray: Fast Concurrent Transactions Without Consensus [3.664375550590193]
  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.
  arXiv  Detail & Related papers  (2025-01-11T12:41:46Z)
• 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)
• Maximizing Blockchain Performance: Mitigating Conflicting Transactions through Parallelism and Dependency Management [0.18641315013048293]
  "Conflicting transactions" contribute to high network latency and transaction failures. We present a novel scheme that integrates transaction parallelism and an intelligent dependency manager. Results show that our scheme outperforms both existing parallel and non-parallel Hyperledger Fabric blockchain networks.
  arXiv  Detail & Related papers  (2024-07-01T16:17:33Z)
• Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer [26.61748905524824]
  We introduce the Delegated Ownership Transfer (DOT) paradigm to enable secure, high-performance cross-chain payments.<n>DOT decouples key ownership from value ownership to enable secure, high-performance cross-chain payments.<n>Our prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees.
  arXiv  Detail & Related papers  (2024-03-22T13:21:09Z)
• Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized Overhead [17.387814385763622]
  Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts. Cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains. We present Kronos, a secure sharding blockchain consensus achieving optimized overhead.
  arXiv  Detail & Related papers  (2024-03-06T12:26:04Z)
• Transaction Capacity, Security and Latency in Blockchains [35.16231062731263]
  We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus. We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• Mysticeti: Reaching the Limits of Latency with Uncertified DAGs [5.328717371685882]
  We introduce Mysticeti-C, the first DAG-based Byzantine consensus protocol to achieve the lower bounds of latency of 3 message rounds. We extend Mysticeti-C to Mysticeti-FPC, which incorporates a fast commit path that achieves even lower latency for transferring assets.
  arXiv  Detail & Related papers  (2023-10-23T11:40:50Z)
• Short Paper: Accountable Safety Implies Finality [10.589723476970443]
  Two key desiderata have been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols. We show that accountable safety implies finality, thereby unifying earlier results.
  arXiv  Detail & Related papers  (2023-08-31T17:58:38Z)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• SaFormer: A Conditional Sequence Modeling Approach to Offline Safe Reinforcement Learning [64.33956692265419]
  offline safe RL is of great practical relevance for deploying agents in real-world applications. We present a novel offline safe RL approach referred to as SaFormer.
  arXiv  Detail & Related papers  (2023-01-28T13:57:01Z)
• Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback [46.30924494799245]
  We develop Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path and progress guarantee under asynchrony and DDoS attacks. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon. We implement and experimentally evaluate all our systems. Notably, Jolteon's commit latency outperforms HotStuff by 200-300ms with varying system size.
  arXiv  Detail & Related papers  (2021-06-18T21:34:17Z)
• ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep Neural Network and Transfer Learning [80.85273827468063]
  Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable. We propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for smart contracts. We show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract.
  arXiv  Detail & Related papers  (2021-03-23T15:04:44Z)
• Towards Bidirectional Protection in Federated Learning [70.36925233356335]
  F2ED-LEARNING offers bidirectional defense against malicious centralized server and Byzantine malicious clients. F2ED-LEARNING securely aggregates each shard's update and launches FilterL2 on updates from different shards. evaluation shows that F2ED-LEARNING consistently achieves optimal or close-to-optimal performance.
  arXiv  Detail & Related papers  (2020-10-02T19:37:02Z)
• Regulation conform DLT-operable payment adapter based on trustless - justified trust combined generalized state channels [77.34726150561087]
  Economy of Things (EoT) will be based on software agents running on peer-to-peer trustless networks. We give an overview of current solutions that differ in their fundamental values and technological possibilities. We propose to combine the strengths of the crypto based, decentralized trustless elements with established and well regulated means of payment.
  arXiv  Detail & Related papers  (2020-07-03T10:45:55Z)

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.