mirror of https://github.com/zcash/zips.git
Minor refinements. refs #14
Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
parent
c478fa1299
commit
4c062451d3
Binary file not shown.
|
@ -754,7 +754,7 @@ The \merkleLayer numbered $h$, counting from \merkleLayer $0$ at the \merkleRoot
|
||||||
$2^h$ \merkleNodes with \merkleIndices $0$ to $2^h-1$ inclusive. Let $\MerkleNode{h}{i}$
|
$2^h$ \merkleNodes with \merkleIndices $0$ to $2^h-1$ inclusive. Let $\MerkleNode{h}{i}$
|
||||||
be the hash associated with the \merkleNode at \merkleIndex $i$ in \merkleLayer $h$.
|
be the hash associated with the \merkleNode at \merkleIndex $i$ in \merkleLayer $h$.
|
||||||
|
|
||||||
Parent \merkleNodes are computed from their children as follows. For $0 \leq h < d$
|
Parent \merkleNodes are computed from their children as follows. For $0 \leq h < \MerkleDepth$
|
||||||
and $0 \leq i < 2^h$,
|
and $0 \leq i < 2^h$,
|
||||||
|
|
||||||
\newsavebox{\merklebox}
|
\newsavebox{\merklebox}
|
||||||
|
@ -771,7 +771,8 @@ When a \noteCommitment is added to the tree, it occupies the \merkleLeaf
|
||||||
$\MerkleNode{\MerkleDepth}{i}$ for the next available $i$. As-yet unused
|
$\MerkleNode{\MerkleDepth}{i}$ for the next available $i$. As-yet unused
|
||||||
\merkleLeaves are encoded as the sequence of 32 zero bytes.
|
\merkleLeaves are encoded as the sequence of 32 zero bytes.
|
||||||
|
|
||||||
A \merklePath from \merkleLeaf $i$ in the \incrementalMerkleTree is the sequence
|
A \merklePath from \merkleLeaf $\MerkleNode{\MerkleDepth}{i}$ in the
|
||||||
|
\incrementalMerkleTree is the sequence
|
||||||
|
|
||||||
\hskip 2em $[\MerkleNode{h}{\MerkleSibling(h, i)} \text{ for }
|
\hskip 2em $[\MerkleNode{h}{\MerkleSibling(h, i)} \text{ for }
|
||||||
h \text{ from } \MerkleDepth \text{ down to } 1]$,
|
h \text{ from } \MerkleDepth \text{ down to } 1]$,
|
||||||
|
@ -781,7 +782,8 @@ where
|
||||||
\hskip 2em $\MerkleSibling(h, i) = \floor\left(\frac{i}{2^{\MerkleDepth-h}}\right) \xor 1$
|
\hskip 2em $\MerkleSibling(h, i) = \floor\left(\frac{i}{2^{\MerkleDepth-h}}\right) \xor 1$
|
||||||
|
|
||||||
and $\xor$ denotes bitwise exclusive or. Given such a \merklePath, it is
|
and $\xor$ denotes bitwise exclusive or. Given such a \merklePath, it is
|
||||||
possible to verify that the \merkleLeaf is in a tree with a given \merkleRoot.
|
possible to verify that \merkleLeaf $\MerkleNode{\MerkleDepth}{i}$ is in a tree
|
||||||
|
with a given \merkleRoot $\rt = \MerkleNode{0}{0}$.
|
||||||
|
|
||||||
|
|
||||||
\subsection{\NullifierSet}
|
\subsection{\NullifierSet}
|
||||||
|
|
Loading…
Reference in New Issue