A verifiable query scheme with rich query capabilities and low storage redundancy on blockchain

In current blockchain verifiable query research, redundant storage of data to be indexed is often required to enable efficient and feature-rich query algorithms. However, most blockchains currently face the problem of rapid data growth, leading to significant storage resource consumption by nodes. To provide a high-efficiency and generic verifiable query capability while reducing the storage burden on nodes, we propose a cryptographic accumulator-based verifiable generic query scheme. By skilfully establishing a logical relationship between the cryptographic accumulation value and the proof of element members, our scheme effectively reduces the redundant design of data structures on the chain. Additionally, we design a filter aggregation algorithm, an inter-block indexing structure, and a range query method that transforms the numerical attribute comparison problem into a proof-of-existence problem for members in a collection based on this scheme. Security analysis and experimental analysis verify the robustness and practicality of the proposed techniques.