Blockchain Architecture for Lightweight Storage

Aiming to address the shortcomings of traditional blockchain technologies, characterized by high storage redundancy and low transaction query efficiency, we propose a lightweight sender-based blockchain architecture (LSB). In this architecture, the linkage between blocks is associated with the user initiating the transaction, and the hash of the newly generated block is recorded in the user’s wallet, thereby facilitating transaction retrieval. Each user node must store only the blocks that pertain to it, significantly reducing storage costs. To ensure the normal operation of the system, the Delegated Proof of Stake based on Reputation and PBFT (RP-DPoS) consensus algorithm is employed, establishing a reputation model to select honest and reliable nodes for consensus participation while utilizing the Practical Byzantine Fault Tolerance (PBFT) algorithm to verify blocks. The experimental results demonstrate that LSB reduces storage overhead while enhancing the efficiency of querying and verifying transactions. Moreover, in terms of security, it decreases the likelihood of malicious nodes being designated as agent nodes, thereby increasing the chances of honest nodes being selected for consensus participation.