i2p, tor, and dht all rely on some sort of centralized node for bootstrapping. e.g. a fresh install, or when the client has been disconnected from the internet for years.

Would it work to use multiple orthogonal bootstrap methods? i.e. try in a random order any of the following until the client can join the swarm:

• DNS records, http pages, etc. (a straightforward approach like i2p, tor, and dht do)

• "user content," i.e. comments on news sites, blogs, image sharing sites, pastebin, github, etc. that contain the information, hidden using steganography or encryption. A simple google search should not find this user content - the bootstrap method would need to crawl a large number of pages looking for the "signal in the noise," which would make it difficult to find and eliminate all the places the data was hidden.

• "data broadcast," i.e. the bootstrap client listens on random TCP or UDP ports within a certain range. Active swarm peers do "port knocking" in this port range, subdividing the IPv4 space among them so that they visit every IP address within about 24 hours. The range is chosen so as not to incriminate the peers doing the knocking. The waiting bootstrap node will eventually be reached, and the active peer can then transmit the needed data. (IPv4 address blacklists are a must, i.e. do not "port knock" in government address ranges or other sensitive targets.)

By attempting all the methods at random, any that get shut down can be detected and the status updates pushed out to all clients.