1088 results about "Consensus" patented technology

The invention is a computer implemented technique for id entifying anomalous data in a data set. The method uses cascaded k-Means clustering and the ID3 decision tree learning methods to characterize a training data set having data points with known characterization. The k-Means clustering method first partitions the training instances into k clusters using Euclidean distance similarity. On each training cluster, representing a density region of normal or anomaly instances, the invention builds an ID3 decision tree. The decision tree on each cluster refines the decision boundaries by learning the sub-groups within the cluster. A test data point is then subjected to the clustering and decision trees constructed form the training instances. To obtain a final decision on classification, the decisions of the k-Means and ID3 methods are combined using rules: (1) the Nearest-neighbor rule, and (2) the Nearest-consensus rule.

The invention discloses a credit-based blockchain consensus method for large-scale e-commerce. According to the method, by applying a blockchain to the large-scale e-commerce application scene, the scalability needed by the large-scale e-commerce scene can be achieved, millions of nodes can be supported, the consensus requirement that the service speed of the e-commerce is ten millions per second can be met, energy consumption such as Bitcoins is not needed, and the problem that a blockchain adopting proof of stake (POS) is lack of security guarantee is solved. The method comprises the steps that 1, the structure of the blockchain is composed of an alliance chain environment in a firewall, a gateway environment in a non-military isolation area and a platform in the public Internet; 2, alliance chain members elect a few nodes with a high trust degree from a public environment to serve as first-stage consensus nodes; and 3, a first-stage consensus result is sent to a alliance chain, the alliance chain members perform secondary consensus through voting to ensure the accuracy of the consensus result from the public environment, and then the security requirement is met.

The invention aims to provide a quick consensus bookkeeping method and system based on a blockchain alliance chain. The method comprises the following steps that: when a system is initialized, the system generates a sovereignty key used for generating a new block; a node collects trade information and waits for a new block broadcast; after the node receives the new block broadcast, the new block is added into a local block; the node which receives the sovereignty key generates the new block, and a new sovereignty key is created; the new block is broadcast to all nodes of the system; and the new sovereignty key is transferred. By use of the method, through a method that the certain node of the system is randomly selected to transfer the sovereignty key, only a certain node which can not be determined in the system has power and permission for generating the new block at any time, bookkeeping rights are randomly distributed among all honest nodes so as to guarantee that the system can quickly reach consensus while the trade information can not be tampered, and trade confirmation speed is shortened into a second level from an original minute level.

The invention discloses an intelligent investment product collocation method based on the block chain intelligent contract technology. According to the method, the authenticity and non tamperability of the data on the chain are guaranteed by block chain consensus, authentication, timestamp and other technical means, and the participants on the chain can see the same and real information; the intelligent contract is automatically executed without artificial interference and supervision in the process of work can be performed to ensure the interests of customers. Being different from the centralized central registration and settlement mechanism, the system of the invention adopts the distributed technical architecture, the participants jointly maintain the product life cycle, thereby ensuring that the products are open and transparent and credible, effectively reducing the credit risk and avoiding the lack of supervision and risk control, resulting from that the product contents and operation means are opaque, and thus the customer rights and interests are not guaranteed.

The invention belongs to the technical field of block chains, and discloses a reputation-based PBFT consensus system and method, and a block chain data processing system. The method comprises the steps of designing a lightweight reputation evaluation model, and calculating a mixed reputation value of the node based on node importance and service feedback; selecting a part of nodes of which the reputation values are higher than a threshold value as participants of a classical practical occupancy fault-tolerant consensus mechanism; and running a PBFT consensus mechanism in the participant, achieving a consensus based on a new leader election and transaction verification method, and broadcasting a consensus result. Due to the fact that the classical PBFT consensus mechanism is limited in expandability, consensus is not affected by the network scale. Due to the fact that a node reputation evaluation method and a participant election method are added, the method has higher safety compared with a classical PBFT. The calculated node reputation can guide the next transaction, so that the computing power for evaluating the node reputation is effective computing power.

The invention discloses an information sharing and safe multi-party computing protocol based on a block chain, mainly solves the problem that the existing secure multi-party computation is easy to cause the user to be unable to control the data independently that is easy to get the data by the third party. The technical solutions are as follows: 1) constructing the storage model, and storing the index table information on the chain and the database under the chain in the way. 2) constructing a data sharing model,wherein users can access their data by authorizing a third party or revoke their privileges at any time. 3) using the consensus mechanism of the block chain to ensure the consistency among nodes; 4) Based on the correctness of nodes, using MapReduce programming model, the model isdivided into two phases: Map and Reduce, and the master node assigns the tasks of Map and Reduce to the nodes; 5) Map node uses the improved homomorphic encryption algorithm for encryption calculation; 6) Reduce node integrates the encrypted data to output data files.

A hybrid quorum / consensus and primary-backup fault-tolerance model in an object-based distributed data storage system. When a primary manager fails, a hierarchy of network entities is established in which a group of realm managers first authorizes a failure-handling event through quorum / consensus and a backup manager (for the failing primary manager) then executes the decision of the quorum of realm managers. The realm managers, operating by consensus, determine whether (a) the primary manager can indeed be asserted to be down, and (b) whether there is a quorum of realm managers in agreement on this decision. If both are true, a master realm manager instructs the backup manager to proceed to execute the necessary steps to become the primary manager and function as the primary until the original primary manager is brought back into service. The hybrid fault-tolerance approach handles both single unit failures and network partitions in a unified way, without creating a single cluster out of the fault domain.

The invention discloses a bilayer sliced high-efficiency block chain consensus mechanism and a working method thereof. The consensus mechanism is based on a bilayer gossip topology network, and comprises a full node, a local full node, a light node and a micro node, wherein the full node is in charge of node topology and slice maintenance and is elected and updated through a full node maintenancemechanism; and the local full node is elected and updated through a local full node maintenance mechanism and is in charge of transaction validation, transaction consensus, transaction storage and account synchronization. The invention also provides a working method for the consensus mechanism. A credible and incentive node joining and updating mechanism is provided, the stability, the bandwidth capability and the computing capability of the full node and the local full node are ensured, and the impacts on a transaction confirmation speed are reduced. The consensus mechanism proposed by the invention forms a divide-and-conquer distributed account system by means of intra-slice autonomy and inter-slice collaboration to ensure to consider decentralization, scalability and security.

The invention discloses a blockchain structure for an intelligent mobile terminal, a generation method and a transaction verification method. The generation method comprises the following steps: firstof all, a genesis block generator generates a genesis block, and transmits the genesis block or a Hash value to a P2P network via a given rule, such that more than half of nodes in the whole networkhold the genesis block, and the other half of the nodes hold the Hash value of the block; the nodes perform consensus operation on the basis of this and achieve a new consensus; and through continuously performing cyclic consensus, the blockchain structure in which parts of the nodes store parts of blocks of the blockchain is finally obtained. The blockchain structure for the intelligent mobile terminal, the generation method and the transaction verification method have the characteristics that the storage space occupation is small and all consensus mechanisms are compatible.

The invention is applicable to the field of Internet technology improvement, and provides a blockchain consensus method based on a trust relationship. The method comprises: S1, quantifying the trust relationship between nodes according to transaction and block data; S2, according to trust relationship between the nodes, constructing a trust relationship diagram and generating a trust matrix; S3, iteratively calculating the trust value of each node by using the trust relationship of the nodes of the whole network; and S4, randomly selecting a representative node as the master node with the billing right each round of consensus, and selecting, by the master node, several transaction creation blocks from the transaction poo. The representative mechanism is adopted to professionalize the accounting nodes, which reduces the consensus cost, saves energy, and improves the efficiency of the node consensus and the expansion capability of the algorithm. The representative node is selected basedon the trust relationship, and does not depend on the token of the blockchain, so that the billing right is concentrated on a few 'rich people'.

The invention belongs to the technical field of blockchain consensus mechanisms, and relates to a dynamic hierarchical Byzantine fault-tolerant consensus method based on credit, which can be used forimproving the stability, reliability and system performance of a consensus mechanism in a blockchain system. According to the method, a hierarchical-parallel mechanism is designed, and nodes are takenas consensus nodes, candidate nodes and common nodes. The consensus nodes are responsible for participating in consensus writing transaction, the candidate nodes are responsible for participating inconsensus reading transaction, and the process can improve the overall performance of the system. A credit-penalty mechanism is established, and reliable nodes are awarded and error nodes are punishedto ensure that the nodes with higher trust values have higher probability to become main nodes; a view conversion protocol is canceled, and the state of the consensus node is monitored in real time;a dynamic lifting mechanism is provided, and dynamic decentralization of the system is realized and the stability of the system is ensured by manipulating a virtuous cycle among a consensus node set,a candidate node set and a common node set according to credit values of nodes.

The invention provides a de-centralization consensus method based on proof of time. The method comprises the following steps that within the time 0-t1, a plurality of users sign time certification data containing a current timestamp by utilizing private keys, and peer nodes where the users belong receive signatures; within the time t1-t2, each peer node selects the best signature in the signaturesreceived by the peer node, packages the signature into a signature data block and carries out broadcasting, after the peer node receives the broadcasted signature, the received signature is comparedwith the best known signature of the peer node, if the received signature is better, the best known signature is replaced and broadcasted, and lastly, all peer nodes select the unique best signature of the whole network; and within the time t2-T, the peer node where the best signature belongs packages a to-be-recorded block and carries out broadcasting, and other nodes pass the verification and accept the to-be-recorded block. According to the de-centralization consensus method and system based on the proof of time and the block chain system, the defects of Byzantium fault tolerance, proof ofwork, proof of stake, proof of delegation stake and other existing consensus methods and the block chains thereof are solved, and the effects of fairness, high efficiency, energy conservation and usability are achieved.

The invention discloses a Byzantine fault tolerance method of a data block chain authorization participation consensus based on reward and punishment and a reward and punishment method thereof, relating to the technology of fault tolerance of a data block chain. A node reward and punishment algorithm is used to ensure that commands sent by nodes in a Byzantine fault tolerant data block chain which is authorized to participate in the consensus are honest. The technical points of the invention are that the method comprises the steps of (1) selecting consensus nodes in the data block chain, wherein the number of the consensus nodes is smaller than a node total number in the data block chain, (2) allowing the consensus nodes to carry out consensus games to reach a consensus on authenticity judgment of the commands sent by the nodes in the data block chain, and (3) carrying out reward and punishment on the nodes in the block chain based on a result that the consensus nodes reach the consensus.

The invention relates to the technical field of block chain consensus mechanisms, in particular to a blockchain consensus method based on a share authorization certification mechanism and related equipment. The method comprises the steps that node information of nodes is collected, the node information is broadcasted to other nodes, and the node information comprises node identifiers; after the node information broadcasted by the plurality of nodes is obtained, voting is carried out by a stock authorization certification mechanism, and the node information is continuously broadcasted to othernodes; and the votes of all the nodes are arranged from high to low to obtain the first N nodes with the highest votes, the N nodes are defined as representative nodes, node identifiers correspondingto the representative nodes are updated to the alternate accounting table, and the alternate accounting table is broadcasted to all the nodes. According to the invention, the node information and theline DPOS consensus mechanism are combined, and the representative nodes are voted, so that the voted representative nodes are ensured to be in a performance maximization state, and the fairness of each node is ensured.

The invention relates to a hierarchical consensus method and system for a block chain. Computer nodes participating in consensus in the whole network are grouped, the whole network is divided into a backbone network and a plurality of mutually independent sub-networks, the backbone network is a first layer of the consensus, and each sub-network is a second layer of the consensus; the process of achieving consensus by the nodes in the block chain network is realized through a layered strategy, the nodes in the first layer of backbone network firstly form the consensus, and the nodes in the second layer of subnetwork synchronously form the consensus. Due to the fact that the number of the nodes in the backbone network is greatly reduced compared with the number of the nodes in the whole network, when the number of the nodes in the whole network is large, the block chain system can still achieve consistency efficiently, and network bandwidth occupation is smaller.

The invention discloses a block chain consensus device, including a contract module, voting module, block-out module and storage module, the contract module is configured to execute an intelligent contract, common nodes can be converted into consensus nodes through intelligent contracts, the voting module is used for electing a leader node by voting from the nodes participating in the consensus, the block-out module means that the leader node packs the block unit data and puts the block unit data into the block chain, the storage module is used for storing the data information put into the area chain, and the invention also provides a block chain consensus algorithm. The invention creatively integrates the raft algorithm and the DPoS consensus algorithm, provides an efficient and safe consensus device and algorithm, meets the requirement of the application of the block chain with high transaction speed, and enhances the security of the consensus without lowering the performance of theraft consensus.

The embodiment of the invention provides a block chain consensus voting method, device and equipment and a storage medium, and the method comprises the steps: obtaining to-be-uploaded data uploaded bya submitting node, and carrying out the local verification of a to-be-consensus block stored in a to-be-consensus cache region; if the first to-be-consensus block passes the local verification, and the first to-be-consensus block is a to-be-consensus block with the maximum block height in the target to-be-consensus block chain of the to-be-consensus cache region, obtaining a hash value of the first to-be-consensus block, generating a second to-be-consensus block with the to-be-linked data, and adding the second to-be-consensus block to the target to-consensus block chain to obtain an updatedto-consensus cache region; broadcasting the second to-be-consensus block in a block chain network; and updating the consensus voting value corresponding to each to-be-consensus block, and determiningthe to-be-consensus block of which the updated consensus voting value is greater than a voting threshold as a consensus passing state. By adopting the embodiment of the invention, the consensus efficiency of the block chain can be improved.

A system and method for a blockchain consensus mechanism includes a processor couple to a data bus having a blockchain protocol consensus algorithm incorporated; intelligent hardware being auto triggered and having an auto-diagnostics capability, an auto-self healing capability, and to monitor threats in a blockchain infrastructure; establishing nodes representing users and being in communication with the intelligent hardware; determining data associated with the nodes through the intelligent hardware and data bus implementing the protocol consensus algorithm, the data including geographic location, geographic density, the number of cryptographic tokens, crypto assets; and a reputation score; selecting candidate nodes to create a committee, the selection being based on the data associated with each of the nodes; selecting a leader node based on randomness; and ensuring validation of a transaction in a block so as to approve the transaction to be committed to a blockchain platform through the leader node.

The embodiment of the invention discloses a block chain consensus and execution parallel processing method and device and electronic equipment, and the method comprises the steps: carrying out the batch packaging of transactions, and carrying out the consensus of a transaction set obtained through packaging; after the consensus is reached, adding the sequenced transaction set to a preset buffer queue; sequentially executing transactions in each transaction set in the preset buffer queue; and after all transactions in any transaction set are executed, returning an execution result of the executed transaction set as a latest state. Therefore, in the mode, when one block is processed, parallel processing of transaction consensus and execution and parallel processing of transaction consensus and execution of adjacent blocks can be achieved, and it is guaranteed that in the whole consensus process, transaction consensus and execution are executed all the time, and the situation of parallelprocessing exists. Therefore, the consensus efficiency is improved.

The invention provides an improved practical Byzantine fault tolerant system based on an alliance block chain technology. The improved practical Byzantine fault tolerant system mainly comprises a master node and a slave node of two types of nodes. The master node selects a voting system from all nodes in the alliance chain, wherein the master node is used as a production node to be responsible forproducing blocks, and the slave nodes are used for carrying out consensus verification on the produced blocks, and the blocks which are consistent through consensus are stored in a block chain, and the voting system is combined with a credit coefficient, so that the past behaviors of the nodes can influence whether the nodes can become the master node or not. By means of the mode, the practical Byzantine fault-tolerant system is decentralized, tamper-proof and high in reliability.

The invention provides a blockchain parallel system and method based on transaction data partition-interchain fusion. According to source address and destination address attributes contained in transaction data, concurrent transactions are divided into different block chain subnets to be processed, a consensus verification process is performed in each subnet in parallel, a block chain data fusionmethod is provided, and the partitioned sub-block chains are asynchronously fused into a fusion chain. And each client calls a data service interface provided by the block chain platform, downloads the fusion chain block head, and obtains a global view of historical transaction data of the whole network through the complete block chain data of each fragmentation chain, thereby ensuring that the client can generate legal transaction data at the current time. According to the method, the global transaction data is subjected to partition processing, so that the optimization performance bottleneckproblem in the original blockchain technical architecture is solved, and the flux upper limit of global transaction processing is improved.

The invention belongs to the technical field of block chains, and provides an improved PBFT consensus method based on a reputation and voting mechanism, which comprises the following steps: carrying out state division on nodes, carrying out node state conversion according to the performance of the nodes in a consensus process, carrying out authority distribution according to the states of the nodes, wherein the nodes with the participation authority can participate in main node election, electing the main node according to voting calculation, by the main node, receiving a request sent by the client, broadcasting the request to a backup node, and starting a consensus process, wherein in the consensus process, if the main node breaks down or is disadvantaged, view switching is carried out according to the abnormal condition of the main node. Compared with the traditional PBFT, the average throughput is increased, the time delay is reduced, and the operation efficiency and safety of the system are improved.

The invention relates to a block chain dynamic DPoS consensus method based on a reputation mechanism and a DPBFT algorithm, and belongs to the technical field of block chains. The method comprises thefollowing steps: S1, initializing a whole network node reputation record; S2, counting the reputation weight votes and the number of support nodes of each node, selecting the nodes with the votes ranked at the top TN to form Pool, and selecting the nodes ranked at the top n from the Pool as representative nodes; S3, generating a random sequence through a shuffling algorithm by representative nodes, confirming a reason of a problem through a DPBFT algorithm, and taking processing measures until all the representative nodes of one sequence complete block production; and S4, generating a new block output sequence through a shuffling algorithm after a round of block production is completed until the next operation period or the number of candidate nodes is less than a threshold TNM. A reputation mechanism is introduced to reduce the influence of malicious nodes on the system in the DPOS voting process and the block production process, and the enthusiasm of nodes in the whole network to participate in the consensus process is improved.

The invention discloses a block chain transaction rapid confirmation method and system. The method comprises the steps that S1, a proposal node packages a transaction into a block and broadcasts the block to a node participating in consensus; S2, the nodes participating in the consensus verify the blocks, if the verification is passed, pre-voting is carried out, a threshold signature is used as a digital signature of the pre-voting, and the signed pre-voting is sent to a collection node; S3, when the number of the pre-votes collected by the collection node meets a first preset number, a new signature is recovered according to the threshold signature of the first preset number, a pre-submission vote is constructed according to the new signature, and the pre-submission vote is sent to the node participating in the consensus; and S4, after receiving the pre-submitted votes, the nodes participating in the consensus verify the new signatures, and after the verification is passed, the proposal nodes can upload the blocks to the block chain for storage. By adopting the threshold signature technology and setting the collection nodes, the transaction confirmation speed is increased, and the expansion of the node scale is facilitated.

The invention discloses an alliance blockchain decentralized consensus method based on a voting mechanism. The method belongs to the technical field of blockchain consensus, and aims at solving the problems that an existing blockchain consensus algorithm based on the mining mechanism is high in computing power expenditure and low in efficiency, the mining mechanism is abandoned, and reliable consensus is achieved through a voting and deposit adding mechanism. According to the method, the consensus efficiency of the alliance blockchain system is greatly improved, the Hash computing power cost and the transaction confirmation time delay are reduced, and the system throughput is improved; meanwhile, the decentralization characteristic of the system is stronger, and the user fairness of the nodes is better; in addition, malicious behaviors in the alliance blockchain system can be greatly inhibited, and the security of the system is effectively improved.

The invention discloses an intelligent consensus mechanism based on a two-way certificate and suitable for an intellectual property alliance chain, and aims to improve the consensus efficiency, shorten the transaction confirmation time and improve the system fault tolerance by adopting two kinds of certificates, namely a right-interest certificate and a circulation certificate. And on the other hand, as the PBS executes PoW mining in turn, the consensus calculation of system nodes can enable each block to have final consistency, the condition of block chain bifurcation is avoided, and meanwhile, the block output stability is also guaranteed. In addition, a winning accounting right reward of the system node is given to users with more stock rights and high participation degree, so that theactivity of the community can be improved; And the authorized and credible common full node participates in consensus calculation, so that the credibility and the internal transparency of the alliancechain operation can be improved.

The invention discloses a data processing method for the Internet of Things based on a block chain, and the method comprises the steps that a first consensus node generates a data block according to terminal information data when the terminal information data is received, and stores the data block on the data block chain; and when the user transaction data is received, the second consensus node generates a transaction block according to the user transaction data, and stores the transaction block on the transaction block chain. The invention further discloses an internet of things based on theblock chain and a storage medium. According to the invention, the terminal information data in the Internet of Things is stored in the data block chain based on the workload consensus mechanism; usertransaction data is stored in a transaction block chain based on a practical Byzantine fault-tolerant algorithm; a hybrid consensus mechanism is adopted in the Internet of Things, the advantage of high decentralization degree of a workload consensus mechanism and the advantage of high consensus efficiency of a Byzantine fault-tolerant algorithm can be effectively combined, and the consensus security level and consensus efficiency of the Internet of Things based on the blockchain are greatly improved.

The invention provides a random number generation method, a block chain node, a system and a medium. The method comprises the following steps: constructing M public and private key fragment pairs of each node in N nodes participating in consensus based on a verifiable key sharing mechanism; calculating N numerical values corresponding to the code of each node and sending the N numerical values tothe node conforming to the corresponding code; when a block needs to be consensus, synthesizing a first signature of each node and constructing a prepare vote of each node; constructing a unique public key by utilizing the jth section of public key fragment of each block chain node participating in consensus; when the number of the nodes passing the verification of the prepare voting reaches M, constructing a second signature by utilizing the prepare voting of the M nodes; validating the second signature to be determined as a random number. According to the invention, the random number can begenerated in combination with a verifiable key sharing mechanism and a preset signature algorithm, and the random number has decentralization, uncontrollability, unpredictability, verifiability and real-time availability.

The invention discloses a Byzantine fault tolerance method and a token economy management system. The method comprises the steps of delegating right and interest of a node, which is to participate inblock chain operation, to a block chain network node, thereby obtaining a right and interest value; constructing a right and interest table with the length being coefficient multiple of the total nodequantity, wherein the occupied length of information of each node in the right and interest table is in direct proportion to the right and interest value of each node; generating a random number by using a random function, and selecting a numerical value in the right and interest table, thereby selecting multiple nodes to participate in the operation; allocating different working proposals and endorsements to the nodes participating in the operation, and performing confirmation to finish a consensus; and if alternative blocks obtain confirmation of a confirmation node, storing the blocks finishing the consensus by all consensus nodes. The system comprises a block chain network, a control unit, a detection unit, an operation unit and an allocation unit; and computing power of different nodes is detected, different work is allocated, and based on this, benefits are allocated. The right and interest ratio, the computing power and the input operation and maintenance cost are comprehensively considered, and the weights and the benefits are reasonably allocated.