KademliaCon Links, Slides and Recordings

Data availability sampling

<aside> 📖 KademliaCon Links, Slides and Recordings

<aside> 📖 “Sharding & Data Availability Sampling” talk by Dankrad Feist. Recording.

</aside>

Untitled

<aside> 📖

“TOPDISC: Service discovery for the Ethereum platform” talk by Michał Król, Sergi Rene, and Onur Ascigil. Slides below, recording on Youtube.

</aside>

<aside> 📖 “Byzantine-Resilient Distributed Hash Tables” talk by Gopal Pandurangan. Recording.

</aside>

<aside> 📖 “The IPFS DHT: Design, Measurements, and Evaluation” by Gus Eggert. Recording.

</aside>

**S/Kademlia paper.** During our afternoon workshop on resilient DHTs, we talked about limiting identities for sybil resistance. Current DHT implementations do this heuristically, based on IP address, but can’t provide hard guarantees that way.
Validator-based sybil resistance. For Ethereum, this could take the form of a two-tier network, with strong guarantees among staked validators and best-effort for non-validating nodes. This area is mostly under-explored as a main design goal of the Ethereum p2p network is to not link validator public keys to IP addresses.
DHT feedback. John Hiesey described an idea to augment DHTs with feedback. In other words, augment the standard get(k) and put(k, v) with a score(k, v, s) to allow a higher-level system to tell the DHT layer whether a given lookup produced a useful result. I’d link to an exploration of this idea, but I don’t know if one exists yet. Protolamda sketched out some ideas in this domain earlier this year.

<aside> 📖 “Resilient Networking for Secure Consensus” talk by Joachim Neu. Slides, recording (coming later)

</aside>