# US 2025/0097255 A1 · System and method for organizing operation of a client-directed distributed network and a node and a client in a client-directed distributed network > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2025/0097255 A1 - Document ID: US20250097255A1 - Status: Published application - Kind: A1 - Application number: 18/848,305 - Filed: 2023-03-17 - Published: 2025-03-20 - Earliest claimed: 2022-03-18 - Assignees: Dandelion Networks Inc. - Applicants: Dandelion Networks Inc. - Inventors: Paul CHAFE; Dixin XU - Web page: https://patentgrep.com/patent/US20250097255A1 ## CPC - H04L 63/1441: {Countermeasures against malicious traffic (countermeasures against attacks on cryptographic mechanisms H04L9/002)} - H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS] - H04L 69/40: for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract There is provided a distributed network and method for organizing operation of a distributed network, and a node and client for the distributed network. The method including: directing each client to communicate a request for state transition to the nodes; directing the nodes to evaluate the validity of each request received from each client; directing each node to change a state associated with the clients that sent the validated request to a pre-commitment state, and communicate to the client a signed acknowledgement that the request has been validated; directing the clients that received signed acknowledgments to collate all the signed acknowledgments received from the nodes; where the client has collated signed acknowledgments from at least a predetermined number of nodes, directing the client to communicate the collated acknowledgements to the nodes; and directing each node to advance the state associated with each client that communicated collated acknowledgements. ## Claims ### Claim 1 A method for organizing operation of a distributed network, the distributed network comprising a plurality of nodes and a plurality of clients in communication, the method executed on at least one of a computing device of one or more of the nodes, a computing device of one or more of the clients, or another computing device, the method comprising: directing each client, which desires to transition a state associated with the client, to communicate a request for state transition to the nodes; directing the nodes to evaluate the validity of each request received from each client; directing each node, which has validated the request, to change a state associated with the clients that sent the validated request to a pre-commitment state, and communicate to the client, which communicated the validated request, a signed acknowledgement that the request has been validated; directing the clients that received signed acknowledgments to collate all the signed acknowledgments received from the nodes; where the client has collated signed acknowledgments from at least a predetermined s of nodes, directing the client to communicate the collated acknowledgements to the nodes; and directing each node to advance the state associated with each client that communicated collated acknowledgements from the pre-commitment state to a next state. ### Claim 2 (depends on 1) The method of claim 1, wherein the predetermined number of nodes comprises a sufficient majority as determined under a byzantine fault tolerant or asynchronous byzantine fault tolerant consensus scheme. ### Claim 3 (depends on 1) The method of claim 1, wherein a history of states for each client is recorded in a cryptographically linked hash chain, merkle structure, or graph. ### Claim 4 (depends on 1) The method of claim 1, wherein the state of each client is maintained on at least a portion of the nodes based on a token account. ### Claim 5 (depends on 1) The method of claim 1, wherein state transitions are charged against the token account at a fixed rate or at a rate based on computing work or resources. ### Claim 6 (depends on 1) The method of claim 1, wherein the nodes are assigned into shards, each shard maintaining states for a subset of the clients of the distributed network. ### Claim 7 (depends on 1) The method of claim 1, wherein where state transitions are divided into sending and receiving halves, and wherein the receiving halves are buffered on the nodes against the state of the client that is desirous to transition the state. ### Claim 8 (depends on 1) The method of claim 1, wherein directing the nodes to evaluate the validity of each request received from each client comprises using an ACID (atomicity, consistency, isolation, durability) paradigm. ### Claim 9 (depends on 1) The method of claim 1, wherein the state transitions can include Precommit, Preabort, Update, Commit, or Abort. ### Claim 10 A method for operating a node on a distributed network, the node executed on a computing device, the method comprising: receiving a state transition request associated with a client on the distributed network; evaluating the validity of the request received from the client; where the request is valid, changing a state associated with the client to a pre-commitment state, and communicating a signed acknowledgement that the request has been validated to the client; receiving, from the client, collated acknowledgements from at least a predetermined number of nodes; and advancing the state associated with the client from the pre-commitment state to a next state. ### Claim 11 (depends on 10) The method of claim 10, wherein the predetermined number of nodes comprises a sufficient majority as determined under a byzantine fault tolerant or asynchronous byzantine fault tolerant consensus scheme. ### Claim 12 (depends on 10) The method of claim 10, wherein state transitions are charged against a token account associated with the client at a fixed rate or at a rate based on computing work or resources. ### Claim 13 (depends on 10) The method of claim 10, wherein the node is assigned a shard, where each shard maintains states for a subset of the clients of the distributed network. ### Claim 14 (depends on 10) The method of claim 10, wherein where state transitions are divided into sending and receiving halves, and wherein the receiving halves are buffered on the node against the state of the client. ### Claim 15 (depends on 10) The method of claim 10, wherein evaluating the validity of the request comprises using an ACID (atomicity, consistency, isolation, durability) paradigm. ### Claim 16 (depends on 10) The method of claim 10, wherein the state transitions can include Precommit, Preabort, Update, Commit, or Abort. ### Claim 17 A method for operating a client on a distributed network, the client executed on a computing device, the method comprising: where the client desires to transition a state associated with the client, communicating a request for state transition to nodes on the distributed network; received a signed acknowledgement that the state transition request has been validated from a plurality of the nodes; where signed acknowledgments have been received from at least a predetermined number of nodes, collating the signed acknowledgments received from the plurality of nodes; and communicating the collated acknowledgements to the nodes to advance the state associated with the client to a next state. ### Claim 18 (depends on 17) The method of claim 17, wherein state transitions are divided into sending and receiving halves, and wherein the receiving halves are buffered on the nodes against the state of the client. ### Claim 19 (depends on 17) The method of claim 17, wherein a history of states for the client is recorded in a cryptographically linked hash chain, merkle structure, or graph. ### Claim 20 (depends on 1) A distributed network comprising nodes and clients, the distributed network organized in accordance with the method of claim 1.