WO2019153660A1 - Procédé et appareil de traitement de transactions, dispositif informatique et support d'informations - Google Patents

Procédé et appareil de traitement de transactions, dispositif informatique et support d'informations Download PDF

Info

Publication number
WO2019153660A1
WO2019153660A1 PCT/CN2018/096845 CN2018096845W WO2019153660A1 WO 2019153660 A1 WO2019153660 A1 WO 2019153660A1 CN 2018096845 W CN2018096845 W CN 2018096845W WO 2019153660 A1 WO2019153660 A1 WO 2019153660A1
Authority
WO
WIPO (PCT)
Prior art keywords
transaction
value
storage address
random number
value storage
Prior art date
Application number
PCT/CN2018/096845
Other languages
English (en)
Chinese (zh)
Inventor
吴贞海
Original Assignee
深圳壹账通智能科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳壹账通智能科技有限公司 filed Critical 深圳壹账通智能科技有限公司
Publication of WO2019153660A1 publication Critical patent/WO2019153660A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3821—Electronic credentials
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/385—Payment protocols; Details thereof using an alias or single-use codes

Definitions

  • the application relates to a transaction method, apparatus, computer device and storage medium.
  • 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.
  • a transaction processing method, apparatus, computer device, and storage medium are provided.
  • a transaction processing method including:
  • 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.
  • 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.
  • FIG. 1 is an application scenario diagram of a transaction processing method in accordance with one or more embodiments.
  • FIG. 2 is a flow diagram of a transaction processing method in accordance with one or more embodiments.
  • FIG. 3 is a flow chart of step S206 in the embodiment of Figure 2.
  • FIG. 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.
  • FIG. 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the first transaction value that is transferred to the blockchain by each transaction terminal is stored.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the transaction processing method 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.
  • 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.
  • 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:
  • 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.
  • the header of the block chain further includes an initial random number.
  • 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.
  • 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.
  • 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.
  • the hash value corresponding to the target block header 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.
  • the random number is continuously adjusted until the workload corresponding to the hash value calculated according to the random number is difficult.
  • the random number in the target block at this time is taken as the target random number.
  • 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.
  • the ascending node 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the transaction terminal can obtain the corresponding value from the first transaction value storage address.
  • 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.
  • 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.
  • 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.
  • 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.
  • the step S204 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.
  • 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.
  • a refill transaction is obtained according to the transaction information of the plurality of parties.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the reference random number can be obtained according to the obtained target random number.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the target random number is directly pushed onto the stack
  • the reference random number can be pushed onto the stack
  • 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.
  • the value redemption request 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • a transaction processing apparatus 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.
  • 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.
  • 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.
  • 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.
  • 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 transaction processing result generation module 400 can include:
  • 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.
  • 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.
  • 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.
  • a computer device 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • SRAM static RAM
  • DRAM dynamic RAM
  • SDRAM synchronous DRAM
  • DDRSDRAM double data rate SDRAM
  • ESDRAM enhanced SDRAM
  • Synchlink DRAM SLDRAM
  • Memory Bus Radbus
  • RDRAM Direct RAM
  • DRAM Direct Memory Bus Dynamic RAM
  • RDRAM Memory Bus Dynamic RAM

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé de traitement de transactions, comprenant : la réception d'informations d'une première transaction, envoyées par chaque terminal de transaction, et la production d'une adresse de stockage de valeurs de première transaction selon les informations de première transaction ; le transfert de la valeur d'une première transaction dans l'adresse de stockage de valeurs de première transaction, au moyen d'une seconde transaction ; l'obtention d'un nombre aléatoire cible d'un bloc cible de la seconde transaction, selon une preuve de mécanisme de travail ; l'obtention d'un résultat de traitement de transaction en fonction du nombre aléatoire cible et des informations de première transaction ; et l'obtention de la valeur correspondant au résultat de traitement de transactions, à partir de l'adresse de stockage de valeur de première transaction, et le transfert de la valeur obtenue dans une adresse de stockage de valeur de seconde transaction d'un terminal de transaction correspondant, les informations de première transaction portant l'adresse de stockage de valeur de seconde transaction.
PCT/CN2018/096845 2018-02-07 2018-07-24 Procédé et appareil de traitement de transactions, dispositif informatique et support d'informations WO2019153660A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810123767.1 2018-02-07
CN201810123767.1A CN108399533B (zh) 2018-02-07 2018-02-07 交易处理方法、装置、计算机设备和存储介质

Publications (1)

Publication Number Publication Date
WO2019153660A1 true WO2019153660A1 (fr) 2019-08-15

Family

ID=63096079

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/096845 WO2019153660A1 (fr) 2018-02-07 2018-07-24 Procédé et appareil de traitement de transactions, dispositif informatique et support d'informations

Country Status (2)

Country Link
CN (1) CN108399533B (fr)
WO (1) WO2019153660A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109995775B (zh) * 2019-03-22 2021-06-01 杭州复杂美科技有限公司 区块链验证码应用方法、设备和存储介质
CN111464544B (zh) * 2020-04-01 2022-08-23 中国联合网络通信集团有限公司 一种区块链账本生成方法和装置
CN111586013B (zh) * 2020-04-29 2022-02-22 数网金融有限公司 网络入侵检测方法、装置、节点终端及存储介质
CN112504292B (zh) * 2020-11-18 2023-03-28 广东中电绿能科技有限公司 一种基于消费信息的导航方法、导航装置及移动终端

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106452785A (zh) * 2016-09-29 2017-02-22 财付通支付科技有限公司 区块链网络、分支节点及区块链网络应用方法
US9818136B1 (en) * 2003-02-05 2017-11-14 Steven M. Hoffberg System and method for determining contingent relevance
CN108305074A (zh) * 2018-01-30 2018-07-20 深圳壹账通智能科技有限公司 交易处理方法、装置、计算机设备和存储介质

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015175722A1 (fr) * 2014-05-13 2015-11-19 Nant Holdings Ip, Llc Systèmes et procédés de validation de transactions de soins de santé par l'intermédiaire d'une preuve de travail à chaîne de blocs
CN106251144A (zh) * 2015-06-05 2016-12-21 地气股份有限公司 电子货币管理方法及电子货币节点装置
CN105488722B (zh) * 2015-11-30 2019-11-26 布比（北京）网络技术有限公司 基于衍生链的资产数据处理方法及装置
CN106022917A (zh) * 2016-05-08 2016-10-12 杭州复杂美科技有限公司 区块链撮合交易所方案
CN106779704A (zh) * 2016-12-06 2017-05-31 杭州趣链科技有限公司 一种基于环签名的区块链匿名交易方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9818136B1 (en) * 2003-02-05 2017-11-14 Steven M. Hoffberg System and method for determining contingent relevance
CN106452785A (zh) * 2016-09-29 2017-02-22 财付通支付科技有限公司 区块链网络、分支节点及区块链网络应用方法
CN108305074A (zh) * 2018-01-30 2018-07-20 深圳壹账通智能科技有限公司 交易处理方法、装置、计算机设备和存储介质

Also Published As

Publication number Publication date
CN108399533A (zh) 2018-08-14
CN108399533B (zh) 2020-08-18

Similar Documents

Publication Publication Date Title
KR102215773B1 (ko) 영-지식 증명을 갖는 계정 노트 모델에 기초한 블록체인 데이터 보호
US20210126790A1 (en) Method and system for publicly verifiable proofs of retrievability in blockchains
US11501533B2 (en) Media authentication using distributed ledger
WO2019153660A1 (fr) Procédé et appareil de traitement de transactions, dispositif informatique et support d'informations
US11238447B2 (en) Blockchain transactions with ring signatures
CN110945550B (zh) 在可信执行环境下处理和存储区块链数据
CN108985100B (zh) 基于区块链的元素安全性证明方法、装置、设备和介质
US11797985B2 (en) Value transfer method, apparatus, and system
US20220311607A1 (en) Key generation method and apparatus, device, and medium
EP4300323A1 (fr) Procédé et appareil de traitement de données pour réseau à chaîne de blocs, dispositif informatique, support de stockage lisible par ordinateur et produit de programme informatique
CN111095218B (zh) 基于纠错编码存储共享的区块链数据的方法、系统及装置
CN111461691B (zh) 基于区块链的流量统计系统、方法及装置
CN111818185B (zh) 启动智能合约的方法及装置、电子设备、存储介质
CA3037833A1 (fr) Systeme et methode de protection de l'information
CN109800248A (zh) 用于区块链网络的数字内容溯源和记录方法、存储介质、计算设备
CN110336779B (zh) 一种区块链的构建方法、装置和电子设备
WO2020210979A1 (fr) Procédé d'apprentissage conjoint à base de réseau de chaîne de blocs et dispositif d'apprentissage conjoint
Król et al. Proof-of-prestige: A useful work reward system for unverifiable tasks
WO2020019792A1 (fr) Appareil et procédé de libération de blocs, et dispositif électronique
CN111033491A (zh) 基于纠错编码存储共享的区块链数据
US20220217004A1 (en) Systems and methods for non-parallelised mining on a proof-of-work blockchain network
TWI608434B (zh) Decentralized electronic transaction record method and system with traceability verification mechanism
CN116896564B (zh) 基于区块链网络的区块生成方法、装置和计算机设备
Xie et al. A novel blockchain-based and proxy-oriented public audit scheme for low performance terminal devices
CN115619395A (zh) 基于区块链的数据处理方法及相关设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18904872

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 04.12.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18904872

Country of ref document: EP

Kind code of ref document: A1