1079 results about "Consensus" patented technology

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

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

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

The invention discloses a block chain multi-party consensus method based on a consistent hash algorithm, and the method comprises the steps: (1) formulating a multi-party consensus protocol, and solving a hash value of a node; (2) generating a block and a broadcast block according to the multi-party consensus protocol, and verifying and voting the generated blocks; (3) finding the position of a virtual node, on the hash ring, of the virtual node corresponding to the node according to the hash value; (4) selecting a main chain, synchronizing and broadcasting the blocks on the selected main chain, and storing the data of the nodes to the found virtual nodes; and (5) writing the synchronized and broadcasted blocks into a block chain. The invention discloses a block chain multi-party consensusmethod. On the basis of the non-rollback principle of the block chain, a consistent hash algorithm is adopted to realize load balancing in the consensus verification process, a Paxos and stock rightauthorization proving algorithm is improved, the consistency and non-tampering performance in the consensus process of the block chain are ensured, and the problem of network faults caused by malicious tampering is reduced.

The embodiment of the disclosure relates to a data dissemination system and data propagation method applied to a block chain. The block chain includes more than two nodes; and each node consists of areceiving module, a verification module, a consensus module, an execution module and a network module. Each execution module executes transaction data from a user side locally and directly without theneed to acquire a transaction content from a block sent by a consensus service, wherein the block does not include concrete transaction data; each transaction data content in a block proposal generated by each consensus block is replaced by a hash (abstract) value; and since most of payloads in the block proposal are from the transaction data content, the volume of the block proposal is reduced substantially when the transaction content is replaced by the hash value, wherein at least more than 50% of the volume is reduced in general.

The invention discloses a signature method and system for a block chain. The method comprises the steps that a consensus main node initiates a consensus proposal for a to-be-consensus proposal; a plurality of consensus backup nodes perform consensus on the to-be-consensus proposal; the consensus main node receives a plurality of signatures after the plurality of consensus backup nodes propose consensus for the to-be-consensus; the consensus master node verifies the plurality of signatures based on a plurality of public keys corresponding to the plurality of consensus backup nodes; and if the consensus main node verifies the plurality of signatures successfully and the number of the plurality of signatures is greater than twice of the number of failure nodes in all consensus backup nodes inthe blockchain, the consensus main node aggregates the plurality of signatures to obtain a target signature.

A method for using a distributed ledger (DL) of a blockchain applicable to a network of blockchain nodes is provided. The method reduces a time period between an assertion placed on the blockchain by an assertor blockchain node and execution of one or more action items dependent on a consensus of the assertion, by: creating an Artificial Intelligence (AI) model, by one of the blockchain nodes of the network, using historical data stored by the DL, wherein the network of blockchain nodes further comprises the assertor blockchain node; calculating an index value indicating a probability that the consensus is true, based on the AI model and the historical data stored by the DL, by the one of the blockchain nodes, wherein each of the blockchain nodes comprises a computer system including at least a processor, a system memory element, and a communication device configured to send and receive data transmissions between the blockchain nodes of the network; and when the index value exceeds a predefined threshold, initiating the execution of the one or more action items dependent on the consensus, by the one of the blockchain nodes.