This is a continuation of the earlier posts starting with this one: http://ravinote.blogspot.com/2020/09/best-practice-from-networking.html
Distributed Hash Table has gained widespread popularity in distributing the load over a network. There are some well-known players in this technology. Kademlia for instance proves many of the theorems for DHT.
Messages are routed through low latency paths and use parallel asynchronous queries. Message queuing itself and its protocol is an excellent communication mechanism for a distributed network.
The integrity of the data is verified with the help of Merkle trees and proofs in such a distributed framework. Others use key-based encryptions.
Partial audits reduce overhead in compute and storage. For example, shards of data may be hashed many times to generate pre-leaves in a Merkle tree. And the proof may be compact but the tree may not be compact. Partial audits, therefore, save on computing and storage.
Data does not always need to be presented in entirety and always from the source of truth. The data may remain completely under the control of the owner while a challenge-proof may suffice
No comments:
Post a Comment