CN109544334A - A kind of network scalability block chain implementation method - Google Patents
A kind of network scalability block chain implementation method Download PDFInfo
- Publication number
- CN109544334A CN109544334A CN201811231480.7A CN201811231480A CN109544334A CN 109544334 A CN109544334 A CN 109544334A CN 201811231480 A CN201811231480 A CN 201811231480A CN 109544334 A CN109544334 A CN 109544334A
- Authority
- CN
- China
- Prior art keywords
- transaction
- network
- fragment
- block
- prestige
- 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
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Technology Law (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The embodiment of the invention discloses a kind of network scalability block chain implementation method, the implementation method includes: fragment synchronous with leader's election, the common recognition based on fragment leader, credit rating mechanism and global synchronization algorithm.The embodiment of the present invention proposes the structure of parallel-chain, transaction and common recognition is separated into two chains, to improve the scalability of block chain network；Common recognition part is carried out in prestige chain, and prestige chain network pays close attention to safety, and the high speed transaction of transaction chain network is supported with speed appropriate；Every advantage based on credit rating mechanism, the embodiment of the present invention proposes the network sharding method based on credit rating mechanism, the leader that node that is honest and haveing excellent performance has bigger probability to become fragment after network slice, to realize the safety for not reducing block chain network while network high-throughput.
Description
Technical field
The present invention relates to block chain technical fields, and in particular to a kind of network scalability block chain implementation method.
Background technique
Block chain is distribution account book system disclosed in one, by multiple participants by common recognition mechanism safeguard jointly it is a set of
Account book.By taking bit coin system as an example, any one of whole world electronic computer need not be authorized, and can access bit coin network；Often
The unified public account book backup of the complete the whole network of one all another part of bit coin node, records all bit coin Transaction Informations,
Any one node carries out transaction and requires each node of synchronizing information to network kind, and the account book on all nodes can
It verifies the behavior of this transaction and timely updates.In block chain network, the distribution for power of keeping accounts is the side by mechanism of knowing together
Formula carries out.Relatively common block chain common recognition mechanism includes that proof of work (POW), equity prove modes such as (POS) at present,
Middle proof of work (POW) calculates the random number for meeting rule, obtains epicycle Hash operation and by way of enumerating
The book keeping operation in period is weighed, and all nodes store together after the whole network verifying.The advantages of proof of work (POW) is complete decentralization,
All-network node can arbitrarily pass in and out network；The disadvantage is that needing to consume a large amount of computing resource to obtain book keeping operation power, reach altogether
The period of knowledge is longer, can not be extensive commercial.
Equity proves that (POS) is also a kind of method of very representational distribution book keeping operation power at present, and network node is producing
While raw new block book keeping operation, the address of oneself is attached in block network, it was demonstrated that its corresponding equity specific gravity occupied, node are same
When with the corresponding private key in the address to the block information sign, to prove that it possesses the corresponding assets in the address really.If
The equity that one people occupies in network kind is more, then he will more energetically safeguard the normal of network under the hypothesis of rational bubbles
Operation, therefore for a long time apparently, the expectation book keeping operation power ratio of a node, the equity that should be occupied with it is in equal proportions.Equity
The shortcomings that proof, is it is also obvious that this centralization that will lead to network first is inclined to；Secondly, current equity proves that mechanism can not support
Imperial to calculate power attack, the fewer user of an equity can largely calculate power by investment and obtain the note for being much higher than its equity ratio
Account power.
Since the public block chain scalability of tradition is very weak, trading processing is slow, to user experience bring it is many not
Just.
Summary of the invention
The embodiment of the present invention is designed to provide a kind of network scalability block chain implementation method, to solve tradition
The public very weak technical problem of block chain network scalability.
To achieve the above object, described the embodiment of the invention provides a kind of network scalability block chain implementation method
Implementation method, which includes: all verifying nodes, will be assigned in different groups at the beginning of each round knows together the period and is formed
Several fragments；Each fragment is according to the prestige integral of corresponding group interior joint generated by historical behavior with the election of positively related probability
It leads out；Transaction initiator sends transaction to the responsible fragment for handling the transaction, what the subsequent districting operation was led based on fragment
Common recognition synchronized algorithm, generates transaction block and prestige block；Based on the behavior for all verifiers that know together, all-network verifies node
Prestige scoring calculating is carried out by credit rating mechanism and is reached common understanding for reputation；It scores to calculate in prestige and complete
Afterwards, network verification node generates the prestige block using common signature, and the prestige block includes prestige scoring, has confirmed that
Transaction block lists, previous prestige block and common signature；And when each knows together end cycle, each fragment group is raw
At a state block, the record of trade block chain and prestige block chain is packaged, subsequent network verification node is based on coming from institute
There is the state block of fragment, the credit value for synchronizing and updating storage starts next common recognition period after terminating.
Preferably, it is described verifying node using it is previous common recognition the period state block cryptographic Hash come generate random number from
And randomness is introduced, it then verifies node and is randomized to either in each fragment.
Preferably, in the election mechanism of the leader, higher than the verifying node that prestige integrates sequence median with prestige product
Positively related probability is divided to lead as fragment.
Preferably, every transaction has unique identification, input UTXO list and output UTXO list；All-network verifying section
Point sends transaction to the fragment for being responsible for input UTXO, and exports the UTXO listed in these transaction.
Preferably, it in the common recognition synchronized algorithm based on fragment leader, for fragment i, is removed for verifying transaction id
It is the transaction of i after adding 1 with the remainder of fragment group number.
Preferably for trading in piece, the common recognition synchronized algorithm based on fragment leader includes: that the leader in piece will wrap
List signature containing transaction id is sent to the node in all；Each network verification node checks the transaction in transaction List Table
ID is simultaneously determined to receive, is refused or can not confirm the transaction；Network verification node passes to piece after their decision is signed
Interior leader；Leader generates transaction block after the decision for collecting verifying node, which includes all-network verifier's
The signature of signature and leader；Each network verification node checks the information of Correlation block；If it exceeds half is verified
Node sounds an alarm, then leader will be removed out network in piece, while the fragment regenerates leader；When several transaction
Block generates, and does not receive alarm, and network verification node will calculate the credit value of respective nodes, generates letter after common signature
Praise block.
It trades preferably for across piece, in the common recognition synchronized algorithm based on fragment leader, input fragment arranges transaction
Table and transaction determine that list is sent to relevant output fragment and other input fragment.
Preferably, the transaction of the network verification node determines that list includes multiple signatures, and each signature is for signing
The a subset of transaction List Table, the transaction in a subset are sent to identical output fragment to reduce bandwidth cost.
Preferably, the common recognition synchronized algorithm based on fragment leader is by the way of parallel processing, if different friendships
It does not conflict with one another easily, then by the parallel processing transaction in different blocks；The method of the parallel processing includes: each transaction column
Table, transaction determine list and block of trading includes the number of iterations for being used to indicate the wheel common recognition period；And leader is once from net
The All Activity that network verifying node receives previous round determines, so that it may send new transaction List Table.
Preferably, the formula that the prestige scoring calculates are as follows:
Wherein, l is the number of transaction of generation after previous credit rating period prestige block；T (j) is the friendship of transaction j
Easy volume；S (j) is the zoom factor of transaction j, for differently rewarding or punishing the behavior of verifying node；The prestige scoring meter
It is that different zoom factors is arranged in different behaviors in calculation, the punishment of dishonest conduct is made to be greater than the reward of dishonest behavior, for
" unknown " decision, network verification node, which will not both obtain reputation, will not lose reputation.
The embodiment of the present invention has the advantages that
1) embodiment of the present invention proposes the structure of parallel-chain, transaction and common recognition is separated into two chains, to improve block chain
The scalability of network；Common recognition part is carried out in prestige chain, and prestige chain network pays close attention to safety, is supported and is traded with speed appropriate
The high speed of chain network is traded；
2) embodiment of the present invention is enhanced the safety of block chain network using credit rating mechanism and improves excitation, is based on
On the one hand the prestige common recognition mechanism of node history performance filters out the honest and excellent network node of process performance, while giving it
More expectation networks contributions and reward；On the other hand it is easier to find potential Web Grafiti person and malicious node and timely
Rejected network, it is ensured that the safety of block chain network.
3) based on every advantage of credit rating mechanism, the embodiment of the present invention proposes the network based on credit rating mechanism point
Piece method, the network leader that node that is honest and haveing excellent performance has bigger probability to become fragment after being sliced, to realize network height
The safety of block chain network is not reduced while handling capacity.
Detailed description of the invention
Fig. 1 is a kind of flow chart of network scalability block chain implementation method provided in an embodiment of the present invention；
Fig. 2 is a kind of block chain network system of network scalability block chain implementation method provided in an embodiment of the present invention
Structural schematic diagram；
Fig. 3 be in a kind of network scalability block chain implementation method provided in an embodiment of the present invention prestige block (RB) and
Working method schematic diagram of the data structure and multiple party signatures of state block (SB) in synchronizing process；
Fig. 4 is transaction List Table in a kind of network scalability block chain implementation method provided in an embodiment of the present invention
(TxList), transaction determines that (TxDec) and transaction determine the data structure schematic diagram of list (TxDecSet).
Specific embodiment
Embodiments of the present invention are illustrated by particular specific embodiment below, those skilled in the art can be by this explanation
Content disclosed by book is understood other advantages and efficacy of the present invention easily.
In being described below, for illustration and not for limitation, propose such as specific system structure, interface, technology it
The detail of class, to understand thoroughly the present invention.However, it will be clear to one skilled in the art that there is no these specific
The present invention also may be implemented in the other embodiments of details.In other situations, omit to well-known system, circuit and
The detailed description of method, in case unnecessary details interferes description of the invention.
Embodiment 1
Allocation methods are one of current raising most promising directions of block chain scalability.By by the transaction on network
It is divided into different fragments, each node on network need to only handle the transaction of sub-fraction, hand over other network node parallel proofs
Easily, extensive work can be completed.Current allocation methods are broadly divided into: network fragment, refer to that, using randomness, network is taken out at random
Node is taken to form fragment, to prevent malicious node from excessively filling single piece；Transaction fragment, in a system based on UTXO,
System distributes a fragment according to the address of sender to ensure that two honeysuckle transaction will be verified in identical fragment, is
System can reliably detect honeysuckle transaction, without carrying out any communication across piece；State fragment, in state fragment
In the case of, a part of each fragment reserved state, this is that allocation methods are most difficult to a kind of scheme realized.
Refering to what is shown in Fig. 1, a kind of network scalability block chain implementation method provided in an embodiment of the present invention includes: fragment
, credit rating mechanism synchronous with leader's election, the common recognition based on fragment leader and global synchronization algorithm.The embodiment of the present invention passes through
A kind of common recognition mechanism of credit rating mechanism construction carries out network fragment based on this, improves the scalability of block chain network, mention net
The trading processing speed of network.
It is a kind of block link network of network scalability block chain implementation method provided in an embodiment of the present invention with reference to Fig. 2
Network system structure diagram.It carries out fragment and leader first to elect, then common recognition synchronizes, while this two parts is comprised in this hair
In the credit mechanism of bright embodiment design；Common recognition terminates, and relationship trading global synchronization is finally packed into block chain network.
Fragment is elected with leader, and in this process, all verifying nodes are at the beginning of each round knows together the period
Several fragments are formed by being assigned in different groups, each fragment group can select the leader of the group.Detailed process is as follows: when new
At the beginning of one new common recognition period e, all verifying nodes be assigned in different groups and according to group interior joint by
The prestige that historical behavior generates, which is integrated, elects leader with positively related probability.Particularly, verifying node uses preceding state
The cryptographic Hash of block generates random number to introducing randomness, and then, node is allocated in each fragment.
Further, the verifying node ensures total prestige of each fragment by slicing algorithm during being probabilistically assigned
It is worth of substantially equal, the slicing algorithm includes:
Input:
Random sequence:Wherein, e indicates e-th of common recognition period, SBH table
Show the cryptographic Hash of each verifying node state block, k indicates k-th of verifying node；
Accumulative reputation collection:Wherein, w indicates accumulative letter
It praises score and calculates period, r indicates that the accumulative reputation of each verifying node, k indicate k-th of verifying node；
Output:
Fragment member always collects: C={ c1,c2,…,cn, wherein n indicates that n-th of fragment, c indicate the member of each fragment
Collection；
Fragment leader's collection: L={ l1,l2,…,ln, wherein n indicates that n-th of fragment, l indicate the leader of each fragment；
Initialization,Wherein, i is recycled from 1 to n；
With Seed in circulationeFor random generator RNG；
By accumulative reputation collection RwIn elementAccumulative reputation sequence is formed according to being ranked up from big to small
Collect Rsort:
Wherein, sort is indicated accumulative reputation collection RwIn elementAccording to being ranked up from big to small；
For RsortEach ofIt executes:
Find a sequence { t1,t2,…,tj, form the subset of CAnd meet:
In minimum value；
A random integers x is generated from random generator RNG；
Will with it is eachCorresponding verifying node vgIt distributes toWherein, u=x divided by j remainder+1；
Until all verifying nodes are probabilistically assigned rear end loop.
In addition, the verifying node for integrating sequence median higher than prestige is integrated in the election mechanism design of leader with prestige
Positively related probability is led as fragment.Specifically, leader's election algorithm of the election mechanism of the leader includes:
Each of C element c is always collected for fragment membern, it executes:
Rm=is included in cnIn all verifying nodes add up reputation median；
For being included in cnIn each verifying node vj, it executes:
IfThen, a random floating point is generated from random generator RNG:
IfThen, pi,j=+∞
Work as pi,m=(pi,1,pi,2,…pi,j) in minimum value when, ln=vm；
One cnExecution terminates；
Until traversal fragment member always collects each element in C, fragment member, which always collects C, to terminate to execute circulation；
Leader's election algorithm end loop.
Common recognition based on fragment leader is synchronous, and transaction initiator sends transaction (tx) to the responsible fragment for handling the transaction,
The common recognition synchronized algorithm that the subsequent districting operation is led based on fragment, generates transaction block and prestige block；In addition, for across piece
It trades, across the piece mechanism of atomicity is used in this embodiment of the present invention, to ensure honeysuckle do not occur.
Similar with bit coin with reference to Fig. 4, every transaction (tx) will have unique identification in embodiments of the present invention, input
UTXO list and output UTXO list；All-network verifying node sends transaction to the fragment for being responsible for input UTXO, and defeated
The UTXO listed in these transaction out, UTXO (Unspent Transaction Outputs) are the substantially single of bit coin transaction
Position, is the transaction output not spent, it is the key concept that the transaction of bit coin is generated and verified.For fragment i, in this hair
In bright embodiment, it will be used to verify after transaction id adds 1 divided by the remainder of fragment group number the transaction for being i.Due to the input of UTXO
It may be from different fragments, the implementation method being related in the embodiment of the present invention is capable of handling in piece and across piece transaction.
With reference to Fig. 4, for trading in piece, the common recognition synchronized algorithm based on fragment leader includes: that the leader in piece (divides
Piece leads lj) by comprising transaction id list signature (TxList,L is led for fragmentjSignature) be sent in all
Node (fragment member Vi)；Each network verification node checks the transaction id in transaction List Table and determines to receive, refuse still
It can not confirm the transaction；Network verification node signs their decision (TxDec, SigiFor each network verification node
Signature) after pass to leader in piece；Leader generates transaction block after the decision for collecting verifying node, which includes institute
There is the signature (sig of network verification person1、sig2…sigi…sigm) and leader signatureEach network verification section
Point checks the information of Correlation block；With reference to Fig. 3, if it exceeds half verifying node sounds an alarm, then leader in piece
It will be removed out network, while the fragment regenerates leader；When several transaction blocks generations, and do not receive police
Report, network verification node will calculate the credit value of respective nodes, generate prestige block after common signature.
With reference to Fig. 4, for trading across piece, in the common recognition synchronized algorithm based on fragment leader, input fragment will trade
List (TxList) and transaction determine that list (TxDecSet) is sent to relevant output fragment and other input fragment.
It is noted that transaction or across piece transaction either in piece, the transaction of the network verification node determines list
It (TxDecSet) include multiple signature sig1、sig2…sigi…sigm, each signature is for signing a son of transaction List Table
Collect, the transaction in a subset is sent to identical output fragment to reduce bandwidth cost；For some friendship across piece fragment
Easily, if correlation UTXO is not used by or locks, fragment will receive, and otherwise will refuse the transaction；Input fragment and output point
Piece will all lock correlation UTXO；Connecing for list is determined when receiving the transaction comprising the input UTXO from all correlated inputs fragments
When being proved, output fragment adds the transaction on transaction block；It is connect when input fragment is received from other correlated inputs fragment
When being proved, by release relationship trading and its UTXO；And if one of input fragment refuses the transaction, relevant input
With output fragment by abort transactoin.
It is described to be led based on fragment in order to further increase the trading processing ability of implementation method disclosed by the embodiments of the present invention
The common recognition synchronized algorithm led is by the way of parallel processing, will be in different blocks if different transaction does not conflict with one another
Parallel processing transaction；More specifically, the method for the parallel processing includes: each transaction List Table, transaction decision list and transaction
Block includes the number of iterations for being used to indicate the wheel common recognition period；And leader once receives previous round from network verification node
All Activity determine, so that it may send new transaction List Table.The common recognition agreement in the embodiment of the present invention is looked back, due to using same
Agreement is walked, it guarantees before the transaction List Table for receiving current round, and most honesty nodes, which are completed, determines the transaction of previous round
Determine the work that list is sent to leader.Therefore, network verification node can determine whether new transaction List Table is effective.
Credit rating mechanism, credit rating mechanism effectively support fragment above-mentioned, common recognition synchronization scheme.Based on common recognition
The behavior of all verifiers, all-network verifying node pass through credit rating mechanism and carry out prestige scoring calculating and for prestige
Score is reached common understanding.By accumulating credit rating, fragment can be more safe and efficient with leader's election mechanism.To in a piece
Transaction, after end cycle of knowing together, the reputation in fragment can be by all fragment members according to transaction conclusion collection and friendship
Easy block is independent and consistently calculates, and the mechanism of reputation, which can according to need, carries out pluggable design, the prestige scoring
The formula of calculating are as follows:
Wherein, l is the number of transaction of generation after previous credit rating period prestige block；T (j) is the friendship of transaction j
Easy volume；S (j) is the zoom factor of transaction j, for differently rewarding or punishing the behavior of verifying node.
The prestige scoring is that different zoom factors is arranged in different behaviors in calculating, and keeps the punishment of dishonest conduct big
In the reward of dishonest behavior.Since illegal transaction is by by more dangerous than being abandoned, if some network verification node
Provide "Yes" and most of other provide "No", then network verification node will be given more punishment.For " unknown " decision,
Network verification node, which will not both obtain reputation, will not lose reputation because these verifying nodes usually have it is lower
Performance, (CPU, hard disk and bandwidth etc.) can not be communicated in time.
With reference to Fig. 3, in figure:For the fragment c in the e-1 period of knowing together1Prestige block,It knows together for e-th
The fragment c in period1Honest node prestige block,For the fragment c in e-th of period of knowing together1Malicious node/potential malice
Node prestige block,For fragment c1Honest node state block,For fragment c1Malicious node/potential malice section
Dotted state block, TB are honest node transaction block, and TB ' is malicious node/potential malicious node transaction block, and Nonce is close
Code is any or non-repetitive random number being only only used once in learning, and after the completion of prestige scores and calculates, network is tested
It demonstrate,proves node and generates the prestige block, the transaction block that the prestige block includes prestige scoring, has confirmed that using common signature
List, previous prestige block and common signature.Specifically, the generation of the prestige block is led by block and network verification
Node runs two continuous rounds, including announces and promise to undertake, challenges and respond the ashed information label of first previous cycle prestige block
Name, the quantity and identity information of verifier of these signatures comprising agreeing to block, subdivision planning digital multisignatures in addition, if it exceeds
The network verification node of half is signed on block, then receives block of trading；The prestige block, which provides evidence, proves to be more than half
Network verification node receive transaction block.In a common recognition period, prestige block can be packed into prestige chain by fragment.
Global synchronization algorithm, when each knows together end cycle, each fragment group generates a state block, will hand over
The record of easy block chain and prestige block chain is packaged, and subsequent network verification node is based on the state block from all fragments, together
The credit value for walking and updating storage starts next common recognition period after terminating.In order to reduce the entire mutual ditch of block chain node
Logical huge network overhead, the network verification node generate the state block, the net using the mode of multiple party signatures
Network verifying node generates fragment of the random number for next common recognition period using the mode of proof of work in state block
It is elected with leader.
Although above having used general explanation and specific embodiment, the present invention is described in detail, at this
On the basis of invention, it can be made some modifications or improvements, this will be apparent to those skilled in the art.Therefore,
These modifications or improvements without departing from theon the basis of the spirit of the present invention are fallen within the scope of the claimed invention.
Claims (10)
1. a kind of network scalability block chain implementation method, which is characterized in that the implementation method includes:
All verifying nodes will be assigned in different groups at the beginning of each round knows together the period and form several fragments；
Each fragment integrates according to the prestige of corresponding group interior joint generated by historical behavior and elects neck with positively related probability
It leads；
Transaction initiator sends transaction, the common recognition that the subsequent districting operation is led based on fragment to the responsible fragment for handling the transaction
Synchronized algorithm generates transaction block and prestige block；
Based on the behavior for all verifiers that know together, all-network verifying node passes through credit rating mechanism and carries out prestige scoring meter
It calculates and reaches common understanding for reputation；
After the completion of prestige scores and calculates, network verification node generates the prestige block, the prestige area using common signature
Block includes prestige scoring, the transaction block lists having confirmed that, previous prestige block and common signature；And
When each knows together end cycle, each fragment group generates a state block, by transaction block chain and prestige area
The record of block chain is packaged, and subsequent network verification node is based on the state block from all fragments, the letter for synchronizing and updating storage
Reputation value starts next common recognition period after terminating.
2. a kind of network scalability block chain implementation method according to claim 1, which is characterized in that the verifying section
Point generates random number using the cryptographic Hash of the state block in previous common recognition period to introduce randomness, then verifies node
It is randomized to either in each fragment.
3. a kind of network scalability block chain implementation method according to claim 1, which is characterized in that the leader's
In election mechanism, positively related probability is integrated with prestige higher than the verifying node that prestige integrates sequence median and is led as fragment
It leads.
4. a kind of network scalability block chain implementation method according to claim 1, which is characterized in that every transaction tool
There are unique identification, input UTXO list and output UTXO list；All-network verifying node sends responsible input for transaction
The fragment of UTXO, and export the UTXO listed in these transaction.
5. a kind of network scalability block chain implementation method according to claim 1, which is characterized in that be based on described
In the common recognition synchronized algorithm of fragment leader, for fragment i, for verifying after transaction id adds 1 divided by the remainder of fragment group number as i's
Transaction.
6. a kind of network scalability block chain implementation method according to claim 5, which is characterized in that for being handed in piece
Easily, the common recognition synchronized algorithm based on fragment leader includes:
List signature comprising transaction id is sent to the node in all by the leader in piece；
Each network verification node checks the transaction id in transaction List Table and determines to receive, refuse or can not confirm that this hands over
Easily；
Network verification node is passed in piece after their decision is signed and is led；
Leader generates transaction block after the decision for collecting verifying node, which includes the signature of all-network verifier
With the signature of leader；
Each network verification node checks the information of Correlation block；
If it exceeds half verifying node sounds an alarm, then leader will be removed out network in piece, while the fragment is again
Generate leader；
When several transaction blocks generations, and alarm not being received, network verification node will calculate the credit value of respective nodes,
Prestige block is generated after common signature.
7. a kind of network scalability block chain implementation method according to claim 5, which is characterized in that for being handed over across piece
Easily, in the common recognition synchronized algorithm based on fragment leader, transaction List Table and transaction are determined that list is sent to phase by input fragment
The output fragment of pass and other input fragment.
8. a kind of network scalability block chain implementation method according to claim 6 or 7, which is characterized in that the net
The transaction that network verifies node determines that list includes multiple signatures, each a subset signed for signing transaction List Table, one
The transaction that height is concentrated is sent to identical output fragment to reduce bandwidth cost.
9. a kind of network scalability block chain implementation method according to claim 6 or 7, which is characterized in that the base
It, will be not if different transaction does not conflict with one another in the common recognition synchronized algorithm that fragment is led by the way of parallel processing
Parallel processing transaction in same block；The method of the parallel processing includes:
Each transaction List Table, transaction determine list and block of trading includes the number of iterations for being used to indicate the wheel common recognition period；And
Leader once determines from the All Activity that network verification node receives previous round, so that it may send new transaction column
Table.
10. a kind of network scalability block chain implementation method according to claim 1, which is characterized in that the prestige
Score the formula calculated are as follows:
Wherein, l is the number of transaction of generation after previous credit rating period prestige block；
T (j) is the turnover of transaction j；S (j) is the zoom factor of transaction j, for differently rewarding or punishing verifying node
Behavior；
The prestige scoring is that different zoom factors is arranged in different behaviors in calculating, and is greater than the punishment of dishonest conduct sincere
The reward that implementation is, for " unknown " decision, network verification node, which will not both obtain reputation, will not lose reputation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811231480.7A CN109544334B (en) | 2018-10-22 | 2018-10-22 | Method for realizing network extensible block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811231480.7A CN109544334B (en) | 2018-10-22 | 2018-10-22 | Method for realizing network extensible block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109544334A true CN109544334A (en) | 2019-03-29 |
| CN109544334B CN109544334B (en) | 2020-09-29 |
Family
ID=65844218
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811231480.7A Expired - Fee Related CN109544334B (en) | 2018-10-22 | 2018-10-22 | Method for realizing network extensible block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109544334B (en) |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110097458A (en) * | 2019-04-11 | 2019-08-06 | 贝克链区块链技术有限公司 | A kind of quantization credit system based on block chain technology |
| CN110166220A (en) * | 2019-05-06 | 2019-08-23 | 山东公链信息科技有限公司 | A kind of sharding method carrying out cutting according to the hashed value of subregion key |
| CN110310115A (en) * | 2019-05-23 | 2019-10-08 | 杭州云象网络技术有限公司 | A method of realizing that distributed account book is extending transversely based on fragment mechanism |
| CN110519246A (en) * | 2019-08-15 | 2019-11-29 | 安徽师范大学 | Based on the degree of belief calculation method for trusting block chain link point |
| CN110570202A (en) * | 2019-09-02 | 2019-12-13 | 杭州趣链科技有限公司 | Hybrid consensus method based on fragmentation technology |
| CN110611701A (en) * | 2018-08-21 | 2019-12-24 | 汇链丰(北京)科技有限公司 | Parameter configuration and transaction processing method based on block chain |
| CN110730241A (en) * | 2019-10-22 | 2020-01-24 | 河海大学常州校区 | Global scale oriented blockchain infrastructure |
| CN110928953A (en) * | 2019-12-03 | 2020-03-27 | 上海墨珩网络科技有限公司 | Data synchronization method and system based on block chain technology |
| CN111083052A (en) * | 2019-12-19 | 2020-04-28 | 上海优扬新媒信息技术有限公司 | Fragmentation method and device based on ordered balanced binary tree |
| WO2020082213A1 (en) * | 2018-10-22 | 2020-04-30 | 深圳市哈希树科技有限公司 | Network expandability blockchain implementation method |
| CN111241114A (en) * | 2020-01-07 | 2020-06-05 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN111292098A (en) * | 2020-01-15 | 2020-06-16 | 北京航空航天大学 | Trusted service supply chain-oriented block chain consensus mechanism construction method |
| CN111583039A (en) * | 2020-05-09 | 2020-08-25 | 江苏大学 | Safe interaction method, incentive method and transaction system for manager-free blockchain transaction |
| CN111724145A (en) * | 2020-05-25 | 2020-09-29 | 天津大学 | Design method of block chain system fragmentation protocol |
| CN112184226A (en) * | 2020-09-30 | 2021-01-05 | 中国科学院计算技术研究所 | Block chain dynamic fragmentation method and system |
| CN112258321A (en) * | 2020-10-13 | 2021-01-22 | 安徽师范大学 | Transaction placement method for block chain fragments |
| CN112396357A (en) * | 2021-01-12 | 2021-02-23 | 电子科技大学 | Consensus method applied to personnel assessment system based on block chain |
| CN112541763A (en) * | 2020-12-11 | 2021-03-23 | 军工保密资格审查认证中心 | Block consensus approval method and device for block chain manager |
| CN112822013A (en) * | 2021-04-16 | 2021-05-18 | 卓尔智联(武汉)研究院有限公司 | Block chain consensus method, device and storage medium |
| CN113115315A (en) * | 2021-04-02 | 2021-07-13 | 青岛科技大学 | IOT equipment behavior credible supervision method based on block chain |
| CN113487400A (en) * | 2021-06-04 | 2021-10-08 | 长春工业大学 | Financial credit consensus method based on honesty bidirectional selection |
| CN113553380A (en) * | 2021-07-23 | 2021-10-26 | 东北大学 | Reputation-behavior association-oriented data traceability system with double block chains |
| CN113568577A (en) * | 2021-07-27 | 2021-10-29 | 天津大学 | Distributed packet storage method based on alliance block chain |
| CN113691632A (en) * | 2021-08-27 | 2021-11-23 | 广东卓启云链科技有限公司 | Dynamic scheduling method and system for block chain computing resources |
| CN113807851A (en) * | 2021-09-30 | 2021-12-17 | 中国人民解放军国防科技大学 | Block chain expandability realization method and system based on fragmentation |
| CN114070775A (en) * | 2021-10-15 | 2022-02-18 | 上海智能网联汽车技术中心有限公司 | Block chain network slice safety intelligent optimization method facing 5G intelligent network connection system |
| CN114493776A (en) * | 2022-01-20 | 2022-05-13 | 重庆邮电大学 | Method for multi-tenant distributed lease of satellite network resources based on block chain |
| EP3970343A4 (en) * | 2019-05-15 | 2022-12-28 | Nokia Technologies OY | Parallel multi-blocks creation scheme for blockchain |
| WO2024011707A1 (en) * | 2022-07-11 | 2024-01-18 | Hsbc Software Development (Guangdong) Limited | Blockchain transaction sharding for improved transaction throughput |
| WO2024040796A1 (en) * | 2022-08-26 | 2024-02-29 | 国网智慧车联网技术有限公司 | Block chain power transaction system, consensus method, device and storage medium |
| CN114493776B (en) * | 2022-01-20 | 2024-05-31 | 重庆邮电大学 | Block chain-based multi-tenant distributed leasing satellite network resource method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789095A (en) * | 2017-03-30 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Distributed system and message treatment method |
| CN106878071A (en) * | 2017-01-25 | 2017-06-20 | 上海钜真金融信息服务有限公司 | A kind of block chain common recognition mechanism based on Raft algorithms |
| CN106936589A (en) * | 2017-04-21 | 2017-07-07 | 杭州秘猿科技有限公司 | A kind of acentric the license parallel sharding method of chain and method of commerce |
| US9703986B1 (en) * | 2015-05-13 | 2017-07-11 | Anonyome Labs, Inc. | Decentralized reputation service for synthetic identities |
-
2018
- 2018-10-22 CN CN201811231480.7A patent/CN109544334B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9703986B1 (en) * | 2015-05-13 | 2017-07-11 | Anonyome Labs, Inc. | Decentralized reputation service for synthetic identities |
| CN106878071A (en) * | 2017-01-25 | 2017-06-20 | 上海钜真金融信息服务有限公司 | A kind of block chain common recognition mechanism based on Raft algorithms |
| CN106789095A (en) * | 2017-03-30 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Distributed system and message treatment method |
| CN106936589A (en) * | 2017-04-21 | 2017-07-07 | 杭州秘猿科技有限公司 | A kind of acentric the license parallel sharding method of chain and method of commerce |
Cited By (48)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110611701A (en) * | 2018-08-21 | 2019-12-24 | 汇链丰(北京)科技有限公司 | Parameter configuration and transaction processing method based on block chain |
| WO2020082213A1 (en) * | 2018-10-22 | 2020-04-30 | 深圳市哈希树科技有限公司 | Network expandability blockchain implementation method |
| CN110097458A (en) * | 2019-04-11 | 2019-08-06 | 贝克链区块链技术有限公司 | A kind of quantization credit system based on block chain technology |
| CN110166220A (en) * | 2019-05-06 | 2019-08-23 | 山东公链信息科技有限公司 | A kind of sharding method carrying out cutting according to the hashed value of subregion key |
| CN110166220B (en) * | 2019-05-06 | 2022-05-06 | 山东公链信息科技有限公司 | Slicing method for slicing according to hash value of partition key |
| EP3970343A4 (en) * | 2019-05-15 | 2022-12-28 | Nokia Technologies OY | Parallel multi-blocks creation scheme for blockchain |
| CN110310115A (en) * | 2019-05-23 | 2019-10-08 | 杭州云象网络技术有限公司 | A method of realizing that distributed account book is extending transversely based on fragment mechanism |
| CN110519246A (en) * | 2019-08-15 | 2019-11-29 | 安徽师范大学 | Based on the degree of belief calculation method for trusting block chain link point |
| CN110519246B (en) * | 2019-08-15 | 2021-09-28 | 安徽师范大学 | Trust degree calculation method based on trust block chain node |
| CN110570202B (en) * | 2019-09-02 | 2022-06-03 | 杭州趣链科技有限公司 | Hybrid consensus method based on fragmentation technology |
| CN110570202A (en) * | 2019-09-02 | 2019-12-13 | 杭州趣链科技有限公司 | Hybrid consensus method based on fragmentation technology |
| CN110730241A (en) * | 2019-10-22 | 2020-01-24 | 河海大学常州校区 | Global scale oriented blockchain infrastructure |
| CN110730241B (en) * | 2019-10-22 | 2022-01-25 | 河海大学常州校区 | Global scale oriented blockchain infrastructure |
| CN110928953A (en) * | 2019-12-03 | 2020-03-27 | 上海墨珩网络科技有限公司 | Data synchronization method and system based on block chain technology |
| CN111083052A (en) * | 2019-12-19 | 2020-04-28 | 上海优扬新媒信息技术有限公司 | Fragmentation method and device based on ordered balanced binary tree |
| CN111083052B (en) * | 2019-12-19 | 2022-01-28 | 度小满科技(北京)有限公司 | Fragmentation method and device based on ordered balanced binary tree |
| CN111241114A (en) * | 2020-01-07 | 2020-06-05 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN111241114B (en) * | 2020-01-07 | 2022-05-24 | 中国科学院信息工程研究所 | Intelligent service transaction block chain credit management method and system combining transaction and consensus |
| CN111292098A (en) * | 2020-01-15 | 2020-06-16 | 北京航空航天大学 | Trusted service supply chain-oriented block chain consensus mechanism construction method |
| CN111583039A (en) * | 2020-05-09 | 2020-08-25 | 江苏大学 | Safe interaction method, incentive method and transaction system for manager-free blockchain transaction |
| CN111724145A (en) * | 2020-05-25 | 2020-09-29 | 天津大学 | Design method of block chain system fragmentation protocol |
| CN112184226B (en) * | 2020-09-30 | 2023-09-12 | 中国科学院计算技术研究所 | Block chain dynamic slicing method and system |
| CN112184226A (en) * | 2020-09-30 | 2021-01-05 | 中国科学院计算技术研究所 | Block chain dynamic fragmentation method and system |
| CN112258321A (en) * | 2020-10-13 | 2021-01-22 | 安徽师范大学 | Transaction placement method for block chain fragments |
| CN112258321B (en) * | 2020-10-13 | 2024-03-15 | 安徽师范大学 | Transaction placement method for blockchain slicing |
| CN112541763B (en) * | 2020-12-11 | 2024-04-30 | 军工保密资格审查认证中心 | Block co-identification approval method and device of block chain manager |
| CN112541763A (en) * | 2020-12-11 | 2021-03-23 | 军工保密资格审查认证中心 | Block consensus approval method and device for block chain manager |
| CN112396357A (en) * | 2021-01-12 | 2021-02-23 | 电子科技大学 | Consensus method applied to personnel assessment system based on block chain |
| CN113115315A (en) * | 2021-04-02 | 2021-07-13 | 青岛科技大学 | IOT equipment behavior credible supervision method based on block chain |
| CN112822013B (en) * | 2021-04-16 | 2021-07-23 | 卓尔智联(武汉)研究院有限公司 | Block chain consensus method, device and storage medium |
| CN112822013A (en) * | 2021-04-16 | 2021-05-18 | 卓尔智联(武汉)研究院有限公司 | Block chain consensus method, device and storage medium |
| CN113487400A (en) * | 2021-06-04 | 2021-10-08 | 长春工业大学 | Financial credit consensus method based on honesty bidirectional selection |
| CN113487400B (en) * | 2021-06-04 | 2022-10-11 | 长春工业大学 | Financial credit consensus method based on honesty bidirectional selection |
| CN113553380A (en) * | 2021-07-23 | 2021-10-26 | 东北大学 | Reputation-behavior association-oriented data traceability system with double block chains |
| CN113553380B (en) * | 2021-07-23 | 2023-07-28 | 东北大学 | Reputation-behavior association-oriented data tracing system for double-block chain |
| CN113568577A (en) * | 2021-07-27 | 2021-10-29 | 天津大学 | Distributed packet storage method based on alliance block chain |
| CN113568577B (en) * | 2021-07-27 | 2023-11-21 | 天津大学 | Distributed grouping storage method based on alliance block chain |
| CN113691632B (en) * | 2021-08-27 | 2023-06-13 | 广东卓启云链科技有限公司 | Dynamic scheduling method and system for block chain computing resources |
| CN113691632A (en) * | 2021-08-27 | 2021-11-23 | 广东卓启云链科技有限公司 | Dynamic scheduling method and system for block chain computing resources |
| CN113807851B (en) * | 2021-09-30 | 2023-11-21 | 中国人民解放军国防科技大学 | Block chain expandability realization method and system based on slicing |
| CN113807851A (en) * | 2021-09-30 | 2021-12-17 | 中国人民解放军国防科技大学 | Block chain expandability realization method and system based on fragmentation |
| CN114070775B (en) * | 2021-10-15 | 2023-07-07 | 上海智能网联汽车技术中心有限公司 | Block chain network slicing security intelligent optimization method for 5G intelligent networking system |
| CN114070775A (en) * | 2021-10-15 | 2022-02-18 | 上海智能网联汽车技术中心有限公司 | Block chain network slice safety intelligent optimization method facing 5G intelligent network connection system |
| WO2023138291A1 (en) * | 2022-01-20 | 2023-07-27 | 重庆邮电大学 | Blockchain-based method for multi-tenant distributed leasing of satellite network resources |
| CN114493776A (en) * | 2022-01-20 | 2022-05-13 | 重庆邮电大学 | Method for multi-tenant distributed lease of satellite network resources based on block chain |
| CN114493776B (en) * | 2022-01-20 | 2024-05-31 | 重庆邮电大学 | Block chain-based multi-tenant distributed leasing satellite network resource method |
| WO2024011707A1 (en) * | 2022-07-11 | 2024-01-18 | Hsbc Software Development (Guangdong) Limited | Blockchain transaction sharding for improved transaction throughput |
| WO2024040796A1 (en) * | 2022-08-26 | 2024-02-29 | 国网智慧车联网技术有限公司 | Block chain power transaction system, consensus method, device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109544334B (en) | 2020-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109544334A (en) | A kind of network scalability block chain implementation method | |
| CN111090892B (en) | Block chain consensus method and device based on VRF and threshold signature | |
| US9529923B1 (en) | Methods and apparatus for a distributed database within a network | |
| CN109327512A (en) | Game data subregion storage method based on block chain hash addressing and re-encryption | |
| CN108881163A (en) | A kind of multicenter block catenary system with block issue mechanism | |
| CN108647965A (en) | Across chain method of commerce, device, storage medium and electronic equipment | |
| CN109360100A (en) | Transaction rapid acknowledgment method and device based on block chain technology | |
| CN108292395A (en) | Block chain generating means, block chain generation method, block chain verification device, block chain verification method and program | |
| CN108352009A (en) | Block chain generating means, block chain generation method, block chain verification device, block chain verification method and program | |
| CN109360091A (en) | A kind of arbitrary object choosing method and device based on block chain | |
| CN109985389B (en) | Cheating-preventing method and system for card games based on intelligent block chain contracts | |
| CN110046999A (en) | Block chain method of commerce and device | |
| CN110011974A (en) | Bookkeeping methods, device, terminal and the computer readable storage medium of block chain | |
| CN107181797A (en) | The block compression method and system of a kind of block chain | |
| Andrey et al. | Review of existing consensus algorithms blockchain | |
| Edwards et al. | A review of quantum and hybrid quantum/classical blockchain protocols | |
| CN109840767A (en) | Multi-party Fair contract based on block chain technology deposits card method and system | |
| WO2020082213A1 (en) | Network expandability blockchain implementation method | |
| CN110473081A (en) | Based on the electronic bill method of charging out and device of block chain, electronic equipment | |
| CN106920097A (en) | A kind of generation time block chain method of Quantum Chain common recognition agreement | |
| CN109831509A (en) | A kind of common recognition algorithm going out block at random for realizing equal weight | |
| CN109035011A (en) | A kind of control method and system of block chain DAG width | |
| CN112184454B (en) | Block chain consensus method, device, system and storage medium | |
| CN110443612A (en) | A kind of dividing method of submitting an expense account, device and electronic equipment based on block chain | |
| Wang et al. | Enhancing Power Grid Resilience with Blockchain-Enabled Vehicle-to-Vehicle Energy Trading in Renewable Energy Integration |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20191212 Address after: 518027 Room 201, building a, No.1, Qianwan 1st Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen City, Guangdong Province (settled in Qianhai business secretary Co., Ltd.) Applicant after: Shenzhen hashishu Technology Co.,Ltd. Address before: 518057 South Mountain Science and Technology Eco-Park, Shenzhen City, Guangdong Province, 6 A902 Applicant before: OASIS FUTURE (SHENZHEN) HOLDINGS Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200929 Termination date: 20211022 |