256-bit unsigned big integer.
More...
#include <arith_uint256.h>
|
| uint32_t | pn [WIDTH] |
| | Big integer represented with 32-bit digits, least-significant first.
|
| static constexpr int | WIDTH |
256-bit unsigned big integer.
Definition at line 230 of file arith_uint256.h.
◆ arith_uint256() [1/3]
| arith_uint256::arith_uint256 |
( |
| ) |
|
|
constexprdefault |
◆ arith_uint256() [2/3]
| arith_uint256::arith_uint256 |
( |
const base_uint & | b | ) |
|
|
inlineconstexpr |
◆ arith_uint256() [3/3]
| arith_uint256::arith_uint256 |
( |
uint64_t | b | ) |
|
|
inlineconstexpr |
◆ GetCompact()
| uint32_t arith_uint256::GetCompact |
( |
bool | fNegative = false | ) |
const |
◆ SetCompact()
| arith_uint256 & arith_uint256::SetCompact |
( |
uint32_t | nCompact, |
|
|
bool * | pfNegative = nullptr, |
|
|
bool * | pfOverflow = nullptr ) |
The "compact" format is a representation of a whole number N using an unsigned 32bit number similar to a floating point format.
The most significant 8 bits are the unsigned exponent of base 256. This exponent can be thought of as "number of bytes of N". The lower 23 bits are the mantissa. Bit number 24 (0x800000) represents the sign of N. N = (-1^sign) * mantissa * 256^(exponent-3)
Satoshi's original implementation used BN_bn2mpi() and BN_mpi2bn(). MPI uses the most significant bit of the first byte as sign. Thus 0x1234560000 is compact (0x05123456) and 0xc0de000000 is compact (0x0600c0de)
Bitcoin only uses this "compact" format for encoding difficulty targets, which are unsigned 256bit quantities. Thus, all the complexities of the sign bit and using base 256 are probably an implementation accident.
Definition at line 175 of file arith_uint256.cpp.
◆ ArithToUint256
◆ UintToArith256
The documentation for this class was generated from the following files: