Bankless
Bankless

119 - Dive into Danksharding | Vitalik, Dankrad, Protolambda, Moderated by Tim Beiko

This might be the dankest livestream we’ve done to date. Vitalik Buterin, Dankrad Feist, and Protolambda join Tim Beiko to discuss all things Danksharding and Proto-Danksharding. Sharding what? Don't worry. By the end of this conversation, you’ll know how sharding has evolved over time, why dan

Topics Discussed

Episode Summary

Executive Summary: This panel breaks down Ethereum's sharding roadmap, explaining how it evolved from complex full-execution sharding concepts to a simpler rollup-centric model focused on cheap data availability for L2s. The speakers distinguish full dank sharding from proto-dank sharding (EIP-4844), explain data availability sampling, KZG commitments, and trusted setup trade-offs, and outline the research and engineering steps needed to scale Ethereum while preserving decentralization.

Main Topics: Ethereum’s sharding roadmap simplification (Priority: 5/5): Vitalik traces the evolution from early, highly complex shard designs (cross-shard execution, hypercubes, shards on shards) to a pragmatic model centered on data availability rather than execution on shards. Dank sharding vs. proto-dank sharding (EIP-4844) (Priority: 5/5): The panel explains that EIP-4844 is the first step toward full dank sharding: it introduces cheaper blob data for rollups without requiring the full sharded data network or sampling infrastructure. Data availability and rollup security (Priority: 5/5): The speakers define data availability as Ethereum providing consensus that data was published and downloadable for a period of time, which lets rollups recover, verify state, and remain secure if operators fail or censor users. Data availability sampling and Reed-Solomon coding (Priority: 4/5): Dankrad explains how sampling works statistically only after data is encoded so that any large-enough fraction can reconstruct the whole, making it feasible to verify availability without downloading everything. KZG commitments and trusted setup (Priority: 4/5): The panel discusses why KZG commitments are used to bind the encoded data, what a trusted setup assumes, and how multi-party ceremonies reduce trust by requiring only one honest participant. MEV, proposer-builder separation, and decentralization (Priority: 4/5): Dankrad argues that block-building has become a specialized industry due to MEV, making proposer-builder separation a natural fit that also enables handling large data volumes without sacrificing decentralization. Research, engineering, and deployment path (Priority: 4/5): The discussion closes with practical next steps: client implementations, networking for sampling, PBS integration, better light clients, history retention systems, and eventual mainnet rollout through hard forks and the all-core-devs process.

Key Arguments: Sharding’s goal is not to make L1 execution cheaper, but to create a cheap data layer for rollups, which in turn lowers end-user fees on L2s. Ethereum’s roadmap intentionally simplified over time because execution sharding was too complex to implement safely and reliably. Proto-dank sharding (EIP-4844) captures much of the near-term benefit by adding blob data for rollups while avoiding the hardest parts of full sharding. Data availability is a consensus guarantee that data was published and available to be downloaded for a window of time, which is crucial for rollup recovery and censorship resistance. Data availability sampling is scalable only when combined with erasure coding (Reed-Solomon), allowing nodes to sample a small subset and still probabilistically detect withheld data. KZG commitments provide cryptographic binding to the encoded data so samplers know the data is uniquely encoded and not arbitrary garbage. The trusted setup risk is mitigated by multi-party ceremonies: if even one participant acts honestly and deletes secrets, the setup remains secure. MEV makes proposer-builder separation practically necessary, because building blocks has become specialized, while proposing can remain simple and decentralized. A full sharding system can support much more throughput because data burden is distributed across many nodes rather than every node bearing all of it. The Ethereum ecosystem still has major open problems in networking, history retention, and L2 decentralization that need contributors now.

Data Points: EIP: 4844 - Identified as proto-dank sharding, the stepping-stone EIP toward full dank sharding Retained data window: around 30 days to a couple of months - Vitalik described the intended period during which blob data is kept available before pruning Current calldata size: about 50–100 kilobytes per block - Proto explained this as the current rough order of magnitude for Ethereum blocks using calldata Blob data target with proto-dank sharding: about 1 megabyte per block - Estimated near-term throughput increase from EIP-4844 blob space Full dank sharding scaling factor: another order of magnitude larger - Proto said full sharding can increase capacity further by distributing storage across many nodes Sharding distribution assumption: 64 nodes - Proto referenced distributing data across 64 nodes in the full sharding model Sampling example: 30 samples - Dankrad used 30 random samples to illustrate how withheld data can be detected with very low probability Failure probability example: 2^-30 - Dankrad gave this as the probability of missing withheld data in the sample example Trusted setup participation: thousands of participants - Dankrad described the ceremony as potentially involving thousands of contributors Collusion threshold: n-1 - If one participant in the trusted setup behaves honestly, the setup remains secure Validator set size reference: tens of thousands - Dankrad contrasted future PoS validator scale with the current small number of mining pools

Pivotal Quotes: "What a roll-up does is it converts scalable data and non-scalable computation into a scalable computation." — Vitalik: Explaining why data sharding matters more than execution sharding in the rollup-centric roadmap "We are not throwing more data at the exclusion layer, but rather we continue to scale the consensus layer." — Proto: Describing how EIP-4844 sidesteps full sharding while still increasing usable data throughput "Stay optimistic, but in the long term, hopefully, stay zero-knowledge." — Vitalik: Closing remark encouraging builder participation and long-term ZK-oriented scaling

Implications: For users, this roadmap should lower L2 transaction fees and improve rollup scalability. For Ethereum, it shifts complexity toward data availability, networking, and PBS while keeping L1 execution simpler. The next wave of work is infrastructure-heavy and highly relevant for builders.

🔓 Sign Up for Unlimited Episode Search

About Bankless

View all episodes from Bankless