# US 2025/0168016 A1 · Systems and methods for efficient and secure processing, accessing and transmission of data via a blockchain network

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

- Number: US 2025/0168016 A1
- Document ID: US20250168016A1
- Status: Published application
- Kind: A1
- Application number: 19/034,865
- Filed: 2025-01-23
- Published: 2025-05-22
- Earliest claimed: 2018-11-27
- Assignees: nChain Licensing AG
- Applicants: nChain Licensing AG
- Inventors: Craig Steven WRIGHT; Owen VAUGHAN; Jack Owen DAVIES; Chloe Ceren TARTAN
- Web page: https://patentgrep.com/patent/US20250168016A1

## CPC

- H04L 9/3247: {involving digital signatures}
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- G06Q 20/38215: {Use of certificates or encrypted proofs of transaction rights}
- G06Q 20/3827: {Use of message hashing}
- G06Q 20/3829: {involving key management}
- H04L 9/08: Key distribution {or management, e.g. generation, sharing or updating, of cryptographic keys or passwords (network architectures or network communication protocols for supporting key management in a packet data network H04L63/06)}
- H04L 9/0825: {using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates}
- H04L 9/0836: {using tree structure or hierarchical structure}
- H04L 9/30: Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L 9/3033: {details relating to pseudo-prime or prime number generation, e.g. primality test}
- H04L 9/3073: {involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/3242: {involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC}
- H04L 9/3249: {using RSA or related signature schemes, e.g. Rabin scheme}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- 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

## Abstract

The invention provides improved methods and systems for storing, sharing retrieving, writing and accessing data (content) on a blockchain. The invention may form part of a protocol for storing, searching and accessing the data. An embodiment of the invention comprises the step of processing at least one blockchain transaction (Tx) comprising: a protocol flag; a discretionary public key (DPK); and a discretionary transaction ID (DTxID). These are discretionary in the sense that they are not required as part of the underlying blockchain protocol but in accordance with the present invention. This combination of features enables portions of data to be identified, retrieved and shared on a blockchain, and also to be linked/associated with one another when provided in a plurality of transactions. It enables a graph or tree-like structure to be constructed, which reflects the hierarchical relationships between portions of data, facilitating their processing, searching and sharing.

## Claims

### Claim 1

A computer-implemented method including the step of identifying, within a blockchain, at least one blockchain transaction (Tx) comprising a transaction ID (TxID) that is required for the at least one blockchain transaction (Tx) to be valid in accordance with a first blockchain protocol, the at least one blockchain transaction (Tx) also comprising:
i) a protocol flag that is associated with and/or indicative of a further blockchain protocol, wherein the further blockchain protocol is arranged for searching for, storing in and/or retrieving data in one or more blockchain transactions; and
ii) a unique index for identifying the at least one blockchain transaction (Tx) on the blockchain, the unique index comprising:
a discretionary public key (DPK); and
a discretionary transaction ID (DTxID).

### Claim 1 (depends on 1)

A method according to claim 1, wherein:
the at least one blockchain transaction (Tx) further comprises one or more attributes.

### Claim 2 (depends on 1)

A method according to claim 1, wherein the at least one blockchain transaction (Tx) further comprises:
a portion of data, or a reference to a portion of data.

### Claim 3 (depends on 1)

A method according to claim 1, wherein:
the protocol flag, the discretionary public key (DPK) and/or the discretionary transaction ID (DTxID) are provided within an output (UTXO), preferably within a locking script associated with the output (UTXO).

### Claim 4 (depends on 1)

A method according to claim 1 wherein the portion of data, reference to the portion of data, the protocol flag, the discretionary public key (DPK) and/or the discretionary transaction ID (DTxID) are provided within the at least one blockchain transaction (Tx) at a location following a script opcode for marking an output as invalid for subsequent use as an input to a subsequent transaction.

### Claim 6 (depends on 5)

A method according to claim 5, wherein:
the one or more attributes comprises a keyword, tag or identifier associated with:
i) a portion of data provided within or referenced within the at least one blockchain transaction (Tx); and/or
ii) the at least one blockchain transaction (Tx).

### Claim 7 (depends on 1)

A method according to claim 1, wherein the at least one blockchain transaction (Tx) further comprises an input including:
i) a parent public key (PPK) associated with a logical parent transaction (LPTx), wherein the logical parent transaction (LPTx) is identified by the discretionary transaction ID (DTxID); and
ii) a signature generated using the parent public key (PPK).

### Claim 8 (depends on 1)

A method according to claim 1, and further comprising the step of:
using the unique index to identify, within the blockchain:
the at least one blockchain transaction (Tx); or
a logical parent transaction (LPTx) that is identified by the discretionary transaction ID (DTxID) within the blockchain.

### Claim 9 (depends on 1)

A method according to claim 1, and comprising the step of:
i) interpreting the discretionary public key (DPK) as the address of a node in a logical hierarchy of nodes structured in accordance with the further protocol; or
ii) interpreting the discretionary transaction ID (DTxID) as the version of a node in a logical hierarchy of nodes structured in accordance with the further protocol.

### Claim 10

A computer implemented method comprising the steps of:
associating a unique index with a blockchain transaction (Tx) which comprises:
i) a transaction ID;
iii) a protocol flag for a blockchain-based search protocol; and
ii) a unique index comprising a discretionary public key and a discretionary transaction ID; and
searching for the blockchain transaction (Tx) based on the unique index.

### Claim 11 (depends on 10)

A method according to claim 10, and further comprising the step of:
accessing or otherwise processing a portion of data provided within or referenced from the at least one blockchain transaction (Tx).

### Claim 12 (depends on 1)

A computer-implemented system comprising:
a processor; and
memory including executable instructions that, as a result of execution by the processor, causes the system to perform any embodiment of the computer-implemented method as claimed in any of claim 1.

### Claim 13 (depends on 1)

A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform an embodiment of the method as claimed in any of claim 1.
