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

Cosmetics. 

Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
Daira Hopwood 2016-12-19 21:11:18 +00:00
parent 31cc757c58
commit b60fb345df
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
protocol/protocol.tex
View File

@ -783,7 +783,7 @@ one valid \nullifier, and so attempting to spend a \note twice would reveal the
\nsection{Notation}
The notation $\bit$ means the type of bit values, i.e. $\setof{0, 1}$.
The notation $\bit$ means the type of bit values, i.e.\ $\setof{0, 1}$.
The notation $\Nat$ means the set of nonnegative integers. $\PosInt$
means the set of positive integers. $\Rat$ means the set of rationals.
@ -3467,7 +3467,7 @@ In more detail:
$[\NoteAddressRand]_{254}$, may repeat even if $\NoteAddressRand$ does not.
\item In the same argument, it is stated that ``with overwhelming probability,
$\hSig$ is unique''. In fact what is required to be unique is the
truncated input to $\PRFpk{}$, i.e. $[\hSig]_{253} = [\CRH(\pksig)]_{253}$.
truncated input to $\PRFpk{}$, i.e.\ $[\hSig]_{253} = [\CRH(\pksig)]_{253}$.
In practice this value will be unique under a plausible assumption on
$\CRH$ provided that $\pksig$ is chosen randomly, but no formal argument
for this is presented.