Hi, I had a quick look without much success. But that was to be expected. Some tcpdump will probably help. :-)
I need a DHT where I can find some peers that are 'near' a given hash. So that requirement is very simple. Until now I use a Kademlia DHT used for BitTorrent.. Some questions: - what is the peer id length of the DHT? - does participation in the DHT needs crypto routines? - is there a (minimal?) implementation that can be used outside of th gnunet environment? - what is a bloom filter used in the DHT code for? - do peers have to support get/set methods? - what peer id metric is used (e.g. xor)? - is the DHT protocol expected to change? Thanks so far, Moritz On 09/03/17 14:21, Christian Grothoff wrote: > Hi!, > > You can find the exact packet wire format in the code under > src/dht/gnunet-service-dht_neighbours.c > > You could also explain what you need, and maybe I can quickly answer > whether it can be done or not. > > Happy hacking! > > Christian > > On 09/03/2017 01:45 PM, Moritz Warning wrote: >> Hi, >> >> I need some information about the gnunet DHT protocol. >> So far I have found only API documentation: >> https://gnunet.org/developer-handbook-dht >> >> Is there information about the packet structure used by the DHT and how >> messages exchange works? >> I like to use the DHT for some other purpose and want to evaluate if that is >> possible. >> >> thanks, >> mwarning >> >> _______________________________________________ >> GNUnet-developers mailing list >> [email protected] >> https://lists.gnu.org/mailman/listinfo/gnunet-developers >> > > > > _______________________________________________ > GNUnet-developers mailing list > [email protected] > https://lists.gnu.org/mailman/listinfo/gnunet-developers >
signature.asc
Description: OpenPGP digital signature
_______________________________________________ GNUnet-developers mailing list [email protected] https://lists.gnu.org/mailman/listinfo/gnunet-developers
