Page 1 of 34Free preview · 1–5

About this document

This white paper presents Irys, a proposed Layer-1 datachain integrating verifiable storage, data availability, and EVM-compatible computation. It describes hybrid Proof-of-Work and Stake consensus, VDF-paced storage sampling, matrix packing for unique replicas, and a multi-ledger system for temporary and permanent storage. IrysVM enables smart contracts to access stored data through programmable data transactions. The paper also details transaction lifecycles, IRYS tokenomics, storage and execution fees, epoch-boundary processing, and a roadmap for programmable data Layer-2 networks and faster finality. The document states that its information is preliminary and subject to change.

Free preview text

The first 5 pages, shown as text so search engines and readers can find this document.

Page 1

Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation Josh Benaron, Dan MacDonald, and Jesse Cruz Wright Disclosure: The information described in this paper is preliminary and subject to change at any time. Furthermore, this paper may contain “forward-looking statements.” Nothing in this White Paper is an offer to sell, or the solicitation of an offer to buy, any tokens. Abstract This paper presents Irys, a Layer-1 Datachain that makes data programmable by unifying high-performance storage, data availability, and an EVM-compatible execution environment so smart contracts can read and act on onchain bytes at hot-access latency. A hybrid Proof-of-Work and Stake consensus ties block production to Hard Disk Drive-bound, Verifiable Delay Function-paced efficient sampling; miners perform deterministic 200 MiB sequential reads each second and are slashable, creating continual proofs of storage with low messaging overhead and fast inclusion. Matrix packing encodes a miner’s address into each 256 KiB chunk, enforcing unique replicas and closing remote-mining attack surfaces. A multi-ledger architecture supports arbitrary retention windows; data enters short-term ledgers and is promoted to permanent once ingress proofs reach threshold, decoupling fee markets and stabilizing costs. IrysVM extends the EVM with precompiles that stream chunk ranges into contracts, enabling in-protocol licensing, royalties, and verifiable AI workflows where datasets are first-class program inputs. On commodity 1 Gbps hardware, throughput scales with the number of miners and write latency is drive-limited; pricing targets at-cost HDD economics. Together these primitives provide a single chain that proves availability, ordering, and durable storage while turning data from a static payload into an executable asset. 1

Page 2

1 Introduction A datachain is an implementation of a fault-tolerant replicated data and execution machine. Current storage blockchains treat data as static payloads and make weak assumptions about data availability, verifiability, and usability within computation. Each node typically verifies data in isolation, without any unified mechanism to prove that the data exists, is actively stored, or can be acted upon deterministically by smart contracts. The absence of a verifiable data layer means that while storage can be decentralized, execution remains disconnected, preventing true onchain applications from operating on large-scale datasets. Irys introduces a verifiable data architecture designed to encode proof of storage, access, and availability directly into the consensus process. Each block not only orders transactions but also cryptographically proves that every partition of data has been sampled and remains accessible. This transforms the ledger into a programmable data substrate, where both state transitions and data proofs are verified within the same trustless environment. It is anticipated that every node in the Irys network can rely on the verifiable persistence and accessibility of data recorded onchain without external assumptions or intermediaries. 2 Outline The remainder of this paper is organized as follows. Section 3 presents the high-level architecture and vertical integration model. Section 4 defines blocks, transaction lanes, and the multi-ledger partition lifecycle. Section 5 introduces PoW/S consensus, highlighting efficient sampling and the VDF read limiter as core subsections. Section 6 describes the data transaction lifecycle. Section 7 specifies IrysVM and Programmable Data. Section 8 details tokenomics. Section 9 formalizes the fee model for term and permanent storage. Section 10 defines epoch-boundary processing. Section 11 outlines future work on programmable-data L2s and faster blocks/finality. 3 High-level architecture Irys is a fully integrated layer-1 protocol that unifies data storage and execution within a single architecture. By combining these traditionally separate layers, Irys enables users to store data directly onchain at a fraction of conventional costs while executing application logic natively on that same data. The design philosophy behind Irys centers on vertical integration: eliminating the fragmented tooling and multiple dependencies that developers currently face across disparate infrastructures. Instead of relying on a patchwork of external services for storage, compute, and verification, Irys provides a cohesive environment where every layer of the stack operates within one trustless, verifiable system. 2

Page 3

The below diagram outlines the processes within Irys that enable it to have its unique properties: Figure 1: Mining Process Irys combines high-performance data with robust verification, enabling a native execution environment for onchain data. Traditional storage protocols struggle to balance these two aspects, making it difficult to manage execution and storage in the same chain, meaning building onchain apps on datachains has been impossible to date. Irys overcomes this tradeoff by uniting Proof of Work (PoW) with staking and slashing mechanisms. This enables Irys to efficiently handle all forms of data alongside having robust security for fully onchain applications. We call this integration of secure storage and native execution in a single protocol “Programmable Data.” Figure 2: Programmable Data 3

Page 4

IrysVM enables the capability for smart contracts to directly access, compute on, and derive value from large volumes of onchain data stored within the protocol. This transforms data from a passive, static commodity into an active, composable asset class that can be queried, processed, and monetized within the execution layer itself. Through its extended EVM++ architecture and native data access primitives, IrysVM allows developers to build applications where datasets are not merely referenced but programmatically integrated into logic, enabling new classes of onchain AI, analytics, and automation that operate directly on verifiable data. 4 Blocks and transactions There are two types of transactions: Data transaction: a transaction that stores data on the network. Execution transaction: a transaction that interacts with a smart contract through IrysVM. This includes programmable data transactions. Each block contains two sets of transactions in separate block lanes. The block structure can be seen below: Field Name Description block_hash The block identifier height The block height diff Difficulty threshold used to produce the current block cumulative_diff The sum of the average number of hashes computed by the network to produce the past blocks, including this one last_diff_timestamp Timestamp (in milliseconds) since UNIX_EPOCH of the last difficulty adjustment solution_hash The solution hash for the block previous_solution_hash The solution hash of the previous block in the chain last_epoch_hash The solution hash of the last epoch block chunk_hash SHA-256 hash of the PoA chunk (unencoded) bytes previous_block_hash Previous block identifier previous_cumulative_diff The previous block's cumulative difficulty poa The recall chunk-proof 4

Page 5

Field Name Description reward_address The address that the block reward should be sent to miner_address The address of the block producer - used to validate the block hash/signature & the PoA chunk signature The block signature timestamp Timestamp (in milliseconds) since UNIX_EPOCH of when the block was discovered/produced ledgers A list of transaction ledgers, one for each active data ledger evm_block_hash The Ethereum Virtual Machine block hash vdf_limiter_info Information about the Verifiable Delay Function limiter Irys uses block lanes to ensure that users can always submit a data transaction, even when the execution lane is congested. This allows data transactions to have stable pricing. 4.1 Partition Lifecycle (Capacity & Data, Multi Ledger) Irys introduces a multi-ledger system where data can seamlessly transition between different terms. This effectively enables users to store data for any period of time (e.g., 1 day, 1 week, 1 year, or forever). There are also inbuilt mechanisms for “promoting” data to longer-term ledgers––e.g,. when a user requests to store data on the permanent ledger, it enters the 5-day ledger and transitions to the permanent ledger once it’s been verified by the network. Figure 3: Multi-Ledger System A ledger is a collection of data with a shared property (typically duration), i.e., all data in ledger 0 is stored for 5 days. 5

Tags

Doxxly editorial guide

Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation: summary, contents and background

This guide helps you understand the scope of Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation before or alongside reading the original document. It is based on the catalogue record, credited creator, source, classification and topics shown on this page. It does not replace the original work and does not invent claims about passages that Doxxly cannot verify.

Summary and overview

Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation is a 34-page documentcredited to Elias P. Kestrel. This white paper presents Irys, a proposed Layer-1 datachain integrating verifiable storage, data availability, and EVM-compatible computation. It describes hybrid Proof-of-Work and Stake consensus, VDF-paced storage sampling, matrix packing for unique replicas, and a multi-ledger system for temporary and permanent storage. IrysVM enables smart contracts to access stored data through programmable data transactions. The paper also details transaction lifecycles, IRYS tokenomics, storage and execution fees, epoch-boundary processing, and a roadmap for programmable data Layer-2 networks and faster finality. The document states that its information is preliminary and subject to change. It appears in the Technology & Security collection, which groups it with other material that readers may use for comparison and further study.

The item can be approached in several ways. A reader looking for a quick orientation can begin with the free five-page preview, inspect the page structure and use the metadata to judge relevance. Someone undertaking deeper research can work through the complete file, search its indexed text, record useful page references and compare its treatment of White paper, Irys, Layer-1 blockchain, Programmable data, Verifiable storage, Data availability, Onchain computation, IrysVM, Consensus, Tokenomics with the related resources linked below.

Rather than reducing the work to a single claim, this page treats it as a source that should be read in context. The title, creator, publication source, licence and format all help explain what kind of evidence it may offer. Readers should distinguish the original author's statements from Doxxly's catalogue description, and should cite the original edition when using the material in academic, professional or published work.

Key topics and reader takeaways

The catalogue connects this document with White paper, Irys, Layer-1 blockchain, Programmable data, Verifiable storage, Data availability, Onchain computation, IrysVM, Consensus, Tokenomics. These terms offer practical entry points rather than a substitute for close reading. Start by identifying the definitions, examples, arguments, tables or visual explanations attached to each topic. Then note where the creator draws connections, makes distinctions or moves from background material to a conclusion, recommendation, calculation or narrative development.

A useful reading method is to separate description from interpretation. First record what the item actually presents: names, headings, figures, formulas, quotations or stated propositions. Next consider why those details matter within the whole work. Finally compare them with another source from the same subject area. This process helps turn a long digital file into evidence that can be evaluated rather than merely skimmed.

Table of contents and reading guide

The following is an editorial content guide based on the verified catalogue topics. It is not represented as the original author's formal table of contents. Use it to organise notes while moving through the 34 pages in the player.

  1. Part 1

    White paper

    Use this section of the reading guide to identify how White paper appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  2. Part 2

    Irys

    Use this section of the reading guide to identify how Irys appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  3. Part 3

    Layer-1 blockchain

    Use this section of the reading guide to identify how Layer-1 blockchain appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  4. Part 4

    Programmable data

    Use this section of the reading guide to identify how Programmable data appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  5. Part 5

    Verifiable storage

    Use this section of the reading guide to identify how Verifiable storage appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  6. Part 6

    Data availability

    Use this section of the reading guide to identify how Data availability appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  7. Part 7

    Onchain computation

    Use this section of the reading guide to identify how Onchain computation appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

  8. Part 8

    IrysVM

    Use this section of the reading guide to identify how IrysVM appears in Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, note important terms, and connect the subject to the wider purpose of the work.

When a heading in the original differs from this guide, follow the original heading in your citation. Page numbers can also vary between editions. Doxxly's direct page field is useful for navigation, but formal references should include the title, creator, source and edition details available in the file itself.

About Elias P. Kestrel

Doxxly credits Elias P. Kestrel as the author or creator of Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation. This page does not add an unverified biography, job title or institutional affiliation. The attribution is preserved so readers can distinguish the creator from the hosting library and follow the original record when an external author link is available.

Author context matters because a work reflects a particular purpose, audience and point of view. Before relying on the material, consider what the creator set out to explain, when the source was produced and whether later research or revised guidance should also be consulted. For literature and philosophy, compare translations and editions; for technical material, check whether a newer version has superseded the one shown here.

About the source organisation

The recorded source for this item is irys.xyz. Doxxly provides access and discovery tools but does not claim to be the original publisher unless explicitly stated. Source links, creator attribution and the recorded Publicly available file collected for editorial review licence are displayed to help readers assess provenance and permitted use.

Provenance is especially important for reports, standards, presentations and working spreadsheets. Check the original source for amendments, supporting files and current policy. A trustworthy research workflow keeps the source URL with any notes or downloaded copy, verifies important figures against the original, and avoids treating an archived document as automatically current.

Visit irys.xyz

How to read and use this document

Begin with the title and opening pages, then use the guide above to decide whether to read sequentially or move to a particular topic. The Doxxly player provides previous and next navigation, a direct page field, zoom steps, fit-to-width and fit-to-page modes, rotation and fullscreen. These controls are useful when a page contains small type, a wide table, an image, a scanned layout or a dense sequence of notes.

The first five pages are open to every visitor. A plan unlocks the complete item and full-document search. Search is best used for distinctive names, technical terms or short phrases; broad words can produce too many possible contexts. When you find a useful passage, read the surrounding pages so that a sentence, chart or formula is not separated from its explanation.

If downloading is enabled, members can obtain the original PDF file. Keep the original format when formulas, slide sequencing, pagination or layout carries meaning. Respect the Publicly available file collected for editorial review terms displayed on this page, and use the rights-report link if you believe the attribution or availability needs review.

Research questions to consider

As you read Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation, ask which audience the creator addresses, what problem or idea organises the work, what evidence is presented, and which assumptions remain unstated. Note whether important terms are defined consistently and whether examples represent a broader pattern or a narrow case. For quantitative material, record units, time periods, formulas and data sources. For interpretive material, separate the creator's language from your own summary.

A second set of questions concerns relevance today. Which parts remain durable, which depend on their historical or institutional setting, and what would need confirmation from a newer source? Following the tags and the Technology & Security collection can reveal useful comparisons. Agreement between sources can strengthen confidence, while disagreement can point to changing definitions, methods, evidence or priorities.

Finally, decide what you need from the item: background knowledge, a quotation, a worked example, a model, a visual explanation or a starting bibliography. That purpose should guide the depth of reading and the notes you keep. Doxxly helps locate and navigate the source; careful interpretation remains the reader's responsibility.

Explore more Technology & Security resources

Frequently asked questions about Irys: A Programmable Datachain for Verifiable Storage and Onchain Computation

Practical answers about reading, downloading and understanding this document on Doxxly.

More in Technology & Security