Hash graph reconciliation is generally the harder part of this problem as noted ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Karrot_Kream on Nov 21, 2022 \| parent \| context \| favorite \| on: Building a BFT JSON CRDT Hash graph reconciliation is generally the harder part of this problem as noted in future work, but this is a very exciting direction.

jchanimal on Nov 21, 2022 [–]

Check 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

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact