Open d33tah opened 9 years ago
This sounds interesting! Just to clarify I understand everything right:
Is this accurate?
Yup. You're going to download ~6GiB of data this way.
Thanks! Do you know approximately how many nodes/edges in the final graph?
I'd say hundreds of thousands, but I can't really remember.
I see the script starts with 7909761da0a42745
and performs dfs on the graph. Does this guarantee that entire graph will be traversed? In other words - are there any isolated components in the graph?
Yes, there are. This just describes the biggest island, sadly. You could get the isolated parts by getting mirrors of the key servers, but I never worked on that.
I looked yesterday at their docs, and found this [1]:
If you REALLY need the whole index file or key ring, PLEASE contact the administrator of a keyserver and ask them for a dump.
So I sent them email to bug-pks@mit.edu - haven't heard back yet.
W dniu 08.09.2015 o 21:43, Andrei Kashcha pisze:
I looked yesterday at their docs, and found this [1]:
If you REALLY need the whole index file or key ring, PLEASE contact the administrator of a keyserver and ask them for a dump.
So I sent them email to bug-pks@mit.edu - haven't heard back yet.
https://keyserver.mattrude.com/guides/building-server/#download-the-needed-database-files
That's quicker.
Here's a script you might find useful for that purpose:
https://gist.github.com/d33tah/9177395