-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
3 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,13 +1,15 @@ | ||
# ipfs-crawler | ||
|
||
This small tools sends random key queries to the IPFS DHT, which in turns triggers connections to | ||
This small tool sends random key queries to the IPFS DHT, which in turns triggers connections to | ||
random nodes in the network. The queries and the spawned connections are then logged, and one then can estimate | ||
the network size and the churn. | ||
|
||
By averaging the maximal common length prefix of peers ID with random key shots, one can ballpark (up to say 2x) the network size. Counting the connections gives a more accurate estimate but it takes around 20-30 minutes to saturate. | ||
|
||
Some basic R data analysis is present in `logs-analysis.R` | ||
|
||
Kudos to [@raulk](https://github.com/raulk/) for the original version of the [hawk](https://github.com/raulk/dht-hawk) | ||
|
||
## License | ||
|
||
Authored by raulk. Dual-licensed under MIT and ASLv2, by way of the [Permissive License Stack](https://protocol.ai/blog/announcing-the-permissive-license-stack/). |