Research On Consensus Algorithm Based On Proof Of Space

Bitcoin has received widespread attention due to its use of blockchain to realize the transfer of trusted value in untrusted networks.The consensus algorithm designed with proof of work in Bitcoin provides security for data storage,but the intensive calculation of proof of work will bring a lot of power wasting,so finding alternative technologies for proof of work has become a research hotspot.The proof of space is considered to be a great alternative solution because it can generate a proof by storage resources to avoid the power wasting.However,the current proof of space technology has problems such as large interactive data,low verification efficiency,and large auxiliary information space,and it is necessary to solve the problem of bookkeeping rights competition and noting at stake by too fast proof generation in the process of applying to consensus algorithms.In response to the above problems,this paper studies a consensus algorithm based on proof of space.Research is divided into two aspects,namely,the performance optimization in proof of space and the design of consensus algorithm based on proof of space.In terms of the performance optimization in proof of space,based on the two-stage agreement of proof of sapce,the accumulator technology is used to realize random file commitment by replacing the Merkle tree,and the proof of space based on the accumulator commitment is proposed.In terms of the design of consensus algorithm based on the proof of space,the solution to the problem of bookkeeping competition and noting at stake problems is proposed.The design adopts the ideas of block quality in Space Mint and it is modified to solve the problem of competition for bookkeeping rights.For solving noting at stake,the analysis is mainly from block griding attacks,long-range attacks,and multi-chain mining.In order to deal with block grinding attacks,the generation process of random challenges is specified;for long-range attacks,the idea of chain quality in Space Mint is adopted,and the Sigmoid function is introduced to modify the calculation method of chain quality to adapt to the "difficulty of obtaining smaller quality values in different periods”;for multi-chain mining,use accumulators and serial hash calculations to design verifiable delay function to increase the time while achieving resistance to application specific integrated circuit for block generation.Compared with the proof of space based on Merkle tree commitment,the proof of space quantity based on accumulator commitment reduces the incremental complexity of the verifying time and the amount of interaction data to a constant level,and the auxiliary information space occupation is also reduced to a constant level when a small amount of calculation is allowed.In addition,with the solution of the problem of competing accounting rights and nothing at stake,the consensus algorithm based on the proof of space quantity is designed.