CN109544334B - Method for realizing network extensible block chain - Google Patents
Method for realizing network extensible block chain Download PDFInfo
- Publication number
- CN109544334B CN109544334B CN201811231480.7A CN201811231480A CN109544334B CN 109544334 B CN109544334 B CN 109544334B CN 201811231480 A CN201811231480 A CN 201811231480A CN 109544334 B CN109544334 B CN 109544334B
- Authority
- CN
- China
- Prior art keywords
- transaction
- network
- leader
- block
- consensus
- 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.)
- Expired - Fee Related
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- 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
Abstract
The embodiment of the invention discloses a method for realizing a network extensible block chain, which comprises the following steps: the method comprises the steps of fragmentation and leader election, consensus synchronization based on fragmentation leader, a reputation evaluation mechanism and a global synchronization algorithm. The embodiment of the invention provides a parallel chain structure, which separates transaction and consensus into two chains so as to improve the expandability of a block chain network; the consensus part is carried out in a credit chain, the credit chain network pays attention to the safety and supports the high-speed transaction of the transaction chain network at a proper speed; based on various advantages of a credit evaluation mechanism, the embodiment of the invention provides a network fragmentation method based on the credit evaluation mechanism, and after network fragmentation, nodes with excellent integrity and performance have higher probability to become fragmentation leaders, so that the safety of a block chain network is not reduced while the high throughput of the network is realized.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a network extensible block chain implementation method.
Background
The block chain is an open distributed account book system, and a set of account books are maintained by a plurality of participants through a consensus mechanism. Taking the bit currency system as an example, any electronic computer in the world can access a bit currency network without authorization; each bit currency node is a complete public account book backup unified in the whole network, all bit currency transaction information is recorded, any node needs to synchronize the information to each node of the network when conducting transaction, and the account books on all the nodes can verify the behavior of the transaction and update the behavior in time. In a blockchain network, the allocation of billing rights is performed by way of a consensus mechanism. The current common block chain consensus mechanism comprises a workload certificate (POW), a rights and interests certificate (POS) and other modes, wherein the workload certificate (POW) calculates a random number meeting a rule through a hash operation and enumeration mode, obtains the accounting right of the current cycle, and stores all nodes together after the whole network verification. The workload certification (POW) has the advantage of being completely decentralized, and all network nodes can freely enter and exit the network; the disadvantages are that a large amount of computing resources are consumed to obtain the accounting right, the period for achieving the consensus is long, and the large-scale commercial use is not available.
The right-of-interest (POS) certificate is also a very representative method for distributing the accounting right at present, and when the network node generates a new block accounting, the network node attaches its own address to the block network to prove the corresponding right-of-interest ratio it possesses, and the node uses the private key corresponding to the address to sign the block information to prove that it really possesses the asset corresponding to the address. If a person has more rights in the network, he will more actively maintain the normal operation of the network under the assumption of a rational person, so that it is long-standing that the expected accounting weight ratio of a node should be equal to the rights and interests ratio of the node. The disadvantages of rights and interests proving are also evident, which above all leads to a centralisation tendency of the network; secondly, the current equity proving mechanism can not resist the force attack, and a user with less equity can obtain the accounting right far higher than the equity proportion by investing a large amount of force.
Due to the fact that the traditional public block chain is very weak in expandability and slow in transaction processing, inconvenience is brought to user experience.
Disclosure of Invention
The embodiment of the invention aims to provide a method for realizing a network extensible block chain, which is used for solving the technical problem that the traditional public block chain network is very weak in extensibility.
In order to achieve the above object, an embodiment of the present invention provides a method for implementing a network scalability block chain, where the method includes: all verification nodes are distributed to different groups to form a plurality of fragments when each round of consensus period starts; each fragment elects a leader according to the reputation integral generated by the historical behavior of the nodes in the corresponding group with positive correlation probability; a transaction initiator sends a transaction to a fragment responsible for processing the transaction, and then the fragment runs a consensus synchronization algorithm based on fragment leadership to generate a transaction block and a credit block; based on the behaviors of all verifiers in consensus, all network verification nodes perform credit score calculation through a credit evaluation mechanism and achieve consensus aiming at the credit scores; after the reputation score calculation is completed, the network verification node uses the common signature to generate the reputation block, wherein the reputation block comprises the reputation score, a list of confirmed transaction blocks, previous reputation blocks and the common signature; and when each consensus period is finished, each fragment group generates a state block, records of the transaction block chain and the credit block chain are packaged, then the network verification node synchronizes and updates the stored credit value based on the state blocks from all the fragments, and the next consensus period is started after the completion.
Preferably, the authentication node uses the hash value of the state chunk of the previous consensus period to generate a random number to introduce randomness, and then the authentication node is randomly assigned to the respective shards.
Preferably, in the election mechanism of the leader, the verification nodes higher than the median of the reputation score ranking become segment leaders with the probability that the reputation scores are positively correlated.
Preferably, each transaction has a unique identifier, an input UTXO list and an output UTXO list; all network authentication nodes send transactions to the patch responsible for inputting the UTXO and output the UTXO listed in these transactions.
Preferably, in the sharded leader-based consensus synchronization algorithm, for shard i, a transaction with i is verified after the remainder of the transaction ID divided by the number of sharded groups is added by 1.
Preferably, for on-chip trading, the slice-leader-based consensus synchronization algorithm comprises: the leader in the slice sends a list signature containing the transaction ID to all nodes in the slice; each network verification node checks the transaction ID in the transaction list and decides whether to accept, reject or not confirm the transaction; the network verification nodes transmit the determined signatures to the leader in the chip; the leader generates a transaction block after collecting the decisions of the verification nodes, wherein the transaction block comprises the signatures of all the network verifiers and the signature of the leader; each network verification node checks the information of the relevant block; if more than half of verification nodes send out an alarm, the leader in the slice is removed from the network, and the leader is generated again in the slice; when a plurality of transaction blocks are generated and no alarm is received, the network verification node calculates the reputation value of the corresponding node, and generates a reputation block after common signature.
Preferably, for cross-slice trading, in the slice-leader-based consensus synchronization algorithm, an input slice transmits a trading list and a trading decision list to a related output slice and a further input slice.
Preferably, the transaction decision list of the network verification node comprises a plurality of signatures, each signature being used to sign a subset of the transaction list, the transactions in a subset being sent to the same output slice to reduce bandwidth costs.
Preferably, the consensus synchronization algorithm based on segment leader adopts a parallel processing mode, and if different transactions do not conflict with each other, the transactions are processed in different blocks in parallel; the parallel processing method comprises the following steps: each transaction list, transaction decision list and transaction block contains a number of iterations for indicating the round of consensus period; and the leader may send a new list of trades upon receiving all of the trade decisions of the previous round from the network verification node.
Preferably, the reputation score calculation is formulated as:
wherein, l is the transaction quantity generated after the credit block of the previous credit evaluation period is generated; t (j) is the transaction amount of transaction j; s (j) is a scaling factor of transaction j, and is used for differentially rewarding or punishing the behavior of the verification node; different scaling factors are set for different behaviors in the credit score calculation, so that punishment of dishonest behaviors is larger than reward of dishonest behaviors, and for unknown decisions, a network verification node can not obtain credit scores or lose credit scores.
The embodiment of the invention has the following advantages:
1) the embodiment of the invention provides a parallel chain structure, which separates transaction and consensus into two chains so as to improve the expandability of a block chain network; the consensus part is carried out in a credit chain, the credit chain network pays attention to the safety and supports the high-speed transaction of the transaction chain network at a proper speed;
2) the embodiment of the invention uses a credit evaluation mechanism to enhance the safety of the block chain network and improve the excitation, and on one hand, the credit consensus mechanism based on the historical performance of the nodes screens out the network nodes with excellent honesty and processing performance, and simultaneously gives more expected network contributions and rewards to the network nodes; on the other hand, potential network disruptors and malicious nodes are more easily found and removed from the network in time, and the safety of the block chain network is ensured.
3) Based on various advantages of a credit evaluation mechanism, the embodiment of the invention provides a network fragmentation method based on the credit evaluation mechanism, and after network fragmentation, nodes with excellent integrity and performance have higher probability to become fragmentation leaders, so that the safety of a block chain network is not reduced while the high throughput of the network is realized.
Drawings
Fig. 1 is a flowchart of a method for implementing a network extensible blockchain according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a block chain network system of a network extensible block chain implementation method according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a data structure of a Reputation Block (RB) and a Status Block (SB) and a working manner of a multi-party signature in a synchronization process in a network scalability block chain implementation method according to an embodiment of the present invention;
fig. 4 is a schematic diagram of data structures of a transaction list (TxList), a transaction decision (TxDec) and a transaction decision list (TxDec) in a network extensible block chain implementation method according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention is provided for illustrative purposes, and other advantages and effects of the present invention will become apparent to those skilled in the art from the present disclosure.
In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular system structures, interfaces, techniques, etc. in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
Example 1
The fragmentation technique is one of the most promising ways to improve the scalability of the blockchain. By dividing the transactions on the network into different fragments, each node on the network only needs to process a small part of transactions and verify the transactions in parallel with other network nodes, and a large amount of work can be completed. The current fragmentation technology mainly comprises the following steps: network fragmentation refers to that a network randomly extracts nodes to form fragments by utilizing randomness so as to prevent malicious nodes from excessively filling a single fragment; transaction fragmentation, in a UTXO-based system, the system allocates a fragment according to the address of the sender to ensure that two double-flower transactions are verified in the same fragment, and the system can easily detect the double-flower transactions without any cross-fragment communication; state fragmentation, in which each fragment only retains a part of the state, is one of the most difficult schemes to implement in the fragmentation technique.
Referring to fig. 1, a method for implementing a network scalability block chain according to an embodiment of the present invention includes: the method comprises the steps of fragmentation and leader election, consensus synchronization based on fragmentation leader, a reputation evaluation mechanism and a global synchronization algorithm. The embodiment of the invention constructs a consensus mechanism through a credit evaluation mechanism, and carries out network fragmentation based on the consensus mechanism, thereby improving the expandability of the block chain network and the transaction processing speed of the network.
Referring to fig. 2, a block chain network system structure diagram of a network scalability block chain implementation method according to an embodiment of the present invention is shown. Firstly, carrying out fragmentation and leader election, then realizing consensus synchronization, and simultaneously containing the two parts in a reputation mechanism designed by the embodiment of the invention; and finishing consensus, and finally, globally and synchronously packaging related transactions into a block chain network.
And (4) slicing and leader election, wherein all verification nodes are distributed to different groups to form a plurality of slices at the beginning of each round of consensus period, and each slice group selects the leader of the group. The specific process is as follows: when a new consensus period e begins, all verification nodes are assigned to different groups and leaders are elected with positive correlation probability according to reputation scores generated by the nodes in the groups by historical behavior. In particular, the verifying node introduces randomness using the hash value of the previous state chunk to generate a random number, and then the nodes are randomly assigned to the respective shards.
Further, the verifying nodes ensure that the total reputation value of each fragment is substantially equal through a fragmentation algorithm in the process of being randomly allocated, and the fragmentation algorithm includes:
inputting:
random sequence:
wherein e represents the e-th consensus period, SBH represents the hash value of each verification node state block, and k represents the k-th verification node;
accumulating a set of reputation scores:
wherein w represents the accumulated reputation score calculation period, r represents the accumulated reputation score of each verification node, and k represents the kth verification node;
and (3) outputting:
a fragment member collection: c ═ C1,c2,…,cnN represents the nth slice, and c represents the member set of each slice;
slice leading and gathering: l ═ L1,l2,…,lnN represents the nth fragment, and l represents the leader of each fragment;
the initialization is carried out in such a way that,
wherein i cycles from 1 to n;
circulating by SeedeIs a random generator RNG;
will accumulate a set of reputation scores RwElement (1) of
Forming an accumulated credit score sequencing set R by sequencing from big to smallsort：
for RsortEach of ri sortAnd executing:
looking for a sequence t1,t2,…,tjForm a subset of C
And satisfies the following conditions:
generating a random integer x from the random generator RNG;
will be associated with each ri sortCorresponding verification node vgIs assigned to
Wherein the remainder of dividing x by j + 1;
the loop ends until all verification nodes are randomly assigned.
In addition, in the design of the election mechanism of the leader, the verification nodes higher than the median of the credit score sorting become segment leaders according to the probability that the credit scores are positively correlated. Specifically, the leader election algorithm of the leader election mechanism includes:
for each element C in the aggregate C of shard membersnAnd executing:
rm is contained in cnThe median of the accumulated credit scores of all verification nodes in the database;
for inclusion in cnEach verification node v injAnd executing:
if it is not，
Then, a random floating point number is generated from random generator RNG:
if the number of the first and second antennas is greater than the predetermined number,
then, pi,j＝+∞
When p isi,m＝(pi,1,pi,2,…pi,j) At the minimum value of ln＝vm；
A cnThe execution is finished;
until each element in the fragment member total set C is traversed, the fragment member total set C finishes executing circulation;
the leader election algorithm ends the loop.
Based on the consensus synchronization of the segment leader, a transaction initiator sends a transaction (tx) to a segment responsible for processing the transaction, and then the segment runs a consensus synchronization algorithm based on the segment leader to generate a transaction block and a reputation block; in addition, for cross-slice transactions, an atomic cross-slice mechanism is adopted in the embodiment of the invention to ensure that double flowers do not appear.
Referring to fig. 4, similar to bitcoins, each transaction (tx) will have a unique identification, an input UTXO list and an output UTXO list in embodiments of the present invention; all network verification nodes send transactions to the fragments responsible for inputting the UTXO and output the UTXO listed in the transactions, wherein the UTXO (UnpendTransactionOutputs) is a basic unit of bit currency transactions, is an uneconomical transaction output and is a core concept of bit currency transaction generation and verification. For fragment i, in an embodiment of the present invention, it will be used to verify a transaction with i after the remainder of the transaction ID divided by the number of fragment groups is added to 1. Since the input to the UTXO may come from different slices, implementations related to embodiments of the present invention are capable of handling both on-chip and cross-chip transactions.
Referring to fig. 4, for on-chip trading, the slice-leader-based consensus synchronization algorithm comprises: leader within slice (slice leader |)j) The list signature containing the transaction ID (TxList,
leader for shardingjSignature of) to all nodes within a slice (slice member V)i) (ii) a Each network verification node checks the transaction ID in the transaction list and decides whether to accept, reject or not confirm the transaction; the network verifying nodes sign their decisions (TxDec, Sig)iVerifying the signature of the node for each network) and then transmitting the signature to the leader in the chip; the leader, after collecting the validation node's decisions, generates a transaction block that contains the signatures (sig) of all network validators1、sig2…sigi…sigm) And signature of leader
Each network verification node checks the information of the relevant block; referring to FIG. 3, if more than half of the verification nodes send out an alarm, the leader in the slice is removed from the network, and the slice generates the leader again; when a plurality of transaction blocks are generated and no alarm is received, the network verification node calculates the reputation value of the corresponding node, and generates a reputation block after common signature.
Referring to fig. 4, for a cross-slice transaction, in the slice-leader-based consensus synchronization algorithm, an input slice sends a transaction list (TxList) and a transaction decision list (txdcset) to a related output slice and another input slice.
It is worth mentioning that, whether it is an on-chip transaction or an off-chip transaction, the transaction decision list (txdcset) of the network authentication node contains a plurality of signature sigs1、sig2…sigi…sigmEach signature is used to sign a subset of the transaction list, the transactions in a subset being sent to the same output slice to reduce bandwidth costs; for a certain cross-chip fragmented transaction, if the associated UTXO is not used orLocking, the fragment will be accepted, otherwise the transaction will be rejected; the input fragment and the output fragment are locked with the related UTXO; when receiving the acceptance certification of the transaction decision list containing the input UTXO from all the related input fragments, the output fragments add the transaction on the transaction block; when the input fragment receives the acceptance certification from other related input fragments, the related transaction and the UTXO thereof are released; and if one of the input slices rejects the transaction, the relevant input and output slices will abort the transaction.
In order to further improve the transaction processing capacity of the implementation method disclosed by the embodiment of the invention, the piece leader-based consensus synchronization algorithm adopts a parallel processing mode, and if different transactions do not conflict with each other, the transactions are processed in different blocks in parallel; more specifically, the parallel processing method includes: each transaction list, transaction decision list and transaction block contains a number of iterations for indicating the round of consensus period; and the leader may send a new list of trades upon receiving all of the trade decisions of the previous round from the network verification node. Reviewing the consensus protocol in embodiments of the present invention, due to the synchronization protocol, it ensures that most honest nodes have completed sending the previous round of the list of trade decisions to the leader before receiving the current round of the list of trades. Thus, the network authentication node may determine whether the new transaction list is valid.
And the reputation evaluation mechanism powerfully supports the fragmentation and consensus synchronization scheme. Based on the behavior of all verifiers in consensus, all network verification nodes perform reputation score calculation through a reputation evaluation mechanism and achieve consensus on reputation scores. By accumulating reputation evaluations, the sharding and leader election mechanisms can be safer and more efficient. For one on-chip transaction, after the consensus period is over, the reputation scores in the segments can be calculated individually and consistently by all segment members according to a transaction conclusion set and a transaction block, a mechanism of the reputation scores can be designed in a pluggable manner as required, and the reputation score calculation formula is as follows:
wherein, l is the transaction quantity generated after the credit block of the previous credit evaluation period is generated; t (j) is the transaction amount of transaction j; s (j) is a scaling factor for transaction j for differentially rewarding or penalizing behavior of the verification node.
Different scaling factors are set for different behaviors in the credit score calculation, so that the punishment of the dishonest behavior is greater than the reward of the honest behavior. Since illegal transactions are more dangerous to pass than to be discarded, if some network authentication node gives "yes" and most others give "no", the network authentication node will be given more penalty. For "unknown" decisions, the network verification nodes neither obtain nor lose reputation scores because these verification nodes typically have lower performance and cannot communicate in time (CPU, hard disk, bandwidth, etc.).
Referring to fig. 3, in the figure:
is the slice c of the e-1 st consensus period1The reputation block of (a) is selected,
is the slice c of the e-th consensus period1The honest node reputation blocks of (a) are,
is the slice c of the e-th consensus period1The malicious node/potentially malicious node reputation block of (a),
is divided into pieces c1The honest node status blocks of (a) are,
is divided into pieces c1The malicious node/potential malicious node status block of (1), TB is an honest node transaction block, TB' is a malicious node/potential malicious node transaction block, and Nonce is only one in cryptographyAnd after the reputation score calculation is completed, the network verification node uses the common signature to generate the reputation block, wherein the reputation block comprises the reputation score, the confirmed transaction block list, the previous reputation block and the common signature. In particular, the generation of the reputation block is run by the block leader and network verification nodes for two consecutive rounds, including publishing and committing, challenging and responding to hashed message signatures of previous cycles of the reputation block, these signatures containing the number and identity information of verifiers who agreed to the block, additional segments checking the collective signature, accepting the transaction block if more than half of the network verification nodes signed on the block; the reputation block provides evidence that more than half of the network authentication nodes accept the transaction block. In a consensus period, a partition packs reputation blocks into a reputation chain.
And (3) a global synchronization algorithm, wherein each fragment group generates a state block at the end of each consensus period, records of a transaction block chain and a credit block chain are packaged, then the network verification node synchronizes and updates the stored credit value based on the state blocks from all the fragments, and the next consensus period is started after the end. In order to reduce the huge network overhead of mutual communication of the chain nodes of the whole block, the network verification node generates the state block by using a multi-party signature mode, and the network verification node generates random numbers in the state block by using a workload proving mode for fragmentation and leader election of the next consensus period.
Although the invention has been described in detail above with reference to a general description and specific examples, it will be apparent to one skilled in the art that modifications or improvements may be made thereto based on the invention. Accordingly, such modifications and improvements are intended to be within the scope of the invention as claimed.
Claims (10)
1. A network extensible block chain implementation method is characterized by comprising the following steps:
all verification nodes are distributed to different groups to form a plurality of fragments when each round of consensus period starts;
each fragment elects a leader according to the reputation integral generated by the historical behavior of the nodes in the corresponding group with positive correlation probability;
a transaction initiator sends a transaction to a fragment responsible for processing the transaction, and then the fragment runs a consensus synchronization algorithm based on fragment leadership to generate a transaction block and a credit block;
based on the behaviors of all verifiers in consensus, all network verification nodes perform credit score calculation through a credit evaluation mechanism and achieve consensus aiming at the credit scores;
after the reputation score calculation is completed, the network verification node uses the common signature to generate the reputation block, wherein the reputation block comprises the reputation score, a list of confirmed transaction blocks, previous reputation blocks and the common signature; and
and at the end of each consensus period, each fragment group generates a state block, records of a transaction block chain and a credit block chain are packaged, then the network verification node synchronizes and updates the stored credit values based on the state blocks from all the fragments, and the next consensus period is started after the end.
2. The method of claim 1, wherein the verifying node uses a hash value of the state block of the previous consensus period to generate a random number to introduce randomness, and then the verifying node is randomly distributed into each segment.
3. The method according to claim 1, wherein in the election mechanism of the leader, the verification nodes higher than the median of the reputation score ranking become segment leaders with probability that the reputation scores are positively correlated.
4. The method of claim 1, wherein each transaction has a unique identifier, an input UTXO list and an output UTXO list; all network authentication nodes send transactions to the patch responsible for inputting the UTXO and output the UTXO listed in these transactions.
5. The method according to claim 1, wherein in the segment leader-based consensus synchronization algorithm, for segment i, a transaction whose transaction ID is divided by the remainder of the number of segment groups plus 1 is verified.
6. The method of claim 5, wherein for intra-chip transactions, the slice-leader-based consensus synchronization algorithm comprises:
the leader in the slice sends a list signature containing the transaction ID to all nodes in the slice;
each network verification node checks the transaction ID in the transaction list and decides whether to accept, reject or not confirm the transaction;
the network verification nodes transmit the determined signatures to the leader in the chip;
the leader generates a transaction block after collecting the decisions of the verification nodes, wherein the transaction block comprises the signatures of all the network verifiers and the signature of the leader;
each network verification node checks the information of the relevant block;
if more than half of verification nodes send out an alarm, the leader in the slice is removed from the network, and the leader is generated again in the slice;
when a plurality of transaction blocks are generated and no alarm is received, the network verification node calculates the reputation value of the corresponding node, and generates a reputation block after common signature.
7. The method of claim 5, wherein for cross-slice transactions, in the slice-leader-based consensus synchronization algorithm, an input slice sends a transaction list and a transaction decision list to a related output slice and another input slice.
8. A network scalability block chain implementation method according to claim 6 or 7, wherein the transaction decision list of the network authentication node contains a plurality of signatures, each signature being used to sign a subset of the transaction list, the transactions in a subset being sent to the same output slice to reduce bandwidth cost.
9. The method according to claim 6 or 7, wherein the slice leader-based consensus synchronization algorithm is in a parallel processing manner, and if different transactions do not conflict with each other, transactions will be processed in different blocks in parallel; the parallel processing method comprises the following steps:
each transaction list, transaction decision list and transaction block contains a number of iterations for indicating the round of consensus period; and
the leader, upon receiving all of the trading decisions of the previous round from the network validation node, may send a new list of trades.
10. The method of claim 1, wherein the reputation score is calculated according to the following formula:
wherein, l is the transaction quantity generated after the credit block of the previous credit evaluation period is generated;
t (j) is the transaction amount of transaction j; s (j) is a scaling factor of transaction j, and is used for differentially rewarding or punishing the behavior of the verification node;
different scaling factors are set for different behaviors in the credit score calculation, so that punishment of dishonest behaviors is larger than reward of dishonest behaviors, and for unknown decisions, a network verification node can not obtain credit scores or lose credit scores.
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 CN109544334A (en) | 2019-03-29 |
| CN109544334B true 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) |
Families Citing this family (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110611701B (en) * | 2018-08-21 | 2022-10-11 | 汇链丰(北京)科技有限公司 | 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 |
| 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 |
| 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 |
| 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 |
| CN111083052B (en) * | 2019-12-19 | 2022-01-28 | 度小满科技(北京)有限公司 | Fragmentation method and device based on ordered balanced binary tree |
| 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 |
| CN111583039B (en) * | 2020-05-09 | 2023-05-05 | 江苏大学 | Secure interaction method, incentive method and transaction system for manager-free blockchain transaction |
| CN111724145B (en) * | 2020-05-25 | 2022-09-30 | 天津大学 | Design method of block chain system fragmentation protocol |
| CN112184226B (en) * | 2020-09-30 | 2023-09-12 | 中国科学院计算技术研究所 | Block chain dynamic slicing method and system |
| 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 |
| CN112396357B (en) * | 2021-01-12 | 2021-04-30 | 电子科技大学 | Consensus method applied to personnel assessment system based on block chain |
| CN113115315B (en) * | 2021-04-02 | 2022-10-04 | 青岛科技大学 | 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 |
| CN113487400B (en) * | 2021-06-04 | 2022-10-11 | 长春工业大学 | Financial credit consensus method based on honesty bidirectional selection |
| CN113553380B (en) * | 2021-07-23 | 2023-07-28 | 东北大学 | Reputation-behavior association-oriented data tracing system for double-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 |
| CN113807851B (en) * | 2021-09-30 | 2023-11-21 | 中国人民解放军国防科技大学 | Block chain expandability realization method and system based on slicing |
| CN114070775B (en) * | 2021-10-15 | 2023-07-07 | 上海智能网联汽车技术中心有限公司 | Block chain network slicing security intelligent optimization method for 5G intelligent networking system |
| CN114493776A (en) * | 2022-01-20 | 2022-05-13 | 重庆邮电大学 | Method for multi-tenant distributed lease of satellite network resources based on block chain |
| CN117422549A (en) * | 2022-07-11 | 2024-01-19 | 汇丰软件开发(广东)有限公司 | UTXO-based slicing method used in supervised cryptocurrency scene |
| CN115694876A (en) * | 2022-08-26 | 2023-02-03 | 国网电动汽车服务有限公司 | Block chain electric power transaction system, consensus method, device and storage medium |
Family Cites Families (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 |
| CN106878071B (en) * | 2017-01-25 | 2020-09-15 | 上海钜真金融信息服务有限公司 | Block chain consensus mechanism based on Raft algorithm |
| CN110430064B (en) * | 2017-03-30 | 2020-12-04 | 腾讯科技（深圳）有限公司 | Block chain system, message processing method and storage medium |
| CN106936589B (en) * | 2017-04-21 | 2020-02-07 | 杭州秘猿科技有限公司 | Centerless license chain parallel fragmentation method and transaction method |
-
2018
- 2018-10-22 CN CN201811231480.7A patent/CN109544334B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN109544334A (en) | 2019-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109544334B (en) | Method for realizing network extensible block chain | |
| Bouraga | A taxonomy of blockchain consensus protocols: A survey and classification framework | |
| Eyal et al. | {Bitcoin-NG}: A scalable blockchain protocol | |
| CN109150972B (en) | Working method of consensus mechanism of double-layer partitioned efficient block chain | |
| Miller et al. | The honey badger of BFT protocols | |
| CN110855432B (en) | Asynchronous BFT & DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions | |
| CN108647965B (en) | Cross-chain transaction method and device, storage medium and electronic equipment | |
| CN110945548A (en) | Computer-implemented system and method for managing large distributed storage pools in a blockchain network | |
| CN107493173B (en) | Block chain random number common recognition election method | |
| KR20180014534A (en) | Verification system and method for transaction based block chain | |
| Sun et al. | Rtchain: A reputation system with transaction and consensus incentives for e-commerce blockchain | |
| WO2020082213A1 (en) | Network expandability blockchain implementation method | |
| CN110610421B (en) | Guarantee fund management method and device under fragment framework | |
| US11475025B2 (en) | Blockchain system comprising consensus protocol using search for good approximate solutions to any optimization problem and its computor program | |
| CN106920097A (en) | A kind of generation time block chain method of Quantum Chain common recognition agreement | |
| CN109035011A (en) | A kind of control method and system of block chain DAG width | |
| CN113256424B (en) | Transaction data processing method, device, equipment and storage medium | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| Gjermundrød et al. | Going beyond the coinbase transaction fee: Alternative reward schemes for miners in blockchain systems | |
| CN114615281B (en) | Block chaining and block outputting method based on small-scale committee and PoS protocol confirmation method | |
| CN116595094A (en) | Federal learning incentive method, device, equipment and storage medium based on block chain | |
| Jia et al. | Delottery: a novel decentralized lottery system based on blockchain technology | |
| CN112184454B (en) | Block chain consensus method, device, system and storage medium | |
| CN114745131A (en) | PBFT (basis weight function) improved consensus algorithm of block chain | |
| Blum et al. | Superlight–A permissionless, light-client only blockchain with self-contained proofs and BLS signatures |
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 |