In section 2.1.4.1, > If m <= k, the right subtree entries D[k:n] only exist in the current > tree. We prove that the left subtree entries D[0:k] are consistent > and add a commitment to D[k:n]: > > SUBPROOF(m, D_n, b) = SUBPROOF(m, D[0:k], b) : MTH(D[k:n]) > >This 'b' is always 'false', right?
_______________________________________________ Trans mailing list [email protected] https://www.ietf.org/mailman/listinfo/trans
