Figure 13. Electrical connection diagram of boosting station
for photovoltaic power plant
Figure 14 shows screenshots of the simulation program in operation. In
Fig. 14(a), the detailed information of current block index, previous
block hash, Merkle root hash, signature value is presented in block
header information region. The signature is essentially a big random
integer in the program implementation, and P-PoW algorithm would select
the specific signature value to minimize the expression value ofHash (PreHash +Sig ). For the convenience of
validating P-PoW algorithm, the validation resultHash (PreHash +Sig )of current block is calculated and
shown below the region. However, it should be mentioned that the
validation result is not an entry existing in block header, it is only a
program calculation result to prove P-PoW algorithm works right in such
simulation.
In Fig. 14(b), the voltage and current sampling data are presented in
chronological order. In the simulation program, every entry of sampling
data includes information of station name, station ranking, measurement
device, measurement value, measurement time. In blockchain data
structure, all such information is organized by the form of byte
strings, so users can design their own data entry in the simulation
program as well.
The simulation screenshots in Fig. 14 show that the way the program
works is the same as in previous theoretical analysis, which proves the
validity of proposed P-PoW algorithm. The simulation program produces a
voltage sampling value and a current one every second, and such sampling
data are filled in block data region immediately. While data filling
process is autonomously executed, simulation program iteratively
searches the specific signature value which minimizesHash (PreHash +Sig ) value simultaneously. The longer
the program execution time is, the more optimized signature would be
found.