CN116934469A

CN116934469A - Block chain transaction method, device, equipment and computer storage medium

Info

Publication number: CN116934469A
Application number: CN202210329349.4A
Authority: CN
Inventors: 杨猛
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Group Liaoning Co Ltd
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Group Liaoning Co Ltd
Priority date: 2022-03-31
Filing date: 2022-03-31
Publication date: 2023-10-24

Abstract

The application discloses a method, a device, equipment and a computer storage medium for block chain transaction, which are applied to a block chain system, wherein the method comprises the following steps: receiving a transaction request sent by a client and responding, determining an output partition corresponding to the transaction request, creating a target transaction of the transaction request by the output partition, carrying out partition routing by the output partition, obtaining at least one input partition corresponding to the transaction request by routing, verifying the target transaction by the at least one input partition, and processing the target transaction under the condition that the verification is passed, so that the situation that the client occupies more computing resources in the transaction process can be reduced, and the transaction efficiency is improved.

Description

Block chain transaction method, device, equipment and computer storage medium

Technical Field

The present application belongs to the technical field of blockchain, and in particular, relates to a blockchain transaction method, device, equipment and computer storage medium.

Background

Blockchain partitioning is a data expansion technique that divides a blockchain system into smaller, faster, and more manageable parts, each called a blockchain partition. In a blockchain partitioning system, by using multiple partitions to handle transactions in parallel, thus dispersing the workload of those transaction verifications, the system will automatically divide the network into many smaller parts, so that each partition only needs to run a smaller range of consensus protocols, and a large amount of verification work can be done by processing in parallel with other partitions on the blockchain system, and the partitioning technique will allow more transactions to be processed and verified at the same time.

However, in the prior art, when a blockchain cross-partition transaction is processed, repeated verification is required to be performed on each input partition corresponding to the transaction request by the client, so that more computing resources are occupied by the client in the transaction process.

Disclosure of Invention

The embodiment of the application provides a blockchain transaction method, a blockchain transaction device, blockchain transaction equipment and a blockchain transaction computer storage medium, which can reduce the situation that a client occupies more computing resources in the transaction process and improve the transaction efficiency.

In a first aspect, an embodiment of the present application provides a method for blockchain transactions, applied to a blockchain system, including:

receiving a transaction request sent by a client;

responsive to the transaction request, determining an output partition corresponding to the transaction request;

creating a target transaction of the transaction request by the output partition, and performing partition routing by the output partition, wherein the routing obtains at least one input partition corresponding to the transaction request;

the target transaction is validated by the at least one input partition and, if validated, the target transaction is processed.

In one possible implementation, receiving a transaction request sent by a client includes:

a first partition in the blockchain system receives a transaction request sent by a client, wherein the first partition is any partition in the blockchain system;

In response to the transaction request, determining an output partition corresponding to the transaction request, comprising:

responsive to the transaction request, partition routing is performed by the first partition, the routing resulting in an output partition corresponding to the transaction request.

In one possible implementation, the client stores partition information indicating a portion of the partitions in the blockchain system;

the first partition is any one of the partial partitions.

In one possible implementation, partitions of the blockchain system are arranged in a plurality of partition clusters;

responsive to a transaction request, performing partition routing through the first partition, the routing resulting in an output partition corresponding to the transaction request, comprising:

responding to the transaction request, acquiring a first identifier of the first partition, and acquiring a second identifier corresponding to the transaction request;

determining a target partition cluster in the partition clusters based on the first identifier and the second identifier, and acquiring a target partition address corresponding to the second identifier from the target partition cluster;

and determining the partition corresponding to the target partition address as an output partition.

In one possible implementation manner, determining a target partition cluster in the plurality of partition clusters based on the first identifier and the second identifier, and acquiring a target partition address corresponding to the second identifier from the target partition cluster, includes:

Determining an identification distance between the first identification and the second identification;

determining a partition cluster to be searched corresponding to the identification distance in the plurality of partition clusters;

searching a partition address corresponding to the second identifier in the partition cluster to be searched;

and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as the target partition address.

In one possible implementation manner, after searching the partition address corresponding to the second identifier in the partition cluster to be searched, the method further includes:

under the condition that the partition address corresponding to the second identifier is not found in the partition cluster to be found, a third identifier of the second partition in the partition cluster to be found is obtained;

updating the second partition to the first partition, and updating the first identifier to the third identifier, and re-executing: determining an identification distance between the first identification and the second identification; determining a partition cluster to be searched corresponding to the identification distance in the plurality of partition clusters; searching a partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as the target partition address.

In one possible implementation, each partition in the blockchain system stores network structure information of a plurality of partition clusters, where the network structure information is used to indicate a part of the partitions in the partition clusters corresponding to the network structure information;

the method for acquiring the target partition address corresponding to the second identifier from the target partition cluster comprises the following steps:

and acquiring the target partition address corresponding to the second identifier from the partition addresses of the partial partitions indicated by the network structure information of the target partition cluster based on the network structure information of the target partition cluster stored in the first partition.

In one possible implementation, the network structure information includes a partition list including partial partitions in a partition cluster corresponding to the network structure information;

the method further comprises the steps of:

sequencing each partition in the partition list according to the use time of each partition in the partition list;

the method for obtaining the target partition address corresponding to the second identifier in the partition addresses of the partial partitions indicated by the network structure information of the target partition cluster comprises the following steps:

and sequentially searching the target partition addresses corresponding to the second identifier according to the ordering of all the partitions in the partition list corresponding to the target partition cluster in the partition addresses of the partial partitions indicated by the network structure information of the target partition cluster.

In one possible implementation, the method further includes:

responding to a transaction request, and searching a first partition in network structure information of a target partition cluster;

under the condition that a first partition is found in the network structure information of the target partition cluster, the first partition is placed at the top of a partition list;

and under the condition that the first partition is not found in the network structure information of the target partition cluster, the first partition is placed at the bottom end of the partition list.

In one possible implementation, in the case of a blockchain system processing multiple target transactions,

validating, by at least one input partition, a target transaction, comprising:

in the case where multiple target transactions are conducted in the same input partition and the same output partition, the multiple target transactions are consolidated and verified by the input partition.

In a second aspect, an embodiment of the present application provides an apparatus for blockchain transactions, for use in a blockchain system, the apparatus comprising: a block chain system that is configured to store a plurality of blocks,

the receiving request module is used for receiving a transaction request sent by the client;

the partition determining module is used for responding to the transaction request and determining an output partition corresponding to the transaction request;

the partition determining module is also used for creating a target transaction of the transaction request by the output partition, and performing partition routing by the output partition to obtain at least one input partition corresponding to the transaction request by the routing;

The verification transaction module is further used for verifying the target transaction by the at least one input partition and processing the target transaction if the verification passes.

In one possible implementation, the receiving request module is further configured to receive, by a first partition in the blockchain system, a transaction request sent by the client, where the first partition is any partition in the blockchain system;

and the partition determining module is also used for responding to the transaction request, performing partition routing through the first partition, and obtaining an output partition corresponding to the transaction request through the routing.

the first partition is any one of the partial partitions.

the partition determining module is further used for responding to the transaction request, acquiring a first identifier of the first partition and acquiring a second identifier corresponding to the transaction request;

the partition determining module is further used for determining a target partition cluster from the partition clusters based on the first identifier and the second identifier, and acquiring a target partition address corresponding to the second identifier from the target partition cluster;

The partition determining module is further configured to determine a partition corresponding to the target partition address as an output partition.

In one possible implementation, the blockchain system is further configured to determine an identification distance between the first identification and the second identification;

the partition determining module is further used for determining partition clusters to be searched corresponding to the identification distance in the plurality of partition clusters;

the partition determining module is further used for searching partition addresses corresponding to the second identifiers in the partition clusters to be searched;

the partition determining module is further configured to determine, as the target partition address, the partition address found in the partition cluster to be found in the case that the partition address corresponding to the second identifier is found in the partition cluster to be found.

In one possible implementation manner, the blockchain system is further configured to obtain, when the partition address corresponding to the second identifier is not found in the partition cluster to be found, a third identifier of the second partition in the partition cluster to be found;

the partition determining module is further configured to update the second partition to the first partition, update the first identifier to the third identifier, and re-execute: determining an identification distance between the first identification and the second identification; determining a partition cluster to be searched corresponding to the identification distance in the plurality of partition clusters; searching a partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as the target partition address.

the partition determining module is further configured to obtain, based on the network structure information of the target partition cluster stored in the first partition, a target partition address corresponding to the second identifier from partition addresses of partial partitions indicated by the network structure information of the target partition cluster.

the apparatus further comprises:

the network structure information updating module is used for sequencing each partition in the partition list according to the use time of each partition in the partition list;

the partition determining module is further configured to sequentially search, in partition addresses of partial partitions indicated by the network structure information of the target partition cluster, for target partition addresses corresponding to the second identifier according to the ordering of each partition in the partition list corresponding to the target partition cluster.

In one possible implementation manner, the network structure information updating module is further configured to search, in response to the transaction request, the first partition in the network structure information of the target partition cluster;

The network structure information updating module is further used for placing the first partition at the top of the partition list under the condition that the first partition is found in the network structure information of the target partition cluster;

and the network structure information updating module is also used for placing the first partition at the bottom end of the partition list under the condition that the first partition is not found in the network structure information of the target partition cluster.

and the verification transaction module is also used for carrying out combined verification on the target transactions through the input partition under the condition that the target transactions are carried out in the same input partition and the same output partition.

In a third aspect, an embodiment of the present application provides an electronic device, including: a processor and a memory storing computer program instructions;

the processor, when executing the computer program instructions, implements a method of blockchain transactions as in the first aspect or any of the possible implementations of the first aspect.

In a fourth aspect, embodiments of the present application provide a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement a method of blockchain transactions as in the first aspect or any of the possible implementations of the first aspect.

In a fifth aspect, embodiments of the present application provide a computer program product, instructions in which, when executed by a processor of an electronic device, cause the electronic device to perform a method of blockchain transactions as in the first aspect or any of the possible implementations of the first aspect.

The embodiment of the application provides a method, a device, equipment and a computer storage medium for blockchain transaction, which are applied to a blockchain system, and are used for receiving a transaction request sent by a client and responding, determining an output partition corresponding to the transaction request, creating a target transaction of the transaction request by the output partition, carrying out partition routing by the output partition, obtaining at least one input partition corresponding to the transaction request by routing, verifying the target transaction by the at least one input partition, and processing the target transaction under the condition that the verification is passed, so that the situation that the client has more occupied computing resources in the transaction process can be reduced, and the transaction efficiency is improved.

Drawings

In order to more clearly illustrate the technical solution of the embodiments of the present application, the drawings that are needed to be used in the embodiments of the present application will be briefly described, and it is possible for a person skilled in the art to obtain other drawings according to these drawings without inventive effort.

FIG. 1 is a flow chart of a method for blockchain transactions according to an embodiment of the present application;

FIG. 2 is a schematic diagram of a block chain transaction device according to an embodiment of the present application;

fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

Features and exemplary embodiments of various aspects of the present application will be described in detail below, and in order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail below with reference to the accompanying drawings and the detailed embodiments. It should be understood that the particular embodiments described herein are meant to be illustrative of the application only and not limiting. It will be apparent to one skilled in the art that the present application may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the application by showing examples of the application.

It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.

Existing blockchain partitions are mostly based on an unconsumed transaction output (Unspend Transaction Output, UTXO) model, when a transaction occurs across partitions, the blockchain system performs hash computation according to the output of the transaction, and assigns the transaction to a corresponding partition, which is called an output partition. While a transaction may have multiple inputs at the same time, and each input comes from a different partition, the partition in which the input of the transaction is located is referred to as the input partition. When a client submits a transaction, the transaction may include multiple inputs, and the inputs are stored in different partitions, but this requires repeated verification of each input partition of the client corresponding to the transaction request, so that the client is more occupied computing resources in the transaction process.

In order to solve the problems in the prior art, the embodiment of the application provides a method, a device, equipment and a computer storage medium for block chain transaction. The following first describes a blockchain transaction method provided by an embodiment of the present application.

FIG. 1 is a flow chart of a method for blockchain transactions provided by an embodiment of the present application. As shown in FIG. 1, a blockchain transaction method, applied to a blockchain system, may include S101 through S104.

S101, receiving a transaction request sent by a client.

In S101, when the client has a transaction, the client sends a transaction request to the blockchain system, and the partition in the blockchain system receives the transaction request.

The receiving the transaction request sent by the client may be receiving the transaction request sent by the client to a preset partition in the block system, where information of the preset partition may be preconfigured in the client. The preset partition may be a partition pre-designated among the partitions in the blockchain system.

Alternatively, the receiving the transaction request sent by the client may be that a first partition in the blockchain system receives the transaction request sent by the client, where the first partition may be any partition in the blockchain system. The first partition information may be preconfigured in the client. Thus, by pre-configuring information of any partition in the blockchain system at the client, flexibility of pre-configured partition information can be increased.

The transaction request may be any request capable of implementing a transaction, and the transaction request may include input partition information and output partition information. The input partition information may be an input partition identifier, and the output partition information may be an output partition identifier.

Illustratively, the client issues a transaction request to the blockchain system, the transaction request including an input partition identification of three input users and an output partition identification of one output user, any partition of the blockchain system receiving the transaction request, the partition information being preconfigured in the client.

Note that, the client may store information of all partitions in the blockchain in advance.

Alternatively, the client may store information of a partial partition in the blockchain in advance. Specifically, in the case where the partition in the blockchain is divided into a plurality of block clusters, and each block cluster includes at least one partition, information of at least one partition of each block cluster in the plurality of block clusters may be stored in the client in advance.

In this embodiment, the client stores the information of the partial partition in the blockchain in advance, so that the storage space of the client can be greatly shortened.

For example, assuming that the partitions in the blockchain are divided into 32 blockclusters, each client randomly stores k pieces of network structure information in each blockcluster, that is, stores 32×k pieces of network structure information, and compared with the conventional method that needs to store the total amount of network structure information, the storage space can be greatly shortened.

S102, responding to the transaction request, and determining an output partition corresponding to the transaction request.

In S102, the partition of the transaction request sent by the client is received and responded, so as to determine the output partition corresponding to the transaction request.

The determining the output partition corresponding to the transaction request in response to the transaction request may be performing partition routing through a preset partition in a case that the partition receiving the transaction request is the preset partition, and obtaining the output partition corresponding to the transaction request by routing.

Alternatively, in the case where the first partition in the blockchain system receives the transaction request sent by the client, the step 102 may include:

The above-mentioned responding to the trade request carries on the partition route through the first partition, route gets the output partition corresponding to trade request, can be responding to the trade request, route through the first partition in all partitions of the block chain system, route gets the output partition corresponding to trade request.

Alternatively, when the partitions of the blockchain system are arranged in a plurality of partition clusters, the performing, by the first partition, the partition routing in response to the transaction request, and the routing to obtain the output partition corresponding to the transaction request may include:

responding to the transaction request, acquiring a first identifier of the first partition, and acquiring a second identifier corresponding to the transaction request; determining a target partition cluster in the partition clusters based on the first identifier and the second identifier, and acquiring a target partition address corresponding to the second identifier from the target partition cluster; and determining the partition corresponding to the target partition address as an output partition.

And dividing all partitions of the block chain system into a plurality of partition clusters, determining a target partition cluster from the partition clusters according to the first identifier and the second identifier, thereby acquiring a target partition address and further determining an output partition.

Each partition of the blockchain system has a unique multi-digit partition identification, wherein the first identification is a unique identification code of a first partition, and the second identification is a unique identification code of a partition corresponding to the transaction request.

In the present embodiment, the partitions of the blockchain system are arranged in a plurality of partition clusters, so that the blockchain system can be routed between the partitions quickly.

Illustratively, the partition identifier may be a 32-bit binary number, or a multi-bit number such as 16 bits, 64 bits, etc., and likewise, the partition identifier may be other carry count system, not limited to binary.

The determining a target partition cluster in the plurality of partition clusters based on the first identifier and the second identifier, and acquiring a target partition address corresponding to the second identifier from the target partition cluster may be calculating a similarity between the first identifier and the second identifier, and determining a partition cluster to be searched corresponding to the partition distance in the plurality of partition clusters based on the similarity; searching a partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as the target partition address.

It should be noted that, the calculation of the similarity between the first identifier and the second identifier may be implemented by a preset similarity algorithm. For example, in the case where the first identifier and the second identifier are character strings, the similarity between the first identifier and the second identifier may be determined by a character string similarity algorithm.

Or, determining the target partition cluster from the plurality of partition clusters based on the first identifier and the second identifier, and acquiring the target partition address corresponding to the second identifier from the target partition cluster may include:

determining an identification distance between the first identification and the second identification; determining a partition cluster to be searched corresponding to the identification distance in the plurality of partition clusters; searching a partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as the target partition address.

In some embodiments, after searching the partition address corresponding to the second identifier in the partition cluster to be searched, the method may further include:

In this embodiment, the routing manner may ensure that, for any n partitions, n is a positive integer, and at most, only log2 (n) times of query are needed to find the IP address of the target partition, i.e. there is [2 ] for any one ^n-1 ,2 ⁿ ]The partition clusters of the partitions can find the target partition by only n steps at most, and the distance is contracted by at least half each search, so that the target partition can be quickly routed.

The identification distance may be calculated by exclusive-or between the first identification and the second identification, where an exclusive-or algorithm is: the same is 0, and the different is 1.

Illustratively, in the case of a binary number identified as 32 bits for each partition, the first identification 00000000000000000000000001010000 is identified as 00000000000000000000000000000010 from the second identification 00000000000000000000000001010010, which is converted to decimal, i.e., 2.

Based on the identification distance between all the partitions, all the partitions can be divided into 32 partition clusters, and the specific division principle is as follows:

partition cluster 1:2 ⁰ ～2 ¹

Partition cluster 2:2 ¹ ～2 ²

......

Partition cluster 32:2 ³¹ ～2 ³²

Among the 32 partition clusters, the partition cluster to be searched corresponding to the identification distance 00000000000000000000000000000010 is determined to be the partition cluster 1, and the partition address is determined to be the target partition address when the partition address corresponding to the second identification is searched in the partition cluster 1. And under the condition that the partition address corresponding to the second identifier is not found, randomly selecting a third identifier of one partition in the partition cluster 1, and calculating the identifier distance between the partition corresponding to the third identifier and the target partition according to the rule until the target partition address is found.

In the case where the total amount of network structure information is stored in each partition in the blockchain system, the obtaining the target partition address corresponding to the second identifier in the target partition cluster may be based on the total amount of network structure information in the first partition, and the target partition address corresponding to the second identifier may be obtained from partition addresses of all the partitions indicated by the network structure information of the target partition cluster.

Alternatively, in a case where each partition in the blockchain system stores network configuration information of a plurality of partition clusters, where the network configuration information is used to indicate a part of the partition in the partition cluster corresponding to the network configuration information, the obtaining, in the target partition cluster, the target partition address corresponding to the second identifier may include:

In this embodiment, the method is required to be stored 2 as compared with the conventional method ^k Compared with the individual network structure information (namely, the total network structure information is saved), the storage space can be greatly shortened, and the problems of overlarge partition storage resources and weak expansibility are solved.

Illustratively, in the case of 32 partition clusters, each partition randomly holds k partitions in partition cluster 1 through partition cluster 32, where k is a positive integer, so that only 32×k network structure information needs to be held in the partition of each blockchain system.

The network configuration information may include: the partition identification, partition name, partition description, partition IP address, and partition cluster to which the partition belongs may be used to indicate a portion of the partitions in the partition cluster to which it corresponds.

Illustratively, the network structure information is shown in the following table:

s103, creating a target transaction of the transaction request by the output partition, and performing partition routing by the output partition to obtain at least one input partition corresponding to the transaction request by the routing.

In S103, after confirming the output partition, creating a target transaction of the transaction request by the output partition, performing partition routing by the output partition, and the routing method is similar to the method in S102, which is not described herein, so as to obtain an input partition corresponding to the transaction request, where the transaction has at least one input partition and one output partition.

S104, verifying the target transaction by at least one input partition, and processing the target transaction if the verification passes.

In S104, each input partition performs verification on the target transaction, each input partition feeds the verification result back to the output partition, and processes the target transaction when all the input partitions pass the verification, and does not process the target transaction when the verification result of at least one input partition is not pass, and the transaction fails.

In some embodiments, where the blockchain system is processing multiple target transactions,

the verifying, by the at least one input partition, the target transaction may include:

In this embodiment, under the condition that the blockchain system processes multiple target transactions, the merging verification can greatly reduce the complexity of communication between each partition, and improve the transaction efficiency.

According to the blockchain transaction method provided by the embodiment of the application, the transaction request sent by the client is received and responded, the output partition corresponding to the transaction request is determined, the target transaction of the transaction request is created by the output partition, the partition route is carried out through the output partition, at least one input partition corresponding to the transaction request is obtained through the route, the target transaction is verified by the at least one input partition, and under the condition that the verification is passed, the target transaction is processed, so that the situation that the client has more occupied computing resources in the transaction process can be reduced, and the transaction efficiency is improved.

As another implementation of the present application, in order to improve the stability of the blockchain system cross-partition transaction, the network structure information needs to be updated.

The above network structure information may further include a partition list, and the partition list may include all partitions in a partition cluster corresponding to the network structure information.

Alternatively, the partition list may include partial partitions in a partition cluster corresponding to the network structure information.

In the case that the partition list includes a part of partitions in the partition cluster corresponding to the network structure information, the method may further include:

and sequencing each partition in the partition list according to the use time of each partition in the partition list.

The obtaining, in the partition address of the partial partition indicated by the network structure information of the target partition cluster, the target partition address corresponding to the second identifier may further include:

In this embodiment, the partitions in each partition cluster are sorted according to the latest usage time, so that the probability of eliminating the latest partition is lowest, and the higher the probability of eliminating the partition which is not frequently used is, the higher the searching efficiency is, and the partition list can be updated.

In some embodiments, the above method may further comprise:

The top of the partition list may be a location of low elimination probability.

The bottom of the partition list may be a location of high elimination probability.

In this embodiment, in the case of responding to the transaction request, the first partition is searched in the network structure information of the target partition cluster, that is, whether the first partition is in the target partition cluster is checked: if yes, the first partition is placed at the top position of a partition list in the network structure information of the target partition cluster; if not, adding the first partition into the network structure information of the target partition cluster at the bottommost position of the partition list, wherein the bottommost position means high elimination probability, deleting one partition with the bottommost frequency of the latest use in the partition list of the target partition cluster, and thus not only can continuously update the partition list, but also can improve the stability of cross-partition transaction of the blockchain system.

Based on the method for the blockchain transaction provided by the embodiment, correspondingly, the application further provides a specific implementation mode of the device for the blockchain transaction. Please refer to the following examples.

Referring first to fig. 2, an apparatus for a blockchain transaction according to an embodiment of the present application is applied to a blockchain system, and the apparatus includes:

a receiving request module 201, configured to receive a transaction request sent by a client;

a partition determination module 202, configured to determine, in response to a transaction request, an output partition corresponding to the transaction request;

the partition determining module 202 is further configured to create a target transaction of the transaction request by using the output partition, and perform partition routing through the output partition, where the routing obtains at least one input partition corresponding to the transaction request;

the verification transaction module 203 is further configured to verify the target transaction by at least one input partition, and process the target transaction if the verification passes.

In the blockchain transaction device provided by the embodiment of the application, the receiving request module 201 receives the transaction request sent by the client, the partition determining module 202 determines the output partition corresponding to the transaction request in response to the transaction request, the output partition creates the target transaction of the transaction request, and the output partition carries out partition routing to obtain at least one input partition corresponding to the transaction request, the verification transaction module 203 verifies the target transaction through the at least one input partition, and processes the target transaction under the condition that the verification passes, so that the situation that the occupied computing resources of the client in the transaction process are more can be reduced, and the transaction efficiency is improved.

In some embodiments, the receiving request module 201 is further configured to receive, by a first partition in the blockchain system, a transaction request sent by a client, where the first partition is any partition in the blockchain system;

the partition determining module 202 is further configured to perform partition routing through the first partition in response to the transaction request, where the routing obtains an output partition corresponding to the transaction request.

In this embodiment, the receiving request module 201 is configured to receive, in the blockchain system, a transaction request sent by a client through a first partition, where the first partition is any partition in the blockchain system, so as to increase flexibility of preconfigured partition information.

In some embodiments, the client stores partition information indicating a partial partition in the blockchain system; the first partition is any one of the partial partitions.

In this embodiment, the storage space can be greatly shortened compared with the case where the conventional method needs to save the entire amount of network structure information.

In some embodiments, partitions of the blockchain system are configured in a plurality of partition clusters;

the partition determining module 202 is further configured to obtain a first identifier of the first partition and obtain a second identifier corresponding to the transaction request in response to the transaction request;

The partition determining module 202 is further configured to determine a target partition cluster from the plurality of partition clusters based on the first identifier and the second identifier, and obtain a target partition address corresponding to the second identifier from the target partition cluster;

the partition determining module 202 is further configured to determine a partition corresponding to the target partition address as an output partition.

In this embodiment, the partitions of the blockchain system are arranged in a plurality of partition clusters, so that the blockchain system can be routed between the partitions quickly.

In some embodiments, the blockchain system is further configured to determine an identification distance between the first identification and the second identification;

the partition determining module 202 is further configured to determine a partition cluster to be searched corresponding to the identification distance from among the plurality of partition clusters;

the partition determining module 202 is further configured to search a partition address corresponding to the second identifier in the partition cluster to be searched;

the partition determining module 202 is further configured to determine, when the partition address corresponding to the second identifier is found in the partition cluster to be found, the partition address found in the partition cluster to be found as the target partition address.

In this embodiment, the target partition address may be determined by routing in the partition cluster to be searched, where the range of searching the partition becomes smaller.

In some embodiments, the blockchain system is further configured to obtain, when the partition address corresponding to the second identifier is not found in the partition cluster to be found, a third identifier of the second partition in the partition cluster to be found;

the partition determination module 202 is further configured to update the second partition to the first partition, update the first identifier to the third identifier, and re-execute: determining an identification distance between the first identification and the second identification; determining a partition cluster to be searched corresponding to the identification distance in the plurality of partition clusters; searching a partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as the target partition address.

In this embodiment, n is a positive integer for any n partitions, and at most, only log2 (n) times are required to be queried to find the IP address of the target partition, i.e. there is [2 ] for any one ^n-1 ,2 ⁿ ]The partition clusters of the partitions can find the target partition by only n steps at most, and the distance is contracted by at least half each search, so that the target partition can be quickly routed.

In some embodiments, each partition in the blockchain system stores network structure information of a plurality of partition clusters, wherein the network structure information is used for indicating partial partitions in the partition clusters corresponding to the network structure information;

the partition determining module 202 is further configured to obtain, based on the network structure information of the target partition cluster stored in the first partition, a target partition address corresponding to the second identifier from partition addresses of partial partitions indicated by the network structure information of the target partition cluster.

In some embodiments, the network structure information includes a partition list including partial partitions in a partition cluster corresponding to the network structure information;

the apparatus further comprises:

the network structure information updating module 204 is configured to sort the partitions in the partition list according to the usage time of each partition in the partition list;

the partition determining module 202 is further configured to sequentially search, in partition addresses of partial partitions indicated by the network structure information of the target partition cluster, for target partition addresses corresponding to the second identifier according to the ordering of each partition in the partition list corresponding to the target partition cluster.

In this embodiment, the partitions in each partition cluster are sorted according to the latest usage time, so that the probability that the latest used node is eliminated is the lowest, and the higher the probability that the node which is not frequently used is eliminated, the higher the searching efficiency can be, and the partition list can be updated.

In some embodiments, the network structure information updating module is further configured to search, in response to the transaction request, for the first partition in the network structure information of the target partition cluster;

the network structure information updating module 204 is further configured to, when the first partition is found in the network structure information of the target partition cluster, place the first partition at the top of the partition list;

the network structure information updating module 204 is further configured to place the first partition at the bottom end in the partition list if the first partition is not found in the network structure information of the target partition cluster.

In this embodiment, one partition with the lowest most recently used frequency in the partition list of the target partition cluster is deleted, so that the partition list can be continuously updated, and the stability of the cross-partition transaction of the blockchain system can be improved.

The verification transaction module 203 is further configured to, in a case where multiple target transactions are performed in the same input partition and the same output partition, perform combined verification on the multiple target transactions through the input partition.

Fig. 3 shows a schematic hardware structure of an electronic device according to an embodiment of the present application.

A processor 301 and a memory 302 storing computer program instructions may be included in an electronic device.

In particular, the processor 301 may include a Central Processing Unit (CPU), or an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or may be configured as one or more integrated circuits that implement embodiments of the present application.

Memory 302 may include mass storage for data or instructions. By way of example, and not limitation, memory 302 may comprise a Hard Disk Drive (HDD), floppy Disk Drive, flash memory, optical Disk, magneto-optical Disk, magnetic tape, or universal serial bus (Universal Serial Bus, USB) Drive, or a combination of two or more of the foregoing. Memory 302 may include removable or non-removable (or fixed) media, where appropriate. Memory 302 may be internal or external to the integrated gateway disaster recovery device, where appropriate. In a particular embodiment, the memory 302 is a non-volatile solid-state memory.

In particular embodiments, memory 302 may include read-only memory (ROM), random-access memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. Thus, in general, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software comprising computer-executable instructions and when the software is executed (e.g., by one or more processors) it is operable to perform the operations described with reference to methods in accordance with aspects of the present disclosure.

The processor 301 implements the method of any of the above-described embodiments of blockchain transactions by reading and executing computer program instructions stored in the memory 302.

In one example, the electronic device may also include a communication interface 303 and a bus 310. As shown in fig. 3, the processor 301, the memory 302, and the communication interface 303 are connected to each other by a bus 310 and perform communication with each other.

The communication interface 303 is mainly used to implement communication between each module, device, unit and/or apparatus in the embodiment of the present application.

Bus 310 includes hardware, software, or both that couple the components of the online data flow billing device to each other. By way of example, and not limitation, the buses may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a micro channel architecture (MCa) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus, or a combination of two or more of the above. Bus 310 may include one or more buses, where appropriate. Although embodiments of the application have been described and illustrated with respect to a particular bus, the application contemplates any suitable bus or interconnect.

The electronic device may perform the method of blockchain transactions in embodiments of the present application, thereby implementing the method and apparatus of blockchain transactions described in connection with fig. 1 and 2.

In addition, in connection with the method of blockchain transactions in the above embodiments, embodiments of the present application may be implemented by providing a computer storage medium. The computer storage medium has stored thereon computer program instructions; the computer program instructions, when executed by a processor, implement a method of blockchain transactions in accordance with any of the above embodiments.

Embodiments of the present application also provide a computer program product, the instructions in which, when executed by a processor of an electronic device, cause the electronic device to perform the method of any of the blockchain transactions of the embodiments described above.

It should be understood that the application is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present application are not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between steps, after appreciating the spirit of the present application.

The functional blocks shown in the above block diagrams may be implemented in hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the application are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave. A "machine-readable medium" may include any medium that can store or transfer information. Examples of machine-readable media include electronic circuitry, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio Frequency (RF) links, and the like. The code segments may be downloaded via computer networks such as the internet, intranets, etc.

It should also be noted that the exemplary embodiments mentioned in this disclosure describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, or may be performed in a different order from the order in the embodiments, or several steps may be performed simultaneously.

Aspects of the present disclosure are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions/acts specified in the flowchart and/or block diagram block or blocks. Such a processor may be, but is not limited to being, a general purpose processor, a special purpose processor, an application specific processor, or a field programmable logic circuit. It will also be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware which performs the specified functions or acts, or combinations of special purpose hardware and computer instructions.

In the foregoing, only the specific embodiments of the present application are described, and it will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the systems, modules and units described above may refer to the corresponding processes in the foregoing method embodiments, which are not repeated herein. It should be understood that the scope of the present application is not limited thereto, and any equivalent modifications or substitutions can be easily made by those skilled in the art within the technical scope of the present application, and they should be included in the scope of the present application.

Claims

1. A method for blockchain transactions applied to a blockchain system, comprising:

receiving a transaction request sent by a client;

creating a target transaction of the transaction request by the output partition, and performing partition routing by the output partition to obtain at least one input partition corresponding to the transaction request by routing;

2. The method of claim 1, wherein receiving the transaction request sent by the client comprises:

the determining, in response to the transaction request, an output partition corresponding to the transaction request, including:

and responding to the transaction request, carrying out partition routing through the first partition, and obtaining an output partition corresponding to the transaction request by routing.

3. The method of claim 2, wherein the client stores partition information indicating a partial partition in the blockchain system;

The first partition is any one of the partial partitions.

4. The method of claim 2, wherein partitions of the blockchain system are arranged in a plurality of partition clusters;

the responding to the transaction request carries out partition routing through the first partition, the routing obtains an output partition corresponding to the transaction request, and the method comprises the following steps:

and determining the partition corresponding to the target partition address as the output partition.

5. The method of claim 4, wherein the determining a target partition cluster from the plurality of partition clusters based on the first identifier and the second identifier, and obtaining a target partition address corresponding to the second identifier from the target partition cluster, comprises:

Determining a partition cluster to be searched corresponding to the identification distance in the partition clusters;

searching the partition address corresponding to the second identifier in the partition cluster to be searched;

and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as a target partition address.

6. The method of claim 5, wherein after searching the partition cluster to be searched for the partition address corresponding to the second identifier, further comprising:

acquiring a third identifier of a second partition in the partition cluster to be searched under the condition that the partition address corresponding to the second identifier is not searched in the partition cluster to be searched;

updating the second partition to the first partition, updating the first identifier to the third identifier, and re-executing: determining an identification distance between the first identification and the second identification; determining a partition cluster to be searched corresponding to the identification distance in the partition clusters; searching the partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as a target partition address.

7. The method of claim 4, wherein each partition in the blockchain system stores network structure information of the plurality of partition clusters, the network structure information being used to indicate a partial partition in the partition cluster corresponding thereto;

the obtaining the target partition address corresponding to the second identifier in the target partition cluster includes:

and acquiring a target partition address corresponding to the second identifier from partition addresses of partial partitions indicated by the network structure information of the target partition cluster based on the network structure information of the target partition cluster stored in the first partition.

8. The method of claim 7, wherein the network structure information comprises a partition list comprising partial partitions in a partition cluster corresponding to the network structure information;

the method further comprises the steps of:

sequencing all the partitions in the partition list according to the service time of all the partitions in the partition list;

the obtaining, in the partition addresses of the partial partitions indicated by the network structure information of the target partition cluster, the target partition address corresponding to the second identifier includes:

And sequentially searching the target partition addresses corresponding to the second identifier according to the ordering of all the partitions in the partition list corresponding to the target partition cluster in the partition addresses of partial partitions indicated by the network structure information of the target partition cluster.

9. The method of claim 8, wherein the method further comprises:

responding to the transaction request, and searching the first partition in the network structure information of the target partition cluster;

under the condition that the first partition is found in the network structure information of the target partition cluster, the first partition is placed at the top of the partition list;

and under the condition that the first partition is not found in the network structure information of the target partition cluster, placing the first partition at the bottom end of the partition list.

10. The method of claim 1, wherein, in the event that the blockchain system processes a plurality of the target transactions,

said validating, by said at least one input partition, said target transaction, comprising:

and in the case that a plurality of target transactions are carried out in the same input partition and the same output partition, carrying out merging verification on the plurality of target transactions through the input partition.

11. An apparatus for blockchain transactions, for use in a blockchain system, the apparatus comprising:

the partition determining module is further used for creating a target transaction of the transaction request by the output partition, performing partition routing by the output partition, and obtaining at least one input partition corresponding to the transaction request by the routing;

and the verification transaction module is used for verifying the target transaction by the at least one input partition and processing the target transaction if the verification passes.

12. The apparatus of claim 11, wherein the receive request module is further configured to receive a transaction request sent by a client from a first partition in the blockchain system, the first partition being any partition in the blockchain system;

the partition determining module is further configured to respond to the transaction request, perform partition routing through the first partition, and obtain an output partition corresponding to the transaction request through routing.

13. The apparatus of claim 12, wherein the client stores partition information indicating a partial partition in the blockchain system;

the first partition is any one of the partial partitions.

14. The apparatus of claim 12, wherein partitions of the blockchain system are arranged in a plurality of partition clusters;

the partition determining module is further configured to obtain a first identifier of the first partition in response to the transaction request, and obtain a second identifier corresponding to the transaction request;

the partition determining module is further configured to determine a target partition cluster from the plurality of partition clusters based on the first identifier and the second identifier, and obtain a target partition address corresponding to the second identifier from the target partition cluster;

the partition determining module is further configured to determine a partition corresponding to the target partition address as the output partition.

15. The apparatus of claim 14, wherein the device comprises a plurality of sensors,

the partition determining module is further configured to determine an identification distance between the first identification and the second identification;

the partition determining module is further configured to determine a partition cluster to be searched corresponding to the identification distance from among the plurality of partition clusters;

The partition determining module is further configured to search a partition address corresponding to the second identifier in the partition cluster to be searched;

the partition determining module is further configured to determine, when the partition address corresponding to the second identifier is found in the partition cluster to be found, the partition address found in the partition cluster to be found as a target partition address.

16. The apparatus of claim 15, wherein the device comprises a plurality of sensors,

the partition determining module is further configured to obtain a third identifier of the second partition in the partition cluster to be searched when the partition address corresponding to the second identifier is not found in the partition cluster to be searched;

the partition determining module is further configured to update the second partition to the first partition, update the first identifier to the third identifier, and re-execute: determining an identification distance between the first identification and the second identification; determining a partition cluster to be searched corresponding to the identification distance in the partition clusters; searching the partition address corresponding to the second identifier in the partition cluster to be searched; and under the condition that the partition address corresponding to the second identifier is found in the partition cluster to be found, determining the partition address found in the partition cluster to be found as a target partition address.

17. The apparatus of claim 14, wherein each partition in the blockchain system stores network structure information for the plurality of partition clusters, the network structure information being used to indicate a portion of the partitions in the partition cluster corresponding thereto;

18. The apparatus of claim 17, wherein the network structure information comprises a partition list comprising partial partitions in a partition cluster corresponding to the network structure information;

the apparatus further comprises:

the network structure information updating module is used for sequencing all the partitions in the partition list according to the service time of all the partitions in the partition list;

19. The apparatus of claim 18, wherein the device comprises a plurality of sensors,

the network structure information updating module is further configured to search the first partition in the network structure information of the target partition cluster in response to the transaction request;

the network structure information updating module is further configured to place the first partition at the top end in the partition list when the first partition is found in the network structure information of the target partition cluster;

the network structure information updating module is further configured to place the first partition at the bottom end in the partition list when the first partition is not found in the network structure information of the target partition cluster.

20. The apparatus of claim 11, wherein, in the event that the blockchain system processes a plurality of the target transactions,

and the verification transaction module is also used for carrying out combined verification on a plurality of target transactions through the input partition under the condition that the target transactions are carried out in the same input partition and the same output partition.

21. An electronic device, the device comprising: a processor and a memory storing computer program instructions;

A method of implementing a blockchain transaction as in any of claims 1-10 when the computer program instructions are executed by the processor.

22. A computer readable storage medium having stored thereon computer program instructions which when executed by a processor implement the method of blockchain transaction as in any of claims 1-10.

23. A computer program product, wherein instructions in the computer program product, when executed by a processor of an electronic device, cause the electronic device to perform the method of blockchain transactions as in any of claims 1-10.