6 Commits (ee35ddc8fdf5fe12f42cac3bd7a40d8fe7a384f2)

Author	SHA1	Message	Date
Felix Lange	16bc57438b	p2p/dnsdisc: fix crash when iterator closed before first call to Next (#22906)	4 years ago
Felix Lange	d36276d85e	p2p/dnsdisc: fix hot-spin when all trees are empty (#22313) ... In the random sync algorithm used by the DNS node iterator, we first pick a random tree and then perform one sync action on that tree. This happens in a loop until any node is found. If no trees contain any nodes, the iterator will enter a hot loop spinning at 100% CPU. The fix is complicated. The iterator now checks if a meaningful sync action can be performed on any tree. If there is nothing to do, it waits for the next root record recheck time to arrive and then tries again. Fixes #22306	4 years ago
Felix Lange	57d4898e29	p2p/dnsdisc: re-check tree root when leaf resolution fails (#20682) ... This adds additional logic to re-resolve the root name of a tree when a couple of leaf requests have failed. We need this change to avoid getting into a failure state where leaf requests keep failing for half an hour when the tree has been updated.	5 years ago
Felix Lange	191364c350	p2p/dnsdisc: add enode.Iterator API (#20437) ... * p2p/dnsdisc: add support for enode.Iterator This changes the dnsdisc.Client API to support the enode.Iterator interface. * p2p/dnsdisc: rate-limit DNS requests * p2p/dnsdisc: preserve linked trees across root updates This improves the way links are handled when the link root changes. Previously, sync would simply remove all links from the current tree and garbage-collect all unreachable trees before syncing the new list of links. This behavior isn't great in certain cases: Consider a structure where trees A, B, and C reference each other and D links to A. If D's link root changed, the sync code would first remove trees A, B and C, only to re-sync them later when the link to A was found again. The fix for this problem is to track the current set of links in each clientTree and removing old links only AFTER all links are synced. * p2p/dnsdisc: deflake iterator test * cmd/devp2p: adapt dnsClient to new p2p/dnsdisc API * p2p/dnsdisc: tiny comment fix	5 years ago
Felix Lange	7300365956	p2p/dnsdisc: update to latest EIP-1459 spec (#20168) ... This updates the DNS TXT record format to the latest changes in ethereum/EIPs#2313.	5 years ago
Felix Lange	0568e81701	p2p/dnsdisc: add implementation of EIP-1459 (#20094) ... This adds an implementation of node discovery via DNS TXT records to the go-ethereum library. The implementation doesn't match EIP-1459 exactly, the main difference being that this implementation uses separate merkle trees for tree links and ENRs. The EIP will be updated to match p2p/dnsdisc. To maintain DNS trees, cmd/devp2p provides a frontend for the p2p/dnsdisc library. The new 'dns' subcommands can be used to create, sign and deploy DNS discovery trees.	5 years ago