This page is an educational summary of an official technical paper. It is not a verbatim reproduction, and CryptoGloss does not claim authorship of the original work.
| Paper title | Arweave: A Protocol for Economically Sustainable Information Permanence (Draft 1) |
| Authors | Sam Williams, Viktor Diordiiev, Lev Berman, India Raybould, and Ivan Uemlianin |
| Year | 2019 |
| Project | Arweave |
| License | Not stated in the paper |
| Official source | Read the original 2019 paper (PDF) |
The page title uses the familiar name “The Arweave Yellow Paper.” The document’s printed title is Arweave: A Protocol for Economically Sustainable Information Permanence. It is a 2019 Draft 1 design paper, not a current implementation manual. Its central question is how a network might reward miners to keep historical data available over long periods. The paper’s own contents cover the blockweave and Proof of Access, a storage endowment, node behavior, content policies, network incentives, and the permaweb. The source PDF lists the five authors and the paper’s full section map.
Blockweave and Proof of Access
In the paper’s blockweave, each new block refers to the previous block and to an earlier “recall block” selected from the weave’s history. Under the original Proof of Access (PoA) design, a miner needs access to the selected recall block as part of producing a valid block. That links mining chances to access to older data and is intended to encourage storage and replication. It does not mean that every miner must hold every byte, or that any particular gateway will serve every item on demand. The paper describes a probabilistic incentive system rather than a fixed replication guarantee for each file.
The paper also describes blockshadows and Wildfire, which address how block information and data move between network participants. These mechanisms belong to the 2019 design described in the paper; they should not be collapsed into a claim that every node stores a complete copy or that retrieval speed is guaranteed.
What the Storage Endowment Does
The paper models storage cost as a stream of future costs and argues that a finite upfront payment could fund long-term storage if the cost of storing data continues to fall. In its transaction model, part of the payment rewards a miner immediately, while most of the modeled storage contribution goes into an endowment that may support mining rewards over time. The endowment is used under the paper’s reward rules when other rewards do not cover the modeled cost of maintaining the weave. Sections 3.2 and 3.2.6 of the paper explain the cost assumptions and the endowment mechanism.
This is an economic design, not proof that storage is guaranteed forever. The paper’s projections rely on estimates of future storage costs and assumptions about the value of rewards. If costs, token value, miner participation, or demand develop differently from those assumptions, the incentives can be stressed. The earlier page wording that treated the endowment as AR held in a conventional protocol-level contract, or implied that AR must continually appreciate, was too simple for the mechanism in the paper.
Content Policies, Gateways, and the Permaweb
The paper uses “permaweb” for a web-like layer built over Arweave data, including sites and applications that can be opened through HTTP-compatible gateways. It also explicitly gives nodes and gateways content policies: operators may decline to store, index, or show material under their own rules. A transaction ID is a stable reference to submitted data, but a URL served through one gateway is not a promise that the gateway will always respond or index that item.
Current developer documentation makes another distinction: miners are rewarded for storage, not bandwidth, and the uploader or client is responsible for initially spreading new data until it is replicated as intended. Gateways and other services provide much of the high-bandwidth delivery. This separates the data-storage incentive from the access layer people use to retrieve it. Arweave’s developer documentation describes the roles of miners, gateways, and data seeding.
How the Protocol Changed After the Paper
The 2019 paper describes original PoA, but the live network later changed its mining design. The Arweave Project reported that the first Succinct Proofs of Random Access (SPoRA) block was mined on February 24, 2021, at height 633720. Its announcement presents SPoRA as a change intended to connect mining more closely to fast data access and replication. That is a later protocol milestone, not a feature to attribute to the 2019 Draft 1 paper.
There are later papers too. The distinct Arweave Lightpaper, Draft 17, dated December 2023, describes a more evolved protocol snapshot. Current developer docs also describe Arweave 2.9’s replica.2.9 packing format and RandomX. Packing is a miner-side storage format and operational process; it is separate from the paper’s original PoA consensus description. The current syncing and packing guide explains that distinction in practical terms.
Guide to the Paper’s Sections
| Section | Main subject |
|---|---|
| 1. Introduction | Motivation and the storage problem |
| 2. Arweave: Key Contributions | Blockweave, PoA, blockshadows, content policies, and Wildfire |
| 3. The Network: Mechanism Design | Rewards, storage costs, and the endowment |
| 4. The Node: Behaviours for Protocol Compliance | Mining, validation, requests, and fork recovery |
| 5. Decentralised Content Policies | Node and gateway storage and display policies |
| 6. Adaptive Mechanism Design in Arweave | The AIIA incentive model |
| 7. Interoperability and the Permaweb | HTTP access, gateways, and application architectures |
| 8. Future Work | Proposals including succinct proofs of access |
| 9. Conclusion | Summary of the proposed protocol |
| 10. Appendices | Data structures and supporting material |
What the Paper Can and Cannot Establish
The paper is useful for understanding the original system proposal and its economic reasoning. It is not evidence that every file is held by every node, that a chosen gateway or application will keep serving data, or that a storage-cost forecast will hold indefinitely. The authors explicitly distinguish “data permanence” from “network permanence”: they did not expect the network in its then-current form to produce blocks forever, and discussed the possibility that data could later be carried into another preservation system. Important records should therefore be assessed in terms of the network’s incentives, independent replicas, client seeding, and available access services—not by treating “permanent” as an unconditional service-level promise.
Social Media Sentiment
A single r/Arweave discussion from August 2026 showed mixed views about the endowment model and rising storage costs. Some commenters worried that sustained cost increases could strain the model’s assumptions; others viewed the price changes as cyclical and expected storage demand and miner incentives to continue. This is a small community discussion, not a representative survey, a technical measurement, or investment guidance.
Last updated: 2026-10
Related Terms
See Also
- Filecoin: A Decentralized Storage Network
- IPFS: Content-Addressed, Versioned, Peer-to-Peer File System
- Bitcoin: A Peer-to-Peer Electronic Cash System
References
- Williams, S., Diordiiev, V., Berman, L., Raybould, I., and Uemlianin, I. (2019). Arweave: A Protocol for Economically Sustainable Information Permanence, Draft 1. Official paper PDF. Primary source for the 2019 blockweave, PoA, incentive design, content policies, and paper section map.
- The Arweave Project (2021). The Arweave Network is Now Running Succinct Random Proofs of Access (SPoRA). Official network upgrade announcement. Records the first SPoRA block and its stated goals.
- Williams, S., Kedia, A., Berman, L., and Campos-Groth, S. (2023). Arweave: The Permanent Information Storage Protocol, Lightpaper Draft 17. Official lightpaper PDF. A separate, later protocol document—not the 2019 Yellow Paper.
- Arweave Developers. Development Motivation. Official developer documentation. Explains storage incentives, data seeding, and gateway roles.
- Arweave Developers. Syncing and Packing. Official mining documentation. Describes current packing formats, including Arweave 2.9.
- r/Arweave contributors (August 2026). “Is Arweave dying?” One time-bounded community thread used only for the limited sentiment summary above.