214 results about "Consensus method" patented technology

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.

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 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 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 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.

The invention belongs to the technical field of medical scene consensus, provides a medical alliance block chain grouping consensus method and system based on leader group decision, and aims to solve the practical problems of high communication complexity, power concentration and main node failure of a traditional PBFT in a large-scale node scene. Through hierarchical design of leader group decision, a grouping strategy is adopted to prevent a power concentration phenomenon, and through leader group parallel decision, post quantum security is guaranteed, communication overhead is reduced, consensus efficiency is improved, and the power concentration phenomenon is avoided.

The invention relates to a coincidence consensus method of agricultural product upper chain data based on an alliance chain, and belongs to the technical field of block chains and alliance chains. The method comprises the following steps: carrying out real-name identity classification and authentication on nodes added into an alliance chain; dynamically selecting a group of nodes through a verifiable random function to form a Byzantine error prevention consensus group; performing compliance verification on the agricultural product data by running a locally deployed automatic reporting plug-in, voting according to a verification result, and if data exception is found, automatically triggering passive forced reporting by the automatic reporting plug-in; when the consensus fails or a report is received, a report and arbitration process is started; distributing the agricultural product data and voting records thereof to a plurality of independent random review arbitration groups for independent verification, and determining a final consensus result; according to the method, the credibility of the alliance chain in agricultural data management is enhanced, and node attack, data tampering and collusion behaviors are effectively restrained through combination of technical prevention and an incentive mechanism.

The invention discloses a Byzantine consensus method and device, and relates to the technical field of block chains, and the method comprises the steps: allowing transactions of each replica node and the sequence information of the transactions to be perceived by other replica nodes in advance, and achieving the sorting and submission of all transactions in a consensus round in combination with a weight-recursive transaction sorting algorithm, the block chain consensus method has the advantages that acknowledgement delay is remarkably reduced, consistency and fairness of transaction sequences are improved, transaction verification and communication overhead is reduced by compressing transaction hash and simplifying transaction sorting based on the transaction ID mapping table, the whole consensus process has the advantages of high performance and low communication overhead, and consensus reliability in the block chain is improved.

The invention discloses a decentralized semi-asynchronous federated learning method based on committee consensus. The decentralized semi-asynchronous federated learning method specifically comprises a semi-asynchronous federated learning framework; participants are arranged in the framework, and the participants are divided into two identities, namely task publisher nodes and local equipment nodes; the federated learning task is determined by a task publisher node and specifically comprises information of a model structure, a training target, a model initialization parameter and an update quantity required by each round of global model update. According to the method, a high-performance, high-robustness and high-security semi-asynchronous federated learning framework is constructed, an innovative solution is provided for federated learning in a trustless environment, and the Byzantine committee consensus method oriented to semi-asynchronous federated learning has the advantages of being high in robustness and security under the condition of not depending on a third-party credible node. The security and reliability of the framework are ensured, and the efficiency and throughput of the framework are improved at the same time.

The embodiment of the invention provides a block chain consensus method, system and device and a medium, and belongs to the field of block chains. The method comprises the following steps: when an nth round of consensus task starts, entering a proposal stage, sending an nth proposal by a master node of a block chain network, broadcasting the proposal to a slave node, entering a voting stage, generating a vote after the slave node receives the nth proposal from the master node, and sending the vote to the master node; and when the master node receives votes exceeding 2 / 3 of the slave nodes, verifying the votes, submitting a block, entering an (n + 1) th consensus, and sending an (n + 1) th proposal carrying all votes collected in the nth proposal to the slave nodes by the master node of the block chain network, so that the votes of the nth proposal are verified and discharged after the slave nodes receive the (n + 1) th proposal. By simplifying the traditional PBFT algorithm and combining with the pipeline parallel technology, the consensus efficiency and throughput are significantly improved, and efficient operation of the block chain network is accelerated.

Embodiments of the present application disclose a node consensus method and system, wherein the method comprises: randomly selecting a supervision node set and a consensus node set in a total node set; using the consensus node set to perform consensus according to a consensus protocol to establish a block chain; when the number of blocks does not reach a standard within a preset time, using the supervision node set to supervise and detect the consensus content, and reselecting the consensus node set when it is confirmed that consensus cannot be performed; when the number of blocks reaches the standard within the preset time and a forked block chain appears, taking the forked block chains as the consensus content respectively, using the supervision node set to supervise and detect, selecting an optimal block chain as a final target block chain to complete block chain confirmation; when the number of blocks reaches the standard within the preset time and there is only one target block chain, taking the target block chain as the consensus content, using the supervision node set to supervise and detect the consensus content, and completing block chain confirmation. The safety and consensus efficiency of the consensus process are improved.

The invention relates to the technical field of block chains, and provides a block chain BFT consensus method and system for master-slave collaborative block construction, and the method comprises the steps: receiving a proposal block consensus request message, verifying an execution proposal block, supplementing the proposal block, and obtaining a complete block corresponding to the proposal block; wherein the proposal block is obtained by sorting and packaging transaction requests, and the complete block is obtained by removing invalid transactions from a transaction list on the basis of the proposal block after transaction verification execution, calculating a transaction root, a state root and a receipt root, and filling the transaction root, the state root and the receipt root into the block; the verification execution result about the proposal block is used as a consensus message, the consensus message is broadcasted and received, and a complete block passing consensus consistently is obtained based on the transmitted and received consensus message according to a consensus protocol; and writing the complete block passing the consensus into a block chain account book. In this way, one time of block execution time-consuming waiting can be reduced in each block consensus uplink process, transaction block falling is accelerated, the transaction throughput is improved, and transaction delay is avoided.

The present invention provides a blockchain consensus method and computer-readable storage medium, wherein the blockchain consensus method includes: determining multiple consensus nodes from authorized nodes through POA election; determining a PBFT master node from the multiple consensus nodes using a preset priority algorithm, and designating the remaining consensus nodes as PBFT verification nodes; performing PBFT consensus operations using the PBFT master node and PBFT verification nodes; and, if consensus is reached, broadcasting the consensus result to all nodes in the blockchain to synchronize the ledger status and form a new block. The solution of the present invention combines the Byzantine fault-tolerant consensus mechanism of PBFT master-slave nodes with the consensus of POA, avoiding malicious attacks caused by the severe centralization of the POA consensus mechanism.

The present application relates to a node consensus method, apparatus, device and medium in a blockchain system. In this method, each node locally stores a node transaction linked list corresponding to each node. Any batch package in any node transaction linked list is obtained by packaging multiple transactions in a transaction pool by the node corresponding to the node transaction linked list after the voting information of each node on the previous batch package meets the preset requirements. This allows the consensus master node to accurately determine the last batch package whose voting information meets the preset requirements from the locally stored node transaction linked lists as the target batch package, and only packages the target batch package of each node transaction linked list into a consensus message package, without having to package all transactions, thereby improving packaging efficiency. The consensus message package is broadcasted, so that the consensus sub-nodes in the blockchain system can reach consensus on the target batch package of each node transaction linked list contained in the consensus message package, without having to reach consensus on each transaction, thereby further improving the node consensus efficiency in the blockchain system.

The present application relates to the technical field of unmanned aerial vehicle swarm technology and blockchain technology, and particularly relates to a chain BFT consensus method for unmanned aerial vehicle ad hoc network. The present application selects a plurality of unmanned aerial vehicles for network authentication, constructs an unmanned aerial vehicle ad hoc network, constructs an ad hoc network topology structure, selects consensus nodes based on flight requirements, constructs a consensus network topology structure, assembles a consensus network based on a chain BFT protocol, divides the consensus nodes into a plurality of chain nodes and a plurality of backup chain nodes, optimizes the consensus network using a PSO algorithm to determine the chain sequence of each chain node in the consensus network, transmits information according to the chain sequence, and updates the topology structure in the consensus network based on a sudden situation to redetermine the chain sequence of each chain node. The present application guarantees the timing of information transmission, effectively determines the optimal chain sequence quickly and accurately, effectively guarantees the data transmission efficiency, effectively reduces the communication complexity, and effectively improves the consensus efficiency of the unmanned aerial vehicle group in the consensus network.

The invention discloses an auction record layering and domain-dividing consensus method for a computing power block chain network, and the method comprises the steps: constructing a comprehensive scoring system based on the activeness, creditworthiness and task adaptation degree of nodes, and dynamically electing a high-reliability leader node; dynamically dividing following nodes into different levels based on inter-node multi-dimensional communication indexes; averagely dividing data carried by the leader node into a plurality of data fields; establishing a follower node communication cost and storage cost model; establishing a node selection model based on communication cost and storage cost and considering backup times, and selecting a node to copy an auction record; and generating a dynamic key by using a hierarchical and domain-divided result and node spatio-temporal information, and performing encrypted storage on a node auction record. According to the method, the problems of low leader election efficiency, high node bearing pressure, insufficient expansion capability and the like of the global consensus method in a computing power resource transaction scene are solved, and the method has a wide application prospect.

This invention proposes a multi-committee parallel Byzantine fault-tolerant consensus method, GP-BFT. This method groups system replicas into multiple independent committees based on the minimum Byzantine fault tolerance parameter. Each committee executes consensus in parallel, effectively reducing intra-group communication. A two-level leader election is employed: each committee elects a first-level leader responsible for intra-group consensus, and a second-level leader is elected from among the first-level leaders using a threshold coin to coordinate globally. A dual timeout handling mechanism is designed: when less than half of the committees time out, cross-path collaborative commit is used, leveraging committees that have completed consensus to drive the timed-out committees to quickly resubmit; when more than half of the committees time out, aggregated timeout certificates are used to advance the global round. This method significantly reduces consensus latency and communication overhead in large-scale replica scenarios while ensuring security and liveness.

The embodiment of the invention provides a consensus method based on grouping concurrence weighted random, which can be applied to the technical field of block chains. The method comprises the following steps: performing grouping on all online consensus nodes in a block chain network; for all business transaction data in the block chain network, executing transaction distribution according to the node grouping information; based on the number of randomly extracted nodes and the node weight information of all the online consensus nodes, extracting participating consensus nodes according to the node grouping information, and generating a participating consensus node set; randomly determining proposal nodes and verification nodes in the consensus participating node set; determining transaction verification information of the verification node according to candidate verification blocks provided by the proposal node according to the transaction distribution information; and according to the pre-packaged block corresponding to the transaction verification information, block splicing corresponding to each node group is executed to form a complete block chain. The embodiment of the invention further provides a consensus device and equipment based on grouping concurrence weighted random, a storage medium and a program product.