WO2019153660A1

WO2019153660A1 - Transaction processing method and apparatus, and computer device and storage medium

Info

Publication number: WO2019153660A1
Application number: PCT/CN2018/096845
Authority: WO
Inventors: 吴贞海
Original assignee: 深圳壹账通智能科技有限公司
Priority date: 2018-02-07
Filing date: 2018-07-24
Publication date: 2019-08-15
Also published as: CN108399533A; CN108399533B

Abstract

A transaction processing method, comprising: receiving first transaction information sent by each transaction terminal, and generating a first transaction value storage address according to the first transaction information; transferring the value of a first transaction into the first transaction value storage address by means of a second transaction; obtaining a target random number of a target block of the second transaction according to a proof of work mechanism; obtaining a transaction processing result according to the target random number and the first transaction information; and obtaining the value corresponding to the transaction processing result from the first transaction value storage address, and transferring the obtained value into a second transaction value storage address of a corresponding transaction terminal, the first transaction information carrying the second transaction value storage address.

Description

Transaction processing method, device, computer device and storage medium

Cross-reference to related applications

The present application claims priority to Chinese Patent Application No. 2018101237671, filed on February 7, 2018, the entire disclosure of which is incorporated herein by reference. In this application.

Technical field

The application relates to a transaction method, apparatus, computer device and storage medium.

Background technique

With the development of computer technology, online transactions have emerged. Since the various parties to online transactions may not know each other and are prone to credit crisis, each party has a higher degree of emphasis on the fairness of online transactions.

However, the inventor realized that the traditional transaction processing method is handled by a specific authority to ensure the fairness of the transaction. This method has high dependence on a specific authority, and cannot guarantee the transaction when the authority fails. When it comes to fairness, it can cause problems in the transaction.

Summary of the invention

According to various embodiments disclosed herein, a transaction processing method, apparatus, computer device, and storage medium are provided.

A transaction processing method, including:

Receiving first transaction information sent by each transaction terminal, and generating a first transaction value storage address according to the first transaction information;

Transferring the value of the first transaction to the first transaction value storage address by the second transaction;

Obtaining a target random number of the target block of the second transaction according to the workload proof mechanism;

Obtaining a transaction processing result according to the target random number and the first transaction information; and

Obtaining a value corresponding to the transaction processing result from the first transaction value storage address, and transferring the acquired value to a second transaction value storage address of the corresponding transaction terminal, the first transaction information Carrying the second transaction value storage address.

A transaction processing device comprising:

a receiving module, configured to receive first transaction information sent by each transaction terminal, and generate a first transaction value storage address according to the first transaction information;

a value transfer module for transferring the value of the first transaction to the first transaction value storage address by the second transaction;

a target random number obtaining module, configured to acquire a target random number of the target block of the second transaction according to the workload proof mechanism;

a transaction processing result generating module, configured to obtain a transaction processing result according to the target random number and the first transaction information; and

a transaction output module, configured to obtain a value corresponding to the transaction processing result from the first transaction value storage address, and transfer the obtained value to a second transaction value storage address of the corresponding transaction terminal, The first transaction information carries the second transaction value storage address.

A computer device comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executable by the processor to cause the one or more processors to execute The following steps: receiving first transaction information sent by each transaction terminal, and generating a first transaction value storage address according to the first transaction information; transferring the value of the first transaction to the first transaction value storage by using the second transaction In the address; acquiring a target random number of the target block of the second transaction according to the workload proof mechanism; obtaining a transaction processing result according to the target random number and the first transaction information; and storing from the first transaction value Obtaining a value corresponding to the transaction processing result in the address, and transferring the obtained value to a second transaction value storage address of the corresponding transaction terminal, where the first transaction information carries the second transaction value Storage address.

One or more non-transitory computer readable storage mediums storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of: receiving respective transaction terminals Transmitting the first transaction information, and generating a first transaction value storage address according to the first transaction information; transferring the value of the first transaction to the first transaction value storage address by using the second transaction; Obtaining, by the mechanism, a target random number of the target block of the second transaction; obtaining a transaction processing result according to the target random number and the first transaction information; and obtaining and reporting from the first transaction value storage address Transaction processing the value corresponding to the processing result, and transferring the obtained value into the second transaction value storage address of the corresponding transaction terminal, the first transaction information carrying the second transaction value storage address.

Details of one or more embodiments of the present application are set forth in the accompanying drawings and description below. Other features and advantages of the present invention will be apparent from the description, drawings and claims.

DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings to be used in the embodiments will be briefly described below. Obviously, the drawings in the following description are only some embodiments of the present application, Those skilled in the art can also obtain other drawings based on these drawings without any creative work.

1 is an application scenario diagram of a transaction processing method in accordance with one or more embodiments.

2 is a flow diagram of a transaction processing method in accordance with one or more embodiments.

Figure 3 is a flow chart of step S206 in the embodiment of Figure 2.

4 is a block diagram showing the structure of a block in a blockchain in accordance with one or more embodiments.

FIG. 5 is a flow chart of step S204 in the embodiment shown in FIG. 2.

6 is a block diagram of a transaction processing device in accordance with one or more embodiments.

FIG. 7 is a block diagram of a computer device in accordance with one or more embodiments.

Detailed ways

In order to make the technical solutions and advantages of the present application more clear, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It is understood that the specific embodiments described herein are merely illustrative of the application and are not intended to be limiting.

The transaction processing method provided by the present application can be applied to an application environment as shown in FIG. 1. The transaction terminal communicates with the nodes in the blockchain through the network through the network. The node in the blockchain can receive the first transaction request sent by the transaction terminal, and the first transaction request includes the first transaction information, and after receiving the transaction request, the node generates the first transaction value storage address according to the transaction information. And transferring, by the second transaction, the transaction value of the first transaction in the first transaction information to the first transaction value storage address, and mining the second transaction through the blockchain, and obtaining according to the workload proof mechanism The target block of the second transaction, that is, the target random number of the target node, obtains the transaction processing result according to the target random number, so that the value corresponding to the transaction processing result can be obtained from the first transaction value storage address, and the obtained value is obtained. The value obtained is transferred to the second transaction value storage address of the corresponding transaction terminal, and the first transaction information carries the second transaction value storage address. The transaction terminal can be, but is not limited to, various personal computers, notebook computers, smart phones, tablets, and portable wearable devices, and the nodes in the blockchain can be implemented by a separate server or a server cluster composed of multiple servers.

In one embodiment, as shown in FIG. 2, a transaction processing method is provided, which is applied to the node in the blockchain in FIG. 1 as an example, and includes the following steps:

S202: Receive first transaction information sent by each transaction terminal, and generate a first transaction value storage address according to the first transaction information.

Specifically, the transaction terminal refers to a transaction terminal that needs to participate in a transaction, and can communicate with a node on the blockchain, and when the transaction terminal participates in the transaction, can send the first transaction information to the corresponding node on the blockchain, Therefore, the node on the blockchain can generate a first transaction value storage address according to the first transaction information, that is, a public storage address of the transaction value of all the transaction terminals participating in the transaction, that is, the first transaction value storage address can make each transaction terminal The transaction value can be transferred to the transaction value, so that the generation of the first transaction value storage address needs to be generated according to the first transaction information sent by each transaction terminal.

S204: Transfer the value of the first transaction to the first transaction value storage address by using the second transaction.

Specifically, the node of the blockchain receives the first transaction information of each transaction terminal through the first transaction, and starts the second transaction, and transfers the transaction value of the first transaction of each transaction terminal to the first transaction value through the second transaction. In the storage address, the first transaction value that is transferred to the blockchain by each transaction terminal is stored. Alternatively, the transaction value may refer to virtual assets such as transaction funds and bitcoin.

S206: Acquire a target random number of the target block of the second transaction according to the workload proof mechanism.

Specifically, after the node of the blockchain transfers the value of the first transaction of each transaction terminal to the first transaction value storage address, the mining operation can be performed, so that the nodes on the blockchain pass the competition mechanism. The second transaction is calculated to ensure the credibility of the second transaction. The target block may be a pre-agreed block or calculated according to the nature of the transaction, for example, the last block participating in the transaction as the target block. The target random number refers to the target random number obtained by the target block participating in the second transaction calculation under the condition that the workload proof mechanism is satisfied, and the target random number is the target block determined by calculating the hash value of the target block. A random number in the head.

S208: Obtain a transaction processing result according to the target random number and the first transaction information.

Specifically, the transaction result is obtained by agreeing to obtain the target random number of the target block, and obtaining the transaction processing result according to the target random number and the first transaction information of each transaction terminal, because the target random number is the workload proof mechanism through the blockchain. Obtained, it has randomness, can not be predicted, and can not be manually interfered. Therefore, the transaction processing result obtained by the target random number is also fair.

S210: Obtain a value corresponding to the transaction processing result from the first transaction value storage address, and transfer the obtained value to a second transaction value storage address of the corresponding transaction terminal, where the first transaction information carries the second Transaction value storage address.

Specifically, when the transaction processing result is obtained, the value corresponding to the transaction processing result is obtained from the first transaction value storage address, and the value is returned to the second transaction value storage address of the transaction terminal corresponding to the value, thereby completing transaction.

The method uses a non-turing complete blockchain scripting system to construct a smart contract to redeem the value of a smart contract according to a set random condition. In the core process workload proof of the blockchain, in order to complete the workload proof of setting difficulty, the mining node of the blockchain will use a certain algorithm to search for a suitable random number, then the random number can be used as value. A random state condition in the redemption system is used for the control of the value redemption method to ensure the fairness of the transaction.

After receiving the first transaction information sent by each transaction terminal, the transaction processing method generates a public transaction value storage address according to the first transaction information, and transfers the value of the first transaction to the public transaction through the second transaction. In the value storage address, the target random number of the target block can be obtained through the workload proof mechanism. Since the work of the blockchain is independent and does not receive external interference, the fairness of the target random number can be guaranteed. Sex, so that the fairness of the transaction processing result generated according to the target random number is also guaranteed.

In one embodiment, referring to FIG. 3, FIG. 3 is a flowchart of step S206 in the embodiment shown in FIG. 2, that is, acquiring the target random number of the target block of the second transaction according to the workload proof mechanism. The steps can include:

S302: Obtain a preset workload difficulty of the target block.

Specifically, FIG. 4 is a schematic structural diagram of a block in a blockchain in an embodiment, where a block includes a block header and a block body, wherein the block header includes a previous block. Summary, summary of this block. The time, version, initial random number, the root of the Merck tree of the transaction structure (equivalent to the preset workload difficulty), and the transaction subject involves multiple transactions. Therefore, the target block participating in the second transaction may be first acquired, and the preset workload difficulty is obtained from the head of the target block.

S304: Acquire an initial random number in the header of the target block, and calculate a hash value corresponding to the header of the target block according to the initial random number.

Specifically, referring to FIG. 4, the header of the block chain further includes an initial random number. After obtaining the initial random number in the header of the target block, the head of the block chain can be calculated. The hash value, for example, can be combined according to the order of each parameter in the header, and then the hash value of the combined header is calculated.

S306: Determine whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty.

Specifically, after the hash value is obtained, a workload difficulty may be obtained according to the hash value, for example, the number of 0s of the preset bit of the hash value may be calculated, and the hash value may be optionally obtained. The number of 0 in the beginning, the number of 0 is used as the current workload difficulty, and it is judged whether the workload difficulty meets the preset workload difficulty, that is, whether the number of 0 satisfies the preset workload difficulty, or Determine whether the number of 0 is greater than the preset workload difficulty.

S308: When the workload corresponding to the hash value does not meet the preset workload difficulty, the initial random number is adjusted.

Specifically, when the workload difficulty corresponding to the hash value does not meet the preset workload difficulty, the initial random number is adjusted, for example, the initial random number may be incremented or decremented according to a preset step, etc., where the preset The step size can be set as scheduled, typically one.

S310: Continue to calculate a hash value corresponding to the head of the target block according to the adjusted initial random number, and extract the adjustment in the header of the target block when the workload corresponding to the hash value satisfies the preset workload difficulty. The initial initial random number is used as the target random number.

Specifically, since the initial random number in the header of the target block is adjusted, the hash value corresponding to the target block header also changes, so the hash value corresponding to the target header needs to be recalculated, for example, According to the order of each parameter in the header, each parameter is combined, and then the hash value of the combined head is calculated. In the process of calculating the hash value of the head of the target block each time, the order of each parameter is not change.

After obtaining the new hash value, it continues to determine whether the workload difficulty meets the preset workload difficulty. If not, the random number is continuously adjusted until the workload corresponding to the hash value calculated according to the random number is difficult. When the workload is preset, the random number in the target block at this time is taken as the target random number.

Among them, blockchain is a new type of method that uses distributed computing devices to generate consensus (reciprocal data and computational behavior between nodes), also known as distributed ledger. The core design ideas include the use of a workload proof mechanism to protect the books. The specific process is described as follows: nodes in a distributed network (commonly known as as-built nodes) collect market transfer transaction information through the network, and the as-built node packages a certain number of transaction information into a block data structure in a specific format. At this time, the completion node generates a block header corresponding to the block according to a fixed format. In addition to the basic description of the current block information, the block header has two important attributes. One is a special summary value for all transactions (hash, constructed from the merkle-tree method from all serialized transactions) and the other is a random number field nonce at a location. After having the block header, the ascending node starts a step to search for a specific random number, calculates the hash of the block header structure corresponding to the initial value random number, and detects whether the hash satisfies the difficulty of the block chain to the current block. set up. If so, the search is ended, the random number nonce is written to the block header, and the block is broadcast to other as-built nodes in the network, waiting for other completion nodes to accept the block and write to their respective blockchains. If the proof of the set workload is not met, continue to increment the random number nonce, calculate the hash, check the difficulty, until you find a suitable difficulty.

In the above embodiment, the workload proof mechanism of the blockchain, that is, due to the characteristics of the hash algorithm, to generate a hash that satisfies a specific difficulty requirement, only the random number nonce is continuously adjusted, and what kind of random number nonce value satisfies the hash The difficulty requirements are randomly generated, thus ensuring the fairness of the target random number, thus ensuring the fairness of the transaction.

In one embodiment, FIG. 5 is a flowchart of step S204 in the embodiment shown in FIG. 2. The step S204 is to generate a first transaction value storage address according to the first transaction information, which may include :

S502: Select first transaction information with the same target block in the first transaction information.

Specifically, the node of the block chain receives the first transaction information sent by each transaction terminal in a preset time period, and the first transaction information may include the identifier of the target block, so that the node of the block chain can obtain the target. The block identifies the same first transaction information. The first transaction information sent by each transaction terminal may include a transaction terminal identifier or a user identifier, a second transaction value storage address, a target block, and transaction data, wherein the second transaction value storage address is adapted to accommodate data transmission in the blockchain. It may be in the form of a public key of an encryption algorithm corresponding to the second transaction value storage address.

S504: Generate a redemption script according to the second transaction value storage address and the transaction data in the first transaction information of the same target block.

Specifically, after acquiring the same first transaction information of the target block, the contract for each transaction terminal to participate in the transaction may be constructed according to the first transaction information, that is, the second transaction value in the first transaction information sent according to each transaction terminal. The storage address and the transaction data generate a redemption script, wherein the transaction data gives the expected target transaction result of the transaction terminal of the transaction, and only the transaction result obtained by the node of the block chain according to the target random number corresponds to the expected target transaction result. At this time, the transaction terminal can obtain the corresponding value from the first transaction value storage address.

For example, in the case of two transaction terminals, the generated redemption script may be: when the transaction processing result obtained according to the target random number matches the transaction data of the first transaction terminal, the first transaction terminal is allowed to be from the first The corresponding value is obtained in the transaction value storage address, otherwise, the second transaction terminal is allowed to obtain the corresponding value from the first transaction value storage address. Alternatively, in practice, it may be implemented by a blockchain script, that is, when the transaction processing result obtained according to the target random number matches the transaction data of the first transaction terminal, then the second corresponding to the first transaction terminal is The public key of the transaction value storage address is pushed onto the stack, otherwise, the public key of the second transaction value storage address corresponding to the second transaction terminal is pushed onto the stack.

S506: Calculate the redemption script to obtain a first transaction value storage address.

Specifically, a redemption script is constructed, which can also be regarded as a transaction contract of the transaction, and the first transaction value storage address, that is, a public value storage address, can be calculated according to the redemption script, for example, by redemption The script performs a second hash calculation to obtain the first transaction value storage address.

In the above embodiment, the redemption script can be constructed by the second transaction value storage address in the transaction information of each transaction terminal, which can also be regarded as the transaction contract of the transaction, and the first transaction value can be obtained according to the transaction contract. The storage address implements a scheme for constructing a trading contract using a non-turing complete blockchain scripting system and redeeming the value of the trading contract according to the set random conditions.

In one embodiment, the step S204, that is, the step of transferring the value of the first transaction into the first transaction value storage address by using the second transaction, may include: acquiring a third transaction value storage address corresponding to the transaction terminal; The second transaction acquires a value corresponding to the first transaction from the third transaction value storage address, and transfers the acquired value to the first transaction value storage address.

Specifically, the value of the first transaction is transferred to the first transaction value storage address by the second transaction, and in order to ensure the security of the value in the first transaction value storage address, the refill transaction may be signed by each transaction terminal. For example, a refill transaction is obtained according to the transaction information of the plurality of parties. For the refill transaction, each transaction terminal signs the second transaction by its own second algorithm private key to lock the funds in the transaction fund storage address.

The two transaction terminals are taken as an example for description. First, the funds of each user in the blockchain are obtained, including the third transaction value storage address, the user identifier, the public key corresponding to the third transaction value storage address, and the value amount. Then, the preset amount of value is transferred to the first transaction value storage address. If it is two users, such as Alice and Bob, they exchange each other's transactions and add themselves based on the other party's transaction information. The transaction value is recharged and the refill transaction is signed separately, that is, Alice and Bob respectively sign the private key of the above-mentioned recharge transaction with the encryption algorithm to make it effective; with the signature of Alice and Bob, the first transaction The value transfer address value is validated so that it can be broadcast to the blockchain and the miner node is recorded on the blockchain.

In the above embodiment, the third transaction value storage address corresponding to the transaction terminal is first acquired; the value corresponding to the first transaction is obtained from the third transaction value storage address by the second transaction, and the obtained value is transferred to the first A transaction value storage address ensures the security and accuracy of the transaction.

In one embodiment, the step of obtaining a transaction processing result according to the target random number and the first transaction information may include: performing a modulo operation on the target random number to obtain a reference random number; according to the reference random number and the first transaction information The transaction data is processed by the transaction results.

Specifically, when there are multiple transaction terminals participating in the transaction, there may be a scenario in which a plurality of transaction terminals may obtain corresponding values from the first transaction value storage address, in order to accurately participate in the transaction for the plurality of transaction terminals. To quantify and ensure the fairness of the transaction, the reference random number can be obtained according to the obtained target random number. For example, the modulo calculation of the target random number can obtain multiple reference random numbers, and then according to the reference random number and the first transaction information. The transaction data in the transaction is processed as a result of the transaction, wherein the transaction data refers to the expected processing result of the transaction by each transaction terminal.

In the above embodiment, the reference random number can be obtained according to the target random number only by one-step modulo operation, and the modulo operation can be a preset operation, and the reference random number is random under the premise that the target random number has randomness. The number is also random, thus extending the fairness of transactions involving multiple trading terminals.

In one embodiment, step S210 in the embodiment shown in FIG. 2, that is, the value corresponding to the transaction processing result is obtained from the first transaction value storage address, and the obtained value is transferred to the corresponding The step of the second transaction value storage address of the transaction terminal may include: receiving a value redemption request of the transaction terminal; determining, according to the transaction processing result, whether the transaction terminal corresponding to the value redemption request has a value redemption authority; and when the value redemption request When the corresponding transaction terminal has the value redemption authority, the value corresponding to the transaction processing result is obtained from the first transaction value storage address, and the obtained value is transferred to the second transaction value storage address of the corresponding transaction terminal. in.

Specifically, after the transaction ends, the node of the blockchain obtains the transaction processing result, and can receive the value redemption request of the transaction terminal, and the node of the block chain determines whether the transaction terminal has the value redemption authority according to the value redemption request. When the redemption authority is available, the value corresponding to the transaction processing result is obtained from the first transaction value storage address, and the obtained value is transferred to the second transaction value storage address of the corresponding transaction terminal to complete The entire transaction.

Wherein, in practical applications, for example, if two transaction terminals participate, the target random number is directly pushed onto the stack, and if multiple transaction terminals participate, the reference random number can be pushed onto the stack, and The Boolean value at the top of the stack is set according to the preset rule and the transaction data, and the public key of the encryption algorithm corresponding to the second transaction value storage address conforming to the preset rule is pushed onto the stack, so as to be pressed into the second in the stack. The transaction terminal corresponding to the public key of the encryption algorithm corresponding to the transaction value storage address can obtain the corresponding value. For example, when receiving the value redemption request sent by the transaction terminal, the value redemption request carries the private key corresponding to the public key of the encryption algorithm corresponding to the second transaction value storage address, and then the private key is first verified by the public key. Key, and when the verification is successful, the corresponding value is sent to the transaction terminal corresponding to the private key.

Among them, the example of the above two transaction terminals is described. The result of the transaction is to determine who can redeem the value among Alice or Bob according to the target random number calculated by the miner at the location of the target block. First, the value in the first transaction value storage address is pushed onto the stack, and then the instruction is executed to obtain the target random number. Third, the transaction data of each transaction terminal is pushed onto the stack, and then the transaction result acquisition instruction is executed to randomly according to the target. The number and transaction data are processed by the transaction processing. When the transaction processing result indicates that Alice can redeem the value, the second transaction value storage address corresponding to Alice is pushed onto the stack, and optionally the second transaction value corresponding to Alice is stored. The public key corresponding to the address is pushed into the stack, otherwise the second transaction value storage address corresponding to Bob is pushed onto the stack, and the public key corresponding to the second transaction value storage address corresponding to Bob is optionally pushed into the stack. And then receiving a transaction value redemption request sent by each transaction terminal, the request carries a corresponding private key, and the private key is verified by the public key pushed in the stack, and only the transaction terminal corresponding to the successful verification private key can Redeem the corresponding value to achieve the transaction.

In the above embodiment, receiving a value redemption request of the transaction terminal; determining, according to the transaction processing result, whether the transaction terminal corresponding to the value redemption request has a value redemption authority; and when the transaction terminal corresponding to the value redemption request has a value redemption authority, Obtaining a value corresponding to the transaction processing result from the first transaction value storage address, and transferring the obtained value to the second transaction value storage address of the corresponding transaction terminal, thereby ensuring the first transaction value storage address The security of value.

It should be understood that although the steps in the flowcharts of FIGS. 2, 3, and 5 are sequentially displayed in accordance with the indication of the arrows, these steps are not necessarily performed in the order indicated by the arrows. Except as explicitly stated herein, the execution of these steps is not strictly limited, and the steps may be performed in other orders. Moreover, at least some of the steps in FIG. 2, FIG. 3, and FIG. 5 may include a plurality of sub-steps or stages, which are not necessarily performed at the same time, but may be executed at different times. The order of execution of the sub-steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of the other steps or other steps.

In one embodiment, as shown in FIG. 6, a transaction processing apparatus is provided, including: a receiving module 100, a value transfer module 200, a target random number obtaining module 300, a transaction processing result generating module 400, and a transaction output module. 500, of which:

The receiving module 100 is configured to receive first transaction information sent by each transaction terminal, and generate a first transaction value storage address according to the first transaction information.

The value transfer module 200 is configured to transfer the value of the first transaction to the first transaction value storage address by the second transaction.

The target random number obtaining module 300 is configured to acquire a target random number of the target block of the second transaction according to the workload proof mechanism.

The transaction processing result generating module 400 is configured to obtain a transaction processing result according to the target random number and the first transaction information.

The transaction output module 500 is configured to obtain the value corresponding to the transaction processing result from the first transaction value storage address, and transfer the obtained value to the second transaction value storage address of the corresponding transaction terminal, the first transaction The information carries a second transaction value storage address.

In one embodiment, the target random number obtaining module 300 may include:

The preset workload difficulty obtaining unit is configured to acquire the preset workload difficulty of the target block.

The hash value calculation unit is configured to obtain an initial random number in the header of the target block, and calculate a hash value corresponding to the head of the target block according to the initial random number.

The adjusting unit is configured to determine whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty; when the workload corresponding to the hash value does not satisfy the preset workload difficulty, the initial random number is adjusted.

The target random number obtaining unit is configured to continue to calculate a hash value corresponding to the head of the target block according to the adjusted initial random number, and extract the target block when the workload difficulty corresponding to the hash value satisfies the preset workload difficulty The adjusted initial random number in the head is used as the target random number.

In one embodiment, the transaction processing result generation module 400 can include:

The selecting unit is configured to select the first transaction information with the same target block in the first transaction information.

And a redemption script generating unit, configured to generate a redemption script according to the second transaction value storage address and the transaction data in the first transaction information of the same target block.

The calculating unit is configured to calculate the redemption script to obtain the first transaction value storage address.

In one of the embodiments, the value transfer module 200 can include:

The transaction value storage address obtaining unit is configured to obtain a third transaction value storage address corresponding to the transaction terminal.

The value transfer unit is configured to obtain the value corresponding to the first transaction from the third transaction value storage address by the second transaction, and transfer the acquired value into the first transaction value storage address.

The reference random number obtaining unit is configured to perform a modulo operation on the target random number to obtain a reference random number.

The transaction processing result generating unit is configured to obtain a transaction processing result according to the reference random number and the transaction data in the first transaction information.

In one of the embodiments, the transaction output module 500 can include:

The value redemption request receiving unit is configured to receive a value redemption request of the transaction terminal.

The redemption authority determining unit is configured to determine, according to the transaction processing result, whether the transaction terminal corresponding to the value redemption request has a value redemption authority.

a transaction output unit, configured to: when the transaction terminal corresponding to the value redemption request has a value redemption right, obtain a value corresponding to the transaction processing result from the first transaction value storage address, and transfer the obtained value into To the second transaction value storage address of the corresponding transaction terminal.

For specific definitions of the transaction processing device, reference may be made to the above description of the transaction processing method, and details are not described herein again. Each of the above-described transaction processing devices may be implemented in whole or in part by software, hardware, and combinations thereof. Each of the above modules may be embedded in or independent of the processor in the computer device, or may be stored in a memory in the computer device in a software form, so that the processor invokes the operations corresponding to the above modules.

In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as shown in FIG. The computer device includes a processor, a memory, and a network interface connected by a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium, an internal memory. The non-volatile storage medium stores an operating system, computer readable instructions, and a database. The internal memory provides an environment for operation of an operating system and computer readable instructions in a non-volatile storage medium. The network interface of the computer device is used to communicate with an external transaction terminal via a network connection. The computer readable instructions are executed by a processor to implement a transaction processing method.

It will be understood by those skilled in the art that the structure shown in FIG. 7 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation of the computer device to which the solution of the present application is applied. The specific computer device may It includes more or fewer components than those shown in the figures, or some components are combined, or have different component arrangements.

A computer device comprising a memory and one or more processors, the memory storing computer readable instructions, the computer readable instructions being executed by the processor, causing the one or more processors to perform the steps of: receiving the respective transaction terminals The first transaction information, and generating a first transaction value storage address according to the first transaction information; transferring the value of the first transaction to the first transaction value storage address by the second transaction; acquiring the second transaction according to the workload certification mechanism a target random number of the target block; obtaining a transaction processing result according to the target random number and the first transaction information; and obtaining a value corresponding to the transaction processing result from the first transaction value storage address, and transferring the obtained value Entering into the second transaction value storage address of the corresponding transaction terminal, the first transaction information carries a second transaction value storage address.

In one embodiment, the step of acquiring the target random number of the target block of the second transaction according to the workload proof mechanism implemented by the processor when executing the computer readable instruction may include: acquiring a preset workload of the target block Difficulty; obtaining an initial random number in the header of the target block, and calculating a hash value corresponding to the head of the target block according to the initial random number; determining whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty; When the workload corresponding to the hash value does not satisfy the preset workload difficulty, the initial random number is adjusted; and the hash value corresponding to the head of the target block is continuously calculated according to the adjusted initial random number until the hash value is reached. When the workload corresponding to the hash value satisfies the preset workload difficulty, the adjusted initial random number in the header of the target block is extracted as the target random number.

In one embodiment, the step of generating the first transaction value storage address according to the first transaction information when the processor executes the computer readable instruction may include: selecting the first transaction in the first transaction information that has the same target block. Information; generating a redemption script according to the second transaction value storage address and the transaction data in the first transaction information of the same target block; and calculating the redemption script to obtain the first transaction value storage address.

In one embodiment, the step of transferring the value of the first transaction to the first transaction value storage address by the second transaction implemented by the processor when executing the computer readable instruction may include: acquiring the corresponding corresponding to the transaction terminal And the third transaction value storage address; and obtaining the value corresponding to the first transaction from the third transaction value storage address by the second transaction, and transferring the obtained value into the first transaction value storage address.

In one embodiment, the step of obtaining a transaction processing result according to the target random number and the first transaction information when the processor executes the computer readable instruction may include: performing a modulo operation on the target random number to obtain a reference random number; And obtaining the transaction processing result according to the reference random number and the transaction data in the first transaction information.

In one embodiment, the processor obtains the value corresponding to the transaction processing result from the first transaction value storage address when the processor executes the computer readable instruction, and transfers the acquired value to the corresponding transaction terminal. The step of the second transaction value storage address may include: receiving a value redemption request of the transaction terminal; determining, according to the transaction processing result, whether the transaction terminal corresponding to the value redemption request has a value redemption authority; and when the value redemption request corresponds When the transaction terminal has the value redemption authority, the value corresponding to the transaction processing result is obtained from the first transaction value storage address, and the obtained value is transferred to the second transaction value storage address of the corresponding transaction terminal.

One or more non-transitory computer readable storage mediums storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of: receiving individual transactions Transmitting the first transaction information by the terminal, and generating a first transaction value storage address according to the first transaction information; transferring the value of the first transaction to the first transaction value storage address by using the second transaction; acquiring the first according to the workload verification mechanism a target random number of the target block of the second transaction; obtaining a transaction processing result according to the target random number and the first transaction information; and obtaining a value corresponding to the transaction processing result from the first transaction value storage address, and acquiring the obtained value The value is transferred to the second transaction value storage address of the corresponding transaction terminal, and the first transaction information carries the second transaction value storage address.

In one embodiment, the step of acquiring, by the processor, the target random number of the target block of the second transaction according to the workload proof mechanism implemented by the processor may include: obtaining a preset work of the target block The difficulty is obtained; the initial random number in the head of the target block is obtained, and the hash value corresponding to the head of the target block is calculated according to the initial random number; whether the difficulty corresponding to the hash value satisfies the preset workload difficulty When the workload corresponding to the hash value does not satisfy the preset workload difficulty, the initial random number is adjusted; and the hash value corresponding to the head of the target block is continuously calculated according to the adjusted initial random number until When the workload difficulty corresponding to the hash value satisfies the preset workload difficulty, the adjusted initial random number in the header of the target block is extracted as the target random number.

In one embodiment, the step of generating the first transaction value storage address according to the first transaction information when the computer readable instructions are executed by the processor may include: selecting the first target in the first transaction information that is the same as the first block. Transaction information; generating a redemption script according to the second transaction value storage address and transaction data in the same first transaction information of the target block; and calculating the redemption script to obtain the first transaction value storage address.

In one embodiment, the step of transferring the value of the first transaction to the first transaction value storage address by the second transaction implemented by the processor when the computer readable instructions are executed may include: acquiring a corresponding transaction terminal The third transaction value storage address; and obtaining the value corresponding to the first transaction from the third transaction value storage address by the second transaction, and transferring the obtained value into the first transaction value storage address.

In one embodiment, the step of obtaining the transaction processing result according to the target random number and the first transaction information implemented by the processor when the computer readable instructions are executed by the processor may include: performing a modulo operation on the target random number to obtain a reference random number And obtaining transaction processing results based on the reference random number and the transaction data in the first transaction information.

In one embodiment, the computer readable instructions are obtained by the processor to obtain a value corresponding to the transaction processing result from the first transaction value storage address, and transfer the obtained value to the corresponding transaction terminal. The step of storing the second transaction value storage address may include: receiving a value redemption request of the transaction terminal; determining, according to the transaction processing result, whether the transaction terminal corresponding to the value redemption request has a value redemption authority; and when the value redemption request corresponds When the transaction terminal has the value redemption authority, the value corresponding to the transaction processing result is obtained from the first transaction value storage address, and the obtained value is transferred to the second transaction value storage address of the corresponding transaction terminal. .

One of ordinary skill in the art can understand that all or part of the process of implementing the above embodiments can be completed by computer readable instructions, which can be stored in a non-volatile computer. The readable storage medium, which when executed, may include the flow of an embodiment of the methods as described above. Any reference to a memory, storage, database or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of formats, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronization chain. Synchlink DRAM (SLDRAM), Memory Bus (Rambus) Direct RAM (RDRAM), Direct Memory Bus Dynamic RAM (DRDRAM), and Memory Bus Dynamic RAM (RDRAM).

The technical features of the above embodiments may be arbitrarily combined. For the sake of brevity of description, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, It is considered to be the range described in this specification.

The above-mentioned embodiments are merely illustrative of several embodiments of the present application, and the description thereof is more specific and detailed, but is not to be construed as limiting the scope of the invention. It should be noted that a number of variations and modifications may be made by those skilled in the art without departing from the spirit and scope of the present application. Therefore, the scope of the invention should be determined by the appended claims.

Claims

A transaction processing method, including:

Receiving first transaction information sent by each transaction terminal, and generating a first transaction value storage address according to the first transaction information;

Transferring the value of the first transaction to the first transaction value storage address by the second transaction;

Obtaining a target random number of the target block of the second transaction according to the workload proof mechanism;

Obtaining a transaction processing result according to the target random number and the first transaction information; and

Obtaining a value corresponding to the transaction processing result from the first transaction value storage address, and transferring the acquired value to a second transaction value storage address of the corresponding transaction terminal, the first transaction information Carrying the second transaction value storage address.
The method according to claim 1, wherein the obtaining a target random number of the target block of the second transaction according to the workload verification mechanism comprises:

Obtain the preset workload difficulty of the target block;

Obtaining an initial random number in a header of the target block, and calculating a hash value corresponding to a header of the target block according to the initial random number;

Determining whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty;

Adjusting the initial random number when the workload difficulty corresponding to the hash value does not satisfy the preset workload difficulty; and

And continuing to calculate a hash value corresponding to the head of the target block according to the adjusted initial random number, and extracting the target when the workload difficulty corresponding to the hash value satisfies the preset workload difficulty The adjusted initial random number in the header of the block is taken as the target random number.
The method according to claim 1 or 2, wherein the generating the first transaction value storage address according to the first transaction information comprises:

Selecting the first transaction information in the first transaction information that has the same target block;

Generating a redemption script according to the second transaction value storage address and the transaction data in the same first transaction information of the target block; and

The redemption script is calculated to obtain a first transaction value storage address.
The method of claim 3, wherein the transferring the value of the first transaction to the first transaction value storage address by the second transaction comprises:

Obtaining a third transaction value storage address corresponding to the transaction terminal;

Obtaining a value corresponding to the first transaction from the third transaction value storage address by the second transaction, and transferring the acquired value into the first transaction value storage address.
The method according to claim 4, wherein the obtaining the transaction processing result according to the target random number and the first transaction information comprises:

Performing a modulo operation on the target random number to obtain a reference random number; and

Transaction processing results are obtained based on the reference random number and transaction data in the first transaction information.
The method according to claim 5, wherein said obtaining a value corresponding to said transaction processing result from said first transaction value storage address, and transferring said acquired value to a corresponding transaction terminal The second transaction value storage address includes:

Receiving a value redemption request of the transaction terminal;

Determining, according to the transaction processing result, whether the transaction terminal corresponding to the value redemption request has a value redemption authority; and

When the transaction terminal corresponding to the value redemption request has a value redemption right, obtaining a value corresponding to the transaction processing result from the first transaction value storage address, and transferring the obtained value into To the second transaction value storage address of the corresponding transaction terminal.
A transaction processing device comprising:

a receiving module, configured to receive first transaction information sent by each transaction terminal, and generate a first transaction value storage address according to the first transaction information;

a value transfer module for transferring the value of the first transaction to the first transaction value storage address by the second transaction;

a target random number obtaining module, configured to acquire a target random number of the target block of the second transaction according to the workload proof mechanism;

a transaction processing result generating module, configured to obtain a transaction processing result according to the target random number and the first transaction information;

a transaction output module, configured to obtain a value corresponding to the transaction processing result from the first transaction value storage address, and transfer the obtained value to a second transaction value storage address of the corresponding transaction terminal, The first transaction information carries the second transaction value storage address.
The apparatus according to claim 7, wherein the target random number obtaining module comprises:

The preset workload difficulty obtaining unit is configured to acquire a preset workload difficulty of the target block;

a hash value calculation unit, configured to acquire an initial random number in a header of the target block, and calculate a hash value corresponding to a header of the target block according to the initial random number;

The adjusting unit is configured to determine whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty; when the workload difficulty corresponding to the hash value does not satisfy the preset workload difficulty, The initial random number is adjusted;

a target random number obtaining unit, configured to continue to calculate a hash value corresponding to a header of the target block according to the adjusted initial random number, until the workload difficulty corresponding to the hash value satisfies the preset work When the amount is difficult, the adjusted initial random number in the header of the target block is extracted as the target random number.
A computer device comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executed by the one or more processors to cause the one or more The processor performs the following steps: receiving first transaction information sent by each transaction terminal, and generating a first transaction value storage address according to the first transaction information; transferring the value of the first transaction to the first a transaction value storage address; acquiring a target random number of the target block of the second transaction according to the workload proof mechanism; obtaining a transaction processing result according to the target random number and the first transaction information; and Obtaining a value corresponding to the transaction processing result in a transaction value storage address, and transferring the obtained value to a second transaction value storage address of the corresponding transaction terminal, where the first transaction information carries the The second transaction value storage address.
The computer device according to claim 9, wherein the processor obtains the target random number of the target block of the second transaction according to the workload proof mechanism implemented by the processor when the computer readable instruction is executed, including Obtaining a preset workload difficulty of the target block; acquiring an initial random number in the header of the target block, and calculating a hash value corresponding to the head of the target block according to the initial random number; Whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty; when the workload difficulty corresponding to the hash value does not satisfy the preset workload difficulty, the initial random number is performed And adjusting, according to the adjusted initial random number, a hash value corresponding to the head of the target block, until the workload corresponding to the hash value meets the preset workload difficulty, and extracting The adjusted initial random number in the header of the target block is taken as the target random number.
The computer device according to claim 9 or 10, wherein the generating the first transaction value storage address according to the first transaction information when the processor executes the computer readable instruction comprises: Selecting first transaction information in the first transaction information that is the same as the target block; generating a redemption script according to the second transaction value storage address and the transaction data in the first transaction information of the target block; and The redemption script calculates the first transaction value storage address.
A computer apparatus according to claim 11, wherein said said first transaction value is transferred to said first transaction value by said second transaction by said processor executing said computer readable instructions The storage address includes: obtaining a third transaction value storage address corresponding to the transaction terminal; obtaining, by the second transaction, a value corresponding to the first transaction from the third transaction value storage address, and acquiring the value The value is transferred to the first transaction value storage address.
The computer apparatus according to claim 12, wherein said processor, when said computer readable instructions are executed, said obtaining transaction processing results based on said target random number and said first transaction information, including And performing a modulo operation on the target random number to obtain a reference random number; and obtaining a transaction processing result according to the reference random number and the transaction data in the first transaction information.
The computer apparatus according to claim 13, wherein said processor is configured to execute said computer readable instructions to obtain said correspondence from said first transaction value storage address to said transaction processing result And the value obtained by transferring the obtained value into the second transaction value storage address of the corresponding transaction terminal, comprising: receiving a value redemption request of the transaction terminal; determining the value redemption according to the transaction processing result Determining whether the corresponding transaction terminal has the value redemption authority; and when the transaction terminal corresponding to the value redemption request has the value redemption authority, obtaining the transaction processing result from the first transaction value storage address Corresponding value, and transferring the obtained value into the second transaction value storage address of the corresponding transaction terminal.
One or more non-transitory computer readable storage mediums storing computer readable instructions, when executed by one or more processors, cause the one or more processors to perform the following steps: Receiving first transaction information sent by each transaction terminal, and generating a first transaction value storage address according to the first transaction information; transferring the value of the first transaction to the first transaction value storage address by using the second transaction; Acquiring a target random number of the target block of the second transaction according to the workload proof mechanism; obtaining a transaction processing result according to the target random number and the first transaction information; and obtaining from the first transaction value storage address And the value corresponding to the transaction processing result is transferred to the second transaction value storage address of the corresponding transaction terminal, where the first transaction information carries the second transaction value storage address.
The storage medium of claim 15, wherein the computer readable instructions are executed by the processor to obtain a target random number of a target block of the second transaction according to a workload proof mechanism, The method includes: acquiring a preset workload difficulty of the target block; acquiring an initial random number in the header of the target block, and calculating a hash value corresponding to the head of the target block according to the initial random number; Determining whether the workload difficulty corresponding to the hash value satisfies the preset workload difficulty; when the workload difficulty corresponding to the hash value does not satisfy the preset workload difficulty, then the initial random number is And performing an adjustment; and continuing to calculate a hash value corresponding to the head of the target block according to the adjusted initial random number, until the workload difficulty corresponding to the hash value satisfies the preset workload difficulty The adjusted initial random number in the header of the target block is extracted as a target random number.
A storage medium according to claim 15 or claim 16, wherein said computer readable instructions are executed by said processor to generate said first transaction value storage address based on said first transaction information, including Selecting the first transaction information of the first transaction information in the first transaction information; generating a redemption script according to the second transaction value storage address and the transaction data in the same first transaction information of the target block; The redemption script calculates the first transaction value storage address.
A storage medium according to claim 17, wherein said computer readable instructions are implemented by said processor to transfer said first transaction to said first transaction by said second transaction The value storage address includes: obtaining a third transaction value storage address corresponding to the transaction terminal; obtaining, by the second transaction, a value corresponding to the first transaction from the third transaction value storage address, and acquiring the value The value arrived is transferred to the first transaction value storage address.
A storage medium according to claim 18, wherein said computer readable instructions are executed by said processor to obtain a transaction processing result based on said target random number and said first transaction information, The method includes: performing a modulo operation on the target random number to obtain a reference random number; and obtaining a transaction processing result according to the reference random number and the transaction data in the first transaction information.
A storage medium according to claim 19, wherein said computer readable instructions are obtained from said first transaction value storage address and said transaction processing result implemented by said processor Corresponding value, and transferring the obtained value to the second transaction value storage address of the corresponding transaction terminal, comprising: receiving a value redemption request of the transaction terminal; determining the value redemption according to the transaction processing result Retrieving whether the corresponding transaction terminal has a value redemption authority; and when the transaction terminal corresponding to the value redemption request has a value redemption right, obtaining the transaction processing from the first transaction value storage address The result corresponds to the value, and the acquired value is transferred to the second transaction value storage address of the corresponding transaction terminal.