A transaction verification system that, when in operation, verifies and provides tamper-proof recordation of data entities of one or more transactions in a blockchain, wherein the system comprises a plurality of computing nodes that are mutually communicatively coupled via a data communication network to exchange data therebetween, wherein a given computing node of the plurality of computing nodes is able to verify a presence of the one or more transactions in the blockchain, wherein each computing node executes a pre-processing operation to obtain and store therein a corresponding bloom block, wherein the bloom blocks of the computing nodes are different from any block of the blockchain, wherein, via its bloom block, each computing node includes a plurality of root hashes of a plurality of bloom trees and a distributed bloom filter, wherein the plurality of bloom trees have distributed bloom filters that are distributed within the plurality of computing nodes, wherein the distributed bloom filters define a set of transactions, and the plurality of bloom trees are associated with different distributed bloom filters spread across the plurality of computing nodes, wherein, in order to verify a presence of a first transaction of the one or more transactions, a given computing node of the plurality of computing nodes initiates an interactive proof by interacting with a specified number of computing nodes from the plurality of computing nodes, wherein the interactive proof is initiated post-completion of the pre-processing operation at each computing node, and wherein the given computing node initiates the interactive proof by: (i) communicating a request for a multi-proof to the specified number of computing nodes from the plurality of computing nodes; and (ii) obtaining a proof of absence from one of the specified number of computing nodes, or proofs of presence from the specified number of computing nodes, to verify the presence of the first transaction, wherein verifying the presence of the first transaction is performed without storing a copy of the blockchain in the plurality of computing nodes to reduce memory use in each of the plurality of computing nodes. wherein the system comprises a plurality of computing nodes that are mutually communicatively coupled via a data communication network to exchange data therebetween, wherein a given computing node of the plurality of computing nodes is able to verify a presence of the one or more transactions in the blockchain, wherein each computing node executes a pre-processing operation to obtain and store therein a corresponding bloom block, wherein the bloom blocks of the computing nodes are different from any block of the blockchain, wherein, via its bloom block, each computing node includes a plurality of root hashes of a plurality of bloom trees and a distributed bloom filter, wherein the plurality of bloom trees have distributed bloom filters that are distributed within the plurality of computing nodes, wherein the distributed bloom filters define a set of transactions, and the plurality of bloom trees are associated with different distributed bloom filters spread across the plurality of computing nodes, wherein, in order to verify a presence of a first transaction of the one or more transactions, a given computing node of the plurality of computing nodes initiates an interactive proof by interacting with a specified number of computing nodes from the plurality of computing nodes, wherein the interactive proof is initiated post-completion of the pre-processing operation at each computing node, and wherein the given computing node initiates the interactive proof by: (i) communicating a request for a multi-proof to the specified number of computing nodes from the plurality of computing nodes; and (ii) obtaining a proof of absence from one of the specified number of computing nodes, or proofs of presence from the specified number of computing nodes, to verify the presence of the first transaction, (i) communicating a request for a multi-proof to the specified number of computing nodes from the plurality of computing nodes; and (ii) obtaining a proof of absence from one of the specified number of computing nodes, or proofs of presence from the specified number of computing nodes, to verify the presence of the first transaction, wherein verifying the presence of the first transaction is performed without storing a copy of the blockchain in the plurality of computing nodes to reduce memory use in each of the plurality of computing nodes.