I think it's good that there's a few tools to do this so we can compare notes, but I'm going to use the tool I wrote since it has resume functionality AND a partitioning scheme such that multiple workers (perhaps on different machines) can in parallel scan the tor network. It uses the Fisher Yates shuffle algorithm to make sure that I do not hose relays with rapid successive circuit builds. I'll make a new github repo for this since right now the code is embedded in a dev branch of the bwscanner repo. On Sun, Sep 17, 2017 at 07:42:00AM +0000, nusenu wrote: > dawuud: > > In > > fact, the network is *very* partitioned... but as of the past few > > months I haven't put any energy into proving this; although I do have > > some mostly finished twisted python code to make all two hop tor > > circuits and records circuit build failures and circuit build timeouts. > > teor has a script [1] for this as well (and I'm also interested in this > rather important question: How far are we from a complete mesh?) > > [1] https://github.com/teor2345/onion-graph > > -- > https://mastodon.social/@nusenu > https://twitter.com/nusenu_ > > _______________________________________________ > tor-relays mailing list > tor-relays@xxxxxxxxxxxxxxxxxxxx > https://lists.torproject.org/cgi-bin/mailman/listinfo/tor-relays
Attachment:
signature.asc
Description: PGP signature
_______________________________________________ tor-relays mailing list tor-relays@xxxxxxxxxxxxxxxxxxxx https://lists.torproject.org/cgi-bin/mailman/listinfo/tor-relays