- Anton Nashatyrev·Last edited by Anton Nashatyrev on Apr 10, 2025Linked with GitHubContributed by
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.Erasure coding for Pubsub: simulation results comparing Reed-Solomon and RLNC
The write-up is here: https://github.com/Nashatyrev/potuz-pubsub/blob/main/src/main/notebook/Writeup.ipynb
Read more
Ideal pubsub
The goal of this work is to come up with a theoretically optimal pubsub algorithm and estimate its properties with respect to bounding conditions: network bandwidth and latency.
Feb 21, 2024Network Shards
Location: Room A
Nov 14, 2023Potential Gossip improvement list for EIP4844
https://hackmd.io/X1DoBHtYTtuGqYg0qK4zJw#2---Bursty-traffic-is-hard
Jun 28, 2023New Data Availabiliy Sampling spec draft
Note This is a draft version of refactored Sharding DAS specification: https://github.com/ethereum/eth2.0-specs/blob/dev/specs/das/das-core.md The goals of this refactoring Fill the gaps in the original version Allow arbitrary length data to be sampled/reconstructed/proven (not just pow 2 lengths as in original version) Generify the spec by relying on fundamental concepts (like polynomials and pairings) instead of specific optimized functions like FFT, FK20, KZG lib functions (special case of the above point) Get rid of numerous point permutations in the spec as they are only applicable to optimized algorithms inputs/outputs. Those permutations were the major source of confusion for me while understanding the spec core.
Jan 14, 2022
HackMD