Optimistic Provide: How We Made IPFS Content Publishing 10x Faster - Blog | ProbeLab Analytics
probelab.io · 2,755 words · saved by 1 readers
How a statistical approach cut IPFS content publishing times by over one order of magnitude.
Introduction Publishing content in Distributed Hash Tables (DHTs) has traditionally been a slow operation, especially when: i) the network is large, and ii) the nodes participating in the network are churning frequently. The case is no different for IPFS’s Amino DHT, which meets both of these conditions. The ProbeLab team identified this problem years ago, through extensive measurements, and proposed an optimisation that was shown to improve performance, i.e., reduce the content publication time by over one order of magnitude while simultaneously reducing the network overhead by 40%. The…
saved by
related reading
- abseil / Performance Hintsabseil.io
- Faster block/blob propagation in Ethereum - Networking - Ethereum Researchethresear.ch
- What is IPFS? | IPFS Docsdocs.ipfs.tech
- @adlrocha - How I built an IPFS crawler with libp2padlrocha.substack.com
- The Hitchhiker's Guide to Ethereum - Delphi Digitalmembers.delphidigital.io
- ANT Research News – Updates about research by the ANT group (Analysis of Network Traffic)ant.isi.edu
- Optimistic relays and where to find themfrontier.tech
- The Absence of Proposer Myopiacollective.flashbots.net
- Content delivery network - Wikipediaen.wikipedia.org
- When I have a slower publishing cadence my blog grows fastersubstack.com
- Napkinsirupsen.com
- Tower BFT: Solana’s High Performance Implementation of PBFT | by Anatoly Yakovenko | Solana | Mediummedium.com