CN109391684B - Block chain accounting node selection method and system for associated related chain - Google Patents
Block chain accounting node selection method and system for associated related chain Download PDFInfo
- Publication number
- CN109391684B CN109391684B CN201811118855.9A CN201811118855A CN109391684B CN 109391684 B CN109391684 B CN 109391684B CN 201811118855 A CN201811118855 A CN 201811118855A CN 109391684 B CN109391684 B CN 109391684B
- Authority
- CN
- China
- Prior art keywords
- block
- accounting
- hash
- chain
- node
- 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
-
- 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
-
- 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
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- 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
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1023—Server selection for load balancing based on a hash applied to IP addresses or costs
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a block chain accounting node selection method associated with a related chain, which comprises the following steps: firstly, acquiring a first block hash value of a first relevant block of a first relevant chain outside a local block chain network; then, according to the first block hash value, solving the accounting hash of the accounting right of the new selected block of the block chain network; and finally, determining the accounting nodes to be selected matched with the accounting hash as the accounting nodes of the block accounting according to the accounting hash and a preset first mapping relation. Meanwhile, the invention also discloses a system for selecting the block chain accounting node associated with the related chain. According to the invention, the hash value of the latest block of the first related chain outside the block chain network is obtained, and the attribution of the accounting right of the new block of the block chain network is determined according to the hash operation result, so that the higher computing power consumption of the purely-computing competitive block chain network is reduced, and the social resource waste is reduced.
Description
Technical Field
The invention relates to the field of block chains, in particular to a block chain accounting node selection method and a block chain accounting node selection system for related chains.
Background
The typical block chain network obtains the accounting right through the calculation competition, and the disadvantage is that the electric power and water resources in the real society are lost. Com data shows that the total calculation power of Biguo coins at the end of eight months of this year is 50.13EH/s, the total network difficulty is about 6.73T, and the number of unacknowledged transactions is 1500, i.e. the number of executable hash algorithms per second is 5 × 1016Next, the process is carried out. It brings unnecessary labor loss and greatly wastes social resources. With the development of the blockchain technology, more and more fields will apply the blockchain technology, and social resources will be further consumed.
Disclosure of Invention
In view of a part of defects in the prior art, the invention aims to solve the technical problem that the existing mainstream block chain network adopts a workload proving mechanism and wastes social resources by striving to mine and contend for accounting rights. The invention aims to provide a method and a system for selecting block chain accounting nodes associated with related chains, and aims to determine the accounting right of a block chain network in another mode and reduce the operation cost of the block chain network.
In order to achieve the above object, the present invention provides a method for selecting a block chain accounting node associated with a correlation chain, where the method includes:
acquiring a first block hash value of a first relevant block of a first relevant chain outside a block chain network; the first correlation block is the latest block which is identified commonly on the first correlation chain; the first block hash value is the block hash value of the first related block;
according to the first block hash value, solving the accounting hash of the accounting right of the new selected block of the block chain network;
determining a to-be-selected accounting node matched with the accounting hash as an accounting node of the block accounting according to the accounting hash and a preset first mapping relation; the first mapping relation is the mapping relation between the accounting hash and the accounting node.
In an embodiment, the solving the accounting hash of the accounting right of the new selected block in the blockchain network according to the first block hash value further includes:
and in a block period of the first correlation chain, in response to that the latest first correlation block of the first correlation chain is not changed, performing secondary hash operation on the accounting hash of the last block of the block chain network to obtain the accounting hash of the next block of the block chain network.
In a specific embodiment, the determining, according to the accounting hash and a preset first mapping relationship, a to-be-selected accounting node matched with the accounting hash as an accounting node for the block accounting further includes:
determining at least one optional accounting node matched with the accounting hash according to the accounting hash;
and determining the accounting node for accounting the block according to the competition result of the selectable accounting node.
In a specific embodiment, the determining, according to the accounting hash and a preset first mapping relationship, a to-be-selected accounting node matched with the accounting hash as an accounting node for the block accounting further includes:
determining the accounting node of the block accounting according to the first position of the accounting hash value; wherein the accounting hash is an M-ary system, and the accounting nodes are pre-distributed into M shares.
In one embodiment, the first associated block is an nth block of a preamble of a last block in the first associated chain.
In an embodiment, the obtaining a first chunk hash value of a first relevant chunk of a first relevant chain outside the local chunk chain network further includes:
communicating with main chain nodes of at least three different networks on the first related chain to obtain main chain block hash values of first related blocks of the main chain nodes of the at least three different networks; the number of the main chain links is odd;
and selecting the block hash value with the largest repetition number from all the main chain block hash values as the first block hash value.
In a specific embodiment, the method further comprises:
in response to the change of the first block hash value of the first related block of the first related chain, recording the block data before the change and the block hash value before the change of the first related block, and recording the block data after the change and the block hash value after the change of the first related block in the local block chain network.
In an embodiment, the solving the accounting hash of the accounting right of the new selected block in the blockchain network according to the first block hash value further includes:
and performing hash operation on the first block hash value and at least one of the last block hash value, the top hash value and the timestamp of the current block of the block chain network to obtain the accounting hash of the new round of block accounting right selection of the block chain network.
In a second aspect of the invention, there is provided a system for block chain accounting node selection associated with a correlation chain, the system comprising:
a relevant chain block hash obtaining module, configured to obtain a first block hash value of a first relevant block of a first relevant chain outside a local block chain network; the first correlation block is the latest block which is identified commonly on the first correlation chain; the first block hash value is the block hash value of the first related block;
the accounting hash solving module is used for solving accounting hash of the accounting right of a new selected block of the block chain network according to the first block hash value;
the accounting node determining module is used for determining a to-be-selected accounting node matched with the accounting hash as an accounting node of the block accounting according to the accounting hash and a preset first mapping relation; the first mapping relation is the mapping relation between the accounting hash and the accounting node.
In a specific embodiment, the accounting hash solving module further includes:
and the accounting hash iterative solving unit is used for responding to the latest first relevant block of the first relevant chain not to be changed in one block period of the first relevant chain, and performing secondary hash operation on the accounting hash of the last block of the block chain network to obtain the accounting hash of the next block of the block chain network.
In a specific embodiment, the accounting node determining module further includes:
an optional node determining unit, configured to determine, according to the accounting hash, at least one optional accounting node matching the accounting hash;
and the optional node competition unit is used for determining the accounting node for accounting the block at this time according to the competition result of the optional accounting node.
In a specific embodiment, the accounting node determining module further includes:
the accounting node average distribution determining unit is used for determining the accounting node accounting in the block according to the head of the accounting hash value; wherein the accounting hash is an M-ary system, and the accounting nodes are pre-distributed into M shares.
In one embodiment, the first associated block is an nth block of a preamble of a last block in the first associated chain.
In an embodiment, the correlation chain block hash obtaining module further includes:
a multi-node block hash acquisition unit, configured to communicate with main chain nodes of at least three different networks on the first related chain, and acquire main chain block hash values of a first related block of the main chain nodes of the at least three different networks; the number of the main chain links is odd;
and the multi-node block hash determining unit selects the block hash value with the largest number of repetitions from all the main chain block hash values as the first block hash value.
In a specific embodiment, the system further comprises:
and the related chain branching recording module is used for responding to the change of the first block hash value of the first related block of the first related chain, recording block data before the change of the first related block and the block hash value before the change of the first related block, and recording the block data after the change of the first related block and the block hash value after the change of the first related block in the local block chain network.
In a specific embodiment, the accounting hash solving module further includes:
and the accounting hash solving unit is used for performing hash operation on the first block hash value and at least one of the last block hash value, the top hash value of the Mercker tree and the timestamp of the current block of the block chain network to obtain the accounting hash selected by the new round of block accounting right of the block chain network.
The beneficial effects of the invention at least comprise one of the following: 1) the invention determines the attribution of the accounting right of the new block of the block chain network by acquiring the hash value of the latest block of the first related chain (such as a bitcoin network) outside the block chain network and according to the hash operation result, thereby reducing the high computing power required by the purely computing competitive block chain network (such as the bitcoin network) and reducing the social resource waste. 2) In one scenario of the invention, when the block period of the first related chain is not finished, the new accounting hash is obtained by performing secondary calculation on the accounting hash, so that the problem of mismatching with the generation period of the first related chain is effectively avoided, the problem of long block period of the first related chain is effectively solved, and the accounting frequency of the service data of the block chain network is improved. 3) In the scenario of the invention, a plurality of selectable accounting nodes are selected according to the accounting hash, and the selectable accounting nodes are subjected to computing competition, and a mode of combining the coupling of the first correlation chain and the computing competition is adopted, so that the stability of the block chain is improved, and the computing loss is not too high. 4) Through the relation preset between the accounting hash and the accounting node, the response speed is high, the accounting node is further pre-distributed according to the system number of the value of the accounting hash, and the calculation efficiency is further improved. 5) In one scenario of the present invention, the block hash value of the first correlation chain is obtained according to the main chain nodes of a plurality of different networks, so as to alleviate the problem of network delay caused by network delay and common recognition of the first correlation chain.
Drawings
FIG. 1 is a flow diagram illustrating a method for block chain accounting node selection associated with a dependency chain in accordance with an embodiment of the present invention;
FIG. 2 is a block chain network of a block chain accounting node selection system associated with a correlation chain according to an embodiment of the present invention;
fig. 3 is a schematic diagram of the relationship between the blockchain network of the blockchain accounting node selection system associated with the correlation chain and the first correlation chain block according to an embodiment of the present invention.
Detailed Description
The invention is further illustrated by the following examples in conjunction with the accompanying drawings:
in a first embodiment of the present invention, as shown in fig. 1-3, there is provided a method for selecting a block chain accounting node associated with a correlation chain, the method comprising:
acquiring a first block hash value of a first relevant block of a first relevant chain outside a block chain network; the first correlation block is the latest block which is identified commonly on the first correlation chain; the first block hash value is the block hash value of the first related block;
according to the first block hash value, solving the accounting hash of the accounting right of the new selected block of the block chain network;
determining a to-be-selected accounting node matched with the accounting hash as an accounting node of the block accounting according to the accounting hash and a preset first mapping relation; the first mapping relation is the mapping relation between the accounting hash and the accounting node.
Optionally, the first block hash value is a local block hash value stored in the first relevant block, and optionally, the first block hash value is obtained by performing a hash solution operation on the whole or a block header of the first relevant block.
In the embodiment, the hash value of the latest block of the first related link (such as a bitcoin network) outside the blockchain network is obtained, and the attribution of the accounting right of the new block of the blockchain network is determined according to the hash operation result, so that the higher computing power required by the purely computing competitive blockchain network (such as the bitcoin network) is reduced, and the social resource waste is reduced.
Optionally, at least two accounting nodes that are more matched with the accounting hash are selected and competed with each other by the calculation, so as to obtain the accounting node of the block accounting.
As shown in fig. 3, in this embodiment, the solving the accounting hash of the accounting right of the new selected chunk in the local blockchain network according to the first chunk hash value further includes:
and in a block period of the first correlation chain, in response to that the latest first correlation block of the first correlation chain is not changed, performing secondary hash operation on the accounting hash of the last block of the block chain network to obtain the accounting hash of the next block of the block chain network.
In practical application, the optional bitcoin or ether house is used as an associated related chain of the local blockchain network; optionally, the block generation cycle frequency of the correlation chain is higher than that of the local block chain network, and the accounting hash corresponds to an associated block hash value. Optionally, if the block generation cycle frequency of the related chain is lower than that of the local block chain network, one block hash value corresponds to multiple accounting hashes.
Taking bitcoin as an example, a new block is generated every 10min on average, and the block generation cycle frequency of the blockchain network is higher than that of the bitcoin network, for example, a new block is generated every 1min on average, and at this time, each block hash value of the bitcoin network generates 10 accounting hashes;
optionally, the 10 accounting hashes are obtained by solving the bit currency block hash values respectively and progressively. Namely, the former accounting hash is subjected to hash operation to obtain the latter accounting hash.
Optionally, the first accounting hash is a block hash value of the bitcoin network;
optionally, the first accounting hash is a hash value of a block hash value of the bitcoin network;
optionally, in a block period of a bitcoin network, the last accounting hash of the next accounting hash is obtained after hash operation.
In this embodiment, the determining, according to the accounting hash and a preset first mapping relationship, a to-be-selected accounting node matched with the accounting hash as an accounting node for accounting the block of this time further includes:
determining at least one optional accounting node matched with the accounting hash according to the accounting hash;
and determining the accounting node for accounting the block according to the competition result of the selectable accounting node.
In an optional case, the first mapping relationship establishes a mapping relationship for the billing node and the billing hash through a mapping table. For example, the accounting nodes comprise 10 nodes, all possible hash values are divided into 10 parts on average or unevenly, and accounting right attribution of the accounting at this time is determined according to the accounting hash. For example, the accounting node includes 16 nodes, and the accounting right is determined by judging the first bit of the accounting hash under the 16-ary system.
As another example, the number of the accounting nodes includes 100, 20 accounting nodes are selected through the first mapping relationship, and then 20 accounting nodes compete for the accounting right in a competitive or other competitive manner. It is worth mentioning that in order to save effort, fewer accounting nodes can be selected for competition, and meanwhile, the phenomenon that the selected accounting nodes are temporarily down and cannot perform accounting operation can be avoided.
In this embodiment, the determining, according to the accounting hash and a preset first mapping relationship, a to-be-selected accounting node matched with the accounting hash as an accounting node for accounting the block of this time further includes:
determining the accounting node of the block accounting according to the first position of the accounting hash value; wherein the accounting hash is an M-ary system, and the accounting nodes are pre-distributed into M shares.
For example, the value of the accounting hash is expressed in 16-ary, the accounting node is assigned with 16 shares and labels, and the accounting node of the current block is determined to be which of the original 16 shares according to the first bit of the value of the accounting hash.
It should be noted that, optionally, the first related block is the latest block on the first related chain; optionally, the accounting node most matched with the accounting hash is selected as the accounting node of the block accounting.
In this embodiment, the first related block is an nth block of a preamble of a latest block on the first related chain.
Optionally, N is 6.
Since the transaction is not regressed after six confirmations in the existing bitcoin network, the 6 th block adjacent to the first relevant block can be selected as an alternative.
In this embodiment, the obtaining a first chunk hash value of a first relevant chunk of a first relevant chain outside the local blockchain network further includes:
communicating with main chain nodes of at least three different networks on the first related chain to obtain main chain block hash values of first related blocks of the main chain nodes of the at least three different networks; the number of the main chain links is odd;
and selecting the block hash value with the largest repetition number from all the main chain block hash values as the first block hash value.
In this embodiment, the method further includes:
in response to the change of the first block hash value of the first related block of the first related chain, recording the block data before the change and the block hash value before the change of the first related block, and recording the block data after the change and the block hash value after the change of the first related block in the local block chain network.
Usually, the blockchain network needs to be confirmed for many times to ensure that the data has a high probability of being supported by the whole network, for example, a bitcoin generally needs 6 blocks to ensure that the data is not substantially modified again. Then, the possibility of data change still exists, so that the data change after data forking caused by calculation and network in the block chain network which is acknowledged after accounting is carried out, and the block hash value of the relevant chain is not matched with the accounting hash of the block chain network, so that the relevant forking or data modification is recorded, and the data is explained.
In this embodiment, the solving the accounting hash of the accounting right of the new selected block of the local blockchain network according to the first block hash value further includes:
and performing hash operation on the first block hash value and at least one of the last block hash value, the top hash value and the timestamp of the current block of the block chain network to obtain the accounting hash of the new round of block accounting right selection of the block chain network.
In a second embodiment of the present invention, there is provided a system for block chain accounting node selection associated with a correlation chain, the system comprising:
a relevant chain block hash obtaining module 201, configured to obtain a first block hash value of a first relevant block of a first relevant chain outside the local block chain network; the first correlation block is the latest block which is identified commonly on the first correlation chain; the first block hash value is the block hash value of the first related block;
the accounting hash solving module 202 is configured to solve accounting hashes of accounting weights of a new selected block in the blockchain network according to the first block hash value;
the accounting node determining module 203 is configured to determine, according to the accounting hash and a preset first mapping relationship, a to-be-selected accounting node matched with the accounting hash as an accounting node of the current block accounting; the first mapping relation is the mapping relation between the accounting hash and the accounting node.
In this embodiment, the accounting hash solving module 202 further includes:
and the accounting hash iterative solving unit is used for responding to the latest first relevant block of the first relevant chain not to be changed in one block period of the first relevant chain, and performing secondary hash operation on the accounting hash of the last block of the block chain network to obtain the accounting hash of the next block of the block chain network.
In this embodiment, the accounting node determining module 203 further includes:
an optional node determining unit, configured to determine, according to the accounting hash, at least one optional accounting node matching the accounting hash;
and the optional node competition unit is used for determining the accounting node for accounting the block at this time according to the competition result of the optional accounting node.
In this embodiment, the accounting node determining module 203 further includes:
the accounting node average distribution determining unit is used for determining the accounting node accounting in the block according to the head of the accounting hash value; wherein the accounting hash is an M-ary system, and the accounting nodes are pre-distributed into M shares.
In this embodiment, the first related block is an nth block of a preamble of a latest block on the first related chain.
In this embodiment, the correlation chain block hash obtaining module 201 further includes:
a multi-node block hash acquisition unit, configured to communicate with main chain nodes of at least three different networks on the first related chain, and acquire main chain block hash values of a first related block of the main chain nodes of the at least three different networks; the number of the main chain links is odd;
and the multi-node block hash determining unit selects the block hash value with the largest number of repetitions from all the main chain block hash values as the first block hash value.
In this embodiment, the system further includes:
and the related chain branching recording module is used for responding to the change of the first block hash value of the first related block of the first related chain, recording block data before the change of the first related block and the block hash value before the change of the first related block, and recording the block data after the change of the first related block and the block hash value after the change of the first related block in the local block chain network.
In this embodiment, the accounting hash solving module 202 further includes:
and the accounting hash solving unit is used for performing hash operation on the first block hash value and at least one of the last block hash value, the top hash value of the Mercker tree and the timestamp of the current block of the block chain network to obtain the accounting hash selected by the new round of block accounting right of the block chain network.
As shown in fig. 2, the aforementioned modules are optionally included in the accounting management node 200 of the blockchain network, and the accounting management node 200 provides an automated operation for the accounting right selection of the blockchain network. Optionally, the accounting management node 200 runs an accounting management intelligent contract to perform the function of the block chain accounting node selection system associated with the relevant chain of the present invention, and at this time, the system including the accounting management node 200 is also the block chain accounting node selection system associated with the relevant chain provided by the present invention. The accounting management node 200 and the accounting node 300 of the local blockchain network form the local blockchain network, and meanwhile, the accounting management node 200 communicates with the related link node 100 of the first related link to obtain the first block hash value.
The foregoing detailed description of the preferred embodiments of the invention has been presented. It should be understood that numerous modifications and variations could be devised by those skilled in the art in light of the present teachings without departing from the inventive concepts. Therefore, the technical solutions available to those skilled in the art through logic analysis, reasoning and limited experiments based on the prior art according to the concept of the present invention should be within the scope of protection defined by the claims.
Claims (9)
1. A method of block chain billing node selection in association with a correlation chain, the method comprising:
acquiring a first block hash value of a first relevant block of a first relevant chain outside a block chain network; the first correlation block is the latest block which is identified commonly on the first correlation chain; the first block hash value is the block hash value of the first related block;
according to the first block hash value, solving the accounting hash of the accounting right of the new selected block of the block chain network;
determining a to-be-selected accounting node matched with the accounting hash as an accounting node of the block accounting according to the accounting hash and a preset first mapping relation; the first mapping relation is the mapping relation between the accounting hash and the accounting node;
wherein, according to the accounting hash and a preset first mapping relation, determining a to-be-selected accounting node matched with the accounting hash as an accounting node of the current block accounting, further comprising:
determining at least one optional accounting node matched with the accounting hash according to the accounting hash;
and determining the accounting node for accounting the block according to the competition result of the selectable accounting node.
2. The method as claimed in claim 1, wherein said solving the accounting hash of the new round of block chain selected block accounting right of the local block chain network according to the first block hash value further comprises:
and in a block period of the first correlation chain, in response to that the latest first correlation block of the first correlation chain is not changed, performing secondary hash operation on the accounting hash of the last block of the block chain network to obtain the accounting hash of the next block of the block chain network.
3. The method as claimed in claim 1, wherein the step of determining the accounting node to be selected, which matches the accounting hash, as the accounting node of the current block accounting according to the accounting hash and a preset first mapping relationship further comprises:
determining the accounting node of the block accounting according to the first position of the accounting hash value; wherein the accounting hash is an M-ary system, and the accounting nodes are pre-distributed into M shares.
4. The method of claim 1, wherein the first related block is an nth block of a preamble of a latest block in the first related chain.
5. The method as claimed in claim 1, wherein said obtaining the first chunk hash value of the first relevant chunk of the first relevant chain outside the local blockchain network further comprises:
communicating with main chain nodes of at least three different networks on the first related chain to obtain main chain block hash values of first related blocks of the main chain nodes of the at least three different networks; the number of the main chain links is odd;
and selecting the block hash value with the largest repetition number from all the main chain block hash values as the first block hash value.
6. A method of block chain accounting node selection in association with a correlation chain as claimed in claim 1, wherein the method further comprises:
in response to the change of the first block hash value of the first related block of the first related chain, recording the block data before the change and the block hash value before the change of the first related block, and recording the block data after the change and the block hash value after the change of the first related block in the local block chain network.
7. The method as claimed in claim 1, wherein said solving the accounting hash of the new round of block chain selected block accounting right of the local block chain network according to the first block hash value further comprises:
and performing hash operation on the first block hash value and at least one of the last block hash value, the top hash value and the timestamp of the current block of the block chain network to obtain the accounting hash of the new round of block accounting right selection of the block chain network.
8. A system for block chain accounting node selection associated with a correlation chain, the system comprising:
a relevant chain block hash obtaining module, configured to obtain a first block hash value of a first relevant block of a first relevant chain outside a local block chain network; the first correlation block is the latest block which is identified commonly on the first correlation chain; the first block hash value is the block hash value of the first related block;
the accounting hash solving module is used for solving accounting hash of the accounting right of a new selected block of the block chain network according to the first block hash value;
the accounting node determining module is used for determining a to-be-selected accounting node matched with the accounting hash as an accounting node of the block accounting according to the accounting hash and a preset first mapping relation; the first mapping relation is the mapping relation between the accounting hash and the accounting node;
wherein, the accounting node determining module further comprises:
an optional node determining unit, configured to determine, according to the accounting hash, at least one optional accounting node matching the accounting hash;
and the optional node competition unit is used for determining the accounting node for accounting the block at this time according to the competition result of the optional accounting node.
9. The system for blockchain accounting node selection in association with a correlation chain of claim 8 wherein the correlation chain blockchain hash acquisition module further comprises:
a multi-node block hash acquisition unit, configured to communicate with main chain nodes of at least three different networks on the first related chain, and acquire main chain block hash values of a first related block of the main chain nodes of the at least three different networks; the number of the main chain links is odd;
and the multi-node block hash determining unit selects the block hash value with the largest number of repetitions from all the main chain block hash values as the first block hash value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811118855.9A CN109391684B (en) | 2018-09-25 | 2018-09-25 | Block chain accounting node selection method and system for associated related chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811118855.9A CN109391684B (en) | 2018-09-25 | 2018-09-25 | Block chain accounting node selection method and system for associated related chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109391684A CN109391684A (en) | 2019-02-26 |
| CN109391684B true CN109391684B (en) | 2021-04-23 |
Family
ID=65419025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811118855.9A Active CN109391684B (en) | 2018-09-25 | 2018-09-25 | Block chain accounting node selection method and system for associated related chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109391684B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114638604A (en) * | 2022-03-22 | 2022-06-17 | 成都质数斯达克科技有限公司 | Financial service charging method and device based on block chain |
| CN115952237B (en) * | 2023-01-28 | 2023-06-09 | 北京星途探索科技有限公司 | Multi-terminal data fusion system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107146087A (en) * | 2017-04-11 | 2017-09-08 | 广东网金控股股份有限公司 | A kind of quick common recognition bookkeeping methods and system based on block chain alliance chain |
| CN107566124A (en) * | 2017-08-24 | 2018-01-09 | 深圳市易成自动驾驶技术有限公司 | Common recognition method for building up, block catenary system and storage medium based on lottery mechanism |
| CN108182581A (en) * | 2017-12-29 | 2018-06-19 | 北京欧链科技有限公司 | A kind of bookkeeping methods and device of block chain |
| CN108259235A (en) * | 2018-01-04 | 2018-07-06 | 杭州复杂美科技有限公司 | A kind of block chain accounting nodes selection method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180152442A1 (en) * | 2003-12-22 | 2018-05-31 | Guardtime Ip Holdings Limited | Blockchain-supported, hash tree-based digital signature infrastructure |
-
2018
- 2018-09-25 CN CN201811118855.9A patent/CN109391684B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107146087A (en) * | 2017-04-11 | 2017-09-08 | 广东网金控股股份有限公司 | A kind of quick common recognition bookkeeping methods and system based on block chain alliance chain |
| CN107566124A (en) * | 2017-08-24 | 2018-01-09 | 深圳市易成自动驾驶技术有限公司 | Common recognition method for building up, block catenary system and storage medium based on lottery mechanism |
| CN108182581A (en) * | 2017-12-29 | 2018-06-19 | 北京欧链科技有限公司 | A kind of bookkeeping methods and device of block chain |
| CN108259235A (en) * | 2018-01-04 | 2018-07-06 | 杭州复杂美科技有限公司 | A kind of block chain accounting nodes selection method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109391684A (en) | 2019-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109639521B (en) | Block chain performance testing method, device, equipment and storage medium | |
| CN110059834A (en) | Electric power O&M method, system and terminal device | |
| CN108011741B (en) | Method and system for simulating and testing blockchains of distributed networks | |
| CN110866825A (en) | Public link-based block chain information storage method and system | |
| CN109391684B (en) | Block chain accounting node selection method and system for associated related chain | |
| CN101710866B (en) | Method for selecting and setting super node of network | |
| CN107274159A (en) | A kind of accounting system and method that algorithm is concurrently performed based on block | |
| CN102855185B (en) | Pair-wise test method based on priority | |
| CN110224427B (en) | Information physical system modeling method based on micro-grid energy control strategy | |
| CN109325028A (en) | A kind of reconciliation file verification method and terminal device | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| CN110930254A (en) | Data processing method, device, terminal and medium based on block chain | |
| CN105471893B (en) | A kind of distributed equivalent data flow connection method | |
| CN110505084B (en) | Block chain packing node consensus electing method | |
| CN108880909A (en) | A kind of network energy-saving method and device based on intensified learning | |
| WO2022148199A1 (en) | Method for selecting digital currency in hardware wallet and hardware wallet | |
| CN112395298B (en) | Data consistency management system based on data layering thought | |
| CN110069565A (en) | A kind of method and device of distributed data base batch data processing | |
| CN112598510A (en) | Resource data processing method and device | |
| CN117391148A (en) | Convolution calculation unit, AI operation array and related equipment | |
| CN109308605B (en) | Electronic time capsule management method and system based on block chain | |
| CN110069527A (en) | A kind of GPU and CPU isomery accelerated method of data base-oriented | |
| CN113131971B (en) | Networking transmission method and system of power line carrier communication gateway device based on IPv6 | |
| CN106550387B (en) | A kind of wireless sensor network routing layer QoS evaluating method | |
| CN108874456A (en) | A kind of generation method of server software, device, equipment and storage medium |
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 |