mirror of https://github.com/zcash/zips.git
Define Leading and Trailing functions.
Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
parent
592c06c263
commit
ce6109f730
|
@ -97,6 +97,8 @@
|
|||
\newcommand{\cmNew}[1]{\mathsf{{cm}^{new}_\mathnormal{#1}}}
|
||||
\newcommand{\InternalHashK}{\mathsf{k}}
|
||||
\newcommand{\InternalHash}{\mathsf{InternalH}}
|
||||
\newcommand{\Leading}[1]{\mathtt{Leading}_{#1}}
|
||||
\newcommand{\Trailing}[1]{\mathtt{Trailing}_{#1}}
|
||||
|
||||
% merkle tree
|
||||
\newcommand{\MerkleDepth}{\mathsf{d}}
|
||||
|
@ -171,8 +173,17 @@ protected by zero-knowledge succinct non-interactive arguments of knowledge
|
|||
All integers visible in \Zcash-specific encodings are unsigned, have a fixed
|
||||
bit length, and are encoded as big-endian.
|
||||
|
||||
In bit layout diagrams, bits are ordered from left to right with the most
|
||||
significant bits in each byte first.
|
||||
In bit layout diagrams, each box of the diagram represents a sequence of bits.
|
||||
If the content of the box is a byte sequence, it is implicitly converted to
|
||||
a sequence of bits using big endian order. The bit sequences are then
|
||||
concatenated in the order shown from left to right, and the result is converted
|
||||
to a sequence of bytes, again using big-endian order.
|
||||
|
||||
$\Leading{k}(x)$, where $k$ is an integer and $x$ is a bit sequence, returns
|
||||
the leading (initial) $k$ bits of its input.
|
||||
|
||||
$\Trailing{k}(x)$, where $k$ is an integer and $x$ is a bit sequence, returns
|
||||
the trailing (final) $k$ bits of its input.
|
||||
|
||||
\subsection{Cryptographic Functions}
|
||||
|
||||
|
|
Loading…
Reference in New Issue