Walrus: An Efficient Decentralized Storage Network

• URL: http://arxiv.org/abs/2505.05370v2
• Date: Mon, 09 Jun 2025 16:08:54 GMT
• Title: Walrus: An Efficient Decentralized Storage Network
• Authors: George Danezis, Giacomo Giuliari, Eleftherios Kokoris Kogias, Markus Legner, Jean-Pierre Smith, Alberto Sonnino, Karl Wüst,
• Abstract summary: Walrus is a novel decentralized blob storage system that addresses limitations through multiple technical innovations.<n>RedStuff is a two-dimensional erasure coding protocol that achieves high security with only 4.5x replication factor.<n>Walrus also introduces a novel multi-stage epoch change protocol that efficiently handles storage node churn.
• Score: 6.053171723478456
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Decentralized storage systems face a fundamental trade-off between replication overhead, recovery efficiency, and security guarantees. Current approaches either rely on full replication, incurring substantial storage costs, or employ trivial erasure coding schemes that struggle with efficient recovery especially under high storage-node churn. We present Walrus, a novel decentralized blob storage system that addresses these limitations through multiple technical innovations. At the core of Walrus is RedStuff, a two-dimensional erasure coding protocol that achieves high security with only 4.5x replication factor, while enabling self-healing recovery that requires bandwidth proportional to only the lost data $(O(|blob|/n)$ versus $O(|blob|)$ in traditional systems). Crucially, RedStuff is the first protocol to support storage challenges in asynchronous networks, preventing adversaries from exploiting network delays to pass verification without actually storing data. Walrus also introduces a novel multi-stage epoch change protocol that efficiently handles storage node churn while maintaining uninterrupted availability during committee transitions. Our system incorporates authenticated data structures to defend against malicious clients and ensures data consistency throughout storage and retrieval processes. Experimental evaluation demonstrates that Walrus achieves practical performance at scale, making it suitable for a wide range of decentralized applications requiring high-integrity, available blob storage with reasonable overhead.

Related papers

• Compress, Gather, and Recompute: REFORMing Long-Context Processing in Transformers [58.98923344096319]
  REFORM is a novel inference framework that efficiently handles long contexts through a two-phase approach.<n>It achieves over 50% and 27% performance gains on RULER and BABILong respectively at 1M context length.<n>It also outperforms baselines on Infinite-Bench and MM-NIAH, demonstrating flexibility across diverse tasks and domains.
  arXiv  Detail & Related papers  (2025-06-01T23:49:14Z)
• LogStamping: A blockchain-based log auditing approach for large-scale systems [1.1720477891411445]
  This paper presents a blockchain-based log management framework.<n>The framework integrates a hybrid on-chain and off-chain storage model.<n>It is designed to handle the high-volume log generation typical in large-scale systems.
  arXiv  Detail & Related papers  (2025-05-22T19:27:44Z)
• ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check [98.34702864029796]
  Recent security incidents in safety-critical industries exposed how the lack of proper message authentication enables attackers to inject malicious commands or alter system behavior.<n>These shortcomings have prompted new regulations that emphasize the pressing need to strengthen cybersecurity.<n>We introduce ACRIC, a message authentication solution to secure legacy industrial communications.
  arXiv  Detail & Related papers  (2024-11-21T18:26:05Z)
• Digital Twin-Assisted Data-Driven Optimization for Reliable Edge Caching in Wireless Networks [60.54852710216738]
  We introduce a novel digital twin-assisted optimization framework, called D-REC, to ensure reliable caching in nextG wireless networks. By incorporating reliability modules into a constrained decision process, D-REC can adaptively adjust actions, rewards, and states to comply with advantageous constraints.
  arXiv  Detail & Related papers  (2024-06-29T02:40:28Z)
• Haina Storage: A Decentralized Secure Storage Framework Based on Improved Blockchain Structure [8.876894626151797]
  Decentralized storage based on the blockchain can effectively realize secure data storage on cloud services. However, there are still some problems in the existing schemes, such as low storage capacity and low efficiency. We propose a novel decentralized storage framework, which mainly includes four aspects.
  arXiv  Detail & Related papers  (2024-04-02T02:56:27Z)
• FileDES: A Secure Scalable and Succinct Decentralized Encrypted Storage Network [30.775493810737192]
  Decentralized Storage Network (DSN) is an emerging technology that challenges traditional cloud-based storage systems. We propose FileDES, which incorporates three essential elements: privacy preservation, scalable storage proof, and batch verification. Our protocol outperforms the others in terms of proof generation/verification efficiency, storage costs, and scalability.
  arXiv  Detail & Related papers  (2024-03-22T06:41:30Z)
• 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)
• BFT-DSN: A Byzantine Fault Tolerant Decentralized Storage Network [26.618459559421442]
  Decentralized storage networks (DSNs) provide robust, decentralized storage services for decentralized applications (dApps) Existing DSNs do not offer verifiability when implementing erasure coding for redundant storage. There is a lack of Byzantine fault-tolerant consensus for optimal resilience in DSNs. This paper introduces BFT-DSN, a Byzantine fault-tolerant decentralized storage network designed to address these challenges.
  arXiv  Detail & Related papers  (2024-02-20T10:33:45Z)
• Serial Parallel Reliability Redundancy Allocation Optimization for Energy Efficient and Fault Tolerant Cloud Computing [2.61072980439312]
  Serial-parallel redundancy is a reliable way to ensure service and systems will be available in cloud computing. When an error occurs, the inactive copy can step in as a backup right away. This approach is called parallel redundancy, otherwise known as active-active redundancy.
  arXiv  Detail & Related papers  (2024-02-16T16:46:10Z)
• EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularization [71.70414291057332]
  TTA may primarily be conducted on edge devices with limited memory. Long-term adaptation often leads to catastrophic forgetting and error accumulation. We present lightweight meta networks that can adapt the frozen original networks to the target domain.
  arXiv  Detail & Related papers  (2023-03-03T13:05:30Z)
• Accelerating Transfer Learning with Near-Data Computation on Cloud Object Stores [4.774170751209782]
  We show how ML training benefits from storage pushdowns by focusing on transfer learning (TL) We propose HAPI, a new TL processing system centered around two complementary techniques that address challenges introduced by disaggregation.
  arXiv  Detail & Related papers  (2022-10-16T22:28:36Z)
• Neural Network Compression for Noisy Storage Devices [71.4102472611862]
  Conventionally, model compression and physical storage are decoupled. This approach forces the storage to treat each bit of the compressed model equally, and to dedicate the same amount of resources to each bit. We propose a radically different approach that: (i) employs analog memories to maximize the capacity of each memory cell, and (ii) jointly optimize model compression and physical storage to maximize memory utility.
  arXiv  Detail & Related papers  (2021-02-15T18:19:07Z)
• A Non-Stationary Bandit-Learning Approach to Energy-Efficient Femto-Caching with Rateless-Coded Transmission [98.47527781626161]
  We study a resource allocation problem for joint caching and transmission in small cell networks. We then formulate the problem as to select a file from the cache together with a transmission power level for every broadcast round. In contrast to the state-of-the-art research, the proposed approach is especially suitable for networks with time-variant statistical properties.
  arXiv  Detail & Related papers  (2020-04-13T09:07:17Z)
• Discrimination-aware Network Pruning for Deep Model Compression [79.44318503847136]
  Existing pruning methods either train from scratch with sparsity constraints or minimize the reconstruction error between the feature maps of the pre-trained models and the compressed ones. We propose a simple-yet-effective method called discrimination-aware channel pruning (DCP) to choose the channels that actually contribute to the discriminative power. Experiments on both image classification and face recognition demonstrate the effectiveness of our methods.
  arXiv  Detail & Related papers  (2020-01-04T07:07:41Z)

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.