28a7d31565
This can be used for fingerprinting and working out the network topology. Instead of sending the first N (which are sorted by last seen time), we sent a random subset of the first N+N/5, which ensures reasonably recent peers are used, while preventing repeated calls from deducing new entries are peers the target node just connected to. The list is also randomly shuffled so the original set of timestamps cannot be approximated. |
||
|---|---|---|
| .. | ||
| CMakeLists.txt | ||
| net_node.cpp | ||
| net_node.h | ||
| net_node.inl | ||
| net_node_common.h | ||
| net_peerlist.cpp | ||
| net_peerlist.h | ||
| net_peerlist_boost_serialization.h | ||
| p2p_protocol_defs.h | ||
| stdafx.h | ||