Kademlia bootstrapping + network optimal connections


I have 2 questions:

  1. Is the Kademlia bootstrapping mechanism implemented? (a new node is connected to the network, builds its routing tables by receiving its closes neighbors from the seed nodes and then from their peers and so on…?)

  2. I am also interested to learn about the optimal number of direct connections between peers in a Kademlia DHT network and the various methods to support it.

Thanks in advance.