3 ms·
Hash graph reconciliation is generally the harder part of this problem as noted in future work, but this is a very exciting direction.
by Karrot_Kream 4y ago
Hash graph reconciliation is generally the harder part of this problem as noted in future work, but this is a very exciting direction.
- jchanimal 4y agoCheck out this implementation of hash-stable trees. The same dataset generates the same Merkle hash, regardless of insertion orders. This makes verifiable sync computationally efficient. https://github.com/mikeal/prolly-trees https://github.com/mikeal/prolly-trees