zec
/
zips
mirror of https://github.com/zcash/zips.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Minor refinements. refs #14 

Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
Daira Hopwood 2016-04-08 20:55:49 +01:00
parent c478fa1299
commit 4c062451d3
2 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
protocol/protocol.pdf
View File

Binary file not shown.

8
protocol/protocol.tex
View File

@ -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}$
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$,
\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
\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 }
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$
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}