JP2021103559A - Transaction request processing method in block chain, apparatus, device, medium, and program - Google Patents

Abstract

To provide a method, an apparatus, a device, a medium, and a program for selecting a transaction request, which improve a rationality and selection efficiency for a block chain node to select a transaction request during a block generation process, and improve a block out efficiency.SOLUTION: A transaction request processing method in a block chain includes the steps of: aggregating a select target transaction request having dependency in a block chain network to obtain at least one transaction request set; determining a candidate factor interval to which the transaction request set belongs, where the factor interval is used for measuring probability of the transaction request set participating in a block generation process; and selecting a current target factor interval from the candidate factor interval and selecting a current target transaction request set to participate in the block generation process from a candidate transaction request set corresponding to the current target factor interval.SELECTED DRAWING: Figure 1

Description

Embodiments of the present application relate to computer technology, specifically blockchain technology, and particularly to transaction request selection methods, devices, devices, media, and programs within the blockchain.

Currently, in blockchain networks where blockout incentive mechanisms exist, blockout nodes typically sort transactions according to the charge level of a large number of transactions and select wait-handed transactions.

However, normally, the number of transactions processed by the blockout node is limited, and by selecting the wait processing according to the processing fee, the dependency between transactions is very easy to be cut, and in the subsequent transaction processing. It is easy to lead to an error. Therefore, how to guarantee the incentive income of the blockout node and ensure the smooth execution of each transaction still remains an urgent issue in the blockchain area. For blockout nodes, how to improve the blockout efficiency is also an issue that cannot be ignored.

Embodiments of the present application disclose transaction request processing methods, devices, devices, and media within the blockchain to improve the rationality and selection efficiency of blockchain nodes selecting transaction requests during the block generation process. Moreover, the blockout efficiency can be improved.

In the first aspect, the embodiment of the present application discloses a transaction request processing method in a blockchain, and the method is described as.
A step of aggregating selected transaction requests that have dependencies in the blockchain network to obtain at least one transaction request set.
A step of determining the candidate factor interval to which the transaction request set belongs, the factor interval is a step used to measure the probability that the transaction request set participates in the block generation process, and
The step includes selecting the current target factor interval from the candidate factor interval and selecting the current target transaction request set participating in the block generation process from the candidate transaction request set corresponding to the current target factor interval.

In the second aspect, the embodiment of the present application further discloses a transaction request processing device in the blockchain, which device.
A transaction request set determination module that aggregates selected transaction requests that have dependencies in a blockchain network to obtain at least one transaction request set, and a transaction request set determination module.
A candidate factor interval determination module that determines the candidate factor interval to which the transaction request set belongs, wherein the factor interval is used to measure the probability that the transaction request set will participate in the block generation process. Modules and
A transaction request set selection module that selects the current target factor interval from the candidate factor intervals and selects the current target transaction request set that participates in the block generation process from the candidate transaction request sets corresponding to the current target factor interval. And have.
In a third aspect, an embodiment of the present application further discloses an electronic device, wherein the electronic device is:
With at least one processor
It has a memory connected to the at least one processor so as to be communicable.
The memory stores an instruction that can be executed by the at least one processor, and the instruction executes the transaction request processing method in the blockchain according to any one embodiment of the present application. It is executed by the at least one processor so as to make it possible.

In a fourth aspect, an embodiment of the present application provides a non-instantaneous computer-readable storage medium containing computer instructions for causing a computer to execute the transaction request processing method in the blockchain according to any one embodiment of the present application. It is disclosed.

According to the technical proposal of the embodiment of the present application, the block generation process is performed according to the cyclic logic of selecting the current target factor interval and selecting the current target transaction request set from the candidate transaction request sets corresponding to the current target factor interval. The target transaction request set that participates in is cumulatively determined after at least one circular selection, and finally blocks are generated by executing the transaction requests in the cumulatively determined target transaction request set. Here, there is a dependency between the transaction requests in the target transaction request set, and the rationality and selection efficiency of selecting the transaction request by the blockchain node in the block generation process are improved, and the blockout efficiency is improved. be able to.
What is described in the section of the abstract of the invention is not intended to limit the main or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Should be understood. Other features of the present application may be easily understood by reading the following description.

The accompanying drawings are used to better understand the present embodiment and do not constitute a limitation to the present application.
It is a flowchart of the transaction request processing method in a blockchain disclosed in the embodiment of this application. It is a schematic diagram of the dependency relationship between a plurality of transaction requests disclosed in the embodiment of the present application. It is a flowchart of the transaction request processing method in another blockchain disclosed in the embodiment of this application. FIG. 5 is a schematic diagram of an ordered graph of price / performance ratio and an ordered graph of a candidate transaction request set disclosed in the embodiment of the present application. It is a schematic diagram of the transaction request processing architecture in the blockchain disclosed in the embodiment of the present application. It is a flowchart of the transaction request processing method in another blockchain disclosed in the embodiment of this application. It is a schematic diagram of the structure of the transaction request processing apparatus in the blockchain disclosed in the embodiment of the present application. It is a block diagram of the electronic device disclosed in the Embodiment of this application.

Hereinafter, with reference to the drawings, exemplary embodiments of the present disclosure will be described and various details of the embodiments of the present disclosure will be included for ease of understanding, but these are considered merely exemplary. Should be. Therefore, one of ordinary skill in the art should be aware that various changes and modifications can be made to the embodiments described herein without departing from the scope and gist of the present disclosure. Similarly, the following description omits a description of known features and structures for clarity and brevity.

FIG. 1 is a flowchart of a transaction request processing method in a blockchain disclosed in an embodiment of the present application, and how a blockchain node having a bookkeeping right (or a blockout right) waits in a block generation process. The alternatives that are applicable in the rational and efficient selection of transactional requirements and disclosed in embodiments of the present application are preferably for blockchain networks that deploy consensus mechanisms with competing blockouts. Applicable. Chain networks include, but are not limited to, consortium chain networks, public chain networks, and the like. The method disclosed in the embodiments of the present application may be performed by a transaction request processing device in the blockchain, which device may be implemented in software and / or hardware and integrated on the blockchain node. The blockchain node may be deployed on any electronic device having computing power.

As shown in FIG. 1, the transaction request processing method in the blockchain disclosed in the embodiment of the present application may include the following.

In S101, the selected transaction requests having the dependency in the blockchain network are aggregated to obtain at least one transaction request set.

Here, the dependency between transaction requests is a situation in which a blockchain node needs to depend on the processing result of another transaction request in the process of executing a specific transaction request, or in the process of executing another transaction request. Refers to a situation where you need to depend on the processing result of the current transaction request. A selected transaction request is a transaction request that is not selected by a blockchain node in the blockchain network and has not decided whether to participate in the block generation process. At least one transaction request set (or called a transaction request sequence) in which at least one transaction request in each transaction request set has a dependency on each other by aggregating selected transaction requests having dependencies in the blockchain network. To get. The number of transaction requests contained in each transaction request set depends on the situation.

FIG. 2 shows, by way of example, a schematic diagram of one dependency between multiple transaction requests and should not be construed as a particular limitation on embodiments of the present application. As shown in FIG. 2, transaction request A depends on transaction request B, transaction request B depends on transaction request C, and transaction request A, transaction request B, and transaction request C form one transaction request set 1. You may. The transaction request D is an independent transaction request that does not depend on other transaction requests, and the transaction request D may independently form one transaction request set 2. Transaction request E depends on transaction request F, transaction request F depends on transaction request H, and transaction request G also depends on transaction request H, and thus transaction request E, transaction request F, transaction request H and transaction. Request G can form one transaction request set 3.

In S102, the candidate factor interval to which the transaction request set belongs is determined, in which the factor interval is used to measure the probability that the transaction request set will participate in the block generation process.

In the embodiment of the present application, a plurality of candidate factor intervals can be preset, and the candidate factor intervals thereof are, for example, (0, N], (N, 2N], ..., (x · N, (x + 1). N)] may be expressed, and the values of x and N may be set according to the actual situation. There is no overlap between the upper and lower limits between the candidate factor intervals, and the intervals. The higher the upper or lower limit value of, the higher the probability that a transaction request set within the interval will be selected to participate in the block generation process, and each transaction based on the attributes of each transaction request set. Determines the candidate factor interval to which the request set belongs. The attributes of the transaction request set may be any characteristic information that can be used to measure whether the transaction request set has been selected to participate in the block generation process. For example, an attribute of a transaction request set contains one or more factors such as the number of transaction requests contained in the set, payment certificate information for the transaction request, the space occupancy (size) of the transaction request, and the priority of the transaction request. In the example, an incentive factor for each transaction request set, that is, an evaluation value for the transaction request set, may be determined based on the attributes of the transaction request set, and then based on the incentive factor. Therefore, the candidate factor interval to which each transaction request set belongs may be determined.

Taking one consideration factor as an example, if the number of transaction requests contained in the transaction request set is within a predetermined threshold interval, the incentive factor of the transaction request set is larger, that is, because it participates in the block generation process. It can be considered that the probability of being selected by the blockchain node is greater, where the threshold interval is the time cost of the blockchain node to execute each transaction request and the packaging to generate the block. It can be determined on the basis of time cost, which allows the blockchain node to achieve a comprehensive assessment of whether the time cost to execute each selected transaction request is reasonable during the block generation process. Make it possible. In the transaction request set, when the difference between the number of transaction requests having payment certificate information exceeding the voucher threshold and the first number threshold is large, it can be considered that the incentive factor of the transaction request set is large. Here, the transaction request payment certificate information, or processing fee, represents the incentive or revenue that can be obtained after the blockchain node executes the transaction request, so that the transaction request with high payment certificate information included in the transaction request set. The greater the number of, the more likely the blockchain node will choose its transaction request set to participate in the block generation process from a profitability standpoint. When the difference between the number of transaction requests belonging to a high priority in the transaction request set and the second number threshold is large, the larger the incentive factor of the transaction request set may be considered, and here, the transaction. The priority of the request may be determined by the blockchain system or specified by the blockchain node itself, depending on factors such as the business type, generation time, importance, and business value involved in the transaction request. .. The embodiment of the present application is not specifically limited. The various types of thresholds involved are adaptively set in practical applications and the embodiments of the present application are not particularly limited.

Based on the above description, the incentive factor for the transaction request set may be determined in a complex manner based on at least two considerations. Illustratively, the incentive factor for a transaction request set is the difference between the number of transaction requests in the transaction request set and the first number threshold that have payment certificate information that exceeds the voucher threshold in the transaction request set, and high priority. It may be determined based on the difference between the number of transaction requests belonging to and the second number threshold. Further, the more transaction requests with high payment certificate information included in the transaction request set and the more transaction requests belonging to the high priority included in the transaction request set, the larger the incentive factor of the transaction request set becomes. In general, transaction requests that belong to a higher priority also correspond to higher certificate information.

Also, exemplary, the incentive factor for a transaction request set is determined based on the transaction request payment certificate information and space occupancy in the transaction request set, which is, for example, the total payment certificate for each transaction request in the transaction request set. Calculate the information, that is, the sum of the payment certificate information for each transaction request. The total space occupancy of each transaction request in the transaction request set, that is, the total space occupancy of each transaction request (sum_size) is calculated. The quotient value of total certificate information and total space occupancy is used as an incentive factor for the transaction request set. In this case, the incentive factor can also be said to be the price / performance ratio of the transaction request set, and the space occupancy of each selected transaction request and the revenue obtained by executing these transaction requests are sent to the blockchain node. You can make trade-offs based on, make full use of block space, and rationalize to maximize profits as much as possible, which is for blockchain nodes to actively compete for bookkeeping rights. It also provides an effective incentive, which in turn allows a more effective and rational incentive calculation model to exist within the blockchain network, ensuring the normal and timely generation of blocks.

When a blockchain node chooses a transaction request that participates in the block generation process purely according to the level of processing charges, not only is the dependency between the transaction requests not guaranteed, but the space occupancy of the transaction request with a high processing charge is not guaranteed. As the block space limit increases, the number of transaction requests that can be executed by the blockchain node is limited, so the processing fee for each transaction request is high, but the number of transaction requests that can be executed by the blockchain node is small. The choice of transaction request by the blockchain node may still be unreasonable, as the final incentive or revenue may not be optimal, i.e. participate in block generation from a revenue perspective. No effective incentive effect for blockchain nodes can be obtained. The unreasonable problem of choosing a transaction request based solely on the amount of processing charges is solved by taking into account the payment certificate information and space occupancy of the transaction request comprehensively.

Further, based on the above technical proposal, the step of determining the candidate factor interval to which the transaction request set belongs is
A step of matching the candidate factor interval to which the transaction request set belongs by traversing the upper and lower limits of the created factor interval based on the incentive factor of the transaction request set, wherein the incentive factor is a blockchain node. Is used to characterize the incentives obtained by executing a transactional request within a transactional request set, or to characterize the probability that a transactional request set will participate in the block generation process, and
If they do not match, it involves reconstructing the candidate factor interval to which the transaction request set belongs. That is, the candidate factor interval can change dynamically according to the generation of the transaction request set.

In S103, the current target factor interval is selected from the candidate factor intervals, and the current target transaction request set participating in the block generation process is selected from the candidate transaction request sets corresponding to the current target factor intervals.

After determining the candidate factor spacing to which the transaction request set belongs, the current target factor spacing can be selected from multiple candidate factor spacings, eg, the upper bound of the spacing or the spacing, based on a preset spacing selection strategy. The candidate factor interval with the largest lower limit can be preferentially selected. Next, the current target transaction request set is selected from a plurality of candidate transaction request sets corresponding to the current target factor interval based on the set selection strategy. For example, a transaction is performed in a plurality of candidate transaction request sets. The set with the largest space occupancy of requests is preferentially selected as the current target transaction request set. Here, the set selection strategy may be determined by the specific needs for the attributes of the transaction request set in the business processing process, that is, the number of transaction requests contained in the candidate transaction request set, the transaction request payment certificate information, and the transaction request. Any of the factors such as the space occupancy of the transaction request, the priority of the transaction request, etc. may be used as the selection factor of the transaction request of the current goal set based on the current business needs.

Furthermore, after selecting the current target transaction request set to participate in the block generation process, the method disclosed in the embodiments of the present application may further include:

Calculates the total space occupancy between the current target transaction request set and the target transaction request set selected in the current block generation cycle.

If the total space occupancy obtained is less than the block space threshold, at least one new transaction request set is determined based on the dependencies between the remaining selected transaction requests, and the new transaction request set Based on this, the determination operation of the new current target transaction request set is executed, that is, the operations of S101 to S103 are repeated.

Here, the block space threshold is related to the space size of the block in the blockchain network and may be used to reflect the upper limit of the space size of the block. The remaining selected transaction requests are transaction requests in the blockchain network, excluding the current target transaction request set and the transaction requests in the target transaction request set selected in the current block generation cycle.

If, after at least one circular selection of the target transaction request set, the finally cumulatively determined transaction request satisfies the block generation condition, the blockchain node executes the selected individual transaction request and the current one. You can generate blocks and add them to the blockchain.

According to the technical proposal of the embodiment of the present application, in each cyclic selection process of the target transaction request set, first, a plurality of transaction request sets are obtained according to the dependency between the selected transaction requests, and the candidate factor to which the transaction request set belongs is obtained. The transaction request set is categorized according to the interval, then the current target factor interval is selected from multiple candidate factor intervals, and the current target transaction request set is selected from the candidate transaction request sets corresponding to the current target factor interval. Is selected and participates in the block generation process. This solves the problem that the existing plan divides the dependency between transaction requests so that the blockchain node unreasonably selects the transaction request that participates in the block generation process, which affects the block generation efficiency. However, the rationality and selection efficiency when the blockchain node selects a transaction request in the block generation process are improved, and the blockout efficiency is improved.

Based on the above technical proposal, the step of optionally aggregating the selected transaction requests having a dependency in the blockchain network to obtain at least one transaction request set is
Steps to build a directed acyclic graph between selected transaction requests based on the dependencies between selected transaction requests in the blockchain network,
A directed acyclic graph is used to include a step of aggregating selected transaction requests with dependencies to obtain at least one transaction request set.

Specifically, each selected transaction request may function as a node of the directed acyclic graph, and the dependency between the selected transaction requests may function as an edge of the directed acyclic graph. By constructing a directed acyclic graph, the dependencies between each selected transaction request can be managed in an orderly manner, and the directed acyclic graph is highly extensible, and all according to the increase or decrease of the selected transaction request. Can be changed flexibly. Further, the transaction request set includes a leaf transaction request and each non-leaf transaction request on which the leaf transaction request depends, and the leaf transaction requests in different transaction request sets are different.

In Example 1, the following three transaction request sets can be determined by taking the dependency relationship between the plurality of transaction requests shown in FIG. 2 as an example.
Transaction request set 1: Transaction request A → transaction request B → transaction request C;
Transaction request set 2: Transaction request D;
Transaction request set 3: Transaction request E → transaction request F → transaction request H, and transaction request G → transaction request H.

Here, in the transaction request collection 1, transaction request A is a leaf transaction request, and transaction request B and transaction request C are non-leaf transaction requests on which the leaf transaction request depends.

In transaction request collection 2, transaction request D is an independent transaction request.
In the transaction request set 3, transaction request E and transaction request G are leaf transaction requests, transaction request F and transaction request H are non-leaf transaction requests on which leaf transaction request E depends, and transaction request H is leaf transaction request G. Is a non-leaf transaction request that depends on.

In Example 2, assuming that the selected transaction request can correspond to a transaction, the following dependencies exist between multiple transactions: transaction 2 depends on transaction 1 and transaction 3 depends on transaction 2. , Transaction 4 depends on transaction 3. Then, the transaction request set or transaction sequence can be expressed as follows.

Transaction sequence 1: Transaction 1.
Transaction sequence 2: Transaction 2 → Transaction 1.
Transaction sequence 3: Transaction 3 → Transaction 2 → Transaction 1.
Transaction sequence 4: Transaction 4 → Transaction 3 → Transaction 2 → Transaction 1.
Here, in the transaction sequence 1, transaction 1 is an independent transaction.

In transaction sequence 2, transaction 2 is a leaf transaction and transaction 1 is a non-leaf transaction (or referred to as an ancestor transaction).
In the transaction sequence 3, transaction 3 is a leaf transaction, and transaction 2 and transaction 1 are non-leaf transactions.
In the transaction sequence 4, transaction 4 is a leaf transaction, and transaction 3, transaction 2, and transaction 1 are non-leaf transactions.

And, as can be seen from the above example, if the same dependency exists between multiple selected transaction requests, each transaction request set will contain the earliest dependent transaction request (or the oldest ancestor transaction). (Called a request) is included. For example, in the above example, all of the transaction sequence 2-transaction sequence 4 includes the oldest ancestor transaction: transaction 1.

After the selection cycle of the current target transaction request set is completed, the transaction requests contained in the current target transaction request set are deleted from the selected transaction requests in the current blockchain network, and the remaining selected transaction requests are acquired. It can then be used to reconstruct the directed non-circular graph based on the dependencies between the remaining selected transaction requests and determine a new current target transaction request set.

FIG. 3 is a flowchart of a transaction request processing method in another blockchain disclosed in the embodiment of the present application, which is further optimized and extended based on the above technical proposal, and is further optimized and extended based on the above-mentioned technical proposal. May be combined with each of. As shown in FIG. 3, the method includes the following steps.

In S301, the selected transaction requests having the dependency in the blockchain network are aggregated to obtain at least one transaction request set.
In S302, the candidate factor interval to which the transaction request set belongs is determined, and the factor interval is used to measure the probability that the transaction request set participates in the block generation process.

Here, the incentive factor of the transaction request set may be determined based on the payment certificate information and the space occupancy of the transaction request in the transaction request set, in which case the incentive factor also also determines the price / performance ratio of the transaction request set. Called and used to characterize the incentives that a blockchain node obtains by executing a set of transaction requests. Then, by traversing the upper and lower limits of the created factor interval based on the incentive factor of the transaction request set, the candidate factor interval to which the transaction request set belongs is matched. If they do not match, reconstruct the candidate factor interval to which the transaction request set belongs. That is, the candidate factor interval can be dynamically changed according to the generation of the transaction request collection.

In S303, the current factor interval is selected according to the interval value of the candidate factor interval.
For example, as the current factor interval, the candidate factor interval having the largest interval upper limit value or interval lower limit value may be preferentially selected.

In S304, the current transaction request set is selected from the candidate transaction request sets corresponding to the current factor interval according to the space occupancy of the candidate transaction request set corresponding to the current factor interval.

Specifically, in the candidate transaction request set corresponding to the current factor interval, the space occupancy of the candidate transaction request set is sorted to determine the current transaction request set based on the sorting result, for example. , Sort from maximum to minimum according to the space occupancy of the candidate transaction request set, preferably the first-ranked candidate transaction request set is used as the current transaction request set. Alternatively, among the candidate transaction request sets corresponding to the current factor interval, the candidate transaction request set whose space occupancy is larger than the space occupancy threshold is determined as the current transaction request set, and the space occupancy threshold is flexibly set. Often, for example, the candidate transaction request set with the largest space occupancy may be selected as the current transaction request set based on the space occupancy threshold.

The space size of each interval on the blockchain is relatively fixed, and by selecting the current transaction request set according to the space occupancy of the candidate transaction request set, the candidate transaction with a relatively large space occupancy Priority selection for the request set can be achieved, and by maximizing the block space, the number of transaction request selections that participate in the block generation process can be reduced to some extent, and the blockchain node can reduce the number of selections. A block that can save time cost (computational power) to select a transaction request, thereby balancing node revenue and computational power consumption and deploying a consensus mechanism with competing blockouts. For the chain network, the blockchain node has sufficient computing power and competes for bookkeeping rights. Therefore, the consumption of computing power when selecting a transaction request is large, and the competition for bookkeeping rights fails. You can avoid not doing it. In addition, the number of transaction request sets selected is reduced, and the total number of transaction requests selected cumulatively can be relatively reduced, resulting in the blockchain node consuming to generate blocks. The computing power to do can also be reduced.

In S305, the current transaction request set is verified based on the current transaction request set and the target transaction request set selected in the current block generation cycle.
In S306, the current target factor interval and the current target transaction request set are determined based on the verification result.

Specifically, whether the number of transaction request sets cumulatively selected by the blockchain node or the number of transaction requests cumulatively selected by the blockchain node so far exceeds the corresponding number threshold, or The current transaction request set may be validated based on a given validation strategy, such as whether the total space occupancy of the transaction request set cumulatively selected by the blockchain node exceeds the block space threshold. Here, the block space threshold is related to the space size of the block in the blockchain network and may be used to reflect the upper limit of the space size of the block.

Illustratively, the step of validating the current transaction request set based on the current transaction request set and the target transaction request set selected in the current block generation cycle is
Steps to calculate the total space occupancy between the current transaction request set and the target transaction request set selected in the current block generation cycle,
It includes a step of verifying the current transaction request set based on the relationship between the total space occupancy and the block space threshold.

So far, if the number of transaction request sets cumulatively selected by the blockchain node or the number of transaction requests cumulatively selected by the blockchain node does not exceed the corresponding number threshold, or by the blockchain node. Validation is considered pass, the current factor interval is used as the current target factor interval, and the current transaction, for example, if the sum of the spatial occupancy of the cumulatively selected transaction request set does not exceed the block space threshold. The request set is used as the current target transaction request set. If validation fails, the current target factor interval and the current target transaction are based on the remaining candidate transaction request set or the remaining candidate factor interval corresponding to the current target factor interval until the block generation condition is met. The request set decision operation needs to be performed again. Here, the remaining candidate transaction request set corresponding to the current factor interval includes the transaction request set corresponding to the current factor interval other than the transaction request set whose validation failed, and the remaining candidate factor interval is the current factor. Includes candidate factor intervals other than intervals.

According to the technical proposal of the embodiment of the present application, in the process of each circular selection of the target transaction request set, the current factor interval is selected according to the interval value of the candidate factor interval to which the transaction request set belongs, and the current factor interval is set to the current factor interval. Based on the transaction request set that has been cumulatively selected so far after selecting the current transaction request set from the corresponding candidate transaction request sets based on the space occupancy of the candidate transaction request set that corresponds to the current factor interval. By verifying the current transaction request set, the current target factor interval and the current target transaction request set are determined based on the verification result. This is a problem that the existing plan divides the dependency between transaction requests so that the blockchain node unreasonably selects the transaction request to participate in the block generation process, which further affects the block generation efficiency. It solves the problem, improves the selection efficiency when the blockchain node selects the transaction request in the block generation process, and ensures the rationality of selecting the target transaction request set in each circular selection process. In particular, it first determines the candidate factor interval to which the transaction request set belongs, based on the transaction request payment certificate information and space occupancy in the transaction request set, and then is cumulatively selected by the blockchain nodes so far. Based on whether the total space occupancy of the transaction request set is exceeding the block space threshold, the currently selected transaction request set is verified, and the block space is determined after fully considering the profit of the blockchain node. A fully usable effect can be achieved.

Based on the above-mentioned technical proposal, preferably, the current target factor interval and the current target transaction request set are determined based on the verification result.

If validation of the current transaction request set fails, use the current factor interval as the current target factor interval and base the current target transaction request set on the remaining candidate transaction request sets that correspond to the current factor interval. Perform the decision operation. Here, the remaining candidate transaction request sets include transaction request sets corresponding to the current factor intervals other than the transaction request sets for which validation failed. Illustratively, the remaining candidate transaction request sets may be considered in order, from largest to smallest, depending on the space occupancy of the transaction request set.

In addition, the steps to determine the current target factor interval and the current target transaction request set based on the validation results are also
If the current target transaction request set cannot be determined from the remaining candidate transaction request sets corresponding to the current factor interval, the current target factor interval determination operation is executed based on the remaining candidate factor intervals to determine a new one. Includes the step of performing a decision operation on the current target transaction request set based on the candidate transaction request set corresponding to the current target factor interval, where the remaining candidate factor intervals are candidate factors other than the current factor interval. Includes intervals. Illustratively, the remaining candidate factor intervals may be considered in the order in which the upper limit of the interval or the lower limit of the interval decreases in order.

That is, in the cyclic determination process of the target transaction request set, it is preferable to determine the current target transaction request set from the candidate transaction request sets corresponding to the current target factor interval through multiple selections and verifications. Then, it is conceivable to determine the current target transaction request set from among the candidate transaction request sets corresponding to the remaining candidate factor intervals, so that the blockchain node determines the current target transaction request set. High selection efficiency can be maintained even when it is necessary to pass multiple selections. Also, the incentive factor for a transactional request set can be used to characterize the incentives that a blockchain node obtains by executing a transactional request within a transactional request set. The candidate transaction request set corresponding to the candidate factor interval with the highest lower limit yields a relatively large profit to the blockchain node, and the current target transaction request in priority order such as the current target factor interval and the remaining candidate factor interval. You can select a set. This can ensure the reasonable maximization of revenue of the blockchain node and can reduce the loss of revenue to the maximum.

If the incentive factor of the transaction request set is determined based on the payment certificate information and the space occupancy of the transaction request in the transaction request set based on the above technical proposal, the incentive factor is the price performance of the transaction request set. It may also be referred to as a ratio, and therefore FIG. 4 shows, as an example, a schematic diagram of an ordered graph of price / performance ratios and an ordered graph of candidate transaction request sets, as a specific limitation of embodiments of the present application. Should not be interpreted. Here, the ordered graph of the price / performance ratio means that the candidate factor intervals of the transaction request set are rearranged according to the interval values such as the upper limit value and the lower limit value, and the candidate factor intervals 1, 2, ... .. .. .. .. .. N or price / performance ratio interval 1, 2, ... .. .. .. .. .. It means to get an ordered graph of intervals including N, where N is an integer. The candidate factor interval and the corresponding candidate transaction request set follow a key-value pair (key-value) relationship, for example, using the candidate factor interval as a key and the candidate transaction request set corresponding to the candidate factor interval as a key value. It may be stored. Further, a plurality of candidate transaction request sets corresponding to each candidate factor interval N or price / performance ratio interval N are rearranged from the larger one to the smaller one according to the space occupancy of each candidate transaction request set, and the candidate transaction request is requested. You may get the ordered graph N of the set. The ordered graph of each candidate transaction request set may also be stored in the form of a key-value pair, for example, within the same candidate factor interval, keyed by the set sequence or number of each candidate transaction request set, and the candidate transaction. The space occupancy of the request set can be stored as a key value. Whenever a new candidate factor interval or price / performance ratio interval is created, or the candidate transaction request set within the interval is changed, the candidate transaction request set currently corresponding to that interval depends on the space occupancy of the set. It is sorted to give an ordered graph of the candidate transaction request set.

By comprehensively using the ordered graph of the price / performance ratio and the ordered graph of the candidate transaction request set, it is possible to efficiently manage the selected transaction request in the selection process of the target transaction request set, and the target transaction. It can lay the foundation for efficient selection of request sets.

FIG. 5 is a schematic diagram of the transaction request processing architecture in the blockchain disclosed in the embodiment of the present application. As shown in FIG. 5, during the current block generation cycle, selected transaction requests may be stored in the blockchain network in the form of a selected transaction request list, depending on the dependency between the selected transaction request sets. Based on this, a directed acyclic graph is constructed and at least one transaction request set is determined. The candidate factor interval to which the transaction request set belongs is then determined based on the incentive factor of the transaction request set. The blockchain node is then used to determine the current target factor interval using the constructed price-performance ratio ordered graph and the current target transaction request set using the ordered graph of the candidate transaction request sets. Can improve the efficiency of selecting a transaction request set that participates in the block generation process. In addition, as the current target transaction request set is determined, the directed acyclic graph, the price / performance ratio ordered graph, and the candidate transaction request set ordered graph become the remaining selected transaction requests in the blockchain network. It can be changed adaptively accordingly.

FIG. 6 is a flowchart of a transaction request processing method in another blockchain disclosed in the embodiment of the present application, which is further optimized and extended based on the above technical proposal, and is further optimized and extended based on the above-mentioned technical proposal. May be combined with each of. Specifically, FIG. 6 illustrates the process of selecting the current target transaction request set in the embodiment of the present application by exemplifying the execution process of a finite number of cycles, and specifies the embodiment of the present application. Should not be construed as a limitation of. As shown in FIG. 6, the method may include:

In S601, an ordered graph of the candidate transaction request set corresponding to the current highest price / performance ratio interval is selected.
In S602, the candidate transaction request set having the largest space occupancy in the ordered graph of the candidate transaction request set is selected.

In the ordered graph of the candidate transaction request set corresponding to the current highest price performance ratio interval, the time cost for the blockchain node to select the transaction request is reduced, and the balance between revenue and time cost (computational capacity) is balanced. In order to secure its own bookkeeping right, the candidate transaction request set having the largest space occupancy is selected as the current target transaction request set as the first priority. This is because if the candidate transaction request set with the highest price / performance ratio is selected at the same price / performance ratio interval each time, the maximum profit can be guaranteed, but there is a risk that the processing cost will be high. When processing 100 transactions with a very small interval occupancy, the total revenue is 100, while when processing the transaction with the largest space occupancy, the total revenue is 99, but the space occupancy is the largest. Processing the cost of large transactions is only 1% of the former in terms of time cost. In a blockout competing scenario, if the blockchain node spends all of its time cost finding the best transaction with the highest profit, it may lose its bookkeeping rights, so the revenue and time cost Both need to be balanced and the effect is achieved with both in mind.

In S603, it is determined whether or not the block space threshold value is exceeded based on the integrated space occupancy.
If YES, step S604 is executed, and if NO, step S607 is executed.

In S604, in the ordering graph of the current candidate transaction request set, it is determined whether or not there is a transaction request candidate set having a small selectable space occupancy.

If YES, step S606 is executed, and if NO, step S605 is executed.
In S605, an ordered graph of the candidate transaction request set corresponding to the second highest price / performance ratio interval is selected.

In S606, the candidate transaction request set having a relatively small space occupancy is selected in the ordered graph of the current candidate transaction request set.

Specifically, in the ordered graph of the candidate transaction request set corresponding to the current highest price performance ratio interval, the candidate transaction request set having the second largest space occupancy is selected, step S603 is returned, and the cumulative space occupancy is accumulated. Determines again whether or not exceeds the block space threshold, and performs cyclic execution until a candidate transaction request set that can participate in the block generation process is selected. This ensures that the spatial occupancy of the cumulatively selected set does not exceed the block space threshold.

In S607, if it is determined that the candidate transaction request set having the largest space occupancy can be added to the block, the candidate transaction request set is deleted, and the ordered graph of the corresponding candidate transaction request set is empty, the candidate transaction request set is deleted. Delete the ordered graph of the corresponding candidate transaction request set and the corresponding price-performance ratio interval.

If the cumulatively selected target transaction request set satisfies the block generation condition after multiple circular selections, for example, the total space occupancy of the cumulatively selected target transaction request set is the block space. It can be considered that the threshold has been reached, i.e., the block space is fully utilized, and a cumulatively selected transaction request can be executed to generate a block.

According to the technical proposal of the embodiment of the present application, in the process of selecting the target transaction request set, the transaction request to be selected is selected by comprehensively utilizing the ordered graph of the price / performance ratio and the ordered graph of the candidate transaction request set. In addition to achieving effective management of transactions, it is possible to improve the rationality of transaction request selection by blockchain nodes in the block generation process, improve selection efficiency, and improve blockout efficiency, and at the same time. From the viewpoint of earning profits, it is possible to effectively guarantee the profits of blockchain nodes that have bookkeeping rights, and it is also effective as an incentive strategy for blockchain nodes that actively seek to acquire bookkeeping rights.

FIG. 7 is a schematic diagram of the structure of the transaction request processing device in the blockchain disclosed in the embodiment of the present application. In the embodiment of the present application, how the blockchain node rationalizes the transaction request for waiting processing in the block generation process. It is applicable when selecting objectively and efficiently. The devices disclosed in the embodiments of the present application may be implemented in software and / or hardware and may be integrated on a blockchain node, which blockchain node is on any electronic device capable of computing power. May be deployed in.

As shown in FIG. 7, the transaction request processing device 700 in the blockchain disclosed in the embodiment of the present application includes the transaction request set determination module 701, the candidate factor interval determination module 702, and the transaction request set selection module 703. Good.

The transaction request set determination module 701 aggregates the selected transaction requests having a dependency in the blockchain network to obtain at least one transaction request set.

The candidate factor interval determination module 702 determines the candidate factor interval to which the transaction request set belongs, and the factor interval is used to measure the probability that the transaction request set will participate in the block generation process.

The transaction request set selection module 703 selects the current target factor interval from the candidate factor intervals and selects the current target transaction request set to participate in the block generation process from the candidate transaction request sets corresponding to the current target factor intervals. ..
Preferably, the candidate factor spacing module 702
A match unit that matches the candidate factor interval to which the transaction request set belongs by traversing the upper and lower limits of the created factor interval based on the incentive factor of the transaction request set. The incentive factor is a blockchain node. With the match unit used to characterize the incentives obtained by executing a transaction request in a transaction request set,
If it does not match, it contains a restructuring unit that reconstructs the candidate factor interval to which the transaction request set belongs.

Preferably, the transaction request collection selection module 703
An interval selection unit that selects the current factor interval according to the interval value of the candidate factor interval, and
A set selection unit that selects the current transaction request set from the candidate transaction request set corresponding to the current factor interval according to the space occupancy of the candidate transaction request set corresponding to the current factor interval.
A validation unit that validates the current transaction request set based on the current transaction request set and the target transaction request set selected in the current block generation cycle.
Includes a decision unit that determines the current target factor interval and the current target transaction request set based on the validation results.

Preferably, the verification unit is
A computational subunit that calculates the total space occupancy of the current transaction request set and the target transaction request set selected in the current block generation cycle.
Includes a validation subunit that validates the current set of transaction requests based on the relationship between total space occupancy and block space threshold.

Preferably, the decision unit is
If validation against the current transaction request set fails, the current factor interval is taken as the current target factor interval, and the decision operation of the current target transaction request set is performed based on the remaining candidate transaction request sets corresponding to the current factor interval. Contains the first decision subunit to perform
Here, the remaining candidate transaction request sets include transaction request sets corresponding to the current factor interval other than the transaction request sets for which validation failed.
If the first decision subunit passes validation against the current transaction request set, it uses the current factor interval as the current target factor interval and the current transaction request set as the current target transaction request set.

Preferably, the decision unit is further
If the current target transaction request set cannot be determined from the remaining candidate transaction request sets corresponding to the current factor interval, the current target factor interval determination operation is executed based on the remaining candidate factor intervals to determine a new one. Contains a second decision subsystem that performs a decision operation on the current target transaction request set based on the candidate transaction request set corresponding to the current target factor interval.
Here, the remaining candidate factor intervals include candidate factor intervals other than the current factor interval.

Preferably, the set selection unit is specifically used as follows.
By sorting the space occupancy of the candidate transaction request set from the candidate transaction request sets corresponding to the current factor interval, the current transaction request set is determined based on the result of the sorting; or the current factor interval. From the candidate transaction request sets corresponding to, the candidate transaction request set whose space occupancy is larger than the space occupancy threshold is determined as the current transaction request set.

Preferably, the apparatus disclosed in the embodiments of the present application further comprises.
Candidate factor interval determination module 702 is an incentive factor for a transaction request set based on the transaction request payment certificate information and space occupancy in the transaction request set before executing the operation to determine the candidate factor interval to which the transaction request set belongs. Includes an incentive factor determination module for determining.

Preferably, the transaction request collection decision module 701
A directed acyclic graph building unit that builds a directed acyclic graph between selected transaction requests based on the dependencies between selected transaction requests in the blockchain network.
Includes a transaction request set determination unit, which uses a directed acyclic graph to aggregate selected transaction requests with dependencies to obtain at least one transaction request set.

Preferably, the transaction request set includes a leaf transaction request and each non-leaf transaction request on which the leaf transaction request depends, and the leaf transaction requests in different transaction request sets are different.

Preferably, a consensus mechanism for competing blockouts is deployed on the blockchain network.

The transaction request processing device 700 in the blockchain disclosed in the embodiment of the present application can execute any of the transaction request processing methods in the blockchain disclosed in the embodiment of the present application, and the functional module corresponding to the execution method and the function module corresponding to the execution method. Has a beneficial effect. Not described in detail in embodiments of the apparatus of the present application can be referred to in the embodiments of any method of the present application.

According to embodiments of the present application, embodiments of the present application also provide electronic devices and readable storage media.
As shown in FIG. 8, FIG. 8 is a block diagram of an electronic device for implementing the transaction request processing method in the blockchain according to the embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. .. Electronic devices can also represent various forms of mobile devices, such as personal digital processing, mobile phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are intended by way of example only and limit the realization of the embodiments of the present application described and / or claimed herein. Is not intended.

As shown in FIG. 8, the electronic device has one or more processors 801 and memory 802, and an interface including a high speed interface and a low speed interface for connecting each component. The various components are interconnected using different buses and may be mounted on a common motherboard or in other forms as desired. The processor may process instructions for execution within an electronic device, which may be a memory-stored instruction or a memory graphical user interface to an external input / output device (eg, a display device coupled to an interface). Includes instructions for displaying graphical information of (Graphical User Interface, GUI). In other embodiments, a plurality of processors and / or a plurality of buses and a plurality of memories may be used together with the plurality of memories, if desired. Similarly, multiple electronic devices may be connected and each device provides some of the required operations, eg, a server array, a group of blade servers, or a multiprocessor system. One processor 801 is shown in FIG. 8 as an example.

The memory 802 is a non-instantaneous computer-readable storage medium provided by an embodiment of the present application. Here, the memory stores an instruction that can be executed by the at least one processor in order to cause the at least one processor to execute the transaction request processing method in the blockchain provided in the embodiment of the present application. .. The non-instantaneous computer-readable storage medium of the present application stores computer instructions used to cause a computer to execute a transaction request processing method in a blockchain provided by an embodiment of the present application.

The memory 802 is a non-instantaneous computer-readable storage medium such as a non-instantaneous software program, a non-instantaneous computer-executable program, and a module, for example, a program corresponding to a transaction request processing method in a blockchain according to an embodiment of the present application. It can be used to store instructions / modules such as the transaction request set determination module 701, the candidate factor interval determination module 702, and the transaction request set selection module 703 shown in the attached FIG. 7. The processor 801 executes various functional applications and data processing of the electronic device by executing non-instantaneous software programs, instructions, and modules stored in the memory 802, and the blockchain in the embodiment of the method described above. Implement the transaction request processing method in.

The memory 802 may include a program storage area and a data storage area, the program storage area may store an operating system, an application program required for at least one function, and the data storage area may be used by an electronic device. The data created by the above may be stored. Further, the memory 802 may include fast random access memory, or may include non-momentary memory such as at least one disk memory device, flash memory device, or other non-momentary solid state memory device. Good. In some embodiments, the memory 802 preferably includes memory located relatively remote to the processor 801 and these remote memories are within the blockchain of the embodiment of the present application via a network. It may be connected to an electronic device for implementing the transaction request processing method of. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

The electronic device for implementing the transaction request processing method in the blockchain in the embodiment of the present application may also include an input device 803 and an output device 804. The processor 801 and the memory 802, the input device 803, and the output device 804 may be connected via a bus or may be connected in other forms. In FIG. 8, the connection via the bus is taken as an example. There is.

The input device 803 receives the input numerical information or character information, and also receives key signals related to user setting and function control of the electronic device for realizing the transaction request processing method in the blockchain according to the embodiment of the present application. Inputs may be generated, such as input devices such as touch screens, keypads, mice, trackpads, touchpads, indicator sticks, one or more mouse buttons, trackballs, joysticks, and the like. The output device 804 may include a display device, an auxiliary lighting device, a haptic feedback device, and the like. Here, the auxiliary lighting device is, for example, a light emitting diode (LED), and the haptic feedback device is, for example, a light emitting diode (LED). It is a vibration motor or the like. Examples of the display device include, but are not limited to, a liquid crystal display (LCD), an LED display, and a plasma display. In some embodiments, the display device may be a touch screen.

Various embodiments of the systems and techniques described herein include digital electronic circuit systems, integrated circuit systems, application specific integrated circuits (ASICs), computer hardware, firmware, software, and / or them. It can be carried out in combination of. These various embodiments may include: Implemented in one or more computer programs, the one or more computer programs being executed and / or interpreted on a programmable system including at least one programmable processor. The programmable processor receives data and instructions from the storage system, at least one input device, and at least one output device, and outputs the data and instructions to the storage system, the at least one input device, and the at least one output device. It may be a dedicated or general purpose programmable processor that can be transferred to the device.

These computer programs, also called programs, software, software applications, or code, include machine instructions for programmable processors and use high-level procedure and / or object-oriented programming languages and / or assembly / machine language. These computer programs can be implemented. As used herein, the terms "machine readable medium" and "computer readable medium" are any computer program products, devices, used to provide machine instructions and / or data to a programmable processor. And / or a device, such as a magnetic disk, an optical disk, a memory, a programmable logic device (PLD), including a machine-reading medium that receives a machine command, which is a machine-reading signal. The term "machine readable signal" refers to any signal used to provide machine instructions and / or data to a programmable processor.

To provide interaction with the user, the systems and techniques described herein are display devices for displaying information to the user (eg, a Cathode Ray Tube (CRT) or LCD monitor). And may be implemented on a computer having a keyboard and a pointing device (eg, a mouse or trackball) for the user to provide input to the computer. Other types of devices may also be used to provide interaction with the user, for example, the feedback provided to the user may be any form of sensory feedback, such as visual feedback, auditory feedback, or. It may be haptic feedback, and the input from the user may be received in any form, such as acoustic input, voice input, or haptic input.

The systems and technologies described herein are computing systems that include back-end components (eg, data servers), computing systems that include middleware components (eg, application servers), or computing that includes front-end components. A system (eg, a user computer with a graphical user interface or web browser; the user can interact with embodiments of the systems and techniques described herein through the graphical user interface or web browser), or as such. It may be implemented in a computing system that includes any combination of back-end components, middleware components, or front-end components. The components of the system may be interconnected via any form or medium of digital data communication, such as a communication network. Examples of communication networks include a local area network (LAN), a wide area network (WAN), the Internet, and a blockchain network.

A computer system can include a client and a server. Clients and servers are generally remote from each other and usually interact over a communication network. The client-server relationship runs on the corresponding computers and is generated by computer programs that have a client-server relationship with each other.

According to the technical proposal of the embodiment of the present application, the block generation process is performed according to the cyclic logic of selecting the current target factor interval and selecting the current target transaction request set from the candidate transaction request sets corresponding to the current target factor interval. The target transaction request set that participates in is cumulatively determined after at least one circular selection, and finally blocks are generated by executing the transaction requests in the cumulatively determined target transaction request set. Here, there is a dependency between the transaction requests in the target transaction request set, and the rationality and selection efficiency of selecting the transaction request by the blockchain node in the block generation process are improved, and the blockout efficiency is improved. be able to.

It should be understood that various embodiments of the process described above can be used to change the order and add / remove steps. For example, as long as the desired results of the proposed techniques disclosed in the present application are achieved, the steps described in the present application are not limited to this specification and may be performed in parallel or sequentially. It may be executed or it may be executed in a different order.

The specific embodiments described above do not constitute a limitation of the scope of protection of the present disclosure. It should be understood by those skilled in the art that various changes, combinations, sub-combinations and substitutions may be made depending on the design requirements and other factors. Any amendments, equivalent substitutions, improvements, etc. made within the gist of this disclosure and the principles shall be included in the scope of protection of this disclosure.

Claims (14)

A step of aggregating selected transaction requests that have dependencies in the blockchain network to obtain at least one transaction request set.
A step of determining the candidate factor interval to which the transaction request set belongs, the factor interval is a step used to measure the probability that the transaction request set participates in the block generation process, and
A step of selecting the current target factor interval from the candidate factor interval and selecting the current target transaction request set participating in the block generation process from the candidate transaction request set corresponding to the current target factor interval. A transaction request processing method within a blockchain that is characterized by this. The step of determining the candidate factor interval to which the transaction request set belongs is
A step of matching the candidate factor interval to which the transaction request set belongs by traversing the upper and lower limits of the created factor interval based on the incentive factor of the transaction request set, wherein the incentive factor is a blockchain. The steps used by a node to characterize the incentives obtained by executing a transaction request in the transaction request set, and
The method of claim 1, further comprising reconstructing the candidate factor interval to which the transaction request set belongs if there is no match. The step of selecting the current target factor interval from the candidate factor interval and selecting the current target transaction request set participating in the block generation process from the candidate transaction request set corresponding to the current target factor interval is
A step of selecting the current factor interval according to the interval value of the candidate factor interval, and
A step of selecting the current transaction request set from the candidate transaction request set corresponding to the current factor interval according to the space occupancy of the candidate transaction request set corresponding to the current factor interval.
A step of validating the current transaction request set based on the current transaction request set and the target transaction request set selected in the current block generation cycle.
The method of claim 1, wherein the method comprises the steps of determining the current target factor interval and the current target transaction request set based on the verification results. The step of validating the current transaction request set based on the current transaction request set and the target transaction request set selected in the current block generation cycle is
A step of calculating the total space occupancy of the current transaction request set and the target transaction request set selected in the current block generation cycle.
The method according to claim 3, further comprising a step of verifying the current transaction request set based on the relationship between the total space occupancy and the block space threshold. Based on the verification result, the step of determining the current target factor interval and the current target transaction request set is
If the validation against the current transaction request set fails, the current factor interval is taken as the current target factor interval, and the current target transaction request is based on the remaining candidate transaction request sets corresponding to the current factor interval. Includes steps to perform set determination operations
The method according to claim 3 or 4, wherein the remaining candidate transaction request set includes a transaction request set corresponding to the current factor interval other than the transaction request set that failed the verification. The steps to determine the current target factor interval and the current target transaction request set based on the verification results are also
If the current target transaction request set cannot be determined from the remaining candidate transaction request sets corresponding to the current factor interval, the current target factor interval determination operation is executed based on the remaining candidate factor intervals, and a new operation is performed. Includes the step of performing the determination operation of the current target transaction request set based on the candidate transaction request set corresponding to the current target factor interval determined in.
The method according to claim 5, wherein the remaining candidate factor spacing includes a candidate factor spacing other than the current factor spacing. The step of selecting the current transaction request set from the candidate transaction request set corresponding to the current factor interval according to the space occupied by the candidate transaction request set corresponding to the current factor interval is
A step of determining the current transaction request set based on the result of sorting by rearranging the space occupancy of the candidate transaction request set from the candidate transaction request sets corresponding to the current factor interval, or It is characterized by including a step of determining a candidate transaction request set whose space occupancy is larger than the space occupancy threshold as the current transaction request set from the candidate transaction request sets corresponding to the current factor interval. The method according to claim 3. Before determining the candidate factor interval to which the transaction request set belongs, the method further determines the incentive factor for the transaction request set based on the transaction request payment certificate information and space occupancy in the transaction request set. The method according to claim 2, wherein the method comprises. The step of aggregating selected transaction requests having a dependency in the blockchain network to obtain at least one transaction request set is
A step of constructing a directed acyclic graph between the selected transaction requests based on the dependency between the selected transaction requests in the blockchain network.
The first aspect of claim 1, wherein the directed acyclic graph is used to aggregate selected transaction requests having a dependency to obtain the at least one transaction request set. Method. The method according to claim 1, wherein a consensus mechanism for competing for the generation of the blocks is deployed in the blockchain network. A transaction request set determination module that aggregates selected transaction requests that have dependencies in a blockchain network to obtain at least one transaction request set, and a transaction request set determination module.
A candidate factor interval determination module that determines the candidate factor interval to which the transaction request set belongs, wherein the factor interval is used to measure the probability that the transaction request set will participate in the block generation process. Modules and
A transaction request set selection module that selects the current target factor interval from the candidate factor intervals and selects the current target transaction request set that participates in the block generation process from the candidate transaction request sets corresponding to the current target factor interval. A transaction request processor in a blockchain comprising and. With at least one processor
It has a memory connected to the at least one processor so as to be communicable.
The memory stores an instruction that can be executed by the at least one processor, and the instruction uses the transaction request processing method in the blockchain according to any one of claims 1 to 10 by the at least one processor. An electronic device, characterized in that it is executed by at least one processor such that it can be performed. A non-instantaneous computer-readable storage medium containing computer instructions for causing a computer to execute the transaction request processing method in the blockchain according to any one of claims 1 to 10. A program according to any one of claims 1 to 10 that realizes a transaction request processing method in a block chain when executed by a processor in a computer.

Images