go-libp2p-cat v0 Adopt the ideas of topics, the protobuf message formats, some core structures from go-libp2p-pubsub Integrate QUIC unreliable datagram from quic-go to go-libp2p-cat and make sure that they can exchange the topics they are interested over such transport. Implement RLNC without any message validation (the original Ethresearch post uses Pedersen commitments for this), but the library must provide a way to implement it later on the application layer. Create an example inside go-libp2p-cat that uses the RLNC implementation with the message validation (using Pedersen commitments) implemented in the example (rather than being implemented in the library). go-libp2p-cat v1 Implement RS (aka EC) inside go-libp2p-cat without any message validation. Create an example inside go-libp2p-cat that uses the RS implementation with the message validation implemented in the example (rather than being implemented in the library). After this step, we will probably rename the library to something else because we now have RS implemented but CAT refers only to RLNC.
7/9/2025Authors: Pop TLDR: We propose to chunk the columns in PeerDAS instead of sending each of them as a single message. The result is that the propagation latency is reduced significantly. It's similar to blob decoupling we did with Deneb, but this is for PeerDAS instead. Chunking the columns  As you can see in the first figure, GossipSub is a store-and-forward. That is, when each message is received, it's stored first, validated, and then forwarded. It will not be forwarded immediately while it's being received. This is shown in the first figure. Fortunately, columns in PeerDAS are easy to be chunked, even though we need to add ~300 bytes in each chunk which is the overhead from a signed block header and a KZG commitment inclusion proof. Those two things are necesary to prevent DoS attacks in the network.
6/10/2025Authors: Pop, Nishant, Chirag tldr; with gossipsub v2.0, we can double the blob count from whatever is specified in Pectra Gossipsub v2.0 spec: https://github.com/libp2p/specs/pull/653 Introduction Gossipsub is a pubsub protocol over lib2p which is based on randomized topic meshes. The general message propagation strategy is to broadcast any message to a subset of its peers. This subset is referred to as the 'mesh'. By controlling the outbound degree of each peer you are also able to control the amplification factor in the network. By selecting a high enough degree you can achieve a robust network with minimum latency. This allows messages to be dispersed resiliently across a network in a short amount of time.
3/7/2025Authors: pop tldr; this proposal reduces the bandwidth consumption of PeerDAS by 65.6% Since this proposal is an improvement to PeerDAS. Familiarity with PeerDAS is required. Topic observation is a building block of this design so it would be helpful if you read it first. Currently GossipSub imposes an amplification factor on the bandwidth consumption to PeerDAS, since more than one peers can send you the same columns. In fact, you need only one copy, so this amplification wastes your bandwidth. Previously we have IDONTWANT implemented which reduces the number of copies you will receive, but it doesn’t guarantee exactly how many.
11/3/2024