1
0
forked from cheng/wallet

modified: docs/social_networking.md

This commit is contained in:
reaction.la 2022-06-16 18:53:22 +10:00
parent fdb84ac880
commit 566198a6d5
No known key found for this signature in database
GPG Key ID: 99914792148C8388

View File

@ -278,7 +278,11 @@ and the branch head in this case being the most recent response to a thread
by a person you are following. by a person you are following.
The Distributed hash table key will be:\ The Distributed hash table key will be:\
<<<<<<< Updated upstream
`human readable area of interest name/#public key of zooko name/ `human readable area of interest name/#public key of zooko name/
=======
`#public key of zooko name/
>>>>>>> Stashed changes
human readable branch name/#hash of data item`\ human readable branch name/#hash of data item`\
so that items that are likely to be looked up together will likely be near so that items that are likely to be looked up together will likely be near
each other on the same physical disk, and transmitted over the same each other on the same physical disk, and transmitted over the same
@ -286,6 +290,19 @@ network connection. When someone approves of a text, then it goes into a
repository he controls or has write access to, and gets a corresponding key repository he controls or has write access to, and gets a corresponding key
in the distributed hash table. in the distributed hash table.
<<<<<<< Updated upstream
=======
Which is not exactly a distributed hash table, for a hash table relies on the uniform distribution of hashes for its efficiency, and, because we want things likely to be looked up together at the same network address on the same physical machine, this is a very non uniform distribution. But it will still be efficient, because by the time you walk the network past the zooko
key, you will seldom have very far to walk. Walk the network to the end of
the zooko key, you are at a machine to which that identity has write
access, and thus, he has the authority and incentive to make things work.
Rather than being a distributed hash table, this is a distributed patricia tree.
But it will work if the person who controls a particular Zooko name
structures the data under his name in accordance with the characteristics of
the lookup process, and if he does not, other people will fail to find the material in his repositories, and that is his problem, which he can fix.
>>>>>>> Stashed changes
The messages of the people you are following are likely to be in a The messages of the people you are following are likely to be in a
relatively small number of repositories, even if the total number of relatively small number of repositories, even if the total number of
repositories out there is enormous and the number of hashes in each repositories out there is enormous and the number of hashes in each