Subscribe to Oxidization
Subscribe to Oxidization
Share Dialog
Share Dialog
<100 subscribers
<100 subscribers
Sharding in blockchain is a method of increasing the number of transactions that a blockchain can process at any given time. The concept involves splitting the entire network into smaller portions, or "shards," each capable of processing its own transactions and smart contracts. In a traditional blockchain, each node stores all states (account balances, contract code, storage, etc.) and processes all transactions. This provides a high degree of security but limits scalability. Sharding allows for a subset of nodes to handle certain transactions, resulting in higher overall capacity without sacrificing decentralization and security. This approach has been proposed and pursued by several projects such as Ethereum 2.0 to increase their network's scalability and transaction speed.
Danksharding is the new sharding design proposed for Ethereum, with a focus on the Ethereum rollup-centric roadmap. The main innovation introduced by Danksharding is the merged fee market: unlike regular sharding, in which shards have both different block and block proposers, only one proposer exists that chooses all transactions and all data that go into that slot in Danksharding.
To avoid large hardware requirements for validators and to remain decentralized when implementing Danksharding, a Proposer-builder separation (PBS) [[1]](https://notes.ethereum.org/@vbuterin/pbs_censorship_resistance) was introduced.
PBS separates the block processing and building workload into a list of block builders, then the block proposer will accept the block body from builders with the highest bid. So the workload for the block proposer here is reduced drastically, and all other validators and users can verify the blocks very efficiently through data availability sampling (DAS). Also, note that the proposers (and everyone else) don't know the contents of any exec block body submitted by builders.
Proto-danksharding (PDS) is a proposal to implement core changes, particularly transaction format - that would be needed for full Danksharding. EIP-4844 introduces a new transaction type - a blob-carrying transaction. A blob (Binary large objects) is extremely large (~128kB) and can be much cheaper than similar amounts of calldata. However, blob data is not accessible to EVM execution (the execution layer), the EVM can only view a commitment to the blob.
To learn more about commitment scheme: https://en.wikipedia.org/wiki/Commitment_scheme
The data blobs are represented as polynomials and then use a polynomial commitment scheme to commit to the data. Ethereum plans specifically to use KZG as its polynomial commitment scheme. This allows us not only to achieve a commitment to the data, but also to be able to efficiently check certain properties of the data blob without needing to read the entire thing.
## Data Availability Sampling in Danksharding
The goal of DAS is that network participants can verify the data availability without the need to download a large amount of data.
This is a complex term that requires a lot of time to digest, so I will go deeper later.
## References
https://notes.ethereum.org/@vbuterin/proto_danksharding_faq#What-is-Danksharding
https://www.paradigm.xyz/2022/08/das
Sharding in blockchain is a method of increasing the number of transactions that a blockchain can process at any given time. The concept involves splitting the entire network into smaller portions, or "shards," each capable of processing its own transactions and smart contracts. In a traditional blockchain, each node stores all states (account balances, contract code, storage, etc.) and processes all transactions. This provides a high degree of security but limits scalability. Sharding allows for a subset of nodes to handle certain transactions, resulting in higher overall capacity without sacrificing decentralization and security. This approach has been proposed and pursued by several projects such as Ethereum 2.0 to increase their network's scalability and transaction speed.
Danksharding is the new sharding design proposed for Ethereum, with a focus on the Ethereum rollup-centric roadmap. The main innovation introduced by Danksharding is the merged fee market: unlike regular sharding, in which shards have both different block and block proposers, only one proposer exists that chooses all transactions and all data that go into that slot in Danksharding.
To avoid large hardware requirements for validators and to remain decentralized when implementing Danksharding, a Proposer-builder separation (PBS) [[1]](https://notes.ethereum.org/@vbuterin/pbs_censorship_resistance) was introduced.
PBS separates the block processing and building workload into a list of block builders, then the block proposer will accept the block body from builders with the highest bid. So the workload for the block proposer here is reduced drastically, and all other validators and users can verify the blocks very efficiently through data availability sampling (DAS). Also, note that the proposers (and everyone else) don't know the contents of any exec block body submitted by builders.
Proto-danksharding (PDS) is a proposal to implement core changes, particularly transaction format - that would be needed for full Danksharding. EIP-4844 introduces a new transaction type - a blob-carrying transaction. A blob (Binary large objects) is extremely large (~128kB) and can be much cheaper than similar amounts of calldata. However, blob data is not accessible to EVM execution (the execution layer), the EVM can only view a commitment to the blob.
To learn more about commitment scheme: https://en.wikipedia.org/wiki/Commitment_scheme
The data blobs are represented as polynomials and then use a polynomial commitment scheme to commit to the data. Ethereum plans specifically to use KZG as its polynomial commitment scheme. This allows us not only to achieve a commitment to the data, but also to be able to efficiently check certain properties of the data blob without needing to read the entire thing.
## Data Availability Sampling in Danksharding
The goal of DAS is that network participants can verify the data availability without the need to download a large amount of data.
This is a complex term that requires a lot of time to digest, so I will go deeper later.
## References
https://notes.ethereum.org/@vbuterin/proto_danksharding_faq#What-is-Danksharding
https://www.paradigm.xyz/2022/08/das
No activity yet