Granted Patent B2

US 12,379,902 · App. 17/015,071 · Granted Aug 5, 2025

Inventor: Edward Hunter (Gaithersburg, MD)

Assignee: Digital Asset Capital, Inc.

G06F8/33G06F8/65G06F9/547G06F16/1858G06F16/23G06F16/9024G06F16/904G06F16/951G06F17/18G06N3/048G06N3/08G06N3/086H04L9/3263H04L67/133H04L9/50

Abstract

Claims (99)

1. A tangible, non-transitory, machine-readable medium storing instructions that, when executed by a computing system, effectuate operations comprising:

obtaining, with a computing system, program state of a self-executing protocol, wherein the program state encodes:

a set of conditional statements;

a set of entities, wherein the set of entities comprises a first entity;

a directed graph, the directed graph comprising:

a set of vertices, wherein each respective vertex of the set of vertices is associated with a respective category label of a set of mutually exclusive categories;

a set of directed edges connecting respective pairs of vertices among the set of vertices;

obtaining, with the computing system, an entity profile of the first entity, wherein:

the entity profile comprises a first graph portion template,

the first graph portion template comprises a first vertex template and an edge template,

the first vertex template is associated in memory with a first category label of the set of mutually exclusive category labels, and

the edge template specifies an edge direction to or from a vertex matching the first vertex template;

determining, with the computing system, whether the first graph portion template matches a graph portion in the directed graph based on a first vertex of the directed graph matching the first vertex template and a first directed edge of the directed graph matching the edge template;

determining, with the computing system, an outcome score based on the first graph portion template matching the graph portion in the directed graph;

determining, with the computing system, whether the outcome score satisfies an outcome score threshold; and

in response to the outcome score satisfying the outcome score threshold, storing, with the computing system, a value indicating that the outcome score satisfies the outcome score threshold.

2. The medium of claim 1 , wherein:

the set of vertices are a set of norm vertices;

the first vertex is a first norm vertex;

the set of entities include parties to the self-executing protocol;

the operations further comprising:

obtaining a plurality of self-executing protocols comprising a plurality of directed graphs, wherein each respective directed graph of the plurality of directed graphs is associated with a respective set of entities that comprises the first entity;

determining the first graph portion template based on the plurality of directed graphs, wherein a second norm vertex of the plurality of directed graphs matches the first norm vertex template of the first graph portion template, and wherein a condition of the second norm vertex is indicated to have been failed by the first entity based on an event message; and

determining an outcome determination parameter based on a number of times that the first graph portion template matches with a respective graph portion in the plurality of self-executing protocols, wherein determining the outcome score comprises determining the outcome score based on the outcome determination parameter.

3. The medium of claim 1 , the operations further comprising:

obtaining a plurality of self-executing protocols comprising a plurality of directed graphs, wherein each respective self-executing protocol of the plurality of self-executing protocols comprises a respective directed graph of the plurality of directed graphs;

determining the first graph portion template based on the plurality of self-executing protocols, wherein a second vertex of a second directed graph of the plurality of directed graphs matches the first vertex template, and wherein a third vertex of the plurality of directed graphs matches a second vertex template, and wherein a condition of the third vertex is indicated as having been satisfied based on an event message; and

determining an outcome determination parameter based on a number of times that the first graph portion template matches with a respective graph portion in the plurality of self-executing protocols, wherein determining the outcome score comprises determining the outcome score based on the outcome determination parameter.

4. The medium of claim 1 , wherein the entity profile is a first entity profile, and wherein the operations further comprise:

determining a transaction score based on the directed graph, wherein the transaction score is associated with a transaction between the first entity and a second entity; and

updating an association between the first entity profile and a second entity profile based on the transaction score, wherein the second entity profile is associated with the second entity.

5. The medium of claim 1 , the operations further comprising:

determining whether the first entity has failed a conditional statement associated with a second vertex of the directed graph; and

in response to a determination that the first entity has failed the conditional statement, updating an entity score of an entity graph, wherein the entity score is associated with the first entity, and wherein the entity graph comprises a plurality of entity vertices, and wherein each respective entity vertex of the plurality of entity vertices is associated with a respective entity profile.

6. The medium of claim 5 , wherein the entity graph is stored on a distributed, tamper-evident ledger, and wherein updating the entity score comprises:

obtaining an encryption key associated with the first entity;

obtaining a previous entity score from the distributed, tamper-evident ledger based on the encryption key; and

updating the entity score based on the previous entity score.

7. The medium of claim 5 , wherein the entity graph is stored on a distributed, tamper-evident ledger, and wherein the operations further comprise:

determining whether the entity score satisfies an entity score threshold of a verification entity; and

in response to the entity score satisfying the entity score threshold, storing an indicator that the first entity satisfies the entity score threshold of the verification entity.

8. The medium of claim 5 , the operations further comprising:

determining whether the entity score satisfies an entity score threshold of a verification entity; and

sending a message to an application program interface, wherein the message indicates that the first entity satisfies the entity score threshold of the verification entity.

9. The medium of claim 5 , wherein the entity profile is a first entity profile, and wherein the operations further comprise:

determining a second entity score associated with the first entity, wherein the first entity profile does not comprise the second entity score;

obtaining a passkey value; and

in response to receiving the passkey value, sending a message comprising the second entity score.

10. The medium of claim 1 , wherein determining the outcome score comprises determining the outcome score using a neural network based on a feature set, wherein:

determining the feature set, wherein determining the feature set comprises determining whether the first graph portion template matches a graph portion in the directed graph; and

the neural network is trained on a plurality of directed graphs of a plurality of a self-executing protocols, wherein the first graph portion template matches a graph portion of a subset of the plurality of directed graphs.

11. The medium of claim 1 , wherein determining the outcome score comprises:

generating a set of embeddings based on a set of vertices of the directed graph, wherein each vertex of the set of vertices is associated with an embedding of the set of embeddings, and wherein each embedding comprises a vector;

determining a feature set based on the set of embeddings; and

determining the outcome score using a neural network based on the feature set.

12. The medium of claim 1 , wherein the entity profile is a first entity profile and the outcome score is a first outcome score, and wherein the operations further comprise:

obtaining a second entity profile, wherein the second entity profile is associated with a second entity, and wherein the second entity profile comprises the first graph portion template, and wherein a second outcome determination parameter is determined based on the first graph portion template;

determining a second outcome score associated with the second entity profile based on the second outcome determination parameter; and

selecting the first entity based on the first outcome score and the second outcome score.

13. The medium of claim 1 , the operations further comprising:

sampling the directed graph to determine a set of subgraphs;

determining a vector based on the set of subgraphs using a skip-gram model; and

determining the outcome score using a neural network based on the vector.

14. The medium of claim 1 , wherein the first graph portion template further comprises a second vertex template, wherein the second vertex template is associated with a second category label of the set of mutually exclusive category labels, and wherein the second category label is different from the first category label.

15. The medium of claim 1 , the operations further comprising:

updating the entity profile based a history of the first entity;

storing the entity profile on a centralized computing platform, wherein the entity profile is associated with an entity identifier; and

updating a value associated with the entity identifier, wherein the value is stored on a distributed, tamper-evident ledger operating on a distributed computing platform.

16. The medium of claim 1 , wherein the entity profile is a first entity profile, and wherein the operations further comprising:

obtaining a second entity profile;

determining whether a set of entity similarity criteria is satisfied based on the first entity profile and the second entity profile; and

storing value indicating that the first entity profile and the second entity profile satisfy the set of entity similarity criteria.

17. The medium of claim 1 , wherein the first graph portion template further comprises a second vertex template, wherein the second vertex template is not connected to the first vertex template in the first graph portion template by any edge templates.

18. The medium of claim 1 , wherein the directed graph is a first self-executing protocol directed graph, and wherein the operations further comprise:

determining a first transaction amount between the first entity and a second entity based on the first self-executing protocol directed graph;

determining a second transaction amount between the second entity and a third entity based on a second self-executing protocol directed graph;

updating a first association between the first entity and the second entity of an entity graph based on the first transaction amount;

updating a second association between the second entity and the third entity of the entity graph based on the second transaction amount; and

determining whether the first entity is associated with the third entity based on the first association, the first transaction amount, the second association, and the second transaction amount.

19. The medium of claim 18 , the operations further comprising:

determining whether the first entity has failed a conditional statement associated with the first vertex;

in response to a determination that the first entity has failed the conditional statement, updating an entity score is associated with the first entity; and

sending a message to the third entity in response to the updating of the entity score associated with the first entity.

20. A method comprising:

obtaining, with a computing system, program state of a self-executing protocol, wherein the program state encodes:

a set of conditional statements;

a set of entities, wherein the set of entities comprises a first entity;

a directed graph, the directed graph comprising:

a set of vertices, wherein each respective vertex of the set of vertices is associated with a respective category label of a set of mutually exclusive categories;

a set of directed edges connecting respective pairs of vertices among the set of vertices;

obtaining, with the computing system, an entity profile of the first entity, wherein:

the entity profile comprises a first graph portion template,

the first graph portion template comprises a first vertex template and an edge template,

the first vertex template is associated in memory with a first category label of the set of mutually exclusive category labels, and

the edge template specifies an edge direction to or from a vertex matching the first vertex template;

determining, with the computing system, whether the first graph portion template matches a graph portion in the directed graph based on a first vertex of the directed graph matching the first vertex template and a first directed edge of the directed graph matching the edge template;

determining, with the computing system, an outcome score based on the first graph portion template matching the graph portion in the directed graph;

determining, with the computing system, whether the outcome score satisfies an outcome score threshold; and

in response to the outcome score satisfying the outcome score threshold, storing, with the computing system, a value indicating that the outcome score satisfies the outcome score threshold.

Assignments (1)

Continuity (16)

References Cited (201)