319 results about "Consensus method" patented technology

The invention discloses a practical Byzantine fault-tolerant consensus method, device and equipment for commodity transaction in a block chain, a medium and a product, and relates to the field of block chains. The method comprises the following steps: initializing alliance chain network nodes, and dividing the alliance chain network nodes into a double-layer network structure comprising a main network layer and a secondary network layer; grouping in a secondary network layer according to the nearest neighbor communication time delay of the nodes; after each round of consensus is finished, reputation score calculation is carried out on the nodes based on attribute scores of mechanisms to which the nodes belong and dynamic behaviors of the nodes in the commodity transaction process, the node with the highest reputation score is periodically selected from each group to serve as a main node in the group, and other nodes in the group serve as common nodes; local consensus is carried out on the main node and the common node in each group in the respective group; and adding the main nodes in each group to a main network layer to participate in global consensus. According to the invention, the overall consensus efficiency and stability of the network can be improved, and stable and efficient transaction of commodities on the block chain is ensured.

The invention belongs to the technical field of alliance chain consensus, and discloses an alliance chain consensus improvement method and system based on contribution degree and grouping, and a CG-PBFT algorithm aims at optimizing the performance and efficiency of a block chain network. According to the algorithm, the consensus set is grouped, so that the communication complexity among the nodes is reduced, the nodes in the group are easier to cooperate, and the throughput and efficiency of the network are improved. In order to solve the problems of performance imbalance, safety and resource consumption of a PBFT algorithm, a consensus mechanism based on contribution degree is introduced into CG-PBFT, and a node with the highest contribution degree is selected as a master node through management of a master node election stage. The node contribution degree is a measurement method for measuring the overall contribution of the nodes to the network, and the node data contribution degree and the online resource consumption are mainly considered. The CG-PBFT algorithm is combined with the PoC contribution degree algorithm and the PBFT algorithm, the consensus consistency and the final consistency of the nodes are ensured, and meanwhile, the risk that an attacker tampers the consensus is reduced by reasonably grouping the consensus nodes.

The present invention relates to the technical field of blockchains, and in particular to a blockchain-based multi-partition asynchronous parallel consensus method. The method comprises: constructing a multi-partition asynchronous parallel consensus blockchain system comprising a plurality of partitions and a plurality of guide nodes; for each partition, each ordinary node publishes and broadcasts transaction information in the partition to which it belongs, and each ordinary node collects and stores the transaction information published in the partition to which it belongs; each partition creates a partition block by executing an intra-partition consensus algorithm, and uses a main node to upload the partition block to a guide node; and each guide node sorts the collected partition blocks, and selects one partition block therefrom to execute an inter-partition consensus algorithm. The present invention enables the synchronous intra-partition consensus initiation and execution provided for in existing sharded blockchain systems to now be performed asynchronously, thus improving system parallelism, transaction information processing throughput, and cross-shard communication processing efficiency.

A safe and efficient improved PBFT Internet of Vehicles block chain consensus method, system, device and medium, and the method comprises the steps: carrying out the pre-screening according to a vehicle comprehensive trust value, and obtaining an initial set of entrusting consensus nodes; performing multi-criterion decision analysis according to the trust value of the vehicle, the communication channel capacity, the data collection time and the difference value of the existing timestamp, obtaining a score ranking, and selecting the first K nodes as entrusting consensus nodes; selecting a leader node by adopting a VRF verifiable random function; entrusting the consensus node to carry out consensus, and carrying out aggregation signature in a consensus preparation stage and a consensus submission stage by adopting a BLS-based signature technology; based on a D3QN deep reinforcement learning algorithm, optimizing the throughput of the block chain consensus; consensus is completed, trust value updating is carried out based on consensus performance of the nodes, and data is stored in a block chain account book; the system, the equipment and the medium are used for implementing the method. The method can reduce the consensus delay and increase the consensus throughput, and has the advantages of safety, high efficiency and the like.

The invention provides a high-scalability consensus method based on a Paxos protocol in a cloud side end environment, and belongs to the technical field of distributed computing, edge computing and cloud computing. The method comprises the following steps of: hierarchically dividing nodes of the distributed consensus system into an upper layer and a lower layer; calculating the weight of an upper layer node; an arbitration set calculation method of an EPaxos protocol is modified, so that the distributed consensus system keeps high availability and high performance; adopting an optimization strategy based on delayed batch submission to optimize a submission strategy of the EPaxos protocol; the proposal replication and leader switching mechanism based on the EPaxos protocol ensures high availability and stability of the distributed consensus system; the weight distribution of the upper layer nodes is dynamically adjusted according to the real-time state and historical performance of the nodes, so that the distributed consensus system can adapt to the change of a network environment and node faults; the throughput and the consensus success rate of the distributed consensus system are improved by optimizing a proposal submission strategy.

The invention provides a Raft consensus method based on a weighted PageRank and a BLS threshold signature, and belongs to the technical field of block chains. The problem that the consensus efficiency and the Byzantine fault-tolerant capability of a common consensus algorithm of a current alliance chain are difficult to balance is solved; comprising the following steps: system initialization: starting each node of a consensus cluster and initializing each node attribute, adding two node attributes on the basis of the original node attribute of a Raft algorithm, namely a node initial pr value and a public and private key pair (pki, ski) required by node signature verification, and performing communication through a heartbeat mechanism after each node is successfully started; performing leader election: traversing communication conditions of all nodes, constructing a weighted directed graph according to the communication conditions among the nodes, calculating a pr value of each node through a weighted PageRank algorithm, and setting a relatively short election timeout time for the node with the high pr value, so that the node becomes a leader more easily; log copying: performing log copying based on the threshold signature of the BLS; the method is applied to the alliance chain.

Embodiments are provided herein describe a proof of majority block consensus method based upon a mutually enforced collaboration between the nodes. A node may maintain a random subset of connected peer nodes, refreshed at every epoch through network gossiping protocols. The node may propagate received transactions to selected peers in the random subset. The node may generate a transaction ballot from received transactions and iteratively update the transaction ballot by mutual exchanges with other nodes until the network converges. The node may generate a block—and a hash thereof—based upon its understanding of the transaction ballot. The node may also receive hashes from other connected nodes and identify a hash generated by the majority of peer nodes. If the node determines that its own hash is the one generated by the majority of peer nodes, the node may update its local copy of the blockchain by appending its block.

The invention discloses an improved PBFT consensus method and terminal, and the method comprises the steps: updating an initial reputation value of a node through a first PBFT consensus algorithm, and selecting a main node; the main node and the consensus node receive transaction information sent by the client and store the transaction information to node memory pools corresponding to the nodes respectively; the consensus node sends a transaction receiving notification to the main node, the main node sends a transaction confirmation message to the consensus node, and if the consensus node does not receive the transaction confirmation message, a transaction confirmation information obtaining request is sent to the main node; otherwise, judging whether transaction information corresponding to the transaction confirmation message exists in a node memory pool of the main node according to the transaction confirmation message, if not, broadcasting a transaction request to the node containing the transaction information to obtain the transaction information, constructing a candidate block by the main node, putting the transaction hash into the candidate block, and sending the transaction hash to the main node; and the broadcast candidate block is consensus through a second PBFT consensus algorithm, so that the bandwidth consumption of the main node is reduced, the block throughput is improved, and the disability possibility of the main node is reduced.

The invention relates to a BFT-based block chain consensus method and system. In the scheme, a main node detects a node change transaction, generates a view lock and broadcasts the view lock to all consensus nodes, and each consensus node generates a new private key fragment and a new public key vector in a reconstruction window; the main node generates a new view according to the new public key vector and broadcasts the new view to each consensus node, each consensus node sends a threshold signature to the main node after verifying the new private key fragment according to the new view, and the main node generates an aggregation signature according to a predetermined number of threshold signatures and generates a new block according to the aggregation signature and the new view; and after submission is confirmed through a consensus process, a node list is updated, and node reconstruction is completed. Therefore, when the main chain detects the node change transaction, the rotation of the secret key and the reconstruction of the node can be completed in the reconstruction window, so that the member reconstruction can be safely carried out on the premise of not stopping the machine; moreover, the public and private keys can be updated when the members change, and the security of the keys is improved.

The invention discloses an improved PBFT consensus method for an energy block chain, belongs to the technical field of energy block chains, and particularly relates to an improved PBFT consensus method based on the energy block chain, which comprises the following steps: firstly, dividing consensus nodes into four classes according to the speed of nodes participating in consensus, evaluating each consensus node according to node performance and credibility so as to retain efficient consensus nodes; then, designing a node dynamic access mechanism, solving the problem that the nodes cannot join in or exit from the consensus when the PBFT algorithm runs, and dynamically changing the number of the nodes in the consensus; and finally, introducing a random verifiable function VRF to select a leader in a consensus process. Compared with the traditional PBFT consensus algorithm, the method effectively reduces the transaction time delay of the consensus process, increases the throughput, improves the security and consensus efficiency of the block chain system, and has a better development prospect in the energy field.

The invention provides a lightweight consensus method suitable for a large-scale unmanned aerial vehicle cluster. The lightweight consensus method comprises the steps that a master unmanned aerial vehicle generates a proposal according to a client instruction and a qualification proof and sends the proposal to a slave unmanned aerial vehicle; verifying the legality of the proposal and the qualification proof from the unmanned aerial vehicle, signing the proposal according to the private key fragment and the commitment list after the verification is passed, and generating a signature fragment and a new commitment; the slave unmanned aerial vehicle sends the signature fragment and the new commitment as a proposed vote to the master unmanned aerial vehicle; and after the main unmanned aerial vehicle receives a target number of votes passing verification, aggregating a plurality of signature fragments to obtain an aggregated signature, and generating a qualification proof of a next round of proposal by using the aggregated signature and the new commitment list, thereby completing a round of voting, and realizing consensus of a client instruction after three rounds of voting. According to the method, the calculation amount, the storage amount and the communication complexity can be reduced, and the lightweight of the block chain system is realized in calculation, storage and communication, so that the transaction processing delay is reduced, and the system throughput is improved.

The invention discloses an efficient double-link block chain consensus method and device, equipment and a storage medium, and belongs to the field of information security. The method comprises an initialization stage, an input stage, a coding stage, a broadcasting stage and a consensus stage. According to the invention, the parallel design of a coding broadcast link and a consensus confirmation link is adopted, so that the occurrence frequency of transaction congestion is reduced; the integrity required by the asynchronous Byzantine consensus process is realized through three-step broadcasting, the updating problem of the post-quantum component does not need to be considered, and the security is higher; an asynchronous network and a Byzantine opponent model are adopted, so that malicious node attacks which do not exceed the total number of nodes can be tolerated on the premise of not setting a network time delay upper limit; in the encoding stage, the generation of the redundancy share through the RS erasure code can be realized by adopting preprocessing, the data redundancy expansion multiple in the broadcasting stage is far smaller than that of the same type of protocol, and the original transaction can be recovered by collecting part of effective shares in the consensus stage, so that the system time delay is effectively reduced, and the system throughput is improved.

The present disclosure discloses a blockchain consensus method and a blockchain replica apparatus, and provides a cBFT protocol with a plurality of different voting thresholds, which may reduce a communication complexity of the protocol, reduce a consensus agreement time, improve a throughput of a consensus system, and simultaneously reduce sensitivity of the protocol to a timer.

The invention relates to a block chain consensus method for the Internet of Things, and the method specifically comprises the steps: carrying out the statistics of the data collection frequencies of all data collection nodes in the Internet of Things, and determining a consensus target value according to the number of consensus nodes and the frequencies; the method comprises the following steps: acquiring network flow and a source of the network flow of a consensus node from last block generation to the current moment, determining the participation degree of the consensus node in the Internet of Things by utilizing the network flow, the source of the network flow and the type of the consensus node, taking a node of the source of the network flow as a verification node, and verifying the participation degree by the verification node, if the verification is not passed, the reputation value of the consensus node is adjusted based on the data volume sent to the consensus node by the verification node; and the consensus node recalculates the target value by using the reputation value and the participation degree to obtain the target value of the consensus node when the block is generated, generates the block based on the target value of the consensus node and adds the block into the block chain. The problem that resources are limited when the block chain is applied in the Internet of Things is effectively solved.

The invention relates to a user preference and reputation value-based dynamic PBFT consensus method, which comprises the following steps of: introducing a user preference model, and allowing a user to customize parameters to elect a consensus node and a main node; by introducing a user preference model and a grouping mechanism, the performance of the consensus node and the main node better meets the user requirements; the reputation values of the nodes are dynamically calculated, the reliable nodes can be selected as the main nodes, the Byzantine nodes can be timely found and processed in the consensus process, the influence of the Byzantine nodes is reduced, and the attack resistance of the system is improved. According to the method, the adaptability of the system is improved, diversified application requirements are better met, and compared with a traditional PBFT method, the method has higher safety and performance.

The invention relates to the field of block chain technology and supply chain management, in particular to an alliance block chain consensus method based on a differential evolution algorithm and credit grouping mechanism optimization. The invention provides an improved consensus method, and aims to solve the problems of low consensus efficiency and high communication overhead of a traditional PBFT (Practical Byzantine Fault Toolness) algorithm in a large-scale network. According to the method, firstly, a plurality of nodes in a supply chain network are pre-selected through a differential evolution algorithm, a batch of reliable node sets are selected, and the consensus scale is reduced; and then, dynamically grouping the pre-selected nodes by adopting a credit grouping mechanism to ensure that the high-reliability nodes participate in the consensus process, thereby improving the consensus efficiency. And finally, the optimized PBFT algorithm reduces the communication overhead in the consensus process by simplifying a submission stage into a feedback stage. Experimental results show that the consensus efficiency of the alliance block chain can be effectively improved, the communication complexity is reduced, and the method is suitable for data sharing application in a large-scale supply chain network.

The invention relates to the technical field of application of a block chain in a virtual power plant, in particular to a resource aggregation layer distributed consensus method and system, and the method comprises the steps: completing node registration and identity authentication; the nodes are calculated and clustered to form a double-layer network structure; and consensus is carried out on the nodes according to a preset process. The method has the advantages that the defects of a traditional consensus algorithm in the aspects of energy consumption, transaction processing speed and large-scale node communication overhead are effectively overcome by adopting the preset consensus process, and efficient and safe resource aggregation and transaction management are achieved; a key negotiation algorithm based on a Schnorr protocol and a DH algorithm is adopted, so that the calculation and communication cost is reduced, a safe and reliable communication channel is provided for a distributed system, and the anti-attack capability of the system is enhanced; through a node reputation value calculation method integrating multiple factors and a target K-means algorithm, a multi-consensus-group double-layer network structure is formed, the communication overhead is reduced, and the consensus efficiency and the system stability are improved.

The invention discloses a block chain consensus method and device based on a Raft consensus mechanism, equipment, a medium and a product. The method comprises the following steps: if it is determined that a self block chain node is a leader node, obtaining a block transaction; if the transaction number of the block transactions is at least two, transaction submission consensus of the block transactions is carried out at the same time based on the follower node; the follower nodes are other block chain nodes except the leader node in the block chain network; when it is determined that the transaction submission consensus of each block transaction is consistent, executing each block transaction according to the transaction identifier of each block transaction to obtain a transaction execution result of each block transaction; and based on the follower node, transaction result consensus of the block transactions is carried out at the same time, and a consensus result of the transaction result consensus is obtained. According to the technical scheme of the embodiment of the invention, the throughput of a block chain network or a block chain system based on a Raft consensus mechanism is improved, and the transaction execution efficiency is improved.

The present application relates to the technical field of block chains, and in particular to an asynchronous network consensus method and apparatus, an electronic device and a readable storage medium. The method comprises: receiving and verifying transaction proposals broadcasted by other consensus nodes in an asynchronous network, and broadcasting the transaction proposals to the other consensus nodes; on the basis of historical submission records of the transaction proposals, counting a reputation score corresponding to each consensus node in the asynchronous network; and on the basis of the reputation scores of the consensus nodes and a random source, determining a target transaction proposal to be submitted corresponding to a target consensus round. The reputation scores of the consensus nodes are counted by means of the historical submission records, and the random source in the asynchronous network takes into account the activity of the consensus nodes, improving the probability of correctly submitting proposals, improving the activity of an asynchronous consensus algorithm in a Byzantine fault-tolerant system of the asynchronous network, and shortening the consensus achievement duration.

The invention discloses a block chain consensus method and system based on dynamic Byzantine consensus, which are applied to a distributed system on a block chain, and the method comprises the following steps: in a preparation stage, after a leader node receives a proposal, proposing a new block, and broadcasting a preparation message; after the replica node receives the preparation message and successfully verifies the validity of the block in the preparation message, the replica node sends preparation information of a local signature to the leader node; in the pre-commitment stage, the leader node broadcasts a pre-commitment message; when the replica node belongs to the previous system configuration and does not belong to the current system configuration, the replica node leaves the distributed system after receiving the pre-commitment message and submitting all blocks of the previous period; in the decision stage, the leader node broadcasts a decision message; and when the replica node belongs to the current system configuration, submitting the block according to a preset submitting mode. According to the method, the performance of the system cannot be reduced when the member joining / leaving instruction is processed, and the linear communication complexity is met.

Disclosed by the present disclosure are a blockchain consensus method and apparatus, in which the method comprises: broadcasting, by each blockchain replica node in an asynchronous network, a proposal message corresponding to the blockchain replica node in a current epoch corresponding to the blockchain replica node, forming a weak certificate corresponding to the blockchain replica node in the current epoch after collecting signature voting information fed back by f+1 blockchain replica nodes based on the proposal message, and entering a next epoch after collecting the proposal messages broadcasted by 2f+1 blockchain replica nodes in the current epoch; and performing a blockchain consensus for each blockchain replica node in the asynchronous network after receiving the weak certificates of the same epoch broadcasted by 2f+1 blockchain replica nodes. The present disclosure can effectively improve the consensus efficiency and the transaction throughput.

Provided are a CA consensus method, an apparatus, and a node. The method comprises: obtaining a final voting result for a voting event on the basis of voting results of a plurality of first CAs; and when the final voting result indicates that the voting event passes, executing a first operation, wherein the first operation comprises registration of a CA, revocation of a CA, or update of a root certificate. In this way, a decision can be jointly made by a plurality of CAs without relying on a central CA, thereby improving the degree of decentralization of DPKI systems, and thus improving the overall security of the DPKI systems.

A cross-shard collaborative consensus method for drone clusters based on a reputation mechanism belongs to the technical field of drone cluster collaboration. The present invention solves the problems of heavy storage burden, high communication overhead, limited scalability and poor fault tolerance in existing systems. By combining state sharding technology and a multi-dimensional reputation evaluation mechanism, and realizing dynamic optimization allocation of tasks based on a task collaboration network and a label propagation mechanism, the system can adaptively adjust the sharding structure according to real-time load conditions, and the sharding strategy based on task correlation can reduce the communication overhead of cross-shard collaboration. The two-stage cross-shard transaction mechanism designed by the method of the present invention combines multiple guarantees such as lock-up period, multiple signatures and proof of failure. Through a lightweight state synchronization mechanism and the PBFT consensus protocol, it not only ensures the consistency and reliability of the data, but also improves the scalability and fault tolerance of the system. The method of the present invention can be applied to the field of drone cluster collaboration.

The present invention proposes an improved and optimized PBFT consensus method and system applied to a consortium blockchain. Aiming at the application scenario of the supply chain blockchain, the present invention divides all nodes into four groups: an arbitration group, a consensus group, a candidate group, and a Byzantine group. The nodes in the arbitration group are promoted from the primary nodes in the consensus group. By introducing arbitration nodes to process the applications of newly joined and exited nodes, the consortium blockchain system can be made dynamic. At the same time, the arbitration nodes are periodically served by multiple primary nodes, enabling the system to be better decentralized and ensuring the security of the system. Before the consensus starts, some nodes are selected from the candidate group to enter the consensus group to participate in the consensus, which can effectively solve the problem of high communication complexity caused by a large number of nodes. At the same time, a consensus coefficient is introduced to handle Byzantine nodes. In addition, for the exited nodes, the node information is not directly deleted, in order to save the configuration time for the exited nodes to rejoin the blockchain system.

The application provides a consensus method and system for alliance chain based on RPBFT improvement, and belongs to the technical field of blockchain consensus. The method comprises the following steps: S1, constructing a node list; S2, initializing a blockchain, selecting n1 nodes from the node list to construct a consensus committee node list; S3, in the initial consensus round or the initial consensus round after dynamic replacement, the first node in the consensus committee node list is selected as the master node by default; S4, performing an improved consensus algorithm on the consensus committee nodes, if an abnormal condition such as verification failure or transaction processing timeout occurs, switching to the PBFT algorithm and starting the consensus again; S5, scoring according to the performance of the participating consensus committee nodes; and S6, after generating n2 blocks, a verification node is randomly selected by using a VRF function to replace the consensus committee node with the lowest score, and the scores of all the consensus committee nodes are cleared. The method can improve the performance while ensuring the safety.

The present disclosure provides a data consensus method and device for an Internet of Things device. The method receives a consensus data block through a consensus module, stores the consensus data block in a consensus data storage linked list according to a consensus storage rule, wherein each consensus module contains at least one consensus data storage linked list; determines the value of the consensus data block, and determines the number of times the consensus data block is sent according to the value of the consensus data block; obtains the number of times the consensus data block is sent; and determines the synchronous sending processing of the consensus data block according to the number of times the consensus data block is sent. By utilizing the method disclosed in the present disclosure, it is only necessary to manage the consensus data storage linked list, and according to the present method and by utilizing the consensus communication sending port and the consensus communication interface port of each consensus module to send and receive the consensus data block, the data of all nodes can be quickly and reliably formed into a synchronous consensus.

The invention discloses an adaptive dynamic fragmentation block chain network construction method and system. A verifiable random function is used to quickly elect a directory committee and a consensus committee. And the directory committee generates a committee state table for recording the state of the consensus committee, and assists the consensus committee in consensus. The invention designs a consensus committee number adjustment algorithm to adjust the number of committees according to transaction processing requirements. According to the method, a weighting mechanism is designed for the consensus committee, so that the efficient consensus committee calling sequence is realized, and the consensus efficiency is improved. The invention also provides a new consensus method for reducing repeated consensus through threshold signature. The fragment number of the fragment block chain can be dynamically adjusted, the consensus efficiency is improved, and the expenditure of repeated consensus is reduced.

The application provides a consensus method based on data sharing of Internet of Vehicles edge computing, comprising collecting information and constructing data blocks; defining trust value influencing factors of shared data vehicles, the trust value comprising a reward mechanism and a punishment mechanism; giving definitions, applying an evaluation algorithm to evaluate the trust value of the vehicles; designing an agent node election rule of an edge node; and determining a consensus process scheme of data sharing. Compared with the prior art, the application can improve the credibility of shared data and effectively eliminate malicious nodes.

The application discloses a Byzantine fault-tolerant consensus method based on a double reputation model, relates to the technical field of network security protocols, and particularly relates to a Byzantine fault-tolerant consensus method based on a double reputation model and a device. In order to solve the problems of high centralization risk and untimely malicious node identification of an existing consensus method, the application provides a Byzantine fault-tolerant consensus method based on a double reputation model, which comprises the following steps: S1, collecting temporary threshold signatures and temporary parameters generated in each stage of communication in a consensus process, and detecting consensus behaviors of each node; S2, evaluating each node based on a double reputation model, and distributing a combined identity of each node; and S3, electing a leader node when each round of consensus is started, and eliminating a Byzantine node. The application is suitable for blockchain systems, government data sharing, digital identity authentication and other fields with high requirements for data consistency and attack resistance.

The invention provides an anti-recombination attack consensus method and system, and the method comprises the steps: carrying out the random leader election from verifiers through employing a verifiable random function constructed by a chain type random seed in each consensus process; the selected leader generates blocks, each verifier verifies the blocks after receiving the blocks of the round, and if the verification is passed, the corresponding blocks are sequentially put into a voting waiting sequence; each verifier obtains a voting waiting sequence and preferentially votes to the block with the minimum random binary hash sequence; and iteratively performing multiple rounds of voting, if the leader collects effective votes with a satisfactory number, generating a proof of a previous block and putting the proof into the block, and when two continuous blocks obtain the proof, reaching a final determined state. According to the method, chain recombination attacks can be resisted, it can be guaranteed that the block outlet sequence cannot be predicted, and meanwhile the leader election probability can be stable so as to reduce the block recombination rate.