CN110119947B - Method and apparatus for shared workload proof computing power generation of symbiotic blockchains - Google Patents
Method and apparatus for shared workload proof computing power generation of symbiotic blockchains Download PDFInfo
- Publication number
- CN110119947B CN110119947B CN201810124429.XA CN201810124429A CN110119947B CN 110119947 B CN110119947 B CN 110119947B CN 201810124429 A CN201810124429 A CN 201810124429A CN 110119947 B CN110119947 B CN 110119947B
- Authority
- CN
- China
- Prior art keywords
- symbiotic
- data
- chain
- block
- parent
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- 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/40—Authorisation, 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/401—Transaction verification
- G06Q20/4016—Transaction verification involving fraud or risk level assessment in transaction processing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic 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/3236—Cryptographic 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
Abstract
According to the scheme, a mother-chain mine pool acquires an identity of the symbiotic block chain and determines logic position information corresponding to each symbiotic block chain according to the identity, wherein the logic position information is used for determining the logic position of the latest block of each symbiotic block chain in the process of generating the root data abstract of all symbiotic block chains. Because the logic position of the latest block of each symbiotic block chain can be uniquely determined, the verifiable data written back to one symbiotic block chain by the parent chain mine pool can be uniquely determined, and the problem of malicious and excessive hanging of the parent chain mine pool is avoided.
Description
Technical Field
The present application relates to the field of information technology, and in particular, to a method and an apparatus for sharing workload certification computing power to generate a symbiotic block chain.
Background
The blockchain is a distributed database system participated by nodes, and the characteristics of the blockchain are that data written into the blockchain can not be tampered. It is an important concept of bitcoin, a copy of the complete bitcoin block chain, which records every transaction of its token (token). With this information we can find the value that each address has at any point in the history.
Based on the proof of work-of-work (proof-of-work) mechanism for bitcoin blockchains, the mined node always considers the longest chain as the correct one and continues to work and extend it. If two nodes broadcast new blocks with different versions at the same time, other nodes have sequential differences in the time of receiving the blocks. When this is the case, they will work on the basis of the block received first, but will also retain the other chain in case the latter becomes the longest chain. The tie (tie) breaks by waiting until the next workload proof is found, and one of the chains proves to be a longer one, then the node working on the other branch chain will switch to camp and start working on the longer chain.
Since the workload proving mechanism of the bitcoin blockchain wastes a lot of computation power, the capacity of each block is limited, and the speed of block generation is stable, it is impossible to store a lot of data in the bitcoin blockchain. In order to solve the above problems, in the prior art, a symbiotic block chain is generated by sharing the workload certification power of the existing mine pool, data is recorded by blocks in the symbiotic block chain, and the block chain corresponding to the existing mine pool is the parent chain of the symbiotic block chains. As the data content in the symbiotic block chain can be verified through the mother chain, the data content in the symbiotic block chain can be guaranteed not to be tampered.
FIG. 1 illustrates a method for sharing workload attestation computing power to generate symbiotic blockchains, the method comprising the steps of:
step S101, the symbiotic chain node provides summary information of data content needing to be written into the latest block of the symbiotic block chain to a parent chain mine pool;
step S102, the parent chain mine pool can write summary information of data content in the latest block of the symbiotic block chain as required to calculate the root data summaries of all symbiotic block chains, and the root data summaries are counted in workload certification calculation to calculate workload certification data;
step S103, if the workload proof data conforms to the difficulty of part of the symbiotic block chains, the workload proof data may be provided to the symbiotic chain node for creating the latest block of the corresponding symbiotic block chain, and at the same time, the workload proof data may also provide verifiable data that enables the summary information to be verified by the root data digest and verifiable data that enables the root data digest to be verified by all content data in the parent-chain mine pool cache region.
Step S104, after the symbiotic chain nodes obtain the workload certification data, the latest blocks of the corresponding symbiotic block chains are created, so that the latest blocks of the symbiotic block chains comprise the workload certification data, the verifiable data and other information used for verifying the symbiotic block chains by using the mother chain.
However, in an actual scenario, when the workload of sharing the parent-chain mine pool proves that the parent-chain mine pool is malicious and hangs more, the verifiable data written back to one symbiotic block chain is not unique, and therefore the resource waste of the symbiotic block chain is caused.
Content of application
It is an object of the present application to provide a method and apparatus for shared workload proof effort generation of symbiotic blockchains.
To achieve the above object, the present application provides a method for sharing workload proving computing power to generate a symbiotic blockchain, the method comprising:
the method comprises the steps that a parent chain mine pool obtains summary information of data content needing to be written into a latest block of a symbiotic block chain from a symbiotic chain node, root data summaries of all symbiotic block chains are generated according to the summary information, and workload certification calculation is carried out on the basis of the root data summaries to obtain workload certification data;
the parent chain mine pool provides to the symbiotic chain nodes the proof-of-workload data usable to create the most recent block of the symbiotic blockchain, the verifiable data that enables the summary information to be verified by the root data summary, and the verifiable data that enables the root data summary to be verified by all content data in the parent chain mine pool cache, such that the most recent block of the symbiotic blockchain created by the symbiotic chain link node includes: said workload certification data and said verifiable data; characterized in that the method further comprises:
and the parent chain mine pool acquires the identity of the symbiotic block chains from symbiotic chain nodes and determines the logical position information corresponding to each symbiotic block chain according to the identity, wherein the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstract of all symbiotic block chains, and the logical position is related to verifiable data which enables the abstract information to be verified by the root data abstract.
Further, the parent chain mine pool generates root data summaries of all symbiotic block chains according to the summary information, and the method comprises the following steps:
and the parent chain mine pool generates root data summaries of all symbiotic block chains in a Mercker tree mode according to the summary information, wherein the logic position information is used for determining the logic position of the latest block of each symbiotic block chain corresponding to a Mercker leaf node in the process of generating the root data summaries of all symbiotic block chains.
Further, the identity of the symbiotic block chain adopts an array [ N ]1,N2,…Ni]The data structure of (1) indicates that i is an integer greater than 1;
when determining that the latest block of each symbiotic block chain corresponds to the logical position of a merkel tree leaf node, the element node of the merkel tree corresponds to the array element of the identity of the symbiotic block chain, and the following rules are met:
n in identity of each symbiotic block chainkThe corresponding element node is used as N in the identity of the symbiotic block chaink-1Child nodes of the corresponding element node;
when N in the identity of any two symbiotic block chainskAt different times, form Nk-1Bifurcation of the corresponding element node as parent node, NkThe corresponding element nodes are two child nodes in the fork;
n in the identity of multiple symbiotic blockchainskWhen identical, share the same NkA corresponding element node.
The application also provides a method for sharing workload attestation computing power to generate a symbiotic blockchain, comprising:
providing summary information of data content needing to be written into the latest block of a symbiotic block chain to a parent chain mine pool by symbiotic chain nodes, so that the parent chain mine pool generates root data summaries of all symbiotic block chains according to the summary information, and carrying out workload proving calculation based on the root data summaries;
a symbiotic chain node obtains from the parent chain mine pool workload proof data usable to create a latest block of the symbiotic blockchain, verifiable data that enables the summary information to be verified by the root data summary, and verifiable data that enables the root data summary to be verified by all content data in a parent chain mine pool cache, and creates a latest block of the symbiotic blockchain, wherein the latest block includes: said workload certification data and said verifiable data; characterized in that the method further comprises:
and providing the identity of the symbiotic block chain for the parent chain mine pool by the symbiotic chain node, so that the parent chain mine pool determines the logical position information corresponding to each symbiotic block chain according to the identity, wherein the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstract of all symbiotic block chains, and the logical position is related to the verifiable data which enables the abstract information to be verified by the root data abstract.
Based on another aspect of the present application, there is also provided a parent chain mine pool for sharing workload proving productivity generation symbiotic block chains, the parent chain mine pool including:
a data transceiving module, configured to obtain, from a symbiotic chain node, summary information of data content that needs to be written into a latest block of a symbiotic block chain and an identity of the symbiotic block chain, and provide, to the symbiotic chain node, workload certification data that can be used to create the latest block of the symbiotic block chain, verifiable data that enables the summary information to be verified by the root data summary, and verifiable data that enables the root data summary to be verified by all content data in a parent-chain mine pool cache region, so that the latest block of the symbiotic block chain created by the symbiotic chain node includes: said workload certification data and said verifiable data;
and the data processing module is used for generating root data abstracts of all symbiotic block chains according to the abstract information, performing workload certification calculation based on the root data abstracts to acquire workload certification data, and determining logical position information corresponding to each symbiotic block chain according to the identity, wherein the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstracts of all symbiotic block chains, and the logical position is related to verifiable data which enables the abstract information to be verified by the root data abstracts.
Further, the data processing module is configured to generate root data summaries of all symbiotic block chains in a mercker tree manner according to the summary information, where the logical location information is used to determine a logical location of a latest block of each symbiotic block chain corresponding to a mercker leaf node in a process of generating the root data summaries of all symbiotic block chains.
Further, the identity of the symbiotic block chain adopts an array [ N ]1,N2,…Ni]The data structure of (1) indicates that i is an integer greater than 1;
when determining that the latest block of each symbiotic block chain corresponds to the logical position of a merkel tree leaf node, the element node of the merkel tree corresponds to the array element of the identity of the symbiotic block chain, and the following rules are met:
n in identity of each symbiotic block chainkThe corresponding element node is used as N in the identity of the symbiotic block chaink-1Child nodes of the corresponding element node;
when N in the identity of any two symbiotic block chainskAt different times, form Nk-1Bifurcation of the corresponding element node as parent node, NkThe corresponding element nodes are two child nodes in the fork;
n in the identity of multiple symbiotic blockchainskWhen identical, share the same NkA corresponding element node.
The present application further provides a symbiotic chain node for sharing workload proof computing power to generate a symbiotic blockchain, the symbiotic chain node comprising:
a data transceiving module, configured to provide summary information of data content to be written into a latest block of a symbiotic block chain to a parent-chain mine pool, so that the parent-chain mine pool generates root data summaries of all symbiotic block chains according to the summary information, performs workload certification calculation based on the root data summaries, provides an identity of the symbiotic block chain to the parent-chain mine pool, so that the parent-chain mine pool determines logical location information corresponding to each symbiotic block chain according to the identity, where the logical location information is used to determine a logical location of the latest block of each symbiotic block chain during generation of the root data summaries of all symbiotic block chains, the logical location is related to verifiable data that enables the summary information to be verified by the root data summaries, and acquires workload certification data that can be used to create the latest block of the symbiotic block chain from the parent-chain mine pool, Data verifiable by the root data digest and data verifiable by all content data in the parent chain mine pool cache;
a data processing module, configured to create a latest block of the symbiotic block chain, where the latest block includes: said workload certification data and said verifiable data.
In addition, this application still provides a sharing work load proves that calculation power produces female chain ore deposit pond of intergrowth block chain, and this female chain ore deposit pond includes:
a processor; and
one or more machine-readable media having machine-readable instructions stored thereon that, when executed by the processor, cause the apparatus to perform a method of sharing workload attestation computing to generate symbiotic blockchains.
The present application further provides a symbiotic chain node for sharing workload proof computing power to generate a symbiotic blockchain, the symbiotic chain node comprising:
a processor; and
one or more machine-readable media having machine-readable instructions stored thereon that, when executed by the processor, cause the apparatus to perform a method of sharing workload attestation computing to generate symbiotic blockchains.
In the scheme provided by the application, after acquiring summary information of data content to be written into the latest block of a symbiotic block chain, a parent chain mine pool can generate root data summaries of all symbiotic block chains according to the summary information, perform workload certification calculation based on the root data summaries to acquire workload certification data, further provide workload certification data which can be used for creating the latest block of the symbiotic block chain and verifiable data which enables the root data summaries to be verified by all content data in a parent chain mine pool cache region to enable the latest block of the symbiotic block chain created by the symbiotic chain link points to a symbiotic chain node, and in the above process, the parent chain mine pool can also acquire an identity of the symbiotic block chain and determine logical position information corresponding to each symbiotic block chain according to the identity, wherein, the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstracts of all symbiotic block chains. Because the logic position of the latest block of each symbiotic block chain can be uniquely determined, the verifiable data written back to one symbiotic block chain by the parent chain mine pool can be uniquely determined, and the problem of malicious and excessive hanging of the parent chain mine pool is avoided.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is a process flow diagram of an existing method for shared workload attestation computing power generation of symbiotic blockchains;
FIG. 2 is a schematic structural diagram of a system for implementing the method for sharing workload proving computing power generation symbiotic blockchains provided in the embodiments of the present application
FIG. 3 is a diagram illustrating the contents contained in a bitcoin blockchain;
FIG. 4 is a flowchart illustrating a process for sharing workload attestation computing power to generate a symbiotic blockchain in an embodiment of the present application;
fig. 5 and fig. 6 are schematic diagrams when generating root data digests of all symbiotic block chains from the summary information of the data content to be written into the latest block of the symbiotic block chain in the way of a mercker tree;
fig. 7(a) is a schematic diagram of a mercker tree representing logical positions of symbiotic block chains determined based on identities in an embodiment of the present application;
fig. 7(b) is another schematic diagram of a mercker tree representing logical positions of symbiotic block chains determined based on identities in the embodiment of the present application;
FIG. 8 is a diagram illustrating a relationship between data in a symbiotic blockchain and a parent chain according to an embodiment of the present disclosure;
fig. 9 is a schematic structural diagram of an apparatus for sharing workload proving computing power to generate a symbiotic block chain according to an embodiment of the present disclosure;
fig. 10 is a schematic structural diagram of another apparatus for sharing workload proving computing power to generate a symbiotic block chain according to an embodiment of the present disclosure;
the same or similar reference numbers in the drawings identify the same or similar elements.
Detailed Description
The present application is described in further detail below with reference to the attached figures.
In a typical configuration of the present application, the terminals, the devices serving the network each include one or more processors (CPUs), image processing units (GPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, which include both non-transitory and non-transitory, removable and non-removable media, may implement the information storage by any method or technology. The information may be computer readable instructions, data structures, program means, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
The embodiment of the application provides a method for generating a symbiotic block chain by sharing workload certification computing power, the method can generate the symbiotic block chain by sharing the workload certification computing power of a mother chain mine pool, can set an identity for each symbiotic block chain, and determines the logical position of the latest block of each symbiotic block chain by using the identity in the process of generating the symbiotic block chain, so that the uniqueness of verifiable data is ensured, and the problem of malicious and excessive hanging of the mother chain mine pool is avoided.
Figure 2 illustrates the structure of a system for implementing the above-described method of shared workload proof computation generation of symbiotic blockchains, including a parent-chain mine pool 210 and a symbiotic-chain node 220. The parent-chain ore pool is an ore pool for providing computing power for the parent chain, and is used for providing computing power required by creating blocks on one or more block chains maintained by the scheme. The symbiotic chain link points can communicate with the parent chain mine pool, and workload certification data calculated by miners in the parent chain mine pool is acquired by accessing the parent chain mine pool, so that the calculation capacity of the parent chain mine pool is shared for creating blocks on the symbiotic block chain.
In an actual scenario, the specific implementation of the parent-chain mine pool and the symbiotic chain node may be a device formed by integrating a user device, a network device, or a user device and a network device through a network, or may also be an application program running on the device. The user equipment comprises various terminal equipment such as a computer and the like; including but not limited to implementations such as a network host, a single network server, multiple sets of network servers, or a cloud-computing-based collection of computers. Here, the Cloud is made up of a large number of hosts or web servers based on Cloud Computing (Cloud Computing), which is a type of distributed Computing, one virtual computer consisting of a collection of loosely coupled computers.
Fig. 3 is a schematic diagram illustrating contents included in a bitcoin block chain, each block including a block header (block header), where the block header may include the following information:
version, version number;
a prev hash, i.e. a hash value generated based on the content of the previous block on the block chain;
timestamp, the time the block was generated;
nonce, a random number, a mechanism for implementing workload attestation;
difficulty, target difficulty, difficulty that the workload of the block proves to be in line with;
merkle Root, Root hash, hash value of Root of Merkle Tree (Merkle Tree) corresponding to the content data recorded in the block.
Each block also contains a content data portion in which each data block Tx can be used to store data, for example, transaction information of the currency corresponding to the block chain, etc. can be recorded in the data blocks. The writable data capacity in the current bitcoin blockchain is very limited, which greatly limits the application of the blockchain in storing the evidence data. And finally generating a Merkle Root in the data blocks in a Merkle Tree mode for verifying the correctness of the content in each data block.
The block chain for generating new blocks based on a workload certification mechanism (PoW) comprises the following basic steps: the node monitors the data record of the whole network, and the data record passing the basic validity verification is temporarily stored; the node consumes self computing power to try different random numbers, performs appointed hash calculation, and continuously repeats the process until a reasonable random number is found; after finding out a reasonable random number, generating new block information, firstly inputting block header information, and then inputting data recording information; and then broadcasting a newly generated block outwards, connecting the newly generated block into a block chain after the verification of other nodes is passed, adding one to the height of the main chain, and then switching all the nodes to the new block and continuing to perform workload certification and block generation. The verification node needs to continuously consume the computing power to perform the hash calculation so as to find the expected random number. Taking the bitcoin blockchain as an example, the overall operation and security of the blockchain are maintained through a PoW mechanism. The node contends for the accounting right of the bitcoin block chain through random hash operation, prevents fraudulent transactions and avoids 'double payment', and the process needs to be completed by consuming electric power and computing power. Thus, the verification node is also referred to as a "miner" and the random number calculation lookup process is referred to as "mining".
Fig. 4 shows a processing flow of the parent-chain mine pool 210 and the symbiotic-chain node 220 when shared workload proving computing power generates a symbiotic blockchain in the embodiment of the present application, which includes the following processing steps:
in step S401, the symbiotic link node provides summary information of data content to be written into the latest block of the symbiotic blockchain to the parent-chain mine pool. Since the symbiotic blockchain needs to be verified based on the mother chain, the data content in the blocks needs to be related to the content of the blocks in the mother chain, so that a root data summary derived from the data content which needs to be written into the latest blocks of the symbiotic blockchain can be included in the workload proving calculation of the mother chain. In the process of generating the root data abstract by deriving the data content which needs to be written into the latest block of the symbiotic block chain, in order to avoid overlarge data and ensure that verification can be performed, hash calculation can be performed on the content data, and the abstract information is generated and then provided to the mine pool.
When the symbiotic chain node sends the summary information of the data content, the identity identification of the symbiotic block chain is carried at the same time, and the identity information can be used for determining the logic position information corresponding to each symbiotic block chain, so that the logic position of the latest block of each symbiotic block chain is uniquely determined in the process of generating the root data summary of all symbiotic block chains.
Step S402, the parent chain mine pool can write summary information of data content in the latest block of the symbiotic block chain according to needs to calculate the root data summary of all symbiotic block chains, and the root data summary is included in workload certification calculation to calculate workload certification data. Because there are generally a plurality of symbiotic block chains, each symbiotic block chain may have data to be written in, so summary information corresponding to the symbiotic block chains is available in the parent-chain mine pool, and the summary information can be subjected to hash calculation to calculate the root data summary of all symbiotic block chains.
In an actual scene, when hash calculation is performed on content data to obtain digest information and hash calculation is performed on the digest information to obtain a root data digest, a merkel tree (merkle tree) mode can be adopted to facilitate verification and calculation.
For the mother chain, the Root data digests of all symbiotic block chains are also used as a part of data content in the latest block needing to be written into the mother chain, so that when the mother chain mine pool calculates workload certification data, random number Nonce is continuously tried, and hash calculation is performed by combining the Merkle Root containing the data content of the Root data digests of all symbiotic block chains and information such as prev hash, version number, timesample, difficulity and the like, so that the result of the hash calculation meets the target difficulty of the mother chain. In the process, the information corresponding to the block header (block header) of any block can be considered as proof that the mining machine participates in the mother chain, namely, workload proof data. Of course, the use of the bitcoin block chain block header in the present application is only an example of the data that can be used as the workload certification data, and any certification information that can be used to measure the mining machine participating in the operation of the master chain in an actual scenario can be used as a feasible workload certification data.
Step S403, if the workload proves that the data conforms to the difficulty of part of the symbiotic block chains, the parent-chain mine pool may be provided to a symbiotic chain node for creating the latest block of the corresponding symbiotic block chain, and at the same time, may also provide verifiable data. Wherein the verifiable data comprises verifiable data which enables the summary information to be verified by the root data summary and verifiable data which enables the root data summary to be verified by all the content data in the parent-chain mine pool cache region.
Step S404, after the symbiotic chain node obtains the workload certification data, it creates the latest block of the corresponding symbiotic block chain, so that the latest block of the symbiotic block chain includes the workload certification data and the verifiable data, which are used to verify the symbiotic block chain by using the parent chain.
Because the verifiable data is related to the root data abstracts of all symbiotic block chains in the generation process, if the verifiable data cannot be uniquely determined according to the abstract data, the verifiable data cannot be uniquely determined, so that the malicious excessive hanging of the parent chain mine pool cannot be avoided. In the scheme of the embodiment of the application, in the process that the parent-chain mine pool calculates the root data summary of all symbiotic block chains according to the summary information written into the data content in the latest block of the symbiotic block chains as required, the parent-chain mine pool can determine the logical position information corresponding to each symbiotic block chain according to the identity, and then uniquely determine the logical position of the latest block of each symbiotic block chain according to the logical position information.
In an embodiment of the application, if the summary information is used to generate the root data summaries of all symbiotic block chains in a mercker tree manner when the root data summaries of all symbiotic block chains are generated according to the summary information, the data content of the latest block of each symbiotic block chain corresponds to a mercker leaf node, that is, the logical position information is used to uniquely determine the logical position of the latest block of each symbiotic block chain corresponding to the mercker leaf node in the process of generating the root data summaries of all symbiotic block chains. In the embodiment of the present application, an element node of a merkel tree refers to a data element on the merkel tree, and may be a leaf node, a root node, a parent node, a child node, and the like according to a position relationship of different element nodes in the merkel tree, which is different from a concept of a symbiotic chain node.
Based on the mercker tree way, the verifiable data which enables the root data summary to be verified by all the content data in the parent chain mine pool cache region can at least comprise the proof information of the summary information corresponding to each symbiotic block chain when the root data summary is generated. The summary information is obtained based on the data content of the latest block of a certain symbiotic block chain at the current time and is recorded as mm hash. For example, the hash value of the data content of the latest block of a certain block chain at the current time is MR, and when the digest information is determined, the MR may be directly used as the mm hash, or the mm hash may be obtained by performing hash operation on the MR, or the mm hash may be obtained by performing hash operation on the derived data of the previous block chain after being combined with the MR. At this time, the proof information of the summary information corresponding to each symbiotic blockchain when generating the root data summary may be mb (branch information of merkle branch, mercker tree) of the summary information corresponding to the symbiotic blockchain in the process of generating the root data summary. Similarly, the summary information may be verified by the root data summary, or may be a merkle branch of the summary information of the data content of the latest block of each symbiotic block chain in the process of generating the root data summary.
Fig. 5 shows a schematic diagram of generating root data digests of all symbiotic block chains from the digest information of the data content that needs to be written to the latest block of the symbiotic block chain in the manner of a mercker tree. Assuming that there are 8 symbiotic block chains, the data contents of the corresponding latest blocks are respectively data 1-8, the summary information of the data contents can be obtained by hash calculation and is recorded as mm hash 1-8, and when the parent chain mine pool generates the root data summary mr in a merkel tree mode, the logical positions of the mm hash 1-8 as merkel tree leaf nodes can be shown in fig. 5. At this time, for symbiotic block chain1 (corresponding to mm hash1), its corresponding certification information may be [ mm hash2, hash34, hash5678 ]. However, in an actual scenario, if the logical positions of the mm hashes 1-8 are changed when the parent-chain mine ponds generate the root data digests mr, for example, as shown in fig. 6, the positions of the mm hash1 and the mm hash2 are exchanged compared to fig. 5, the root data digests mr generated through hash calculation will be different, and the corresponding certification information will also be changed to [ mm hash6, hash78, hash5234 ]. This results in non-unique verifiable data being returned to the symbiotic blockchain 1.
In the scheme provided by the embodiment of the application, because the identity of each symbiotic block chain is added, the logical position information determined by the identity can be used for uniquely determining the logical position of the latest block of each symbiotic block chain corresponding to the node of the mercker leaf in the process of generating the root data digests of all symbiotic block chains, so that the logical position of the mother-chain mine pool in the mercker tree cannot be changed in the process of generating the root data digests mr according to the digest information mm hashes 1-8, and therefore mm hashes 1-8 can only serve as the leaf nodes of the mercker tree according to the logical positions shown in fig. 5, and the proof information is guaranteed not to change and can only be [ mm hash2, hash34 and hash5678 ].
In some scenarios, because the identity of the symbiotic block chains is not determined and managed by the parent-chain mine pool, if the digital ID is directly used as the identity of each symbiotic block chain, collision may occur, resulting in confusion of logical positions of the symbiotic block chains. Therefore, in the embodiment of the present application, the identity of the symbiotic block chain is an array [ N ]1,N2,…Ni]The data structure of (1) indicates that i is an integer greater than 1, that is, the identity is represented by a multidimensional array, and for the convenience of description in this embodiment, each element in the array is represented by a positive integer in the 10 th system.
Based on the above form of identity, when determining that the latest block of each symbiotic block chain corresponds to the logical position of a tacl leaf node, the element node of the tacl tree corresponds to the array element of the symbiotic block chain identity, and the following rules are met: 1. n in identity of each symbiotic block chainkThe corresponding element node is used as N in the identity of the symbiotic block chaink-1Child nodes of the corresponding element node; 2. when N in the identity of any two symbiotic block chainskAt different times, form Nk-1Bifurcation of the corresponding element node as parent node, NkThe corresponding element nodes are two child nodes in the fork; 3. n in the identity of multiple symbiotic blockchainskWhen identical, share the same NkA corresponding node.
For example, the identities of 8 symbiotic blockchains are respectively as follows:
| symbiotic block chain | Identity label |
| Chain1 | [1,1,1,1] |
| Chain2 | [1,1,1,2] |
| Chain3 | [1,1,1,3] |
| Chain4 | [1,2,2,1] |
| Chain5 | [1,2,2,2] |
| Chain6 | [1,2,3,1] |
| Chain7 | [1,3,1,1] |
| Chain8 | [1,3,2,4] |
Based on the above rules, a merkel tree as shown in fig. 7(a) can be formed, and first, the first elements of the identities of the symbiotic block chains are all 1, and then, the first element corresponds to the element node 1a of the first layer. The second elements identified by chain1, chain4 and chain7 are respectively 1, 2 and 3, a bifurcation with an element node 1a as a parent node is formed, the child nodes in the bifurcation are respectively element nodes 2a, 2b and 2c corresponding to the second elements 1, 2 and 3, the second elements identified by chain1, chain2 and chain3 are all 1, the second elements identified by the element nodes 2a, chain4, chain5 and chain6 of the second layer are all 2, the second elements identified by the element nodes 2b, chain7 and chain8 of the second layer are all 3, and the element node 2c of the second layer is shared. By analogy, a leaf node of the fourth layer may be determined, and 8 leaf nodes of the fourth layer correspond to the latest tiles of the 8 symbiotic tile chains. The method can uniquely determine the logic position of the latest block of each symbiotic block chain corresponding to the node of the Mercker leaf, and simultaneously, as the identity identifier adopts an array form, the root data abstract can be conveniently generated layer by layer in a Mercker tree mode, so that the calculation efficiency of the root data abstract is improved, and the condition of identity identifier collision is not easy to occur.
When leaf nodes corresponding to chain 1-chain 8 are determined based on the rules, because the leaf nodes are determined layer by layer according to array elements of the identity of the symbiotic block chain, for chain6, chain7 and chain8, because element nodes on corresponding merkel trees do not form branches after the third layer, chain6, chain7 and chain8 can be distinguished when the nodes are calculated to the third layer. In order to reduce the amount of computation, for this case, it is not necessary to determine its logical position based on the fourth array element in its id, but only to construct a merkel tree as shown in fig. 7(b), where the leaf nodes of the merkel tree correspond to the logical positions of chain 1-chain 8.
Meanwhile, the above method is also convenient for accessing a scene directly using numbers as the identity, for example, the first element of the array can be used as the identity for the external as a block chain, and a rule for searching and distributing data layer by layer can be maintained for the internal, and the data of each symbiotic block chain is determined according to the rule. FIG. 8 shows the relationship between data in the symbiotic blockchain and the parent chain when the above approach is used.
In an actual scenario, when determining the logical location information based on the identification information, any function for distinguishing locations may be adopted, and the logical location information is represented by a value of the function to determine the logical location. The value of the function may be highly related to the array elements in the identity array, the random number, and the merkel tree, for example, the following function may be used:
f(Nk,Nonce,h)＝{[(N×1103515245+12345)+Ni]×1103515245+12345}mod(2h)，
wherein N iskRepresents the kth element in the array, Nonce represents a random number, and h represents the height of the merkel tree. Thus, each symbiotic blockchain can represent its logical location with a value, facilitating computation and processing.
Based on the same inventive concept, the embodiment of the present application further provides a device for sharing workload proof computing power to generate a symbiotic block chain, the method corresponding to the device is the method in the foregoing embodiment, and the principle of solving the problem is similar to that of the method, and details are not repeated here.
Fig. 9 shows an apparatus 900 capable of implementing shared workload certification computation to generate a symbiotic blockchain according to an embodiment of the present application, where the apparatus includes a data transceiver module 910 and a data processing module 920, which may be used as a parent-chain mine pool and a symbiotic chain node in the present solution. The specific implementation of the method can be a user device, a network device or a device formed by integrating the user device and the network device through a network, or can also be an application program running on the device. The user equipment comprises various terminal equipment such as a computer and the like; including but not limited to implementations such as a network host, a single network server, multiple sets of network servers, or a cloud-computing-based collection of computers. Here, the Cloud is made up of a large number of hosts or web servers based on Cloud Computing (Cloud Computing), which is a type of distributed Computing, one virtual computer consisting of a collection of loosely coupled computers.
When the device 900 is used as a parent chain mine pool, the data transceiver module 910 is configured to obtain summary information of data content that needs to be written into a latest block of a symbiotic block chain and an identity of the symbiotic block chain from a symbiotic chain node, provide, to the symbiotic chain node, workload certification data that can be used to create the latest block of the symbiotic block chain, and verifiable data that enables the root data summary to be verified by all content data in a parent chain mine pool cache region, so that the latest block of the symbiotic block chain created by the symbiotic chain node includes: said workload certification data and said verifiable data.
The data processing module 920 is configured to generate root data digests of all symbiotic block chains according to the digest information, perform workload certification calculation based on the root data digests to obtain workload certification data, and determine logical location information corresponding to each symbiotic block chain according to the identity, where the logical location information is used to determine a logical location of a latest block of each symbiotic block chain in a process of generating the root data digests of all symbiotic block chains, and the logical location is related to verifiable data that enables the digest information to be verified by the root data digests.
Further, the data processing module 920 may generate root data digests of all symbiotic block chains in a mercker tree manner according to the digest information, where the logical location information is used to determine a logical location of a latest block of each symbiotic block chain corresponding to a mercker leaf node in a process of generating the root data digests of all symbiotic block chains.
The identity of the symbiotic block chain adopts an array [ N ]1,N2,…Ni]The data structure of (1) indicates that i is an integer greater than 1;
when determining that the latest block of each symbiotic block chain corresponds to the logical position of a merkel tree leaf node, the element node of the merkel tree corresponds to the array element of the identity of the symbiotic block chain, and the following rules are met:
n in identity of each symbiotic block chainkCorresponding elementThe node is used as N in the identity label of the symbiotic block chaink-1Child nodes of the corresponding element node;
when N in the identity of any two symbiotic block chainskAt different times, form Nk-1Bifurcation of the corresponding element node as parent node, NkThe corresponding element nodes are two child nodes in the fork;
n in the identity of multiple symbiotic blockchainskWhen identical, share the same NkA corresponding element node.
When the device 900 is used as a symbiotic chain node, the data transceiver module 910 is configured to provide, to a parent-chain mine pool, summary information of data content that needs to be written into the latest block of a symbiotic block chain, so that the parent-chain mine pool generates root data summaries of all symbiotic block chains according to the summary information, performs workload certification calculation based on the root data summaries, and provides, to the parent-chain mine pool, an identity of the symbiotic block chain, so that the parent-chain mine pool determines logical location information corresponding to each symbiotic block chain according to the identity, where the logical location information is used to determine a logical location of the latest block of each symbiotic block chain in a process of generating the root data summaries of all symbiotic block chains, and the logical location is related to verifiable data that enables the summary information to be verified by the root data; and obtaining from the parent chain mine pool workload proof data that can be used to create the symbiotic blockchain newest block and verifiable data that enables the root data summary to be verified by all content data in the parent chain mine pool cache;
the data processing module 920 is configured to create a latest block of the symbiotic block chain, where the latest block includes: said workload certification data and said verifiable data.
To sum up, in the scheme of the embodiment of the present application, the parent-chain mine pool further acquires the identity of the symbiotic block chains, and determines logical position information corresponding to each symbiotic block chain according to the identity, where the logical position information is used to determine the logical position of the latest block of each symbiotic block chain in the process of generating the root data summaries of all the symbiotic block chains. Because the logic position of the latest block of each symbiotic block chain can be uniquely determined, the verifiable data written back to one symbiotic block chain by the parent chain mine pool can be uniquely determined, and the problem of malicious and excessive hanging of the parent chain mine pool is avoided.
In addition, the array-form identity is adopted, the logic positions of the leaf nodes of the Mercker tree are corresponding to the identity identifiers, the logic positions of the latest blocks of each symbiotic block chain corresponding to the nodes of the Mercker tree leaves can be uniquely determined through the method, meanwhile, the array-form identity identifiers are adopted, root data summaries can be conveniently generated layer by layer in the Mercker tree mode, the calculation efficiency of the root data summaries is improved, and the situation of identity identifier collision is not prone to occurring.
In addition, some of the present application may be implemented as a computer program product, such as computer program instructions, which when executed by a computer, may invoke or provide methods and/or techniques in accordance with the present application through the operation of the computer. Program instructions which invoke the methods of the present application may be stored on a fixed or removable recording medium and/or transmitted via a data stream on a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions. Herein, an embodiment according to the present application includes an apparatus as shown in fig. 10, which includes one or more machine-readable media 1010 storing machine-readable instructions and a processor 1020 for executing the machine-readable instructions, wherein when the machine-readable instructions are executed by the processor, the apparatus is enabled to perform the method and/or technical solution according to the embodiments of the present application as a parent chain mine pool or a symbiotic chain node.
It should be noted that the present application may be implemented in software and/or a combination of software and hardware, for example, implemented using Application Specific Integrated Circuits (ASICs), general purpose computers or any other similar hardware devices. In one embodiment, the software programs of the present application may be executed by a processor to implement the above steps or functions. Likewise, the software programs (including associated data structures) of the present application may be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Additionally, some of the steps or functions of the present application may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Claims (10)
1. A method of sharing workload proof computing power to generate a symbiotic blockchain, the method comprising:
the method comprises the steps that a parent chain mine pool obtains summary information of data content needing to be written into a latest block of a symbiotic block chain from a symbiotic chain node, root data summaries of all symbiotic block chains are generated according to the summary information, and workload certification calculation is carried out on the basis of the root data summaries to obtain workload certification data;
the parent chain mine pool provides to the parent chain node workload proof data usable to create the most recent chunk of the symbiotic blockchain, verifiable data that enables the summary information to be verified by the root data summary, and verifiable data that enables the root data summary to be verified by all content data in the parent chain mine pool cache, such that the most recent chunk of the symbiotic blockchain includes: said workload certification data and said verifiable data; characterized in that the method further comprises:
and the parent chain mine pool acquires the identity of the symbiotic block chains from symbiotic chain nodes and determines the logical position information corresponding to each symbiotic block chain according to the identity, wherein the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstract of all symbiotic block chains, and the logical position is related to verifiable data which enables the abstract information to be verified by the root data abstract.
2. The method of claim 1, wherein generating, by a parent-chain mine pool, a root data summary of all symbiotic blockchains according to the summary information comprises:
and the parent chain mine pool generates root data summaries of all symbiotic block chains in a Mercker tree mode according to the summary information, wherein the logic position information is used for determining the logic position of the latest block of each symbiotic block chain corresponding to a Mercker leaf node in the process of generating the root data summaries of all symbiotic block chains.
3. The method of claim 2, wherein the identity of the co-existing blockchain employs an array [ N ]1,N2,…Ni]The data structure of (1) indicates that i is an integer greater than 1;
when determining that the latest block of each symbiotic block chain corresponds to the logical position of a merkel tree leaf node, the element node of the merkel tree corresponds to the array element of the identity of the symbiotic block chain, and the following rules are met:
n in identity of each symbiotic block chainkThe corresponding element node is used as N in the identity of the symbiotic block chaink-1Child nodes of the corresponding element node;
when N in the identity of any two symbiotic block chainskAt different times, form Nk-1Correspond toAs a bifurcation of the parent node, NkThe corresponding element nodes are two child nodes in the fork;
n in the identity of multiple symbiotic blockchainskWhen identical, share the same NkA corresponding element node.
4. A method of sharing workload proof computing power to generate a symbiotic blockchain, the method comprising:
providing summary information of data content needing to be written into the latest block of a symbiotic block chain to a parent chain mine pool by symbiotic chain nodes, so that the parent chain mine pool generates root data summaries of all symbiotic block chains according to the summary information, and carrying out workload proving calculation based on the root data summaries;
a symbiotic chain node obtains from the parent chain mine pool workload proof data usable to create a latest block of the symbiotic blockchain, verifiable data that enables the summary information to be verified by the root data summary, and verifiable data that enables the root data summary to be verified by all content data in a parent chain mine pool cache, and creates a latest block of the symbiotic blockchain, wherein the latest block includes: said workload certification data and said verifiable data; characterized in that the method further comprises:
and providing the identity of the symbiotic block chain for the parent chain mine pool by the symbiotic chain node, so that the parent chain mine pool determines the logical position information corresponding to each symbiotic block chain according to the identity, wherein the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstract of all symbiotic block chains, and the logical position is related to the verifiable data which enables the abstract information to be verified by the root data abstract.
5. A parent chain mine pool for shared workload proof computing power generation symbiotic block chains, the parent chain mine pool comprising:
a data transceiving module, configured to obtain summary information of data content that needs to be written into a latest block of a symbiotic block chain and an identity of the symbiotic block chain from a symbiotic chain node, and provide, to the symbiotic chain node, workload certification data that can be used to create the latest block of the symbiotic block chain, verifiable data that enables the summary information to be verified by a root data summary, and verifiable data that enables the root data summary to be verified by all content data in a parent-chain mine pool cache region, so that the latest block of the symbiotic block chain created by the symbiotic chain node includes: said workload certification data and said verifiable data;
and the data processing module is used for generating root data abstracts of all symbiotic block chains according to the abstract information, performing workload certification calculation based on the root data abstracts to acquire workload certification data, and determining logical position information corresponding to each symbiotic block chain according to the identity, wherein the logical position information is used for determining the logical position of the latest block of each symbiotic block chain in the process of generating the root data abstracts of all symbiotic block chains, and the logical position is related to verifiable data which enables the abstract information to be verified by the root data abstracts.
6. The parent-chain mine pool according to claim 5, wherein the data processing module is configured to generate root data digests of all symbiotic block chains in a Mercker tree manner according to the digest information, and wherein the logical location information is configured to determine a logical location of a latest block of each symbiotic block chain corresponding to a Mercker leaf node in the process of generating the root data digests of all symbiotic block chains.
7. The parent chain mine pond of claim 6, wherein the identity of the symbiotic blockchains adopts an array [ N ]1,N2,…Ni]The data structure of (1) indicates that i is an integer greater than 1;
when determining that the latest block of each symbiotic block chain corresponds to the logical position of a merkel tree leaf node, the element node of the merkel tree corresponds to the array element of the identity of the symbiotic block chain, and the following rules are met:
n in identity of each symbiotic block chainkThe corresponding element node is used as N in the identity of the symbiotic block chaink-1Child nodes of the corresponding element node;
when N in the identity of any two symbiotic block chainskAt different times, form Nk-1Bifurcation of the corresponding element node as parent node, NkThe corresponding element nodes are two child nodes in the fork;
n in the identity of multiple symbiotic blockchainskWhen identical, share the same NkA corresponding element node.
8. A symbiotic chain node for shared workload proof computing generation of a symbiotic blockchain, the symbiotic chain node comprising:
a data transceiving module, configured to provide summary information of data content that needs to be written into a latest block of a symbiotic block chain to a parent-chain mine pool, so that the parent-chain mine pool generates root data summaries of all symbiotic block chains according to the summary information, performs workload certification calculation based on the root data summaries, provides an identity of the symbiotic block chain to the parent-chain mine pool, so that the parent-chain mine pool determines logical location information corresponding to each symbiotic block chain according to the identity, where the logical location information is used to determine a logical location of the latest block of each symbiotic block chain in a process of generating the root data summaries of all symbiotic block chains, and obtains verifiable data that can be used to create the latest block of the symbiotic block chain, enable the summary information to be verified by the root data summary, and enable the root data summary to be verified by verifiable data in a cache region of the parent-chain mine pool Verifiable data with content data verification;
a data processing module, configured to create a latest block of the symbiotic block chain, where the latest block includes: the workload certification data and the verifiable data, the logical location being associated with verifiable data that enables the summary information to be verified by the root data summary.
9. A parent chain mine pool for sharing workload-proving computing power to produce a symbiotic blockchain, the parent chain mine pool comprising:
a processor; and
one or more machine-readable media having machine-readable instructions stored thereon that, when executed by the processor, cause the apparatus to perform the method of any of claims 1-3.
10. A symbiotic link node for sharing workload proof computing power to generate a symbiotic blockchain, the symbiotic blockchain node comprising:
a processor; and
one or more machine-readable media having machine-readable instructions stored thereon that, when executed by the processor, cause the apparatus to perform the method of claim 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810124429.XA CN110119947B (en) | 2018-02-07 | 2018-02-07 | Method and apparatus for shared workload proof computing power generation of symbiotic blockchains |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810124429.XA CN110119947B (en) | 2018-02-07 | 2018-02-07 | Method and apparatus for shared workload proof computing power generation of symbiotic blockchains |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110119947A CN110119947A (en) | 2019-08-13 |
| CN110119947B true CN110119947B (en) | 2021-08-10 |
Family
ID=67519678
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810124429.XA Active CN110119947B (en) | 2018-02-07 | 2018-02-07 | Method and apparatus for shared workload proof computing power generation of symbiotic blockchains |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110119947B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI706346B (en) * | 2019-10-31 | 2020-10-01 | 鴻海精密工業股份有限公司 | Mining machine, storage medium, and method for limiting calculation power of mining machine |
| CN111339203B (en) * | 2020-02-28 | 2023-07-14 | 北京金和网络股份有限公司 | Block chain data acquisition method, device and system |
| CN113206851B (en) * | 2021-05-06 | 2022-04-05 | 杭州复杂美科技有限公司 | Parallel chain consensus method, computer device, and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107038639A (en) * | 2017-03-07 | 2017-08-11 | 杭州公链网络技术有限公司 | A kind of alliance's chain building method of compatible many Asset Type fast transactions |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| CN107807951A (en) * | 2017-09-18 | 2018-03-16 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101780635B1 (en) * | 2016-04-28 | 2017-09-21 | 주식회사 코인플러그 | Method for creating, registering, revoking certificate information and server using the same |
-
2018
- 2018-02-07 CN CN201810124429.XA patent/CN110119947B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107038639A (en) * | 2017-03-07 | 2017-08-11 | 杭州公链网络技术有限公司 | A kind of alliance's chain building method of compatible many Asset Type fast transactions |
| CN107657438A (en) * | 2017-09-18 | 2018-02-02 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
| CN107807951A (en) * | 2017-09-18 | 2018-03-16 | 联动优势科技有限公司 | A kind of block chain generation method, data verification method, node and system |
Non-Patent Citations (1)
| Title |
|---|
| "区块链技术:架构及进展";邵奇峰 等;《计算机学报》;20180531;第41卷(第5期);第969-988页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110119947A (en) | 2019-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106897348B (en) | Data storage method, data verification method, data source tracing method and equipment | |
| Guerraoui et al. | The consensus number of a cryptocurrency | |
| CN109034809B (en) | Block chain generation method and device, block chain node and storage medium | |
| CN107577427B (en) | data migration method, device and storage medium for blockchain system | |
| CN110868440B (en) | Block chain male chain | |
| TWI753346B (en) | Block chain-based housing information storage certificate, application method and device | |
| EP3678346A1 (en) | Blockchain smart contract verification method and apparatus, and storage medium | |
| US20210049715A1 (en) | Blockchain-based data procesing method, apparatus, and electronic device | |
| CN108171601B (en) | Block chain source tracing method, device and system | |
| CN110009338B (en) | Accounting method and device based on block chain and electronic equipment | |
| US20220050887A1 (en) | Blockchain-based infringement detection method, apparatus, and electronic device | |
| US11762839B2 (en) | Search method using data structure for supporting multiple search in blockchain-based IoT environment, and device according to method | |
| CN109255056B (en) | Data reference processing method, device, equipment and storage medium of block chain | |
| TWI714414B (en) | Method and device for obtaining block chain data in stages | |
| US20230315891A1 (en) | Transaction data processing method and apparatus, computer device and storage medium | |
| CN110119947B (en) | Method and apparatus for shared workload proof computing power generation of symbiotic blockchains | |
| CN110032598B (en) | Method and device for updating field and electronic equipment | |
| US20210160069A1 (en) | Blockchain system, registration terminal, approval terminal, smart contract registration method, and smart contract registration program | |
| CN109934712B (en) | Account checking method and account checking device applied to distributed system and electronic equipment | |
| US11816069B2 (en) | Data deduplication in blockchain platforms | |
| CN109242676B (en) | Block issuing method and device and electronic equipment | |
| CN111782551B (en) | Test method and device for block chain item and computer equipment | |
| CN109829076B (en) | Method and equipment for generating block chain | |
| CN114529415A (en) | Transaction verification method and device based on block chain and electronic equipment | |
| CN112291321B (en) | Service processing method, device and system |
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 |