Abstract
Aiming at the problems of high cost of capital operation, complex and changeable financial operation process, opaque transaction information, tracing of settlement process and difficult information storage in the existing project settlement scenario, the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm is improved. By combining the ideas of Dynamic Grouping Practical Byzantine Fault Tolerance algorithm and Evolution of Practical Byzantine Fault Tolerance, a Confidence Selection Practical Byzantine Fault Tolerance (CONS-PBFT) algorithm is proposed. By introducing a confidence mechanism, Byzantine Fault Tolerance algorithm optimizes the consensus process of the PBFT algorithm. The experiments show that the CONS-PBFT algorithm not only can significantly improve the consensus efficiency, but also can effectively solve various problems involved in the current engineering settlement tasks. Thus, a credible and cooperative, safe and transparent engineering settlement method can be realized.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
