diasporic on Nostr: Alex: Thanks for the thoughtful presentation. Do you think it's possible to calculate ...

Alex: Thanks for the thoughtful presentation.

Do you think it's possible to calculate transitive trust/relevance based on each principal's social graph?

Would it be desirable to have a dampening function on such a transversal search, a la IP routing protocols' TTLs. Otherwise you might end up with social graph loops.

Also, I may care less about the judgement of a friend of a friend of a friend than I do about a direct friend.

When I think about webs of trust, I immediately think about how unwieldy the PGP user trust survey is. Also, I think I'd feel a bit uncomfortable about broadcasting my evaluation of my social graph connections. So if there are any gradations between "connected" and "not connected", it seems like that ought to be private information either stored locally for each client/user, or else self-signed/encrypted data if published for cross-Nostr-client portability.

OK, one last blurb re: open social graphs. I think Tantek Çelik's microFormats, hCard, XFN, and FOAF concepts might be relevant, although they all seem to lean towards the too-much-information/self-compiled-dossier side of social graphs. See http://gmpg.org/xfn/and/#idconsolidation for some links.

Thanks again!