Estimable proof-of-work for blockchain
A method for calculating a number of proof-of-work to measure how much work has been done in one block mining, includes the following steps: using a low hash, wherein the low hash value corresponding to a low nonce is not greater than a predetermined target value; using a high hash, wherein the high hash value corresponding to a high nonce is higher than the same target value; and calculating the number of proof-of-work according to the low hash value and the high hash value. The low hash value is the lowest hash value in one block mining. The high hash value is the highest hash value in the same block mining.
1. A method related to two numbers of proof-of-work in one block mining, the method being executed in a computer connected to a network, the method comprising:
converting a proof-of-work of a block for one block mining into an estimable proof-of-work of the block, comprising:
obtaining a low hash value in the blocking mining, wherein the low has value corresponding to a low nonce is not greater than a predetermined target value, and the low hash value is generated by using the low nonce in a hash function of the block mining;
obtaining a high hash value in the same block mining, wherein the high hash value corresponding to a high nonce is higher than the predetermined target value, and the high hash value is generated by using the high nonce in the hash function of the block mining; and
determining a number of the estimable proof-of-work according to the low hash value, the high hash value, and a closed-form formula, wherein the number of the estimable proof-of-work indicates an estimated computing power; and
rejecting the block according to the estimated computing power;
wherein the low hash value is the lowest hash value in the block mining, the high hash value is the highest hash value in the same block mining;
wherein the estimated computing power in the block is determined according to a range between the low hash value and the high hash value;
wherein a probability of the low hash value and the high hash value at the number of nonce trials is used for estimating the number of average nonce trials in the block mining;
wherein the probability of the low hash value and the high hash value at the number of trials is determined as the following closed-form formula:
{
p
m
,
i
=
j
(
n
m
-
2
(
n
-
1
)
m
+
(
n
-
2
)
m
)
p
m
,
otherwise
wherein, i is the lowest hash value, j is the highest hash value, 1≤i≤j≤N, N is an integer larger than 2, n is the range and n=j−i+1, m is the number of nonce trials, indicating how much work has been done in the block mining.
2. The method related to two numbers of proof-of-work in one block mining of claim 1 , wherein assume a probability of m-th nonce trial is a constant, the probability of nonce trials on given i and j is determined according to the following formula:
P(m|i,j)({tilde over (=)}P(i,j|m)*/P′(i,j)=P(u,j|m)/P(i,j);
wherein
P
′
(
i
,
j
)
=
∑
m
=
1
∞
P
(
i
,
j
|
m
)
P
(
m
)
and
P
(
i
,
j
)
=
∑
m
=
1
∞
P
(
i
,
j
|
m
)
P
(
m
)
;
wherein P(m) is the probablity of m-th nonce trial, P(m|i,j) is the probability of nonce trials on given i and j, P(i,j in) is the probability of given i and j at the m-th trial.
3. The method related to two numbers of proof-of-work in one block mining of claim 2 , wherein the number of average nonce trials in the block mining is determined according to the following formula:
m
_
=
∑
m
=
1
∞
mP
(
m
|
i
,
j
)
.