4 ms·
> If you can represent something using an append only data structure, a DHT is enough. Can you elaborate? Is the blockchain not an example of an append-only da
by jstanley 11y ago
> If you can represent something using an append only data structure, a DHT is enough.
Can you elaborate? Is the blockchain not an example of an append-only data structure?
- murbard2 11y agoA block-tree would be append only. The blockchain is a block-tree + a canonical leaf (or a head) which is a mutable variable. https://medium.com/@arthurb/what-do-blockchains-accomplish-e9a5efa246bf https://medium.com/@arthurb/what-do-blockchains-accomplish-e...
- fho 11y agoBasically a Directed Acyclic Graph on top of the DHT should suffice. Every node in the graph is signed and links back to two things: the node it is referencing (eg it is a comment to a post) and the last contribution of this user. Each contributor is announcing their last contribution (and probably reannouncing the last contributions of their "friends"). So finding new content is just a matter of listening to friends and following bread crumbs from there.