)"After the search is exhausted, the client then inserts the peer contact information for itself onto the responding nodes with IDs closest to the infohash of the torrent."The above sentence describes how Kademlia updates its routing table.
Kademlia peers store contact information about each other in a routing table to route query messages.
I would recommend the IEEE S&P paper, “Trawling for Tor Hidden Services: Detection, Measurement, Deanonymization” which presents the same issues allowing the DHT to be trawled.
They also present some very serious attacks allowing an adversary to locate hidden services with practical resources.
This is a short signed message created by the hidden service approximately every hour contain a list of introduction nodes and some other identifying data such as the descriptor id (desc id).
The desc ID is based on a hash of some hidden service information and it changes every 24 hours. The hidden service then publishes its updated descriptor to a set of 6 responsible hidden service directories (HSDir’s) every hour.
For some types, human-readable representations are suggested.
Same as a query but will trigger an update query on the 20 closest nodes (distance between node ids and target) after the query finishes.The implementation is free to choose any in-memory representation of the specified types.Binary formats are specified in tables with length, type, and content descriptions.This document is a textual specification of the Tox protocol and all the supporting modules required to implement it.The goal of this document is to give enough guidance to permit a complete and correct implementation of the protocol.* * Created by Henrik Ekblad * Copyright (C) 2013-2015 Sensnology AB * Full contributor list: https://github.com/mysensors/Arduino/graphs/contributors * * Documentation: Support Forum: * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * version 2 as published by the Free Software Foundation.