# US 2025/0158839 A1 · Data exchange attestation method

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

- Number: US 2025/0158839 A1
- Document ID: US20250158839A1
- Status: Published application
- Kind: A1
- Application number: 18/839,921
- Filed: 2023-01-23
- Published: 2025-05-15
- Earliest claimed: 2022-02-22
- Assignees: nChain Licensing AG
- Applicants: nchain Licensing AG
- Inventors: Alec BURNS; Craig Steven WRIGHT
- Web page: https://patentgrep.com/patent/US20250158839A1

## CPC

- H04L 9/3255: {using group based signatures, e.g. ring or threshold signatures}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- G06Q 50/26: Government or public services (business processes related to the transportation industry G06Q50/40)
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/3247: {involving digital signatures}
- H04L 2209/30: Compression, e.g. Merkle-Damgard construction
- 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)
- 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

A computer-implemented method of attesting to a sequence of data exchanges between a group, wherein the group comprises a receiving party and one or more sending parties, and wherein the method is performed by the receiving party and comprises: receiving a sequence of two or more respective sets of data items, each respective set being sent by a respective sending party; and for each respective set of data items in the sequence: generating a respective attestation transaction, wherein the respective attestation transaction comprises a respective output locked to a respective Merkle root of a respective Merkle tree, wherein the respective Merkle tree is based on the respective set of data items and each previous respective set of data items in the sequence; and sending the respective attestation transaction to at least the respective sending party that sent the respective set.

## Claims

### Claim 1

A computer-implemented method of attesting to a sequence of data exchanges between a group, wherein the group comprises a receiving party and one or more sending parties, and wherein the method is performed by the receiving party and comprises:
receiving a sequence of two or more respective sets of data items, each respective set being sent by a respective sending party; and
for each respective set of data items in the sequence:
generating a respective attestation transaction, wherein the respective attestation transaction comprises a respective output locked to a respective Merkle root of a respective Merkle tree, wherein the respective Merkle tree is based on the respective set of data items and each previous respective set of data items in the sequence; and
sending the respective attestation transaction to at least the respective sending party that sent the respective set.

### Claim 2 (depends on 1)

The method of claim 1, wherein one, some or all of the respective sets of data items comprises a single data item.

### Claim 3 (depends on 1)

The method of claim 1, wherein one, some or all of the respective sets of data items comprises multiple data items.

### Claim 4 (depends on 1)

The method of claim 1, comprising:
for each respective set of data items in the sequence, sending a respective hash of each data item in the respective set to at least the respective one or more sending parties that did not send the respective set.

### Claim 5 (depends on 4)

The method of claim 4, wherein said sending of the respective hash of each data item is conditional on the respective one or more sending parties that did not send the respective set signing the respective attestation transaction.

### Claim 6 (depends on 1)

The method of claim 1, wherein said sending of the respective attestation transaction comprises sending the respective attestation transaction to at least the respective sending party that sent the respective set prior to receiving the next respective set of data items in the sequence.

### Claim 7 (depends on 1)

The method of claim 1, comprising:
for one or more respective sets of data items, generating the respective Merkle root of the respective Merkle tree.

### Claim 8 (depends on 1)

The method of claim 1, comprising:
for one or more respective sets of data items, receiving the respective Merkle root of the respective Merkle tree from the respective sending party that sent the respective set; and
for at least one of the one more respective sets of data items, performing a Merkle proof for at least one of the data items in the respective set using the respective Merkle root.

### Claim 9

(canceled)

### Claim 10 (depends on 1)

The method of claim 1, comprising:
generating an initial transaction, wherein the initial transaction comprises an output locked to a public key of the receiving party and one or more additional public keys, each of the additional public keys being associated with a respective sending party, and wherein each respective attestation transaction comprises a respective input that references the output of the initial transaction and comprises a signature corresponding to the public key of the receiving party; and
sending the initial transaction to one or more nodes of a blockchain network and/or at least one of the one or more sending parties.

### Claim 11 (depends on 1)

The method of claim 1, wherein the group consists of a single sending party.

### Claim 12 (depends on 1)

The method of claim 1, wherein the group comprises multiple sending parties.

### Claim 13 (depends on 1)

The method of claim 1, wherein the respective output of each respective attestation transaction is locked to the respective Merkle root of the respective Merkle tree by way of a hash puzzle.

### Claim 14 (depends on 1)

The method of claim 1, wherein the respective attestation transaction comprises one or more respective hashes of respective data items upon which the respective Merkle tree is based.

### Claim 15

A computer-implemented method of attesting to a sequence of data exchanges between a group, wherein the group comprises a receiving party and one or more sending parties, and wherein the method is performed by a first one of the sending parties and comprises:
sending a respective set of data items to the receiving party, wherein the respective set of data items is a final respective set of a sequence of two or more respective sets of data items;
receiving a respective attestation transaction, wherein the respective attestation transaction comprises a respective output locked to a respective Merkle root of a respective Merkle tree, wherein the respective Merkle tree is based on the respective set of data items and each previous respective set of data items in the sequence;
sending the respective attestation transaction to one or more nodes of a blockchain network, the receiving party, at least one of the one or more sending parties, such that the respective attestation transaction is recorded on a blockchain;
generating a final transaction, wherein the final transaction comprises an input that references the respective output of the respective attestation transaction and comprises the respective Merkle root; and
sending the final transaction to at least one of: one or more nodes of the blockchain network, the receiving party, at least one of the one or more sending parties.

### Claim 16 (depends on 15)

The method of claim 15, comprising:
sending one or more additional respective sets of data items to the receiving party.

### Claim 17 (depends on 15)

The method of claim 15, wherein said generating of the final transaction comprises generating the respective Merkle root of the respective Merkle tree based on the respective set of data items and each previous respective set of data items in the sequence.

### Claim 18 (depends on 17)

The method of claim 17, comprising sending the respective Merkle root to the receiving party.

### Claim 19 (depends on 15)

The method of claim 15, comprising:
for one or more respective sets of data items in the sequence, receiving a respective hash of each data item in the respective set, and wherein said generating of the final transaction comprises generating the respective Merkle root of the respective Merkle tree based on the respective set of data items and the received respective hashes.

### Claim at position 20

20-24. (canceled)

### Claim 25

A computer program product embodied on non-transitory computer-readable storage media and configured so as, when run on one or more processors, the one or more processors perform a method of attesting to a sequence of data exchanges between a group, wherein the group comprises a receiving party and one or more sending parties, and wherein the method is performed by the receiving party and comprises:
receiving a sequence of two or more respective sets of data items, each respective set being sent by a respective sending party; and
for each respective set of data items in the sequence:
generating a respective attestation transaction, wherein the respective attestation transaction comprises a respective output locked to a respective Merkle root of a respective Merkle tree, wherein the respective Merkle tree is based on the respective set of data items and each previous respective set of data items in the sequence; and
sending the respective attestation transaction to at least the respective sending party that sent the respective set.

### Claim 26

A computer program product embodied on non-transitory computer-readable storage media and configured so as, when run on one or more processors, the one or more processors perform a method of attesting to a sequence of data exchanges between a group, wherein the group comprises a receiving party and one or more sending parties, and wherein the method is performed by a first one of the sending parties and comprises:
sending a respective set of data items to the receiving party, wherein the respective set of data items is a final respective set of a sequence of two or more respective sets of data items;
receiving a respective attestation transaction, wherein the respective attestation transaction comprises a respective output locked to a respective Merkle root of a respective Merkle tree, wherein the respective Merkle tree is based on the respective set of data items and each previous respective set of data items in the sequence;
sending the respective attestation transaction to one or more nodes of a blockchain network, the receiving party, at least one of the one or more sending parties, such that the respective attestation transaction is recorded on a blockchain;
generating a final transaction, wherein the final transaction comprises an input that references the respective output of the respective attestation transaction and comprises the respective Merkle root; and
sending the final transaction to at least one of: one or more nodes of the blockchain network, the receiving party, at least one of the one or more sending parties.
