# US 2025/0148460 A1 · Blockchain transaction

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

- Number: US 2025/0148460 A1
- Document ID: US20250148460A1
- Status: Published application
- Kind: A1
- Application number: 18/838,086
- Filed: 2023-01-16
- Published: 2025-05-08
- Earliest claimed: 2022-02-15
- Assignees: nChain Licensing AG
- Applicants: nChain Licensing AG
- Inventors: Craig Steven WRIGHT; Mathieu DUCROUX
- Web page: https://patentgrep.com/patent/US20250148460A1

## CPC

- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- H04L 63/0435: {wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption (cryptographic mechanisms or cryptographic arrangements for symmetric key encryption H04L9/06)}
- G06Q 20/3829: {involving key management}
- H04L 9/0825: {using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates}
- H04L 9/3247: {involving digital signatures}
- H04L 9/3297: {involving time stamps, e.g. generation of time stamps}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 63/108: {when the policy decisions are valid for a limited amount of time}
- 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
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A computer implemented method for time-locking a blockchain transaction. The method comprises computing a solution to a time-lock puzzle using a set of secret puzzle parameters. The time-lock puzzle is solvable using a set of puzzle parameter in a time equal to or greater than a minimum solving time. The set of puzzle parameters does not comprise the secret puzzle parameters. The method further comprises generating a transaction encryption key K, encrypting the blockchain transaction using the encryption key K, and encrypting the transaction encryption key K using the solution to the time-lock puzzle.

## Claims

### Claim 1

A computer implemented method for time-locking a blockchain transaction, the method comprising:
computing a solution to a time-lock puzzle using a set of secret puzzle parameters, the time-lock puzzle being solvable using a set of puzzle parameter in a time equal to or greater than a minimum solving time, wherein the set of puzzle parameters does not comprise the secret puzzle parameters;
generating a transaction encryption key K;
encrypting the blockchain transaction using the encryption key K; and
encrypting the transaction encryption key K using the solution to the time-lock puzzle.

### Claim 2 (depends on 1)

The method of claim 1, wherein the method further comprises making the set of puzzle parameters and the encrypted transaction encryption key available to one or more puzzle solvers.

### Claim 3 (depends on 2)

The method of claim 2, wherein the method further comprises:
generating a puzzle parameter blockchain transaction, the puzzle parameter blockchain transaction comprising a first output for rendering output data of the first output available when the puzzle parameter blockchain transaction is committed to the blockchain, the output data comprising the encrypted blockchain transaction; and
making the puzzle parameter blockchain transaction available to one or more nodes of a blockchain network.

### Claim 4 (depends on 3)

The method of claim 3, wherein the output data further comprises the set of puzzle parameters and the encrypted transaction encryption key.

### Claim 5

A computer-implemented method of decrypting an encrypted blockchain transaction, wherein the encrypted blockchain transaction is encrypted using a transaction encryption key, wherein the transaction encryption key is encrypted based on a solution to a time-lock puzzle, the time-lock puzzle being solvable using a set of puzzle parameter in a time equal to or greater than a minimum solving time, the method comprising:
obtaining the set of puzzle parameters and the encrypted transaction encryption key;
generating, based on the set of puzzle parameters, the solution to the time-lock puzzle;
deriving, based on the solution and the encrypted transaction encryption key, the transaction encryption key; and
decrypting the encrypted blockchain transaction using the decrypted transaction encryption key.

### Claim 6 (depends on 5)

The method of claim 5, wherein the encrypted blockchain transaction is obtained from a puzzle parameter blockchain transaction.

### Claim 7 (depends on 6)

The method of claim 6, wherein the method further comprises obtaining the set of puzzle parameters and the encrypted transaction encryption key from the puzzle parameter blockchain transaction.

### Claim 8 (depends on 1)

The method of claim 1, wherein the time-lock puzzle is a modular squaring puzzle.

### Claim 9 (depends on 8)

The method of claim 8, wherein the solution is defined by:
sol=a2t mod n
wherein a, t, and n are puzzle parameters, wherein 1<a<n and t>0.

### Claim 10 (depends on 9)

The method of claim 9, wherein the puzzle parameter n is defined by:
modulus n=pq
wherein p and q are large prime numbers.

### Claim 11 (depends on 10)

The method of claim 10, wherein the solution is defined by:
sol=a2t mod φ(n) mod n
wherein φ(n)=(p−1)(q−1).

### Claim 12 (depends on 9)

The method according to claim 9, wherein the encrypted transaction encryption key is defined by:
CK=K+sol mod n.

### Claim 13 (depends on 11)

The method of claim 11, wherein the set of secret puzzle parameters comprises the large prime numbers p and q.

### Claim 14 (depends on 13)

The method of claim 13, wherein the method further comprises, before computing the solution, randomly selecting the large prime numbers p and q and the puzzle parameter a, and computing the puzzle parameter t.

### Claim 15 (depends on 5)

The method of claim 5, wherein the time-lock puzzle is a modular squaring puzzle, wherein the solution is defined by:
sol=a2t mod n
wherein a, t, and n are puzzle parameters, wherein 1<a<n and t>0, wherein the solution is generated using the puzzle parameters a, t, and n.

### Claim 16 (depends on 9)

The method of claim 9, wherein the minimum solving time is defined by:
T
=
t
S
wherein S is a number of squarings modulo n per second a user computing the solution using the set of puzzle parameters can perform.

### Claim 17

Computer equipment comprising:
memory comprising one or more memory units; and processing apparatus comprising one or more processing units, wherein the memory stores code arranged to run on the processing apparatus, the code being configured so as when run on the processing apparatus, the processing apparatus performs a method of time-locking a blockchain transaction, the method comprising:
computing a solution to a time-lock puzzle using a set of secret puzzle parameters, the time-lock puzzle being solvable using a set of puzzle parameter in a time equal to or greater than a minimum solving time, wherein the set of puzzle parameters does not comprise the secret puzzle parameters;
generating a transaction encryption key K;
encrypting the blockchain transaction using the encryption key K; and
encrypting the transaction encryption key K using the solution to the time-lock puzzle.

### Claim 18

A computer program 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 time-locking a blockchain transaction, the method comprising:
computing a solution to a time-lock puzzle using a set of secret puzzle parameters, the time-lock puzzle being solvable using a set of puzzle parameter in a time equal to or greater than a minimum solving time, wherein the set of puzzle parameters does not comprise the secret puzzle parameters;
generating a transaction encryption key K;
encrypting the blockchain transaction using the encryption key K; and
encrypting the transaction encryption key K using the solution to the time-lock puzzle.
