WO2020019792A1 - Appareil et procédé de libération de blocs, et dispositif électronique - Google Patents

Appareil et procédé de libération de blocs, et dispositif électronique Download PDF

Info

Publication number
WO2020019792A1
WO2020019792A1 PCT/CN2019/084379 CN2019084379W WO2020019792A1 WO 2020019792 A1 WO2020019792 A1 WO 2020019792A1 CN 2019084379 W CN2019084379 W CN 2019084379W WO 2020019792 A1 WO2020019792 A1 WO 2020019792A1
Authority
WO
WIPO (PCT)
Prior art keywords
character sequence
blockchain
random
random character
blockchain node
Prior art date
Application number
PCT/CN2019/084379
Other languages
English (en)
Chinese (zh)
Inventor
陆旭明
Original Assignee
阿里巴巴集团控股有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 阿里巴巴集团控股有限公司 filed Critical 阿里巴巴集团控股有限公司
Publication of WO2020019792A1 publication Critical patent/WO2020019792A1/fr

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures

Definitions

  • One or more embodiments of the present specification relate to the field of blockchain technology, and in particular, to a method and device for issuing blocks, and electronic equipment.
  • the blockchain contains a large number of blockchain nodes.
  • the consensus mechanism is used to reach an agreement between these blockchain nodes to ensure that these blockchain nodes jointly maintain a blockchain ledger with unified content.
  • a PoW (Proof of Work, Proof of Work) algorithm is commonly used to reach consensus among these blockchain nodes; specifically, all blockchain nodes calculate the solution to the same mathematical problem, and the first A blockchain node that finds a qualified solution contends for bookkeeping rights, the blockchain node generates the latest block of the blockchain, and all blockchain nodes generate a block record of the blockchain node To the blockchain ledger.
  • one or more embodiments of the present specification provide a method and device for issuing a block, and an electronic device.
  • a block publishing method is proposed, which is applied to a blockchain node; the method includes:
  • the generated preliminary block is broadcasted on the entire network within the blockchain; wherein, when the random character sequence is verified to match the target character When the sequence and corresponding release time is the earliest in the entire network, the preliminary block is recorded as the latest block of the blockchain.
  • a block publishing device is proposed and applied to a block chain node; the device includes:
  • a calling unit for invoking a smart contract for generating a character sequence the smart contract being used to generate a random character sequence for a blockchain node;
  • a first publishing unit that publishes the random character sequence to the blockchain in association with the identity information of the blockchain node, wherein the publishing time of the random character sequence is earlier than the publishing time of the target character sequence;
  • the broadcasting unit when the random character sequence matches the target character sequence, broadcasts the generated preliminary block on the entire network within the blockchain; wherein, when the random character sequence is verified to match the target character sequence, When the target character sequence and the corresponding release time are the earliest on the entire network, the preliminary block is recorded as the latest block of the blockchain.
  • an electronic device including:
  • Memory for storing processor-executable instructions
  • the processor executes the executable instructions to implement the block publishing method according to any one of the foregoing embodiments.
  • FIG. 1 is a flowchart of a block publishing method according to an exemplary embodiment.
  • FIG. 2 is a schematic structural diagram of a blockchain network according to an exemplary embodiment.
  • FIG. 3 is a schematic flowchart of determining a billing right according to an exemplary embodiment.
  • FIG. 4 is a schematic structural diagram of a device according to an exemplary embodiment.
  • FIG. 5 is a block diagram of a block publishing apparatus according to an exemplary embodiment.
  • the steps of the corresponding method are not necessarily performed in the order shown and described in this specification.
  • the method may include more or fewer steps than described in this specification.
  • a single step described in this specification may be divided into multiple steps for description in other embodiments; and multiple steps described in this specification may be combined into a single step for other embodiments. description.
  • FIG. 1 is a flowchart of a block publishing method according to an exemplary embodiment. As shown in Figure 1, the method is applied to a blockchain node and can include the following steps:
  • step 102 a smart contract for generating a character sequence is invoked, and the smart contract is used to generate a random character sequence for a blockchain node.
  • processing logic for generating a random character sequence may be written in the smart contract in advance, so that after the smart contract is called, a random character sequence may be automatically generated for a blockchain node based on the processing logic described above. Because the processing logic on the smart contract is public content, and the entire processing process is automatically completed by the smart contract, there is no manual intervention, so that the randomness of the generated random character sequence can be ensured, and the black box operation or cheating behavior is avoided.
  • the random character sequence is not completely “random” and can still meet certain preset rules.
  • the preset rule may include the number of characters, the character type, and the value range of the characters. This specification does not address this. limit.
  • the preset rule can limit the random character sequence to 8 digits, and the random character sequence generated by the smart contract can be "45614381" instead of "ax0642f0"; for example, the preset rule can limit the random character sequence to 5 Digit + 3 letters, the random character sequence generated by the smart contract can be "ax0642f0", and the sequence "45614381" will not be generated.
  • the target character sequence described below when the random character sequence conforms to the preset rule described above, the target character sequence described below also conforms to the preset rule, so that the random character sequence and the target character sequence are consistent in structure and form, and the random character sequence and the target are ensured. Character sequences are comparable.
  • the random character sequences generated by the smart contract for different blockchain nodes should be different from each other to avoid random character sequences and target characters for more than one blockchain node.
  • the sequences match to ensure that only the preliminary blocks generated by one blockchain node are recorded as the latest block of the blockchain.
  • Step 104 Publish the random character sequence to the blockchain in association with the identity information of the blockchain node, wherein the publishing time of the random character sequence is earlier than the publishing time of the target character sequence.
  • the blockchain node may create a transaction on the blockchain client to publish the random character sequence and the identity information of the blockchain node to the block based on the transaction. On the chain, it becomes a piece of data in the distributed database of the blockchain.
  • a narrow transaction refers to a value transfer issued by a user to the blockchain; for example, in a traditional Bitcoin blockchain network, a transaction can be a transfer initiated by a user in the blockchain.
  • the generalized transaction refers to a piece of business data with business intent issued by the user to the blockchain; for example, the operator can build an alliance chain based on actual business needs, and rely on the alliance chain to deploy other types that are not related to value transfer.
  • Online business (such as event forecasting, renting business, vehicle dispatching business, insurance claims business, credit service, medical service, etc.), and in this type of alliance chain, the transaction can be a transaction issued by the user in the alliance chain.
  • Intent business message or business request Transactions in this description should be interpreted as transactions in a broad sense.
  • the random character sequences posted on the blockchain cannot be tampered with, so that the random character sequences corresponding to each blockchain node can be reliably recorded.
  • this specification enables a blockchain node to compete for the right to book the latest block of the blockchain, while the right to book other blocks on the blockchain has been determined, then these can have the right to book
  • the blockchain node is responsible for writing the above transactions containing random character sequences and the identity information of the blockchain nodes into the corresponding blocks and publishing them to the blockchain.
  • the above-mentioned blockchain node does not necessarily directly publish the random character sequence and its identity information to the blockchain in association. It may also be implemented by other blockchain nodes, depending on which zone Blockchain nodes have accounting rights for related blocks.
  • the random character sequence may be fed back to the blockchain node, and the blockchain node determines whether the random character sequence needs to be adopted. In one case, if it is determined that the random character sequence needs to be adopted, the blockchain node may publish the random character sequence to the blockchain in association with its own identity information. In another case, if the currently generated random character sequence is not recognized, the blockchain node can re-invoke the smart contract, and the smart contract regenerates a random character sequence to generate a random character corresponding to the blockchain node. The character sequence is updated; of course, if the blockchain still does not recognize it, the smart contract can continue to be called again until a satisfactory random character sequence is obtained.
  • the release time of the random character sequence should be earlier than the release time of the target character sequence, otherwise the randomness of the random character sequence will be questioned. For example, if the target character sequence is obtained, the same character sequence will be Disguised as a sequence of random characters and posted to the blockchain, it is not really generated by the smart contract described above.
  • step 106 if the random character sequence matches the target character sequence, the generated preliminary block is broadcasted on the entire network within the blockchain; wherein, when the random character sequence is verified to match the target character sequence, When the target character sequence and the corresponding release time are the earliest on the entire network, the preliminary block is recorded as the latest block of the blockchain.
  • the blockchain node A when the blockchain node A receives a preliminary block from the blockchain node B, it can be determined by comparing the random character sequence 1 corresponding to the blockchain node B with the target character sequence. Whether the random character sequence 1 matches the target character sequence. If the blockchain node A also receives a preliminary block from the blockchain node C, and the random character sequence 2 corresponding to the blockchain node C also matches the target character sequence, the blockchain node A can compare the random character sequence 1 and the random character sequence 2 at the moment of release to determine the random character sequence that was released relatively earlier.
  • blockchain node A determines that the random character sequence 1 corresponding to blockchain node B matches the target character sequence, and that among all random character sequences matching the target character sequence, blockchain node B corresponds to The random character sequence 1 has the earliest release time, that is, it can be determined that the random character sequence 1 conforms to "verified as matching the target character sequence and the corresponding release time is the earliest in the entire network", so the blockchain node A can send the The preliminary block of the blockchain node B is recorded as the latest block of the blockchain; similarly, other blockchain nodes can also record the preliminary block from the blockchain node B as the latest area of the blockchain based on the above method.
  • Block which is equivalent to the blockchain node B vying for the right of bookkeeping in the blockchain, and achieving consensus among the various blockchain nodes.
  • the consensus process between the blockchain nodes does not depend on the computing power of each blockchain node, so that even if the blockchain node has mastered 51% of the entire network Or more computing power, still unable to control the accounting rights in the blockchain, to avoid malicious blockchain nodes.
  • a transaction containing the random character sequence and the identity information of the blockchain node may be published to the blockchain, so that the random character sequence and the identity information of the blockchain node are associated To the blockchain.
  • the preliminary block may include a serial number or other characteristic identifier of the transaction, so that a blockchain node that receives the preliminary block can search the blockchain based on the serial number or other characteristic identifier.
  • the target character sequence may be published to the blockchain by a Oracle node. Since the data provided by the oracle machine is considered absolutely reliable, the authenticity of the target character sequence can be ensured.
  • the oracle may obtain the target character sequence from an off-chain object.
  • the off-chain object may randomly generate the target character sequence by a computer, or the off-chain object may control the physical device to randomly release a number of spheres, each There is a one-to-one correspondence between spheres and characters, so that the target character sequence is formed by the release order of each sphere and the characters corresponding to each sphere.
  • the target character sequence is generated by a predictor node by calling the smart contract for generating a character sequence. Because the above-mentioned smart contract has built-in processing logic for randomly generating character sequences, the oracle node can generate the target character sequence randomly by calling the smart contract.
  • the oracle node may broadcast the target character sequence on the entire network to be published into the blockchain by a blockchain node with accounting rights.
  • the oracle node may default to a bookkeeping right, and may directly publish the target character sequence to the blockchain.
  • an asset freezing certificate associated with the random character sequence may be issued to the blockchain, and the asset freezing certificate indicates an area of not less than a preset amount held by the blockchain node.
  • Blockchain assets are in a frozen state; wherein, when there is no asset freezing certificate associated with the random character sequence, the random character sequence is determined as invalid information.
  • a certain threshold of participation can be set for the blockchain nodes participating in the competition for bookkeeping rights, and blockchain nodes with insufficient blockchain assets are excluded (illegal elements may temporarily create some special (To increase the probability of hitting the target character sequence on the blockchain nodes participating in the competition for bookkeeping rights) and increase the evil cost of the blockchain nodes.
  • the random character sequence, the identity information of the blockchain node, and the asset freezing certificate can be included in the same transaction to indicate the association relationship between the asset freezing certificate and the random character sequence.
  • the serial number of the transaction containing the random character sequence and the identity information of the blockchain node may be added to the transaction where the asset freeze certificate is located, or the above-mentioned transaction containing the random character sequence and the blockchain node may be added to the transaction.
  • the transaction serial number of the asset freezing certificate is added to the transaction of the identity information, which depends on the publishing order between the two transactions, that is, the serial number of the earlier published transaction can be added to the later published transaction.
  • a blockchain asset corresponding to the asset freezing certificate is thawed and returned to the blockchain node.
  • a blockchain asset corresponding to the asset freezing certificate is deducted from the blockchain node to participate in the competition The cost of bookkeeping rights.
  • the blockchain node may only have a corresponding random character sequence, that is, each blockchain node has only one chance to compete for the right to account, and all the blockchain nodes have the right to account for the right The probability is consistent.
  • the blockchain node may have a plurality of corresponding random character sequences, and each random character sequence has a corresponding asset freezing certificate; in other words, the blockchain node may provide multiple asset freezing certificates, In order to obtain multiple random character sequences, it helps to increase the probability that the blockchain node will compete for the right of account.
  • the generated preliminary block can be broadcasted on the entire network within the blockchain; accordingly, when the When any random character sequence corresponding to a blockchain node is verified to match the target character sequence and the corresponding release time is the earliest on the entire network, the preliminary block is recorded as the latest block of the blockchain.
  • FIG. 2 is a schematic structural diagram of a blockchain network provided by an exemplary embodiment; as shown in FIG. 2, it is assumed that a blockchain node 21, a blockchain node 22, a blockchain node 23, and Blockchain node 24, etc., the blockchain nodes 21 to 24 can communicate with each other.
  • the two nodes shown in Figure 2 can communicate with each other, and there may be some nodes that need to pass other nodes as a medium. Communication is then achieved, and this specification does not limit this.
  • the blockchain nodes 21 to 23 may be ordinary nodes, the blockchain node 24 may be a oracle node, and transactions issued by the blockchain nodes 21 to 23 in the blockchain are considered unreliable, and The transactions issued by the blockchain node 24 as a oracle node in the blockchain are considered absolutely credible.
  • FIG. 3 is a schematic flowchart of determining a billing right according to an exemplary embodiment.
  • the right to account for the latest block in the blockchain can be contested in the manner shown in Figure 3. This process can include The following steps:
  • Step 302 Generate asset freezing certificate.
  • the blockchain node 21 is taken as an example: the blockchain node 21 can freeze a preset amount of blockchain assets held by itself; for example, the blockchain node 21 can freeze the preset amount The amount of blockchain assets is transferred to a predefined asset freezing account and the corresponding asset freezing certificate is obtained.
  • the blockchain node 21 may issue the asset freezing certificate to the blockchain, so that the asset freezing certificate is recorded in a blockchain ledger maintained by each blockchain node and having a uniform content.
  • Step 304 Obtain a random number string.
  • a blockchain node 21 is taken as an example:
  • the blockchain node 21 can call a smart contract, and the smart contract defines a function logic for generating a random number string in advance, so that the smart contract can automatically based on the function logic.
  • the length of the random number string is restricted in the smart contract.
  • the random number string can be a 128-bit number string. Since the smart contract is published on the blockchain, the functional logic defined in the smart contract is public data, so as to ensure that the generation result of the random number string is objective and fair, and avoid the black box operation caused by human intervention.
  • the blockchain node 21 corresponds to the random number string L1.
  • the smart contract can be repeatedly called until the satisfied random number string is obtained as the random number string L1 described above.
  • each blockchain node can obtain the corresponding random number string by calling the above-mentioned smart contract.
  • the blockchain node 21 may publish its corresponding random number string L1 to the blockchain to indicate the correspondence between the blockchain node 21 and the random number string L1, and may obtain the Release time (characterized by time stamp) of the random number string L1. Then, even if the random number string L1 corresponding to different blockchain nodes is the same, it is possible to compare and determine the right to bookkeeping right through the difference of the publishing time.
  • Step 306 Obtain a target digital string.
  • the oracle machine node 24 can obtain the target digital string and publish the target digital string to the blockchain; correspondingly, each blockchain node can read the target digital string from the blockchain, thereby Get the target number string.
  • the oracle node 24 may call the above-mentioned smart contract so that the smart contract can automatically and randomly generate a digital string, such as an 8-bit digital string, as the target digital string.
  • the oracle node 24 may receive a target number string passed in by an off-chain object, for example, the target number string may be generated by the off-chain object by a random algorithm.
  • Step 308 Determine whether the random number string matches the target number string.
  • each blockchain node can compare its corresponding random number string with the target number string to determine whether the two match. If the random number string is the same as the target number string, it can determine Match the random number string to the target number string.
  • Step 310 When the random number string matches the target number string, broadcast the preliminary blocks generated by the blockchain node itself to the entire network, and receive the preliminary blocks broadcast by other blockchain nodes.
  • the blockchain node 21 is taken as an example: When the blockchain node 21 determines that the corresponding random number string 1 matches the target number string, the blockchain node 21 may match the generated preliminary block Broadcast the whole network, so that the blockchain nodes 22-24 can receive the preliminary block.
  • the blockchain node 21 may generate the preliminary block at any time, for example, the preliminary block has been generated before step 310, or may generate the preliminary block when it is confirmed that the random number string 1 matches the target number string. This specification does not limit this.
  • the blockchain node 22 may receive the preliminary block broadcast by the above-mentioned blockchain node 21.
  • the blockchain node 23 can broadcast the generated preliminary block throughout the network, so that Blockchain nodes 21-22, 24, etc. can all receive the preliminary block. Among them, the blockchain node 23 can also receive the preliminary block broadcast by the above-mentioned blockchain node 21.
  • Step 312 Select the latest block and write it into the blockchain.
  • each of the blockchain nodes 21 to 24 and the like maintains a blockchain ledger locally.
  • Each blockchain node can determine the latest block separately and write the latest block to the block it maintains.
  • the content maintenance of the blockchain ledger is realized.
  • the blockchain node 21 can test the preliminary block B2, which can include:
  • the preliminary block B2 read the transaction corresponding to the transaction serial number and its transaction content from the blockchain.
  • the transaction content includes a random number string corresponding to the node 23 of the blockchain.
  • the block chain node 21 can check whether the random number string matches the target number string; if it does not match, the preliminary block B2 can be ignored.
  • the above transaction content includes the frozen asset certificate corresponding to the blockchain node 23
  • the random number string contained in the transaction content is considered valid; otherwise, the preliminary block B2 can be ignored.
  • the frozen asset certificate can also be issued to the blockchain through independent transactions, and its transaction serial number can be recorded in the above-mentioned preliminary block B2, so that the blockchain node 21 can obtain the blockchain node 23 accordingly. Corresponding frozen asset certificate.
  • the above transaction content includes the release time of the random number string.
  • the release time of the random number string should be earlier than the release time of the target number string.
  • the random number string contained in the above transaction content should not be used to compete for the accounting rights of other blocks, for example, the release time of the random number string should be later than the release time of the target number string corresponding to the previous block.
  • the blockchain node 21 can compare the release time of the random number string corresponding to the blockchain node 21 and the release time of the random number string corresponding to the blockchain node 23: when the random number corresponding to the blockchain node 21 is When the publishing time of the digital string is earlier than the publishing time of the random digital string corresponding to the blockchain node 23, the blockchain node 21 can write the preliminary block B1 into the blockchain ledger maintained by itself; otherwise, the blockchain The node 21 can write the prepared block B2 into the blockchain ledger maintained by itself.
  • the preliminary block B1 can also be prepared separately in the above manner.
  • Block B2 is checked, and based on the sequence of the release times of the random number strings corresponding to the blockchain node 21 and the blockchain node 23 respectively, it is determined that the prepared blocks that pass the test and are released first in the entire network are written into the area they maintain Blockchain ledger.
  • each blockchain node in the blockchain network can participate in the scramble for the right to account for each block through a method such as that shown in Figure 3, and since all data is public, immutable, Verifiable, which can ensure that each blockchain node writes the same content in the blockchain ledger maintained by itself, and achieves unified network-wide management and maintenance of the blockchain ledger.
  • FIG. 4 is a schematic structural diagram of a device according to an exemplary embodiment.
  • the device includes a processor 402, an internal bus 404, a network interface 406, a memory 408, and a non-volatile memory 410.
  • the processor 402 reads the corresponding computer program from the non-volatile memory 410 into the memory 408 and then runs it to form a block issuing device on a logical level.
  • one or more embodiments of this specification do not exclude other implementations, such as a logic device or a combination of software and hardware, etc. That is to say, the execution body of the following processing flow is not limited to each A logic unit can also be a hardware or logic device.
  • the block publishing device may include:
  • the first publishing unit 52 publishes the random character sequence to the blockchain in association with the identity information of the blockchain node, wherein the publishing time of the random character sequence is earlier than that of the target character sequence;
  • the broadcasting unit 53 when the random character sequence matches the target character sequence, broadcasts the generated preliminary block within the blockchain on the entire network; wherein, when the random character sequence is verified as matching the When the target character sequence and the corresponding release time are the earliest in the entire network, the preliminary block is recorded as the latest block of the blockchain.
  • the first issuing unit 52 is specifically configured to:
  • the preliminary block includes a serial number of the transaction, so that a blockchain node receiving the preliminary block searches the transaction from the blockchain according to the serial number, so as to match the random characters. The sequence and its release time are verified.
  • the target character sequence is published to the blockchain by a predictor node.
  • the target character sequence is generated by a predictor node by calling the smart contract for generating a character sequence.
  • Optional also includes:
  • the second issuing unit 54 issues an asset freezing certificate associated with the random character sequence to the blockchain, where the asset freezing certificate indicates that the blockchain node holds not less than a preset amount of blocks Chain assets are frozen;
  • the random character sequence is determined as invalid information.
  • the blockchain asset corresponding to the asset freezing certificate is thawed and returned to the blockchain node;
  • a blockchain asset corresponding to the asset freezing certificate is deducted from the blockchain node.
  • the blockchain node has multiple corresponding random character sequences, and each random character sequence has a corresponding asset freezing certificate; the broadcasting unit 53 is specifically configured to:
  • the generated preliminary block is broadcasted on the entire network within the blockchain;
  • the preliminary block is recorded as the blockchain Latest block.
  • the system, device, module, or unit described in the foregoing embodiments may be specifically implemented by a computer chip or entity, or a product with a certain function.
  • a typical implementation device is a computer, and the specific form of the computer may be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email sending and receiving device, and a game control Desk, tablet computer, wearable device, or a combination of any of these devices.
  • a computer includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.
  • processors CPUs
  • input / output interfaces output interfaces
  • network interfaces network interfaces
  • memory volatile and non-volatile memory
  • Memory may include non-persistent memory, random access memory (RAM), and / or non-volatile memory in computer-readable media, such as read-only memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
  • RAM random access memory
  • ROM read-only memory
  • flash RAM flash memory
  • Computer-readable media includes both permanent and non-persistent, removable and non-removable media.
  • Information can be stored by any method or technology.
  • Information may be computer-readable instructions, data structures, modules of a program, or other data.
  • Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), and read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, read-only disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, Magnetic tape cartridges, magnetic disk storage, quantum memory, graphene-based storage media, or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices.
  • computer-readable media does not include temporary computer-readable media, such as modulated data signals and carrier waves.
  • first, second, third, etc. may be used to describe various information in one or more embodiments of the present specification, the information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other.
  • first information may also be referred to as second information, and similarly, the second information may also be referred to as first information.
  • word “if” as used herein can be interpreted as “at” or "when” or "in response to determination”.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Computer Security & Cryptography (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Bioethics (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • Technology Law (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)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Au moins un mode de réalisation de la présente invention concerne un procédé et un appareil de libération de blocs, ainsi qu'un dispositif électronique, appliqués à un nœud de chaîne de blocs. Le procédé selon l'invention consiste : à appeler un contrat intelligent pour générer une séquence de caractères, le contrat intelligent servant à générer une séquence de caractères aléatoires pour un noeud de chaîne de blocs ; à libérer la séquence de caractères aléatoires et des informations d'identité du noeud de chaîne de blocs vers une chaîne de blocs d'une façon associée, le temps de libération de la séquence de caractères aléatoires étant antérieur au temps de libération d'une séquence de caractères cibles ; et, lorsque la séquence de caractères aléatoires correspond à la séquence de caractères cibles, à effectuer une diffusion sur tout le réseau sur un bloc préparatoire généré de la chaîne de blocs, le bloc préparatoire étant enregistré comme dernier bloc de la chaîne de blocs lorsque la correspondance de la séquence de caractères aléatoires avec la séquence de caractères cibles est vérifiée et que le temps de libération correspondant est le plus ancien sur tout le réseau.
PCT/CN2019/084379 2018-07-27 2019-04-25 Appareil et procédé de libération de blocs, et dispositif électronique WO2020019792A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810848235.4A CN109242676B (zh) 2018-07-27 2018-07-27 区块发布方法及装置、电子设备
CN201810848235.4 2018-07-27

Publications (1)

Publication Number Publication Date
WO2020019792A1 true WO2020019792A1 (fr) 2020-01-30

Family

ID=65073162

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/084379 WO2020019792A1 (fr) 2018-07-27 2019-04-25 Appareil et procédé de libération de blocs, et dispositif électronique

Country Status (3)

Country Link
CN (1) CN109242676B (fr)
TW (1) TWI699728B (fr)
WO (1) WO2020019792A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112651745A (zh) * 2020-12-30 2021-04-13 杭州趣链科技有限公司 一种金融区块链的信用评估方法、电子设备及存储介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109242676B (zh) * 2018-07-27 2023-10-27 创新先进技术有限公司 区块发布方法及装置、电子设备
CN109847365B (zh) * 2019-01-24 2022-08-12 湖南天河国云科技有限公司 一种面向区块链应用的防作弊方法及系统
US11188521B2 (en) * 2019-06-05 2021-11-30 International Business Machines Corporation Flexible transaction validation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107005574A (zh) * 2016-12-23 2017-08-01 深圳前海达闼云端智能科技有限公司 区块生成方法、装置和区块链网络
WO2017192837A1 (fr) * 2016-05-04 2017-11-09 Silvio Micali Système réparti de propagation et de vérification de transactions
CN107438003A (zh) * 2016-05-27 2017-12-05 索尼公司 电子设备、用于电子设备的方法和信息处理系统
CN109242676A (zh) * 2018-07-27 2019-01-18 阿里巴巴集团控股有限公司 区块发布方法及装置、电子设备

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9608829B2 (en) * 2014-07-25 2017-03-28 Blockchain Technologies Corporation System and method for creating a multi-branched blockchain with configurable protocol rules
WO2018112949A1 (fr) * 2016-12-23 2018-06-28 深圳前海达闼云端智能科技有限公司 Procédé, dispositif et appareil de nœud destinés au minage de chaîne de blocs
CN106651332B (zh) * 2016-12-29 2020-11-06 成都质数斯达克科技有限公司 一种区块链中新区块的生成方法及区块链
CN108270821A (zh) * 2016-12-30 2018-07-10 深圳瀚德创客金融投资有限公司 用于区块链网络中的区块生成方法和网络节点

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017192837A1 (fr) * 2016-05-04 2017-11-09 Silvio Micali Système réparti de propagation et de vérification de transactions
CN107438003A (zh) * 2016-05-27 2017-12-05 索尼公司 电子设备、用于电子设备的方法和信息处理系统
CN107005574A (zh) * 2016-12-23 2017-08-01 深圳前海达闼云端智能科技有限公司 区块生成方法、装置和区块链网络
CN109242676A (zh) * 2018-07-27 2019-01-18 阿里巴巴集团控股有限公司 区块发布方法及装置、电子设备

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112651745A (zh) * 2020-12-30 2021-04-13 杭州趣链科技有限公司 一种金融区块链的信用评估方法、电子设备及存储介质

Also Published As

Publication number Publication date
TW202008270A (zh) 2020-02-16
CN109242676A (zh) 2019-01-18
TWI699728B (zh) 2020-07-21
CN109242676B (zh) 2023-10-27

Similar Documents

Publication Publication Date Title
US11398914B2 (en) Blockchain-based data authorization method and apparatus
US20210160068A1 (en) Data sharing method, apparatus, and system, and electronic device
TWI762818B (zh) 基於區塊鏈的發票創建方法及裝置、電子設備
WO2020019792A1 (fr) Appareil et procédé de libération de blocs, et dispositif électronique
US11310051B2 (en) Blockchain-based data authorization method and apparatus
TWI735820B (zh) 資產管理方法及裝置、電子設備
US10929198B2 (en) Blockchain-based resource allocation method and apparatus
TWI759563B (zh) 資產管理方法及裝置、電子設備
TWI771618B (zh) 基於區塊鏈的作品版權分配方法和裝置
TWI709055B (zh) 權益分配方法及裝置、電子設備
TWI709868B (zh) 基於區塊鏈的資料存證方法和裝置
TW202004594A (zh) 基於區塊鏈的交易處理方法及裝置、電子設備
TW202022754A (zh) 基於區塊鏈的發票創建方法及裝置、電子設備
WO2020082883A1 (fr) Procédé et dispositif de sélection d'objet et dispositif électronique
CN112650978B (zh) 基于区块链的侵权检测方法及装置、电子设备
TWI727284B (zh) 基於區塊鏈的隱私交易方法、裝置及其電腦設備、基於區塊鏈內的隱私交易的應用方法及其電腦設備
US11423473B2 (en) Blockchain-based leasing
TWI714414B (zh) 區塊鏈資料的分次獲取方法和裝置
TW202024984A (zh) 資料讀寫方法及裝置、電子設備
US10872170B2 (en) Blockchain-based copyright distribution
TW202025057A (zh) 欄位更新方法及裝置、電子設備
WO2019153660A1 (fr) Procédé et appareil de traitement de transactions, dispositif informatique et support d'informations
WO2020082869A1 (fr) Procédé et appareil de prédiction d'événement et dispositif électronique
TW202008230A (zh) 事件預測方法及裝置、電子設備
US10726049B2 (en) Obtaining blockchain data in stages

Legal Events

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

Ref document number: 19840399

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19840399

Country of ref document: EP

Kind code of ref document: A1