| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-04-16 | Add a first approximation of a lookup algorithm | Jesper Jensen | |
| This isn't really "correct" but it's probably going to work. It's a rough implementation of the Kademlia lookup algorithm, with the modification that we don't keep track of anything behind the frontier. We are therefore counting on peers being ok with us potentially sending them the "same" request multiple times. If they respond in a reasonable time, the double request rate _should_ be minimal, but that of course carries the risk that an already overloaded peer would get even more queries. I don't know. It's a first try at something. I need to see it work before I write it off completely. | |||
| 2025-04-12 | Add prometheus monitoring | Jesper Jensen | |
| 2025-04-12 | I don't know | Jesper Jensen | |
| 2025-04-12 | I don't remember | Jesper Jensen | |
| 2021-10-27 | Increase payload sizemainflush | Jesper Jensen | |
| 2021-10-16 | Flush in main | Jesper Jensen | |
| 2021-10-16 | Add find_node query | Jesper Jensen | |
| 2021-10-05 | Respond correctly no unknown query method | Jesper Jensen | |
| 2021-10-05 | Add getclient timeout | Jesper Jensen | |
| 2021-10-02 | Add timeout handling | Jesper Jensen | |
| 2021-09-19 | Add general tests | Jesper Jensen | |
| 2021-09-03 | Add ping support | Jesper Jensen | |
| 2021-08-29 | Add formal benc cursor | Jesper Jensen | |
| 2021-08-28 | Initial fanout implemented | Jesper Jensen | |
| 2021-06-20 | Add tests for routing | Jesper Jensen | |
| 2021-06-17 | Add tests and test running | Jesper Jensen | |
 |
index : dht.git | |
| BitTorrent DHT peer |
| summaryrefslogtreecommitdiff |