# US 2022/0045930 A1 · Autonomous quality regulation for distributed ledger networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0045930 A1
- Document ID: US20220045930A1
- Status: Published application
- Kind: A1
- Application number: 17/276,005
- Filed: 2019-09-09
- Published: 2022-02-10
- Earliest claimed: 2018-09-14
- Assignees: Arqit Limited
- Applicants: Arqit Limited
- Inventors: David Williams
- Web page: https://patentgrep.com/patent/US20220045930A1

## CPC

- H04L 41/5009: Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
- H04L 43/50: Testing arrangements
- G06F 16/29: Geographical information databases
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 43/0805: by checking availability
- H04L 43/0852: Delays
- H04L 43/16: Threshold monitoring
- H04L 63/10: {for controlling access to devices or network resources}
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/53: using third party service providers
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 43/0817: by checking functioning
- H04L 43/0864: Round trip delays
- H04L 43/10: Active monitoring, e.g. heartbeat, ping or trace-route
- H04L 63/0823: {using certificates (cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263)}
- H04L 63/126: {the source of the received data}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, apparatus, and systems are provided for operating a distributed ledger network (100), the distributed ledger network (100) comprising a plurality of nodes (102a-102n, 104a-04m), the plurality of nodes comprising a group of nodes (104), wherein each node in the group of nodes (104) includes functionality for acting as a trusted third party node on a distributed ledger transaction, the method comprising: performing an operating performance test on one or more selected nodes (104a-104m) of the group of nodes (104), wherein the operating performance test comprises sending a plurality of test messages to each selected node (104a-104m) over a predetermined time period; receiving operating performance data associated with each selected node (104a-104m) in relation to the operating performance test; aggregating operating performance statistics for each selected node (104a-104m) based on the received operating performance responses; and indicating to the distributed ledger network (100) those selected nodes (104a-104m) satisfying one or more operating performance benchmark(s) for acting as a trusted third party for distributed ledger transactions over the distributed ledger network (100) based on the aggregated operating performance statistics.

## Claims

### Claim 1

A computer-implemented method for operating a distributed ledger network, the distributed ledger network comprising a plurality of nodes, the plurality of nodes comprising a group of nodes, wherein each node in the group of nodes includes functionality for acting as a trusted third party node on a distributed ledger transaction, the method comprising:
performing an operating performance test on one or more selected nodes (104a-104m) of the group of nodes, wherein the operating performance test comprises sending a plurality of test messages to each selected node over a predetermined time period;
receiving operating performance data associated with each selected node (104a-104m) in relation to the operating performance test;
aggregating operating performance statistics for each selected node (104a-104m) based on the received operating performance responses; and
indicating to the distributed ledger network those selected nodes satisfying one or more operating performance benchmark(s) for acting as a trusted third party for distributed ledger transactions over the distributed ledger network based on the aggregated operating performance statistics.

### Claim 2 (depends on 1)

The computer-implemented method as claimed in claim 1, each selected node receives a plurality of operating performance tests over a predetermined time interval, wherein aggregating the operating performance statistics for each selected node further comprising calculating the operating performance statistics for each selected node based on the frequency at which the received operating performance data associated with the selected node satisfy corresponding target operating performance thresholds in relation to the operating performance benchmark(s).

### Claim 3 (depends on 2)

The computer-implemented method as claimed in claim 2, wherein each of the operating performance tests are received at random or pseudo-random time instances over the predetermined time interval.

### Claim 4 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the operating performance data comprises one or more measurable operational parameters associated with the selected node receiving and processing the test message(s).

### Claim 5 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the operating performance data associated with the selected node in relation to the test messages comprises at least one or more measurable operational parameters based on the group of:
test message transmission timestamps;
test message reception timestamps;
latency delays;
uptime of a selected node;
transaction processing speed; and
round-trip-time between one or more nodes associated with the parties and the selected node in relation to the test message.

### Claim 6 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein operating performance benchmark(s) comprise one or more performance benchmark(s) based on the group of:
a selected node meeting an availability threshold for the selected node to authorize transactions;
a selected node meeting an uptime threshold for the selected node to authorize transactions;
a selected node meeting a network reachability threshold;
a selected node meeting an communication connection speed threshold;
a selected node meeting a transaction processing time threshold;
a selected node meeting any other operating performance threshold externally determinable or measurable to the selected node for determining the operating performance of the selected node.

### Claim 7 (depends on 1)

The computer-implemented method as claimed in claim 1, further comprising determining a selected node satisfies the operating performance benchmark(s) when the operating performance statistics indicate the selected node meets or exceeds a quality metric for each of the operating performance benchmark(s).

### Claim 8 (depends on 7)

The computer-implemented method as claimed in claim 7, wherein the quality metric is based on a frequency or number of times the selected node satisfies the corresponding operating performance benchmark in relation to the number of test messages received.

### Claim 9 (depends on 7)

The computer-implemented method as claimed in claim 7, wherein the quality metric is based on a percentage of a time interval, or number of test messages received/sent, the selected node satisfies a performance benchmark expressed in terms of M 9's or MN5, where M>=1.

### Claim 10 (depends on 7)

The computer-implemented method as claimed in claim 7, wherein the quality metric is based on a probability over a time interval, or number of test messages received/sent, that the selected node satisfies a performance benchmark.

### Claim 11 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein one or more of the test messages comprises a diagnostic test transaction between two or more parties requiring a node from the group of nodes to act as a third party node, wherein, on receipt of the test message, a selected node from the group of nodes processes the diagnostic test transaction as a third party node between the two or more parties.

### Claim 12 (depends on 11)

The computer-implemented method as claimed in claim 11, wherein the two or more parties exist or are based on the same node in the distributed ledger network.

### Claim 13 (depends on 11)

The computer-implemented method as claimed in claim 11, wherein the two or more parties exist or are based on different nodes of the distributed ledger network.

### Claim 14 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein one or more of the test messages comprises one or more network reachability messages based from the group of:
ping messages for determining reachability of the selected node;
keep-alive messages for determining a communication link exists with the selected node;
any other message or messaging protocol for determining round-trip time in relation to the selected node;
any other message or messaging protocol for determining end-to-end delay or one-way delay in relation to the selected node.

### Claim 15 (depends on 14)

The computer-implemented method as claimed in claim 14, wherein the one or more test messages and responses thereto are configured to determine an estimate of the availability of the selected node for performing transactions of the selected node based determining an end-to-end delay between a party of the two or more parties initiating the transaction with the selected node.

### Claim 16 (depends on 11)

The computer-implemented method as claimed in claim 11, wherein the one or more test messages and responses thereto are configured to determine an estimate of the transaction processing time of the selected node in relation to a diagnostic test transaction based on round-trip time of the transaction being performed between the two or more parties and the selected node and the end-to-end delay between the two or more parties and the selected node.

### Claim 17 (depends on 14)

The computer-implemented method as claimed in claim 14, wherein the one or more test messages and responses thereto are configured to determine an estimate of the communication bandwidth for the connection to the selected node in the distributed ledger network based determining an round-trip-time and/or end-to-end delay between the two or more parties in a transaction with the selected node.

### Claim 18 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the group of nodes comprises a plurality of subgroup of nodes, each subgroup of nodes associated with a corresponding node operator and each node in the subgroup of nodes operating independently of other nodes in the subgroup of nodes, the method further comprising sending a notification to each node operator as to whether those selected nodes of the subgroup of nodes associated with the node operator satisfy the operating performance benchmark(s).

### Claim 19 (depends on 18)

The computer-implemented method as claimed in claim 18, wherein the notification comprises diagnostic data representative of the operating performance statistics of the selected nodes in the subgroup of nodes.

### Claim 20 (depends on 19)

The computer-implemented method as claimed in claim 19, wherein the diagnostic data indicates whether a selected node satisfies the operating performance test.

### Claim 21 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the group of nodes comprises a plurality of subgroups of nodes, each subgroup of nodes associated with a corresponding node operator and each node in the subgroup of nodes operating independently of other nodes in the subgroup of nodes, the method further comprising notifying a node operator of those selected nodes in the subgroup of nodes that do not satisfy all of the operating performance benchmark(s).

### Claim 22 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the group of nodes comprises a plurality of subgroups of nodes, each subgroup of nodes associated with a corresponding node operator and each node in the subgroup of nodes operating independently of other nodes in the subgroup of nodes, the method further comprising rewarding a node operator by providing a number of tokens to the node operator based on the number of selected nodes in the subgroup of nodes that satisfy all of the operating performance benchmark(s).

### Claim 23 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein indicating to the distributed ledger network those selected nodes satisfying one or more operating performance benchmark(s) further comprises ensuring transactions are routed to those selected nodes satisfying one or more operating performance benchmark(s).

### Claim 24 (depends on 23)

The computer-implemented method as claimed in claim 23, wherein ensuring transactions are routed further comprises configuring the distributed ledger network to re-route transactions away from those selected nodes indicated as not satisfying one or more of the operating performance benchmark(s).

### Claim 25 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein indicating to the distributed ledger network those selected nodes satisfying one or more operating performance benchmark(s) further comprising storing, in a blockchain or distributed ledger, the operating performance statistics for each of the selected nodes and/or whether each of the selected nodes satisfies the one or more operating performance benchmark(s), wherein the blockchain or distributed ledger is accessed by one or more parties of a transaction for selecting a node that satisfies the operating performance benchmark(s) required for acting as a third party node in the transaction.

### Claim 26 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the group of nodes comprises at least one type of node from the group of:
a super-peer node;
a master node;
a miner node;
a jury node; and
a notary nodes.

### Claim 27 (depends on 1)

The computer-implemented method as claimed in claim 1, wherein the distributed ledger network is based on at least one of:
a) a CORDA based distributed ledger network and the group of nodes comprises a pool of notary nodes;
b) blockchain based distributed ledger network and the group of nodes comprises a pool of miner nodes; and
c) any other type of distributed ledger network in which a group of nodes comprises nodes for acting as trusted third parties in a distributed ledger transaction for one or more parties.

### Claim 28

A node in a distributed ledger network comprising a plurality of nodes, the plurality of nodes comprising a group of nodes, wherein each node in the group of nodes includes functionality for acting as a third party node in a transaction, the node configured to implement the computer-implemented method according to any preceding claim.

### Claim at position 29

29-31. (canceled)
