The issue of storage scalability is one of the main obstacles to blockchain development. A key factor causing this problem is the use of multiple replicas in blockchain systems to ensure data availability, which places significant storage pressure on nodes. Recently, coded blockchain approaches have leveraged erasure coding to reduce the storage complexity of blockchain nodes from O(N) to O(1), thereby minimizing storage redundancy. However, these methods still face challenges such as low efficiency in block access and high latency in data recovery. This paper proposes an efficient storage framework based on erasure coding, named Scalable Erasure Coding (SEC). The framework includes algorithms for data access and recovery in blockchain systems, achieving the following improvements: (1)Reducing block data storage complexity from O(N) to O(1), while increasing storage utilization by approximately 43%.(2)Lowering the average block reading latency by 11% by minimizing data transmission during block retrieval. (3)Enhancing block recovery efficiency by 47% using a collaborative repair strategy for encoded data.