87 results about "Consensus method" patented technology

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

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

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.

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.

This invention relates to the field of blockchain consensus and discloses a dual-master node Byzantine Fault-Tolerant Consensus method based on a reputation evaluation model. This method aims to solve the problems of centralized power among master nodes and privacy leaks in communication in the traditional PBFT algorithm. The technical solution includes establishing a multi-dimensional reputation evaluation model and dynamically electing master nodes P1 and P2 based on node reputation. Master node P1 is responsible for generating and broadcasting pre-prepared messages, while master node P2 is responsible for receiving replica votes and performing threshold judgments, achieving mutual checks and balances through a power separation mechanism. A linkable ring signature technology is introduced into the consensus interaction; replica nodes generate key mirrors and vote anonymously, and the verification master node deduplicates votes based on the key mirror set to prevent duplicate voting. This method effectively improves the security and privacy protection capabilities of the consensus system, reduces centralization risks, and is suitable for consortium blockchains and distributed systems with high security requirements.

Disclosed in the present invention are an asynchronous blockchain consensus method and system with decoupled data broadcast and consensus, an electronic device and a storage medium. The system comprises a plurality of nodes, wherein the nodes may be co-served by a plurality of mutually trusted physical or virtual devices. The method comprises: data broadcast and data sequential consensus are decoupled, wherein the nodes jointly maintain a plurality of broadcast protocol instances and a Byzantine consensus protocol; broadcast protocols are responsible for transmitting data at a certain node to other nodes, the Byzantine consensus protocol is responsible for reaching a consensus on results of the plurality of broadcast protocol instances; and in the nodes, the plurality of broadcast protocol instances can be maintained by a plurality of devices in an one-to-one correspondence mode, and execution results of the broadcast protocols are transmitted to devices responsible for executing the Byzantine consensus protocol in the nodes. The present invention can be implemented to improve the efficiency of a blockchain system, and additionally, to more conveniently improve system efficiency by increasing physical resources.

The invention discloses a multi-agent system elastic consensus method and system with privacy protection capability, and relates to the technical field of computers. The method comprises the steps that in an initial security window period, privacy protection of an initial state of an intelligent agent is achieved through state decomposition, sub-state mixed updating and merging operation, in an environment with spoofing attack, a conventional intelligent agent filters malicious information in a mode of sorting and removing suspicious extreme values based on a weighted mean value sub-sequence reduction algorithm, and the privacy protection of the initial state of the intelligent agent is achieved. And updating the state based on the trusted neighbor set until a consensus is reached. According to the method, the privacy of the initial state of the intelligent agent can be protected while the unconstrained spoofing attack is resisted, the communication overhead is not increased, the calculation complexity is low, the convergence speed is high, and the method is suitable for resource-limited collaborative scenes such as an unmanned aerial vehicle cluster and a wireless sensor network.

The invention discloses a block consensus method and device, and relates to the technical field of block chains, and the method comprises the steps that a first node obtains an ith block broadcasted by a second node in sequence; the ith block is a new block generated by the second node in the round, and the ith block comprises position information of a plurality of historical blocks and aggregation pointers of the plurality of historical blocks; the plurality of historical blocks are a plurality of (i-1) th blocks in a local chain of the second node; the aggregation pointer is obtained by the second node based on the position certificates of the plurality of historical blocks; and the first node verifies the aggregation pointer, and adds the ith block to the local chain after the verification is passed and the fact that the position certificates of the plurality of historical blocks and the consistency certificates of the plurality of historical blocks are cached locally is confirmed. The communication complexity between global nodes and the global storage complexity are reduced under the condition that the security consensus of the block chain system is ensured.

The application relates to the technical field of blockchains, and discloses a dynamic quantum Byzantine fault-tolerant consensus method and a server for a blockchain. The method comprises the following steps: determining a master node of a current block on a blockchain from a consensus node set according to a hash value of a parent block of the current block, the current block being the latest block on the blockchain; if the consensus node itself is not the master node, receiving a proposal message of a candidate block broadcast by the master node, verifying the proposal message according to a symmetric quantum key; if the proposal message is verified, generating a response message to the proposal message based on the symmetric quantum key, and broadcasting the response message to other consensus nodes; after receiving the broadcasted response message, the master node writes the candidate block into the blockchain and connects the candidate block to the current block; and determining a master node of the candidate block from the consensus node set based on the hash value of the current block. The above method solves the problem of low decentralization degree of nodes and enables the blockchain platform to have security against quantum computing attacks.

The invention relates to the technical field of block chains, in particular to an improved DPoS consensus method based on a distributed verifiable random function, and the method comprises the steps: constructing a DVRF function (distributed verifiable random function) through the combination of a verifiable random function (VRF) and a verifiable secret sharing (VSS) technology, and integrating the DVRF function into a traditional DPoS frame, thereby achieving the consensus of the DPoS. Fair, unpredictable and verifiable election of candidate nodes and leader nodes is realized; a backup node switching mechanism is further designed, replacement is rapidly completed when a leader node breaks down, and consensus process continuity is guaranteed. The consensus process further comprises four core steps of candidate set generation, leader node election, backup switching and block verification, fault processing can be completed without shutdown, and efficiency and stability are both considered.

Blockchain consensus method, system, device and computer readable storage medium. Embodiments of the present application relate to the field of blockchain technology, and disclose a blockchain consensus method, which comprises the following steps: when the number of nodes in a current level node group does not exceed a preset threshold, adding a master node of a next level node group to the current level node group according to a node joining request sent by the master node of the next level node group; when the number of nodes in the current level node group exceeds the preset threshold, taking the next level node group as the current level node group, and taking a node group composed of newly started nodes as the next level node group; continuing to execute the above steps until all nodes are joined, and obtaining a consensus system of a blockchain; wherein the first level node group is a consensus node group, and the consensus nodes in the consensus node group are permanent consensus nodes selected in advance and the master nodes in the second level node group. The embodiments of the present application can construct a credit-based blockchain consensus system suitable for a large-scale Internet transaction system.

The invention discloses a low-delay cross-fragment consensus method based on cross-fragment leader reelection, which comprises the following steps: a 2PC preparation stage: recording transaction submission time t1 by all nodes of an input fragment and an output fragment, generating an availability certificate by the input fragment, and sending the availability certificate to all the nodes of the output fragment by a leader node; if the output fragment does not receive the availability certificate, entering the first stage of the 2PC, otherwise, entering the second stage of the 2PC; in the first stage of the 2PC, an output fragment generates a cross-fragment leader reelection certificate, the cross-fragment leader reelection certificate is sent to all nodes of an input fragment, and timing is started; after the node of the input fragment receives the cross-fragment leader re-election certificate, electing a new leader node, and resending the availability certificate by the new leader node; and if the output fragment receives the certificate before the timing is ended, entering the second stage of the 2PC, otherwise, entering the first stage of the 2PC again. According to the invention, the efficiency of fragment consensus can be reduced and improved, so that the throughput of the fragment block chain is improved.

The present application relates to a blockchain based on a named data network, in particular to a kind of "one sends multiple receipts" efficient consensus method of named architecture blockchain.The present application utilizes the characteristics of the message consistency on the chain in the consensus process of blockchain, in each stage of consensus process, the main node only sends one request interest package, multiple consensus slave node reply consensus data package, aggregate after returning on the return path and return, aggregate BLS threshold signature aggregation mechanism is used.The present application increases a Record Field field in existing NDN data package, carries the aggregated consensus slave node number in the way of one-hot coding, solves the aggregation signature verification problem when only part of consensus slave node participates in consensus.Compared with the blockchain based on IP architecture and the blockchain based on classic NDN architecture, the consensus efficiency is higher and the transmission overhead of consensus process is smaller.

This invention discloses a weighted consensus method for blockchain in a dynamic heterogeneous 6G environment. The method includes the following steps: constructing a multi-dimensional node weight dynamic evaluation model, and performing a comprehensive capability evaluation of nodes based on the model to calculate their consensus weights; constructing a set of consensus nodes entitled to participate in weighted voting and a set of candidate nodes that only participate in verification to accumulate reputation, managing the candidate node set and the consensus node set based on the accumulated behavioral reputation value of the nodes to obtain a real-time updated consensus node set; and executing proposals, weighted voting, and final confirmation based on the node consensus weights and the real-time updated consensus node set to obtain a weighted consensus result for the blockchain. This invention can optimize the allocation of consensus weights, reduce consensus reconfiguration overhead, and maintain efficient weighted consensus in a 6G dynamic heterogeneous environment by constructing a multi-dimensional node weight dynamic evaluation model.

This invention discloses an asynchronous network consensus method and system based on a reputation model, belonging to the field of consensus algorithm technology. It aims to solve the problems of low efficiency, high latency, and frequent leader election failures in asynchronous network environments. The method is divided into a broadcast phase and a consensus phase: In the broadcast phase, broadcast nodes encode erasure codes into message fragments and distribute them; receiving nodes verify these fragments and store them in the corresponding priority queues. In the consensus phase, each node generates a binary value vector based on its priority queue and distributes it across the network. A leader is elected based on the reputation value calculated by each node. An asynchronous binary consensus protocol is used to reach a consensus on the leader's validity, determining a multi-value Byzantine consensus result. Finally, the original message is requested and restored from the node indicated by the result. Erasure coding reduces communication overhead, and the reputation model reduces the number of consensus failures, improving system throughput, reducing latency, and enhancing stability and efficiency in asynchronous network environments.

This invention belongs to the field of vehicle-to-everything (V2X) secure communication and blockchain consensus technology, specifically disclosing a trust-driven V2X blockchain consensus method. This method achieves decentralized management of the master key through a distributed key generation protocol, eliminating the traditional Root-TA single-point trust problem. Combining a dynamic trust evaluation mechanism based on Beta distribution with incentive contract design based on a delegate-agent game model, it constructs a trust-driven dynamic PoW consensus mechanism, achieving two-layer dynamic control of global security state and individual reputation level. This invention significantly improves the decentralization, consensus fairness, and operational efficiency of V2X systems while ensuring security and privacy.

The application provides a blockchain consensus method and system for professional title review, which comprises the following steps: dividing the behaviors of all nodes into positive behaviors and negative behaviors, and calculating the credit scores of all review agency nodes according to the first and second integral rules; screening all the nodes to be elected that meet the condition that the credit scores are greater than a first threshold value, and selecting the node to be elected corresponding to the maximum election probability from all the election probabilities as the master node of the current round of consensus; controlling the master node to generate a pre-preparation message containing a unique task serial number, and sending the pre-preparation message to the consensus nodes for verification; and the master node broadcasts a submission message to the whole network, and each consensus node verifies and executes an expert extraction algorithm to obtain an extraction result. The application can fundamentally solve the fairness, security and efficiency problems in the professional title review expert extraction process.

The embodiment of the present application relates to the technical field of block chain, and discloses a consensus method of block chain, which comprises the following steps: according to the mixed asset conditions of each node in the current round of account selection, randomly generating a random number list of the current round for each node; the mixed asset conditions comprise asset number and node number; one or more random numbers are included in the random number list of the current round; according to the random number generation range, randomly generating a target random number of the current round; matching the target random number of the current round with the random number list of each node to determine the node of the current round of account; and performing the current round of account through the node of the current round of account. Through the above method, the embodiment of the present application effectively reduces the power consumption of the consensus algorithm, and solves the problem of excessive rights of the node with large currency holding amount.

A blockchain consensus method includes broadcasting consensus requests to at least two blockchain nodes executing consensus algorithms of different fault tolerance types in a blockchain network. The method further includes obtaining response messages from blockchain nodes in the blockchain network in response to the consensus requests, and counting a node quantity of blockchain nodes transmitting the response messages in a same consensus stage, the node quantity including a quantity of the at least two blockchain nodes executing the consensus algorithms of different fault tolerance types. The method further includes, when the node quantity satisfies a consensus condition of the first consensus algorithm and does not satisfy a consensus condition of the second consensus algorithm, synchronizing a consensus result of the first consensus algorithm with a blockchain node executing the second consensus algorithm such that the blockchain node executing the second consensus algorithm reaches a consensus.

This invention proposes a blockchain consensus method based on device-independent quantum random number beacons. A blockchain sorting algorithm is used to rank the participating nodes. Each node sequentially requests a private device-independent quantum random number block from the beacon service network. The digital signature of the beacon is verified. Nodes that pass verification participate in the consensus process. According to an agreed-upon algorithm, the random number blocks allocated to each verified node are processed with a second hash value. Nodes whose results meet a threshold condition are selected as the chosen nodes to verify the authenticity and validity of the random number blocks of other nodes. If the verification passes, the consensus round is complete. The consensus mechanism based on device-independent random number beacons proposed in this invention has high security and fairness. Nodes can request private device-independent random number blocks through the beacon service network. The election process is low-power, more efficient, and easier for network expansion.

This application discloses a consensus method, apparatus, storage medium, and device for blockchain, applied to blockchain consensus scenarios. The method includes: in response to a temporary consensus transaction initiation, initiating a temporary consensus state, wherein the temporary consensus transaction initiation is a multi-signature transaction generated through joint signatures of all normal nodes; in the temporary consensus state, jointly performing temporary consensus operations with all normal nodes to provide transaction services externally through the temporary consensus; recording temporary consensus transaction data generated during the temporary consensus process; and performing consensus verification processing on the temporary consensus transaction data through all normal nodes, submitting the consensus-verified temporary consensus transaction data to the blockchain, thereby improving the availability of the blockchain system.

The application belongs to the technical field of blockchains, and solves the technical problem of low blockchain transaction consensus efficiency in the prior art, and provides a blockchain consensus method, device, equipment and storage medium. The consensus task of the blockchain is split into a first subtask and a second subtask according to data processing characteristics, the first subtask is assigned to a first node for execution, and the second subtask is reserved for execution on a Master node. The multiple subtasks are completed by different blockchain nodes, the data volume to be processed by the Master node in blockchain transaction on-chain consensus is shared, the time for the Master node to process on-chain transaction packages is saved, the consensus efficiency of the Master node in processing transactions to be on-chained is improved, the blockchain transaction efficiency is improved by improving the blockchain consensus efficiency, and the problem of slow blockchain transactions is improved.

The application discloses a kind of high-efficiency safe consensus methods, comprising: request direction trust evaluation party initiates trust evaluation request;Trust evaluation party determines to be evaluated entity, and trust evaluation task is handled by each cloud server in parallel, generates trust evaluation result and verification label;Blockchain carries out random fragmentation to all consensus nodes;Request direction all consensus nodes initiate trust evaluation verification request, and determine first round consensus node, and first round consensus node carries out correctness verification to trust evaluation result;When trust evaluation result passes the correctness verification of first round consensus node, other consensus nodes on the slice where first round consensus node is located carry out approval, and reach first round consensus;Request party determines second round consensus node from each slice;Second round consensus node carries out correctness verification to trust evaluation result, and after reaching second round consensus, generates a new blockchain and publishes verified trust evaluation result, with security and high efficiency.