CN110570289A - service processing method, device, equipment and storage medium based on block chain - Google Patents

service processing method, device, equipment and storage medium based on block chain Download PDF

Info

Publication number
CN110570289A
CN110570289A CN201910867618.0A CN201910867618A CN110570289A CN 110570289 A CN110570289 A CN 110570289A CN 201910867618 A CN201910867618 A CN 201910867618A CN 110570289 A CN110570289 A CN 110570289A
Authority
CN
China
Prior art keywords
competitive
target object
information
competition
payment
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN201910867618.0A
Other languages
Chinese (zh)
Inventor
王星雅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
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 Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN201910867618.0A priority Critical patent/CN110570289A/en
Publication of CN110570289A publication Critical patent/CN110570289A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0283—Price estimation or determination
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Computer Security & Cryptography (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The application discloses a service processing method, a device, equipment and a storage medium based on a block chain, and belongs to the technical field of block chains. The method comprises the following steps: acquiring at least one piece of competitive payment information aiming at a target object from a block chain system, wherein the competitive payment information comprises competitive amount information and competitive timestamp information of a first user in a competitive payment process aiming at the target object; when the competitive payment process aiming at the target object meets the competitive termination condition, the target competitive result of the target object is determined based on the competitive amount information and the competitive time stamp information, and the target competitive result is stored in the block chain system. Based on the above process, information related to the competitive payment service, such as competitive payment information and a target competition result, is stored in the blockchain system, the information in the blockchain system is not allowed to be tampered, the safety and reliability of the information related to the competitive payment service are high, and the reliability of the processing process of the competitive payment service is high.

Description

Service processing method, device, equipment and storage medium based on block chain
Technical Field
the present disclosure relates to the field of block chain technologies, and in particular, to a method, an apparatus, a device, and a storage medium for processing a service based on a block chain.
Background
In the conventional competitive payment service (e.g., auction service), a transaction place is on line, a host needs to provide a place, and people participating in competitive payment need to go from different places to the place of the host for on-site competition, so that a great deal of manpower and financial resources are wasted, and the efficiency of competitive payment is very low. Therefore, with the explosion of internet technology, more and more competitive payment services are processed online through the internet.
In general, in the process of processing the competitive payment service on line, a competitor sends competitive payment information to a competitive platform, the competitive platform processes the competitive payment service based on the competitive payment information, and finally feeds back a competitive result to a seller and the competitor. In the processing mode of the competitive payment service, the competitive payment information in the competitive platform is not public and opaque, and is easy to be tampered by a competitor or an auction party, so that the risk of cheating exists, and the reliability of the processing process of the competitive payment service is lower.
disclosure of Invention
The embodiment of the application provides a service processing method, a device, equipment and a storage medium based on a block chain, which can be used for solving the problem of low reliability of a processing process of competitive payment service in the related technology. The technical scheme is as follows:
In one aspect, an embodiment of the present application provides a service processing method based on a block chain, where the method includes:
acquiring at least one piece of competitive payment information aiming at a target object from the blockchain system, wherein the competitive payment information comprises competitive amount information and competitive timestamp information of a first user in a competitive payment process aiming at the target object;
When the competitive payment process for the target object meets a competition termination condition, determining a target competition result of the target object based on the competition amount information and competition timestamp information, and storing the target competition result in the blockchain system.
In another aspect, an apparatus for processing a service based on a block chain is provided, where the apparatus includes:
The acquisition module is used for acquiring at least one piece of competitive payment information aiming at a target object from the blockchain system, wherein the competitive payment information comprises competitive amount information and competitive timestamp information of a first user in a competitive payment process aiming at the target object;
A determining module, configured to determine a target competition result of the target object based on the competition amount information and competition timestamp information when the competitive payment process for the target object meets a competition termination condition;
and the storage module is used for storing the target competition result in the block chain system.
In one possible implementation, the competitive payment process for the target object includes at least one competitive payment subprocess, each competitive payment subprocess corresponding to one competitive turn number;
The determining module is further configured to determine, when it is determined that any competitive payment sub-process for the target object ends, an intermediate competition result of the target object corresponding to the any competitive payment sub-process based on the competition amount information and the competition timestamp information in the any competitive payment sub-process;
The storage module is further configured to store the intermediate competition result in the blockchain system.
in a possible implementation manner, the determining module is further configured to determine that any competitive payment sub-process for the target object is ended if a difference between the current timestamp and the termination timestamp of any competitive payment sub-process is not less than a reference time threshold; or if the competitive time stamp in any competitive payment information is not less than the termination time stamp of any competitive payment subprocess, determining that any competitive payment subprocess aiming at the target object is finished.
In a possible implementation manner, the determining module is further configured to determine a highest competition amount for the target object based on the competition amount information and competition timestamp information; determining identification information of a first user in competitive payment information corresponding to the highest competitive amount based on the highest competitive amount; and taking the highest competition amount, the identification information of the first user and the identification information of the target object as a target competition result of the target object.
In one possible implementation, the competitive payment process for the target object satisfies a competitive termination condition, including:
The number of competitive rounds corresponding to any competitive payment subprocess reaches a round number threshold; or,
among a plurality of intermediate competition results corresponding to the plurality of competitive payment subprocesses, the highest competition amount among the first reference number of intermediate competition results is the same.
In one possible implementation, the apparatus further includes:
A receiving module, configured to receive basic information of the target object and a competitive payment contract of the target object, where the basic information of the target object includes identification information of the target object and description information of the target object; the competitive payment contract for the target object includes a competitive termination condition for the target object;
the storage module is further configured to store the basic information of the target object and the competitive payment contract of the target object in the blockchain system.
in a possible implementation manner, the receiving module is further configured to receive at least one piece of competitive payment information of the target object, where the competitive payment information includes a number of competitive rounds, competitive amount information, competitive timestamp information, identification information of the target object, and identification information of the first user;
The storage module is further configured to store the at least one competitive payment information in the blockchain system.
In one possible implementation, the apparatus further includes:
a transfer module for transferring a second reference amount of funds from the funds accounts of the respective first users to the funds accounts of the blockchain system; transferring a third reference amount of funds from a funds account of a second user to a funds account of the blockchain system, the second user for initiating a competitive payment process for the target.
In one possible implementation manner, the transfer module is further configured to transfer the second reference amount of funds from the fund accounts of the blockchain system to fund accounts of other first users except the first user corresponding to the target competition result.
In one possible implementation, the transfer module is further configured to transfer a second reference amount of funds from the funding account of the blockchain system to the funding account of the first user corresponding to the target competition result when the transaction result of the target object indicates that the transaction is successful; transferring a third reference amount of funds from the funds accounts of the blockchain system to the funds account of the second user.
In one possible implementation, the transfer module is further configured to transfer a fourth reference amount of funds from the funds accounts of the blockchain system to the funds account of the second user when the transaction result of the target indicates that the competitive funds transfer of the target fails, where the fourth reference amount is a sum of the second reference amount and the third reference amount.
in one possible implementation, the transfer module is further configured to transfer a fourth reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competition result when the transaction result of the target object indicates that the competitive fund transfer of the target object is successful and the target object transfer is failed, where the fourth reference amount is a sum of the second reference amount and the third reference amount.
In another aspect, a computer device is provided, where the computer device includes a processor and a memory, where the memory stores at least one program code, and the at least one program code is loaded and executed by the processor to implement any one of the above-mentioned service processing methods based on a blockchain.
in another aspect, a computer-readable storage medium is provided, where at least one program code is stored in the computer-readable storage medium, and the at least one program code is loaded and executed by a processor to implement any one of the above-mentioned service processing methods based on a blockchain.
The technical scheme provided by the embodiment of the application at least has the following beneficial effects:
And determining a target competition result of the target object based on the competitive payment information stored in the blockchain system, and storing the target competition result in the blockchain system. In the processing process of the competitive payment service, information related to the competitive payment service, such as competitive payment information, a target competition result and the like, is stored in the blockchain system, and the information in the blockchain system is public and transparent, so that the phenomenon of competitive payment cheating can be avoided. In addition, the information in the blockchain system is not allowed to be tampered, and the safety and the reliability of the information related to the competitive payment service are high, so that the reliability of the processing process of the competitive payment service is high.
drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a plurality of blocks in a block chain according to an embodiment of the present disclosure;
Fig. 2 is a schematic diagram of an implementation environment of a service processing method based on a block chain according to an embodiment of the present application;
Fig. 3 is a flowchart of a service processing method based on a block chain according to an embodiment of the present application;
fig. 4 is a schematic diagram of a device configured with multiple node devices in a contention block chain according to an embodiment of the present application;
Fig. 5 is a schematic diagram of a process for verifying any competitive payment information of a target object by a management node device according to an embodiment of the present application;
FIG. 6 is a schematic diagram of a process for determining an intermediate competition result of a target object corresponding to any one of the competitive payment sub-processes according to an embodiment of the present disclosure;
Fig. 7 is a schematic diagram of a service processing apparatus based on a block chain according to an embodiment of the present application;
Fig. 8 is a schematic diagram of a service processing apparatus based on a block chain according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a terminal according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of a server according to an embodiment of the present application.
Detailed Description
to make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
first, several terms referred to in the present application will be explained.
the block chain system: refers to a system that employs block-chain techniques to store data. The block chain technology is also called as distributed book technology, is an internet database technology, and is characterized in that centralization and public transparency are achieved, and everyone can participate in database recording. Blockchain technology may be a distributed infrastructure and computing approach that utilizes blockchain data structures to authenticate and store data, utilizes distributed node consensus algorithms to generate and update data, cryptographically secures data transmission and access, and utilizes intelligent contracts composed of automated script code to program and manipulate data. The data stored in the blockchain system has high stability and reliability, and the blockchain system is a non-tampered and trusted database. Therefore, compared with the traditional method of directly utilizing a competitive platform to process competitive payment services, the method for processing the competitive payment services by adopting the block chain system is beneficial to improving the safety and reliability of the processing process of the competitive payment services.
the blockchain system can comprise a plurality of node devices, and data can be shared between the node devices. Each node device may receive input information for normal operation and maintain shared data within the blockchain system based on the received input information. In order to ensure information intercommunication in the blockchain system, information connection can exist between each node device in the blockchain system, and information transmission can be carried out between the node devices through the information connection. For example, when any node device in the blockchain system receives input information, other node devices in the blockchain system acquire the input information according to a consensus algorithm, and store the input information as data in shared data, so that the data stored in all the node devices in the blockchain system are consistent.
each node device in the blockchain system has a node device identifier corresponding thereto, and each node device in the blockchain system can store node device identifiers of other node devices in the blockchain system, so that the generated block is broadcast to other node devices in the blockchain system according to the node identifiers of the other node devices in the subsequent process. Each node device may maintain a node device identifier list as shown in the following table, and store the node device name and the node device identifier in the node device identifier list correspondingly. The node device identifier may be an IP (Internet Protocol) address and any other information that can be used to identify the node device, and table 1 only illustrates the IP address as an example.
TABLE 1
Node device name Node device identification
Node device 1 117.114.151.174
node device 2 117.116.189.145
… …
Node device N 119.123.789.258
Each node device in the blockchain system is configured with an identical blockchain. A block chain is composed of a plurality of blocks, see fig. 1, where fig. 1 is a schematic diagram of a plurality of blocks in the block chain provided in an embodiment of the present application, a starting block includes a block header and a block main body, the block header stores an input information characteristic value, a version number, a timestamp, and a difficulty value, and the block main body stores input information; the next block of the starting block takes the starting block as a parent block, the next block also comprises a block head and a block main body, the block head stores the input information characteristic value of the current block, the block head characteristic value of the parent block, the version number, the timestamp and the difficulty value, and the like, so that the block data stored in each block in the block chain is associated with the block data stored in the parent block, and the safety of the input information in the block is ensured.
Block height: the number of blocks linked to the main chain, i.e. the number of blocks connected to the block chain.
A consensus mechanism: the method refers to a mathematical algorithm for establishing trust and obtaining rights and interests among different node devices in a block chain system. In the block chain system, the verification and confirmation of the transaction can be completed in a short time through the voting of the special node devices, and if a plurality of node devices with irrelevant benefits can achieve the consensus, all the node devices in the system can also achieve the consensus.
fig. 2 is a schematic diagram illustrating an implementation environment of a service processing method based on a block chain according to an embodiment of the present application. The implementation environment may include: the blockchain system 21 includes a plurality of node devices 210 in the blockchain system 21, and any node device 210 may execute one or more steps of the service processing method provided in the embodiment of the present application.
The plurality of node devices 210 in the blockchain system 21 may be configured with a competitive blockchain for storing data related to competitive payment transactions, wherein the data related to competitive payment transactions may include competitive payment information, competitive payment contracts, competitive results, and the like. The competitive block chain is composed of a plurality of blocks, and the adjacent blocks have an incidence relation, so that data in any block can be detected by the next block when being tampered, thereby avoiding the data related to the competitive payment service from being tampered, and ensuring the safety and reliability of the processing process of the competitive payment service. Any node device 210 configured with the competitive blockchain may be a node device logged in by a first user participating in the competitive payment process, or may be a node device logged in by a second user initiating the competitive payment process, which is not limited in this embodiment of the present application.
The node device 210 refers to a computer device, and the computer device may be a terminal or a server, which is not limited in this embodiment of the present application.
it will be understood by those skilled in the art that the above-described blockchain system 21 is merely exemplary, and that other existing or future blockchain systems, as may be suitable for use in the present application, are also included within the scope of the present application and are hereby incorporated by reference.
Based on the implementation environment shown in fig. 2, an embodiment of the present application provides a service processing method based on a blockchain, where the method may be applied to any node device in a blockchain system. Fig. 3 is a flowchart of a service processing method based on a block chain according to an embodiment of the present disclosure, and as shown in fig. 3, the method according to the embodiment of the present disclosure may include the following steps:
301. the first node device receives the basic information of the target object and the competitive payment contract of the target object, and stores the basic information of the target object and the competitive payment contract of the target object in the blockchain system.
the basic information of the target object comprises identification information of the target object and description information of the target object; the competitive payment contract for the target object includes a competitive termination condition for the target object;
The target object refers to any object to be competitor, and the object to be competitor may be a solid object or a virtual object, which is not limited in the embodiments of the present application. The basic information of the target object refers to information related to the target object, and may include identification information of the target object, description information of the target object, reserve price information of the target object, fund account information of the second user, and the like. The identification information of the target object is used for uniquely identifying the target object, for example, when the target object is an automobile, the identification information of the target object may be an engine number of the automobile, and when the target object is a house, the identification information of the target object may be a property certificate number of the house; the description information of the target object is used for describing the name, attribute, image and other detailed information of the target object so as to be known by users participating in the competitive payment process; the base price information of the target object is used for indicating the lowest competition amount of the target object; the fund account information of the second user is used for indicating the fund account name, the fund amount and other information of the second user, wherein the second user refers to the user initiating the competitive payment process.
the competitive payment contract for a target object is used to indicate the rules of the target object in the competitive payment process, including but not limited to competitive payment rules and transaction rules, etc. The competitive payment rule is used for ensuring the orderly progress of the competitive payment process, and may include a competitive termination condition of the target object, a competitive start timestamp of the target object, a duration of each round of competition of the target object, a competition mode and the like; the transaction rules are used to ensure that the target and the competitive funds are transferred smoothly after the competitive payment process is completed.
in this embodiment of the present application, a plurality of node devices in a blockchain system are configured with a contention blockchain for storing data related to a competitive payment service, see fig. 4, where fig. 4 is a schematic diagram of a plurality of node devices configured with a contention blockchain provided in this embodiment of the present application, and any node device in the plurality of node devices may be a node device of a second user initiating a competitive payment process, a node device of a first user participating in a competitive payment process, or an expert node device. The node device of the second user may send related information of the to-be-contended object, for example, identification information, description information, and the like of the to-be-contended object; the node device of the first user may send related information that the first user performs competitive payment on any object to be contended, for example, information of a competitive amount of any object to be contended, information of a competitive timestamp, and the like; the expert node equipment can evaluate the value of the object to be competitive and send the value evaluation information of the object to be competitive. In addition, the competition block chain also comprises a fund account which is used for storing funds of the first user and the second user.
The process of the first node device receiving the basic information of the target object and the competitive payment contract of the target object may be: the node equipment of a second user in the blockchain system sends the basic information of the target object and the competitive payment contract of the target object to the management node equipment in the blockchain system, and the management node equipment verifies the received basic information of the target object and the competitive payment contract; after the verification is passed, the management node equipment inquires a competitive block chain for storing data related to the competitive payment service in the block chain system; the management node equipment sends the basic information of the target object and the competitive payment contract to the first node equipment configured with the competitive block chain; the first node device receives basic information of a target object and a competitive payment contract. In the embodiment of the present application, a node device that receives the basic information of the target object and the competitive payment contract sent by the management node device is taken as a first node device.
In one possible implementation manner, the process of verifying the basic information of the target object and the competitive payment contract by the management node device of the blockchain system may be: before the node equipment of the second user sends the basic information of the target object and the competitive payment contract, encrypting the basic information of the target object and the competitive payment contract according to the private key of the node equipment of the second user; and after receiving the encrypted basic information of the target object and the competitive payment contract, the management node equipment decrypts the encrypted basic information of the target object and the competitive payment contract by using the public key of the node equipment of the second user. If the decryption is unsuccessful, the basic information of the target object and the competitive payment contract are invalid, and the verification is failed. If the decryption is successful, the management node device may further verify whether the amount of funds in the funds account of the second user is not less than the third reference amount. If the fund amount in the fund account of the second user is not less than the third reference amount, the basic information and the competitive payment contract sent by the node equipment of the second user are verified to be passed; and if the fund amount in the fund account of the second user is less than the third reference amount, the node equipment of the second user sends the basic information and the competitive payment contract to be verified to be not passed.
In a possible implementation manner, in order to ensure data security in the process of sending the basic information of the target object and the competitive payment contract to the first node device by the management node device, before the management node device sends the basic information of the target object and the competitive payment contract to any first node device, the management node device may encrypt the basic information of the target object and the competitive payment contract according to a public key of any first node device, and then send the obtained encrypted data to any first node device. After receiving the encrypted data, the any first node device can decrypt the encrypted data according to the private key to obtain the basic information of the target object and the competitive payment contract. The method can effectively avoid the basic information and the competitive payment contract of the target object from being tampered, and improves the transmission safety of the basic information and the competitive payment contract of the target object. It should be noted that, when the management node device sends the encrypted data to the first node device, the management node device may carry the digital signature of the management node device, so that the first node device can determine that the basic information of the target object and the competitive payment contract are verified and sent by the management node device according to the digital signature. The digital signature is a digital string which can be generated only by a sender of information and cannot be forged by others.
in one possible implementation, after receiving the basic information of the target object and the competitive payment contract, the first node device may first transfer a third reference amount of funds from the fund account of the second user to the fund account of the blockchain system, and then store the basic information of the target object and the competitive payment contract in the blockchain system. Wherein the third reference amount of funds is used to restrict malicious behavior of the second user. The fund accounts of the blockchain system are used for temporarily storing funds, and the funds in the fund accounts of the blockchain system are not allowed to be transferred privately, so that the safety is high. The third reference amount may be set empirically or may be freely adjusted according to the type of the target object, which is not limited in the embodiment of the present application.
In another possible implementation manner, after receiving the basic information of the target object and the competitive payment contract, the first node device may first obtain the value evaluation information of the target object, add the value evaluation information of the target object to the basic information of the target object, and then store the basic information of the target object and the competitive payment contract in the blockchain system. The value evaluation information can be used for the first user participating in the competitive payment process to know the value of the target object more, so that the competitive amount can be determined according to the value of the target object. The manner in which the first node device obtains the value evaluation information of the target object includes, but is not limited to, the following two ways:
The first method is as follows: and the first node equipment matches the basic information of the target object with the value evaluation rule and obtains the value evaluation information of the target object according to the matching result.
the second method comprises the following steps: the login user of the first node equipment carries out professional evaluation on the target object according to the basic information of the target object, generates a value evaluation report and uploads the value evaluation report to the first node equipment, and the first node equipment can obtain the value evaluation information of the target object according to the artificially generated value evaluation report.
Next, the first node device may store the basic information of the target object and the competitive payment contract of the target object in the blockchain system, that is, store the basic information of the target object and the competitive payment contract of the target object on the competitive blockchain in the blockchain system. The storage process can be divided into the following two steps:
Step one, the first node equipment generates a target block based on the basic information of the target object and the competitive payment contract of the target object.
In the block chain technology, data may be stored in the blocks in the form of electronic records, and in this embodiment of the application, when a packaging condition is satisfied, the first node device may package basic information of the target object and a competitive payment contract of the target object to generate the target block. The meeting of the packing condition may be to meet a time interval required for packing data or to meet a data quantity required for packing data, which is not limited in the embodiment of the present application.
In one possible implementation, the process of the first node device generating the target block may be as follows:
when receiving the basic information of the target object and the competitive payment contract of the target object, the first node equipment verifies the basic information of the target object and the competitive payment contract of the target object, and after the verification is completed, the basic information of the target object and the competitive payment contract of the target object are used as input information, the input information is stored in a memory pool, and a hash tree used for recording the input information is updated; and then, updating the updating time stamp to the time when new input information is received, trying different random numbers, and calculating the characteristic value for multiple times, so that the calculated characteristic value can satisfy the following formula:
SHA256(SHA256(version+prev_hash+merkle_root+ntime+nbits+x))<TARGET
wherein, SHA256 is a characteristic value algorithm used for calculating a characteristic value; version is version information of the relevant block protocol in the block chain; the prev _ hash is a block head characteristic value of a parent block of the target block, and the parent block of the target block is a block with the largest block height on the current competition block chain; merkle _ root is a characteristic value of the input information; ntime is the update time of the update timestamp; nbits is the current difficulty, is a fixed value within a period of time, and is determined again after exceeding a fixed time period; x is a random number; TARGET is a feature threshold, which can be determined from nbits.
Thus, when the random number meeting the formula is obtained through calculation, the information can be correspondingly stored, and a block header and a block main body are generated to obtain the target block.
It should be noted that the above description of the target block generation process is only an exemplary description of one block generation method, and the embodiment of the present application does not limit which block generation method is specifically adopted.
And step two, the first node equipment adds the target block to a competitive block chain in the block chain system based on a consensus mechanism.
the blockchain system may perform consensus on the target block to determine whether the data in the target block is accurate, i.e., to verify the data in the target block. In a possible implementation manner, after the first node device generates the target block, the first node device may send the target block to other node devices respectively according to node device identifiers of other node devices in the blockchain system, the other node devices may verify the target block, and broadcast verification results in the blockchain system respectively, and when the number of node devices that pass the verification result in the blockchain system is greater than a reference ratio or greater than a reference number, the first node device may determine that the target block commonly identifies, and then add the target block to a competition blockchain in the blockchain system. The reference proportion refers to a proportion that the number of the node devices passing the verification result accounts for the number of all the node devices in the block chain system, and the reference proportion may be set empirically or may be freely adjusted according to an application scenario, which is not limited in the embodiment of the present application. For example, the reference ratio may be set to 1/3 or the like. Likewise, the reference number may be set empirically, or may be freely adjusted according to the total number of all node devices in the blockchain system, for example, the reference number may be set to 100, and so on. The consensus process described above may be implemented based on a consensus mechanism, which may be, for example, a workload proving mechanism, a rights proving mechanism, or the like. It should be noted that the above-mentioned consensus process is only an exemplary description, and the embodiments of the present application do not limit this.
through the first step and the second step, the first node device may store the basic information of the target object and the competitive payment contract of the target object on the competitive blockchain, and synchronize the basic information of the target object and the competitive payment contract of the target object to each node device configured with the competitive blockchain.
302. the second node device receives at least one competitive payment message of the target object and stores the at least one competitive payment message in the blockchain system.
The competitive payment information refers to information of a competitive payment process of a target object, and the competitive payment information includes, but is not limited to, the number of competitive rounds, the amount of competition information, the timestamp information of competition, the identification information of the target object, the identification information of a first user participating in the competitive payment process, the fund account information of the first user, and the like. It should be noted that each number of competitive rounds corresponds to one competitive payment sub-process, and in the whole competitive payment process of the target object, the competitive payment sub-process includes a plurality of competitive payment sub-processes corresponding to a plurality of numbers of competitive rounds, and with a change of the current timestamp, the second node device may receive a plurality of competitive payment information in the competitive payment sub-processes corresponding to the plurality of numbers of competitive rounds of the target object. The plurality of competitive payment information in any competitive payment sub-process may include the same identification information of the first user, that is, the same first user may initiate a plurality of competitive payment information including different amounts of competition in the same competitive payment sub-process.
The process of the second node device receiving any competitive payment information of the target object may be as follows: the node equipment of any first user of the blockchain system sends any competitive payment information of the target object to the management node equipment in the blockchain system, and the management node equipment verifies the competitive payment information; after the verification is passed, the management node equipment inquires a competitive block chain for storing data related to the competitive payment service in the block chain system; the management node equipment sends any competitive payment information to second node equipment configured with the competitive block chain; the second node device receives the any competitive payment information. In this embodiment of the present application, a node device that receives competitive payment information of a target object sent by a management node device is used as a second node device, and the second node device may be the same as or different from the first node device.
In one possible implementation, referring to fig. 5, the process of verifying any competitive payment information of the target object by the management node device may be divided into the following steps:
Step 1: the node equipment of any first user encrypts any competitive payment information according to the private key of the node equipment of the first user, the encrypted competitive payment information is sent to the management node equipment, and the management node equipment receives the encrypted competitive payment information.
Step 2: and after receiving any encrypted competitive payment information, the management node decrypts the encrypted competitive payment information by using the public key of the node equipment of the first user, and if the decryption is unsuccessful, the management node indicates that any competitive payment information is invalid and the verification fails. If the decryption is successful, the decrypted competitive payment information is obtained, and then step 3 is executed.
And step 3: the management node equipment further verifies whether the amount of competition in any competitive payment information is not lower than the lowest amount of competition in the basic information of the target object, and if the amount of competition is lower than the lowest amount of competition in the basic information of the target object, the verification is not passed; and if the competition amount is not lower than the lowest competition amount in the basic information of the target object, the management node equipment executes the step 4.
And 4, step 4: the management node device further verifies whether the amount of funds in the fund account of the first user corresponding to any competitive payment information is not less than a second reference amount, and if the amount of funds in the fund account of the first user is not less than the second reference amount, the competitive payment information is verified to be passed; if the amount of funds in the first user's funds account is less than the second reference amount, then the any competitive payment information verification fails.
In one possible implementation, after receiving any competitive payment information, the second node device determines whether a second reference amount of funds has been transferred from the funding account of the first user that initiated the competitive payment information to the funding account of the blockchain system. If so, continuing to execute the step of storing the competitive payment information in the blockchain system; if not, transferring a second reference amount of funds from the first user's funds account to the funds account of the blockchain system, and then performing the step of storing competitive payment information in the blockchain system. It should be noted that, for each first user participating in the competitive payment process of the target object, the second node device transfers the funds of the second reference amount from the fund account of each first user to the fund account of the blockchain system, and the fund account of each first user only needs to be transferred once. The second reference amount of funds is used to restrict malicious competitive payment behavior of the first user, reducing the likelihood that the first user will compete at will to cause the target object to compete unsuccessfully.
Next, the second node device may store the received at least one competitive payment information in the blockchain system, that is, store the at least one competitive payment information of the target object on the competitive blockchain in the blockchain system. It should be noted that, according to the limitation of the packing condition of the block chain, the second node device may pack the received at least one piece of competitive payment information according to the received time sequence to generate a plurality of target blocks, and add each target block to the competitive block chain according to the time sequence. The process of the second node device generating any target block based on the competitive payment information and adding the target block to the competitive blockchain may refer to the process of the first node device storing the basic information of the target object and the competitive payment contract in the blockchain system in step 301, which is not described herein again.
it should be noted that the second node device may store the updated competitive payment information in the competitive blockchain in real time, and synchronize the competitive payment information with other node devices configured with the competitive blockchain, so that any node device may execute the subsequent competitive payment service processing procedure according to the competitive payment information already stored in the blockchain.
303. the third node device obtains at least one competitive payment information for the target object from the blockchain system.
After the second node device stores the at least one piece of competitive payment information of the target object in the blockchain system, the third node device can acquire the at least one piece of competitive payment information of the target object from the blockchain system. The competitive payment information comprises competitive amount information and competitive time stamp information of the first user in the competitive payment process for the target object. That is, according to each target competitive payment information, the identification information of the first user who initiated the target competitive payment information, the identification information of the target object, the competitive amount of the first user to the target object, and the timestamp of the first user initiating the target competitive payment information can be known.
It should be noted that the competitive payment process for the target object includes at least one competitive payment sub-process, and each competitive payment sub-process corresponds to one competitive round number. The number of competition rounds refers to the number of rounds performed from the beginning of the competitive payment process, and the number of competition rounds increases as the competition time increases. Each competitive round number corresponds to a competitive payment subprocess, and at least one piece of competitive payment information in the same competitive payment subprocess comprises the same competitive round number. In this embodiment of the present application, the third node device refers to any node device on the contention block chain, and the third node device may be the same as the first node device and/or the second node device, or may be different from both the first node device and the second node device, which is not limited in this embodiment of the present application.
In step 303, the third node device may obtain at least one competitive payment information for the target that has been stored on the blockchain system. The acquisition process may be: the third node equipment determines a competitive block chain in the configured plurality of block chains; determining all blocks corresponding to the identification information of the target object in the competition block chain; all competitive payment information for the target object corresponding to the identification information of the target is acquired in all the blocks. After the third node device acquires the competitive payment information for the target object, which is already stored in the blockchain system, it may determine whether any competitive payment sub-process for the target object is finished according to the acquired at least one competitive payment information, and if it is determined that any competitive payment sub-process for the target object is finished, execute step 304; if it is determined that any competitive payment sub-process for the target object is not finished, the steps 302 and 303 may be executed in a loop until any competitive payment sub-process for the target object can be determined to be finished according to the acquired at least one competitive payment information, and then the step 304 is executed.
304. When the third node device determines that any competitive payment subprocess aiming at the target object is finished, determining an intermediate competition result of the target object corresponding to any competitive payment subprocess based on the competition amount information and the competition timestamp information in any competitive payment subprocess, and storing the intermediate competition result in the block chain system.
The ending of any competitive payment sub-process for the target object means that competitive payment information in the competitive payment sub-process is already stored in the competitive block chain, and when the third node device determines that competitive payment information in any competitive payment sub-process with the target object is already stored in the competitive block chain, an intermediate competitive result of the target object corresponding to any competitive payment sub-process can be determined based on the competitive payment information in any competitive payment sub-process. It should be noted that each competitive payment sub-process uniquely corresponds to one competitive round number.
In one possible implementation, the case where the third node device determines that any competitive payment sub-process for the target object is finished, i.e. determines that competitive payment information in the competitive payment sub-process is already stored on the competitive blockchain includes, but is not limited to, the following two cases:
The first condition is as follows: and if the difference value between the current time stamp and the termination time stamp of any competitive payment subprocess is not less than the reference time threshold, determining that any competitive payment subprocess aiming at the target object is ended.
The termination timestamp of any competitive payment subprocess refers to a timestamp that the first user has sent the competitive payment information in the competitive payment subprocess to the node device in the blockchain system. The reference time threshold may be determined according to an average duration of generation of a new block on the contention block chain. For example, assuming that the average time duration for generating a new block on the competing block chain is 10 minutes, the reference time threshold may be set to 10 minutes. If the difference between the current timestamp and the termination timestamp of any competitive payment sub-process of the target object is not less than the reference time threshold, it may be considered that, under the current timestamp, the competitive payment information in any competitive payment sub-process is already stored on the competitive blockchain by the node device in the blockchain system, and at this time, the third node device may determine that any competitive payment sub-process for the target object is ended.
Case two: and if the competitive time stamp in any competitive payment information is not less than the termination time stamp of any competitive payment subprocess, determining that any competitive payment subprocess aiming at the target object is ended.
since the competitive payment information on the competitive block chain is stored according to the time sequence, when the competitive time stamp in any competitive payment information is not less than the termination time stamp of any competitive payment subprocess, it indicates that the competitive payment information in any competitive payment subprocess is stored on the competitive block chain, and at this time, the third node device may determine that any competitive payment subprocess for the target object is terminated.
It should be noted that before the above two situations occur, the termination timestamp of any competitive payment sub-process needs to be acquired. In one possible implementation, the manner in which the third node device obtains the expiration timestamp of any competitive payment sub-process includes, but is not limited to, the following two:
Mode 1: and the third node equipment determines a termination time stamp corresponding to any competition round number of the target object based on the competition starting time stamp of the target object and the duration of each round of competition, and takes the termination time stamp corresponding to any competition round number of the target object as the termination time stamp of the competitive payment subprocess corresponding to any competition round number of the target object.
Wherein the competition start time stamp of the target object and the duration of each round of competition may be stored in a competitive payment contract for the target object. The competition time of each round may be the same or different, and this is not limited in the embodiments of the present application. For example, assuming that the competition start timestamp is 10:00:00 in 1/2019 and the competition duration of each round is 2 hours, it may be determined that the end timestamp corresponding to the number of competition rounds 3 of the target object is 16:00:00 in 1/2019, that is, the end timestamp of the competitive payment sub-process corresponding to the number of competition rounds 3 of the target object is 16:00:00 in 1/2019.
Mode 2: and the third node equipment directly acquires the termination time stamp corresponding to any competition wheel number from the competition block chain, and takes the termination time stamp corresponding to any competition wheel number of the target object as the termination time stamp of the competitive payment sub-process corresponding to any competition wheel number of the target object. .
This occurs on the premise that each of the termination time stamps corresponding to each of the number of competition rounds of the target object is stored in the competition block chain. The storage form may be a form of a corresponding relationship table of the number of competition rounds and the termination time stamp. The third node device may query a correspondence table between the number of competition rounds of the target object and the termination time stamp on the competition block chain based on the identification information of the target object, and then directly acquire the termination time stamp corresponding to any number of competition rounds in the correspondence table.
In either case, the third node device may determine that any competitive payment sub-process for the target object is complete. At this time, the third node device may acquire at least one piece of competitive payment information in any one of the competitive payment subprocesses from all the acquired competitive payment information.
assuming that any one of the competitive turns is N (N is an integer not less than 1), the manner in which the third node device obtains at least one piece of competitive payment information in the competitive payment sub-process corresponding to the competitive turn number N from all obtained competitive payment information includes, but is not limited to, the following two manners:
The first method is as follows: the competitive payment information comprises competitive turns, and in all the obtained competitive payment information, the competitive payment information with the competitive turns number of N is used as the competitive payment information in the competitive payment sub-process.
The second method comprises the following steps: the competitive payment information includes a time stamp, and a time range formed by the termination time stamp corresponding to the competitive turn number (N-1) and the termination time stamp corresponding to the competitive turn number N is used as a target time stamp range. And in all the competitive payment information, the competitive payment information with the time stamp within the target time stamp range is used as the competitive payment information in the competitive payment sub-process.
After obtaining the competitive payment information in any competitive payment sub-process, the third node device may determine an intermediate competitive result of the target object corresponding to any competitive payment sub-process based on the competitive amount information and the competitive timestamp information in the competitive payment information in any competitive payment sub-process.
the intermediate competition result of the target object corresponding to any competitive payment subprocess refers to the competition result generated in the competitive payment subprocess. Specifically, the process in which the third node device determines the intermediate competition result for the target object corresponding to any one of the competitive payment sub-processes includes the following three steps:
Step one, determining the highest competitive amount of the competitive payment subprocess based on the competitive amount information and the competitive time stamp information in the competitive payment subprocess.
Each competitive payment information comprises competitive amount information used for representing the competitive amount, and the highest competitive amount of the competitive payment subprocess can be determined according to each competitive amount in each competitive payment information.
And secondly, determining the identification information of the first user in the competitive payment information corresponding to the highest competitive amount based on the highest competitive amount of the competitive payment subprocess.
After determining the highest competitive amount of the competitive payment subprocess, the competitive payment information corresponding to the highest competitive amount can be determined, and then the identification information of the first user in the competitive payment information is determined.
and when the number of the competitive payment information corresponding to the highest competitive amount is at least two, judging the absolute value of the difference value between the competitive timestamp and the current timestamp in each piece of competitive payment information corresponding to the highest competitive amount, and taking the identification information of the first user in the competitive payment information with the maximum absolute value of the difference value with the current timestamp as the identification information of the first user in the intermediate competitive result corresponding to the competitive payment sub-process. For example, fig. 6 is a schematic process diagram of determining an intermediate competition result of a target object corresponding to any one of the competitive payment sub-processes provided in the embodiment of the present application, and as shown in fig. 6, it is assumed that there are 3 pieces of target competitive payment information in any one of the competitive payment sub-processes, and each piece of competitive payment information includes a competition amount, a competition timestamp, and identification information of a first user. The highest competitive amount in the competitive payment sub-process is 85 ten thousand according to the 3 competitive amounts. There are two competitive payment information corresponding to 85 ten thousand, namely competitive payment information 2 and competitive payment information 3. Here, the competitive time stamp in the competitive payment information 2 is farther from the current time stamp, so the user ID2 is taken as the identification information of the first user in the intermediate competitive result corresponding to the competitive payment subprocess.
And step three, taking the number of competition rounds corresponding to the competitive payment subprocess, the highest competition amount of the competitive payment subprocess, the identification information of the first user and the identification information of the target object as an intermediate competition result of the target object.
it should be noted that, after determining the intermediate competition result, the third node device may send the intermediate competition result to the node device of the first user in the intermediate competition result, so as to inform that the first user may continue to use the highest competition amount in the intermediate competition result as the competition amount information participating in the next round of competitive payment subprocess to initiate the competitive payment information. Each competitive payment subprocess corresponds to an intermediate competitive result, and the highest competitive amount in the intermediate competitive results is increased or kept unchanged along with the increase of the number of competitive rounds.
After determining the intermediate competition result corresponding to the competitive payment subprocess, the third node device may store the intermediate competition result in a competition blockchain in the blockchain system. The process of the third node device storing the intermediate competition result in the blockchain system may refer to the process of the first node device storing the basic information of the target object and the competitive payment contract in the blockchain system in step 301, and details are not described here again. After the third node device stores the intermediate competition result in the competition block chain, the first user may check the intermediate competition result of the currently finished competitive payment sub-process through the node device of the first user before participating in the next round of competitive payment sub-process, and then decide whether to continue participating in the next round of competitive payment sub-process of the target object according to the highest competition amount in the intermediate competition result. For example, assuming that the intermediate competition result of the competitive payment sub-process with the number of competition rounds of 3 indicates that the highest competition amount is 100 ten thousand and the budget fund of a certain first user is 90 ten thousand, the first user may decide not to participate in the competitive payment sub-process with the number of competitive payment rounds of 4 according to the intermediate competition result, thereby saving time and labor.
It should be noted that, after storing one intermediate competition result on the blockchain each time, the third node device may determine whether the competitive payment process for the target object satisfies the competition termination condition. If the competitive payment process for the target object does not meet the competitive termination condition, repeating the steps 302 to 304 with the change of the current timestamp, that is, continuously determining a new intermediate competitive result according to new competitive payment information, and storing the new intermediate competitive result in the block chain system; if the competitive payment process for the target object meets the competitive termination condition, step 305 is performed.
305. When the competitive payment process for the target object meets the competition termination condition, the third node device determines a target competition result of the target object based on the competition amount information and the competition timestamp information, and stores the target competition result in the blockchain system.
The competitive termination condition refers to a condition in which the whole competitive payment process of the target object is terminated, and the competitive termination condition may be stored in the competitive payment contract. When the competitive payment process meets the competitive termination condition of the target object, it indicates that the whole competitive payment process is finished, and at this time, a target competitive result for indicating the termination of the competition may be determined according to the competitive amount information and the competitive timestamp information in the competitive payment information stored in the blockchain system, and the target competitive result may be stored in the blockchain system to notify the node device configured with the competitive blockchain that the competitive payment information of the target object is no longer received.
In one possible implementation, the competitive payment process for the target object satisfies the competitive termination condition including, but not limited to, the following two cases:
The first condition is as follows: the number of competing rounds corresponding to any competitive payout subprocess reaches the round number threshold.
the round number threshold refers to the maximum number of competitive rounds of the target object, and the round number threshold may be stored in the competitive payment contract of the target object or in the basic information of the target object, which is not limited in the embodiment of the present application. When the number of competitive rounds corresponding to any competitive payment subprocess reaches the round number threshold, the fact that the whole competitive payment process containing the competitive payment subprocess meets the competitive termination condition is shown.
Case two: among a plurality of intermediate competition results corresponding to the plurality of competitive payment subprocesses, the highest competition amount among the first reference number of intermediate competition results is the same.
The number of competition rounds is increased with the increase of time, and the highest competition amount in the intermediate competition results can only be increased or kept unchanged as the number of competition rounds is increased. Therefore, when the highest competition amount in the intermediate competition results of the first reference number is the same, it indicates that no higher competition amount occurs in the competitive payment sub-process of the existing first reference number, and at this time, it indicates that the whole competitive payment process for the target object satisfies the competition termination condition.
the first reference amount may be stored in the competitive payment contract or in the basic information of the target object, which is not limited in the embodiment of the present application. The first reference number may be freely set by the second user, for example, the first reference number may be set to 3.
When the competitive payment process meets the competition termination condition, the third node device can determine the target competition result of the target object. In one possible implementation, the manner in which the third node device determines the target competition result of the target object includes, but is not limited to, the following two:
The first method is as follows: determining the highest competitive amount aiming at the target object based on competitive amount information and competitive timestamp information in all competitive payment information aiming at the target object, which is acquired from the block chain system; determining identification information of the first user in competitive payment information corresponding to the highest competitive amount based on the highest competitive amount; and taking the highest competition amount, the identification information of the first user and the identification information of the target object as a target competition result of the target object.
The second method comprises the following steps: and acquiring all intermediate competition results of the target object from the block chain system, and taking the nearest intermediate competition result of the time stamp and the current time stamp as the target competition result of the target object.
After the target competition result of the target object is determined, a termination mark can be further added to the target competition result, so that the node device configured with the competition blockchain can know that the competitive payment process of the target object is terminated, and therefore new competitive payment information is not received any more.
And after determining the target competition result of the target object, the third node equipment stores the target competition result in the block chain system. The storage process may refer to a process in which the first node device stores the basic information of the target object and the competitive payment contract in the blockchain system in step 301, and details are not described here.
In one possible implementation, the third node device processes the funds in the funds account of the blockchain system after storing the target competition result in the blockchain system. The specific treatment process comprises the following two steps:
Step one, transferring the funds of the second reference amount from the fund accounts of the blockchain system to fund accounts of other first users except the first user corresponding to the target competition result.
That is, the funds of the first users who did not compete successfully are returned to ensure the rights and interests of the first users who did not compete successfully. At this point, a third reference amount of funds from the second user's funding account and a second reference amount of funds from the first user's funding account that competed successfully remain in the funding accounts of the blockchain system.
And step two, the third node equipment acquires the transaction result of the target object from the blockchain system and processes the residual funds in the fund account of the blockchain system according to the transaction result.
The transaction result of the target object refers to the comprehensive result of the transfer result of the competitive fund of the target object and the transfer result of the target object. The transaction results of the target object obtained by the third node device from the blockchain may be stored by the fourth node device in the blockchain system.
The process of the fourth node device storing the transaction result of the target object in the blockchain system may be: the second user broadcasts the competitive fund transfer result of the target object through the node equipment of the second user; the first user successfully competes broadcasts the transfer result of the target object through the node equipment of the first user; the fourth node equipment receives the transfer result of the competitive fund of the target object and the transfer result of the target object; and the fourth node equipment obtains a transaction result of the target object based on the transfer result of the competitive fund of the target object and the transfer result of the target object, and stores the transaction result of the target object in the blockchain system.
in general, the transfer order of the competitive funds and the target object specified by the transaction rules in the competitive payment contract for the target object is: transferring competitive funds and then transferring the target. That is, the second user transfers the target object to the first user who successfully competes after receiving the competitive fund. Under the transfer sequence, the situation that the fourth node device obtains the transaction result of the target object based on the transfer result of the competitive fund of the target object and the transfer result of the target object comprises the following three conditions:
The first condition is as follows: and when the competitive fund transfer result indicates that the competitive fund transfer fails, the transaction result of the target object obtained by the fourth node equipment is transaction failure.
In this case, the transaction result indicates a failure of the competitive funds transfer.
It should be noted that, when the transfer result of the competitive fund indicates that the competitive fund transfer fails, it indicates that the second user does not receive the competitive fund, and at this time, the second user must not transfer the target to the first user who has succeeded in the competition, that is, the transfer result of the target must indicate that the target transfer fails.
Case two: and when the transfer result of the competitive fund indicates that the competitive fund transfer is successful and the transfer result of the target object indicates that the target object transfer is failed, the transaction result of the target object obtained by the fourth node equipment is transaction failure.
In this case, the outcome of the transaction indicates that the competitive funds transfer was successful but the target transfer failed.
case three: and when the transfer result of the competitive fund indicates that the competitive fund transfer is successful and the transfer result of the target object indicates that the target object transfer is successful, the transaction result of the target object obtained by the fourth node equipment is the transaction success.
Based on the obtained transaction results of the three situations, the third node device processes the funds left in the fund account of the blockchain system according to the transaction results and is divided into the following three modes:
The first method is as follows: transferring a second reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competition result when the transaction result of the target object indicates that the transaction is successful; transferring a third reference amount of funds from the funds accounts of the blockchain system to the funds account of the second user.
When the transaction is successful, the first user and the first user who successfully competes are both allowed to perform a normal transaction process, and at this time, the funds of the second user are returned to the fund account of the second user, and the funds of the first user who successfully competes are returned to the fund account of the first user.
The second method comprises the following steps: and when the transaction result of the target object indicates that the competitive fund transfer of the target object fails, transferring a fourth reference amount of fund from the fund account of the blockchain system to the fund account of the second user, wherein the fourth reference amount is the sum of the second reference amount and the third reference amount.
When the transaction result of the target object indicates that the competitive fund transfer of the target object fails, the first user who competes successfully fails to transfer the competitive fund to the second user in time, that is, the first user who competes successfully performs an abnormal transaction process. At this time, the fund of the second user remaining in the blockchain system and the fund of the first user successfully competing are transferred to the fund account of the second user, so that the functions of punishing the first user successfully competing and compensating the second user are achieved. The method can forcibly limit the first user participating in the competitive payment process, and avoids the interference of the competitive payment information initiated by the first user on the normal transaction process.
The third method comprises the following steps: and when the transaction result of the target object indicates that the competitive fund transfer of the target object is successful and the target object transfer is failed, transferring a fourth reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competitive payment result, wherein the fourth reference amount is the sum of the second reference amount and the third reference amount.
When the transaction result of the target object indicates that the competitive fund transfer of the target object is successful and the target object transfer fails, it indicates that the second user fails to transfer the target object to the first user who competes successfully in time after receiving the competitive fund, that is, the second user performs an abnormal transaction process. At this time, the fund of the second user remaining in the blockchain system and the fund of the first user who successfully competes are transferred to the fund account of the first user who successfully competes, so as to play the roles of punishing the second user and compensating the first user who successfully competes. The method can forcibly limit the second user, and avoids the interference of the second user initiating a competitive payment process randomly with the normal transaction process.
The transfer mode of the target may be different depending on the form of the target. When the target object is a physical object, the second user can directly transfer the target object to the first user who successfully competes by mailing or face-to-face handover when receiving the competitive fund; the second user may also transfer the target object to a third-party custody institution for custody, and then, upon receiving the competitive fund, the second user instructs the third-party custody institution to transfer the target object to the first user who has succeeded in the competition. When the target object is a virtual article, the second user can transfer the target object to the first user who successfully competes in an online transfer mode.
in the embodiment of the application, a target competition result of a target object is determined based on competitive payment information stored in the blockchain system, and the target competition result is stored in the blockchain system. In the processing process of the competitive payment service, information related to the competitive payment service, such as competitive payment information, a target competition result and the like, is stored in the blockchain system, and the information in the blockchain system is public and transparent, so that the phenomenon of competitive payment cheating can be avoided. In addition, the information in the blockchain system is not allowed to be tampered, and the safety and the reliability of the information related to the competitive payment service are high, so that the reliability of the processing process of the competitive payment service is high.
based on the same technical concept, referring to fig. 7, an embodiment of the present application provides a service processing apparatus based on a block chain, where the apparatus includes:
an obtaining module 701, configured to obtain at least one piece of competitive payment information for a target object from a blockchain system, where the competitive payment information includes competitive amount information and competitive timestamp information of a first user in a competitive payment process for the target object;
a determining module 702, configured to determine a target competition result of the target object based on the competition amount information and the competition timestamp information when the competitive payment process for the target object satisfies the competition termination condition;
The storage module 703 is configured to store the target competition result in the blockchain system.
in one possible implementation, the competitive payment process for the target object includes at least one competitive payment sub-process, each competitive payment sub-process corresponding to one competitive round number;
A determining module 702, configured to determine, when it is determined that any competitive payment sub-process for the target object ends, an intermediate competition result of the target object corresponding to any competitive payment sub-process based on the competition amount information and the competition timestamp information in any competitive payment sub-process;
The storage module 703 is further configured to store the intermediate contention result in the blockchain system.
In one possible implementation, the determining module 702 is further configured to determine that any competitive payment sub-process for the target object is ended if a difference between the current timestamp and a termination timestamp of any competitive payment sub-process is not less than a reference time threshold; or if the competitive time stamp in any competitive payment information is not less than the termination time stamp of any competitive payment subprocess, determining that any competitive payment subprocess aiming at the target object is ended.
In one possible implementation, the determining module 702 is further configured to determine a highest competition amount for the target object based on the competition amount information and the competition timestamp information; determining identification information of the first user in competitive payment information corresponding to the highest competitive amount based on the highest competitive amount; and taking the highest competition amount, the identification information of the first user and the identification information of the target object as a target competition result of the target object.
In one possible implementation, the competitive payment process for the target object satisfies a competitive termination condition, including:
The number of competitive rounds corresponding to any competitive payment subprocess reaches a round number threshold; or,
Among a plurality of intermediate competition results corresponding to the plurality of competitive payment subprocesses, the highest competition amount among the first reference number of intermediate competition results is the same.
in a possible implementation manner, fig. 8 is a schematic diagram of a service processing apparatus based on a block chain according to an embodiment of the present application, and referring to fig. 8, the apparatus further includes:
A receiving module 704, configured to receive basic information of a target object and a competitive payment contract of the target object, where the basic information of the target object includes identification information of the target object and description information of the target object; the competitive payment contract for the target object includes a competitive termination condition for the target object;
The storage module 702 is further configured to store the basic information of the target object and the competitive payment contract of the target object in the blockchain system.
in a possible implementation manner, the receiving module 704 is further configured to receive at least one piece of competitive payment information of the target object, where the competitive payment information includes a number of competitive rounds, competitive amount information, competitive timestamp information, identification information of the target object, and identification information of the first user;
The storage module 703 is further configured to store at least one competitive payment information in the blockchain system.
In one possible implementation, referring to fig. 8, the apparatus further includes:
A transferring module 705 for transferring the second reference amount of funds from the respective first user's funds accounts to the funds accounts of the blockchain system; transferring a third reference amount of funds from the second user's funds account into the funds account of the blockchain system, the second user for initiating a competitive payout process for the target.
in one possible implementation, the transferring module 705 is further configured to transfer the second reference amount of funds from the fund accounts of the blockchain system to fund accounts of the first users except the first user corresponding to the target competition result.
In one possible implementation, the transferring module 705 is further configured to transfer a second reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competition result when the transaction result of the target object indicates that the transaction is successful; transferring a third reference amount of funds from the funds accounts of the blockchain system to the funds account of the second user.
In one possible implementation, the transfer module 705 is further configured to transfer a fourth reference amount of funds from the funds account of the blockchain system to the funds account of the second user when the transaction result of the target indicates that the competitive funds transfer of the target fails, where the fourth reference amount is a sum of the second reference amount and the third reference amount.
In one possible implementation, the transfer module 705 is further configured to transfer a fourth reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competition result when the transaction result of the target indicates that the competitive fund transfer of the target is successful and the target transfer fails, where the fourth reference amount is a sum of the second reference amount and the third reference amount.
In the embodiment of the application, a target competition result of a target object is determined based on competitive payment information stored in the blockchain system, and the target competition result is stored in the blockchain system. In the processing process of the competitive payment service, information related to the competitive payment service, such as competitive payment information, a target competition result and the like, is stored in the blockchain system, and the information in the blockchain system is public and transparent, so that the phenomenon of competitive payment cheating can be avoided. In addition, the information in the blockchain system is not allowed to be tampered, and the safety and the reliability of the information related to the competitive payment service are high, so that the reliability of the processing process of the competitive payment service is high.
it should be noted that, when the apparatus provided in the foregoing embodiment implements the functions thereof, only the division of the functional modules is illustrated, and in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure of the apparatus may be divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.
The node device provided in the foregoing technical solution may be implemented as a terminal or a server, for example, fig. 9 is a schematic structural diagram of a terminal provided in this embodiment of the present application. The terminal can be: a smart phone, a tablet computer, an MP3 player (Moving Picture Experts Group Audio Layer III, motion video Experts compression standard Audio Layer 3), an MP4 player (Moving Picture Experts Group Audio Layer IV, motion video Experts compression standard Audio Layer 4), a notebook computer, or a desktop computer. A terminal may also be referred to by other names such as user equipment, portable terminal, laptop terminal, desktop terminal, etc.
Generally, a terminal includes: a processor 901 and a memory 902.
processor 901 may include one or more processing cores, such as a 4-core processor, an 8-core processor, and so forth. The processor 901 may be implemented in at least one hardware form of a DSP (Digital Signal Processing), an FPGA (Field-Programmable Gate Array), and a PLA (Programmable Logic Array). The processor 901 may also include a main processor and a coprocessor, where the main processor is a processor for processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 901 may be integrated with a GPU (Graphics Processing Unit), which is responsible for rendering and drawing the content required to be displayed by the display screen. In some embodiments, the processor 901 may further include an AI (Artificial Intelligence) processor for processing computing operations related to machine learning.
Memory 902 may include one or more computer-readable storage media, which may be non-transitory. The memory 902 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in the memory 902 is used for storing at least one instruction for execution by the processor 901 to implement the blockchain based traffic processing method provided by the method embodiments in the present application.
In some embodiments, the terminal may further include: a peripheral interface 903 and at least one peripheral. The processor 901, memory 902, and peripheral interface 903 may be connected by buses or signal lines. Various peripheral devices may be connected to the peripheral interface 903 via a bus, signal line, or circuit board. Specifically, the peripheral device includes: at least one of a radio frequency circuit 904, a touch display screen 905, a camera assembly 906, an audio circuit 907, a positioning assembly 908, and a power supply 909.
The peripheral interface 903 may be used to connect at least one peripheral related to I/O (Input/Output) to the processor 901 and the memory 902. In some embodiments, the processor 901, memory 902, and peripheral interface 903 are integrated on the same chip or circuit board; in some other embodiments, any one or two of the processor 901, the memory 902 and the peripheral interface 903 may be implemented on a separate chip or circuit board, which is not limited by this embodiment.
the Radio Frequency circuit 904 is used for receiving and transmitting RF (Radio Frequency) signals, also called electromagnetic signals. The radio frequency circuitry 904 communicates with communication networks and other communication devices via electromagnetic signals. The radio frequency circuit 904 converts an electrical signal into an electromagnetic signal to transmit, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 904 comprises: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and so forth. The radio frequency circuit 904 may communicate with other terminals via at least one wireless communication protocol. The wireless communication protocols include, but are not limited to: metropolitan area networks, various generation mobile communication networks (2G, 3G, 4G, and 5G), Wireless local area networks, and/or WiFi (Wireless Fidelity) networks. In some embodiments, the radio frequency circuit 904 may also include NFC (Near Field Communication) related circuits, which are not limited in this application.
The display screen 905 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display screen 905 is a touch display screen, the display screen 905 also has the ability to capture touch signals on or over the surface of the display screen 905. The touch signal may be input to the processor 901 as a control signal for processing. At this point, the display 905 may also be used to provide virtual buttons and/or a virtual keyboard, also referred to as soft buttons and/or a soft keyboard. In some embodiments, the display 905 may be one, disposed on the front panel of the terminal; in other embodiments, the number of the display panels 905 may be at least two, and the two display panels are respectively disposed on different surfaces of the terminal or are in a folding design; in still other embodiments, the display 905 may be a flexible display, disposed on a curved surface or on a folded surface of the terminal. Even more, the display screen 905 may be arranged in a non-rectangular irregular figure, i.e. a shaped screen. The Display panel 905 can be made of LCD (liquid crystal Display), OLED (Organic Light-Emitting Diode), and the like.
The camera assembly 906 is used to capture images or video. Optionally, camera assembly 906 includes a front camera and a rear camera. Generally, a front camera is disposed at a front panel of the terminal, and a rear camera is disposed at a rear surface of the terminal. In some embodiments, the number of the rear cameras is at least two, and each rear camera is any one of a main camera, a depth-of-field camera, a wide-angle camera and a telephoto camera, so that the main camera and the depth-of-field camera are fused to realize a background blurring function, and the main camera and the wide-angle camera are fused to realize panoramic shooting and VR (Virtual Reality) shooting functions or other fusion shooting functions. In some embodiments, camera assembly 906 may also include a flash. The flash lamp can be a monochrome temperature flash lamp or a bicolor temperature flash lamp. The double-color-temperature flash lamp is a combination of a warm-light flash lamp and a cold-light flash lamp, and can be used for light compensation at different color temperatures.
Audio circuit 907 may include a microphone and a speaker. The microphone is used for collecting sound waves of a user and the environment, converting the sound waves into electric signals, and inputting the electric signals to the processor 901 for processing, or inputting the electric signals to the radio frequency circuit 904 for realizing voice communication. For the purpose of stereo sound collection or noise reduction, a plurality of microphones can be arranged at different parts of the terminal respectively. The microphone may also be an array microphone or an omni-directional pick-up microphone. The speaker is used to convert electrical signals from the processor 901 or the radio frequency circuit 904 into sound waves. The loudspeaker can be a traditional film loudspeaker or a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, the speaker can be used for purposes such as converting an electric signal into a sound wave audible to a human being, or converting an electric signal into a sound wave inaudible to a human being to measure a distance. In some embodiments, audio circuit 907 may also include a headphone jack.
the positioning component 908 is used to locate the current geographic Location of the terminal to implement navigation or LBS (Location Based Service). The positioning component 908 may be a positioning component based on the GPS (Global positioning system) of the united states, the beidou system of china, the graves system of russia, or the galileo system of the european union.
the power supply 909 is used to supply power to each component in the terminal. The power source 909 may be alternating current, direct current, disposable or rechargeable. When power source 909 comprises a rechargeable battery, the rechargeable battery may support wired or wireless charging. The rechargeable battery may also be used to support fast charge technology.
In some embodiments, the terminal also includes one or more sensors 910. The one or more sensors 910 include, but are not limited to: acceleration sensor 911, gyro sensor 912, pressure sensor 913, fingerprint sensor 914, optical sensor 915, and proximity sensor 916.
The acceleration sensor 911 may detect the magnitude of acceleration on three coordinate axes of a coordinate system established with the terminal. For example, the acceleration sensor 911 may be used to detect the components of the gravitational acceleration in three coordinate axes. The processor 901 can control the touch display 905 to display the user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 911. The acceleration sensor 911 may also be used for acquisition of motion data of a game or a user.
The gyroscope sensor 912 can detect the body direction and the rotation angle of the terminal, and the gyroscope sensor 912 and the acceleration sensor 911 cooperate to acquire the 3D motion of the user on the terminal. The processor 901 can implement the following functions according to the data collected by the gyro sensor 912: motion sensing (such as changing the UI according to a user's tilting operation), image stabilization at the time of photographing, game control, and inertial navigation.
The pressure sensor 913 may be disposed at a side frame of the terminal and/or at a lower layer of the touch display 905. When the pressure sensor 913 is disposed on the side frame of the terminal, the user's holding signal to the terminal may be detected, and the processor 901 performs left-right hand recognition or shortcut operation according to the holding signal collected by the pressure sensor 913. When the pressure sensor 913 is disposed at a lower layer of the touch display 905, the processor 901 controls the operability control on the UI interface according to the pressure operation of the user on the touch display 905. The operability control comprises at least one of a button control, a scroll bar control, an icon control and a menu control.
The fingerprint sensor 914 is used for collecting a fingerprint of the user, and the processor 901 identifies the user according to the fingerprint collected by the fingerprint sensor 914, or the fingerprint sensor 914 identifies the user according to the collected fingerprint. Upon recognizing that the user's identity is a trusted identity, processor 901 authorizes the user to perform relevant sensitive operations including unlocking the screen, viewing encrypted information, downloading software, paying, and changing settings, etc. The fingerprint sensor 914 may be disposed on the front, back, or side of the terminal. When a physical key or vendor Logo is provided on the terminal, the fingerprint sensor 914 may be integrated with the physical key or vendor Logo.
the optical sensor 915 is used to collect ambient light intensity. In one embodiment, the processor 901 may control the display brightness of the touch display 905 based on the ambient light intensity collected by the optical sensor 915. Specifically, when the ambient light intensity is high, the display brightness of the touch display screen 905 is increased; when the ambient light intensity is low, the display brightness of the touch display screen 905 is turned down. In another embodiment, the processor 901 can also dynamically adjust the shooting parameters of the camera assembly 906 according to the ambient light intensity collected by the optical sensor 915.
a proximity sensor 916, also known as a distance sensor, is typically provided on the front panel of the terminal. The proximity sensor 916 is used to collect the distance between the user and the front face of the terminal. In one embodiment, when the proximity sensor 916 detects that the distance between the user and the front face of the terminal gradually decreases, the processor 901 controls the touch display 905 to switch from the bright screen state to the dark screen state; when the proximity sensor 916 detects that the distance between the user and the front surface of the terminal gradually becomes larger, the processor 901 controls the touch display 905 to switch from the breath screen state to the bright screen state.
those skilled in the art will appreciate that the configuration shown in fig. 9 is not intended to be limiting and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components may be used.
Fig. 10 is a schematic structural diagram of a server according to an embodiment of the present invention, where the server may generate a relatively large difference due to different configurations or performances, and may include one or more processors (CPUs) 1001 and one or more memories 1002, where the one or more memories 1002 store at least one program code, and the at least one program code is loaded and executed by the one or more processors 1001 to implement the method for Processing a service based on a blockchain provided in the foregoing method embodiments. Of course, the server may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input/output, and the server may also include other components for implementing the functions of the device, which are not described herein again.
in an exemplary embodiment, a computer readable storage medium is further provided, in which at least one program code is stored, and the at least one program code is loaded and executed by a processor of a computer device to implement any of the above-mentioned service processing methods based on a blockchain.
Alternatively, the computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc Read-Only Memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.
It should be understood that reference to "a plurality" herein means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
The above description is only exemplary of the present application and should not be taken as limiting the present application, and any modifications, equivalents, improvements and the like that are made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims (15)

1. A service processing method based on block chain is applied to any node device in a block chain system, and the method comprises:
acquiring at least one piece of competitive payment information aiming at a target object from the blockchain system, wherein the competitive payment information comprises competitive amount information and competitive timestamp information of a first user in a competitive payment process aiming at the target object;
When the competitive payment process for the target object meets a competition termination condition, determining a target competition result of the target object based on the competition amount information and competition timestamp information, and storing the target competition result in the blockchain system.
2. The method of claim 1, wherein the competitive payment process for the target object includes at least one competitive payment subprocess, each competitive payment subprocess corresponding to one number of competitive rounds;
Before the determining the target competition result of the target object, the method further comprises:
when determining that any competitive payment subprocess aiming at the target object is ended, determining an intermediate competition result of the target object corresponding to any competitive payment subprocess based on the competition amount information and the competition timestamp information in any competitive payment subprocess, and storing the intermediate competition result in the blockchain system.
3. The method of claim 2, wherein determining that any competitive payment subprocess for the target object is complete comprises:
if the difference value between the current time stamp and the termination time stamp of any competitive payment subprocess is not less than the reference time threshold, determining that any competitive payment subprocess aiming at the target object is ended; or,
and if the competitive time stamp in any competitive payment information is not less than the termination time stamp of any competitive payment subprocess, determining that any competitive payment subprocess aiming at the target object is ended.
4. The method of claim 1, wherein determining the target competition result for the target object based on the competition amount information and competition timestamp information comprises:
Determining a highest competition amount for the target object based on the competition amount information and the competition timestamp information;
Determining identification information of a first user in competitive payment information corresponding to the highest competitive amount based on the highest competitive amount;
and taking the highest competition amount, the identification information of the first user and the identification information of the target object as a target competition result of the target object.
5. the method of claim 2, wherein the competitive payment process for the target object satisfies a competitive termination condition, comprising:
The number of competitive rounds corresponding to any competitive payment subprocess reaches a round number threshold; or,
Among a plurality of intermediate competition results corresponding to the plurality of competitive payment subprocesses, the highest competition amount among the first reference number of intermediate competition results is the same.
6. the method of claim 1, wherein prior to obtaining at least one competitive payment information for a target from the blockchain system, the method further comprises:
Receiving basic information of the target object and a competitive payment contract of the target object, wherein the basic information of the target object comprises identification information of the target object and description information of the target object; the competitive payment contract for the target object includes a competitive termination condition for the target object;
Storing basic information of the target object and a competitive payment contract for the target object in the blockchain system.
7. The method of claim 1, wherein prior to obtaining at least one competitive payment information for a target from the blockchain system, the method further comprises:
Receiving at least one competitive payment information of the target object, wherein the competitive payment information comprises competition rounds, competition amount information, competition timestamp information, identification information of the target object and identification information of a first user;
Storing the at least one competitive payment information in the blockchain system.
8. the method of claim 1, further comprising:
Transferring a second reference amount of funds from the respective first user's funds accounts to the funds accounts of the blockchain system;
Transferring a third reference amount of funds from a funds account of a second user to a funds account of the blockchain system, the second user for initiating a competitive payment process for the target.
9. The method of claim 8, wherein after storing the target contention result in the blockchain system, the method further comprises:
And respectively transferring a second reference amount of funds from the fund accounts of the blockchain system to fund accounts of other first users except the first user corresponding to the target competition result.
10. The method of claim 8, wherein after storing the target contention result in the blockchain system, the method further comprises:
when the transaction result of the target object indicates that the transaction is successful, transferring a second reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competition result; transferring a third reference amount of funds from the funds accounts of the blockchain system to the funds account of the second user.
11. The method of claim 8, wherein after storing the target contention result in the blockchain system, the method further comprises:
Transferring a fourth reference amount of funds from the funds accounts of the blockchain system to the funds account of the second user when the transaction result for the target indicates that the competitive funds transfer for the target failed, the fourth reference amount being the sum of the second reference amount and the third reference amount.
12. The method of claim 8, wherein after storing the target contention result in the blockchain system, the method further comprises:
And when the transaction result of the target object indicates that the competitive fund transfer of the target object is successful and the target object transfer is failed, transferring a fourth reference amount of funds from the fund account of the blockchain system to the fund account of the first user corresponding to the target competitive result, wherein the fourth reference amount is the sum of the second reference amount and the third reference amount.
13. an apparatus for processing block chain based services, the apparatus comprising:
The acquisition module is used for acquiring at least one piece of competitive payment information aiming at a target object from the blockchain system, wherein the competitive payment information comprises competitive amount information and competitive timestamp information of a first user in a competitive payment process aiming at the target object;
A determining module, configured to determine a target competition result of the target object based on the competition amount information and competition timestamp information when the competitive payment process for the target object meets a competition termination condition;
and the storage module is used for storing the target competition result in the block chain system.
14. A computer device, characterized in that the computer device comprises a processor and a memory, wherein at least one program code is stored in the memory, and the at least one program code is loaded and executed by the processor to implement the service processing method based on block chains according to any one of claims 1 to 12.
15. A computer-readable storage medium, having at least one program code stored therein, the at least one program code being loaded and executed by a processor to implement the method for blockchain based service processing according to any one of claims 1 to 12.
CN201910867618.0A 2019-09-13 2019-09-13 service processing method, device, equipment and storage medium based on block chain Pending CN110570289A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910867618.0A CN110570289A (en) 2019-09-13 2019-09-13 service processing method, device, equipment and storage medium based on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910867618.0A CN110570289A (en) 2019-09-13 2019-09-13 service processing method, device, equipment and storage medium based on block chain

Publications (1)

Publication Number Publication Date
CN110570289A true CN110570289A (en) 2019-12-13

Family

ID=68779878

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910867618.0A Pending CN110570289A (en) 2019-09-13 2019-09-13 service processing method, device, equipment and storage medium based on block chain

Country Status (1)

Country Link
CN (1) CN110570289A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111080443A (en) * 2019-12-27 2020-04-28 腾讯科技（深圳）有限公司 Service processing method, device, equipment and storage medium based on block chain
CN112379440A (en) * 2020-11-02 2021-02-19 中国石油天然气集团有限公司 Method and device for identifying solid filling characteristics of fracture and hole body

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180322561A1 (en) * 2017-05-04 2018-11-08 Mastercard International Incorporated Method and system for automated fulfillment via blockchain
CN109118343A (en) * 2018-07-26 2019-01-01 上海交通大学 The auction system and system and medium of fixed quantity subject matter based on block chain
CN109146652A (en) * 2018-09-06 2019-01-04 王李琰 A kind of online auction system and system based on block chain technology
CN110175842A (en) * 2019-03-27 2019-08-27 阿里巴巴集团控股有限公司 Transfer account method, system, calculating equipment and storage medium based on block chain

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180322561A1 (en) * 2017-05-04 2018-11-08 Mastercard International Incorporated Method and system for automated fulfillment via blockchain
CN109118343A (en) * 2018-07-26 2019-01-01 上海交通大学 The auction system and system and medium of fixed quantity subject matter based on block chain
CN109146652A (en) * 2018-09-06 2019-01-04 王李琰 A kind of online auction system and system based on block chain technology
CN110175842A (en) * 2019-03-27 2019-08-27 阿里巴巴集团控股有限公司 Transfer account method, system, calculating equipment and storage medium based on block chain

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
祁宁: "《网络采购的逆向组合拍卖模型与优化方法研究》", 31 March 2019, 沈阳：东北大学出版社 *
陈晓静: "《区块链 金融应用及风险监管》", 30 September 2018, 上海：上海财经大学出版社 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111080443A (en) * 2019-12-27 2020-04-28 腾讯科技（深圳）有限公司 Service processing method, device, equipment and storage medium based on block chain
CN112379440A (en) * 2020-11-02 2021-02-19 中国石油天然气集团有限公司 Method and device for identifying solid filling characteristics of fracture and hole body

Similar Documents

Publication Publication Date Title
CN110971414B (en) Method, device, terminal and server for generating signature
CN111245745B (en) Message sending method, device, node equipment and storage medium
CN111339086B (en) Block processing method, and data query method and device based on block chain
CN110689460B (en) Traffic accident data processing method, device, equipment and medium based on block chain
CN111080443B (en) Block chain-based service processing method, device, equipment and storage medium
CN110933113B (en) Block chain-based interactive behavior detection method, device, equipment and storage medium
CN111340482B (en) Conflict detection method, device, node equipment and storage medium
CN110597924B (en) Block chain-based user identification processing method, device, equipment and storage medium
CN110555780B (en) Insurance data processing method, device and equipment based on block chain and storage medium
CN111506884A (en) User invitation method, device, computer equipment and computer readable storage medium
CN110581891A (en) Game data processing method, device, equipment and storage medium based on block chain
CN111667371B (en) Resource aggregation method, system, device and storage medium based on block chain
CN110598386A (en) Data processing method, device and equipment based on block chain and storage medium
CN111212074B (en) Blockchain-based qualification identification method, device, equipment and storage medium
CN110599328B (en) Block chain based risk user determination method, device, equipment and storage medium
CN110290191B (en) Resource transfer result processing method, device, server, terminal and storage medium
CN110570289A (en) service processing method, device, equipment and storage medium based on block chain
CN110677262A (en) Block chain-based information notarization method, device and system
CN111062725A (en) Face payment method, device and system and computer readable storage medium
CN112036887A (en) Resource transfer method, device, equipment and storage medium
CN112991069B (en) Resource processing method, device, equipment and storage medium
CN111327427B (en) Method, device, node equipment, system and storage medium for submitting alternative blocks
CN108829464B (en) Service starting method and device, computer equipment and storage medium
CN110597840A (en) Partner relationship establishing method, device, equipment and storage medium based on block chain
CN110727894A (en) Target material setting method, device, equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40017410

Country of ref document: HK

SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination