Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
Merkle DAG research #28
We're working on a paper that describes the Merkle DAG we use in dat. Specifically we are interested in approaches with these properties:
Our graph node exchange protocol between 2 peers works like this:
A peer can send a question message to another peer with some graph node hashes and the other peer should reply back with an answer containing which of the requested hashes it has in its local graph.
The question/answer protocol is stateful for asker, not answerer.
when receiving question
when asking question
This lets the 'asker' choose the algorithm they want to use to generate a list of hashes to ask for.
We want to explore different algorithms and secondary indexing schemes we can employ here.
Here's a bunch of papers on Merkle trees/graphs for research: