79 results about "Byzantine fault tolerance" patented technology

The invention discloses an electronic lead seal data management method based on a block chain, relates to the technical field of internet data services, and aims to solve the problems of node data asynchronization, state updating failure and potential safety hazards of an intelligent contract in the prior art. The data consistency is ensured through a distributed clock synchronization algorithm and a version number verification mechanism; the reliability and fault tolerance of state updating are improved by adopting an improved Byzantine fault-tolerant algorithm and an asynchronous two-stage transaction submission mechanism; data integrity and traceability are guaranteed through a state machine detection mechanism and transaction log records; the security and maintainability of the smart contract are improved based on an automatic code auditing algorithm and a proxy contract mode of a graph neural network; real-time data monitoring and exception repair are realized by using an under-chain auditing mechanism and a cross-chain data consistency verification protocol; according to the invention, the data consistency, the system safety and the reliability of electronic lead seal data management are obviously improved.

The invention provides a credible federal learning system and method based on a block chain and zero knowledge proof. The credible federal learning system comprises a disturbance module. In the disturbance module, a non-interactive zero knowledge protocol is applied, so that noise added to a local model can be verified. A trainer and a verifier construct the same circuit containing specific Gaussian noise independently and respectively using linear approximation, and the trainer constructs proof using the circuit and a common generator as well as model parameters. The verifier verifies the received attestation using their circuitry; and a verification module. And the verification module constructs a fragment block chain consensus process. And each verifier firstly verifies the precision of local model gradient updating by using the public data set. And forming a consensus in the network by taking the verification result as a voting abstract. For block data containing local model selection information, a Byzantine fault-tolerant protocol is introduced to ensure data credibility. The method can be proved to realize differential privacy, and can analyze the upper bound of the influence of noise on the model performance.

The invention discloses a computer data storage method and system, and relates to the technical field of computer data storage.The computer data storage method comprises the steps that variant samples are generated through multi-modal feature extraction, font topology analysis and adversarial training, and fine modeling of Chinese character connection and pixel-level interference in an electric power drawing is achieved; an isolated storage pool path is dynamically generated through a tree-shaped namespace, and a physical storage address and version information can efficiently and uniquely correspond and retrieve in combination with bidirectional mapping of version identifier construction and block chain indexes; according to a confidence score obtained through weighted calculation of the topological similarity and the term library matching degree, once the confidence score is lower than a preset threshold value, the system pushes a manual recheck mark to a specified terminal through an asynchronous message queue, and meanwhile, read-only data locking is implemented to ensure that the writing process is not interrupted; the consensus management mechanism is based on an improved practical Byzantine fault-tolerant algorithm, and block chain index consistency and data traceability security are guaranteed.

Disclosed are a blockchain sharding method and system based on a convolutional neural network-long short-term memory (CNN-LSTM) prediction model. The method includes: using a double-layer chain system architecture, namely a vehicle layer and an edge layer; and using a delegated byzantine fault tolerance (DBFT) as a consensus protocol of a network at the vehicle layer and using proof of authority (POA) as a consensus protocol at the edge layer. Load balancing of the blockchain sharding system is optimized through a CNN-LSTM prediction model. A transaction status of the entire sharding network in a next period is predicted. Hot accounts are effectively allocated through a designed account allocation algorithm. The blockchain sharding method can maintain load balancing of shards, reduce cross-shard transactions, and implement effective utilization of resources. Malicious behavior of nodes is restricted. Security of the network is ensured.

The invention discloses an automatic UI self-healing test method and system based on multi-agent AI, and belongs to the technical field of automatic UI tests.The automatic UI self-healing test method comprises the steps that an original test script is semantized through a test reasoning interpretation class, and an expected intention is output; when the test fails, synchronously collecting multi-source data and extracting multi-modal features, constructing a fault propagation graph according to an expected intention and the multi-modal features, and performing fault propagation analysis by using a graph attention network to obtain a fault diagnosis result; according to a fault diagnosis result, a deep Q network, a greedy strategy and a Byzantine fault-tolerant algorithm are adopted to negotiate and decide a repair strategy through a distributed agent cooperation mechanism, and feedback is obtained; optimizing and dynamically adjusting the repair strategy and the test reasoning interpretation class through a meta-learning algorithm based on feedback; a test intention is deeply understood by constructing a test reasoning interpretation class, and fault diagnosis and automatic repair are cooperatively completed by adopting a distributed intelligent agent, so that the semantic understanding capability, the diagnosis accuracy and the repair success rate are improved.

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

The invention discloses a priority-driven Byzantine fault-tolerant non-master consensus optimization method and a priority-driven Byzantine fault-tolerant non-master consensus optimization system. The method is characterized by comprising the steps of building a block chain cluster, constructing a multi-consensus instance structure, selecting an optimal node as a main node to initiate instance proposal, performing multiple rounds of voting to achieve consensus of blocks, performing differentiated processes on different types of consensus blocks, completing receipt and persistence on executed blocks and the like. The system comprises a consensus protocol module, an execution module, a storage module, an authority management module, a lock module, a priority management module, an anchor point processing module and a network communication module. Compared with the prior art, the method has the advantages that the consensus delay is reduced, the system throughput is improved, the fault tolerance and the engineering practicability are good, and the method is particularly suitable for multiple scenes such as an alliance chain, a financial system and a distributed database and is applied to improving the data processing capacity, sharing, tracking and verifying supply data and quickly processing cross-border payment.

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

The invention relates to the technical field of block chains, and discloses an alliance chain consensus system and method based on a Byzantine fault-tolerant C-Raft algorithm, and the system comprises a reputation-represented committee upgrading and degrading module, a Byzantine fault-tolerant C-Raft log copying module, a reputation-represented committee upgrading and degrading module, a Byzantine fault-tolerant C-Raft log copying module, a Byzantine fault-tolerant C-Raft log copying module and a Byzantine fault-tolerant C-Raft log copying module. And the C-Raft log copying module is used for constructing a unified reputation subsystem among multiple subjects, comprehensively calculating activity, a consensus completion rate, a historical contribution degree and a periodic contribution degree as reputation scores, then constructing a committee according to the reputation scores, avoiding vote counterfeiting by combining a digital signature technology, and performing Byzantine fault tolerance, and is used for copying logs of the consensus system. According to the method, malicious nodes can be effectively prevented from being selected as cluster leaders in a mode of counterfeiting votes, stable and reliable participants are selected into committees by constructing multi-weight reputation values, the probability of errors in the log copying process is reduced, and the stability and safety of clusters are improved.

The invention relates to the technical field of distributed computing, in particular to a sleep consensus conversion method for a Byzantine fault-tolerant protocol. Comprising the following steps: S1, constructing a sleep consensus conversion unit; s2, constructing a rapid synchronous deep sleep consensus atomic broadcast protocol Koala-1 and a partial synchronous deep sleep consensus Koala-2 without a stable storage hypothesis; s3, performing synchronous sleep consistency processing on the stably stored part: attacking in a sleep model without a stable storage hypothesis; in the stable storage assumption, the BFT protocol is converted into a sleep consensus protocol, and the minimum intermediate consensus parameter is stored; and S4, adjusting the quorum number of the main protocol based on Koala-2, and modifying the view change protocol to contain a timeout arbitration certificate QC mechanism. According to the invention, a synchronous atomic broadcast protocol called Koala-1 is provided, so that the network delay is reduced; designing a specific structure of a partial synchronization model, and obtaining a safe sleep consensus through a stable storage hypothesis; and partial rapid synchronous sleep consensus without stable storage is realized.

The invention discloses a Byzantine fault-tolerant decentralized federated learning method based on a committee. According to the method, quality detection is carried out on model updating through a committee client, and model updating is selected through a committee consensus; performing weighted aggregation on the selected model update according to the model utility influence degree to form a new global model; and updating a reputation value according to the contribution and historical performance of the client in the current round, and taking the reputation value as a basis for selecting the training client and the committee client in the next round. The method can effectively cope with hostile attacks from a Byzantine client and a server, is safer, more reliable and more efficient, and is particularly suitable for application scenes with high requirements for safety and robustness.

The invention relates to the technical field of industrial networks, in particular to a Byzantine fault tolerance method for a substitute node. In the preparation stage, all nodes in the system are obtained, all the nodes comprise main nodes and alternate nodes, and a current calculation state node set and a candidate node set are divided; executing a command: acquiring a message set received by a client, and determining the node condition of the main node according to the message set; wherein the node condition comprises good nodes and bad nodes; state change: replacing the bad nodes in the main nodes with the substitute nodes until the nodes in the main nodes are all good nodes; a part of nodes are used as substitutions in advance, so that the industrial network system can be quickly recovered after errors occur, similar errors can be avoided after Byzantine errors of a main node occur for a certain number of times, and the effects of improving the performance and keeping the node state consistency are achieved.

The application discloses a federal learning system based on a FISCO group mechanism, which comprises a supervision node group and multiple levels of client groups, for any client, obtains and updates a local model according to a global model obtained through initialization or a last learning iteration; for any client group, based on a practical Byzantine fault tolerance consensus mechanism and a malicious node screening mechanism based on cosine similarity, an updated local model is obtained; based on a blockchain or a supervision node, an updated global model is aggregated; until a preset federal learning convergence condition is met, otherwise, the next round of federal learning is entered. The application divides different levels of client groups, guarantees the privacy of the blockchain system while retaining security and decentralization, and the introduction of the supervision node can not only play a penetrating supervision across agencies, but also greatly improve the efficiency of model aggregation.

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 a Byzantine fault-tolerant consensus method and device based on node behavior analysis and a medium, and relates to the technical field of Byzantine fault-tolerant consensus, and the method comprises the steps: based on node behavior analysis, firstly evaluating the behaviors of nodes, introducing weights, and then dividing the nodes into different groups according to the weights of the nodes; in the consensus process, the main node is selected from the first node group with higher performance, so that the probability that the excellent node is selected as the main node can be improved; assigning different node groups to be responsible for specific tasks in each stage; according to the method, the consensus process is optimized, the network overhead is reduced, the system throughput is improved, the consensus process delay is reduced, and the overall performance of the system is further improved.

The invention provides a block chain consensus method considering efficiency and security, and belongs to the technical field of block chain consensus algorithms. The balance problem of a traditional block chain Raft consensus algorithm in the aspects of efficiency and Byzantine fault tolerance is solved; comprising the following steps: a leader election stage: in the leader election stage of a traditional Raft algorithm, combining a Schnorr protocol and a counting comparison mechanism to strengthen the leader election security, and the implementation steps are as follows: when a follower node votes to a candidate node, signing on a vote through the Schnorr protocol; in one round of election, the candidate node initiates counting comparison RPC so as to determine a final leader; in the differential log copying stage, the log copying stage of a traditional Raft algorithm is replaced with safe differential log copying, the leader node calculates the difference between the leader node and a follower node log copy and generates a differential log, and the follower node uses the differential log to update a local log copy; the method is applied to the alliance chain with numerous nodes.

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 disclosed method involves utilizing a machine learning model to process a plurality of task descriptions corresponding to individual tasks of a divided algorithm or application. The model generates multiple code snippets for each task description, which are then stored in a code snippets database. This database is designed to accommodate updates to metadata associated with the code snippets, where the metadata provides information regarding the state of the code snippets. A subset of these stored code snippets is combined to create node replication codes, which, upon deployment, facilitate the generation of node replications within a platform. The deployment of these node replication codes on the platform results in the creation of node replications.

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.

A method of operating a blockchain system with decentralized computing nodes includes determining an elected clan representing a. subset of the plurality of the decentralized computing nodes that are capable of approving addition of the block to the blockchain with less than or equal to a threshold probability of failure and performing a block approval process which includes determining a vertex comprising a digest of the block, communicating the vertex to each computing node, communicating the block only to the nodes in the elected, clan, while preventing communication of the block to the nodes that are not members of the elected clan, and receiving one or more messages indicating receipt of the vertex and / or receipt of both the vertex and the block.

The invention relates to the field of block chains, and discloses an efficient dynamic BFT consensus implementation method suitable for an alliance chain, which is used for solving the problems that when a node dynamically participates in or exits, the total number of committee nodes is continuously changed and cannot be predicted in advance, and a corresponding static BFT consensus protocol loses activity. A protocol in a network is initialized, main node election is carried out on nodes in the network, a dynamic consistency protocol is set for the nodes, the dynamic consistency protocol comprises a general process and a rapid process, the set dynamic consistency protocol is embedded into a communication process of a traditional Byzantine fault-tolerant protocol, and a dynamic BFT protocol is obtained. The uncertainty of the state of the committee node in a real scene is fully considered, and the problem of dynamic participation of the committee node is effectively solved.

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.

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.

The invention discloses a cross-domain anomaly detection and anti-cheating method and system based on multi-modal behavior analysis, and relates to the technical field of artificial intelligence and network security. The method comprises the following steps: under a strict privacy protection framework, synchronously acquiring and registering user operation behaviors, network communication and external equipment data, and clearly excluding audio, video and biological characteristic data; time sequence, space, semantics and collaborative behavior characteristics are extracted based on a multi-level deep learning network, and a dynamically updated personalized behavior baseline is constructed; through a shared encoder obtained through adversarial training, different field behavior characteristics are mapped to a unified hidden space for similarity calculation, and cross-field collaborative cheating detection is realized; a risk level is output by adopting a multi-stage discrimination mechanism fusing real-time stream calculation, wavelet analysis and integrated learning; and a closed-loop anti-cheating system is formed in combination with distributed Byzantine fault-tolerant verification and block chain evidence solidification. According to the method, the cross-platform distributed cheating detection problem is effectively solved, and the compliance of a data processing process and the legal potency of evidence are ensured while the detection precision is improved.

The invention discloses a Byzantine fault-tolerant consensus method based on a dual-reputation model, and relates to the technical field of network security protocols, in particular to the Byzantine fault-tolerant consensus method and device based on the dual-reputation model. In order to solve the problems that an existing consensus method is high in centralization risk and malicious nodes are not recognized in time, the invention provides a Byzantine fault-tolerant consensus method based on a dual-reputation model, and the method comprises the following steps: S1, collecting temporary threshold signatures and temporary parameters generated in each stage during communication in a consensus process, detecting a consensus behavior of each node; s2, evaluating each node based on a dual reputation model, and allocating a combination identity of each node; and S3, when each round of consensus is started, electing a leader node, and rejecting a Byzantine node. The method is suitable for the fields of block chain systems, government affair data sharing, digital identity authentication and the like with relatively high requirements on data consistency and anti-attack capability.

Every major DAO governance failure traces to a common root cause: governance logic, voting, and treasury access reside in software that adversaries can reach. The disclosed invention provides a hardware-anchored DAO governance architecture defeating five adversary classes. A supply-chain attestation layer verifies firmware integrity against a public transparency log at node initialization. A Silicon Root-of-Trust Anchor Layer binds governance to processor-embedded cryptographic keys. A Heterogeneous TEE Orchestration Layer enforces Byzantine fault-tolerant canonical quorum through threshold BLS signatures across independent hardware architecture families. An Atomic Governance Transition Engine executes indivisible state changes: record incorporation, key destruction, counter advancement, and IOMMU treasury isolation. A Quantum-Resistant Governance Key Lifecycle Engine performs CRYSTALS-Kyber (ML-KEM, FIPS 203) key rotation with cryptographic agility. A Cross-Chain Governance Attestation Bridge publishes TEE-signed proofs to multiple blockchains. A Deterministic Governance Replay Engine reconstructs governance decisions in isolated sandboxes. An Automated Governance Incident Response Engine and Governance Regulator Verification Network provide hardware-enforced, independently auditable compliance enforcement.

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 application relates to the technical field of industrial networks, in particular to a backup node Byzantine fault tolerance method; a preparation stage: all nodes in a system are acquired, all the nodes including a main node and a backup node, and a current computing state node set and a backup node set are divided; an execution command: a message set received by a client is acquired, and a node condition of the main node is determined according to the message set; wherein the node condition includes all good nodes and existence of a bad node; a state change: the backup node is used to replace the bad node in the main node until the node condition in the main node is all good nodes; through pre-preparation of a part of nodes as backup, the industrial network system can quickly recover after an error occurs, and can meet the requirement that no similar error occurs after a certain number of main node Byzantine errors, so that the performance is improved and the node state consistency is maintained.

A user-controlled data sovereignty system operated by a single entity, comprising a distributed ledger with validation nodes executing a modified Byzantine Fault Tolerant consensus protocol achieving 37.9% latency reduction through two-phase validation, a hardware security module (FIPS 140-2 Level 3) storing cryptographic keys in tamper-resistant hardware, and a cryptographic enforcement module validating data access requests using elliptic curve digital signatures and time-locked permission constraints. The system implements jurisdiction-aware data routing through geographic validation node placement and dual-key authorization for cross-border transfers, encoding UK Data (Use and Access) Act 2024 compliance requirements as cryptographic policy predicates. Permission state finality is achieved within two consensus rounds, eliminating temporal vulnerabilities in revocation propagation while providing O(log n) verification complexity through Merkle tree structures.

The invention discloses a product quality full life cycle tracing method and system based on digital twinning. The method comprises the following steps: constructing a digital twinning model and enabling the digital twinning model to correspond to block chain fragments; the collected data is written into the twin fragments to generate a transaction identifier; executing Byzantine fault tolerance in the block chain by using a PrivChain-based adaptive consensus module, and calling zero knowledge range proof verification to output a consensus abstract; establishing a version index chain in the twin fragments to generate a snapshot and a difference result, and writing the snapshot and the difference result into a block chain to form a version index record; constructing a strategy graph in the block chain to generate an access credential, and enabling the access credential to correspond to the version index record; establishing a physical and twinborn time axis in the twinborn fragment to generate anchor mapping, forming a consistency verification record, and enabling the consistency verification record to correspond to the access credential; and when a tracing request is received, the cross-fragment certification aggregation module is called to aggregate records, generate aggregation tracing certification and output a tracing report. According to the invention, credible evidence storage and verification of full-life-cycle traceability data are realized.