CN109391684A - A kind of block chain accounting nodes selection method and system being associated with related chain - Google Patents
A kind of block chain accounting nodes selection method and system being associated with related chain Download PDFInfo
- Publication number
- CN109391684A CN109391684A CN201811118855.9A CN201811118855A CN109391684A CN 109391684 A CN109391684 A CN 109391684A CN 201811118855 A CN201811118855 A CN 201811118855A CN 109391684 A CN109391684 A CN 109391684A
- Authority
- CN
- China
- Prior art keywords
- block
- hash
- chain
- book keeping
- keeping operation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of block chain accounting nodes selection methods for being associated with related chain, comprising: firstly, obtaining the first block cryptographic Hash of the first Correlation block of the first related chain outside this block chain network；Then, according to the first block cryptographic Hash, the book keeping operation Hash that this block chain network new round selects constituency block book keeping operation power is solved；Finally, according to the book keeping operation Hash and preset first mapping relations, the determining accounting nodes kept accounts with the accounting nodes to be selected that Hash matches of keeping accounts as this block.Meanwhile invention additionally discloses a kind of block chain accounting nodes for being associated with related chain to select system.The cryptographic Hash that the present invention passes through the newest block of the first related chain outside acquisition this block chain network, and according to Hash operation result, the ownership for determining the new block book keeping operation power of this block chain network reduces pure calculation power competition block chain network and needs to consume higher calculation power, reduces social resources waste.
Description
Technical field
The present invention relates to block chain field, in particular to a kind of block chain accounting nodes selection method for being associated with related chain and
System.
Background technique
Typical block chain network is to obtain book keeping operation power by calculating power competition, disadvantage is that society has been lost
Middle electric power, water resource.It is shown according to BTC.com data, it is 50.13EH/s, the whole network that bit coin the whole network at the bottom of August in this year, which calculates power,
Difficulty is about 6.73T, and it is 1500 that number of deals, which is confirmed, i.e., executable hash algorithm number per second is 5 × 1016It is secondary.Its bring is
Non-essential calculation power loss, greatly waste social resources.With the development of block chain technology, more and more fields will be answered
With block chain technology, social resources will be further consumed.
Summary of the invention
In view of a part of defect of the prior art, the technical problem to be solved by the present invention is to the block chains of existing mainstream
Network uses proof of work mechanism, and digs the waste that mine contention book keeping operation power causes social resources by calculating power.The present invention is directed to
There is provided a kind of block chain accounting nodes selection method and system for being associated with related chain, it is intended to which block chain is determined by another way
The book keeping operation of network is weighed, and the operating cost of block chain network is reduced.
To achieve the above object, the present invention provides a kind of block chain accounting nodes selection method for being associated with related chain, described
Method includes:
Obtain the first block cryptographic Hash of the first Correlation block of the first related chain outside this block chain network；Described first
Correlation block is the newest block of the confirmation of having known together on the described first related chain；The first block cryptographic Hash is described first
The block cryptographic Hash of Correlation block；
According to the first block cryptographic Hash, the book keeping operation Kazakhstan that this block chain network new round selects constituency block book keeping operation power is solved
It is uncommon；
According to the book keeping operation Hash and preset first mapping relations, the determining note to be selected to match with the book keeping operation Hash
The accounting nodes that account node is kept accounts as this block；First mapping relations are that the book keeping operation Hash and accounting nodes reflect
Penetrate relationship.
In a specific embodiment, described according to the first block cryptographic Hash, solve this block chain network new round
Select the book keeping operation Hash of constituency block book keeping operation power, further includes:
In a block period of the described first related chain, in response to newest described the first of the described first related chain
Correlation block does not change, carries out secondary Hash operation by the book keeping operation Hash of the upper block to this block chain network, obtains
Obtain the book keeping operation Hash of next block of this block chain network.
In a specific embodiment, described according to the book keeping operation Hash and preset first mapping relations, determining and institute
State the accounting nodes that the accounting nodes to be selected that book keeping operation Hash matches are kept accounts as this block, further includes:
According to the book keeping operation Hash, determining at least one optional accounting nodes to match with the book keeping operation Hash；
According to the competition results of the optional accounting nodes, the accounting nodes of this block book keeping operation are determined.
In a specific embodiment, described according to the book keeping operation Hash and preset first mapping relations, determining and institute
State the accounting nodes that the accounting nodes to be selected that book keeping operation Hash matches are kept accounts as this block, further includes:
According to the first place of the value of the book keeping operation Hash, the accounting nodes of this block book keeping operation are determined；Wherein, the note
Account Hash is M system, and it is M parts that the accounting nodes, which are preassigned,.
In a specific embodiment, first Correlation block is the preamble of the newest block on the described first related chain
N-th block.
In a specific embodiment, the first Correlation block of the first related chain obtained outside this block chain network
First block cryptographic Hash, further includes:
The master link point of at least three heterogeneous networks on chain related to described first is communicated, and obtains at least three not
With the main chain block cryptographic Hash of the first Correlation block of the main chain node of network；Wherein, the main chain number of nodes is odd number
It is a；
In all main chain block cryptographic Hash, the first block Hash described in the most conduct of number of iterations is chosen
Value.
In a specific embodiment, the method also includes:
It is changed in response to the first block cryptographic Hash of first Correlation block of the described first related chain,
In this block chain network, the block data of first Correlation block before changing and block cryptographic Hash before changing are recorded, is recorded
Block data after the first Correlation block change and the block cryptographic Hash after change.
In a specific embodiment, described according to the first block cryptographic Hash, solve this block chain network new round
Select the book keeping operation Hash of constituency block book keeping operation power, further includes:
Upper block cryptographic Hash, Merkel to the current block of the first block cryptographic Hash and this block chain network
At least one of treetop portion cryptographic Hash, timestamp carry out Hash operation, obtain this block chain network new round block book keeping operation power
The book keeping operation Hash of selection.
In the second aspect of the present invention, a kind of block chain accounting nodes selection system for being associated with related chain, the system are provided
System includes:
Related chain block Hash obtains module, for obtaining the first correlation zone of the first related chain outside this block chain network
First block cryptographic Hash of block；First Correlation block is the newest block of the confirmation of having known together on the described first related chain；
The first block cryptographic Hash is the block cryptographic Hash of first Correlation block；
Hash of keeping accounts solves module, for solving this block chain network new round and selecting according to the first block cryptographic Hash
The book keeping operation Hash of constituency block book keeping operation power；
Accounting nodes determining module, for according to the book keeping operation Hash and preset first mapping relations, determine with it is described
The accounting nodes that the accounting nodes to be selected that book keeping operation Hash matches are kept accounts as this block；First mapping relations are described
The mapping relations of book keeping operation Hash and accounting nodes.
In a specific embodiment, the book keeping operation Hash solves module, further includes:
Hash of keeping accounts iteratively solves unit, in a block period of the described first related chain, in response to described
Newest first Correlation block of first related chain does not change, passes through the note of the upper block to this block chain network
Account Hash carries out secondary Hash operation, obtains the book keeping operation Hash of next block of this block chain network.
In a specific embodiment, the accounting nodes determining module, further includes:
Optional node determination unit, for according to the book keeping operation Hash, the determining and book keeping operation Hash to match at least
One optional accounting nodes；
Optional node competitive unit determines that this block is kept accounts for the competition results according to the optional accounting nodes
Accounting nodes.
In a specific embodiment, the accounting nodes determining module, further includes:
Accounting nodes mean allocation determination unit, for according to it is described book keeping operation Hash value first place, determine this block
The accounting nodes of book keeping operation；Wherein, the book keeping operation Hash is M system, and it is M parts that the accounting nodes, which are preassigned,.
In a specific embodiment, first Correlation block is the preamble of the newest block on the described first related chain
N-th block.
In a specific embodiment, the related chain block Hash obtains module, further includes:
Multinode block Hash acquiring unit, the main chain of at least three heterogeneous networks on chain related to described first
Node is communicated, and the main chain block Hash of the first Correlation block of the main chain node of at least three heterogeneous networks is obtained
Value；Wherein, the main chain number of nodes is odd number；
It is most to choose number of iterations in all main chain block cryptographic Hash for multinode block Hash determination unit
Conduct described in the first block cryptographic Hash.
In a specific embodiment, the system also includes:
Related chain bifurcated logging modle, described for first Correlation block in response to the described first related chain
One block cryptographic Hash changes, in this block chain network, record first Correlation block block data before changing and
Block cryptographic Hash before changing, the block data after recording the first Correlation block change and the block cryptographic Hash after change.
In a specific embodiment, the book keeping operation Hash solves module, further includes:
Book keeping operation Hash based on block head solves unit, for the first block cryptographic Hash and this block chain network
The upper block cryptographic Hash of current block, Merkel treetop portion cryptographic Hash, at least one of timestamp, carry out Hash fortune
It calculates, obtains the book keeping operation Hash that selection is weighed in the book keeping operation of this block chain network new round block.
Beneficial effects of the present invention include at least in following a bit: 1), the present invention is by obtaining outside this block chain network
The first related chain (such as bit coin network) newest block cryptographic Hash, and according to Hash operation as a result, determining this block chain
The ownership of the new block book keeping operation power of network, reduces pure calculation power competition block chain network (such as bit coin) and needs to consume higher calculation
Power reduces social resources waste.2), in a scene of the invention, when the block period of the first related chain is not finished, by right
Book keeping operation Hash carries out secondary calculating and obtains new book keeping operation Hash, and related to the first chain generation period is effectively avoided unmatched to ask
Topic effectively solves the problems, such as that the first related chain block period is longer, improves the business datum book keeping operation frequency of this block chain network.
3), in an of the invention scene, several optional accounting nodes are chosen according to book keeping operation Hash, and by between optional accounting nodes into
It goes and calculates power competition, in such a way that the related chain of coupling first and calculation power competition combine, improve the stability of this block chain, and protect
It is not too high that card calculates power loss.4), pass through book keeping operation Hash and accounting nodes preset relation, fast response time, further according to note
The system number of the value of account Hash allocates accounting nodes in advance, further increases computational efficiency.5), in a scene of the invention
In, the block cryptographic Hash of the first related chain is obtained according to the main chain node of multiple and different networks, is alleviated because network delay causes
The network latency problems of first related chain common recognition.
Detailed description of the invention
Fig. 1 is the block chain accounting nodes selection method that one of embodiment of the invention is associated with related chain
Flow diagram；
Fig. 2 is a kind of area of the block chain accounting nodes selection system of association correlation chain of the embodiment of the invention
The structural schematic diagram of block chain network；
Fig. 3 is the sheet for the block chain accounting nodes selection system that one of specific embodiment of the invention is associated with related chain
The structural schematic diagram of relationship between block chain network chain block related to first.
Specific embodiment
Present invention will be further explained below with reference to the attached drawings and examples:
As shown in Figure 1-3, in the first embodiment of the invention, providing a kind of block chain accounting nodes choosing for being associated with related chain
Selection method, which is characterized in that the described method includes:
Obtain the first block cryptographic Hash of the first Correlation block of the first related chain outside this block chain network；Described first
Correlation block is the newest block of the confirmation of having known together on the described first related chain；The first block cryptographic Hash is described first
The block cryptographic Hash of Correlation block；
According to the first block cryptographic Hash, the book keeping operation Kazakhstan that this block chain network new round selects constituency block book keeping operation power is solved
It is uncommon；
According to the book keeping operation Hash and preset first mapping relations, the determining note to be selected to match with the book keeping operation Hash
The accounting nodes that account node is kept accounts as this block；First mapping relations are that the book keeping operation Hash and accounting nodes reflect
Penetrate relationship.
Optionally, the first block cryptographic Hash is this block cryptographic Hash stored on first Correlation block, optional
, the first block cryptographic Hash is to carry out Hash to the entirety or block head of first Correlation block to solve operation acquisition
's.
The Kazakhstan that this example passes through the newest block of the first related chain (such as bit coin network) outside acquisition this block chain network
Uncommon value, and according to Hash operation as a result, determining that the ownership of the new block book keeping operation power of this block chain network, the pure calculation power of reduction compete area
Block chain network (such as bit coin) needs to consume higher calculation power, reduces social resources waste.
Optionally, selection and more matched at least two accounting nodes of book keeping operation Hash, and power competition is calculated by it, so as to
Obtain the accounting nodes of this block book keeping operation.
As shown in figure 3, in the present embodiment, it is described according to the first block cryptographic Hash, it is new to solve this block chain network
One wheel selects the book keeping operation Hash of constituency block book keeping operation power, further includes:
In a block period of the described first related chain, in response to newest described the first of the described first related chain
Correlation block does not change, carries out secondary Hash operation by the book keeping operation Hash of the upper block to this block chain network, obtains
Obtain the book keeping operation Hash of next block of this block chain network.
In practical applications, the associated related chain of optional bit coin or ether mill as this block chain network；It can
Choosing, the block of related chain generates the block generation period frequency that period frequency is higher than this block chain network, then Hash pair of keeping accounts
Answer an associated block cryptographic Hash.Optionally, the block of related chain generates the area that period frequency is lower than this block chain network
Block generates period frequency, then a block cryptographic Hash corresponds to multiple book keeping operation Hash.
By taking bit coin as an example, average every 10min generates a new block, and the block of this block chain network generates the period
Frequency is higher than bit coin network, for example, average 1min generates a new block, at this point, each block of bit coin network is breathed out
Uncommon value will generate 10 book keeping operation Hash；
Optionally, this 10 book keeping operation Hash be to bit coin block cryptographic Hash respectively time and again solve cryptographic Hash obtain.
The latter book keeping operation Hash is obtained by carrying out Hash operation to previous book keeping operation Hash.
Optionally, first book keeping operation Hash is the block cryptographic Hash of bit coin network；
Optionally, first book keeping operation Hash is the cryptographic Hash of the block cryptographic Hash of bit coin network；
Optionally, in a block period of a bit coin network, the latter book keeping operation Hash has previous book keeping operation to breathe out
It is uncommon to be obtained after Hash operation.
In the present embodiment, described according to the book keeping operation Hash and preset first mapping relations, it is determining with the book keeping operation
The accounting nodes that the accounting nodes to be selected that Hash matches are kept accounts as this block, further includes:
According to the book keeping operation Hash, determining at least one optional accounting nodes to match with the book keeping operation Hash；
According to the competition results of the optional accounting nodes, the accounting nodes of this block book keeping operation are determined.
In an optional case, the first mapping relations are that accounting nodes and book keeping operation Hash foundation mapping are closed by mapping table
System.For example, accounting nodes include 10, all possible cryptographic Hash is divided into 10 parts averagely or unequal, according to book keeping operation
Hash determines the book keeping operation power ownership of this book keeping operation.For example, accounting nodes include 16, through judgement book keeping operation Hash under 16 systems
First, determine book keeping operation power.
In another example accounting nodes include 100, by the first mapping relations, 20 accounting nodes are selected, then 20
Accounting nodes are at war with calculating power competition or other competitive ways to book keeping operation power.It is noted that in order to save calculation power,
Can choose less accounting nodes to be at war with, at the same also can be avoided the interim delay machine of selected accounting nodes and cannot be into
Row book keeping operation operation.
In the present embodiment, described according to the book keeping operation Hash and preset first mapping relations, it is determining with the book keeping operation
The accounting nodes that the accounting nodes to be selected that Hash matches are kept accounts as this block, further includes:
According to the first place of the value of the book keeping operation Hash, the accounting nodes of this block book keeping operation are determined；Wherein, the note
Account Hash is M system, and it is M parts that the accounting nodes, which are preassigned,.
For example, the value of the book keeping operation Hash indicates that accounting nodes are assigned 16 parts and label, according to book keeping operation with 16 systems
The first place of the value of Hash determines the accounting nodes of this block are which parts in 16 parts of original.
It is noted that optional, first Correlation block is the newest block on the described first related chain；It is optional
, choose the accounting nodes kept accounts with the book keeping operation most matched accounting nodes of Hash as this block.
In the present embodiment, first Correlation block is the N of the preamble of the newest block on the described first related chain
A block.
Optionally, the N=6.
Since existing bit coin network is after six confirmations, it is ensured that transaction is not gone back on one's word, so, optionally,
First Correlation block can choose the 6th block relatively closed on.
In the present embodiment, the firstth area of the first Correlation block of the first related chain obtained outside this block chain network
Block cryptographic Hash, further includes:
The master link point of at least three heterogeneous networks on chain related to described first is communicated, and obtains at least three not
With the main chain block cryptographic Hash of the first Correlation block of the main chain node of network；Wherein, the main chain number of nodes is odd number
It is a；
In all main chain block cryptographic Hash, the first block Hash described in the most conduct of number of iterations is chosen
Value.
In the present embodiment, the method also includes:
It is changed in response to the first block cryptographic Hash of first Correlation block of the described first related chain,
In this block chain network, the block data of first Correlation block before changing and block cryptographic Hash before changing are recorded, is recorded
Block data after the first Correlation block change and the block cryptographic Hash after change.
Usually block chain network needs to guarantee that data maximum probability obtains whole network branch by repeatedly confirmation ability high probability
It holds, for example, bit coin, which generally requires 6 blocks, just can guarantee that data will not substantially be modified again.Then, data are still deposited
In the possibility of change, changed after causing data bifurcated due to calculation power, network in order to avoid the block chain network known together afterwards of first keeping accounts
Data, so that the block cryptographic Hash of related chain and this block chain network book keeping operation Hash mismatch, so to related bifurcated or data
Modification is recorded, to explain data.
In the present embodiment, described according to the first block cryptographic Hash, it solves this block chain network new round and selects constituency
The book keeping operation Hash of block book keeping operation power, further includes:
Upper block cryptographic Hash, Merkel to the current block of the first block cryptographic Hash and this block chain network
At least one of treetop portion cryptographic Hash, timestamp carry out Hash operation, obtain this block chain network new round block book keeping operation power
The book keeping operation Hash of selection.
In second embodiment of the invention, a kind of block chain accounting nodes selection system for being associated with related chain is provided, it is described
System includes:
Related chain block Hash obtains module 201, for obtaining the first phase of the first related chain outside this block chain network
Close the first block cryptographic Hash of block；First Correlation block is the most new district of the confirmation of having known together on the described first related chain
Block；The first block cryptographic Hash is the block cryptographic Hash of first Correlation block；
Hash of keeping accounts solves module 202, for solving this block chain network new round according to the first block cryptographic Hash
Select the book keeping operation Hash of constituency block book keeping operation power；
Accounting nodes determining module 203, for according to the book keeping operation Hash and preset first mapping relations, determining and institute
State the accounting nodes that the accounting nodes to be selected that book keeping operation Hash matches are kept accounts as this block；First mapping relations are institute
State the mapping relations of book keeping operation Hash and accounting nodes.
In the present embodiment, the book keeping operation Hash solves module 202, further includes:
Hash of keeping accounts iteratively solves unit, in a block period of the described first related chain, in response to described
Newest first Correlation block of first related chain does not change, passes through the note of the upper block to this block chain network
Account Hash carries out secondary Hash operation, obtains the book keeping operation Hash of next block of this block chain network.
In the present embodiment, the accounting nodes determining module 203, further includes:
Optional node determination unit, for according to the book keeping operation Hash, the determining and book keeping operation Hash to match at least
One optional accounting nodes；
Optional node competitive unit determines that this block is kept accounts for the competition results according to the optional accounting nodes
Accounting nodes.
In the present embodiment, the accounting nodes determining module 203, further includes:
Accounting nodes mean allocation determination unit, for according to it is described book keeping operation Hash value first place, determine this block
The accounting nodes of book keeping operation；Wherein, the book keeping operation Hash is M system, and it is M parts that the accounting nodes, which are preassigned,.
In the present embodiment, first Correlation block is the N of the preamble of the newest block on the described first related chain
A block.
In the present embodiment, the related chain block Hash obtains module 201, further includes:
Multinode block Hash acquiring unit, the main chain of at least three heterogeneous networks on chain related to described first
Node is communicated, and the main chain block Hash of the first Correlation block of the main chain node of at least three heterogeneous networks is obtained
Value；Wherein, the main chain number of nodes is odd number；
It is most to choose number of iterations in all main chain block cryptographic Hash for multinode block Hash determination unit
Conduct described in the first block cryptographic Hash.
In the present embodiment, the system also includes:
Related chain bifurcated logging modle, described for first Correlation block in response to the described first related chain
One block cryptographic Hash changes, in this block chain network, record first Correlation block block data before changing and
Block cryptographic Hash before changing, the block data after recording the first Correlation block change and the block cryptographic Hash after change.
In the present embodiment, the book keeping operation Hash solves module 202, further includes:
Book keeping operation Hash based on block head solves unit, for the first block cryptographic Hash and this block chain network
The upper block cryptographic Hash of current block, Merkel treetop portion cryptographic Hash, at least one of timestamp, carry out Hash fortune
It calculates, obtains the book keeping operation Hash that selection is weighed in the book keeping operation of this block chain network new round block.
As shown in Fig. 2, optional, above-mentioned modules are contained in the accounting management node 200 of this block chain network, note
Account management node 200 provides automatic operating for the book keeping operation power selection of this block chain network.Optionally, accounting management node 200
Accounting management intelligence contract is run, the function of the block chain accounting nodes selection system of the related chain of association of the invention is executed, this
When a kind of system comprising accounting management node 200 i.e. block chain accounting nodes choosing for being associated with related chain provided by the invention
Select system.Accounting management node 200 and the accounting nodes 300 of this block chain network constitute this block chain network, meanwhile, book keeping operation pipe
Reason node 200 can also the related chain node 100 of chain related to first communicated to obtain the first block cryptographic Hash.
The preferred embodiment of the present invention has been described in detail above.It should be appreciated that those skilled in the art without
It needs creative work according to the present invention can conceive and makes many modifications and variations.Therefore, all technologies in the art
Personnel are available by logical analysis, reasoning, or a limited experiment on the basis of existing technology under this invention's idea
Technical solution, all should be within the scope of protection determined by the claims.
Claims (10)
1. a kind of block chain accounting nodes selection method for being associated with related chain, which is characterized in that the described method includes:
Obtain the first block cryptographic Hash of the first Correlation block of the first related chain outside this block chain network；Described first is related
Block is the newest block of the confirmation of having known together on the described first related chain；The first block cryptographic Hash is described first related
The block cryptographic Hash of block；
According to the first block cryptographic Hash, the book keeping operation Hash that this block chain network new round selects constituency block book keeping operation power is solved；
According to the book keeping operation Hash and preset first mapping relations, the determining book keeping operation section to be selected to match with the book keeping operation Hash
The accounting nodes that point is kept accounts as this block；First mapping relations are the mapping pass of the book keeping operation Hash and accounting nodes
System.
2. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
According to the first block cryptographic Hash, the book keeping operation Hash that this block chain network new round selects constituency block book keeping operation power is solved, further includes:
It is related in response to newest described the first of the described first related chain in a block period of the described first related chain
Block does not change, carries out secondary Hash operation by the book keeping operation Hash of the upper block to this block chain network, obtains this
The book keeping operation Hash of next block of block chain network.
3. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
According to the book keeping operation Hash and preset first mapping relations, the determining accounting nodes to be selected to match with the book keeping operation Hash are made
For the accounting nodes of this block book keeping operation, further includes:
According to the book keeping operation Hash, determining at least one optional accounting nodes to match with the book keeping operation Hash；
According to the competition results of the optional accounting nodes, the accounting nodes of this block book keeping operation are determined.
4. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
According to the book keeping operation Hash and preset first mapping relations, the determining accounting nodes to be selected to match with the book keeping operation Hash are made
For the accounting nodes of this block book keeping operation, further includes:
According to the first place of the value of the book keeping operation Hash, the accounting nodes of this block book keeping operation are determined；Wherein, the book keeping operation is breathed out
It wishes as M system, it is M parts that the accounting nodes, which are preassigned,.
5. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
First Correlation block is the n-th block of the preamble of the newest block on the described first related chain.
6. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
Obtain the first block cryptographic Hash of the first Correlation block of the first related chain outside this block chain network, further includes:
The master link point of at least three heterogeneous networks on chain related to described first is communicated, and at least three different nets are obtained
The main chain block cryptographic Hash of first Correlation block of the main chain node of network；Wherein, the main chain number of nodes is odd number；
In all main chain block cryptographic Hash, the first block cryptographic Hash described in the most conduct of number of iterations is chosen.
7. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
Method further include:
It is changed in response to the first block cryptographic Hash of first Correlation block of the described first related chain, in local area
In block chain network, the block data of first Correlation block before changing and block cryptographic Hash before changing are recorded, described in record
Block data after the change of first Correlation block and the block cryptographic Hash after change.
8. a kind of block chain accounting nodes selection method for being associated with related chain as described in claim 1, which is characterized in that described
According to the first block cryptographic Hash, the book keeping operation Hash that this block chain network new round selects constituency block book keeping operation power is solved, further includes:
Upper block cryptographic Hash, Merkel treetop to the current block of the first block cryptographic Hash and this block chain network
At least one of portion's cryptographic Hash, timestamp carry out Hash operation, obtain the book keeping operation power selection of this block chain network new round block
Book keeping operation Hash.
9. a kind of block chain accounting nodes for being associated with related chain select system, which is characterized in that the system comprises:
Related chain block Hash obtains module, for obtaining the first Correlation block of the first related chain outside this block chain network
First block cryptographic Hash；First Correlation block is the newest block of the confirmation of having known together on the described first related chain；It is described
First block cryptographic Hash is the block cryptographic Hash of first Correlation block；
Hash of keeping accounts solves module, for solving this block chain network new round and selecting constituency according to the first block cryptographic Hash
The book keeping operation Hash of block book keeping operation power；
Accounting nodes determining module, for according to the book keeping operation Hash and preset first mapping relations, the determining and book keeping operation
The accounting nodes that the accounting nodes to be selected that Hash matches are kept accounts as this block；First mapping relations are the book keeping operation
The mapping relations of Hash and accounting nodes.
10. a kind of block chain accounting nodes for being associated with related chain as claimed in claim 9 select system, which is characterized in that institute
It states related chain block Hash and obtains module, further includes:
Multinode block Hash acquiring unit, the main chain node of at least three heterogeneous networks on chain related to described first
It is communicated, obtains the main chain block cryptographic Hash of the first Correlation block of the main chain node of at least three heterogeneous networks；Its
In, the main chain number of nodes is odd number；
Multinode block Hash determination unit chooses the most work of number of iterations in all main chain block cryptographic Hash
For the first block cryptographic Hash.
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 true CN109391684A (en) | 2019-02-26 |
| CN109391684B 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) |
Cited By (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 |
| CN115952237A (en) * | 2023-01-28 | 2023-04-11 | 北京星途探索科技有限公司 | Multi-terminal data fusion system |
Citations (5)
| 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 |
| US20180152442A1 (en) * | 2003-12-22 | 2018-05-31 | Guardtime Ip Holdings Limited | Blockchain-supported, hash tree-based digital signature infrastructure |
| 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 |
-
2018
- 2018-09-25 CN CN201811118855.9A patent/CN109391684B/en active Active
Patent Citations (5)
| 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 |
| 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 |
Cited By (3)
| 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 |
| CN115952237A (en) * | 2023-01-28 | 2023-04-11 | 北京星途探索科技有限公司 | Multi-terminal data fusion system |
| CN115952237B (en) * | 2023-01-28 | 2023-06-09 | 北京星途探索科技有限公司 | Multi-terminal data fusion system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109391684B (en) | 2021-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107169865B (en) | Asset data processing system based on block chain technology | |
| CN110493148B (en) | Block processing, block consensus and block synchronization method and device | |
| CN110321074B (en) | Consensus method for safety storage certification based on block chain and distributed storage system | |
| CN108200203B (en) | Block chain system based on double-layer network | |
| CN111177277B (en) | Data storage method, transaction storage method and device | |
| CN110399373A (en) | A kind of block chain account book storage system, storage querying method and delet method | |
| CN107301536A (en) | Resource transfers method and device | |
| CN109903049A (en) | A kind of block chain transaction data storage method, device, equipment and storage medium | |
| CN109391645A (en) | Block chain light-weight technologg method, block chain node and storage medium | |
| CN109949160A (en) | A kind of sharding method and device of block chain | |
| CN108347483B (en) | Decentralized computing system based on double-layer network | |
| CN103595805A (en) | Data placement method based on distributed cluster | |
| CN111047445B (en) | Completely decentralized side chain crossing method | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| CN109391684A (en) | A kind of block chain accounting nodes selection method and system being associated with related chain | |
| CN110471923A (en) | A kind of processing method and processing device of block chain transaction record | |
| CN109214817A (en) | A kind of block chain common recognition device based on calculation power parasitism | |
| CN113645278B (en) | Cross-chain message transmission method, device and storage medium of block chain | |
| CN109522314A (en) | Data archiving method and terminal device based on block chain | |
| CN104077634A (en) | Active-reactive type dynamic project scheduling method based on multi-objective optimization | |
| CN113886501A (en) | Block chain service module extension method based on multi-chain architecture | |
| CN109685657B (en) | Method and node device for processing transactions in a blockchain network and storage medium | |
| CN103258389B (en) | The method of self-aided terminal upload file, system and self-aided terminal | |
| CN111667264B (en) | Block data transmission method and device, electronic equipment and nonvolatile computer storage medium | |
| CN112598510A (en) | Resource data processing method and device |
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 |