Try   HackMD

Development Update #10

Before we get to the normal Dev Update…

Over the past 4 months I dove deep into Danksharding, Ethereum Networking, and then p2p networking in rust + building out a discv5 overlay simulation. A few days back, I read a few "big-picture" Ethereum developer documents: Network Layer and Data Availability.

Somewhere along the journey I lost the thread.

I was building this Data Availability Sampling p2p network simulation without understanding the "why" behind it all.

 

The "Why" Behind Data Availability Sampling

Danksharding leverages full scale data sharding to distribute responsibility for verifying availability of blob data amongst different sets of validators (aka committees).

Validators within each committee are responsible for downloading the entire blob designated to their shard to verify that the blob is available.

With this distribution of responsibility, we can increase the amount of blob data settled on-chain without increasing requirements for any individual node.

Expensive node requirements   ==    Reduced decentralization   ==      : (

 
But there's a problem. Now only a committee of malicious validators would be needed to push invalid transactions through.

To keep each committee honest, validators (and other nodes in the Ethereum Network) randomly request small chunks (aka samples) of blob data from one another.

If enough honest nodes request a small number of samples within each shard, we can be sure that each committee's blob is available.

 
                                           This is data availability sampling.
 

Update

Since my last update, I've implemented the secondary overlay network struct + both overlays' message processing within DASNodes.

For a while I was getting stuck in the minuta of generalizing the function that creates overlay structs but decided to shelf that and just get the thing functioning properly (I can ask ChatGPT later).

Once the secondary overlay struct was created, I implemented TalkReq/Resp message processing for both subnetworks.

Now nodes can communicate through each subnetwork!

 

To Do:

Figure out how to instantiate overlay routing tables!

After populating overlay tables within DAS Playground, slowly phase into integrating this secondary overlay logic within Model DAS.

Last changed by 
 
Echo
1
1
329

Read more

Secure Kademlia Library

DAS Networking in Ethereum requires lots of small blob samples to be placed in a distributed network where arbitrary nodes can query “the network” to make sure these samples are available.

Aug 14, 2023
Aggregated DAS Content

This is a living document of my favorite Data Availability Sampling resources. 

Jul 5, 2023
EPF Final Update

Tackling the DAS Networking problem requires a p2p network that has low-latency, is privacy preserving and is sybil-resistant. The idea behind Model DAS is to measure benchmarks on DAS querying via Secure Kademlia DHT Discv5 overlay network. This Secure K-DHT is a seperate validator-only overlay network that leverages validators' incentive alignment to create a robust DAS network if the primary network were to come under attack. Status Report The original vision for Model DAS didn't entail creating a new DAS simulation; the idea was just to extend the functionality of another. But seeing that I was new to gerenal networking concepts and the Rust programming language, it quickly became aparent that building a simplified version of DAS Prototype was an escential prerequisite to executing the vision behind Model DAS. Finished

Mar 1, 2023
Summary of DAS Playground (WIP)

Within this document I talk about specific concepts within DAS-Playground.   Motivation Required Reading: What is Danksharding? A TLDR on Required Reading: Ethereum's rollup-centric roadmap requires extra blob data to be placed on chain. The more blob data that can be placed on chain, the more Ethereum can scale. But... Extra data = extra cost to run a node = reduced decentralization =    : (

Feb 16, 2023
Read more from Echo
Published on HackMD