A file verification method, comprising: establishing a tree data structure according to a plurality of first hash values of a plurality of first electronic files (F1-F4); storing a first root hash value of the tree data structure into a block of a blockchain; generating a verification data comprising block information of the block, one of the first hash values and at least one first non-terminal hash value of the tree data structure for one of the first electronic files (F1-F4); and verifying a second electronic file according to the verification data, wherein the step of verifying the second electronic file according to the verification data comprises: performing hash processing to the second electronic file to generate a second hash value; performing hash processing according to the at least one first non-terminal hash value and one of the first hash values in the verification data and the second hash value to generate a second root hash value; and comparing the second root hash value with the first root hash value stored in the blockchain to verify the second electronic file, wherein the step of establishing the tree data structure according to the first hash values of the first electronic files (F1-F4) comprises: establishing a binary tree data structure according to the first hash values of the first electronic files (F1-F4) and at least one redundant complement value, wherein the redundant complement value comprises a predetermined string composed of numbers or letters, wherein the first electronic files (F1-F4) are stored in a plurality of user end devices in a distributed manner, and the file verification method further comprises: collecting the first hash values within a predetermined time interval, wherein the tree data structure is established every predetermined time interval; and sending the verification data to one of the user end devices. establishing a tree data structure according to a plurality of first hash values of a plurality of first electronic files (F1-F4); storing a first root hash value of the tree data structure into a block of a blockchain; generating a verification data comprising block information of the block, one of the first hash values and at least one first non-terminal hash value of the tree data structure for one of the first electronic files (F1-F4); and verifying a second electronic file according to the verification data, performing hash processing to the second electronic file to generate a second hash value; performing hash processing according to the at least one first non-terminal hash value and one of the first hash values in the verification data and the second hash value to generate a second root hash value; and comparing the second root hash value with the first root hash value stored in the blockchain to verify the second electronic file, wherein the step of establishing the tree data structure according to the first hash values of the first electronic files (F1-F4) comprises: establishing a binary tree data structure according to the first hash values of the first electronic files (F1-F4) and at least one redundant complement value, wherein the redundant complement value comprises a predetermined string composed of numbers or letters, wherein the first electronic files (F1-F4) are stored in a plurality of user end devices in a distributed manner, and the file verification method further comprises: collecting the first hash values within a predetermined time interval, wherein the tree data structure is established every predetermined time interval; and sending the verification data to one of the user end devices. collecting the first hash values within a predetermined time interval, wherein the tree data structure is established every predetermined time interval; and sending the verification data to one of the user end devices.