[rdfweb-dev] The shorest way between friend and another friend

[James Moore]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On Tuesday, April 22, 2003, at 06:04 AM, se seman wrote:

>
> No, the costs(weighs) between a pair of nodes depend
> on a lot o f factors (capacity, delay,congestion...).
> Take FOAF as a example, the costs between two friends
> depond on how much you know that friend. If you know
> this friend very much, that cost should be very small.
> Otherwise it will become large.

PGP web-of-trust could be useful in this respect as well. I see WOT as 
being slightly different in nature from how friendly you are with 
someone. I have plenty of good friends who I would not trust to 
properly verify a nym's credentials. The problem I guess in calculating 
this is that you'd need to know all the inbound links to a node in 
order to know how trustworthy they are. I guess this a problem with any 
distributed reputation system. Could this be handled by something like 
'knownBy'?

After briefly checking out the RDF/WOT spec [1] I think it cannot 
currently represent trust metrics. Is this correct Danbri? Is there a 
short path between a trustdb dump from gnupg and some kind of useful 
metadata?

- -James

[1] http://xmlns.com/wot/0.1/

- ----
WireRimmed - Custom software for your small business
http://wirerimmed.com

-----BEGIN PGP SIGNATURE-----
Version: PGP 8.0
Comment: Contact me if you'd like to learn more about email encryption

iQA/AwUBPqV8ozNOZbajVDyKEQJd+wCaAy4Lk/z7xYM6TiwLzL6cdiZllZMAn3py
PEWkh5iWa7XhiWTJ+jd09jIH
=E7b5
-----END PGP SIGNATURE-----