From d1a6e2809d52e2e745bc107f238bedb177a119d9 Mon Sep 17 00:00:00 2001 From: Daira Hopwood Date: Fri, 22 Jun 2018 21:36:40 +0100 Subject: [PATCH] Say that Sprout interstitial treestates form a tree. Signed-off-by: Daira Hopwood --- protocol/protocol.tex | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/protocol/protocol.tex b/protocol/protocol.tex index 24a42afa..8f0cade1 100644 --- a/protocol/protocol.tex +++ b/protocol/protocol.tex @@ -2536,7 +2536,9 @@ For each \joinSplitDescription in a \transaction, an interstitial output \treest constructed which adds the \noteCommitments and \nullifiers specified in that \joinSplitDescription to the input \treestate referred to by its \anchor. This interstitial output \treestate is available for use as the \anchor of subsequent -\joinSplitDescriptions in the same \transaction. +\joinSplitDescriptions in the same \transaction. In general, therefore, the set +of interstitial \treestates associated with a \transaction forms a tree in which +the parent of each node is determined by its \anchor. Interstitial \treestates are necessary because when a \transaction is constructed, it is not known where it will eventually appear in a mined \block. Therefore the @@ -9426,6 +9428,7 @@ Peter Newell's illustration of the Jubjub bird, from \cite{Carroll1902}. \item Remove the consensus rule ``If $\nJoinSplit > 0$, the \transaction{} \MUSTNOT use \sighashTypes other than $\SIGHASHALL$.'', which was never implemented. + \item Clarify that interstitial \treestates form a tree for each \transaction containing \joinSplitDescriptions. \item Clarify the wording of the caveat\footnoteref{securitycaveat} about the claimed security of shielded \transactions. \item Correct the definition of set difference ($S \setminus T$).