CN109523260A - A kind of high concurrent common recognition mechanism of dynamic node election - Google Patents
A kind of high concurrent common recognition mechanism of dynamic node election Download PDFInfo
- Publication number
- CN109523260A CN109523260A CN201811430115.9A CN201811430115A CN109523260A CN 109523260 A CN109523260 A CN 109523260A CN 201811430115 A CN201811430115 A CN 201811430115A CN 109523260 A CN109523260 A CN 109523260A
- Authority
- CN
- China
- Prior art keywords
- common recognition
- high concurrent
- node
- dynamic node
- witness
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Computer Security & Cryptography (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention relates to the block chain technical fields in distributed network system (DNS), and disclose the high concurrent common recognition mechanism of dynamic node election, including common recognition mechanism, and the common recognition mechanism includes accretion layer module, mould into layer module and the double-deck common recognition framework.The high concurrent common recognition mechanism of dynamic node election, compared to similar block chain project, it on the one hand can be, high concurrent mechanism is realized in performance, guarantee the high-performance of transaction and contract affairs, realize that dynamic eye-witness pledges election mechanism in safety, increase the credibility of eye-witness, common recognition novelty combines PoA common recognition strategy and DAG Method of Data Organization, the safe block chain common recognition network of high concurrent is constructed from bottom, on the basis of well-designed and analysis, this paper scheme proposes a kind of high concurrent two-layer hybrid common recognition mechanism of achievable dynamic node election, on the one hand it can guarantee the consistency of information, on the other hand also there is good performance in performance and safety.
Description
Technical field
The present invention relates to the block chain technical field in distributed network system (DNS), specially a kind of height of dynamic node election
It concurrently knows together mechanism.
Background technique
The fast development of computer has greatly pushed digital network, and internet is from the central computing device in one's early years gradually mistake
It crosses as personal mobile network, the development of block chain was similarly along with decentralized and mobile trend, from bit coin in 2008
Birth, until ether mill in 2013, until EOS network in 2017, block chain has been crossed steadily several has milestone significance
Foundation stone, non repudiation, anti-tamper characteristic, trackability and the one-way that block chain network itself has all are existing
The reference direction that the generation of extensive application provides the foundation, but at the same time, block chain due to being implemented in distributed network,
The confirmation speed (TPS) of transaction is always the bottleneck in the field.
DAG (Directed acyclic graph), directed acyclic graph are derived from the common data structure of computer field,
With the adjoint characteristic of its unique topological structure, it is often used processing Dynamic Programming, seeks shortest path, data pressure in navigation
In the scenes such as contracting, DAG was incorporated in block chain project as bottom data structure in 2014, and the quilt rapidly in 2018
Field development and propagation, in development process, have gradually emerged in large numbers some projects and product.
Byteball [GBYTE17] proposition forms main chain to witness mechanism, when witness sees a vertex, just
Can be by this message statement, then system will select a part by node that more people witnessed as main chain, only
In the case where being that eye-witness will not conspire to attack with attacker mostly, which just can guarantee the safety of selection, but
It is the honest behavior in order to motivate eye-witness, Byteball is rewarded the most by certain transaction fee is collected, and IOTA introducing " is tangled
" concept the topological mechanism of any main chain is described, when a new node generates, the first two point that will all select is as father
Node carries out POW excavation, and IOTA will distribute more weights to child node according to the support relationship of father vertex, however, it is breathed out
There are fragility in uncommon algorithm, will lead to leakage of the privacy key under particular probability, and Nano [NANO17] is raw for each account
At an individual chain, when sending or receiving affairs, relevant information will be updated, therefore each chain is only handled and itself phase
The affairs of pass greatly reduce the cost of processing time, and Nano adds the mixing common recognition mechanism of POW using DPOS, and will be in table
Certainly or when arbitrating determine the agreement, however in practice, account's chain framework of Nano shifts the token of centralization very not
Just, because exchange account needs unconventional a large amount of transaction, so propose a kind of high concurrent common recognition mechanism of dynamic node election
To solve the above problems.
Summary of the invention
(1) the technical issues of solving
In view of the deficiencies of the prior art, the present invention provides a kind of high concurrent common recognition mechanism of dynamic node election, have
The advantages that guaranteeing the consistency of information solves node in communication, the connecting object of selection be all it is random, arrived with information
Up to the time of different nodes also can be variant problem.
(2) technical solution
For the consistency purpose for realizing above-mentioned guarantee information, the invention provides the following technical scheme: a kind of dynamic node selects
The high concurrent of act is known together mechanism, including common recognition mechanism, and the common recognition mechanism includes that accretion layer module, mould are total into layer module and bilayer
Know framework.
Preferably, the accretion layer module realizes the planning and election of dynamic node using PoA common recognition thinking, for witness
Type credible security is pledged in the selection offer of people.
Preferably, the accretion layer module includes the node rotation mechanism of PoA common recognition mechanism with the combination side pledged in advance
Formula, arbitrary node node pool to be entered then need to carry out the poll and mortgage of the round, realize the accumulation of confidence level.
Preferably, the mould carries out bottom layer tissue using DAG data structure into layer module, realizes the height for trade confirmation
The logic of affairs is carried out high-performance distribution processor by concurrent state.
Preferably, the mould includes the Method of Data Organization of DAG into layer module, and which provides strong witness and general
Witness, realizes the concurrent function of trade confirmation, improves the confirmation speed of the whole network.
Preferably, on the one hand the double-deck common recognition framework guarantees that eye-witness's is credible by PoA in conjunction with DAG organizational form
On the one hand degree guarantees the high concurrent of trade confirmation.
Preferably, the double-deck common recognition framework includes the binding mechanism of PoA and DAG, under the framework model of bilayer common recognition,
Node carries out pledging acquisition authorization by PoA network, and into the trade confirmation network based on DAG, the network is from institutional framework
Have high concurrent function, the common recognition under high-performance situation can be supported to confirm.
(3) beneficial effect
Compared with prior art, the present invention provides a kind of high concurrent common recognition mechanism of dynamic node election, have following
The utility model has the advantages that
1, on the one hand, in property the high concurrent of dynamic node election is known together mechanism, can be compared to similar block chain project
It is able to achieve high concurrent mechanism, guarantees the high-performance of transaction and contract affairs, realizes that dynamic eye-witness pledges voting machine in safety
System, increases the credibility of eye-witness, and common recognition novelty combines PoA common recognition strategy and DAG Method of Data Organization, the bottom of from
The safe block chain of layer building high concurrent is known together network.
2, the high concurrent common recognition mechanism of dynamic node election, passes through logical between each node of block catenary system maintenance system
Letter is based on asynchronous full information transport protocol (asynchronous Full Information Transfer protocol), section
Point in communication, the connecting object of selection be all it is random, the time for reaching different nodes with information also can be variant, therefore
To reach final consistency, common recognition will safeguard all complete communication process of node in network, meanwhile, participant needs dynamic
Safeguard one storage have it is all participate in nodal information (including public key and port information) lists, therefore, it is well-designed and point
On the basis of analysis, this paper scheme proposes a kind of high concurrent two-layer hybrid common recognition mechanism of achievable dynamic node election, a side
Face can guarantee the consistency of information, on the other hand also there is good performance in performance and safety.
Detailed description of the invention
Fig. 1 is a kind of high concurrent common recognition mechanism common recognition architecture diagram of dynamic node election proposed by the present invention；
Fig. 2 is that a kind of high concurrent of dynamic node election proposed by the present invention knows together mechanism mould into layer network trading pattern.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
The high concurrent common recognition mechanism of a kind of dynamic node election referring to FIG. 1-2, including common recognition mechanism, mechanism packet of knowing together
Accretion layer module, mould are included into layer module and the double-deck common recognition framework, accretion layer module realizes dynamic node using PoA common recognition thinking
Planning and election, provide for the selection of eye-witness and pledge type credible security, accretion layer module includes the node of PoA common recognition mechanism
Rotation mechanism then needs the poll for carrying out the round and supports with the combination pledged in advance, arbitrary node node pool to be entered
It gives as security, realizes the accumulation of confidence level, mould carries out bottom layer tissue using DAG data structure into layer module, realizes for trade confirmation
The logics of affairs is carried out high-performance distribution processor by high concurrent state, and mould includes the Method of Data Organization of DAG into layer module, should
Mode provides strong witness and general witness, realizes the concurrent function of trade confirmation, improves the confirmation speed of the whole network, double-deck
PoA in conjunction with DAG organizational form, is on the one hand guaranteed the confidence level of eye-witness, on the one hand guarantees trade confirmation by common recognition framework
High concurrent, bilayer common recognition framework include the binding mechanism of PoA and DAG, and under the framework model of bilayer common recognition, node passes through PoA
Network carries out pledging acquisition authorization, and into the trade confirmation network based on DAG, which has high concurrent function from institutional framework
Can, the common recognition under high-performance situation can be supported to confirm, compared to similar block chain project, can on the one hand be realized in performance high
Concurrent mechanism guarantees the high-performance of transaction and contract affairs, realizes that dynamic eye-witness pledges election mechanism in safety, increases
The credibility of eye-witness, common recognition novelty combine PoA common recognition strategy and DAG Method of Data Organization, construct from bottom
The safe block chain common recognition network of high concurrent, is based on asynchronous full letter by the communication between each node of block catenary system maintenance system
It ceases transport protocol (asynchronous Full Information Transfer protocol), node is in communication, selection
Connecting object be all it is random, the time for reaching different nodes with information also can be variant, therefore to reach final one
Cause property, common recognition will safeguard all complete communication process of node in network, meanwhile, participant needs one storage of Dynamic Maintenance to have
All lists for participating in nodal information (including public key and port information), therefore, on the basis of well-designed and analysis, herein
Scheme proposes a kind of high concurrent two-layer hybrid common recognition mechanism of achievable dynamic node election, on the one hand can guarantee information
On the other hand consistency also has good performance in performance and safety.
This paper scheme proposes a kind of high concurrent two-layer hybrid common recognition mechanism of achievable dynamic node election, complete total
Knowledge process includes two parts accretion (Accretion) He Mojin (Sequentia), is shown in detail below by time sequencing
The process and function of common recognition.
Accretion module, the election of dynamic node, in astrophysics, accretion is by attracting more objects in accretion plate
Matter (usually gaseous material) is by particle aggregation at lump, and most of astronomy objects, such as galaxy, fixed star and planet are all
It is formed by accretion process, scheme indicates the first stage of common recognition using accretion process, because of the power in the network based on PoA
Limit node serves as the aggregation role between node, and accretion layer common recognition network is seen as PoA (authority proves) mechanism, and one kind passes through
Identity-based provides the block chain common recognition algorithm of relatively quick transaction, and the combination of equity pledge as the common recognition mechanism of voucher
Product, in the network based on PoA, transaction and block are verified by account's (authoritative node) by approval, they are by executing altogether
Transaction is put into block by knowledge process, and unlike traditional PoA algorithm, when generating block, the packing person of block is temporarily by preceding
The Hash of several blocks determines that this has sequentially increased randomness for participant's packing block, therefore is not influencing internal consensus
Under the premise of, the attack started because predicting packing sequence from outside is also avoided, scheme is by increasing controlling mechanism come to visit
Ask that node carries out access screening, to increase mould into the degree of belief having in layer to participant, arbitrary node wants to participate in mould into layer
Common recognition process when, will be required to prestore rental period of a part of token to obtain a period of time, if node still exists at the end of the rental period
It can all be returned in white list, permission node, according to its contribution when online, can give certain token Dynamic link library and to leave
Reward, more specifically, we describe the workflow of accretion layer common recognition network and motivation are as follows.
Node identification, each participant should be in can register by permission node maintenance in Pictest, and node is identified by address,
It is created using asymmetric cryptosystem, private key also by node control, will be successfully joined accretion layer network, and node must submit public affairs
The information such as key, Mac and IP port, to be used later in network connection and signature verification.
Registration table maintenance, the node (authoritative node) that accretion layer has been added play vital work in access control
With node can submit access passport of its registration information as the mould based on DAG into layer network, after being verified, Quan Weijie
Point can be added into members list, and the common recognition node of each mould into layer network requires to safeguard this list, and guarantee that it is consistent
Property, to be connected to the network later and use when signature verification.
Preventative to pledge, pledging for participant is the precautionary approach for avoiding perpetrating, and deposit brings threat to each node
Property constraint, according to the different rental periods, exact deposit amount be will be different, when regular node initially submits their information,
Not only to include proof of identification, should also include deposit token, complete rule and process can encode completion in intelligent contract, with
Ensure its transparency, no matter when trigger, program can all execute automatically, and deposit will maximumlly promote the honesty of node.
Economic incentives as the return to contribute to common recognition node, while encouraging more nodes to participate in maintenance network,
Paradigm equally also contains incentive mechanism, and incentive mechanism is designed in accretion layer, with mould into layer state intercommunication, does not make
The participant that vicious behaviour is can obtain certain token, will quantitatively comprehensively consider the quantity and frequency of the Comets of its generation
Deng.
Anti- Sybil attack, whether credit system is vulnerable to Sybil attack, cheap degree when generating depending on identity, prestige system
The degree that system receives the input of the entity from not trust chain link them to trusted entity and credit system whether with
All entities of same way processing, accretion layer network will force each participant to provide some deposits, and which increase forge network
The cost of middle identity, cost when identity creates reduce the motivation that node is done evil, effectively prevent the attack of witch.
After completing the node election and eye-witness's confirmation to accretion layer network, common recognition enters second mould into layer mould
Block, mould into the confirmation network that layer module is in entire common recognition towards transaction and contract, partially instead of traditional PBFT, BFT and
Eye-witness role in the networks such as DBFT, since the organizational form of bottom data structure is different, tradition common recognition is saved by eye-witness
Point carries out linear verification, and the traffic aggregation of all-network is in eye-witness's node, the drawbacks of on the one hand causing single point defects, another
Aspect causes the significant delays of whole network, and the bottom data structure of this programme carries out tissue by DAG mode, passes through figure
Mode instead of original chain mode, Down-Up construct the data flow of high concurrent.
Mould progressive die block, high concurrent common recognition network, mould is that value traveling repeats to lead into (Sequentia) derived from music terms
The melody or segment of topic, each round have one forward or downwardly direction, and each round can be over time
And accumulate, similar to when converting tonality, to the fast transition of music sequence, we come in indicate our second-order using mould
Section because constantly orderly being advanced during the propagation for seeming unordered based on the network of DAG, in fact, most of transaction or
Contract is mainly in mould into being created, be packaged and execute in layer.
Currently, algorithm of the big multi-tiling chain project using PoX system, belong to such as PoW and PoS, or with some other
Property replace work or stake, in this kind of algorithm, node generates block by way of competition book keeping operation power, but can not
Guarantee that every only one block of wheel generates, when two or more same height blocks are born, bifurcated will be led to, essence
On, mutual conflicting block be each often it is effective, only selection one be added main chain cause certain unjustness and
The wasting of resources, and inefficiency will also result in the processing of bifurcated, order execution delay confirmation etc., to avoid these problems, mould into
Layer network, instead of traditional chain structure, does not subtract branch processing using figure, and miner can according to need and generate block at any time, and
Without considering the problems of its failure, this mode enhances the scalability of system, and transaction can also be confirmed faster.
Another common algorithm is the innovatory algorithm of PBFT, this kind of algorithm based on leader be easy to because leader by
To attack, and the delay for causing global consistency to reach, it generally requires in addition, the common recognition in algorithm participates in node to leader's
Motion carries out more wheel ballots, this may cause O (n^2) the even information content of O (n^3), therefore consider the burden of network, such
Mode can not undertake too many node, and mould passes through the entire communication process of maintenance into layer network, so that node can be in local
The decision to something is calculated, and since the data of all nodes storage are the same, algorithm is the same, therefore the result of decision
All guarantee identical.
Mould is the asynchronous decisive system of no leader a kind of into layer common recognition network, and the concurrent function that it possesses can handle number
Thousand TPS, and there is the delay of submicrosecond grade, the information between node is propagated using gossip agreement, and each node is as much as possible
The Given information of oneself is broadcast to other members, node creates a Comet when receiving from other people information
As record point, Comet is a data structure, specifically includes:
| parent_Index | It is directly related with this Comet when creating this Comet, the index of Comet |
| Version | Version number |
| Index | The index of Comet typically represents the counting that this Comet generator generates Comet |
| Timestep | The creation time of the Comet is stabbed |
| Signature | The signing messages of Comet generator |
| Transactions | Zero or a plurality of transaction, are options |
Wherein, parent_Index represents a kind of relationship, as shown in the edge in figure, bevel edge indicate from remote node to
Local network communication, vertical edge is the Comet stored in chronological order created by same node, similar in construction to chain
Form, each Comet usually connects two father Comet (be connected directly with him and generate Comets earlier), and one
A Comet can be used as the father Comet of multiple Comet, be indexed by the signing messages of Comet internal record and father, not medium well
At Comet form an irreversible Cometgraph, each common recognition node requires to store complete Cometgraph,
To complete subsequent process, although newest part may be slightly different in the figure of each node storage, with pushing away for time
It moves, new traffic will soon eliminate this species diversity, be acted on by the index of parent_Index, the Comet generated afterwards can be
What is early generated makees existence proof, such as scheme CometB CometA can be traced back to by relationship (red line), at this time we can say that
CometB can prove CometA, (originate from CometC when this proves that path includes to surpass the Comet of 2/3 node creation
Green line), it is believed that this proof is known by enough nodes, it was demonstrated that strong proof has also been reformed into, has been Byzantine failure tolerance,
By way of proving and proving by force, we may further determine that whether some Comet has successfully been connect by most of nodes
It receives, in other words we can determine whether most of nodes to have had built up near the Comet, and part is complete and consistent
Cometgraph, for a Comet under acknowledgement state, we pass through the receiving time for calculating it in different nodes
Median, so that it may which all Comet being identified temporally are stabbed sequence by the relative time for obtaining this Comet, finally with regard to each section
All Activity wherein included just can be performed in point, and changes corresponding state, this process can be followed always in mould into layer network
Ring provides safeguard for the consistency of this paper scheme.
A kind of concurrent design mode of all module represents of the present invention, including but not limited to all based on PoA+DAG's
Match pattern, and the name of module is including but not limited to the proprietary title of this, all participation nodes of the present invention include but
The hardware devices such as common PC, stand-alone server, cluster server and mobile terminal are not limited to, scale is including but not limited to personal net
Network, mininet and medium size network etc..
In conclusion the high concurrent common recognition mechanism of dynamic node election can be with a side compared to similar block chain project
Face realizes high concurrent mechanism in performance, guarantees the high-performance of transaction and contract affairs, realizes that dynamic eye-witness pledges in safety
Election mechanism increases the credibility of eye-witness, and common recognition novelty combines PoA common recognition strategy and the data organization side DAG
Formula, the safe block chain for constructing high concurrent from bottom are known together network, between each node by block catenary system maintenance system
Communication is based on asynchronous full information transport protocol (asynchronous Full Information Transfer protocol),
Node in communication, the connecting object of selection be all it is random, the time for reaching different nodes with information also can be variant, because
This is to reach final consistency, and common recognition will safeguard all complete communication process of node in network, meanwhile, participant needs dynamic
State safeguards that a storage has all lists for participating in nodal information (including public key and port information), therefore, well-designed and
On the basis of analysis, this paper scheme proposes a kind of high concurrent two-layer hybrid common recognition mechanism of achievable dynamic node election, and one
Aspect can guarantee the consistency of information, on the other hand also there is good performance in performance and safety.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
It although an embodiment of the present invention has been shown and described, for the ordinary skill in the art, can be with
A variety of variations, modification, replacement can be carried out to these embodiments without departing from the principles and spirit of the present invention by understanding
And modification, the scope of the present invention is defined by the appended.
Claims (7)
- Mechanism, including common recognition mechanism 1. a kind of high concurrent of dynamic node election is known together, it is characterised in that: the common recognition mechanism packet Accretion layer module, mould are included into layer module and the double-deck common recognition framework.
- The mechanism 2. a kind of high concurrent of dynamic node election according to claim 1 is known together, it is characterised in that: the accretion Layer module is realized the planning and election of dynamic node, is provided the type of pledging credible guarantor for the selection of eye-witness using PoA common recognition thinking Barrier.
- The mechanism 3. a kind of high concurrent of dynamic node election according to claim 1 or 2 is known together, it is characterised in that: described Accretion layer module includes the node rotation mechanism of PoA common recognition mechanism with the combination pledged in advance, and arbitrary node is intended to enter section Point pond then needs to carry out the poll and mortgage of the round, realizes the accumulation of confidence level.
- The mechanism 4. a kind of high concurrent of dynamic node election according to claim 1 is known together, it is characterised in that: the mould into Layer module using DAG data structure carry out bottom layer tissue, realize for trade confirmation high concurrent state, by the logic of affairs into Row high-performance distribution processor.
- The mechanism 5. a kind of high concurrent of dynamic node election according to claim 1 or 4 is known together, it is characterised in that: described Mould includes the Method of Data Organization of DAG into layer module, and which provides strong witness and general witness, realizes trade confirmation Concurrent function improves the confirmation speed of the whole network.
- The mechanism 6. a kind of high concurrent of dynamic node election according to claim 1 is known together, it is characterised in that: the bilayer PoA in conjunction with DAG organizational form, is on the one hand guaranteed the confidence level of eye-witness, on the one hand guarantees trade confirmation by common recognition framework High concurrent.
- The mechanism 7. high concurrent that a kind of dynamic node according to claim 1 or 6 is elected is known together, it is characterised in that: described Bilayer common recognition framework includes the binding mechanism of PoA and DAG, and under the framework model of bilayer common recognition, node is carried out by PoA network Acquisition authorization is pledged, into the trade confirmation network based on DAG, which has high concurrent function from institutional framework, can prop up Hold the common recognition confirmation under high-performance situation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811430115.9A CN109523260A (en) | 2018-11-28 | 2018-11-28 | A kind of high concurrent common recognition mechanism of dynamic node election |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811430115.9A CN109523260A (en) | 2018-11-28 | 2018-11-28 | A kind of high concurrent common recognition mechanism of dynamic node election |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109523260A true CN109523260A (en) | 2019-03-26 |
Family
ID=65794434
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811430115.9A Pending CN109523260A (en) | 2018-11-28 | 2018-11-28 | A kind of high concurrent common recognition mechanism of dynamic node election |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109523260A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110298754A (en) * | 2019-06-21 | 2019-10-01 | 杭州云象网络技术有限公司 | A kind of common recognition method applied to block chain |
| CN110427376A (en) * | 2019-07-31 | 2019-11-08 | 北京米弘科技有限公司 | Traceability system, method, computer equipment and the computer readable storage medium of block chain |
| CN110493198A (en) * | 2019-07-26 | 2019-11-22 | 北京工业大学 | A method of it is attacked based on Sybil in PBFT algorithm defence block chain is improved |
| CN110506285A (en) * | 2019-01-08 | 2019-11-26 | 张季恒 | Method and device for block creation, addition, and ledger establishment based on directed acyclic graph |
| CN110502578A (en) * | 2019-08-16 | 2019-11-26 | 江苏链路区块链技术有限公司 | A kind of common recognition mechanism of rapid data cochain |
| CN110517140A (en) * | 2019-08-26 | 2019-11-29 | 华东师范大学 | A method for concurrent execution of blockchain smart contract transactions |
| CN110569246A (en) * | 2019-07-23 | 2019-12-13 | 腾讯科技（深圳）有限公司 | Block chain node information synchronization method, device, computer equipment and storage medium |
| CN110601834A (en) * | 2019-09-30 | 2019-12-20 | 深圳市网心科技有限公司 | Consensus method, device, equipment and readable storage medium |
| CN111049658A (en) * | 2019-12-12 | 2020-04-21 | 北京信息科技大学 | DAG-based whole-network unified trust anchor system, establishment method and authentication method |
| CN111327490A (en) * | 2020-01-20 | 2020-06-23 | 腾讯科技（深圳）有限公司 | Byzantine fault-tolerant detection method of block chain and related device |
| CN111461885A (en) * | 2020-03-31 | 2020-07-28 | 财付通支付科技有限公司 | Consensus network management method, device, computer and readable storage medium |
| CN111861459A (en) * | 2019-04-28 | 2020-10-30 | 常州一仙智能科技有限公司 | Iota account book optimization system and method based on DPoS consensus algorithm |
| CN111901350A (en) * | 2020-07-30 | 2020-11-06 | 平安科技（深圳）有限公司 | Block chain system, data processing method, computer device and storage medium |
| CN113923217A (en) * | 2021-09-30 | 2022-01-11 | 中国人民解放军国防科技大学 | A DAG-based Asynchronous Byzantine Consensus Method and System |
| CN114024705A (en) * | 2020-10-30 | 2022-02-08 | 北京八分量信息科技有限公司 | Trust architecture aiming at node dynamics |
| CN115118732A (en) * | 2022-07-06 | 2022-09-27 | 重庆邮电大学 | A consensus method based on dynamic weights for blockchain-enabled data sharing |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170323392A1 (en) * | 2016-05-05 | 2017-11-09 | Lance Kasper | Consensus system for manipulation resistant digital record keeping |
| CN107402824A (en) * | 2017-05-31 | 2017-11-28 | 阿里巴巴集团控股有限公司 | A kind of method and device of data processing |
| CN108564468A (en) * | 2018-04-04 | 2018-09-21 | 上海金丘信息科技股份有限公司 | A kind of common recognition method based on the dynamic equity for trusting member |
-
2018
- 2018-11-28 CN CN201811430115.9A patent/CN109523260A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170323392A1 (en) * | 2016-05-05 | 2017-11-09 | Lance Kasper | Consensus system for manipulation resistant digital record keeping |
| CN107402824A (en) * | 2017-05-31 | 2017-11-28 | 阿里巴巴集团控股有限公司 | A kind of method and device of data processing |
| CN108564468A (en) * | 2018-04-04 | 2018-09-21 | 上海金丘信息科技股份有限公司 | A kind of common recognition method based on the dynamic equity for trusting member |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110506285A (en) * | 2019-01-08 | 2019-11-26 | 张季恒 | Method and device for block creation, addition, and ledger establishment based on directed acyclic graph |
| CN111861459A (en) * | 2019-04-28 | 2020-10-30 | 常州一仙智能科技有限公司 | Iota account book optimization system and method based on DPoS consensus algorithm |
| CN110298754A (en) * | 2019-06-21 | 2019-10-01 | 杭州云象网络技术有限公司 | A kind of common recognition method applied to block chain |
| CN110298754B (en) * | 2019-06-21 | 2021-10-01 | 杭州云象网络技术有限公司 | Consensus method applied to block chain |
| CN110569246A (en) * | 2019-07-23 | 2019-12-13 | 腾讯科技（深圳）有限公司 | Block chain node information synchronization method, device, computer equipment and storage medium |
| CN110569246B (en) * | 2019-07-23 | 2022-03-11 | 腾讯科技（深圳）有限公司 | Block chain node information synchronization method and device, computer equipment and storage medium |
| CN110493198A (en) * | 2019-07-26 | 2019-11-22 | 北京工业大学 | A method of it is attacked based on Sybil in PBFT algorithm defence block chain is improved |
| CN110427376B (en) * | 2019-07-31 | 2022-04-05 | 北京米弘科技有限公司 | Tracing system and method of block chain, computer device and computer readable storage medium |
| CN110427376A (en) * | 2019-07-31 | 2019-11-08 | 北京米弘科技有限公司 | Traceability system, method, computer equipment and the computer readable storage medium of block chain |
| CN110502578A (en) * | 2019-08-16 | 2019-11-26 | 江苏链路区块链技术有限公司 | A kind of common recognition mechanism of rapid data cochain |
| CN110517140A (en) * | 2019-08-26 | 2019-11-29 | 华东师范大学 | A method for concurrent execution of blockchain smart contract transactions |
| CN110601834A (en) * | 2019-09-30 | 2019-12-20 | 深圳市网心科技有限公司 | Consensus method, device, equipment and readable storage medium |
| CN110601834B (en) * | 2019-09-30 | 2023-02-10 | 深圳市迅雷网络技术有限公司 | A consensus method, device, equipment and readable storage medium |
| CN111049658B (en) * | 2019-12-12 | 2022-09-16 | 北京信息科技大学 | DAG-based whole-network unified trust anchor system and establishment method |
| CN111049658A (en) * | 2019-12-12 | 2020-04-21 | 北京信息科技大学 | DAG-based whole-network unified trust anchor system, establishment method and authentication method |
| CN111327490A (en) * | 2020-01-20 | 2020-06-23 | 腾讯科技（深圳）有限公司 | Byzantine fault-tolerant detection method of block chain and related device |
| CN111461885A (en) * | 2020-03-31 | 2020-07-28 | 财付通支付科技有限公司 | Consensus network management method, device, computer and readable storage medium |
| CN111461885B (en) * | 2020-03-31 | 2024-03-19 | 财付通支付科技有限公司 | Consensus network management method, device, computer and readable storage medium |
| CN111901350A (en) * | 2020-07-30 | 2020-11-06 | 平安科技（深圳）有限公司 | Block chain system, data processing method, computer device and storage medium |
| CN114024705A (en) * | 2020-10-30 | 2022-02-08 | 北京八分量信息科技有限公司 | Trust architecture aiming at node dynamics |
| CN114024705B (en) * | 2020-10-30 | 2024-02-20 | 北京八分量信息科技有限公司 | Trust architecture for node dynamics |
| CN113923217A (en) * | 2021-09-30 | 2022-01-11 | 中国人民解放军国防科技大学 | A DAG-based Asynchronous Byzantine Consensus Method and System |
| CN113923217B (en) * | 2021-09-30 | 2024-04-16 | 中国人民解放军国防科技大学 | Asynchronous Bayesian-busy family consensus method and system based on DAG |
| CN115118732A (en) * | 2022-07-06 | 2022-09-27 | 重庆邮电大学 | A consensus method based on dynamic weights for blockchain-enabled data sharing |
| CN115118732B (en) * | 2022-07-06 | 2024-02-27 | 重庆邮电大学 | Dynamic weight-based consensus method for block chain enabled data sharing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109523260A (en) | A kind of high concurrent common recognition mechanism of dynamic node election | |
| US12038937B2 (en) | Computer-implemented system and method for managing transactions over a blockchain network | |
| Wan et al. | Recent advances in consensus protocols for blockchain: a survey | |
| US20190236716A1 (en) | Consensus system for managing digital record | |
| WO2018209542A1 (en) | Consensus method for decentralized domain name system | |
| CN110445778A (en) | A kind of common recognition algorithm applied to alliance's chain | |
| Kodali et al. | Blockchain based energy trading | |
| Li et al. | Recent advances of blockchain and its applications | |
| CN109039847A (en) | Method and device for solving block chain whole network message consistency problem by using DMT | |
| CN108988326A (en) | A kind of Distributed Intelligence energy management device and network | |
| CN111145025A (en) | Supply chain data double-chain storage optimization method based on block chain | |
| Alrehaili et al. | A comparative analysis of scalability issues within blockchain-based solutions in the internet of things | |
| Snow et al. | Business processes secured by immutable audit trails on the blockchain | |
| Abdella et al. | Hicoob: Hierarchical concurrent optimistic blockchain consensus protocol for peer-to-peer energy trading systems | |
| Li et al. | Q-learning improved lightweight consensus algorithm for blockchain-structured internet of things | |
| Lee et al. | Project management model based on consistency strategy for blockchain platform | |
| TWM586416U (en) | Implementing a multi-center, distributed verification system for transactions based on blockchain technology | |
| Montakhabi et al. | Fostering energy transition in smart cities: Dlts for peer-to-peer electricity trading | |
| Severeijns | What is blockchain? How is it going to affect Business? | |
| Chen et al. | LBDT: A Lightweight Blockchain-Based Data Trading Scheme in Internet of Vehicles Using Proof-of-Reputation | |
| Yu et al. | Blockchain-based PKI system and its application in Internet of Things | |
| Zhou et al. | Overview to blockchain scalability challenges and solutions | |
| Rahmadika et al. | A blockchain approach for the future renewable energy transaction | |
| CN118400086A (en) | A two-layer consensus method for enterprise-level composite blockchain | |
| Dorri et al. | Vericom: A Verification and Communication architecture for IoT-based blockchain |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190326 |