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

[Jason Harris]

--JGq01gMRpXZxBGpH
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable

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

> On Monday 04 August 2003 02:49, Jason Harris wrote:
>=20
> > With a keyring of any given strong set, someone could easily run
> > "gpg --check-sigs" on it without invoking any mad (programming) skillz.
>=20
> And a --check-sigs of *the* strong set would take exactly how long? At le=
ast a=20
> 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
signatures.

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=20
being checked located first in the keyring and the signing keys located
in order based on their keyid?

--=20
Jason Harris          | NIC:  JH329, PGP:  This _is_ PGP-signed, isn't it?
jharris@widomaker.com | web:  http://jharris.cjb.net/

--JGq01gMRpXZxBGpH
Content-Type: application/pgp-signature
Content-Disposition: inline

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.1 (FreeBSD)

iD8DBQE/Lr3lSypIl9OdoOMRAuhYAJsF8ttvlvsnum/OrWb2IAQuhjqPvgCfcy2Q
fBPg/i5g5L54U/FVVw9Bz5k=
=1AR8
-----END PGP SIGNATURE-----

--JGq01gMRpXZxBGpH--