System and a method implementing a directed acyclic graph (DAG) consensus algorithm via a gossip protocol

A system for exchanging information among distributed computer nodes connected in a specific network, through a Directed Acyclic Graph consensus algorithm which is a Hash graph consensus algorithm via gossip protocol, the system comprising:

• means for making a first given node select a second given node randomly and send reference information;
• the system being preferably characterized by:
• means for determining based on the reference information which node events are in front of the others;
• means for sending a cancellation information to the first given node, when the reference information implies that the events of the first given node are in front of the events of the second given node, thereby preventing, in consequence, the first given node from sending DAG-event information to the second given node;
• and
• means for making the first given node send DAG-event information to the second given node, when the reference information implies that the events of the second given node are in front of the events of the first given node, and
• means for making then the second given node send DAG-event information to the first given node and so on for other nodes, so as to synchronize and propagate the DAG event information through the network;
• wherein the first given node is configured to find the events which are in front of the events known by the second given node from the list of events received from the second given node, and collect this list of those events and send information back to the second given node and so on for other nodes, so as to synchronize and propagate the events information through the network;
• wherein the number of transactions between the nodes is limited via the cancellation information such that the node stops the communication of the information, thereby decreasing the use of computer resources in the calculations, storing and transmission of the information;
• wherein the reference information comprises a list of altitude values for each node, and wherein the reference information relates to the order of node events, and
• wherein the order of node events is determined by keeping track of an ordinate value of every event, and wherein the order of events are not based on time and do not need time consensus.

A network comprising one or more central unit, in particular, one or more computerized central unit, and connection(s) to additional command units implementing transactions, in particular, computerized command units, the central unit(s) comprising a system for exchanging information among distributed computer nodes connected in a specific network, by implementing a Directed Acyclic Graph consensus algorithm which is a Hash graph consensus algorithm via gossip protocol, the system comprising:

• means for making a first given node select a second given node randomly and send reference information;
• the system being preferably characterized by:
• means for determining based on the reference information which node events are in front of the others;
• means for sending a cancellation information to the first given node when the reference information implies that the events of the first given node are in front of the events of the second given node, thereby preventing, in consequence, the first given node from sending DAG-event information to the second given node;
• and
• means for making the first given node send DAG-event information to the second given node when the reference information implies that the events of the second given node are in front of the events of the first given node, and preferably, means for making then the second given node send DAG-event information to the first given node, and so on for other nodes, so as to synchronize and propagate the DAG event information through the network;
• wherein the first given node is configured to find the events which are in front of the events known by the second given node from the list of events received from the second given node, and collect this list of those events and send information back to the second given node and so on for other nodes, so as to synchronize and propagate the events information through the network;
• wherein the reference information comprises a list of altitude values for each node, and wherein the number of transactions between the nodes is limited via the cancellation information such that the node stops the communication of the information, thereby decreasing the use of computer resources in the calculations, storing and transmission of the information;
• wherein the reference information relates to the order of node events, and wherein the order of node events is determined by keeping track of an ordinate value of every event, and wherein the order of events are not based on time and do not need time consensus.