169 results about "Consensus method" patented technology

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

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

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

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.

The present invention discloses a consensus method for frequent multi-party service transactions based on blockchain: a subnetwork is constructed in the blockchain with business as the establishment unit, each subnetwork includes a service user node and a service user node; the service user calls the service to generate a service call record; in chronological order, the service user and the corresponding service provider package the service call record into blocks; the service provider node with the largest idle computing power weight in the subnetwork serves as the referee node; the service user sends the blocks to the referee node in the order of packaging, and the blocks carry the information tags of the corresponding service providers; the referee node requests blocks with the same information tags from the corresponding service providers and compares them to determine that the same blocks are consensus blocks; in the order in which consensus is achieved, the referee node broadcasts the consensus blocks to the blockchain network. This method can shorten the consensus time, improve the consensus efficiency, and ensure the confirmation and verification of transactions by the participating parties.

The application provides a business consensus method for supply chain traceability business correlation and computer equipment, and relates to the technical field of blockchains. The application realizes business consensus by selecting key subjects from traceability subject social network participating subjects through digital signature technology, determines consensus nodes by the key subject set obtained through business consensus, and realizes blockchain consensus of signed transaction data by the consensus nodes. The application realizes consensus through consensus nodes, simplifies the consensus process, and improves the consensus efficiency. Meanwhile, the application determines the consensus nodes in PBFT through the key subject set, reduces the communication times in the commit stage compared with the traditional PBFT, and reduces the communication cost.

The application discloses a kind of alliance chain slice construction and consensus method based on dynamic clustering, comprising, the real-time computing power of alliance chain node, transaction frequency and transmission rate are collected;By verifiable random function, node is divided into Full_node of storing complete data and Slice_node of only storing slice data;DQN algorithm is used to determine the number of slices K, and the final consensus group is formed by selecting consensus representative nodes from Full_node based on dynamic performance threshold;The correlation matrix between the remaining nodes is constructed, and the nodes are evenly distributed to K slices by means of improved clustering algorithm;In each slice and consensus group, the Leader node is elected;When a new transaction arrives, execute the corresponding consensus process according to whether the transaction parties belong to the same slice, and write into the blockchain after verification, collect consensus performance data by Leader, and determine whether to trigger slice reconstruction according to performance data: if triggered, re-slice, otherwise continue to process transactions until completion;The application can improve the throughput of the overall system, relieve the data storage pressure, and improve the system response efficiency.

The invention provides a CA consensus method, a CA consensus device and a node. Wherein the final voting result of the voting event is obtained based on the voting results of the plurality of first CAs; under the condition that the final voting result indicates that the voting event passes, executing a first operation; wherein the first operation comprises CA registration, CA logout or root certificate updating. Thus, the decentralization degree of the DPKI system can be improved through co-determination of a plurality of CAs without relying on a central CA, and the overall safety of the DPKI system is further improved.

This application provides a blockchain consensus method and device, electronic device, and storage medium. The method includes: when a blockchain forks at a first block height, selecting a forked block as a parent block and the remaining forked blocks as uncle blocks based on the random number of each forked block; generating a new block at a second block height based on the information of the uncle block; broadcasting the new block in the blockchain network, so that after receiving the new block, consensus nodes in the blockchain network verify the correctness of the new block. If the verification is successful, the consensus voting process for the new block begins. This solution eliminates the need for manual intervention in forking issues. When a forked block occurs, consensus can continue, increasing the fault tolerance of the consortium chain against malicious nodes.

The application discloses a node credibility consensus method, which comprises the following steps: grouping nodes and electing consensus nodes in each node group; each node monitors adjacent nodes in the node group, generates transaction information based on abnormal behaviors of the adjacent nodes, and sends the transaction information to the consensus nodes in the corresponding node group; credibility change information of the nodes with abnormal behaviors is generated based on the transaction information, and the credibility change information is consensused among the consensus nodes of each node group, and the credibility information of each node is updated based on the consensus result; based on the updated node credibility information, the credible nodes are screened, the credible nodes are grouped, the consensus nodes of each node group are reselected, and a new round of node credibility consensus is performed. Compared with the prior art, the application improves the judgment accuracy of malicious nodes, effectively reduces the complexity of communication, and improves the consensus efficiency. The application realizes a lightweight storage and efficient consensus blockchain scheme.

The application discloses a consensus method of a decentralized scheduling system based on dynamic election, and a master selection process is carried out based on a decentralized scheduling system comprising a working node, a scheduling node, a node state chain and a snapshot chain. The scheduling node and the working node have a one-to-many management relationship. The working node maintains a heartbeat between the scheduling node which manages the working node, accepts task scheduling of the scheduling node, executes the task and returns the result to the scheduling node. The scheduling node has stronger computing, storage and communication performance. The task is reasonably scheduled to the working node for execution to build a node state chain to record state information of each node by calculating the task complexity and the managed working node resources. The consensus method provided by the scheme takes a snapshot of the current state of the global node and records the snapshot on the snapshot chain. The tamper-proof feature of the block chain is used to improve safety, and the performance of multi-task concurrent execution and the throughput of system consensus are improved.

This invention discloses a lightweight Byzantine fault-tolerant consensus method and system. The method proceeds as follows: Step 1: In a consortium blockchain application scenario, the consensus master node sends heartbeat packets to the node cluster, confirming the number of nodes based on the number of responses within a fixed time period; Step 2: The client generates a request and transmits the request message to the consensus master node; Step 3: After the master node verifies the request message, consensus enters a three-stage voting phase; after voting, the three-stage voting messages are stored in the node's message pool using a two-level replication method. This invention optimizes Byzantine fault-tolerant consensus, reducing the amount of communication data and storage space.

The invention provides an optimized PBFT consensus method based on clusters and reputation, and belongs to the technical field of logistics supply chain information. The method comprises the following steps: firstly, constructing a hierarchical architecture of sensing network topology by using a dynamic reputation model and an adaptive DBSCAN algorithm, and generating a core consensus cluster for processing dense services and a bridging cluster for guaranteeing connectivity according to node positions; then, a leader is elected in the cluster according to the reputation value and topology centrality, and a global task is decomposed into a local PBFT consensus process parallel in the cluster; and finally, the reputation is updated through a dynamic feedback mechanism to punish malicious nodes. Aiming at the characteristics of the cross-border logistics large-scale heterogeneous network, the method effectively solves the structural mismatching problem of the consensus algorithm and the logistics topology, has obvious advantages in the aspects of consensus time delay, throughput and communication overhead, and remarkably improves the expansibility and stability of the system.

This invention relates to a consensus method and apparatus for blockchain nodes. The method includes: receiving user asset data acquisition requests from target users sent by light nodes in the blockchain network; after determining that it stores the asset data of each target user, generating proof information based on the asset data and scope asset data of each target user; sending the asset data and proof information of each target user to the light node, whereby the light node verifies the proof information. If the verification passes, the light node verifies the legality of each transaction in the block based on the asset data of each target user. The light node can also verify the legality of each transaction in the block based on the asset data of each target user, improving the accuracy of transaction legality verification.

The invention discloses a DAG-based block chain consensus method, which ensures the uniqueness and availability of blocks in a DAG by constructing a reliable broadcast algorithm under a new hybrid model. And meanwhile, throughput is improved by utilizing a DAG structure, a rapid confirmation path is fused and added to realize rapid confirmation and reduce delay, and then the activity of the protocol is ensured through a coin confirmation path. According to the method, a main-free design is introduced into a hybrid algorithm design, a multi-proposal architecture is adopted, block relationships of blocks of proposals are structured through a directed acyclic graph (DAG), and the activity and security of a system are ensured by using a random algorithm and a time hypothesis. In addition, by introducing a rapid confirmation condition, the delay is reduced while the throughput capacity of the protocol is ensured. The consensus of the blocks can be completed in the fastest four rounds of communication, and most of the blocks can complete the consensus of the blocks in the six rounds of communication, so that the low time delay of the block consensus process is ensured, and the responsiveness of the system is improved.