3 ms·
Hey Mark, pretty sure you're talking about floodsub, which is a naive implementation of pubsub of top of libp2p, not actually 'libp2p'. Libp2p is quite a bit mo
by whyrusleeping 8y ago
Hey Mark, pretty sure you're talking about floodsub, which is a naive implementation of pubsub of top of libp2p, not actually 'libp2p'. Libp2p is quite a bit more than a simple p2p pubsub library.
In any case, floodsub is just one option you can use for pubsub on top of libp2p (one with a notably high level of reliability and minimal cross network latency for infrequent messaging). We also have a tree pruning gossiping implementation called gossipsub. Take a look at the spec: https://github.com/libp2p/specs/blob/master/pubsub/gossipsub/README.md https://github.com/libp2p/specs/blob/master/pubsub/gossipsub...
- tribler 8y agoThat is very interesting spec, but also alarming. It contains: > The meshsub router offers a baseline construction with good amplification control properties, which we augment with gossip about message flow. This is notoriously hard to get right. How to prevent spam, posioning or Sybils in your gossip network? Scientific work on p2p overlays and gossip is hard to publish now at venues like Usenix or NSDI. After Newscast from 2003 it seems you need strong identity to make these systems attack resilient. An unsolved problem. Thank you for this insight! We will put a university student team on exploring this likely vulnerability in IPFS/libp2p.
- marknadal 8y agoNice, thanks for clarifying, I stand corrected. This is great to hear/see, do you guys also have benchmarks yet?