On 9/9/06, Timothy Brownawell [EMAIL PROTECTED] wrote:
There's been some minor thought given to having a refinement scheme forrevisions (for netsync) that makes use of the DAG structure to do betterthan the merkle refinement we do now. [nice description of the algorithm]
I like it ;-) I have
There's been some minor thought given to having a refinement scheme for
revisions (for netsync) that makes use of the DAG structure to do better
than the merkle refinement we do now.
Merkle refinement is O(d*log n), d being the size of the difference
between the sets. It also has a problem where
