CN111445241A - Hybrid consensus method and device combining POW and POS - Google Patents
Hybrid consensus method and device combining POW and POS Download PDFInfo
- Publication number
- CN111445241A CN111445241A CN202010131561.0A CN202010131561A CN111445241A CN 111445241 A CN111445241 A CN 111445241A CN 202010131561 A CN202010131561 A CN 202010131561A CN 111445241 A CN111445241 A CN 111445241A
- Authority
- CN
- China
- Prior art keywords
- block
- chain
- consensus
- node
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000013507 mapping Methods 0.000 claims abstract description 29
- 238000004364 calculation method Methods 0.000 claims abstract description 24
- 230000008569 process Effects 0.000 claims abstract description 15
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 238000012790 confirmation Methods 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 3
- 230000004044 response Effects 0.000 abstract description 4
- 230000007246 mechanism Effects 0.000 description 8
- 238000013461 design Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000002411 adverse Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Abstract
The invention discloses a mixed consensus method combining POW and POS, which comprises two block chains, wherein a first chain adopts POW consensus blocks, a second chain adopts POS consensus blocks according to historical data of the first chain, and a service logic is operated, and the consensus process comprises three parts of address mapping, calculation force mapping and competition out blocks. The invention combines the high security of the POW algorithm and the characteristic of adding without auditing; the POS algorithm has the characteristics of short block interval and less occupied computing resources, and can bear more business logic and provide quicker response service; the high efficiency of the block chain can be ensured on the premise of ensuring the safety of the block chain.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a hybrid consensus method and a consensus device combining POW and POS.
Background
The block chain is a novel distributed system technology, and a consensus mechanism is an extremely important ring. Through a consensus mechanism, the data among all nodes in the distributed system can be recognized to be consistent, and therefore the consistency of data storage is guaranteed. With the development of the blockchain technology, a variety of consensus mechanisms are generated, and representative of the consensus mechanisms are the POW consensus mechanism and the POS consensus mechanism.
The POW consensus mechanism mainly determines a block by calculating a block hash meeting the difficulty requirement by a node, and so far, obtaining a suitable block hash can only be obtained by an exhaustive algorithm, so that a large amount of computing resources are consumed. Since anyone or organization cannot monopolize computing resources, no monopolize mode exists to prevent new nodes from joining the POW consensus network, which fully embodies the fairness of the block chain. However, the blockchain is valuable not in its consensus algorithm itself, but in the business logic running on it, which also consumes computational resources. However, in order to ensure that the node can contend for the block right, a large amount of computing resources are allocated to the computation of the block hash, and only a very small amount of computing resources are allocated to the computation of the business logic, so that a block chain commonly known by POW is caused, and the efficiency is not high.
The POS consensus mechanism mainly confirms a new out-block node through historical data of a chain and certain established rules, therefore, the POS consensus itself hardly consumes computing resources, and the node can use all the computing resources for the computation of business logic, thereby realizing higher corresponding speed and larger data capacity. However, the security of the POS consensus is far lower than the POW consensus algorithm because the block-out calculation is performed using the historical data of the chain, and the block-out rights can be monopolized, and a new node may take hundreds of times of costs to join the POS consensus network, or may never join the POS consensus network.
How to combine the advantages of the two consensus algorithms and design a novel consensus algorithm without monopoly and high efficiency is one of the important problems to be solved in the field of block chains.
In the prior art, a scheme for mixing common identities of POW and POS is available, but the essence of the scheme is to design a uniform evaluation standard so that nodes with high computing power and nodes with high rights compete out blocks in the same dimension; in addition, there are some schemes for improving the efficiency of the blockchain, such as fragmentation, lightning network, etc., which do not directly optimize the blockchain itself, but provide a lay2 level optimization, and such optimization comes at the expense of a certain security.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a novel hybrid consensus method combining POW and POS, which is safer, more fair and more efficient.
The purpose of the invention is realized by the following technical scheme:
a mixed consensus method combining POW and POS comprises two block chains, wherein a first chain adopts POW consensus blocks, a second chain adopts POS consensus blocks according to historical data of the first chain, and runs service logic, and the consensus process comprises three parts, namely address mapping, calculation force mapping and competition out blocks;
the address mapping is used for associating the node address of the first chain with the node address of the second chain;
the calculation force mapping is to calculate the calculation force of each node on a first chain in a certain time interval and then convert the calculation force of the nodes on the first chain into the block-out rights and interests on a second chain;
and performing a contention-out block on the second chain, wherein the contention-out block is executed after the address mapping and the computation force mapping, and the method comprises the following steps:
s1: inputting the block-out rights and interests of each node on the second chain into a verifiable random function, and calculating to obtain a block-out node of the next block;
s2: each node sends out the block and signs the block when finding that the current block-sending node is the node, and then broadcasts the block and the signature; if the block is not the self block, carrying out validity check on the received block, if the block passes the check, signing the block, then broadcasting the block and the signature, and if the block does not pass the signature, discarding the block;
s3: judging whether the rights and interests need to be recalculated, if so, recalculating the rights and interests, and returning to S1; if not, directly returning to S1;
s4: the chain with the largest signature weight is selected as the longest chain.
Further, rate adjustment judgment is inserted as required in the competition out of the blocks, and when the condition of recalculating the rate is met, the time interval of the following blocks is reset.
Further, the validity check in S2 includes:
checking whether the block is correct;
checking whether the electronic signature contained in the block conforms to a preset rule;
checking whether each electronic signature of the block is in conformity with a passing cryptographic check;
checking whether the block timestamp is correct;
checking whether the format of each transaction in the block is correct;
the hash value of the entire block is checked for correctness.
Furthermore, each node firstly registers and then participates in competition out of the block.
Further, in S3, after the right to recalculate is determined, when each node determines that the current block-out time is the next block based on the local time, the process returns to S1.
Further, the preset rule of the electronic signature is that the signature of the block n by the block output person must be packed into the block n, and the signatures of the block n by other nodes must be packed into blocks n +1 to n + m, where n is the block height and m is the security coefficient.
An apparatus for implementing a consensus process, the apparatus comprising a first chain link point apparatus and a second chain link point apparatus;
the first chain link point device and the second chain link point device comprise the following modules:
the receiving module is used for receiving data sent by other equipment on a chain where the receiving module is located;
the confirmation module is used for verifying the received data and determining whether the received data meets the consensus rule of the chain where the received data is located;
the consensus computing module is used for computing the received data according to the rule of the chain where the consensus computing module is located and preparing the data for the sending module;
the transmitting module is used for transmitting the received legal data and the data broadcast output by the calculation module in a calculation mode to other node equipment in a chain where the data broadcast is located;
the address conversion module is used for converting the address format of the other arbitrary chain into the address format of the chain in which the other arbitrary chain is positioned;
the storage module is used for storing data required in the consensus process;
the second chain link point device also comprises a reading module which is used for reading any data in the first chain link point device.
Compared with the prior art, the invention has the following beneficial effects:
(1) compared with the existing common identification method for POW calculation power statistics, the common POW calculation power statistics needs a plurality of special nodes, the calculation power of the nodes is counted according to a certain rule, the possibility of cheating is provided for the nodes, the safety of the whole system is maintained on the calculation power statistics nodes, and the safety is insufficient. The invention uses a complete chain to count the computing power of each node, thereby ensuring that the node can not cheat and needing no special counting node, thereby solving the problem of single-point failure.
(2) Compared with the existing POW chain consensus realization method, most of computing resources of each node in the methods are occupied by the hash collision algorithm, so that the service logic bearing capacity is low, and the response time is slow. The business logic of the invention is on the second chain, the consensus computation of the second chain hardly occupies computing resources, the bearing capacity is large, and the response is fast.
(3) Compared with the existing POS chain, the POS chain solves the problems of insufficient safety, poor mobility and monopoly of large financial groups existing in the existing POS chain consensus.
In general, the invention combines the high security of the POW algorithm with the property of being able to be added without auditing; the POS algorithm has the characteristics of short block interval and less occupied computing resources, and can bear more business logic and provide quicker response service; the high efficiency of the block chain can be ensured on the premise of ensuring the safety of the block chain.
Drawings
FIG. 1 is a flow chart of a consensus method of the present invention, including rate adjustment logic;
FIG. 2 is a schematic diagram of a signature rule according to the present invention;
FIG. 3 is a diagram of an exemplary chain structure in an embodiment.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and preferred embodiments, and the objects and effects of the invention will become more apparent. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The mixed consensus method combining the POW and the POS comprises two block chains, wherein the first chain adopts the POW to prove that the blocks are known together, the second chain adopts the POS to identify the blocks together according to the historical data of the first chain, and the business logic is operated.
The first chain can select to operate a brand-new POW block chain and can also select the existing POW block chain, so that the development cost and the energy consumption are reduced.
The second chain is the main body of the scheme, and all service logic (such as intelligent contracts) provided for users are realized on the second chain.
The second chain consensus process comprises three parts, address mapping, power mapping and competition-out block, and optionally, rate adjustment logic can be added.
Address mapping refers to an algorithm that associates a node address in a first chain with a node address in a second chain, for example, a transaction in a special format is generated in the first chain, and a node in the second chain establishes a connection between an address in the first chain and an address in the second chain by analyzing the transaction.
Alternatively, the mapping relationship between the addresses may be updated and replaced.
Other methods may also be selected to establish the address mapping relationship, for example: generating a transaction in a particular format on the second chain; generating a transaction of a particular format on each of the two chains; and establishing the corresponding relation between the two chains at a place outside the two chains according to a certain advanced convention.
The calculation force mapping means that the calculation force x of the address on the first chain is converted into the deblocking right y owned by the address on the second chain, and the calculation function y ═ f (x) can be selected as follows:
(x) is a direct proportional function or other form of non-decreasing function;
different nodes or addresses employ different f (x);
the f (x) used at different times is different.
The address mapping and the power mapping are the premise of competing out the blocks, but in the process of competing out the blocks, the nodes which want to be newly added can still execute the address mapping and the power mapping logic at any time.
The competition-out block comprises the following steps:
s1: inputting the block-out rights and interests of each node on the second chain into a random verifiable function, and calculating to obtain a block-out node of the next block;
s2: each node sends out the block and signs the block when finding that the current block-sending node is the node, and then broadcasts the block and the signature; if the block is not the self block, carrying out validity check on the received block, if the block passes the check, signing the block, then broadcasting the block and the signature, and if the block does not pass the signature, discarding the block;
s3: judging whether the rights and interests need to be recalculated, if so, recalculating the rights and interests, and returning to S1; if not, directly returning to S1;
s4: the chain with the largest signature weight is selected as the longest chain.
Optionally, a rate adjustment decision may be inserted as needed during the process of competing out the blocks, and when a condition for recalculating the rate is met, the time interval of the following block is reset. Fig. 1 shows the consensus algorithm after adding a competing block.
New out-of-block interval t Ss/S
Wherein t represents a default block output interval, Ss represents an expected value of the block output speed of the first chain under a normal condition, and S represents the block output speed of the current first chain.
The validity check in S2 includes:
checking whether the block is correct;
checking whether the electronic signature contained in the block conforms to a preset rule;
checking whether each electronic signature of the block is in conformity with a passing cryptographic check;
checking whether the block timestamp is correct;
checking whether the format of each transaction in the block is correct;
the hash value of the entire block is checked for correctness.
Optionally, to further improve security, a competing out-of-block link may be added to the entry link, the un-registered node, whose final out-of-block benefit is considered to be 0.
Alternatively, in order to counteract adverse effects caused by network delay, fluctuation, and the like, in S3, after the determination of the right of recalculation, each node may wait for a period of time, and only when the out-of-block time of the next block is determined based on the local time, the process returns to S1.
In consideration of safety, the preset rule of the electronic signature in the validity check is that the signature of the block n by the block generator must be packed into the block n, and the signatures of other nodes to the block n can only be packed into the block n +1 to the block n + m, wherein n is the block height, m is the safety coefficient, and the value of m is a smaller integer. Fig. 2 is an illustration of one possible signature scenario.
An apparatus for implementing a consensus process, the apparatus comprising a first strip point apparatus and a second strip point apparatus;
the first chain link point device and the second chain link point device comprise the following modules:
the receiving module is used for receiving data sent by other equipment on a chain where the receiving module is located;
the confirmation module is used for verifying the received data and determining whether the received data meets the consensus rule of the chain where the received data is located;
the consensus computing module is used for computing the received data according to the rule of the chain where the consensus computing module is located and preparing the data for the sending module;
the transmitting module is used for transmitting the received legal data and the data broadcast output by the calculation module in a calculation mode to other node equipment in a chain where the data broadcast is located;
the address conversion module is used for converting the address format of the other arbitrary chain into the address format of the chain in which the other arbitrary chain is positioned;
the storage module is used for storing data required in the consensus process;
the second chain link point device also comprises a reading module which is used for reading any data in the first chain link point device.
One embodiment of the invention is given below with bitcoin as the first chain.
Fig. 3 is a specific chain structure diagram in this embodiment. In the embodiment, round (concept of round) is introduced to provide a judgment basis for the recalculation of the rights and the rate, specifically, one block can be generated every 5 seconds, every 720 blocks are regarded as a round, and when the node finds that each round is finished and a new round is started, the rights and the block output rate are recalculated.
1. Address mapping logic
Preparing a verifier address of a node on a second chain, wherein the verifier address is represented as A1, and then converting the address A1 on the second chain into a bitcoin address represented as A2 through an address conversion algorithm (the address of a bitcoin is a proper noun, namely the identity of the node in a bitcoin network);
then using the coin address of bitcoin (denoted as A3, the coin is a special transaction of bitcoin, only the node winning in the competitive competition can own the coin transaction) to send a transaction with 1234 clever amount to the bitcoin address A2 created in the previous step in the bitcoin network;
and the second chain monitors special transactions in the bitcoin block, takes out the cognizant coinbase address A3 and the verifier address A1 on the second chain, and establishes a mapping relation, namely the address mapping is completed.
Additional design rules: the waiting time for the mapping relation to actually take effect is set to be 3 days.
2. Computing power mapping logic
When each new round begins, all the bitcoin blocks with the block time being [ 15 days before the current time and 1 day before the current time ] are taken out for statistics; counting the occurrence times of each received block reward address in the coinbase, wherein the block yield of the node of the second chain in the current round is equal to the occurrence times of the corresponding bit coin address.
3. Contending out block logic
And (3) registration logic:
the node which wants to go out the block needs to be registered first, and the node which does not have the registration cannot go out the block no matter how much block right the node has. After the nodes are registered, the validity period is one day, and the remaining validity period can be reset to one day each time when the nodes successfully come out; after the validity period is exceeded, the node needs to register again to perform the block output.
Block out selection logic for the next block:
when each round starts, the second chain distributes according to the block-out rights and interests of the current effective registration node, the block-out person of each block of the next round of 720 blocks is determined at one time, and random number seeds adopted in the distribution process are generated by a verifiable random function;
in addition, the total number of block-out persons of the 720 blocks does not exceed 100.
And (3) block output logic:
each node sends out the block and signs the block when finding that the current block-sending node is the node, and then broadcasts the block and the signature; if the block is not the self block, carrying out validity check on the received block, if the block passes the check, signing the block, then broadcasting the block and the signature, and if the block does not pass the signature, discarding the block;
the judgment of whether the block conforms to the rule comprises the following steps:
checking whether the block-out person is correct, namely whether the block-out person is consistent with the block-out person of the block calculated when the previous round starts;
checking whether the electronic signature contained in the block conforms to a preset rule, namely the signature of the block n by a block outlet must be packed into the block n, and the signatures of other verification nodes can be packed only in the blocks n + 1-n + 10;
checking whether each electronic signature of the block conforms to an elliptic curve algorithm rule of asymmetric encryption;
checking whether the block timestamp is correct, i.e. the received block timestamp must not exceed the local time by 5 s;
checking whether the format of each transaction in the block is correct, similar to common blockchain logic;
checking whether the hash value of the whole block is correct or not, wherein the check is similar to the common block chain logic;
other legitimacy judgment rules are similar to the common block chain consensus algorithm and are not repeated.
Then, the start of the next block is waited for, and in particular, if the block height of the next block is a multiple of 720 (block height is calculated from 0), the block right is recalculated and a new out-block interval is set.
4. Main chain judgment logic
When the node receives a plurality of chains (branches), the judgment is carried out according to the signature weight on each chain, the chain with the maximum weight is regarded as an effective chain, the weight is related to the number of signatures and the rights and interests of the signature nodes, and the specific algorithm is as follows: the rights to the signature node contained in each chunk are summed and then the signature rights for all chunks in the chain are summed.
5. Rate adjustment logic
The rule for setting the block-out interval is as follows:
firstly, the block-out interval is defaulted to 5 s;
secondly, when each round starts, the second chain calculates the middle time stamp T1 of the corresponding bit currency block in the previous round and the middle time stamp T2 of the corresponding bit currency block in the current round, and calculates T2-T1, and then in the new round, 5 x (T2-T1)/3600 is adopted as a new block outlet interval;
for example, the default out-of-block interval for a bitcoin is 10 minutes, and if the out-of-block interval for some reason becomes and remains at 8 minutes all the time, then the calculation of the out-of-block interval for the second chain becomes 4s in this algorithm logic.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and although the invention has been described in detail with reference to the foregoing examples, it will be apparent to those skilled in the art that various changes in the form and details of the embodiments may be made and equivalents may be substituted for elements thereof. All modifications, equivalents and the like which come within the spirit and principle of the invention are intended to be included within the scope of the invention.
Claims (7)
1. A mixed consensus method combining POW and POS comprises two block chains, wherein a first chain adopts POW consensus blocks, a second chain adopts POS consensus blocks according to historical data of the first chain, and runs service logic, and the consensus process comprises three parts, namely address mapping, calculation force mapping and competition out blocks;
the address mapping is used for associating the node address of the first chain with the node address of the second chain;
the calculation force mapping is to calculate the calculation force of each node on a first chain in a certain time interval and then convert the calculation force of the nodes on the first chain into the block-out rights and interests on a second chain.
And performing a contention-out block on the second chain, wherein the contention-out block is executed after the address mapping and the computation force mapping, and the method comprises the following steps:
s1: inputting the block-out rights and interests of each node on the second chain into a verifiable random function, and calculating to obtain a block-out node of the next block;
s2: each node sends out the block and signs the block when finding that the current block-sending node is the node, and then broadcasts the block and the signature; if the block is not the self block, carrying out validity check on the received block, if the block passes the check, signing the block, then broadcasting the block and the signature, and if the block does not pass the signature, discarding the block;
s3: judging whether the rights and interests need to be recalculated, if so, recalculating the rights and interests, and returning to S1; if not, directly returning to S1;
s4: the chain with the largest signature weight is selected as the longest chain.
2. The consensus method of claim 1, wherein a rate adjustment decision is inserted as needed during said contending for a block, and the time interval of a subsequent block is reset when a condition for recalculating the rate is met.
3. The consensus method of claim 1, wherein the validity check of S2 comprises:
checking whether the block is correct;
checking whether the electronic signature contained in the block conforms to a preset rule;
checking whether each electronic signature of the block is in conformity with a passing cryptographic check;
checking whether the block timestamp is correct;
checking whether the format of each transaction in the block is correct;
the hash value of the entire block is checked for correctness.
4. The consensus method of claim 1, wherein each node first signs and then participates in competing out blocks.
5. The consensus method of claim 1, wherein in S3, when the node determines that the block-out time is currently the next block based on the local time after the right determination is recalculated, the process returns to S1.
6. The consensus method of claim 3, wherein the predetermined rule of the electronic signature is that the signature of the block n from the block creator must be packed into block n, and the signatures of other nodes must be packed into blocks n +1 to n + m, where n is the block height and m is the security coefficient.
7. An apparatus for carrying out the consensus method of any one of claims 1-6, wherein the apparatus comprises a first strip point apparatus and a second strip point apparatus;
the first chain link point device and the second chain link point device comprise the following modules:
the receiving module is used for receiving data sent by other equipment on a chain where the receiving module is located;
the confirmation module is used for verifying the received data and determining whether the received data meets the consensus rule of the chain where the received data is located;
the consensus computing module is used for computing the received data according to the rule of the chain where the consensus computing module is located and preparing the data for the sending module;
the transmitting module is used for transmitting the received legal data and the data broadcast output by the calculation module in a calculation mode to other node equipment in a chain where the data broadcast is located;
the address conversion module is used for converting the address format of the other arbitrary chain into the address format of the chain in which the other arbitrary chain is positioned;
the storage module is used for storing data required in the consensus process;
the second chain link point device also comprises a reading module which is used for reading any data in the first chain link point device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010131561.0A CN111445241A (en) | 2020-02-28 | 2020-02-28 | Hybrid consensus method and device combining POW and POS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010131561.0A CN111445241A (en) | 2020-02-28 | 2020-02-28 | Hybrid consensus method and device combining POW and POS |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111445241A true CN111445241A (en) | 2020-07-24 |
Family
ID=71653975
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010131561.0A Pending CN111445241A (en) | 2020-02-28 | 2020-02-28 | Hybrid consensus method and device combining POW and POS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111445241A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112417038A (en) * | 2020-11-10 | 2021-02-26 | 深圳百纳维科技有限公司 | Asynchronous block construction method and device based on ocean transportation and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9875510B1 (en) * | 2015-02-03 | 2018-01-23 | Lance Kasper | Consensus system for tracking peer-to-peer digital records |
| US20180276668A1 (en) * | 2017-03-24 | 2018-09-27 | Alibaba Group Holding Limited | Method and apparatus for consensus verification |
| CN108717630A (en) * | 2018-05-19 | 2018-10-30 | 上海分布信息科技有限公司 | One kind going out block method and its realizes system |
| CN109784885A (en) * | 2018-12-29 | 2019-05-21 | 杨鉴 | A kind of block chain ballot common recognition method and system based on equity |
| CN109831425A (en) * | 2019-01-25 | 2019-05-31 | 中国联合网络通信集团有限公司 | Block chain common recognition method, apparatus, equipment and computer readable storage medium |
| CN110602190A (en) * | 2019-08-30 | 2019-12-20 | 上海唯链信息科技有限公司 | Block chain consensus method, block chain node and storage device |
| CN110717759A (en) * | 2019-10-18 | 2020-01-21 | 成都九宽科技有限公司 | Cross-chain anchored block chain heterogeneous system |
| CN110851537A (en) * | 2019-11-28 | 2020-02-28 | 蒋勇 | Consensus method based on block chain fragmentation technology |
-
2020
- 2020-02-28 CN CN202010131561.0A patent/CN111445241A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9875510B1 (en) * | 2015-02-03 | 2018-01-23 | Lance Kasper | Consensus system for tracking peer-to-peer digital records |
| US20180276668A1 (en) * | 2017-03-24 | 2018-09-27 | Alibaba Group Holding Limited | Method and apparatus for consensus verification |
| CN108717630A (en) * | 2018-05-19 | 2018-10-30 | 上海分布信息科技有限公司 | One kind going out block method and its realizes system |
| CN109784885A (en) * | 2018-12-29 | 2019-05-21 | 杨鉴 | A kind of block chain ballot common recognition method and system based on equity |
| CN109831425A (en) * | 2019-01-25 | 2019-05-31 | 中国联合网络通信集团有限公司 | Block chain common recognition method, apparatus, equipment and computer readable storage medium |
| CN110602190A (en) * | 2019-08-30 | 2019-12-20 | 上海唯链信息科技有限公司 | Block chain consensus method, block chain node and storage device |
| CN110717759A (en) * | 2019-10-18 | 2020-01-21 | 成都九宽科技有限公司 | Cross-chain anchored block chain heterogeneous system |
| CN110851537A (en) * | 2019-11-28 | 2020-02-28 | 蒋勇 | Consensus method based on block chain fragmentation technology |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112417038A (en) * | 2020-11-10 | 2021-02-26 | 深圳百纳维科技有限公司 | Asynchronous block construction method and device based on ocean transportation and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110580653B (en) | Block chain consensus mechanism based on transaction | |
| CN110855432B (en) | Asynchronous BFT & DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions | |
| CN106682825A (en) | System and method for evaluating credit of Social Internet of Things based on block chain | |
| CN109993004B (en) | Block chain autonomous method and system based on credit mechanism | |
| CN111416708B (en) | Block chain Byzantine fault-tolerant consensus method and system | |
| CN113822672B (en) | Block chain consensus method based on zero knowledge proof | |
| CN112073483A (en) | Authority certification consensus method and system based on credit and committee endorsement mechanism | |
| CN112163856A (en) | Consensus method and system for block chain and Internet of things fusion scene | |
| Yuan et al. | Efficient Byzantine consensus mechanism based on reputation in IoT blockchain | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| Sun et al. | Rtchain: A reputation system with transaction and consensus incentives for e-commerce blockchain | |
| CN112118138B (en) | System and method for realizing block chain consensus mechanism | |
| CN113407632A (en) | PBFT (proxy-based policy and authorization-based ft) trust certification block chain consensus algorithm | |
| CN114372589A (en) | Federated learning method and related device | |
| CN113037504A (en) | Node excitation method and system under fragment-based unauthorized block chain architecture | |
| CN111078787A (en) | Block chain consensus method based on random number mapping | |
| CN111314428A (en) | Reputation evaluation method and system for block chain nodes | |
| Wang et al. | Game-theoretical analysis of mining strategy for bitcoin-ng blockchain protocol | |
| CN111445241A (en) | Hybrid consensus method and device combining POW and POS | |
| CN115841382A (en) | Virtual power plant transaction block chain, credit evaluation method thereof and consensus mechanism thereof | |
| CN113612618B (en) | Alliance chain consensus method and device | |
| CN114185995A (en) | Block chain consensus mechanism based on contribution value and credit degree | |
| CN112801791B (en) | Block chain consensus method and system based on authorization | |
| CN110990790A (en) | Data processing method and equipment | |
| CN114422146A (en) | Anonymous sorting method for block chain main nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20200724 |
|
| WD01 | Invention patent application deemed withdrawn after publication |