Prioritization in a permissioned blockchain

Patent metadata

Field	Value
Publication number	US-11055136-B2
Application number	US-202016751157-A
Country	US
Kind code	B2
Filing date	Jan 23, 2020
Priority date	May 15, 2018
Publication date	Jul 6, 2021
Grant date	Jul 6, 2021

Abstract

An example operation may include one or more of identifying a blockchain transaction requiring peer endorsement, transmitting a request for endorsement to one or more peers assigned to a blockchain, receiving endorsement response messages from the one or more peers, wherein the endorsement response messages comprise a plurality of priorities assigned to the blockchain transaction, and forwarding the received plurality of priorities and the blockchain transaction to an ordering node for assignment to the peers.

First claim

What is claimed is:

1. A method, comprising:
receiving, by an ordering node of a blockchain network, and in response to a request from a client node of the blockchain network, endorsements of transactions from the client node, each endorsement comprising a plurality of initial priorities assigned to a corresponding transaction by a plurality of peer nodes of the blockchain network; and
assigning, by the ordering node, blockchain blocks to commit the transactions to the plurality of peer nodes based on a final priority assigned to each of the transactions.

2. The method of claim 1 , wherein the plurality of initial priorities comprises at least one initial priority that is different than the other plurality of initial priorities.

3. The method of claim 1 , wherein the plurality of initial priorities are all a same priority.

4. The method of claim 1 , further comprising:
determining the plurality of initial priorities based on one or more of:
a chaincode identifier (ID), a function invoked, a transaction type, and a current load of blockchain transactions.

5. The method of claim 1 , further comprising:
determining, by the ordering node, a final priority of each of the transactions based on the plurality of initial priorities and a priority policy; and
assigning, by the ordering node, each of the transactions to one of a plurality of priority queues based on a determined final priority.

6. The method of claim 5 , further comprising:
selecting, from the plurality of priority queues, a plurality of transactions assigned a higher priority than other transactions in the plurality of priority queues based on an identified conflict between transactions in a blockchain block; and
validating the plurality of blockchain transactions assigned the higher priority to form the blockchain block.

7. The method of claim 6 , wherein the validating the plurality of blockchain transactions assigned the higher priority further comprises:
validating the plurality of blockchain transactions assigned the higher priority based on an endorsement policy.

8. An apparatus, comprising:
a memory storing one or more instructions; and
a processor that when executing the one or more instructions is configured to:
receive, in response to a request from a client node of a blockchain network, endorsements of transactions from the client node, each endorsement comprising a plurality of initial priorities assigned to a corresponding transaction by a plurality of peer nodes of the blockchain network,

assign blockchain blocks to commit the transactions to the plurality of peer nodes based on a final priority assigned to each of the transactions.

9. The apparatus of claim 8 , wherein the plurality of initial priorities comprises at least one initial priority that is different than the other plurality of initial priorities.

10. The apparatus of claim 8 , wherein the plurality of initial priorities are all a same priority.

11. The apparatus of claim 8 , wherein the processor is further configured to:
determine the plurality of initial priorities based on one or more of:
a chaincode identifier (ID), a function invoked, a transaction type, and a current load of blockchain transactions.

12. The apparatus of claim 8 , wherein the processor is further configured to:
determine a final priority of each of the transactions based on the plurality of initial priorities and a priority policy; and
assign each of the transactions to one of a plurality of priority queues based on a determined final priority.

13. The apparatus of claim 12 , wherein the processor is further configured to:
select a plurality of transactions assigned a higher priority than other transactions in the plurality of priority queues based on an identified conflict between transactions in a blockchain block; and
validate the plurality of blockchain transactions assigned the higher priority to form the blockchain block.

14. The apparatus of claim 13 , wherein, when the processor is configured to validate the plurality of blockchain transactions assigned the higher priority, the processor is further configured to:
validate the plurality of blockchain transactions assigned the higher priority based on an endorsement policy.

15. A non-transitory computer readable storage medium storing one or more instructions that when executed by a processor cause the processor to perform:
receiving, in response to a request from a client node of a blockchain network, endorsements of transactions from the client node, each endorsement comprising a plurality of initial priorities assigned to a corresponding transaction by a plurality of peer nodes of the blockchain network; and
assigning blockchain blocks to commit the transactions to the plurality of peer nodes based on a final priority assigned to each of the transactions.

16. The non-transitory computer readable storage medium of claim 15 , wherein the plurality of initial priorities comprises at least one initial priority that is different than the other plurality of initial priorities.

17. The non-transitory computer readable storage medium of claim 15 , wherein the plurality of initial priorities are all a same priority.

18. The non-transitory computer readable storage medium of claim 15 , wherein the one or more instruction further cause the processor to perform:
determining the plurality of initial priorities based on one or more of:
a chaincode identifier (ID), a function invoked, a transaction type and a current load of blockchain transactions.

19. The non-transitory computer readable storage medium of claim 15 , wherein the one or more instruction further cause the processor to perform:
determining a final priority of each of the transactions based on the plurality of initial priorities and a priority policy; and
assigning each of the transactions to one of a plurality of priority queues based on a determined final priority.

20. The non-transitory computer readable storage medium of claim 19 , wherein the one or more instruction further cause the processor to perform:
selecting, from the plurality of priority queues, a plurality of transactions assigned a higher priority than other transactions in the plurality of priority queues based on an identified conflict between transactions in a blockchain block; and
validating the plurality of blockchain transactions assigned the higher priority to form the blockchain block.

Assignees

• IBM

Inventors

• Goel Seep
• Singh Abhishek
• Garg Rachit
• Verma Mudit
• Jayachandran Praveen

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• H04L9/3247

  involving digital signatures · CPC title

• G06Q2220/00

  Business processing using cryptography · CPC title

• G06Q40/00 Primary

  Finance; Insurance; Tax strategies; Processing of corporate or income taxes · CPC title

• G06F9/4881 Primary

  Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title