Pith. sign in

REVIEW 2 cited by

GossipSub: Attack-Resilient Message Propagation in the Filecoin and ETH2.0 Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.02754 v1 pith:MU43VC36 submitted 2020-07-06 cs.NI

classification cs.NI
keywords gossipsubnodesmeshattacksmessagepropagationprotocolpubsub
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Permissionless blockchain environments necessitate the use of a fast and attack-resilient message propagation protocol for Block and Transaction messages to keep nodes synchronised and avoid forks. We present GossipSub, a gossip-based pubsub protocol, which, in contrast to past pubsub protocols, incorporates resilience against a wide spectrum of attacks. Firstly, GossipSub's mesh construction implements an eager push model keeps the fan-out of the pubsub delivery low and balances excessive bandwidth consumption and fast message propagation throughout the mesh. Secondly, through gossip dissemination, GossipSub realises a lazy-pull model to reach nodes far-away or outside the mesh. Thirdly, through constant observation, nodes maintain a score profile for the peers they are connected to, allowing them to choose the most well-behaved nodes to include in the mesh. Finally, and most importantly, a number of tailor-made mitigation strategies designed specifically for these three components make GossipSub resilient against the most challenging Sybil-based attacks. We test GossipSub in a testbed environment involving more than 5000 VM nodes deployed on AWS and show that it stays immune to all considered attacks. GossipSub is currently being integrated as the main messaging layer protocol in the Filecoin and the Ethereum 2.0 (ETH2.0) blockchains.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 5 citations worldwide. Full citation record

  1. PANDAS: Peer-to-peer, Adaptive Networking for Data Availability Sampling within Ethereum Consensus Timebounds

    cs.DC 2025-07 conditional novelty 7.0 of 10

    PANDAS is a peer-to-peer protocol that claims to complete Ethereum data-availability sampling within the consensus 4-second window using direct UDP exchanges, builder-led seeding, and adaptive fetching.

  2. PREAMBLE and IMRECEIVING for Improved Large Message Handling in libp2p GossipSub

    cs.NI 2025-05 conditional novelty 6.0 of 10

    A proposed extension to libp2p GossipSub that uses PREAMBLE and IMRECEIVING notifications to reduce duplicate large-message transmissions, cutting reported bandwidth by up to 61% and dissemination latency by up to 35%...

Pith tools