![]() |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
[Back to Keyring Analysis Page] Key Analysis 10 Aug 2001 The following stats are being pulled from a keyring that was exported from pgp.dtype.org on August 9, 2001. Before reading this, please be sure to view the explanation of this analysis and read the FAQ before asking me any questions about it. The strong set MSD raw analysis is available here. Please read the FAQ to explain how to read this file. This file includes all keys reachable from the strong set. Look up reports for individual keys in the raw output directory. Now you can see what keys are signed by each key (otherwise very difficult to find). New This Month Thanks to Randy Harmon at NAI (pgp.com) for a full dump, and a significant increase in the keyring size. Much of the growth of the keyring came from merging this ring. As always, continued thanks to Peter Wan for his efforts in maintaining global rings. The individual key analysis now also includes hop count histograms to each key from the strong set. Special Report - Other Strongly Connected Sets As mentioned in the explanation, I have chosen to focus on what is by far the largest strongly connected set, which I call the "strong set". There are, however, other smaller sets which are strongly connected. This means that groups of friends are reachable from each other, but have not exchanged signatures with anyone in the larger "strong set". This month, I've made a scan for _all_ strongly connected sets, from the largest, at size 10,153, to the n-way tie for last place with strongly connected sets of 1.
As you can see, the largest strongly connected set is orders of magnitude larger than the next biggest (10,153 compared to 98), which at least somewhat validates the decision to focus on this set. Other relatively large strongly connected sets could easily merge with the larger one by simply having _any_ of the set's members exchange signatures with someone in the larger set. Again, just because there is a path between two keys does not mean that there should be any implied trust. The reason this matters to this report is the math behind these numbers relies somewhat on strongly connected sets. General statistics
The "strong set"
Best connected keys (shortest distance to) Please read about the mean shortest distance (MSD) calculated here in the analysis explanation. Here are the top 50 keys. Look for your own key in this month's raw analysis (see above). Note that the only keys analyzed were those reachable from the strong set. I've included some of my own comments on people I recognize. I'm sorry if you're listed here without a comment. If you email me a quick phrase to describe what you do that would be of interest to readers, I'll put it in. The average MSD is 6.6224, in the set of 10,153. The median value is 6.1993. Go to this keyserver's web interface to look up these keys.
In the Drew self plug, my own key moved from #272 to #80 with an MSD of 4.6027. This was probably mostly due to a good-sized keysigning at Ottawa Linux Symposium. For next month I would still like to see the text key IDs in some of the raw reports, to avoid having to look them up later, but this requires some rewriting in all the sections of code, to hold those text fields in RAM through from import to report. Maybe for September... I certainly wouldn't object to someone contributing this part. Discussion about this analysis continues on the keyanalyze-discuss mailing list. If you have any suggestions, please send them my way, especially if you have the algorithms as well. If you're so inclined, please have a look at the code as well. |
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
All original content on this site is copyright (c)2000-2113 M. Drew Streib and licensed under the OpenContent License unless otherwise noted. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||