Crypto Gloss

Data Availability

Data availability (DA) is the property of a blockchain system that guarantees all data referenced in a block header has been published and is downloadable by any network participant. While it sounds simple, data availability is one of the deepest problems in blockchain scaling: a block producer can publish a valid block header without publishing the underlying transaction data, and unless full nodes can verify data availability, clients cannot check whether the chain is behaving correctly. DA is the binding constraint on rollup scalability and the specialized function that dedicated DA layers like Celestia, EigenDA, and Avail are designed to optimize.

The Data Availability Problem

Why it matters:

A blockchain has two guarantees: validity (transactions follow the rules) and availability (all transaction data is published). Without availability:

  • Light clients cannot verify anything — they rely on full nodes to have seen the data
  • Fraud proofs in optimistic rollups become impossible — a prover needs the data to construct a fraud proof
  • A malicious block producer could hide data while publishing valid-looking block headers

Concrete attack:

  1. A block producer creates a block with valid format (correct header, valid proof of work/stake)
  2. But includes transactions that drain user balances incorrectly, or withholds the data proving legitimate transactions
  3. The producer publishes the header but not the transaction data
  4. Full nodes try to download the data — no one has it
  5. The header looks valid; light clients accept it
  6. Fraud proofs cannot be constructed — no one has the data needed

This is called a data withholding attack and was a critical unsolved problem in L1 and rollup design until data availability sampling.

Data Availability Sampling (DAS)

The cryptographic solution pioneered by Mustafa Al-Bassam, Vitalik Buterin, and others:

Erasure coding:

Block data is expanded to 2x or 4x its original size using erasure codes. Any 50% of the expanded data can reconstruct the full original block.

Random sampling:

Light nodes randomly request small portions of the expanded block data:

  • If all samples return successfully with low probability of coincidence, the block is likely available
  • With k samples, probability of missing an unavailable block is (1-0.5)^k — astronomically low at k=30
  • Hundreds of light nodes sampling in parallel provide stronger guarantees than any single full node downloading everything

Result: Light clients with limited bandwidth can probabilistically verify DA without downloading full blocks. The network scales: more light nodes = stronger DA security.

DA in Optimistic Rollups

Optimistic rollups (Arbitrum, Optimism, Base) depend critically on DA:

The connection:

  1. Sequencer posts a batch of rollup transactions to Ethereum (or an alt-DA layer)
  2. The data contains all transaction details
  3. Anyone can download this data and replay the transactions to compute the correct state
  4. If the sequencer posts a wrong state root, a fraud prover downloads the data and constructs a fraud proof
  5. The fraud proof is submitted to Ethereum; the incorrect state is reverted

If DA fails: If the rollup data is not available, no fraud prover can construct the challenge. Optimistic rollups would be insecure. This is why Ethereum blobs (EIP-4844) guarantee that blob data is available for at least 4096 epochs (~18 days) — more than enough for the challenge period.

DA in ZK Rollups

ZK rollups (zkSync, Starknet, Polygon zkEVM) use validity proofs that don’t require transaction data for security — the proof itself guarantees correct state. However, DA is still needed:

  • Users need to reconstruct their state (balances, positions) from transaction data
  • Without DA, users cannot exit (prove their balances) even if the chain is technically valid
  • “Validium” (data stored off-chain) sacrifices DA for cheaper cost; users accept counterparty risk on the DA provider

Ethereum’s DA Solutions

Pre-EIP-4844 (before March 2024):

Rollups posted data as calldata in Ethereum transactions:

  • Expensive: ~16 gas per byte; full Ethereum blockspace competition
  • Rollup transaction costs: $0.05-0.50 per transaction depending on network congestion

EIP-4844 — Blob Transactions (March 2024, Dencun upgrade):

  • Introduced “blobs” — large data attachments to Ethereum blocks
  • Separate fee market from calldata (blobs have their own gas)
  • Data pruned after ~18 days (enough for fraud proof challenges)
  • Result: 90%+ reduction in rollup DA costs; Base/Optimism fees dropped below $0.01

Future — Full Danksharding:

  • Massive expansion of blob capacity per block (from 3-6 blobs/block to 64+ blobs/block)
  • Implements full 2D-DAS so light clients can verify DA
  • Timeline: Several years post-Dencun; requires further Ethereum upgrades

Alt-DA Layers

Celestia:

  • First dedicated DA layer; uses 2D-DAS and Namespaced Merkle Trees
  • Cheapest DA costs (~$0.0001/tx equivalent)
  • Used by: Manta Pacific, Arbitrum Orbit chains, Eclipse, others

EigenDA:

  • Built by EigenLayer; uses restaked Ethereum ETH as security for DA
  • Operators from EigenLayer’s restaking network serve as DA nodes
  • Integrated with Arbitrum Orbit for alt-DA chains

Avail:

  • Polygon-incubated, now independent
  • Uses KZG commitments and DAS
  • Targets Polygon SDK appchains as primary customers

Comparison:

DA Layer Security Model Cost Maturity
Ethereum blobs Full Ethereum PoS Low (post-4844) Production
Celestia Celestia TIA stakers (~$3B) Very low Production
EigenDA Restaked ETH security Low Production (2024)
Avail Native AVAIL stakers Very low Mainnet 2024

Related Terms

Sources

Al-Bassam, M., Sonnino, A., & Buterin, V. (2018). Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities. arXiv:1809.09044.

Ethereum Foundation. (2024). EIP-4844: Shard Blob Transactions. Ethereum EIP Repository.

Feist, D., Buterin, V., & Al-Bassam, M. (2022). Danksharding. Ethereum Research.

Thibault, L. T., Bhatt, T., & Bhatt, A. (2022). Blockchain Scaling Using Rollups: A Comprehensive Survey. IEEE Access.

Boneh, D., Drake, J., Fisch, B., & Gabizon, A. (2019). Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint.