CN111522874A - Block chain consensus method, block chain consensus device, computer equipment and storage medium - Google Patents

Block chain consensus method, block chain consensus device, computer equipment and storage medium Download PDF

Info

Publication number
CN111522874A
CN111522874A CN202010200643.6A CN202010200643A CN111522874A CN 111522874 A CN111522874 A CN 111522874A CN 202010200643 A CN202010200643 A CN 202010200643A CN 111522874 A CN111522874 A CN 111522874A
Authority
CN
China
Prior art keywords
service
information
record set
target
block chain
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.)
Granted
Application number
CN202010200643.6A
Other languages
Chinese (zh)
Other versions
CN111522874B (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.)
Kingdee Software China Co Ltd
Original Assignee
Kingdee Software China 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 Kingdee Software China Co Ltd filed Critical Kingdee Software China Co Ltd
Priority to CN202010200643.6A priority Critical patent/CN111522874B/en
Publication of CN111522874A publication Critical patent/CN111522874A/en
Application granted granted Critical
Publication of CN111522874B publication Critical patent/CN111522874B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

The application relates to a block chain consensus method, a block chain consensus device, a computer device and a storage medium. The method comprises the following steps: acquiring service information corresponding to a plurality of target services to be processed respectively to form a parallel consensus information set; broadcasting a parallel consensus request, wherein the parallel consensus request carries the parallel consensus information set; receiving a response result set respectively sent by each block chain node, wherein the response result set comprises a simulation service processing result corresponding to the target service, and the simulation service processing result is obtained by processing according to the service information; determining a target service processing result corresponding to each target service according to the simulation service processing result in each response result set; and obtaining a first service record set according to each target service processing result and pre-stored service information so as to store the first service record set in a block chain. By adopting the method, the consensus efficiency and the block generation efficiency can be improved.

Description

Block chain consensus method, block chain consensus device, computer equipment and storage medium
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a blockchain consensus method, apparatus, computer device, and storage medium.
Background
With the development of network technology, a block chain technology (BT), also called distributed ledger technology, has emerged, which is an internet database technology. The method is characterized by decentralization and public transparency, so that each person can participate in database recording.
Currently, since a blockchain network involves a topology of P2P (Peer-to-Peer network), there may be a node or network failure in the network at any time. Therefore, a Consensus (Consensus) mechanism is introduced into the blockchain to solve the consistency of the blockchain. The consistency of the ledger of each node under the distributed system needs to be solved. Based on this, the blockchain can introduce a consensus mechanism to solve the consistency of the distributed system. The consensus mechanism is that the verification and confirmation of the transaction is completed in a short time through the voting of a special node. For example, if several nodes with irrelevant benefits can agree on a transaction, we can consider that the whole network can agree on the same.
However, the consensus process usually requires a large amount of data to be transmitted, resulting in inefficient consensus.
Disclosure of Invention
In view of the above, it is desirable to provide a blockchain consensus method, apparatus, computer device and storage medium capable of improving the consensus efficiency.
A method of block chain consensus, the method comprising: acquiring service information corresponding to a plurality of target services to be processed respectively to form a parallel consensus information set; broadcasting a parallel consensus request, wherein the parallel consensus request carries the parallel consensus information set; receiving a response result set respectively sent by each block chain node, wherein the response result set comprises a simulation service processing result corresponding to the target service, and the simulation service processing result is obtained by processing according to the service information; determining a target service processing result corresponding to each target service according to the simulation service processing result in each response result set; and obtaining a first service record set according to each target service processing result and pre-stored service information so as to store the first service record set in a block chain.
In some embodiments, the method further comprises: performing summary calculation on the first service record set to obtain first summary information corresponding to the first service record set; and determining a block generation priority corresponding to the first service record set according to the first summary information, and adding the first service record set into a block chain according to the block generation priority.
In some embodiments, the method further comprises: acquiring second abstract information sent by each block chain node, wherein the second abstract information is obtained by the block chain node according to a second service record set generated by the local terminal; the determining, according to the first summary information, a block generation priority corresponding to the first service record set includes: and determining block generation priorities corresponding to the first service record set and the second service record set respectively according to the first summary information and the second summary information.
In some embodiments, the obtaining the first summary information includes obtaining a first time statistic value, and the obtaining the first summary information corresponding to the first service record set by performing summary calculation on the first service record set includes: counting time information corresponding to each service record in the first service record set, and taking an obtained statistical value as a first time statistical value in the first summary information, wherein the second summary information comprises a second time statistical value; determining block generation priorities corresponding to the first service record set and the second service record set according to the first summary information and the second summary information, respectively, includes: and determining block generation priorities corresponding to the first service record set and the second service record set respectively according to the time sequence corresponding to the first time statistic value and the second time statistic value.
In some embodiments, the method further comprises: determining a business record set with the highest block generation priority as a target business record set; and taking the block chain link point corresponding to the target service record set as a target block chain node, and sending a block generation message to the target block chain node, so that the target block chain node responds to the block generation message and generates a target block according to the target service record set.
In some embodiments, the method further comprises: sorting the first summary information and the second summary information according to the time sequence corresponding to the first time statistic and the second time statistic to form a summary information sequence; and broadcasting the summary information sequence, so that each block chain node determines a block generation priority corresponding to the service record set generated by the local terminal according to the summary information sequence, and generates a corresponding block according to the corresponding block generation priority.
In some embodiments, the determining, according to the simulated service processing result in each response result set, a target service processing result corresponding to each target service includes: and determining that the simulation service processing result corresponding to the target service is a first passing number, and determining a target service processing result corresponding to the target service according to the first number.
An apparatus for blockchain consensus, the apparatus comprising: the parallel consensus information set forming module is used for acquiring service information corresponding to a plurality of target services to be processed respectively to form a parallel consensus information set; the parallel consensus request broadcasting module is used for broadcasting a parallel consensus request, and the parallel consensus request carries the parallel consensus information set; a response result set receiving module, configured to receive a response result set sent by each block link node, where the response result set includes a simulated service processing result corresponding to the target service, and the simulated service processing result is obtained by processing according to the service information; a target service processing result determining module, configured to determine, according to the simulated service processing result in each response result set, a target service processing result corresponding to each target service; and the first service record set obtaining module is used for obtaining a first service record set according to each target service processing result and pre-stored service information so as to store the first service record set in the block chain.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the block chain consensus method described above when executing the computer program.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned block chain consensus method.
The block chain consensus method, the block chain consensus device, the computer equipment and the storage medium obtain service information corresponding to a plurality of target services to be processed respectively to form a parallel consensus information set, broadcast a parallel consensus request carrying the parallel consensus information set, receive response result sets sent by each block chain link point respectively, wherein the response result sets comprise simulation service processing results corresponding to the target services, the simulation service processing results are obtained by processing according to the service information, determine the target service processing results corresponding to each target service respectively according to the simulation service processing results in each response result set, and obtain a first service record set according to each target service processing result and pre-stored service information so as to store the first service record set in the block chain. The parallel consensus information set is obtained according to the service information corresponding to the target services to be processed respectively, so that the broadcasting of the parallel consensus information set can initiate consensus on the target services simultaneously, and the consensus efficiency is improved. In addition, because the first service record set is obtained by each target service processing result and the corresponding pre-stored service information, the first service record can be quickly obtained according to the stored service information, the generation efficiency of the service record is improved, and the block generation efficiency is improved.
Drawings
FIG. 1 is a diagram illustrating an exemplary implementation of a blockchain consensus method in some embodiments;
FIG. 2A is a flow chart of a block chain consensus method in some embodiments;
FIG. 2B is a schematic diagram of a blockchain consensus method in some embodiments;
FIG. 3 is a flow chart of a block chain consensus method in some embodiments;
FIG. 4 is a flow chart of a block chain consensus method in some embodiments;
FIG. 5 is a flow chart of a block chain consensus method in some embodiments;
FIG. 6 is a flow chart of a block chain consensus method in some embodiments;
FIG. 7 is a flow chart of a block chain consensus method in some embodiments;
FIG. 8 is a block diagram of a blockchain consensus device in some embodiments;
FIG. 9 is a diagram of the internal structure of a computer device in some embodiments.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The block chain consensus method provided by the present application can be applied to the application environment shown in fig. 1. The application environment includes a service Node 110 and a blockchain system 100, wherein the blockchain system 100 may include a plurality of nodes (nodes), such as a first blockchain Node 102, a second blockchain Node 104, a third blockchain Node 106, and a fourth blockchain Node 108. The various nodes in the blockchain system 100 communicate over a network. The service node 110 and the first blockchain node 102 communicate over a network. It is to be understood that the 4 nodes in fig. 1 are merely exemplary, not limiting, and that the blockchain system 100 may include more nodes or fewer nodes. Each node may be an independent server or a server cluster composed of a plurality of servers.
Specifically, the first blockchain node 102 may obtain service information corresponding to a plurality of target services to be processed, to form a parallel consensus information set, broadcast a parallel consensus request, where the parallel consensus request carries the parallel consensus information set, and other nodes in the blockchain system 100 receive the parallel consensus request, respond to the parallel consensus request, obtain a simulated service processing result corresponding to the target service according to the service information in the parallel consensus information set, generate a response result set according to each simulated service processing result, and broadcast the response result set. The first block chain node 102 may receive the response result sets respectively sent by each block chain link point, determine the target service processing results respectively corresponding to each target service according to the simulated service processing results in each response result set, obtain a first service record set according to each target service processing result and the service information stored in advance, generate a block (block) from the first service record set, and store the generated block into the block chain.
Wherein, the block chain node is a data processing node in the block chain network. A blockchain network is a carrier and organization of the operation blockchain technology. The block chain technology, bt (block chain technology) for short, also called distributed book technology, is an internet database technology, and is characterized by decentralized and transparent disclosure, so that each node can participate in data recording. The blockchain technology is a brand new distributed infrastructure and computing mode that uses blockchain data structures to verify and store data, uses distributed node consensus algorithms to generate and update data, uses cryptography to secure data transmission and access, and uses intelligent contracts composed of automated script codes to program and manipulate data.
It is to be understood that the above application scenario is only an example, and does not constitute a limitation to the method provided in the embodiment of the present application, and the method provided in the embodiment of the present application may also be applied in other scenarios, for example, the server in fig. 1 may be a terminal device. The end-user devices may be, but are not limited to, various personal computers and notebook computers.
In some embodiments, as shown in fig. 2A, a method for block chain consensus is provided, which is illustrated by applying the method to the first block chain node 102 in fig. 1, and includes the following steps:
s202, service information corresponding to a plurality of target services to be processed is obtained, and a parallel consensus information set is formed.
Specifically, the target traffic refers to traffic to be processed stored in the first blockchain node. The target service may be at least one of a deposit service and a transaction service, etc. Wherein, the transaction service refers to resource transfer, for example, can be a transfer service. The service information may include one or more of a service identification, identification information of the intelligent contract, a transaction amount, transaction content, and a service participant. The service identification is used to uniquely identify a service. Of course, the specific content of the service information is not limited in this embodiment. Consensus (consensus) refers to a consensus mechanism in a block chain, and the consensus mechanism is a mechanism that completes verification and confirmation of service information through voting of block chain nodes. The parallel consensus refers to the consensus of a plurality of service information in parallel. The parallel consensus information set may include one or more parallel consensus information, and each parallel consensus information may be one service information.
In some embodiments, service information corresponding to a plurality of target services to be processed may be obtained, signature data corresponding to each service information may be calculated, parallel consensus information may be formed according to the service information and the corresponding signature data, and each parallel consensus information may be combined to obtain a parallel consensus information set. Specifically, hash calculation may be performed on the service information to obtain a hash value corresponding to the service information, and the hash value is encrypted by a private key of a user who generates the service information to obtain signature data corresponding to the service information. For example, the parallel consensus information may be Tx { TxID ═ 3719302; CC kst; input is "Jason-100 & Tom + 100"; sign }, wherein. Tx represents a piece of parallel consensus information, including service information and signature data corresponding to the service information. TxID indicates a service identifier, and TxID 3719302 indicates a service identifier 3719302. CC kst indicates a smart total of about kst. input represents the transaction content, representing the transfer 100 from Jason's account to Tom's account. Where the symbols & are "and" mean Jason and Tom are business participants and 100 is the transaction amount. Sign denotes signature data obtained by signature using a Jason private key. The Hash Algorithm is usually used, such as MD5(Message Digest Algorithm, fifth version of Message Digest Algorithm), SHAl (Secure Hash Algorithm), SHA2, and the like, and the embodiment is not limited in this respect.
In some embodiments, the service server may send a service processing request to the first block link point, and the service processing request carries service information. The service processing request can be, for example, a transfer request or a deposit request, etc. Of course, other nodes in the blockchain may also obtain the service processing request sent by the corresponding contact server or terminal.
And S204, broadcasting a parallel consensus request, wherein the parallel consensus request carries a parallel consensus information set.
Specifically, the first block link point broadcasts a parallel consensus request carrying a parallel consensus information set, so that the first block link point can perform consensus on a block chain to which multiple service information is sent at the same time, and a consensus result corresponding to each of the multiple service information is obtained.
In some embodiments, the first block link point may obtain the signature data in the service information and a public key corresponding to a private key for generating the signature data, decrypt the signature data through the public key to obtain decrypted data, calculate a hash value corresponding to the service information, compare the decrypted data with the hash value corresponding to the service information, and broadcast the parallel consensus request when the comparison is consistent.
And S206, receiving a response result set respectively sent by each block link node, wherein the response result set comprises a simulation service processing result corresponding to the target service, and the simulation service processing result is obtained by processing according to the service information.
In particular, the set of response results may include one or more response results. The response result includes a simulation service processing result of the corresponding target service. One response result corresponds to one service information (or target service). The block chain node can obtain the intelligent contract identification in the service information, determine the corresponding intelligent contract according to the intelligent contract identification, and execute the corresponding intelligent contract by using the service information to obtain the corresponding simulation service processing result.
In some embodiments, the response result may further include a service identification of the target service and time information when the simulated service processing result is generated, and the time information may be a time stamp (timestamp). The time stamp is the total number of milliseconds from greenwich time 1970, 01, 00 h/00 s (beijing time 1970, 01, 08 h/00 s) to the present. The simulated business process results may include current balance information for the business participant account. For example, the response result for Tx may be expressed as Sr: { TxID ═ 3719302; output ═ Jason: 200; tom:100 }; and time map is 1572940900, wherein Sr represents the response result corresponding to the parallel consensus information Tx. timestamp 1572940900 represents a timestamp. output ═ Jason: 200; tom is 100, which represents the simulation service processing result and represents that after the account transfer is supposed, the current balance of the Jason account is 200, and the current balance of the Tom account is 100 RMB.
In some embodiments, when receiving a parallel consensus request broadcast by a first block link node, another block link node acquires a parallel consensus information set in the parallel consensus request, acquires parallel consensus information in the parallel consensus information set, verifies signature data corresponding to service information in the parallel consensus information, and executes a corresponding intelligent contract by using the service information when the verification passes, so as to obtain a corresponding simulated service processing result.
In some embodiments, the block link nodes generate initial response results according to the parallel consensus information, broadcast the generated initial response results to other block chain nodes, and receive the shared results from the other block chain nodes broadcasts. For example, the second block link point sends the generated sharing result to the third block link node and the fourth block link node, and receives the initial response result generated by the third block link node and the fourth block link node. The block chain node can obtain a final response result according to the initial response result broadcasted by other block chain nodes, and the final response result is used as a response result corresponding to the target service. For example, when the block link node receives a simulation service processing result in response results broadcasted by a preset number of other block link nodes, the block link node generates a final response result according to the simulation service processing result.
In some embodiments, after the block link point obtains the response result corresponding to each target service, the response results are grouped into a response result set. Of course, the response results corresponding to the target service obtained within the preset time range may also be combined into a response result set.
And S208, determining target service processing results corresponding to the target services respectively according to the simulation service processing results in the response result sets.
Specifically, the first block link point may obtain response results corresponding to the same target service in each response result set, and when it is determined that the simulation service processing results in the preset number of response results are consistent in the response results corresponding to the same target service, the consistent simulation service processing result is used as the target service processing result.
As shown in fig. 2B, the blockchain node a receives the authentication request, broadcasts the service information in the authentication request to other nodes (the blockchain node B, the block chain link point C, and the block chain node D) through a P2P (Peer-to-Peer network), and the other nodes process the service information to obtain a response result and send the response result to the blockchain node a through the Peer network. The service information is, for example, Tx: { TxID ═ 3719302; CC is save; input is "asderpcl; dask31235lsdfoi "; "input" in } asderpcl; dask31235lsdfoi ", the response result is, for example, Sr: { output ═ status: success; }}.
S210, obtaining a first service record set according to each target service processing result and service information stored in advance, and storing the first service record set in a block chain.
Specifically, the first block link point may obtain corresponding pre-stored service information according to the service identifier in the target service processing result, combine the target service processing result and the corresponding pre-stored service information to obtain first service records corresponding to the target service, and form the first service records corresponding to each target service into a first service record set. The service information stored in advance may be stored in a cache. The first block link point may generate a block from the first set of service records, and store the generated block to a corresponding location in the block chain.
In some embodiments, the first block link point forms the first service record according to the response result corresponding to the target service processing result and the parallel consensus information corresponding to the pre-stored service information. For example, the first service record composed of the response result Sr and the parallel consensus information Tx may be denoted as Envelope { Tx: { TxID ═ 3719302; CC kst; input is "Jason-100 & Tom + 100"; sign } Sr { TxID ═ 3719302; output ═ Jason: 200; tom:100 }; time 1572940900.
The block chain consensus method includes acquiring service information corresponding to a plurality of target services to be processed respectively, forming a parallel consensus information set, broadcasting a parallel consensus request, wherein the parallel consensus request carries the parallel consensus information set, receiving response result sets sent by each block chain link point respectively, wherein the response result sets include simulation service processing results corresponding to the target services, the simulation service processing results are obtained by processing according to the service information, determining target service processing results corresponding to the target services respectively according to the simulation service processing results in each response result set, and obtaining a first service record set according to the simulation service processing results and pre-stored service information so as to store the first service record set in a block chain. The parallel consensus information set is obtained according to the service information corresponding to the target services to be processed respectively, so that the broadcasting of the parallel consensus information set can initiate consensus on the target services simultaneously, and the consensus efficiency is improved. In addition, because the first service record set is obtained by each target service processing result and the corresponding pre-stored service information, the first service record can be quickly obtained according to the stored service information, the generation efficiency of the service record is improved, and the block generation efficiency is improved.
In the block chain consensus of the related art, if each transaction needs to reach the consensus, the data including the original transaction needs to be transmitted among each node for many times, and finally, the consistency confirmation can be obtained. In the block chain consensus process, the P2P communication is performed with the data of the original transaction and the processing result, and the package carried by the communication occupies the bandwidth in the network, and the communication efficiency is lower as the package increases.
In the block chain consensus method provided by the application, after the block chain node obtains the processing result, the P2P communication can be performed on the processing result or the simulation service processing result in the processing result, so that the size of the package for communication is reduced, and the communication efficiency in the consensus process is improved.
In some embodiments, as shown in fig. 3, the method further comprises:
s302, performing summary calculation on the first service record set to obtain first summary information corresponding to the first service record set.
Specifically, the summary calculation is used to calculate summary information corresponding to the service record set. The common attribute of each first service record in the first service record set can be obtained, and the summary calculation is performed according to the attribute value corresponding to the common attribute to obtain the first summary information corresponding to the first service record set. The attributes of the business record may include one or more of a business identifier, an intelligent contract, a timestamp, and the like. The summary information may be of a metadata structure. Specifically, a metadata structure can be constructed, fields with frequent communication requirements are collected, the communication is performed through the metadata to reduce the package size of the communication, and the final purpose of block chain consensus is achieved.
In some embodiments, a statistical value corresponding to the service identifier may be calculated, for example, an average value or a sum of the service identifiers is calculated, and the statistical value of the service identifier is used as the summary information.
S304, according to the first summary information, determining a block generation priority corresponding to the first service record set, and adding the first service record set into the block chain according to the block generation priority.
Specifically, the tile generation priority may be a precedence order of generating the tiles. The block chain link points in the block chain system can generate corresponding service record sets according to the service information stored at the local terminal, and generate corresponding summary information for the service record sets. For example, the second block link point generates a second set of service records and generates second summary information for the second set of service records. The block chain nodes in the block chain system can broadcast the summary information generated at the local terminal and receive the summary information broadcast by other block chain nodes. The first block link points may be sorted according to the first summary information and summary information broadcast by other block link points, so as to obtain a block generation priority corresponding to the first service record set.
In some embodiments, the tile generation priority may be the order of connection between individual tiles in the chain of tiles, e.g., tile 1 connected after tile 2 and before tile 3.
In some embodiments, the block node may calculate digest information of a locally stored service record set, calculate a hash value of the digest information, encrypt the hash value by a private key of the node to obtain digest signature information, and broadcast the digest information and the corresponding digest signature information. The block chain node can receive the summary information broadcast by other nodes and the corresponding summary signature information, calculate the hash value of the summary information, decrypt the summary signature information through the corresponding public key to obtain decrypted data, compare the decrypted data with the hash value of the corresponding summary information, and when the comparison is consistent, determine that the received summary information is correct.
In some embodiments, after the first service record set is generated into the corresponding block, the first service record set may be deleted from the cache, thereby relieving the pressure of the cache.
In the above embodiment, the summary information is generated for the service record set, and the block generation priority of the service record set is obtained according to the summary information, because the summary information can be calculated according to the attribute value corresponding to the common attribute of each service record, the data volume of the summary information is much smaller than that of the service record set, the data volume transmitted by the network can be reduced by broadcasting the summary information instead of the service record set, and the speed of transmitting the summary information is faster than that of transmitting the service record set, so that the efficiency of obtaining the block generation priority is improved, and further the block generation efficiency is improved.
In some embodiments, as shown in fig. 4, the method further comprises:
s402, second abstract information sent by each block chain node is obtained, and the second abstract information is obtained by the block chain nodes according to a second service record set generated by the local terminal.
Specifically, during the running process of the block chain, a service calls the block chain service continuously, and all block chain nodes in the block chain system can receive service processing requests corresponding to the service. The blockchain node may generate a corresponding service record set (e.g., Envelope) according to each received service processing request. Therefore, each blockchain link point in the blockchain system can generate a corresponding service record set. The second set of traffic records is a set of traffic records generated by a block link point other than the first block link point in the block chain system. The second summary information is generated from the block link points that generated the second set of business records. The second summary information is generated in a manner that references the first summary information.
Step S304, determining a block generation priority corresponding to the first service record set according to the first summary information, including:
s404, determining block generation priorities corresponding to the first service record set and the second service record set respectively according to the first summary information and the second summary information.
Specifically, each blockchain node in the blockchain system may broadcast the generated summary information through the peer-to-peer network, and the blockchain node may store the summary information broadcast by other blockchain nodes. Each block link point can be sorted according to each summary information, so that the order of generating blocks of each service record set is determined according to the sorting result, that is, the block generation priority corresponding to each service record set is determined.
In some embodiments, each blockchain node in the blockchain system may collectively elect a master node, and the master node sorts each summary information. The master node may also be determined by polling the chunk connection points.
In the above embodiment, the node in the blockchain system broadcasts the generated summary information, so that the nodes in the blockchain system can be sorted according to the summary information, the block generation priority corresponding to each service record set is determined according to the sorting result, and the determination process of the block generation priority can be determined through the summary information with small data size, so that the data size of communication during broadcasting is reduced, the burden of network transmission is reduced, the determination speed of the block generation priority is increased, and the block generation efficiency is increased.
At present, in a block chain system, after each block chain node generates a service record set, the generated service record set needs to be broadcast to other nodes. The block chain node which qualifies for generating the block in the current round, for example, a first block chain node, the first block chain node needs to read the stored service record set from the cache (the service record stored in the cache includes the first service record set generated by the first block chain node and also includes a second service record set broadcast by other nodes), a comparison service record set, the service record set of the block generated in the current round is determined according to the comparison result, and after the block is generated according to the determined service record set, the generated block is broadcast to other block chain nodes to inform them of storing the block. Therefore, a large amount of data needs to be transmitted, which is likely to cause network congestion and data loss. The block chain consensus method provided by the application has the advantages that the data volume of the transmitted summary information is small, and the burden of network transmission is reduced.
In some embodiments, the first summary information includes the first time statistic, as shown in fig. 5, step S302 is to perform summary calculation on the first service record set to obtain first summary information corresponding to the first service record set, and includes:
s502, counting the time information corresponding to each business record in the first business record set, and taking the obtained statistic value as a first time statistic value in the first summary information, wherein the second summary information comprises a second time statistic value.
Specifically, each service record may correspond to time information, the first block link point may obtain the time information in each service record in the first service record set to obtain a time information set, calculate an average value of the time information in the time information set to obtain average time information, and use the obtained average time information as a first time statistic value. Of course, the first block link point may also calculate the sum of the time information in the time information set to obtain the total time information, and use the obtained total time information as the first time statistic. Other nodes in the blockchain system may similarly obtain the second time statistic.
In some embodiments, the summary information further includes a summary identification. Specifically, the hash calculation may be performed on the service record set to obtain a hash value corresponding to the service record set, which is used as the digest identifier. For example, the summary information may be expressed as: abstract { set _ ID ═ xxxxxx; 7348378, wherein set _ ID xxxxxx represents the digest identification, and 7348378 represents the average time information. The summary information may also include more brief information, such as one or more of the height of the previous tile, the hash value of the previous tile, and the like. The height of the last block may be the height corresponding to the newly generated block. For example, the summary information may be expressed as: abstract { set _ ID ═ xxxxxx; average _ time 7348378; height 1280; previous hash 123; where height 1280 represents the height of the previous block, and previous hash abcd123 represents the hash value of the previous block.
Step S404, determining block generation priorities corresponding to the first service record set and the second service record set according to the first summary information and the second summary information, including:
s504, according to the time sequence corresponding to the first time statistic and the second time statistic, block generation priorities corresponding to the first service record set and the second service record set are determined.
Specifically, it may be set that the larger the time statistic value is, the lower the block generation priority is. For example, the first block link point may compare the time statistics values to find the smallest time statistics value, and set the block generation priority of the service record set corresponding to the smallest time statistics value as the smallest time statistics value.
In the above embodiment, the block generation priority is determined by the time statistic, so that the generated blocks can be sorted in the block chain according to the time sequence, and the information can be traced back from the block chain according to the time.
In some embodiments, as shown in fig. 6, the method further comprises:
s602, determining the service record set with the highest block generation priority as a target service record set.
S604, taking the block chain link point corresponding to the target service record set as a target block chain node, and sending a block generation message to the target block chain node, so that the target block chain node responds to the block generation message and generates a target block according to the target service record set.
Specifically, the block generation message may include a set identifier corresponding to the target service record set, where the set identifier may be a hash value corresponding to the service record set. When the first block link point determines that the target service record set belongs to the local terminal, the target service record set can be directly generated into a block. When the first block link point determines that the target service record set does not belong to the local terminal, for example, the target service record set belongs to a second block link node, the second block link point may send a block generation message to the second block link point, and the second block link point may obtain the stored target service record set according to the set identifier in the block generation message, generate the block from the target service record set, and store the block into the block chain.
In some embodiments, as shown in fig. 7, the method further comprises:
s702, sorting the first summary information and the second summary information according to the time sequence corresponding to the first time statistic and the second time statistic to form a summary information sequence.
S704, broadcasting the summary information sequence, so that each block chain node determines a block generation priority corresponding to the service record set generated by the local terminal according to the summary information sequence, and generates a corresponding block according to the corresponding block generation priority.
Specifically, the summary information in the summary information sequence is sorted according to the corresponding time statistics, for example, the smaller the time statistics, the earlier the sorting is. The summary information in the summary information sequence is sorted differently, and the corresponding block generation priorities are also different, so that the block generation priorities of the corresponding service record sets can be determined according to the sorting of the summary information. The first block link node can broadcast the ordered summary information, and other block link nodes in the block link system can determine the generation sequence of the blocks corresponding to the service record set stored at the local terminal according to the ordered summary information and generate the corresponding blocks according to the generation sequence.
In the above embodiment, each block link point may be responsible for generating a block from the service record set stored therein, and the blocks are generated in sequence, so that the service record set generated by each block link point does not need to be sent to the same node, and the block is generated by the same node. Therefore, by retrieving and spreading the summary information, the frequent reading of large-data-volume service records in cache is avoided, and the frequent transmission of large-quantity service records in network communication is also avoided.
In some embodiments, step S208 determines, according to the simulated service processing result in each response result set, a target service processing result corresponding to each target service, including: and determining the simulation service processing result corresponding to the target service as a first passing quantity, and determining the target service processing result corresponding to the target service according to the first quantity.
Specifically, when the first number reaches the preset number, it is determined that the target service processing result corresponding to the target service is a pass.
It should be understood that, although the steps in the flowcharts of the above embodiments are shown in sequence as indicated by the arrows, the steps are not necessarily executed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a part of the steps in the flowcharts of the above embodiments may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or the stages is not necessarily sequential, but may be performed alternately or alternatingly with other steps or at least a part of the sub-steps or the stages of other steps.
In some embodiments, as shown in fig. 8, there is provided a block chain consensus apparatus, including: a parallel consensus information set composing module 802, a parallel consensus request broadcasting module 804, a response result set receiving module 806, a target service processing result determining module 808, and a first service record set obtaining module 810, wherein:
a parallel consensus information set forming module 802, configured to obtain service information corresponding to each of multiple target services to be processed, and form a parallel consensus information set.
The parallel consensus request broadcasting module 804 is configured to broadcast a parallel consensus request, where the parallel consensus request carries a parallel consensus information set.
A response result set receiving module 806, configured to receive a response result set sent by each block link point, where the response result set includes a simulated service processing result corresponding to the target service, and the simulated service processing result is obtained by processing according to the service information.
And a target service processing result determining module 808, configured to determine, according to the simulated service processing result in each response result set, a target service processing result corresponding to each target service.
A first service record set obtaining module 810, configured to obtain a first service record set according to each target service processing result and pre-stored service information, so as to store the first service record set in the block chain.
In some embodiments, the apparatus further comprises:
the first abstract information obtaining module is used for carrying out abstract calculation on the first service record set to obtain first abstract information corresponding to the first service record set;
and the block generation priority determining module is used for determining the block generation priority corresponding to the first service record set according to the first summary information so as to add the first service record set into the block chain according to the block generation priority.
In some embodiments, the apparatus further comprises:
and the second abstract information acquisition module is used for acquiring second abstract information sent by each block chain node, wherein the second abstract information is obtained by the block chain nodes according to a second service record set generated by the local terminal.
And the block generation priority determining module is further used for determining block generation priorities corresponding to the first service record set and the second service record set respectively according to the first summary information and the second summary information.
In some embodiments, the first summary information includes a first time statistic value, and the first summary information obtaining module is further configured to perform statistics on time information corresponding to each service record in the first service record set, where the obtained statistic value is used as the first time statistic value in the first summary information, and the second summary information includes a second time statistic value.
And the block generation priority determining module is further configured to determine block generation priorities corresponding to the first service record set and the second service record set respectively according to the time sequence corresponding to the first time statistic and the second time statistic.
In some embodiments, the apparatus further comprises:
and the summary information sequence obtaining module is used for sequencing the first summary information and the second summary information according to the time sequence corresponding to the first time statistic value and the second time statistic value to form a summary information sequence.
And the summary information sequence broadcasting module is used for broadcasting the summary information sequence, so that each block chain node determines a block generation priority corresponding to the service record set generated by the local terminal according to the summary information sequence, and generates a corresponding block according to the corresponding block generation priority.
In some embodiments, the apparatus further comprises:
and the target business record set obtaining module is used for determining a business record set with the highest block generation priority as a target business record set.
And the block generation message sending module is used for sending the block generation message to the target block chain node by taking the block chain link point corresponding to the target service record set as the target block chain node, so that the target block chain node responds to the block generation message and generates a target block according to the target service record set.
In some embodiments, the target service processing result determining module 808 is further configured to determine that the simulation service processing result corresponding to the target service is a first number that passes, and determine the target service processing result corresponding to the target service according to the first number.
For the specific definition of the blockchain consensus device, reference may be made to the above definition of the blockchain consensus method, which is not described herein again. The modules in the block chain consensus device can be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In some embodiments, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 9. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing the block consensus data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a block chain consensus method.
Those skilled in the art will appreciate that the architecture shown in fig. 9 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In some embodiments, a computer device is provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the computer program is executed by the processor, the steps of the block chain consensus method described above are implemented.
In some embodiments, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor, performs the steps of the above-described block chain consensus method.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A method for block chain consensus, the method comprising:
acquiring service information corresponding to a plurality of target services to be processed respectively to form a parallel consensus information set;
broadcasting a parallel consensus request, wherein the parallel consensus request carries the parallel consensus information set;
receiving a response result set respectively sent by each block chain node, wherein the response result set comprises a simulation service processing result corresponding to the target service, and the simulation service processing result is obtained by processing according to the service information;
determining a target service processing result corresponding to each target service according to the simulation service processing result in each response result set;
and obtaining a first service record set according to each target service processing result and pre-stored service information so as to store the first service record set in a block chain.
2. The method of claim 1, further comprising:
performing summary calculation on the first service record set to obtain first summary information corresponding to the first service record set;
and determining a block generation priority corresponding to the first service record set according to the first summary information, and adding the first service record set into a block chain according to the block generation priority.
3. The method of claim 2, further comprising:
acquiring second abstract information sent by each block chain node, wherein the second abstract information is obtained by the block chain node according to a second service record set generated by the local terminal;
the determining, according to the first summary information, a block generation priority corresponding to the first service record set includes:
and determining block generation priorities corresponding to the first service record set and the second service record set respectively according to the first summary information and the second summary information.
4. The method of claim 3, wherein the first summary information includes a first time statistic, and the performing the summary calculation on the first service record set to obtain the first summary information corresponding to the first service record set comprises:
counting time information corresponding to each service record in the first service record set, and taking an obtained statistical value as a first time statistical value in the first summary information, wherein the second summary information comprises a second time statistical value;
determining block generation priorities corresponding to the first service record set and the second service record set according to the first summary information and the second summary information, respectively, includes:
and determining block generation priorities corresponding to the first service record set and the second service record set respectively according to the time sequence corresponding to the first time statistic value and the second time statistic value.
5. The method of claim 4, further comprising:
determining a business record set with the highest block generation priority as a target business record set;
and taking the block chain link point corresponding to the target service record set as a target block chain node, and sending a block generation message to the target block chain node, so that the target block chain node responds to the block generation message and generates a target block according to the target service record set.
6. The method of claim 4, further comprising:
sorting the first summary information and the second summary information according to the time sequence corresponding to the first time statistic and the second time statistic to form a summary information sequence;
and broadcasting the summary information sequence, so that each block chain node determines a block generation priority corresponding to the service record set generated by the local terminal according to the summary information sequence, and generates a corresponding block according to the corresponding block generation priority.
7. The method according to claim 1, wherein the determining, according to the simulated service processing result in each of the response result sets, a target service processing result corresponding to each of the target services includes:
and determining that the simulation service processing result corresponding to the target service is a first passing number, and determining a target service processing result corresponding to the target service according to the first number.
8. An apparatus for block chain consensus, the apparatus comprising:
the parallel consensus information set forming module is used for acquiring service information corresponding to a plurality of target services to be processed respectively to form a parallel consensus information set;
the parallel consensus request broadcasting module is used for broadcasting a parallel consensus request, and the parallel consensus request carries the parallel consensus information set;
a response result set receiving module, configured to receive a response result set sent by each block link node, where the response result set includes a simulated service processing result corresponding to the target service, and the simulated service processing result is obtained by processing according to the service information;
a target service processing result determining module, configured to determine, according to the simulated service processing result in each response result set, a target service processing result corresponding to each target service;
and the first service record set obtaining module is used for obtaining a first service record set according to each target service processing result and pre-stored service information so as to store the first service record set in the block chain.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the block chain consensus method according to one of the claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the blockchain consensus method according to one of the claims 1 to 7.
CN202010200643.6A 2020-03-20 2020-03-20 Block chain consensus method, apparatus, computer device and storage medium Active CN111522874B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010200643.6A CN111522874B (en) 2020-03-20 2020-03-20 Block chain consensus method, apparatus, computer device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010200643.6A CN111522874B (en) 2020-03-20 2020-03-20 Block chain consensus method, apparatus, computer device and storage medium

Publications (2)

Publication Number Publication Date
CN111522874A true CN111522874A (en) 2020-08-11
CN111522874B CN111522874B (en) 2023-09-05

Family

ID=71901986

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010200643.6A Active CN111522874B (en) 2020-03-20 2020-03-20 Block chain consensus method, apparatus, computer device and storage medium

Country Status (1)

Country Link
CN (1) CN111522874B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112087502A (en) * 2020-08-28 2020-12-15 成都质数斯达克科技有限公司 Method, device and equipment for processing request and storage medium
CN112214780A (en) * 2020-08-26 2021-01-12 腾讯科技（深圳）有限公司 Data processing method and device, intelligent equipment and storage medium
CN112395300A (en) * 2021-01-20 2021-02-23 腾讯科技（深圳）有限公司 Data processing method, device and equipment based on block chain and readable storage medium
CN113641688A (en) * 2021-07-15 2021-11-12 北京百度网讯科技有限公司 Node updating method, related device and computer program product
CN115499379A (en) * 2022-11-14 2022-12-20 中国电子信息产业集团有限公司第六研究所 Information interaction method, device, equipment and medium based on block chain

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108182635A (en) * 2017-12-18 2018-06-19 深圳前海微众银行股份有限公司 Block chain common recognition method, system and computer readable storage medium
CN109447810A (en) * 2018-11-29 2019-03-08 杭州秘猿科技有限公司 Parallel block chain common recognition method, system, electronic equipment and computer readable storage medium
CN110570311A (en) * 2019-09-17 2019-12-13 北京海益同展信息科技有限公司 block chain consensus method, device and equipment
CN110598446A (en) * 2019-09-16 2019-12-20 腾讯科技（深圳）有限公司 Block chain based test method and device, storage medium and computer equipment
CN110633323A (en) * 2019-09-16 2019-12-31 腾讯科技（深圳）有限公司 Business data storage method, device, storage medium and computer equipment
CN111047306A (en) * 2019-12-17 2020-04-21 北京菲林方德科技有限公司 Parallel transaction processing method and device for transaction input set

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108182635A (en) * 2017-12-18 2018-06-19 深圳前海微众银行股份有限公司 Block chain common recognition method, system and computer readable storage medium
CN109447810A (en) * 2018-11-29 2019-03-08 杭州秘猿科技有限公司 Parallel block chain common recognition method, system, electronic equipment and computer readable storage medium
CN110598446A (en) * 2019-09-16 2019-12-20 腾讯科技（深圳）有限公司 Block chain based test method and device, storage medium and computer equipment
CN110633323A (en) * 2019-09-16 2019-12-31 腾讯科技（深圳）有限公司 Business data storage method, device, storage medium and computer equipment
CN110570311A (en) * 2019-09-17 2019-12-13 北京海益同展信息科技有限公司 block chain consensus method, device and equipment
CN111047306A (en) * 2019-12-17 2020-04-21 北京菲林方德科技有限公司 Parallel transaction processing method and device for transaction input set

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112214780A (en) * 2020-08-26 2021-01-12 腾讯科技（深圳）有限公司 Data processing method and device, intelligent equipment and storage medium
CN112214780B (en) * 2020-08-26 2021-06-25 腾讯科技（深圳）有限公司 Data processing method and device, intelligent equipment and storage medium
WO2022042301A1 (en) * 2020-08-26 2022-03-03 腾讯科技（深圳）有限公司 Data processing method and apparatus, smart device and storage medium
CN112087502A (en) * 2020-08-28 2020-12-15 成都质数斯达克科技有限公司 Method, device and equipment for processing request and storage medium
CN112395300A (en) * 2021-01-20 2021-02-23 腾讯科技（深圳）有限公司 Data processing method, device and equipment based on block chain and readable storage medium
CN113641688A (en) * 2021-07-15 2021-11-12 北京百度网讯科技有限公司 Node updating method, related device and computer program product
CN113641688B (en) * 2021-07-15 2024-01-09 北京百度网讯科技有限公司 Node updating method, related device and computer program product
CN115499379A (en) * 2022-11-14 2022-12-20 中国电子信息产业集团有限公司第六研究所 Information interaction method, device, equipment and medium based on block chain
CN115499379B (en) * 2022-11-14 2023-03-24 中国电子信息产业集团有限公司第六研究所 Information interaction method, device, equipment and medium based on block chain

Also Published As

Publication number Publication date
CN111522874B (en) 2023-09-05

Similar Documents

Publication Publication Date Title
CN111625593B (en) Block chain-based data processing method and device and computer equipment
CN111522874B (en) Block chain consensus method, apparatus, computer device and storage medium
CN109936457B (en) Block chain multi-party witness method, device, equipment and computer readable storage medium
CN107819828B (en) Data transmission method and device, computer equipment and storage medium
CN111556120B (en) Data processing method and device based on block chain, storage medium and equipment
CN111191294B (en) Single-node accounting method, system, equipment and storage medium based on block chain
CN112600678B (en) Data processing method, device, equipment and storage medium
CN111506584B (en) Block chain-based service data processing method and device and computer equipment
CN111314067A (en) Block storage method and device, computer equipment and storage medium
CN111930598B (en) Information processing method based on block chain and big data analysis and big data platform
CN112087439A (en) Block chain transaction query method, system, computer device and storage medium
CN110599142A (en) Data storage method and device, computer equipment and storage medium
CN109936620B (en) Block chain-based storage method, device, system and storage medium
Guo et al. RNS-based adaptive compression scheme for the block data in the blockchain for IIoT
CN108399533B (en) Transaction processing method and device, computer equipment and storage medium
CN110990790B (en) Data processing method and equipment
CN109981739A (en) Session data processing method, device, equipment and medium based on block chain
CN113259326B (en) Consensus optimization method and device based on alliance chain network and computer equipment
CN108389124B (en) Data processing method, data processing device, computer equipment and storage medium
CN114116637A (en) Data sharing method, device, equipment and storage medium
CN113157450A (en) Method and apparatus for performing blocks in a blockchain system
CN111064785B (en) Resource package downloading method, device and system
CN116896564A (en) Block generation method and device based on block chain network and computer equipment
CN111405027A (en) Block chain consensus result screening method and device, computer equipment and storage medium
CN116055403A (en) Message data transmission method, device and server

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