# US 2025/0062954 A1 · Optimisation of network parameters for enabling network coding

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

- Number: US 2025/0062954 A1
- Document ID: US20250062954A1
- Status: Published application
- Kind: A1
- Application number: 18/936,267
- Filed: 2024-11-04
- Published: 2025-02-20
- Earliest claimed: 2017-07-11
- Assignees: nChain Licensing AG
- Applicants: nChain Licensing AG
- Inventors: Patrick MOTYLINSKI; Simone MADEO; Giuseppe DESTEFANIS; Stephane VINCENT
- Web page: https://patentgrep.com/patent/US20250062954A1

## CPC

- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 41/0803: Configuration setting
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 16/2465: {Query processing support for facilitating data mining operations in structured databases}
- G06Q 20/00: Payment architectures, schemes or protocols (apparatus for performing or posting payment transactions G07F7/08, G07F19/00; electronic cash registers G07G1/12)
- G06Q 20/065: {using e-cash}
- H04B 7/15521: {combining by calculations packets received from different stations before transmitting the combined packets as part of network coding (network coding aspects for detection or prevention of errors in the information received H04L1/0076; network traffic management with optimizing of information sizing, e.g. header compression, by using assembly and disassembly of packets H04W28/065)}
- H04L 47/11: Identifying congestion
- G06F 2216/03: Data mining
- G06Q 20/223: {based on the use of peer-to-peer networks}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 47/38: by adapting coding or compression rate
- H04L 2001/0097: {Relays}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- 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)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- H04B: TRANSMISSION

## Abstract

Methods and devices for propagating transactions in a network of nodes, each node having one or more connections to other nodes. The method includes receiving a plurality of incoming transactions over a time period; combining the plurality of incoming transactions using network coding to generate a composite message; sending the composite message to one or more nodes in the network; and determining an adjusted time period based on an equilibrium constant parameter and a count of transactions in the plurality of incoming transactions received over the time period.

## Claims

### Claim 1

A node to propagate transactions in a network of nodes, each node having one or more connections to other nodes, the node comprising:
a processor;
memory;
a network interface; and
an application containing processor-executable instructions that, when executed by the processor, cause the processor to:
receive a plurality of incoming transactions over a time period;
determine that a stopping condition has been met, wherein based on the stopping condition being satisfied:
combine the plurality of incoming transactions using network coding to generate a composite message;
send the composite message to one or more nodes in the network; and
determine an adjusted time period based on an equilibrium constant parameter and a count of transactions in the plurality of incoming transactions received over the time period.

### Claim 2 (depends on 1)

The node claimed in claim 1, wherein the stopping condition comprises expiry of a time duration since receipt of a first of the plurality of incoming transactions.

### Claim 3 (depends on 1)

The node claimed in claim 1, wherein the stopping condition comprises a determination that said one of the nodes is a bottleneck.

### Claim 4 (depends on 1)

The node claimed in claim 1, wherein the stopping condition comprises a plurality of new transactions exceeding a maximum number of new transactions.

### Claim 5 (depends on 1)

The node claimed in claim 1, wherein the instructions, when executed, are to further cause the processor to iteratively repeat the receiving, combining, and sending operations using the adjusted time period and to determine a further adjusted time period after each iteration for use in the subsequent iteration.

### Claim 6 (depends on 1)

The node claimed in claim 1, wherein the instructions, when executed, are to cause the processor to determine the adjusted time period by determining the adjusted time period based on the equilibrium constant parameter divided by the count of transactions.

### Claim 7 (depends on 1)

The node claimed in claim 1, wherein the instructions, when executed, are to further cause the processor to determine an average time period based on a plurality of adjusted time periods and to store the average time period in the memory.

### Claim 8 (depends on 1)

The node claimed in claim 1, wherein the instructions, when executed, are to further cause the processor to perform at least one of:
initializing the equilibrium constant parameter based on one or more throughput estimates for one of more links to said one of the nodes;
initializing the equilibrium constant parameter based on an estimated initial time period and an estimated initial count of transactions; and
determining that the count of transactions received in the time period exceeds a minimum count to use network coding, and wherein the combining and sending are conditional on that determination.

### Claim 9

A computer-implemented method of propagating transactions in a network of nodes, each node having one or more connections to other nodes, the method, implemented at one of the nodes, including:
receiving a plurality of incoming transactions over a time period;
combining the plurality of incoming transactions using network coding to generate a composite message;
sending the composite message to one or more nodes in the network; and
determining an adjusted time period based on an equilibrium constant parameter and a count of transactions in the plurality of incoming transactions received over the time period.

### Claim 10 (depends on 9)

The computer-implemented method claimed in claim 9, further comprising iteratively repeating the receiving, combining, and sending operations using the adjusted time period and determining a further adjusted time period after each iteration for use in the subsequent iteration.

### Claim 11 (depends on 9)

The computer-implemented method claimed in claim 9, wherein the method further comprises at least one of:
determining the adjusted time period comprises determining the adjusted time period based on the equilibrium constant parameter divided by the count of transactions; or
determining the adjusted time period is subject to a minimum time period that the adjusted time period cannot be below and a maximum time period that the adjusted time period cannot be above; or
determining an average time period based on a plurality of adjusted time periods and storing the average time period in memory at said one of the nodes.

### Claim 12 (depends on 9)

The computer-implemented method claimed in claim 9, further comprising at least one of:
initializing the equilibrium constant parameter based on one or more throughput estimates for one of more links to said one of the nodes; or
initializing the equilibrium constant parameter based on an estimated initial time period and an estimated initial count of transactions.

### Claim 13 (depends on 9)

The computer-implemented method claimed in claim 9, further comprising determining that the count of transactions received in the time period exceeds a minimum count to use network coding, and wherein the combining and sending are conditional on that determination.

### Claim 14 (depends on 9)

A non-transitory processor-readable medium storing processor-executable instructions to participate in a transaction among a plurality of participating nodes, wherein the processor-executable instructions, when executed by a processor in one of the participating nodes, cause the processor to carry out the method recited in claim 9.
