On Wed, 12 May 2021, Salz, Rich wrote:
There are still open open issues from Ben Kaduk's DISCUSS ballot, which I
listed in
https://mailarchive.ietf.org/arch/msg/trans/yFJRli55wJ68EcQy5H97b97t8yY/
One of them requires someone in the WG to confirm. The other two require more
input from Ben.
The two issues needing input from Ben seem to be thing Ben needs to act
on. So please disregard these from now as there is nothing we can do
there. That leaves only one issue unconfirmed:
In 2.1.4.1 “Generating a Consistency Proof”:
> 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?
Does “this b” mean the one on the right-hand side of the equal sign?
And if so, does the WG have an answer to the question?
I believe this refers to the table in 5.5 “Retrieve Merkle Inclusion
Proof, Signed Tree Head and Consistency Proof by Leaf Hash”:
Can one or two people from the WG please clarify this issue so we can cut a new
draft and start a WGLC.
Paul
_______________________________________________
Trans mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/trans
