| CPC G06N 7/01 (2023.01) [G06F 9/466 (2013.01); G06F 9/4887 (2013.01); G06F 9/522 (2013.01)] | 18 Claims |
|
7. A method comprising:
obtaining a first acyclic graph including multiple nodes and multiple edges connecting the multiple nodes,
wherein a process to create a weave of the first acyclic graph produces a matching weave when executed on the first acyclic graph by two different computing devices among multiple computing devices in a network,
wherein an addition of a node to the multiple nodes associated with the first acyclic graph produces a second acyclic graph, and
wherein the addition of the node to the first acyclic graph changes the weave of the first acyclic graph;
obtaining a process to reach a global consensus among the multiple computing devices,
wherein the process indicates a criterion associated with the multiple computing devices to satisfy prior to reaching the global consensus;
determining whether the multiple computing devices in the network satisfy the criterion;
upon determining that the multiple computing devices in the network satisfy the criterion, adding a finalize node to the first acyclic graph to obtain a third acyclic graph,
wherein a weave of the third acyclic graph cannot change;
obtaining the weave of the first acyclic graph,
wherein each node in the weave indicates the node and a user associated with the node;
evaluating whether the user associated with the node has a permission to issue the node;
upon determining that the user associated with the node does not have the permission to issue the node, refusing to execute the node; and
preventing the node from being executed by protecting the weave and issuing the finalize node.
|