|
@@ -439,12 +439,12 @@ The total memory consumed (in units M) is denoted ```G(N)```, and is simply the
|
|
|
```
|
|
|
G(N) = M * sum(i=1, N) TotalMemoryAtRound(i)
|
|
|
= M * sum(i=1, N) 2^(N-i) * (N-i)
|
|
|
- = M * 2^N (N-2) + 2
|
|
|
+ = M * (2^N (N-2) + 2)
|
|
|
```
|
|
|
|
|
|
Thus,
|
|
|
```
|
|
|
- G(N) = M * 2^N (N-2) + 2
|
|
|
+ G(N) = M * (2^N (N-2) + 2)
|
|
|
```
|
|
|
|
|
|
**NOTE**: For PascalCoin, ```N=5``` which results ```98``` units of memory for every single nonce. Choosing memory unit ```M=50kb``` results in approximately ```4.8MB``` per nonce. Quite low for a CPU, but bloats quickly for a GPU as mentioned below.
|