IP Library Granted Patent US 12,562,929
Granted Patent B2
US 12,562,929 · App. 18/573,650 · Granted Feb 24, 2026

Multi-level blockchain

Inventors: Craig Steven Wright (London, GB); Chloe Tartan (London, GB); Katharine Molloy (London, GB)
Assignee: nChain Licensing AG
H04L9/50
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,562,929
App. No.
18/573,650
Filed
Dec 22, 2023
Granted
Feb 24, 2026
Kind
B2
Examiner
VANG, MENG
Art Unit
2443
USPC
380/30
Abstract

A computer-implemented method of using a multi-level (ML) data chain protocol to embed a data chain on a core blockchain, comprising: obtaining one or more ML transactions, wherein each ML transaction comprises one or more carrier pairs, each carrier pair comprising an input and an output, wherein each output comprises data associated with the data chain, and wherein each input comprises a signature that signs the carrier pair; generating a first ML block of the ML data chain, wherein the first ML block is a core blockchain transaction and comprises the respective carrier pairs of the obtained one or more ML transactions, wherein for each carrier pair, a respective position index of the respective input corresponds to a respective position index of the respective output, and b) a first chain output, wherein the first chain output is for being spent by a respective chain input of a subsequent ML block.

Claims (43)

1 . A computer-implemented method of using a multi-level (ML) data chain protocol to embed a data chain on a core blockchain, wherein the method is performed by a ML block producer and comprises:

obtaining one or more ML transactions, wherein each ML transaction comprises one or more respective carrier pairs, each carrier pair comprising a respective input and a respective output, wherein each respective output comprises respective data associated with the data chain, and wherein each respective input comprises a respective signature that signs the respective carrier pair;

generating a first ML block of the ML data chain, wherein the first ML block is a core blockchain transaction and comprises a) the respective carrier pairs of the obtained one or more ML transactions, wherein for each carrier pair, a respective position index of the respective input corresponds to a respective position index of the respective output, and b) a first chain output, wherein the first chain output is for being spent by a respective chain input of a subsequent ML block; and

causing the first ML block to be recorded on the core blockchain.

2 . The method of claim 1 , wherein the core blockchain comprises one or more previous ML blocks, each previous ML block being a respective core blockchain transaction and comprises a) one or more carrier pairs, b) a respective chain output, and c) a respective chain input, wherein each respective chain input spends a respective chain output of a previous ML block such that the one or more previous ML blocks form a ML blockchain, and wherein the first ML block comprises c) a first chain input that spends a respective chain output of a previous ML block.

3 . The method of claim 1 , wherein said causing of the first ML block to be recorded on the core blockchain comprises submitting the first ML block to a core blockchain network.

4 . The method of claim 1 , wherein said causing of the first ML block to be recorded on the core blockchain comprises submitting a first core block to a core blockchain network, wherein the first core block comprises the first ML block.

5 . The method of claim 1 , wherein said obtaining of the one or more ML transactions comprises receiving at least one of the one or more ML transactions, and wherein the method comprises:

maintaining a memory pool of respective carrier pairs of received ML transactions; and

generating the first ML block based on one or more of the respective carrier pairs stored in the memory pool.

6 . The method of claim 1 , wherein said obtaining of the one or more ML transactions comprises generating at least one of the one or more ML transactions, and wherein the method comprises: receiving data to be included in a carrier pair; and

generating at least one of the one or more ML transactions by including the received data in a carrier pair of the at least one ML transaction.

7 . The method of claim 1 , wherein for each carrier pair, the respective signature signs only the input and output of that carrier pair.

8 . The method of claim 1 , wherein each ML transaction is an invalid transaction according to the core blockchain protocol.

9 . The method of claim 1 , wherein the data chain is a secondary blockchain, and wherein the respective data comprises a blockchain transaction of the secondary blockchain.

10 . The method of claim 9 , wherein the respective data of one of said carrier pairs of the first ML block comprises some or all of the secondary blockchain.

11 . The method of claim 1 , wherein the respective data comprises application-specific data.

12 . The method of claim 1 , wherein the respective chain output of each respective ML block comprises a respective block header, and wherein the respective block header comprises a Merkle root of a Merkle tree, wherein the respective leaves of the Merkle tree are based on the respective data of the respective carrier pairs of the respective ML block.

13 . The method of claim 12 , wherein the respective block header comprises a timestamp indicating a time that the respective ML block was created and/or submitted to a core blockchain network.

14 . The method of claim 12 , wherein the first chain output comprises a locking script configured to implement a proof-of-work (PoW) puzzle, wherein the PoW puzzle comprises a first block header hash and a difficulty target, wherein the first block header hash is a hash of the respective block header of the first ML block, and wherein the locking script is configured to require a respective chain input of a subsequent ML block to comprise a respective block header hash that when combined with the first block header hash of the first ML block, a hash of the combination satisfies the difficulty target.

15 . The method of claim 14 , wherein:

the core blockchain comprises one or more previous ML blocks, each previous ML block being a respective core blockchain transaction and comprises a) one or more carrier pairs, b) a respective chain output, and c) a respective chain input, wherein each respective chain input spends a respective chain output of a previous ML block such that the one or more previous ML blocks form a ML blockchain, and wherein the first ML block comprises c) a first chain input that spends a respective chain output of a previous ML block; and

the first chain input of the first ML block comprises a first block header of the first ML block, and wherein the first block header of the first ML block satisfies the difficulty target set by a PoW puzzle implemented by a locking script of the respective chain output of the previous ML block.

16 . The method of claim 12 , wherein the first chain output comprises a locking script configured to implement a PoW r-puzzle, wherein the POW r-puzzle comprises a first hash value and a difficulty target, wherein the first hash value is a hash of the first block header combined with a first r-value, where the r-value is a component of a digital signature, and wherein the locking script is configured such that, in order to be unlocked, a respective chain input of a subsequent ML block is required to comprise i) a respective block header of the subsequent ML block and ii) a signature that uses the first r-value, and wherein the first locking script is configured to extract the first value from the signature, generate a second hash value as the hash of the respective block header combined with the extracted r-value, and verify that a hash of combination of the first and second hash values satisfies the target difficulty.

17 . The method of claim 16 , wherein:

the core blockchain comprises one or more previous ML blocks, each previous ML block being a respective core blockchain transaction and comprises a) one or more carrier pairs, b) a respective chain output, and c) a respective chain input, wherein each respective chain input spends a respective chain output of a previous ML block such that the one or more previous ML blocks form a ML blockchain, and wherein the first ML block comprises c) a first chain input that spends a respective chain output of a previous ML block; and

the first chain input of the first ML block comprises i) the first block header of the first ML block and ii) a first signature that uses an r-value set by the respective chain output of the previous ML block, and wherein the first block header of the first ML block satisfies the difficulty target set by a PoW r-puzzle implemented by a locking script of the respective chain output of the previous ML block.

18 . The method of claim 1 , wherein the first chain output comprises one of:

a locking script locked to a public key associated with a ML block producer,

a multi-signature locking script locked to one or more of a set of public keys, each public key being associated with a respective ML block producer,

a locking script locked to a public key corresponding to a threshold private key, wherein the threshold private key is split into a plurality of private key shares, and each private key share is associated with a respective ML block producer,

a locking script configured to implement a hash puzzle, wherein a preimage to the hash puzzle is made available to one or more ML block producers,

a locking script configured to implement an r-puzzle, such that the locking script can be unlocked by any block producer with knowledge of a specific r-value.

19 . Computer equipment of a multi-level (ML) block producer 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 using a ML data chain protocol to embed a data chain on a core blockchain, wherein the method is performed by the ML block producer and comprises:

obtaining one or more ML transactions, wherein each ML transaction comprises one or more respective carrier pairs, each carrier pair comprising a respective input and a respective output, wherein each respective output comprises respective data associated with the data chain, and wherein each respective input comprises a respective signature that signs the respective carrier pair;

generating a first ML block of the ML data chain, wherein the first ML block is a core blockchain transaction and comprises a) the respective carrier pairs of the obtained one or more ML transactions, wherein for each carrier pair, a respective position index of the respective input corresponds to a respective position index of the respective output, and b) a first chain output, wherein the first chain output is for being spent by a respective chain input of a subsequent ML block; and

causing the first ML block to be recorded on the core blockchain.

20 . 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 using a multi-level (ML) data chain protocol to embed a data chain on a core blockchain, wherein the method comprises:

obtaining one or more ML transactions, wherein each ML transaction comprises one or more respective carrier pairs, each carrier pair comprising a respective input and a respective output, wherein each respective output comprises respective data associated with the data chain, and wherein each respective input comprises a respective signature that signs the respective carrier pair;

generating a first ML block of the ML data chain, wherein the first ML block is a core blockchain transaction and comprises a) the respective carrier pairs of the obtained one or more ML transactions, wherein for each carrier pair, a respective position index of the respective input corresponds to a respective position index of the respective output, and b) a first chain output, wherein the first chain output is for being spent by a respective chain input of a subsequent ML block; and

causing the first ML block to be recorded on the core blockchain.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 26, 2023
From: TARTAN, CHLOE; WRIGHT, CRAIG STEVEN; MOLLOY, KATHARINE
To: NCHAIN LICENSING AG
Reel/Frame 065952/0333 →
Priority Claims (1)
GB 2109191 · Jun 25, 2021 · national
Continuity (1)
Related Publication 20240291678A1 · Aug 29, 2024
References Cited (18)
US 20180139042A1 · Binning · 2018 [cited by examiner]
US 20190245680A1 · Boutaba · 2019 [cited by examiner]
US 20200104296A1 · Hunn et al. · 2020 [cited by applicant]
US 20200127812A1 · Schuler · 2020 [cited by examiner]
US 20200250747A1 · Padmanabhan · 2020 [cited by examiner]
US 20210182895A1 · Sears · 2021 [cited by examiner]
US 20210216958A1 · Pacheco · 2021 [cited by examiner]
WO WO2018203186A1 · 2018 [cited by examiner]
WO WO2019236426A1 · 2019 [cited by examiner]
WO 2020240299A1 · 2020 [cited by applicant]
WO WO2021092434A1 · 2021 [cited by examiner]
“Bitcoin SV Mining Fees Lowered”, Bitcoin Association, Jan. 9, 2020, 3 pages, Press Release. [cited by applicant]
“Proof of Work”, Bitcoin Wiki, Accessed Dec. 8, 2020, https://wiki.bitcoinsv.io/index.php/Proof_of_Work. [cited by applicant]
“ZK-Rollups”, Ethhub, Accessed Feb. 19, 2021, https://docs.ethhub.io/ethereum-roadmap/layer-2-scaling/zk-rollups/. [cited by applicant]
GB2109191.3 Combined Search and Abbreviated Examination Report dated Nov. 25, 2021, 6 pages. [cited by applicant]
PCT/EP2022/064160 International Search Report and Written Opinion dated Sep. 21, 2022, 12 pages. [cited by applicant]
Shadders, Steve, “On the future of Bitcoin transaction fees”, Bitcoin SV, Accessed Dec. 8, 2020, https://bitcoinsv.io/2019/11/24/on-the-future-of-bitcoin-transaction-fees/. [cited by applicant]
Yin, Maofan et al., “HotStuff: BFT Consensus in the Lens of Blockchain”, Computer Science>Distributed, Parallel, and Cluster Computing, Mar. 13, 2018, https://arxiv.org/abs/1803.05069. [cited by applicant]