CN109246084B - New block generation method and device, electronic equipment and storage medium - Google Patents

New block generation method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN109246084B
CN109246084B CN201810916727.2A CN201810916727A CN109246084B CN 109246084 B CN109246084 B CN 109246084B CN 201810916727 A CN201810916727 A CN 201810916727A CN 109246084 B CN109246084 B CN 109246084B
Authority
CN
China
Prior art keywords
hash value
value information
block
node
determining
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.)
Active
Application number
CN201810916727.2A
Other languages
Chinese (zh)
Other versions
CN109246084A (en
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.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group 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 China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN201810916727.2A priority Critical patent/CN109246084B/en
Publication of CN109246084A publication Critical patent/CN109246084A/en
Application granted granted Critical
Publication of CN109246084B publication Critical patent/CN109246084B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/04Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0407Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
    • H04L63/0414Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden during transmission, i.e. party's identity is protected against eavesdropping, e.g. by using temporary identifiers, but is known to the other party or parties involved in the communication
    • 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/382Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3827Use of message hashing
    • 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401Transaction verification
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/06Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3297Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
    • 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

Abstract

The invention provides a new block generation method, a device, electronic equipment and a storage medium, wherein second hash value information of a first node is determined from a plurality of second hash value information broadcasted to a block chain network by a timestamp server, and the second hash value information is generated by the timestamp server by sequentially stamping a plurality of first hash value information broadcasted to the block chain network by the timestamp server; the timestamp server can only process the broadcasted first hash value information in sequence and cannot acquire the first hash value information received from which node, and the second hash value information is determined by the node in the plurality of second hash value information, and the timestamp server cannot acquire which node the second hash value information is directed to, so that a timestamp corresponding to a specific node cannot be tampered by attacking the timestamp server, and further, fair competition among the nodes can be effectively guaranteed, and the security is good.

Description

New block generation method and device, electronic equipment and storage medium
Technical Field
The present invention relates to the field of block chains, and in particular, to a new block generation method and apparatus, an electronic device, and a storage medium.
Background
The Blockchain (Blockchain) is essentially a decentralized database, and the Blockchain is a series of data blocks which are generated by using a cryptographic method to be related, and each data block contains information of one bitcoin network transaction, so that the validity (anti-counterfeiting) of the information is verified and the next block is generated.
In the prior art, a timestamp server is introduced as a centralized node, and through the timestamp server, a timestamp can be printed on information generated by nodes in a block chain network, so that according to the timestamp, the nodes can screen blocks generated by the nodes, and thus the contention of the nodes for the accounting right is realized.
However, in order to timestamp information, the timestamp server needs to receive information sent by each node and send information after the timestamp to each node, so that if the timestamp server is attacked and the timestamp is tampered with, fair competition among the nodes cannot be guaranteed, and the security is poor.
Disclosure of Invention
The invention provides a new block generation method, a new block generation device, electronic equipment and a storage medium, and aims to solve the problem of poor safety.
According to a first aspect of the present invention, there is provided a new block generation method applied to a first node, including:
determining first hash value information of the first node, and broadcasting the first hash value information of the first node to a blockchain network;
determining second hash value information of the first node in a plurality of pieces of second hash value information broadcast to the blockchain network by a timestamp server, wherein the second hash value information is generated by the timestamp server by sequentially stamping a plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information comprises first hash value information of the first node and first hash value information of M second nodes in the block chain network;
generating a first block for recording N transaction records, and broadcasting the first block and second hash value information of the first node to the blockchain network;
determining second hash value information of the M second nodes and second blocks broadcast to the blockchain network by the M second nodes;
determining K candidate blocks according to the time stamp of each second hash value information; the candidate block is part or all of the first block and the second block;
determining one of the K candidate blocks as a new block of the blockchain network.
Optionally, the determining that one of the K candidate blocks is a new block of the blockchain network includes:
determining one target block according to second hash value information corresponding to the K candidate blocks and a preset rule; the second hash value information corresponding to the K candidate blocks is the second hash value information of nodes generating the K candidate blocks;
determining the target block as the new block.
Optionally, the determining one of the target blocks according to the second hash value information corresponding to the K candidate blocks and a preset rule includes:
determining a target hash value with a minimum or maximum numerical value in second hash value information corresponding to the K candidate blocks;
and determining the target block as a candidate block corresponding to the target hash value.
Optionally, the N transaction records are transaction records in a first time period; the timestamps of the second hash value information corresponding to the K candidate blocks are in a second time period, and the second time period is after the first time period is finished; and the second hash value information corresponding to the K candidate blocks is the second hash value information of the nodes generating the K candidate blocks.
Optionally, the determining the first hash value information of the first node includes:
and determining first hash value information of the first node according to the N transaction records.
Optionally, the second hash value information is signed by the timestamp server using a private key of the timestamp server;
after determining that the M second nodes broadcast to the second block of the blockchain network and the second hash value information of the second node, the method further includes:
verifying the signature of the timestamp server in part or all of the second hash value information by using the public key of the timestamp server;
and confirming that the block corresponding to the second hash value information which fails to pass the verification is not the new block, wherein the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
Optionally, after determining that the M second nodes broadcast to the second block of the blockchain network and the second hash value information of the second node, the method further includes:
checking the transaction record recorded by the second block by using the transaction record recorded by the first block;
if the transaction record recorded by one of the second blocks is determined to be missing, generating a first missing record capable of representing the missing block, and broadcasting the first missing record to the block chain network;
determining a block which does not pass account checking according to all missing records broadcasted to the block chain network, wherein the block which does not pass account checking is a block of which the ratio of the number of the missing records to the total number of the blocks is greater than a preset proportion threshold value;
and confirming that the block corresponding to the second hash value information which is not passed through account checking is not the new block, wherein the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
Optionally, after determining that one of the K candidate blocks is a new block of the blockchain network, the method further includes:
determining that the first block is a newly generated block of the block chain network, writing the first block into the ledger of the first node, and synchronizing the written ledger to the M second nodes, or:
and synchronizing the account book of the first node according to the synchronization information broadcast to the blockchain network by one target second node so as to write the blocks generated by the target second node into the account book of the first node.
According to a second aspect of the present invention, there is provided a new block generation apparatus, comprising:
the first hash value determining module is used for determining first hash value information of the first node and broadcasting the first hash value information of the first node to a blockchain network;
a second hash value determining module, configured to determine second hash value information of the first node from a plurality of pieces of second hash value information broadcast to the blockchain network by a timestamp server, where the second hash value information is generated by the timestamp server by sequentially stamping a timestamp on the plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information comprises first hash value information of the first node and first hash value information of M second nodes in the block chain network;
the first block processing module is used for generating a first block for recording N transaction records and broadcasting the first block and second hash value information of the first node to the block chain network;
a second block processing module, configured to determine second hash value information of second nodes and second blocks broadcast to the blockchain network by the M second nodes;
the candidate block determining module is used for determining K candidate blocks according to the time stamp of each second hash value information; the candidate block is part or all of the first block and the second block;
a new block determination module for determining one of the K candidate blocks as a new block of the blockchain network.
Optionally, the new block determining module includes:
the target block determining submodule is used for selecting and determining one target block according to the second hash value information corresponding to the K candidate blocks and a preset rule; the second hash value information corresponding to the K candidate blocks is the second hash value information of nodes generating the K candidate blocks;
a new block determining submodule, configured to determine that the target block is the new block.
Optionally, the target block determining sub-module includes:
a target hash value determining unit, configured to select second hash value information corresponding to the K candidate blocks, and determine a target hash value having a smallest or largest numerical value;
and the target block determining unit is used for determining the target block as a candidate block corresponding to the target hash value.
Optionally, the N transaction records are transaction records in a first time period; the timestamps of the second hash value information corresponding to the K candidate blocks are in a second time period, and the second time period is after the first time period is finished; and the second hash value information corresponding to the K candidate blocks is the second hash value information of the nodes generating the K candidate blocks.
Optionally, the first hash value determining module is specifically configured to:
and determining first hash value information of the first node according to the N transaction records.
Optionally, the second hash value information is signed by the timestamp server using a private key of the timestamp server;
the device, still include:
the verification module is used for verifying the signature of the timestamp server in part or all of the second hash value information by using the public key of the timestamp server;
and the verification failure processing module is used for confirming that the block corresponding to the second hash value information which is not verified is not the new block, and the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
Optionally, the apparatus further includes:
the account checking module is used for checking the transaction record recorded by the second block by using the transaction record recorded by the first block;
the missing record processing module is used for generating a first missing record capable of representing the missing block if the missing of the transaction record recorded by one of the second blocks is determined, and broadcasting the first missing record to the block chain network;
the account checking non-passing determining module is used for determining a block which does not pass the account checking according to all the missing records broadcasted to the block chain network, wherein the block which does not pass the account checking is a block of which the ratio of the number of the missing records to the total number of the blocks is greater than a preset proportional threshold;
and the account checking non-passing processing module is used for confirming that the block corresponding to the second hash value information which is not passed by account checking is not the new block, and the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
Optionally, the apparatus further includes:
a first book processing module, configured to write the first block into the book of the first node if the new block is the first block, and synchronize the written book to the M second nodes, or:
the second account book processing module is configured to synchronize the account book of the first node according to synchronization information broadcast by one of the target second nodes to the blockchain network, so as to write the block generated by the target second node into the account book of the first node.
According to a third aspect of the present invention, there is provided an electronic apparatus comprising:
a processor; and the number of the first and second groups,
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the new block generation method referred to in the first aspect of the claims and their alternatives via execution of the executable instructions.
According to a fourth aspect of the present invention, there is provided a storage medium having stored thereon a computer program, characterized in that the program, when executed by a processor, implements the new block generation method relating to the first aspect and its alternatives.
According to the new block generation method, the device, the electronic equipment and the storage medium, the second hash value information of the first node is determined from a plurality of second hash value information broadcasted to the block chain network by the timestamp server, and the second hash value information is generated by the timestamp server by sequentially stamping a plurality of first hash value information broadcasted to the block chain network; the timestamp server can only process the broadcasted first hash value information in sequence, and cannot acquire the first hash value information received from which node, meanwhile, as the second hash value information is determined in a plurality of second hash value information by the node, the timestamp server cannot acquire which node the second hash value information is directed to, the timestamp server cannot tamper the timestamp corresponding to the specific node through attack on the timestamp server, and further, the K candidate blocks are determined according to the timestamps of the second hash value information; and determining one of the K candidate blocks as a new block of the block chain network, thereby effectively ensuring fair competition among nodes and having better safety.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic diagram of a blockchain network in an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a method for generating a new block according to an embodiment of the present invention;
FIG. 3 is a first flowchart illustrating a new block generation method according to another embodiment of the present invention;
FIG. 4 is a second flowchart illustrating a new block generation method according to another embodiment of the present invention;
FIG. 5 is a third flowchart illustrating a method for generating new blocks according to another embodiment of the present invention;
fig. 6 is a schematic structural diagram of a new block generation apparatus according to an embodiment of the present invention;
FIG. 7 is a first schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention;
FIG. 8 is a second schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention;
fig. 9 is a schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention;
fig. 10 is a schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention;
fig. 11 is a schematic structural diagram of a new block generation apparatus in another embodiment of the present invention;
fig. 12 is a schematic structural diagram of an electronic device according to an embodiment of the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 1 is a schematic diagram of a blockchain network according to an embodiment of the present invention.
Referring to fig. 1, a node 1 and a timestamp server 2 may be included in a blockchain network, and the timestamp server 2 may be understood as a device mainly used for stamping a timestamp on information, so the timestamp server 2 does not need to rob accounting right and cannot acquire a reward accordingly, i.e. it does not need to perform "mining", in contrast, the node 1 needs to rob accounting right and also acquires a reward accordingly, i.e. needs to perform "mining", in the blockchain network, and therefore the node 1 may also be understood as a mining node or an accounting node.
Fig. 2 is a flowchart illustrating a new block generation method according to an embodiment of the present invention.
Referring to fig. 2, the new block generation method includes:
s101: and determining first hash value information of the first node, and broadcasting the first hash value information of the first node to a block chain network.
The first node may be any node in the blockchain network, and the second node may be any node other than the first node. Therefore, if the second node is mainly described, it may be the first node to implement the method according to the present embodiment. It can be seen that the first node and the second node are relative descriptions, which may be any node in the blockchain network.
Since the first hash value information of the first node is broadcasted, other nodes of the blockchain network can receive the first hash value information, and similarly, a timestamp server in the blockchain network can also receive the first hash value information.
At this time, the first hash value information sent by the node may be only a hash value, and does not carry a private key signature of the node.
S102: determining second hash value information of the first node from a plurality of second hash value information broadcast by a timestamp server to the blockchain network.
The second hash value information may be understood as generated by the timestamp server by sequentially timestamp a plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information includes first hash value information of the first node and first hash value information of M second nodes in the blockchain network.
As can be seen, in this embodiment, the timestamp server sequentially receives the first hash value information broadcast by each node including the first node and the M second nodes, and then, a timestamp of the current time when the first hash value information is received can be stamped on each first hash value information, so as to obtain the second hash value information including the timestamp, where the hash value can be the same as that in the first hash value information.
It can be seen that the main difference between the first hash value information and the second hash value information is: the first hash value information includes a first hash value, and the second hash value information includes a time stamp added in addition to the first hash value.
S103: generating a first block for recording N transaction records, and broadcasting the first block and second hash value information of the first node to the blockchain network.
Meanwhile, the second hash values of the first block and the first node are matched and broadcast together, and then the second hash values of the first block, the first node and the first node are corresponding.
S104: determining second hash value information of the M second nodes and second blocks broadcast to the blockchain network.
The second hash values of the second block and the second node are broadcast together in a matching manner, and further the second hash values of the second block, the second node and the second node are corresponding.
The first block may be understood as a block determined by the first node according to the N transaction records of the first time period, may also be understood as a block for recording the N transaction records of the first time period, and the second block may be understood as a block determined by the first node according to the N transaction records of the first time period, may also be understood as a block for recording the N transaction records of the second time period, and may be understood as a block that is not validated temporarily when the block is not confirmed as a new block. It may be validated as a new block or validated as an invalid block, i.e., identified as a non-new block.
It can be seen that the difference between the first block and the second block is only that the two blocks are generated by different nodes.
S105: and determining K candidate blocks according to the time stamp of each second hash value information.
The candidate block is part or all of the first block and the second block; since different second hash value information corresponds to different blocks, K pieces of second hash value information can be selected according to the timestamp, that is, K pieces of nodes are selected, and then, K candidate blocks can be determined according to the corresponding relationship.
The method realizes the screening of the blocks according to the time stamps, and the time stamps can not be obtained to which node the time stamps are directed, and the time stamps can not be changed for specific nodes when attacking the time stamp server, so that the fair competition among the nodes can be guaranteed by screening based on the time stamps.
S106: determining one of the K candidate blocks as a new block of the blockchain network.
The above step S106 can be understood as: any step of processing the new block as the currently generated new block may be understood as directly or indirectly performing step S106.
In the new block generation method provided in this embodiment, the second hash value information of the first node is determined from a plurality of pieces of second hash value information broadcast to the block chain network by a timestamp server, and the second hash value information is generated by the timestamp server by sequentially stamping a timestamp on the plurality of pieces of first hash value information broadcast to the block chain network; the timestamp server can only process the broadcasted first hash value information in sequence, and cannot acquire the first hash value information received from which node, meanwhile, as the second hash value information is determined by the node in the plurality of second hash value information, the timestamp server cannot acquire which node the second hash value information is directed to, the timestamp server cannot tamper the timestamp corresponding to the specific node through attack on the timestamp server, and further, the K candidate blocks are determined according to the timestamps of the second hash value information; and determining one of the K candidate blocks as a new block of the block chain network, thereby effectively ensuring fair competition among nodes and having better safety.
Fig. 3 is a first flowchart of a new block generation method according to another embodiment of the present invention.
Referring to fig. 3, the new block generation method includes:
s201: and determining first hash value information of the first node, and broadcasting the first hash value information of the first node to a block chain network.
The technical terms, implementation manners, and effects that can be produced in step S201 can be understood with reference to step S101 in the embodiment shown in fig. 2, and repeated contents will not be described herein.
In this embodiment, step S201 may include:
s2011: and determining a first hash value of the first node according to the N transaction records.
S2012: broadcasting the first hash value of the first node to a blockchain network.
This first hash value, may further be understood to characterize the preemption of a billing right, such as: it is characterized in that the node with the node identification QWER robs the accounting right of the P block and obtains 8 gold coins rewarded by mining. The present embodiment combines all transaction records for a first time period, e.g., the past W minutes, together to calculate a first hash value. It can be seen that since a node robs billing for the past W minutes every W minutes, i.e. generates a new block every fixed period of time, e.g. W minutes, a first hash value can be generated for each rob.
S202: determining second hash value information of the first node from a plurality of second hash value information broadcast by a timestamp server to the blockchain network.
The technical terms, implementation manners, and effects that can be produced by step S202 can be understood by referring to step S102 in the embodiment shown in fig. 2, and repeated contents will not be described herein.
In one embodiment, the second hash value information is signed by the timestamp server using a private key of the timestamp server; therefore, the timestamp server also needs to sign the second hash value information by using the private key of the timestamp server.
Through the second hash value signed by the timestamp server, the timestamp can be confirmed to be actually printed on the timestamp server through signature verification in the subsequent process, and the safety is improved.
In one embodiment, step S202 may specifically include: the first node compares the broadcasted second hash value information with the originally broadcasted first hash value information, and since the hash values are the same, if the hash values are the same, the second hash value information is determined to be the second hash value information of the first node.
In one embodiment, after step S202, the first node may further sign the second hash value with a private key of the first node, and then the second hash value finally broadcasted in step S203 may be signed by the timestamp server using the private key and the first node using the private key, where the second hash value carries a timestamp printed by the timestamp server.
S203: generating a first block for recording N transaction records, and broadcasting the first block and second hash value information of the first node to the blockchain network.
S204: determining second hash value information of the M second nodes and second blocks broadcast to the blockchain network.
The technical terms, embodiments and effects related to steps S203 and S204 can be understood by referring to steps S103 and S104 in the embodiment shown in fig. 2, and repeated contents will not be described in detail here.
Through the above steps S203 and S204, the first node can learn all the blocks including the first block and the M second blocks, and the second hash value information corresponding to each block, where the hash value information corresponding to the block can be understood as the second hash value information broadcast by the node generating the block.
Fig. 4 is a flowchart illustrating a new block generation method according to another embodiment of the present invention.
Referring to fig. 4, after step S204, the method may include:
s210: checking the transaction record recorded by the second block by using the transaction record recorded by the first block;
since each block is generated according to N transaction records, the transaction records recorded in each block should be consistent.
S211: if the transaction record recorded by one of the second blocks is determined to be missing, generating a first missing record capable of representing the missing block, and broadcasting the first missing record to the block chain network;
s212: determining a block which does not pass account checking according to all missing records broadcasted to the block chain network, wherein the block which does not pass account checking is a block of which the ratio of the number of the missing records to the total number of the blocks is greater than a preset proportion threshold value;
all missing records broadcast to the blockchain network may include a first missing record and may also include a second missing record generated by a second block, where the second missing record is also capable of characterizing the block where the missing occurred. The first missing record is different from the second missing record in that the first missing record is generated by the first node and the second missing record is generated by the second node.
S213: and confirming that the block corresponding to the second hash value information which is not passed through account checking is not the new block, wherein the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
Since the number of missing records of a block represents the difference between the missing records and other blocks, when the missing records are different from other blocks, the number is higher, and the missing records and errors are more likely to occur. When it is the same as other blocks in large phases, the number is low, and the possibility of missing or error is low. Therefore, the probability of omission and errors can be represented to a certain extent by utilizing the ratio of the total number of the blocks to the total number of the blocks, and then, the unusable blocks with the omission of the transaction records can be effectively eliminated according to the probability, the unusable blocks can not be recorded in the account book, and the fact that the finally generated new blocks can accurately record N transaction records is guaranteed.
Fig. 5 is a third flowchart illustrating a new block generation method according to another embodiment of the present invention.
Referring to fig. 5, referring to fig. 4, after step S204, the method may include:
s214: verifying the signature of the timestamp server in part or all of the second hash value information by using the public key of the timestamp server;
s215: and confirming that the block corresponding to the second hash value information which fails to pass the verification is not the new block, wherein the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
Because the second hash value information is signed by the timestamp server by using the private key, the time stamp server can ensure that the time stamp is really stamped by the timestamp server through verification of the second hash value information, and the second hash value information is real and effective, and further, blocks corresponding to the second hash value information stamped by the non-timestamp server can be eliminated, so that the safety is ensured.
In one embodiment, step S205 may be performed after the blocks are filtered twice in steps S210 to S215. In another embodiment, only one of the embodiments shown in fig. 4 and 5 may be implemented, and step S205 may be further implemented. In another embodiment, step S205 may be directly performed without performing the embodiment shown in fig. 4 or 5. Furthermore, step S205 may also be implemented before step S210, or before step S204.
S205: and determining K candidate blocks according to the time stamp of each second hash value information.
The technical terms, implementation manners, and effects that can be produced in step S205 can be understood with reference to step S105 in the embodiment shown in fig. 2, and repeated contents will not be described herein.
The K candidate blocks may be understood as that the timestamps of the second hash value information corresponding to the K candidate blocks are within a second time period, where the second time period is after the end of the first time period; and the second hash value information corresponding to the K candidate blocks is the second hash value information of the nodes generating the K candidate blocks.
The starting point of the second time period may be the ending point of the first time period, or may be a time point after the ending point of the first time period, and the length of the first time period may be the same as the length of the second time period, for example, the aforementioned W minutes, or may be different. Wherein if the first time period is characterized as Tn-1 to Tn, the second time period can be characterized as Tn to Tn + 1.
Since the time stamp is stamped after the first time period, the blocks can be screened again through the step S205, and all the blocks corresponding to the second hash value information with unmatched time stamps are excluded, so that it is ensured that all the selected blocks are generated for the first time period and are stamped in the second time period. The generation of new blocks is prevented from being interfered by blocks with mismatched time.
S206: determining one of the K candidate blocks as a new block of the blockchain network.
The technical terms, implementation manners, and effects that can be produced in step S206 can be understood with reference to step S106 in the embodiment shown in fig. 2, and repeated contents will not be described herein.
Referring to fig. 3, step S206 may include:
s2061: determining one target block according to second hash value information corresponding to the K candidate blocks and a preset rule; the second hash value information corresponding to the K candidate blocks is the second hash value information of nodes generating the K candidate blocks;
s2062: determining the target block as the new block.
In one embodiment, step S2061 may further include: determining a target hash value with a minimum or maximum value in the second hash value information corresponding to the K candidate blocks, and: and determining the target block as a candidate block corresponding to the target hash value.
In other alternative embodiments, the preset rule is not limited to the maximum and minimum values listed above, and may be other.
Through the above steps, since the new block is confirmed, which is equivalent to the only valid block, the steps can be implemented to allow the whole blockchain network to approve the result, so that the node writes the result into the account book of the blockchain network. Specifically, steps S207 to S209 may be adopted.
S207: whether the new block is the first block.
If yes, go to step S208: and determining the first block as a newly generated block of the block chain network, writing the first block into the account book of the first node, and synchronizing the written account book to the M second nodes.
If not, step S209 is performed: and synchronizing the account book of the first node according to the synchronization information broadcast to the blockchain network by one target second node so as to write the blocks generated by the target second node into the account book of the first node.
Therefore, a new area approved by the whole blockchain network is obtained finally, namely N transaction records are recorded in an effective block, and the information of the bookkeeping and ore mining reward applied by the node can be effectively recorded in the blockchain account book, so that the node obtains the success of the ore mining reward of the blockchain network. After completion, all nodes can then begin contending for the accounting rights for the next new block.
In one of the implementation modes, in order to avoid a node applying for a large number of zombie account numbers to rob, all users in the block chain can adopt a real-name system mode, or the scheme is applied to the occasions of the real-name system block chain, so that each user has only one opportunity, and the rob opportunities are equal. Meanwhile, in the embodiment, because the content of the timestamp mentioned above is included in the block, it can also be guaranteed that any malicious user cannot forge the block afterwards.
In the new block generation method provided in this embodiment, the second hash value information of the first node is determined from a plurality of pieces of second hash value information broadcast to the block chain network by a timestamp server, and the second hash value information is generated by the timestamp server by sequentially stamping a timestamp on the plurality of pieces of first hash value information broadcast to the block chain network; the timestamp server can only process the broadcasted first hash value information in sequence, and cannot acquire the first hash value information received from which node, meanwhile, as the second hash value information is determined by the node in the plurality of second hash value information, the timestamp server cannot acquire which node the second hash value information is directed to, the timestamp server cannot tamper the timestamp corresponding to the specific node through attack on the timestamp server, and further, the K candidate blocks are determined according to the timestamps of the second hash value information; and determining one of the K candidate blocks as a new block of the block chain network, thereby effectively ensuring fair competition among nodes and having better safety.
Fig. 6 is a schematic structural diagram of a new block generation apparatus according to an embodiment of the present invention.
Referring to fig. 6, the new block generating apparatus 300 includes:
a first hash value determining module 301, configured to determine first hash value information of the first node, and broadcast the first hash value information of the first node to a blockchain network;
a second hash value determining module 302, configured to determine second hash value information of the first node from a plurality of pieces of second hash value information broadcast to the blockchain network by a timestamp server, where the second hash value information is generated by the timestamp server by sequentially stamping timestamps on the plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information comprises first hash value information of the first node and first hash value information of M second nodes in the block chain network;
a first block processing module 303, configured to generate a first block recording N transaction records, and broadcast the first block and second hash value information of the first node to the blockchain network;
a second block processing module 304, configured to determine second hash value information of second blocks broadcast to the blockchain network by the M second nodes and the second nodes;
a candidate block determining module 305, configured to determine K candidate blocks according to the timestamp of each second hash value information; the candidate block is part or all of the first block and the second block;
a new block determination module 306, configured to determine one of the K candidate blocks as a new block of the blockchain network.
In the new block generation apparatus provided in this embodiment, the second hash value information of the first node is determined from a plurality of pieces of second hash value information broadcast to the blockchain network by the timestamp server, and the second hash value information is generated by the timestamp server by sequentially stamping a timestamp on the plurality of pieces of first hash value information broadcast to the blockchain network; the timestamp server can only process the broadcasted first hash value information in sequence, and cannot acquire the first hash value information received from which node, meanwhile, as the second hash value information is determined by the node in the plurality of second hash value information, the timestamp server cannot acquire which node the second hash value information is directed to, the timestamp server cannot tamper the timestamp corresponding to the specific node through attack on the timestamp server, and further, the K candidate blocks are determined according to the timestamps of the second hash value information; and determining one of the K candidate blocks as a new block of the block chain network, thereby effectively ensuring fair competition among nodes and having better safety.
Fig. 7 is a first schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention.
Referring to fig. 7, the new block generating apparatus 400 includes:
a first hash value determining module 401, configured to determine first hash value information of the first node, and broadcast the first hash value information of the first node to a blockchain network;
a second hash value determining module 402, configured to determine second hash value information of the first node from a plurality of pieces of second hash value information broadcast to the blockchain network by a timestamp server, where the second hash value information is generated by the timestamp server by sequentially stamping timestamps on the plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information comprises first hash value information of the first node and first hash value information of M second nodes in the block chain network;
a first block processing module 403, configured to generate a first block recording N transaction records, and broadcast the first block and second hash value information of the first node to the blockchain network;
a second block processing module 404, configured to determine second hash value information of second nodes and second blocks broadcast to the blockchain network by the M second nodes;
a candidate block determination module 405, configured to determine K candidate blocks according to the timestamp of each piece of second hash value information; the candidate block is part or all of the first block and the second block;
a new block determination module 406, configured to determine one of the K candidate blocks as a new block of the blockchain network.
Optionally, the new block determining module 406 includes:
the target block determining submodule 4061 is configured to select one of the target blocks according to the second hash value information corresponding to the K candidate blocks and a preset rule; the second hash value information corresponding to the K candidate blocks is the second hash value information of nodes generating the K candidate blocks;
a new block determining sub-module 4062, configured to determine that the target block is the new block.
Optionally, the target block determining sub-module 4061 includes:
a target hash value determining unit, configured to select second hash value information corresponding to the K candidate blocks, and determine a target hash value having a smallest or largest numerical value;
and the target block determining unit is used for determining the target block as a candidate block corresponding to the target hash value.
Optionally, the N transaction records are transaction records in a first time period; the timestamps of the second hash value information corresponding to the K candidate blocks are in a second time period, and the second time period is after the first time period is finished; and the second hash value information corresponding to the K candidate blocks is the second hash value information of the nodes generating the K candidate blocks.
Optionally, the first hash value determining module 401 is specifically configured to:
and determining first hash value information of the first node according to the N transaction records.
Fig. 8 is a schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention.
Referring to fig. 8, the apparatus further includes:
a first book processing module 407, configured to write the first block into the book of the first node if the new block is the first block, and synchronize the written book to the M second nodes.
Fig. 9 is a schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention;
referring to fig. 9, the apparatus further includes:
the second accounting processing module 408 is configured to synchronize the accounting of the first node according to synchronization information broadcast by one of the target second nodes to the blockchain network, so as to write the block generated by the target second node into the accounting of the first node.
Fig. 10 is a schematic structural diagram of a new block generation apparatus according to another embodiment of the present invention.
Referring to fig. 10, the apparatus further includes:
the reconciliation module 409 is configured to reconcile the transaction record recorded in the second block with the transaction record recorded in the first block;
a missing record processing module 410, configured to generate a first missing record capable of representing a missing block if it is determined that a transaction record recorded in one of the second blocks is missing, and broadcast the first missing record to the blockchain network;
the reconciliation non-passing determining module 411 is configured to determine a reconciliation non-passing block according to all missing records broadcast to the block chain network, where the reconciliation non-passing block is a block in which a ratio of the number of the missing records to the total number of the blocks is greater than a preset ratio threshold;
the reconciliation non-passing processing module 412 is configured to determine that the block corresponding to the second hash value information that is not passed through is not the new block, and the block corresponding to the second hash value information is a block generated by a node corresponding to the second hash value information.
Fig. 11 is a schematic structural diagram of a new block generation apparatus in another embodiment of the present invention;
the second hash value information is signed by the timestamp server by using a private key of the timestamp server.
Referring to fig. 11, the apparatus further includes:
a verification module 413, configured to verify a signature of the timestamp server in part or all of the second hash value information by using the public key of the timestamp server;
the verification failed processing module 414 is configured to determine that the block corresponding to the second hash value information that is failed in verification is not the new block, where the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
In the new block generation apparatus provided in this embodiment, the second hash value information of the first node is determined from a plurality of pieces of second hash value information broadcast to the blockchain network by the timestamp server, and the second hash value information is generated by the timestamp server by sequentially stamping a timestamp on the plurality of pieces of first hash value information broadcast to the blockchain network; the timestamp server can only process the broadcasted first hash value information in sequence, and cannot acquire the first hash value information received from which node, meanwhile, as the second hash value information is determined by the node in the plurality of second hash value information, the timestamp server cannot acquire which node the second hash value information is directed to, the timestamp server cannot tamper the timestamp corresponding to the specific node through attack on the timestamp server, and further, the K candidate blocks are determined according to the timestamps of the second hash value information; and determining one of the K candidate blocks as a new block of the block chain network, thereby effectively ensuring fair competition among nodes and having better safety.
Fig. 12 is a schematic structural diagram of an electronic device according to an embodiment of the invention.
Referring to fig. 12, the present embodiment further provides an electronic device 50 including: a processor 51 and a memory 52; wherein:
a memory 52 for storing a computer program, which may also be a flash (flash memory).
And a processor 51 for executing the execution instructions stored in the memory to implement the steps of the above method. Reference may be made in particular to the description relating to the preceding method embodiment.
Alternatively, the memory 52 may be separate or integrated with the processor 51.
When the memory 52 is a device independent from the processor 51, the electronic device 50 may further include:
a bus 53 for connecting the memory 52 and the processor 51.
The present embodiment also provides a readable storage medium, in which a computer program is stored, and when the computer program is executed by at least one processor of an electronic device, the computer program electronically executes the method provided by the above various embodiments.
The present embodiment also provides a program product comprising a computer program stored in a readable storage medium. The computer program can be read from a readable storage medium by at least one processor of the electronic device, and the execution of the computer program by the at least one processor causes the electronic device to implement the methods provided by the various embodiments described above.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (11)

1. A new block generation method is applied to a first node, and is characterized by comprising the following steps:
determining first hash value information of the first node, and broadcasting the first hash value information of the first node to a blockchain network;
determining second hash value information of the first node in a plurality of pieces of second hash value information broadcast to the blockchain network by a timestamp server, wherein the second hash value information is generated by the timestamp server by sequentially stamping a plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information comprises first hash value information of the first node and first hash value information of M second nodes in the block chain network; the second hash value information comprises the first hash value and the time stamp;
generating a first block for recording N transaction records, and broadcasting the first block and second hash value information of the first node to the blockchain network;
determining second hash value information of the M second nodes and second blocks broadcast to the blockchain network by the M second nodes;
determining K candidate blocks according to the time stamp of each second hash value information; the candidate block is part or all of the first block and the second block;
determining one of the K candidate blocks as a new block of the blockchain network.
2. The method of claim 1, wherein determining that one of the K candidate blocks is a new block of the blockchain network comprises:
determining one target block according to second hash value information corresponding to the K candidate blocks and a preset rule; the second hash value information corresponding to the K candidate blocks is the second hash value information of nodes generating the K candidate blocks;
determining the target block as the new block.
3. The method of claim 2, wherein determining one of the target partitions according to the second hash value information corresponding to the K candidate partitions and a predetermined rule comprises:
determining a target hash value with a minimum or maximum numerical value in second hash value information corresponding to the K candidate blocks;
and determining the target block as a candidate block corresponding to the target hash value.
4. The method of claim 1, wherein the N transaction records are transaction records over a first time period; the timestamps of the second hash value information corresponding to the K candidate blocks are in a second time period, and the second time period is after the first time period is finished; and the second hash value information corresponding to the K candidate blocks is the second hash value information of the nodes generating the K candidate blocks.
5. The method according to any one of claims 1 to 4, wherein the determining the first hash value information of the first node comprises:
and determining first hash value information of the first node according to the N transaction records.
6. The method according to any one of claims 1 to 4, wherein the second hash value information is signed by the timestamp server using a private key of the timestamp server;
after determining that the M second nodes broadcast to the second block of the blockchain network and the second hash value information of the second node, the method further includes:
verifying the signature of the timestamp server in part or all of the second hash value information by using the public key of the timestamp server;
and confirming that the block corresponding to the second hash value information which fails to pass the verification is not the new block, wherein the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
7. The method according to any one of claims 1 to 4, wherein after determining that the M second nodes broadcast to the second block of the blockchain network and the second hash value information of the second nodes, further comprising:
checking the transaction record recorded by the second block by using the transaction record recorded by the first block;
if the transaction record recorded by one of the second blocks is determined to be missing, generating a first missing record capable of representing the missing block, and broadcasting the first missing record to the block chain network;
determining a block which does not pass account checking according to all missing records broadcasted to the block chain network, wherein the block which does not pass account checking is a block of which the ratio of the number of the missing records to the total number of the blocks is greater than a preset proportion threshold value;
and confirming that the block corresponding to the second hash value information which is not passed through account checking is not the new block, wherein the block corresponding to the second hash value information is a block generated by the node corresponding to the second hash value information.
8. The method according to any of claims 1 to 4, wherein after determining that one of the K candidate blocks is a new block of the blockchain network, further comprising:
if the new block is the first block, writing the first block into the ledger of the first node, and synchronizing the written ledger to the M second nodes, or:
and synchronizing the account book of the first node according to the synchronization information broadcast to the blockchain network by one target second node so as to write the blocks generated by the target second node into the account book of the first node.
9. A new block generation apparatus, comprising:
the first hash value determining module is used for determining first hash value information of a first node and broadcasting the first hash value information of the first node to a blockchain network;
a second hash value determining module, configured to determine second hash value information of the first node from a plurality of pieces of second hash value information broadcast to the blockchain network by a timestamp server, where the second hash value information is generated by the timestamp server by sequentially stamping a timestamp on the plurality of pieces of first hash value information broadcast to the blockchain network; the plurality of first hash value information comprises first hash value information of the first node and first hash value information of M second nodes in the block chain network; the second hash value information comprises the first hash value and the time stamp;
the first block processing module is used for generating a first block for recording N transaction records and broadcasting the first block and second hash value information of the first node to the block chain network;
a second block processing module, configured to determine second hash value information of second nodes and second blocks broadcast to the blockchain network by the M second nodes;
the candidate block determining module is used for determining K candidate blocks according to the time stamp of each second hash value information; the candidate block is part or all of the first block and the second block;
a new block determination module for determining one of the K candidate blocks as a new block of the blockchain network.
10. An electronic device, comprising:
a processor; and the number of the first and second groups,
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the new block generation method of any of claims 1 to 8 via execution of the executable instructions.
11. A storage medium on which a computer program is stored, the program being characterized in that it implements the new block generation method of any one of claims 1 to 8 when executed by a processor.
CN201810916727.2A 2018-08-13 2018-08-13 New block generation method and device, electronic equipment and storage medium Active CN109246084B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810916727.2A CN109246084B (en) 2018-08-13 2018-08-13 New block generation method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810916727.2A CN109246084B (en) 2018-08-13 2018-08-13 New block generation method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN109246084A CN109246084A (en) 2019-01-18
CN109246084B true CN109246084B (en) 2021-07-27

Family

ID=65070332

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810916727.2A Active CN109246084B (en) 2018-08-13 2018-08-13 New block generation method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN109246084B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110086856B (en) * 2019-04-01 2022-02-01 达闼机器人有限公司 Control method and device of block chain node, storage medium and electronic equipment
CN110544167B (en) * 2019-07-25 2022-03-01 晋商博创(北京)科技有限公司 Data processing method, server and storage medium of alliance chain based on CPK
CN111183427B (en) * 2019-09-02 2023-06-30 创新先进技术有限公司 Managing a blockchain-based centralized ledger system
CN110838924B (en) * 2019-11-19 2022-04-12 北京沃东天骏信息技术有限公司 Block transmission method and device
CN111541756B (en) * 2020-04-17 2021-10-15 腾讯科技(深圳)有限公司 Block generation method, block generation device, node equipment and storage medium
CN111538791B (en) * 2020-05-07 2023-09-22 深圳创客区块链技术有限公司 Block chain multiple-cross-chain mutual protection method, device and storage medium
CN111339574B (en) * 2020-05-19 2021-03-16 卓尔智联(武汉)研究院有限公司 Block data processing method and device, computer equipment and storage medium
CN113282662B (en) * 2021-06-03 2023-11-03 广东辰宜信息科技有限公司 Block information processing method, device, equipment and medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105975868A (en) * 2016-04-29 2016-09-28 杭州云象网络技术有限公司 Block chain-based evidence preservation method and apparatus
CN107147501A (en) * 2017-06-27 2017-09-08 中国联合网络通信集团有限公司 Timestamp processing method and processing device
CN107438003A (en) * 2016-05-27 2017-12-05 索尼公司 Electronic equipment, method and information processing system for electronic equipment
CN107566124A (en) * 2017-08-24 2018-01-09 深圳市易成自动驾驶技术有限公司 Common recognition method for building up, block catenary system and storage medium based on lottery mechanism

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106251144A (en) * 2015-06-05 2016-12-21 地气股份有限公司 Electronic money management method and electronic money node apparatus

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105975868A (en) * 2016-04-29 2016-09-28 杭州云象网络技术有限公司 Block chain-based evidence preservation method and apparatus
CN107438003A (en) * 2016-05-27 2017-12-05 索尼公司 Electronic equipment, method and information processing system for electronic equipment
CN107147501A (en) * 2017-06-27 2017-09-08 中国联合网络通信集团有限公司 Timestamp processing method and processing device
CN107566124A (en) * 2017-08-24 2018-01-09 深圳市易成自动驾驶技术有限公司 Common recognition method for building up, block catenary system and storage medium based on lottery mechanism

Also Published As

Publication number Publication date
CN109246084A (en) 2019-01-18

Similar Documents

Publication Publication Date Title
CN109246084B (en) New block generation method and device, electronic equipment and storage medium
CN109493221B (en) Method, device, network and storage medium for keeping transaction records secret in block chain
CN108646983B (en) Processing method and device for storing service data on block chain
CN107171810B (en) Verification method and device of block chain
CN107396360B (en) Block verification method and device
CN108881165B (en) Multi-center authentication system with block issuing mechanism
CN108256353B (en) Data integrity checking method and device and client
CN108711212B (en) Voting certificate storage method, device and system
CN107330720B (en) Block chain-based integral processing method and system
CN109543065B (en) Video active identification method combined with block chain
JP6495346B2 (en) Information processing system
US11888985B2 (en) Blockchain system, registration terminal, approval terminal, smart contract registration method, and smart contract registration program
CN109166040B (en) Transaction auditing method, device, equipment and storage medium based on block chain
CN109447809B (en) Video active identification method combined with block chain
CN108880820B (en) Code management method and device
CN111445247A (en) Method and apparatus for preventing block chain forking
CN106650496B (en) Data processing method and device
CN107111695A (en) Model is counter to conspire watermark
CN114372296A (en) Block chain-based user behavior data auditing method and system
CN114553444B (en) Identity authentication method, identity authentication device and storage medium
CN112749968A (en) Service data recording method and device based on block chain
CN112003701B (en) Block self-checking and synchronizing method and device
CN110704855B (en) Request identifier generation method, request identifier verification method and computer equipment
CN108882230B (en) Call record management method, device and system
CN109558064B (en) Electronic invoice data chain synchronization method, device, medium and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant