Searchable encryption is a technique that enables searching operations without decryption, thereby facilitating secure search functionality while protecting privacy. We propose a blockchain-based verifiable multi-keyword ciphertext retrieval scheme to address the challenges of complex and inefficient result verification and the unreliability of third-party verification, which have long been obstacles to ranking searchable encryption schemes. This scheme constructs both index vectors and query vectors using the vector space model and the TF-IDF algorithm. It leverages the depth-first search algorithm combined with a pruning strategy, utilizing binary tree index structure to implement ranked keyword retrieval. To validate the integrity of the returned data, our scheme generates a root hash value for the collection of ciphertext based on a Merkle tree. Furthermore, the immutability characteristic of blockchain enhances the trustworthiness of the retrieval results. Finally, the security analysis and simulation experiments demonstrate the security and efficiency of our scheme.