d0s3t3ch/wownero
1
0
Fork 0
mirror of https://git.wownero.com/wownero/wownero.git synced 2024-08-15 01:03:23 +00:00
Code Issues Projects Releases Wiki Activity

fix signed unsigned conversion

Browse source
This commit is contained in:
wowario 2018-04-23 19:43:04 +03:00
parent 9aa886beda
commit ba9b3220f7
No known key found for this signature in database
GPG key ID: 24DCBE762DE9C111
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/cryptonote_basic/difficulty.cpp
View file

@ -219,11 +219,11 @@ namespace cryptonote {
uint64_t difficulty(0), next_difficulty(0); uint64_t difficulty(0), next_difficulty(0);
// Loop through N most recent blocks. N is most recently solved block. // Loop through N most recent blocks. N is most recently solved block.
for (int64_t i = 1; i <= N; i++) { for (size_t i = 1; i <= N; i++) {
solveTime = static_cast<int64_t>(timestamps[i]) - static_cast<int64_t>(timestamps[i - 1]); solveTime = static_cast<int64_t>(timestamps[i]) - static_cast<int64_t>(timestamps[i - 1]);
solveTime = std::min<int64_t>((T * 7), std::max<int64_t>(solveTime, (-7 * T))); solveTime = std::min<int64_t>((T * 7), std::max<int64_t>(solveTime, (-7 * T)));
difficulty = cumulative_difficulties[i] - cumulative_difficulties[i - 1]; difficulty = cumulative_difficulties[i] - cumulative_difficulties[i - 1];
LWMA += solveTime * i / k; LWMA += (int64_t)(solveTime * i) / k;
sum_inverse_D += 1 / static_cast<double>(difficulty); sum_inverse_D += 1 / static_cast<double>(difficulty);
} }