[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-315935-105":59,"doc-detail-315935-en":131},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":124,"head_meta":126,"extra_data":128,"updated_unix":130},105,"en","vault-decentralized-storage-made-durable","Vault - Decentralized Storage Made Durable","","Decentralized storage networks rely on permissionless nodes, so data availability must hold even under storage-device failures and adversarial Byzantine behavior. Byzantine nodes can collude within placement-group membership, cluster around selected blocks, and simultaneously discard data, weakening failure tolerance and reward incentives for honest nodes. This work proposes a global Byzantine defense using a node-centric incentive model that keeps rational incentives stable across placement groups. Building on it, Vault combines sampling-based placement with verifiable randomness and verifiable rateless erasure coding for scalable availability and fault tolerance.",{"@graph":69,"@context":123},[70,84,106],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/vault-decentralized-storage-made-durable/315935/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/vault-decentralized-storage-made-durable/315935.png","ImageObject",300,407,{"name":92,"@type":93},"eBook King","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-29","2026-09-20",true,{"@type":102,"interactionType":103,"userInteractionCount":105},"InteractionCounter",{"@type":104},"ViewAction",12,{"@type":107,"mainEntity":108},"FAQPage",[109,115,119],{"name":110,"@type":111,"acceptedAnswer":112},"What problem does Vault address in decentralized storage networks?","Question",{"text":113,"@type":114},"Vault targets the availability threats caused by Byzantine nodes, especially when attackers collude within placement groups and adaptively attack data availability.","Answer",{"name":116,"@type":111,"acceptedAnswer":117},"Why do previous data-centric incentive models struggle with Byzantine tolerance and scalability?",{"text":118,"@type":114},"Data-centric models reward per data block, requiring large group sizes to tolerate Byzantine power, which conflicts with storage scalability; small groups let Byzantine nodes concentrate and compromise selected blocks.",{"name":120,"@type":111,"acceptedAnswer":121},"How does Vault’s node-centric approach improve resilience to Byzantine clustering?",{"text":122,"@type":114},"Vault rewards nodes equally for their storage contributions regardless of placement groups, so Byzantine clustering in a group does not dilute honest nodes’ rewards, helping preserve honest participation and availability.","https://schema.org",{"og:url":83,"og:type":125,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":127,"canonical":83},"index,follow",{"doc_id":129,"site_id":62},315935,1790464991,{"code":4,"msg":5,"data":132},{"doc_id":129,"user_id":133,"nickname":92,"user_avatar":134,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":135,"file_id":136,"file_url":137,"file_type":138,"file_size":139,"view_count":105,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":140,"language":141,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":142,"faqs":143,"seo_title":144,"seo_description":67,"update_tm":145,"read_time":36,"preview_page_count":4},962088006270,"https://ap-avatar.wpscdn.com/davatar_085a072bc5b1113ac321206ff7593b45","Vault: Decentralized Storage Made Durable  \nGuangda Sun National University of Singapore  \n[sung@comp.nus.edu.sg](sung@comp.nus.edu.sg)  \nJialin Li  \nNational University of Singapore lij[l@comp.nus.edu.sg](l@comp.nus.edu.sg)  \narXiv :2310 .08403v2 [ cs .DC] 6 Apr 2026  \nAbstract  \nDecentralized storage networks (DSNs) are storage systems powered by permissionless nodes. Data placement in DSNs must tolerate not only storage-device failures but also adversarial behavior that targets data availability. Byzantine nodes introduce unique challenges due to collusion and adaptive attacks. They can target specific data blocks by clustering within a block’s placement group, reducing the number of rational nodes and weakening failure tolerance. In this work, we propose a global defense against Byzantine nodes across all placement groups. We introduce a node-centric approach that guarantees stable incentives for rational nodes regardless of the number of Byzantine nodes in their placement groups. Building on this approach, we design Vault, a DSN that uses sampling-based data placement with verifiable randomness. Compared with prior DSNs, this placement strategy allows Vault to scale simultaneously in storage volume, on-chain footprint, and Byzantine tolerance. Our preliminary results show that Vault achieves the desired availability with scalable storage overhead while maintaining scalable fault tolerance.  \n1 Introduction  \nDecentralized storage networks (DSNs) [12, 22, 23, 25, 36, 41, 46, 51, 55] provide reliable, long-term data storage without trusting any single participant. They are increasingly deployed in production: 60% of decentralized applications use the IPFS/Filecoin [41] stack for off-chain storage [44], Arweave [55] archives ledger data for Solana, Avalanche, and other chains [15, 40], and the top DSNs collectively host over an Exabyte of data [7] . Unlike centralized storage, DSNs rely on permissionless nodes that join and leave freely, and use blockchains for governance and coordination in place of trusted operators.  \nIdeally, a DSN should achieve three properties: data availability despite Byzantine participants, storage scalability that grows linearly with participants, and blockchain efficiency with small, constant on-chain state per data block. Achieving all three properties, however, is challenging due to Byzantine behaviors. As in traditional distributed storage, each data block in a DSN is stored  \nredundantly on a placement group of nodes. However, irrational Byzantine nodes can ignore incentives [3], collude within a placement group, and discard stored data simultaneously [49, 52] . Data availability therefore depends on sufficient honest nodes in each group, yet it is well-known that Byzantine nodes cannot be reliably identified. A second challenge is erasure coding integrity. Assigning unique encoded fragments to nodes normally requires coordination, but in a decentralized setting, such coordination demands costly BFT consensus, anda single Byzantine node can poison data read and repair. We review prior DSN designs in §2.2 and conclude that they all fall short of at least one of the three properties (table 1) .  \nWe trace the root cause to the data-centric approach in prior systems. Existing DSNs form and incentivize each placement group independently, tying rewards to individual data blocks. To tolerate N~~3~~ Byzantine nodes, each group needs more than N~~3~~ members, which contradicts storage scalability. In practice, groups are kept small, allowing Byzantine nodes to concentrate and compromise selected groups. When they do, honest nodes in those groups receive diluted rewards and may leave, further weakening availability.  \nOur key insight is that provisioning every group against worst-case Byzantine power is sufficient but not necessary. We propose a novel node-centric approach: instead of allocating incentives per data block, we reward each node equally for its storage contributions, regardless of which gr","cbCaijRHk7KKkzxG","https://ap.wps.com/l/cbCaijRHk7KKkzxG","pdf",921110,16,"English","# Introduction\n## Decentralized storage networks and their design goals\n## Challenges from Byzantine behavior and erasure coding integrity\n## Root cause in data-centric incentive models\n## Node-centric defense and reward decoupling\n## Vault design: VRF-based sampling and verifiable rateless erasure coding\n## Prototype, simulation, and deployment evaluation","[{\"question\":\"What problem does Vault address in decentralized storage networks?\",\"answer\":\"Vault targets the availability threats caused by Byzantine nodes, especially when attackers collude within placement groups and adaptively attack data availability.\"},{\"question\":\"Why do previous data-centric incentive models struggle with Byzantine tolerance and scalability?\",\"answer\":\"Data-centric models reward per data block, requiring large group sizes to tolerate Byzantine power, which conflicts with storage scalability; small groups let Byzantine nodes concentrate and compromise selected blocks.\"},{\"question\":\"How does Vault’s node-centric approach improve resilience to Byzantine clustering?\",\"answer\":\"Vault rewards nodes equally for their storage contributions regardless of placement groups, so Byzantine clustering in a group does not dilute honest nodes’ rewards, helping preserve honest participation and availability.\"}]","Vault - Decentralized Storage Made Durable | PDF",1789908253]