▲ | avidiax 3 days ago | ||||||||||||||||
> Many crawlers and indexers continuously pick random or sequential infohashes and announce themselves so they can later detect other announcers I can't follow the logic here. How does this detect other announcers? | |||||||||||||||||
▲ | tdjsnelling 3 days ago | parent | next [-] | ||||||||||||||||
By announcing itself, the indexer makes itself more likely to be handed out as a peer to anyone else interested in that infohash. Every connection attempt it subsequently receives is evidence of another peer announcing or joining that torrent. In effect, it "baits" peers into revealing themselves | |||||||||||||||||
▲ | aspenmayer 3 days ago | parent | prev [-] | ||||||||||||||||
The way I understand it, these extraneous infohashes are functional honeytokens. https://en.wikipedia.org/wiki/Honeytoken > In the field of computer security, honeytokens are honeypots that are not computer systems. Their value lies not in their use, but in their abuse. | |||||||||||||||||
|