mirror of https://github.com/zcash/zips.git
The Equihash parameters are *probably* final now.
Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
parent
43145ed6ba
commit
5c46c915d3
|
@ -2658,8 +2658,7 @@ A \block satisfies the Proof of Work if and only if:
|
|||
An instance of the Equihash algorithm is parameterized by positive integers $n$ and $k$,
|
||||
such that $n$ is a multiple of $k+1$. We assume $k \geq 3$.
|
||||
|
||||
The Equihash parameters for the production network are $n = 200, k = 9$.
|
||||
\todo{These may not be final.}
|
||||
The Equihash parameters for the production and test networks are $n = 200, k = 9$.
|
||||
|
||||
The Generalized Birthday Problem is defined as follows: given a sequence
|
||||
$X_{1..\mathrm{N}}$ of $n$-bit strings, find $2^k$ distinct $X_{i_j}$ such that
|
||||
|
|
Loading…
Reference in New Issue