
How will PeerDAS improve Ethereum's data availability?
TechFlow Selected TechFlow Selected

How will PeerDAS improve Ethereum's data availability?
To ensure efficient data management and secure validation, Ethereum evolved from DA to DAS, and ultimately introduced PeerDAS.
By 0XNATALIE
At a recent Ethereum developer meeting, the proposal to split Ethereum's Pectra hard fork into two parts was discussed. This idea had previously been rejected due to concerns it might delay the Verkle tree upgrade. However, during this latest meeting, developers revisited the concept, aiming to include more Ethereum Improvement Proposals (EIPs) in the Pectra fork. The plan is to divide the hard fork into two phases: the first would include all EIPs currently on Pectra Devnet 3, while the second phase would incorporate features such as EOF (EVM Object Format) and PeerDAS. To better understand PeerDAS, we first need to explore the foundational concept of data availability.
DA: Ensuring Nodes Can Access On-Chain Data
Data Availability (DA) refers to ensuring that blocks published by block proposers—and all transaction data within those blocks—are effectively accessible and retrievable by other network participants. DA is a critical component of blockchain security because if data is unavailable, even legitimate blocks cannot be verified by other nodes, potentially leading to consensus issues and network attacks. For example, an attacker could publish only part of a block’s data, preventing other nodes from verifying it.
When a new block is broadcast, all participating nodes download and verify its data. This model works well when the network is small, but as the blockchain grows, the volume of data increases significantly, raising storage demands and hardware requirements for each node. To enable lightweight nodes—such as those running on mobile devices like smartphones or laptops—to participate in block validation, blockchains have adopted sharding technology.
Sharding divides the entire blockchain network into smaller segments called "shards." Each shard processes only its own subset of data rather than the full chain’s data, so individual nodes only need to handle data from their assigned shard. However, since each shard handles only partial data, nodes in other shards cannot directly access the complete dataset. How then can we ensure that shard data remains available and verifiable? For instance, a node in one shard may propose a new block but only release part of its data. If other nodes cannot obtain the full block data, they cannot verify whether the block is valid and legitimate.
DAS: Verifying Full Data Availability Through Sampling
To address data availability challenges in sharded systems, Data Availability Sampling (DAS) has been introduced. Its core principle is enabling nodes to verify data availability through sampling, without requiring every node to store or download the complete block data.
With DAS, nodes randomly sample small portions of a block’s data to verify its availability. If a node successfully retrieves and verifies these random fragments, it can reasonably infer that the entire block’s data is available.
To support this sampling mechanism, block data is typically encoded using Reed-Solomon (RS) coding. This encoding allows full data reconstruction even if some portions are missing—similar to error-correcting codes. As a result, even with only partial data downloaded, a node can still infer and confirm the integrity of the entire block. By reducing the amount of data each node must process, DAS enables lightweight nodes to actively participate in block validation.
Data availability layers like Celestia implement these techniques, primarily combining RS encoding, validity proofs, and DAS:
-
RS Encoding (Reed-Solomon Encoding): This method allows nodes that receive only partial data fragments to reconstruct the full data block. It functions similarly to error correction codes, offering fault tolerance—meaning the original data can still be recovered even if some pieces are lost.
-
Validity Proof: Zero-knowledge proofs are used to ensure the data remains intact and unaltered during encoding and transmission. A successful proof guarantees the data can be correctly decoded in full.
-
DAS (Data Availability Sampling): Lightweight nodes randomly sample encoded fragments from a block and verify their availability, allowing them to statistically infer that the entire data block is available.
PeerDAS: Collaborative Data Verification Between Nodes
PeerDAS is a specific implementation of DAS that leverages peer-to-peer networks for data availability sampling. In a peer-to-peer network, multiple nodes communicate directly with one another. While traditional DAS requires each node to independently perform sampling and verification, PeerDAS optimizes this process by enabling nodes to collaboratively share and verify block data, thereby improving efficiency.
In PeerDAS, nodes are not isolated; they can share both verification tasks and results, relying on data already validated by others. This means nodes do not have to bear the full burden of verification alone. Instead, they distribute the workload cooperatively, further reducing individual resource demands. Moreover, collaborative verification raises the bar for attackers—tampering would require simultaneously compromising multiple validating nodes, making successful attacks significantly harder.
As per the latest Ethereum development updates on PeerDAS, the Lighthouse Ethereum client team has merged its DAS branch into the main codebase and is now testing compatibility with PeerDAS. Branches are typically separate code versions used for developing and testing new features. Merging into the main branch indicates that the feature is considered complete and stable enough for integration into the core system.
Join TechFlow official community to stay tuned
Telegram:https://t.me/TechFlowDaily
X (Twitter):https://x.com/TechFlowPost
X (Twitter) EN:https://x.com/BlockFlow_News














