Research On Optimization Of Block Chain Consensus Algorithm

Bitcoin utilizes the Nakamoto Consensus to achieve agreement on consistent set of transactions,in the permissionless setting,where anyone can participate in the proposed.With the development of blockchain,many other permissionless consensus protocols have been proposed.However,most of these protocols have inherent scalability limits.In this paper,we propose a practical new paradigm called Willow for achieving high throughput by constructing a new ledger(which achieves the promotion of throughput)based on an existing permissionless consensus protocol(which guarantees the security of the protocol).We provide an instantiation of this paradigm based on POW protocol.To increase the throughput further,we change the ledger from chain like structure to net like structure(extends the ledger from 1D to 2D)by permitting more than one miner to pack transactions.Thus,the upper bound of throughput is limited by the capacity of a single node,the size of packing-window(the number of packing nodes at the same time)and the band of network.At last,we analyze the security of Willow.In theory the security of Willow is depended on the security of the underlying consensus protocol.We proof that in the context of security of the underlying consensus,Willow persists common prefix and liveness.