Data availability sampling in practice - HackMD
notes.ethereum.org · 1,026 words · saved by 1 readers
# Data availability sampling in practice If we want to move beyond relying on committee assumptions
Data availability sampling in practice - HackMD # Data availability sampling in practice If we want to move beyond relying on committee assumptions in eth2, we need to have a robust infrastructure for data availability sampling. This post attempts to discuss what this would look like in the eth2 context in practice. For simplicity, we will assume a fraud-proof-free data availability sampling technique - either Kate commitments or Merkle proofs with a SNARKed Merkle root. Kate commitments are likely significantly more efficient. ### Recap: how does data availability sampling work? _Note: actual
related reading
- Data availability sampling and danksharding: An overview and a proposal for improvements - a16z cryptoa16zcrypto.com
- The Hitchhiker's Guide to Ethereum - Delphi Digitalmembers.delphidigital.io
- Data Availability Sampling: From Basics to Open Problemsparadigm.xyz
- Possible futures of the Ethereum protocol, part 2: The Surgevitalik.eth.limo
- Faster block/blob propagation in Ethereum - Networking - Ethereum Researchethresear.ch
- EIP-4844: Shard Blob Transactionseips.ethereum.org
- Data availability | ethereum.orgethereum.org
- Collaborative zkSNARKseprint.iacr.org
- Proto-Danksharding FAQ - HackMDnotes.ethereum.org
- What Is Data Availability?coinmarketcap.com
- Shared Sequencing: Defragmenting the L2 Rollup Ecosystem - HackMDhackmd.io
- [1809.09044] Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majoritiesarxiv.org