# Kadabra: Adapting Kademlia for the Decentralized Web

arXiv: https://arxiv.org/abs/2210.12858 · HTML: https://mlsanity.com/paper/2210.12858/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 7 of its 43 references that are in the map.
- First posted on arXiv 23 Oct 2022.

## Builds on (most cited first, 7 of 7)

- [Introduction to Multi-Armed Bandits](https://mlsanity.com/paper/1904.07272/) (2019)
- [IPFS - Content Addressed, Versioned, P2P File System](https://mlsanity.com/paper/1407.3561/) (2014)
- [Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits](https://mlsanity.com/paper/2004.04666/) (2020)
- [Design and Evaluation of IPFS: A Storage Layer for the Decentralized Web](https://mlsanity.com/paper/2208.05877/) (2022)
- [Business Model of a Botnet](https://mlsanity.com/paper/1804.10848/) (2018)
- [On the Efficiency of Decentralized File Storage for Personal Information Management Systems](https://mlsanity.com/paper/2007.03505/) (2020)
- [Evaluating Connection Resilience for the Overlay Network Kademlia](https://mlsanity.com/paper/1703.09171/) (2017)

## Built on by (most cited first, 1 of 1)

- [TRACER: Token ReAssignment for Concept ERasure in Generative Recommendation](https://mlsanity.com/paper/2606.07688/) (2026)

## Abstract (arXiv)

Blockchains have become the catalyst for a growing movement to create a more decentralized Internet. A fundamental operation of applications in a decentralized Internet is data storage and retrieval. As today's blockchains are limited in their storage functionalities, in recent years a number of peer-to-peer data storage networks have emerged based on the Kademlia distributed hash table protocol. However, existing Kademlia implementations are not efficient enough to support fast data storage and retrieval operations necessary for (decentralized) Web applications. In this paper, we present Kadabra, a decentralized protocol for computing the routing table entries in Kademlia to accelerate lookups. Kadabra is motivated by the multi-armed bandit problem, and can automatically adapt to heterogeneity and dynamism in the network. Experimental results show Kadabra achieving between 15-50% lower lookup latencies compared to state-of-the-art baselines.