A system comprising a plurality of computing nodes (102A, 102B, 102C, 102D) that are communicably coupled to each other via a distributed communication network, wherein each computing node includes a processor (104A, 104B, 104C, 104D), wherein each computing node comprises a hash value of each data entity of pre-existing data entities therein, and wherein the system operates to provide verified recordal of data entities therein, to achieve a more stable, efficient and robust operation of the system, wherein the processor (104A, 104B, 104C, 104D) is configured to: - execute a first set of instructions on a nonce of a first computing node of the plurality of computing nodes (102A, 102B, 102C, 102D) and a nonce of a second computing node of the plurality of computing nodes (102A, 102B, 102C, 102D) to generate a first set of values; - execute a second set of instructions on the hash value of each pre-existing data entity of the first computing node and the first set of values, to generate a second set of values; - generate a data structure for the first computing node and the second computing node based on the second set of values and to transmit the data structure from the first computing node to the second computing node; - determine a mapping factor based on the data structure representative of whether or not the pre-existing data entities in the second computing node are consistent with respect to the pre-existing data entities in the first computing node; Characterised in that the processor is further configured to: - determine an inconsistency probability factor for each computing node of the plurality of computing nodes (102A, 102B, 102C, 102D) which have a mapping factor equal to 100 percent; and - transmit one or more data entities from the pre-existing data entities in the first computing node to the pre-existing data entities in the second computing node for each computing node of the plurality of computing nodes having mapping factor equal to 100 percent after a first iteration of the process, if the inconsistency probability factor of the given computing node is less than a threshold inconsistency probability factor and wherein the pre-existing data entities in the second computing node are considered to be consistent with the pre-existing data entities in the first computing node. - execute a first set of instructions on a nonce of a first computing node of the plurality of computing nodes (102A, 102B, 102C, 102D) and a nonce of a second computing node of the plurality of computing nodes (102A, 102B, 102C, 102D) to generate a first set of values; - execute a second set of instructions on the hash value of each pre-existing data entity of the first computing node and the first set of values, to generate a second set of values; - generate a data structure for the first computing node and the second computing node based on the second set of values and to transmit the data structure from the first computing node to the second computing node; - determine a mapping factor based on the data structure representative of whether or not the pre-existing data entities in the second computing node are consistent with respect to the pre-existing data entities in the first computing node; - determine an inconsistency probability factor for each computing node of the plurality of computing nodes (102A, 102B, 102C, 102D) which have a mapping factor equal to 100 percent; and - transmit one or more data entities from the pre-existing data entities in the first computing node to the pre-existing data entities in the second computing node for each computing node of the plurality of computing nodes having mapping factor equal to 100 percent after a first iteration of the process, if the inconsistency probability factor of the given computing node is less than a threshold inconsistency probability factor and wherein the pre-existing data entities in the second computing node are considered to be consistent with the pre-existing data entities in the first computing node.