# SemDHT: Certified Semantic Discovery for Peer-to-Peer Agent Networks over Exact-Key DHTs

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 12 of its 41 references that are in the map.
- First posted on arXiv 20 Sep 2026.

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

- [Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks](https://mlsanity.com/paper/1908.10084/) (2019)
- [ToolLLM: Facilitating Large Language Models to Master 16000+ Real-world APIs](https://mlsanity.com/paper/2307.16789/) (2023)
- [Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs](https://mlsanity.com/paper/1603.09320/) (2016)
- [IPFS - Content Addressed, Versioned, P2P File System](https://mlsanity.com/paper/1407.3561/) (2014)
- [Internet of Agents: Fundamentals, Applications, and Challenges](https://mlsanity.com/paper/2505.07176/) (2025)
- [Agent Discovery in Internet of Agents: Challenges and Solutions](https://mlsanity.com/paper/2511.19113/) (2025)
- [A Layered Protocol Architecture for the Internet of Agents](https://mlsanity.com/paper/2511.19699/) (2025)
- [Agent Identity URI Scheme: Topology-Independent Naming and Capability-Based Discovery for Multi-Agent Systems](https://mlsanity.com/paper/2601.14567/) (2026)
- [Distributed General-Purpose Agent Networks: Architecture, Key Mechanisms, and Prototypes](https://mlsanity.com/paper/2606.17368/) (2026)
- [Agent-OSI: An Interoperability Architecture for Communication and Settlement in the Decentralized Internet of Agents](https://mlsanity.com/paper/2602.13795/) (2026)
- [NearBucket-LSH: Efficient Similarity Search in P2P Networks](https://mlsanity.com/paper/1511.07148/) (2015)
- [Agentic Peer-to-Peer Networks: From Content Distribution to Capability and Action Sharing](https://mlsanity.com/paper/2603.03753/) (2026)

## Abstract (arXiv)

Agents may need capabilities exposed through external agent endpoints or service APIs. When a requester is not already bound to a provider, it must discover advertised capabilities matching its task and interface requirements. Over exact-key distributed hash tables (DHTs), broad retrieval transfers large candidate lists, whereas selective retrieval may miss relevant providers or require more replication and lookups. Open publication also lets providers inflate their exposure unless publication bounds are enforceable. We present SemDHT, a certified semantic index for discovering agent-accessible capabilities over exact-key DHTs. A two-layer semantic sketch uses coarse cells to group nearby descriptors and residual codes to narrow candidate selection. Providers publish at a bounded set of derived keys, while requesters probe precision keys before broader recall keys within a lookup budget. Anchor committees certify each descriptor's publication-key set, enabling storage services and requesters to enforce descriptor-to-key consistency. On real API descriptors and task queries, SemDHT achieves recall@10 of 0.955 against exact embedding-space neighbors and 0.947 against ToolBench relevance labels. On a corpus with controlled density augmentation, it matches the candidate exposure of tuned locality-sensitive hashing (LSH) over a DHT at recall 0.95 with 7.7x fewer lookups and reduces publication fan-out from 16 to 10. A Go/libp2p prototype deployed on same-region and cross-region 200-peer cloud overlays replays 299 Internet queries. With parallel probes and cold certificate caches, SemDHT achieves mean completion-time speedups of 3.64x and 4.11x over LSH, respectively.