From fdb84ac8801f4e3490aa50e0c955db73e27e207f Mon Sep 17 00:00:00 2001 From: "reaction.la" Date: Thu, 16 Jun 2022 10:46:09 +1000 Subject: [PATCH] modified: style.css modified: ../libraries/review_of_crypto_libraries.md --- docs/libraries/review_of_crypto_libraries.md | 2 +- docs/pandoc_templates/style.css | 6 ++++++ docs/social_networking.md | 9 +++++++++ 3 files changed, 16 insertions(+), 1 deletion(-) diff --git a/docs/libraries/review_of_crypto_libraries.md b/docs/libraries/review_of_crypto_libraries.md index 9141f3f..b865adc 100644 --- a/docs/libraries/review_of_crypto_libraries.md +++ b/docs/libraries/review_of_crypto_libraries.md @@ -188,7 +188,7 @@ way. Going to use base52 for any purposes for which my bright idea would have been useful, so should be rewritten to base64 regardless. Using the hash of shared state goes together with immutable -append only Merkle-patricia trees like ham and eggs, though you +append only Merkle‑patricia trees like ham and eggs, though you don't need to keep the potentially enormous data structure around. When a connection has no activity for a little while, you can discard everything except a very small amount of data, primarily the keys, diff --git a/docs/pandoc_templates/style.css b/docs/pandoc_templates/style.css index 95fdd89..30ee994 100644 --- a/docs/pandoc_templates/style.css +++ b/docs/pandoc_templates/style.css @@ -1,6 +1,12 @@ body { max-width: 30em; margin-left: 1em; + font-family: "Georgia, Times New Roman", Times, serif; + font-style: normal; + font-variant: normal; + font-weight: normal; + font-stretch: normal; + font-size: 16px; } table { border-collapse: collapse; diff --git a/docs/social_networking.md b/docs/social_networking.md index d9263f3..916d4a6 100644 --- a/docs/social_networking.md +++ b/docs/social_networking.md @@ -277,6 +277,15 @@ who pushed a tag or a branch to that repository, a branch being a thread, and the branch head in this case being the most recent response to a thread by a person you are following. +The Distributed hash table key will be:\ +`human readable area of interest name/#public key of zooko name/ +human readable branch name/#hash of data item`\ +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 +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 +in the distributed hash table. + 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 repositories out there is enormous and the number of hashes in each