rrepair, merkle: improved sync protocol in case of failed tree node comparisons. If an leaf and and inner node represent the same intervall the leaf hash will be search in the inner node to prevent an unnecessary bucket transfer. -> This will decrease the merkle tree sync redundancy.
rrepair, merkle: improved sync protocol in case of failed tree node comparisons.
If an leaf and and inner node represent the same intervall the leaf hash will be search in the inner node to prevent an unnecessary bucket transfer. -> This will decrease the merkle tree sync redundancy.
caijieming-baidu/scalaris,caijieming-baidu/scalaris,scalaris-team/scalaris,jvf/scalaris,jvf/scalaris,jvf/scalaris,scalaris-team/scalaris,caijieming-baidu/scalaris,jvf/scalaris,caijieming-baidu/scalaris,caijieming-baidu/scalaris,scalaris-team/scalaris,jvf/scalaris,scalaris-team/scalaris,caijieming-baidu/scalaris,jvf/scalaris,scalaris-team/scalaris,caijieming-baidu/scalaris,scalaris-team/scalaris,scalaris-team/scalaris,jvf/scalaris,scalaris-team/scalaris