FRTB-Fast Blockchain architecture based on block data and data protection system’s file partition tables

At the beginning of its birth, Blockchain technology solved the "Byzantine general" technology to realize the distributed consensus mechanism, data traceability and other functions in the insecure and untrusted network environment. The earliest application of Blockchain consensus mechanism started from the proof-of-work(PoW) mechanism of Bitcoin application in 2008, but PoW has low service throughput and low performance. The subsequent PoS, DPoS, and Practical Byzantine (PBFT) and other new consensus mechanisms are based on the performance improvement of distributed consensus to improve the Blockchain tampering, low performance and other problems. These consensus mechanisms require a lot of computation for distributed consensus. These also bring the possibility of Sybil Attack and Double Spend Attack by malicious nodes, and the node malicious attack events facing the Blockchain are also increasing. Based on this, this paper proposes a fast Blockchain architecture FRTB, which based on block data and data protection storage file partition table(FAT). On the basis of the original Blockchain architecture, the architecture adds block Data Protection system and block data storage file partition table information, which has a direct role in Blockchain’s traceability and tamper-proof. It has the characteristics of physical tamper-proof, traceability, fast distributed consensus and so on.