|
|
@ -2445,7 +2445,7 @@ of \libsnark, to ensure compatibility. |
|
|
|
\end{bytefield} |
|
|
|
\end{lrbox} |
|
|
|
|
|
|
|
Define $\ItoOSP \typecolon (k \typecolon \Nat) \times \range{0}{256^k\!-\!1} \rightarrow \range{0}{255}^k$ |
|
|
|
Define $\ItoOSP{} \typecolon (k \typecolon \Nat) \times \range{0}{256^k\!-\!1} \rightarrow \range{0}{255}^k$ |
|
|
|
such that $\ItoOSP{\ell}(n)$ is the sequence of $\ell$ bytes representing $n$ in |
|
|
|
big-endian order. |
|
|
|
|
|
|
@ -2602,7 +2602,7 @@ Software that creates \transactions{} \SHOULD use version 1 for \transactions wi |
|
|
|
|
|
|
|
\pnote{ |
|
|
|
A \transactionVersionNumber of 2 does not have the same meaning as in \Bitcoin, where |
|
|
|
it is associated with support for \texttt{OP\_CHECKSEQUENCEVERIFY} as specified in \cite{BIP-68}. |
|
|
|
it is associated with support for \ScriptOP{CHECKSEQUENCEVERIFY} as specified in \cite{BIP-68}. |
|
|
|
\Zcash was forked from \Bitcoin v0.11.2 and does not support BIP 68, or the related BIPs |
|
|
|
9, 112 and 113. |
|
|
|
} |
|
|
@ -2684,8 +2684,8 @@ ensuring that none of those \transactions can be modified without modifying the |
|
|
|
|
|
|
|
4 & $\nTime$ & \type{uint32\_t} & The \blockTime is a Unix epoch time when the miner |
|
|
|
started hashing the header (according to the miner). This \MUST be greater than or equal |
|
|
|
to the median time of the previous 11 blocks. \todo{has this changed?} A \fullnode{} \MUSTNOT |
|
|
|
accept \blocks with headers more than two hours in the future according to its clock. \\ \hline |
|
|
|
to the median time of the previous 11 blocks. A \fullnode{} \MUSTNOT accept \blocks with |
|
|
|
headers more than two hours in the future according to its clock. \\ \hline |
|
|
|
|
|
|
|
4 & $\nBits$ & \type{uint32\_t} & An encoded version of the target threshold this \block's |
|
|
|
header hash must be less than or equal to, in the same nBits format used by \Bitcoin. |
|
|
@ -2761,11 +2761,11 @@ For $i \in \range{1}{N}$, let $X_i = \EquihashGen{n, k}(\powheader, i)$. |
|
|
|
|
|
|
|
$\EquihashGen{}$ is instantiated in \crossref{equihashgen}. |
|
|
|
|
|
|
|
Define $\ItoBSP \typecolon (u \typecolon \Nat) \times \range{0}{2^u\!-\!1} \rightarrow \bitseq{u}$ |
|
|
|
Define $\ItoBSP{} \typecolon (u \typecolon \Nat) \times \range{0}{2^u\!-\!1} \rightarrow \bitseq{u}$ |
|
|
|
such that $\ItoBSP{u}(x)$ is the sequence of $u$ bits representing $x$ in |
|
|
|
big-endian order. |
|
|
|
|
|
|
|
Define $\BStoIP \typecolon (u \typecolon \Nat) \times \bitseq{u} \rightarrow \range{0}{2^u\!-\!1}$ |
|
|
|
Define $\BStoIP{} \typecolon (u \typecolon \Nat) \times \bitseq{u} \rightarrow \range{0}{2^u\!-\!1}$ |
|
|
|
such that $\BStoIP{u}$ is the inverse of $\ItoBSP{u}$. |
|
|
|
|
|
|
|
Define $\Xi_r(a, b) := \BStoIP{2^{r-1} \ell}(\concatbits(X_{i_{a..b}}))$. |
|
|
|