Ecosystem/p2pool
1
0
Fork 0
mirror of https://github.com/SChernykh/p2pool.git synced 2024-11-16 15:57:39 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 9

check_pow: fixed carry calculation

Browse source
This commit is contained in:
SChernykh 2021-08-28 11:50:20 +02:00
parent 9662428d33
commit 46ce4ebee7
1 changed files with 8 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
src/util.cpp
View file

@ -73,8 +73,10 @@ NOINLINE bool difficulty_type::check_pow(const hash& pow_hash) const
uint64_t carry = 0;
for (int k = i, l = 0; k < 5; ++k, ++l) {
const uint64_t t = result[k] + product[l] + carry;
carry = static_cast<uint64_t>(t < result[k]);
uint64_t t = result[k] + product[l];
const uint64_t next_carry = static_cast<uint64_t>(t < result[k]);
t += carry;
carry = next_carry | static_cast<uint64_t>(t < result[k]);
result[k] = t;
}
@ -92,8 +94,10 @@ NOINLINE bool difficulty_type::check_pow(const hash& pow_hash) const
uint64_t carry = 0;
for (int k = i + j, l = 0; k < 6; ++k, ++l) {
const uint64_t t = result[k] + product[l] + carry;
carry = static_cast<uint64_t>(t < result[k]);
uint64_t t = result[k] + product[l];
const uint64_t next_carry = static_cast<uint64_t>(t < result[k]);
t += carry;
carry = next_carry | static_cast<uint64_t>(t < result[k]);
result[k] = t;
}