[keyanalyze-discuss] The web of trust tightens over time

Jason Harris jharris at widomaker.com
Mon Aug 4 23:10:01 CEST 2003

On Mon, Aug 04, 2003 at 08:54:47PM +0200, Adrian 'Dagurashibanipal' von Bidder wrote:

> On Monday 04 August 2003 02:49, Jason Harris wrote:
> > With a keyring of any given strong set, someone could easily run
> > "gpg --check-sigs" on it without invoking any mad (programming) skillz.
> And a --check-sigs of *the* strong set would take exactly how long? At least a 
> few days if not weeks is my guess.

David, Werner, would you care to hazard a guess?  20,814 keys are in the
2003-07-27 strong set.  Assume a single 2.x GHz x86 CPU and ~250,000

Would splitting such a large keyring help any?  Are there any optimizations
that could be done?

Would the best-case scenario be 20,814 individual keyrings with the key 
being checked located first in the keyring and the signing keys located
in order based on their keyid?

Jason Harris          | NIC:  JH329, PGP:  This _is_ PGP-signed, isn't it?
jharris at widomaker.com | web:  http://jharris.cjb.net/
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 187 bytes
Desc: not available
Url : /pipermail/attachments/20030804/8e4a9abf/attachment.bin

More information about the Gnupg-devel mailing list