Whitepapers
Official Celestia technical documents and research papers, fully indexed and searchable.
WP-01 · RESEARCH
LazyLedger: A Distributed Data Availability Ledger With Client-Side Smart Contracts
We propose LazyLedger, a design for distributed ledgers where the blockchain is optimised for solely ordering and guaranteeing the availability of transaction data. Responsibility for executing and validating transactions is shifted to only the clients that have an interest in specific transactions relating to blockchain applications that they use. As the core function of the consensus system of a
PDFFull text ↗
WP-02 · RESEARCH
Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities
Light clients, also known as Simple Payment Verification (SPV) clients, are nodes which only download a small portion of the data in a blockchain, and use indirect means to verify that a given chain is valid. Typically, instead of validating block data, they assume that the chain favoured by the blockchain's consensus algorithm only contains valid blocks, and that the majority of block producers a
PDFFull text ↗
WP-03 · RESEARCH
Accountable Safety for Rollups
Accountability, the ability to provably identify protocol violators, gained prominence as the main economic argument for the security of proof-of-stake (PoS) protocols. Rollups, the most popular scaling solution for blockchains, typically use PoS protocols as their parent chain. We define accountability for rollups, and present an attack that shows the absence of accountability on existing designs
PDFFull text ↗
WP-04 · RESEARCH
Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
Data Availability Sampling (DAS), a central component of Ethereum's roadmap, enables clients to verify data availability without requiring any single client to download the entire dataset. DAS operates by having clients randomly retrieve individual symbols of erasure-encoded data from a peer-to-peer network. While the cryptographic and encoding aspects of DAS have recently undergone formal analysi
PDFFull text ↗
WP-05 · RESEARCH
Efficient Data Availability Sampling via Coded Distributed Arrays
Data availability is a fundamental bottleneck in modern blockchain networks. Most blockchain systems rely on a full-replication model, which requires downloading of a full block to verify its availability. This model does not scale with block size because every node must handle large volumes of data, leading to slower block propagation, duplicated data transfer, and longer consensus agreement. Thi
PDFFull text ↗
WP-06 · RESEARCH
Data Availability Sampling in Ethereum: Analysis of P2P Networking Requirements
Despite their increasing popularity, blockchains still suffer from severe scalability limitations. Recently, Ethereum proposed a novel approach to block validation based on Data Availability Sampling (DAS), that has the potential to improve its transaction per second rate by more than two orders of magnitude. DAS should also significantly reduce per-transaction validation costs. At the same time,
PDFFull text ↗
WP-07 · RESEARCH
Polynomial Multiproofs for Scalable Data Availability Sampling in Blockchain Light Clients
Light clients are essential for scalable blockchain systems because they verify data availability without downloading full blocks. In data availability sampling based systems, sampled cells are retrieved from a peer-to-peer network and verified against cryptographic commitments. A common deployment pattern associates each sampled cell with an independent Kate-Zaverucha-Goldberg (KZG) proof, creati
PDFFull text ↗
WP-08 · RESEARCH
Scalability limitations of Kademlia DHTs when enabling Data Availability Sampling in Ethereum
Scalability in blockchain remains a significant challenge, especially when prioritizing decentralization and security. The Ethereum community has proposed comprehensive data-sharding techniques to overcome storage, computational, and network processing limitations. In this context, the propagation and availability of large blocks become the subject of research to achieve scalable data-sharding. Th
PDFFull text ↗
WP-09 · RESEARCH
From Indexing to Coding: A New Paradigm for Data Availability Sampling
The data availability problem is a central challenge in blockchain systems and lies at the core of the accessibility and scalability issues faced by platforms such as Ethereum. Modern solutions employ several approaches, with data availability sampling (DAS) being the most self-sufficient and minimalistic in its security assumptions. Existing DAS methods typically form cryptographic commitments on
PDFFull text ↗
WP-10 · RESEARCH
On the Design of Ethereum Data Availability Sampling: A Comprehensive Simulation Study
This paper presents an in-depth exploration of Data Availability Sampling (DAS) and sharding mechanisms within decentralized systems through simulation-based analysis. DAS, a pivotal concept in blockchain technology and decentralized networks, is thoroughly examined to unravel its intricacies and assess its impact on system performance. Through the development of a simulator tailored explicitly fo
PDFFull text ↗
WP-11 · RESEARCH
PANDAS: Peer-to-peer, Adaptive Networking for Data Availability Sampling within Ethereum Consensus Timebounds
Layer-2 protocols can assist Ethereum's limited throughput, but globally broadcasting layer-2 data limits their scalability. The Danksharding evolution of Ethereum aims to support the selective distribution of layer-2 data, whose availability in the network is verified using randomized data availability sampling (DAS). Integrating DAS into Ethereum's consensus process is challenging, as pieces of
PDFFull text ↗
WP-12 · RESEARCH
Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
Popular blockchains today have hundreds of thousands of nodes and need to be able to support sophisticated scaling solutions$\unicode{x2013}$such as sharding, data availability sampling, and layer-2 methods. Designing secure and efficient peer-to-peer (p2p) networking protocols at these scales to support the tight demands of the upper layer crypto-economic primitives is a highly non-trivial endeav
PDFFull text ↗
WP-13 · RESEARCH
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roadmap. This motivates us to consider subcodes of such codes with the goal of obtaining a larger minimum distance. In this paper, we present explicit constructions of subcodes of Reed--Solomon product c
PDFFull text ↗
WP-14 · RESEARCH
Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
This whitepaper seeks to elucidate implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem, the core of modern blockchain cryptography. We demonstrate that Shor's algorithm for this problem can execute with either <
PDFFull text ↗
WP-15 · RESEARCH
Secure AltDA Integration for Ethereum L2s: An End-to-End Validation Framework
Alternative data availability (AltDA) systems provide Ethereum L2s with an external data publication layer for high throughput rollup designs. By moving bulk data publication outside of Ethereum, AltDA allows L2s to process more data than native DA. However, this replacement introduces a new consensus critical integration layer. Existing ecosystem frameworks identify high level risks, such as exte
PDFFull text ↗
WP-16 · RESEARCH
Data Availability and Decentralization: New Techniques for zk-Rollups in Layer 2 Blockchain Networks
The scalability limitations of public blockchains have hindered their widespread adoption in real-world applications. While the Ethereum community is pushing forward in zk-rollup (zero-knowledge rollup) solutions, such as introducing the ``blob transaction'' in EIP-4844, Layer 2 networks encounter a data availability problem: storing transactions completely off-chain poses a risk of data loss, par
PDFFull text ↗
WP-17 · RESEARCH
A Secure Sequencer and Data Availability Committee for Rollups (Extended Version)
Blockchains face a scalability limitation, partly due to the throughput limitations of consensus protocols, especially when aiming to obtain a high degree of decentralization. Layer 2 Rollups (L2s) are a faster alternative to conventional blockchains. L2s perform most computations offchain using minimally blockchains (L1) under-the-hood to guarantee correctness. A sequencer is a service that recei
PDFFull text ↗
WP-18 · RESEARCH
A Decentralized Sequencer and Data Availability Committee for Rollups Using Set Consensus
Blockchains face a scalability challenge due to the intrinsic throughput limitations of consensus protocols and the limitation in block sizes due to decentralization. An alternative to improve the number of transactions per second is to use Layer 2 (L2) rollups. L2s perform most computations offchain using blockchains (L1) minimally under-the-hood to guarantee correctness. A sequencer receives off
PDFFull text ↗
WP-19 · RESEARCH
Foundations of Data Availability Sampling
Formal cryptographic definitions and foundations for Data Availability Sampling (DAS).
PDFFull text ↗
WP-20 · RESEARCH
FRIDA: Data Availability Sampling from FRI
A DAS construction from the FRI proximity test (CRYPTO 2024).
PDFFull text ↗
WP-21 · RESEARCH
ZODA: Zero-Overhead Data Availability
Celestia's zero-overhead data availability construction.
PDFFull text ↗
WP-22 · RESEARCH
The Accidental Computer: Polynomial Commitments from Data Availability
Polynomial commitments derived from data availability (ZODA follow-up).
PDFFull text ↗
WP-23 · RESEARCH
Extending FRIDA Beyond Unique Decoding for Free
Improvements to FRIDA-based data availability sampling.
PDFFull text ↗
WP-24 · RESEARCH
Proving the Security of PeerDAS without the AGM
Security analysis of PeerDAS without the algebraic group model.
PDFFull text ↗