# US 2019/0378069 A1 · Maximizing retention of transaction results for blockchain block creation

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

- Number: US 2019/0378069 A1
- Document ID: US20190378069A1
- Status: Published application
- Kind: A1
- Application number: 16/004,826
- Filed: 2018-06-11
- Published: 2019-12-12
- Earliest claimed: 2018-06-11
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Pralhad Dinesh Deshpande; Muhammad Tayyab Asif; Alan Kang Hong Lim
- Web page: https://patentgrep.com/patent/US20190378069A1

## CPC

- G06Q 10/06315: {Needs-based resource requirements planning or analysis}
- G06Q 10/067: Enterprise or organisation modelling
- G06Q 10/0674: {using process simulation}
- 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

An example operation may include one or more of receiving blockchain transactions, sorting an order of the blockchain transactions, simulating committance processing of the plurality of blockchain transactions to identify mining costs associated with each of the plurality of blockchain transactions, and applying one or more heuristic procedures to select one or more of the plurality of blockchain transactions which maximize a result associated with a next blockchain block.

## Claims

### Claim 1

A method, comprising:
receiving a plurality of blockchain transactions;
sorting an order of the plurality of blockchain transactions;
simulating committance processing of the plurality of blockchain transactions to identify mining costs associated with each of the plurality of blockchain transactions; and
applying one or more heuristic procedures to select one or more of the plurality of blockchain transactions which maximize a result associated with a next blockchain block.

### Claim 2 (depends on 1)

The method of claim 1, wherein the order of the plurality of blockchain transactions is determined by one or more of a nonce value of each of the plurality of blockchain transactions, a size of each of the plurality of blockchain transactions and a mining cost of each of the plurality of blockchain transactions.

### Claim 3 (depends on 1)

The method of claim 1, wherein the mining cost is a function of resource requirements needed for preparing each of the plurality of blockchain transaction for committance to the blockchain.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining the mining costs based on transaction data size for each of the plurality of blockchain transactions.

### Claim 5 (depends on 1)

The method of claim 1, wherein the one or more heuristic procedures comprise determining the mining costs and nonce values of each of the plurality of blockchain transactions.

### Claim 6 (depends on 5)

The method of claim 5, wherein the one or more heuristic procedures further comprise selecting the one or more blockchain transactions from the plurality of blockchain transactions based on data sizes for each of the plurality of blockchain transactions.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
selecting the one or more blockchain transactions for the next blockchain block based on a highest result value and a lowest mining cost associated with each of the one or more blockchain transactions.

### Claim 8

An apparatus, comprising:
a receiver configured to receive a plurality of blockchain transactions; and
a processor configured to
sort an order of the plurality of blockchain transactions;
simulate committance processing of the plurality of blockchain transactions to identify mining costs associated with each of the plurality of blockchain transactions; and
apply one or more heuristic procedures to select one or more of the plurality of blockchain transactions which maximize a result associated with a next blockchain block.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the order of the plurality of blockchain transactions is determined by one or more of a nonce value of each of the plurality of blockchain transactions, a size of each of the plurality of blockchain transactions and a mining cost of each of the plurality of blockchain transactions.

### Claim 10 (depends on 8)

The apparatus of claim 8, wherein the processor mines the cost via a function of resource requirements needed to prepare each of the plurality of blockchain transaction for committance to the blockchain.

### Claim 11 (depends on 8)

The apparatus of claim 8, wherein the processor is further configured to determine the mining costs based on transaction data size for each of the plurality of blockchain transactions.

### Claim 12 (depends on 8)

The apparatus of claim 8, wherein the one or more heuristic procedures comprise the processor being configured to determine the mining costs and nonce values of each of the plurality of blockchain transactions.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the one or more heuristic procedures further comprise the processor being configured to select the one or more blockchain transactions from the plurality of blockchain transactions based on data sizes for each of the plurality of blockchain transactions.

### Claim 14 (depends on 8)

The apparatus of claim 8, wherein the processor is further configured to
select the one or more blockchain transactions for the next blockchain block based on a highest result value and a lowest mining cost associated with each of the one or more blockchain transactions.

### Claim 15

A non-transitory computer readable storage medium configured to store instructions that when executed cause a processor to perform:
receiving a plurality of blockchain transactions;
sorting an order of the plurality of blockchain transactions;
simulating committance processing of the plurality of blockchain transactions to identify mining costs associated with each of the plurality of blockchain transactions; and
applying one or more heuristic procedures to select one or more of the plurality of blockchain transactions which maximize a result associated with a next blockchain block.

### Claim 16 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the order of the plurality of blockchain transactions is determined by one or more of a nonce value of each of the plurality of blockchain transactions, a size of each of the plurality of blockchain transactions and a mining cost of each of the plurality of blockchain transactions.

### Claim 17 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the mining cost is a function of resource requirements needed for preparing each of the plurality of blockchain transaction for committance to the blockchain.

### Claim 18 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
determining the mining costs based on transaction data size for each of the plurality of blockchain transactions.

### Claim 19 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the one or more heuristic procedures comprise determining the mining costs and nonce values of each of the plurality of blockchain transactions, and wherein the one or more heuristic procedures further comprise selecting the one or more blockchain transactions from the plurality of blockchain transactions based on data sizes for each of the plurality of blockchain transactions.

### Claim 20 (depends on 15)

The non-transitory computer readable storage medium of claim 15, wherein the processor is further configured to perform:
selecting the one or more blockchain transactions for the next blockchain block based on a highest result value and a lowest mining cost associated with each of the one or more blockchain transactions.
