CN112116461A - Blockchain and its consensus method - Google Patents

Abstract

Translated fromChinese

本发明提出一种区块链及其共识方法。区块链包括多个在线节点，每一在线节点依据一最新区块获得一杂凑值，并依据杂凑值利用一椭圆曲线算法产生一基准点，并依据基准点与每一在线节点的一公钥进行一相关性运算，依据运算结果选出最相关的若干在线节点作为多个仲裁会成员，并依据运算出的相关性排序仲裁会成员，仲裁会成员依序有一权限时间来生长区块，若前一个仲裁会成员在权限时间内没有生长区块，则由下一个仲裁会成员生长区块。

The present invention proposes a block chain and a consensus method thereof. The blockchain includes multiple online nodes, each online node obtains a hash value according to a latest block, and uses an elliptic curve algorithm to generate a reference point according to the hash value, and based on the reference point and a public key of each online node Perform a correlation operation, select the most relevant online nodes as multiple members of the quorum according to the calculation results, and sort the members of the quorum according to the calculated correlation. If the previous quorum member does not grow a block within the permission time, the next quorum member will grow the block.

Description

Translated fromChinese

区块链及其共识方法Blockchain and its consensus method

技术领域technical field

本发明涉及区块链技术领域，具体是一种区块链及其共识方法。The invention relates to the technical field of blockchain, in particular to a blockchain and a consensus method thereof.

背景技术Background technique

区块链技术是近年的新兴技术，具备去中心化的特点，能够确保所储存的交易数据不被伪造或篡改。因此，如何在互相没有信任基础的个体之间就交易的合法性等达成共识，便成为一重要课题。Blockchain technology is an emerging technology in recent years. It has the characteristics of decentralization and can ensure that the stored transaction data is not forged or tampered with. Therefore, how to reach a consensus on the legitimacy of transactions among individuals without mutual trust has become an important issue.

发明内容SUMMARY OF THE INVENTION

鉴于上述问题，本发明提出一种区块链及其共识方法，藉以解决先前技术存在之问题。In view of the above problems, the present invention proposes a blockchain and a consensus method thereof to solve the problems existing in the prior art.

在一实施例，区块链包括多个在线节点，每一在线节点依据一最新区块获得一杂凑值，并依据杂凑值利用一椭圆曲线算法产生一基准点，并依据基准点与每一在线节点的一公钥进行一相关性运算，依据运算结果选出最相关的若干在线节点作为多个仲裁会成员，并依据运算出的相关性排序仲裁会成员，仲裁会成员依序有一权限时间来生长区块，若前一个仲裁会成员在权限时间内没有生长区块，则由下一个仲裁会成员生长区块。In one embodiment, the blockchain includes a plurality of online nodes, each online node obtains a hash value according to a latest block, and uses an elliptic curve algorithm to generate a reference point according to the hash value, and is associated with each online node according to the reference point. A public key of the node performs a correlation operation, selects the most relevant online nodes as multiple members of the quorum according to the calculation results, and sorts the members of the quorum according to the calculated correlation. Growth block, if the previous quorum member does not grow a block within the authority time, the next quorum member will grow the block.

在一些实施例中，相关性运算是指距离计算。In some embodiments, the correlation operation refers to a distance calculation.

在一些实施例中，每一在线节点依据杂凑值及时间参数，并利用椭圆曲线算法产生基准点。In some embodiments, each online node generates a reference point using an elliptic curve algorithm according to a hash value and a time parameter.

在一些实施例中，时间参数是指当前时间。In some embodiments, the time parameter refers to the current time.

在一些实施例中，具有权限时间的仲裁会成员将收到的至少一交易单打包为一区块，并将区块广播至其他的仲裁会成员，供验证所述区块并投票。In some embodiments, a member of the quorum with authority time packs the received at least one transaction order into a block, and broadcasts the block to other members of the quorum for validating and voting on the block.

在一些实施例中，区块链更包括至少一优先投票节点，优先投票节点优先验证区块并投票，于所有的优先投票节点都认可区块时，才由仲裁会成员验证区块并投票。In some embodiments, the blockchain further includes at least one priority voting node. The priority voting node validates the block and votes first. When all priority voting nodes approve the block, the members of the arbitration committee validate the block and vote.

在一实施例，区块链的共识方法包括：依据一最新区块获得一杂凑值；依据所述杂凑值利用一椭圆曲线算法产生一基准点；依据基准点与每一在线节点的一公钥进行一相关性运算；以及依据运算结果选出最相关的若干在线节点作为多个仲裁会成员。In one embodiment, the consensus method of the blockchain includes: obtaining a hash value according to a latest block; generating a reference point by using an elliptic curve algorithm according to the hash value; according to the reference point and a public key of each online node performing a correlation operation; and selecting the most relevant online nodes as members of a plurality of arbitration committees according to the operation result.

在一些实施例中，还依据运算出的相关性排序仲裁会成员，仲裁会成员依序有一权限时间来生长区块；以及若前一个仲裁会成员在权限时间内没有生长区块，则由下一个仲裁会成员生长区块。In some embodiments, the members of the quorum are also sorted according to the calculated correlation, and the members of the quorum sequentially have an authority time to grow a block; and if the previous member of the quorum does not grow a block within the authority time, the next A quorum member grows a block.

在一些实施例中，区块链的共识方法更包括：具有权限时间的仲裁会成员将收到的至少一交易单打包为一区块，并将区块广播至其他的仲裁会成员，供验证区块并投票。In some embodiments, the consensus method of the blockchain further includes: a member of the quorum with authority time packs the received at least one transaction order into a block, and broadcasts the block to other members of the quorum for verification block and vote.

在一些实施例中，区块链的共识方法更包括：由至少一优先投票节点优先验证区块并投票，于所有的优先投票节点都认可区块时，才由仲裁会成员验证区块并投票。In some embodiments, the consensus method of the blockchain further includes: at least one priority voting node firstly validates and votes the block, and only when all priority voting nodes approve the block, the members of the arbitration committee validate the block and vote .

综上，本发明提供一种区块链及其共识方法，能够让每一在线节点计算得每一轮的仲裁会成员及其排序，而无需通信协调，能够减少通信资源与时间。且因每一轮的仲裁会成员均不固定，可降低有心人士的干预风险。除此之外，还可指定优先投票节点验证区块，并且在交易单过期后，仍可转为正式的交易记录，避免资源浪费。To sum up, the present invention provides a blockchain and a consensus method thereof, which enables each online node to calculate the members of the arbiter and their ranking in each round without communication coordination, which can reduce communication resources and time. And because the members of the arbitration committee in each round are not fixed, it can reduce the risk of intervention by interested people. In addition, priority voting nodes can also be designated to verify blocks, and after the transaction slip expires, it can still be converted into a formal transaction record to avoid wasting resources.

附图说明Description of drawings

图1是本发明一实施例的区块链的方块示意图。FIG. 1 is a schematic block diagram of a blockchain according to an embodiment of the present invention.

图2是本发明一实施例的区块链的架构示意图。FIG. 2 is a schematic structural diagram of a blockchain according to an embodiment of the present invention.

图3是本发明一实施例的基准点与公钥间的相关性示意图。FIG. 3 is a schematic diagram of the correlation between a reference point and a public key according to an embodiment of the present invention.

图4是本发明一实施例的区块链的共识方法流程图。FIG. 4 is a flowchart of a consensus method of a blockchain according to an embodiment of the present invention.

具体实施方式Detailed ways

为了使本发明的目的、特征及效果更容易理解，以下提供用于详细说明本发明的实施例及附图。In order to make it easier to understand the objects, features, and effects of the present invention, embodiments and drawings for describing the present invention in detail are provided below.

请参阅图1，图1是本发明一实施例的区块链100的方块示意图。区块链100包括多个在线节点110。此些在线节点110经由点对点技术连接。所述在线节点110可以是任何具有计算及连网能力的电子装置，如桌上型电脑、手机、平板电脑、服务器、嵌入式装置等。Please refer to FIG. 1 . FIG. 1 is a schematic block diagram of ablockchain 100 according to an embodiment of the present invention. Theblockchain 100 includes a plurality ofonline nodes 110 . Suchonline nodes 110 are connected via peer-to-peer technology. Theonline node 110 may be any electronic device with computing and networking capabilities, such as a desktop computer, a mobile phone, a tablet computer, a server, an embedded device, and the like.

请参阅图2，图2是本发明一实施例的区块链100的架构示意图。区块200b之后连接区块200c。每一区块200中具有区块头210及区块体220。区块头210包括上一个区块200的杂凑值，杂凑值可作为链结前后区块200的证明。在此示例，区块200b包括上一个区块的杂凑值211a；区块200c包括上一个区块200b的杂凑值211b。区块体220用以储存交易信息。Please refer to FIG. 2 , which is a schematic structural diagram of theblockchain 100 according to an embodiment of the present invention.Block 200c is connected afterblock 200b. Eachblock 200 has ablock header 210 and ablock body 220 . Theblock header 210 includes the hash value of theprevious block 200, and the hash value can be used as a proof for theblocks 200 before and after the chaining. In this example,block 200b includes thehash value 211a of the previous block;block 200c includes thehash value 211b of theprevious block 200b. Theblock body 220 is used to store transaction information.

每一个在线节点110会依据一最新生成的区块200获得一杂凑值。因此，当生成新的区块的时候，此杂凑值也会随之不同。在此，此杂凑值可以是直接采用最新区块中记载的上一区块杂凑值211a、211b。在一些实施例中，杂凑值可以是将最新区块200的全部或一部分(如区块头、时间戳)进行计算而取得。杂凑值可以利用如SHA256等杂凑函数计算而得。Eachonline node 110 obtains a hash value according to a newly generatedblock 200 . Therefore, when a new block is generated, this hash value will also be different. Here, the hash value may be thehash value 211a, 211b of the previous block recorded in the latest block directly. In some embodiments, the hash value may be obtained by calculating all or part of the latest block 200 (eg, block header, timestamp). The hash value can be calculated using a hash function such as SHA256.

请参阅图3，图3是本发明一实施例的基准点与公钥间的相关性示意图。每一个在线节点110依据获得的杂凑值，利用椭圆曲线算法产生一基准点300，并依据基准点300与每一在线节点110的公钥301进行一相关性运算，依据运算结果选出最相关的若干所述在线节点110作为多个仲裁会成员120(图3所示标号302即是仲裁会成员120的公钥)。在此示例的相关性运算是指基准点300与每一在线节点110的公钥301之间的距离计算，但本发明实施例不限于此，例如可以执行特定的数学运算。由于每生成一个新的区块200，均会使杂凑值发生变化，亦即使得基准点300发生变动。而且，因为杂凑演算的特性，即使仅是杂凑值的变化细微，也会使得基准点300发生巨大的变化。因此，每一次生成新的区块200，仲裁会成员120的组成都会是不同的，据此可以提高区块链100的公正性，防止他人有意干涉投票决定。Please refer to FIG. 3 . FIG. 3 is a schematic diagram of the correlation between the reference point and the public key according to an embodiment of the present invention. Eachonline node 110 uses the elliptic curve algorithm to generate areference point 300 according to the obtained hash value, and performs a correlation operation with thepublic key 301 of eachonline node 110 according to thereference point 300, and selects the most relevant one according to the operation result. A plurality of theonline nodes 110 serve as a plurality of quorum members 120 (thereference numeral 302 in FIG. 3 is the public key of the quorum members 120). The correlation operation in this example refers to the distance calculation between thereference point 300 and thepublic key 301 of eachonline node 110 , but the embodiment of the present invention is not limited thereto, for example, a specific mathematical operation may be performed. Each time anew block 200 is generated, the hash value will change, that is, thereference point 300 will change. Furthermore, due to the characteristics of hash operation, even a slight change in the hash value will cause a huge change in thereference point 300 . Therefore, every time anew block 200 is generated, the composition of the members of thearbitration committee 120 will be different, which can improve the impartiality of theblockchain 100 and prevent others from intentionally interfering with the voting decision.

在记帐权方面，依据运算出的相关性可对仲裁会成员120进行排序。在本实施例中是指仲裁会成员120的公钥302相对于基准点300的距离愈近则具有愈高的优先顺序。仲裁会成员120依序有一权限时间(例如两秒)来生长区块200。若前一个仲裁会成员120在权限时间内没有生长区块200，则由下一个仲裁会成员生长区块200。例如，第一优先的仲裁会成员120有两秒的时间可以生长区块200，若因为某些原因没有在此权限时间内生长区块200，则轮到第二优先的仲裁会成员120有两秒的时间可以生长区块200，若第二优先的仲裁会成员120也没有生长区块200，则轮到第三优先的仲裁会成员120，依此类推。由于上述的方式是每个在线节点110都能够自行执行计算，且会得到相同的计算结果，因此仲裁会成员120的决定和记帐权的决定不需要任何通信交流、协调，便能够计算出，可降低通信时间、耗能、及安全性的风险。In terms of billing rights, thearbiter members 120 can be sorted according to the calculated correlations. In this embodiment, it means that the closer the distance between thepublic key 302 of thequorum member 120 and thereference point 300 is, the higher the priority is. Thequorum members 120 sequentially have an authority time (eg, two seconds) to grow theblock 200 . If theprevious quorum member 120 does not grow theblock 200 within the authority time, the next quorum member will grow theblock 200. For example, the firstpriority quorum member 120 has two seconds to growblock 200. If for some reason theblock 200 is not grown within this permission time, the secondpriority quorum member 120 has two seconds to grow. seconds to grow ablock 200, if the secondpriority quorum member 120 also does not grow ablock 200, it is the turn of the thirdpriority quorum member 120, and so on. Since the above method is that eachonline node 110 can perform the calculation by itself and obtain the same calculation result, the decision of the members of thearbitration committee 120 and the decision of the accounting right can be calculated without any communication and coordination, It can reduce communication time, energy consumption, and security risks.

在一些实施例中，产生前述基准点300所依据的资料除了可以是最新生成的区块200获得的杂凑值之外，还可以结合其他参数，例如时间参数。也就是说，将杂凑值与当前时间结合，结合方式可例如为两字符串串接在一起，或各取一部分串接在一起，再将结合后的值利用椭圆曲线算法产生所述基准点300。从而，假使仲裁会成员120轮过一次都没有生长区块200，在第二轮所生成的基准点300也不会相同。In some embodiments, the data based on which theaforementioned reference point 300 is generated can be combined with other parameters, such as time parameters, in addition to the hash value obtained by the newly generatedblock 200 . That is to say, the hash value is combined with the current time, and the combination method can be, for example, two strings are concatenated together, or a part of each is concatenated together, and then the combined value is used to generate thereference point 300 using an elliptic curve algorithm. . Therefore, even if thequorum members 120 have not grown theblock 200 in one round, the datum points 300 generated in the second round will not be the same.

在一些实施例中，可以仅使用杂凑值来形成前述基准点300。当仲裁会成员120轮过一次都没有生长区块200，在第二轮可改用第二新生成的区块200获得的杂凑值来形成前述基准点300，依此类推。In some embodiments, only hash values may be used to form the aforementionedfiducial points 300 . When the members of thearbitration committee 120 have not grown theblock 200 once, in the second round, the hash value obtained by the second newly generatedblock 200 can be used to form theaforementioned reference point 300, and so on.

前述仲裁会成员120除了可轮流掌握记帐权之外，还可以投票表决验证交易是否合法。整体过程大致说明如下。前述在线节点110发起交易时，会将交易单广播至所有在线节点110。每一在线节点110收到交易单后，会将交易单缓存。当决定出仲裁会成员120和记帐权顺序后，拥有记帐权的仲裁会成员120会将缓存的交易单打包成区块并签章后，将区块广播至所有仲裁会成员120(与优先投票节点130，于后详述)。仲裁会成员120会检验区块的合法性，例如检验区块中的交易单与缓存的交易单是否一致，广播此区块的仲裁会成员120是否拥有记帐权，签章是否合法等。若检验通过，仲裁会成员120会给予投票(即通过或不通过)，此投票信息将广播给所有仲裁会成员120。投票信息包含交易单号、投票内容、及仲裁会成员120签章。当任一仲裁会成员120收到足够多的投票信息后(意即通过的票数达到门槛或不通过的票数达到门槛)，便可做出决定，若不通过，则无视此区块，若通过，则将获得的投票信息加上交易单进行广播。所有在线节点110收到此广播后可验证其合法性，例如投票信息是否合法、交易单是否与缓存中的交易单一致，若验证通过便可将新的区块接入。In addition to holding the accounting right in turn, the aforementionedarbitration committee members 120 can also vote to verify whether the transaction is legal. The overall process is roughly described as follows. When the aforementionedonline node 110 initiates a transaction, the transaction list will be broadcast to allonline nodes 110 . After eachonline node 110 receives the transaction order, it will cache the transaction order. After thearbitration committee members 120 and the order of accounting rights are determined, thearbitration committee members 120 with accounting rights will package the cached transaction order into blocks and sign them, and then broadcast the blocks to all arbitration committee members 120 (with thePriority voting node 130, which will be described in detail later). Thearbitration committee member 120 will check the validity of the block, for example, check whether the transaction slip in the block is consistent with the cached transaction slip, whether thearbitration committee member 120 broadcasting the block has the accounting right, whether the signature is legal, and so on. If the check is passed, themembers 120 of the arbitration board will give a vote (ie pass or fail), and the voting information will be broadcast to all themembers 120 of the arbitration board. The voting information includes transaction ticket number, voting content, and 120 signatures of members of the arbitration committee. When anyarbitration committee member 120 receives enough voting information (that is, the number of approved votes reaches the threshold or the number of rejected votes reaches the threshold), a decision can be made. If it does not pass, the block will be ignored. , then broadcast the obtained voting information plus the transaction list. After receiving the broadcast, allonline nodes 110 can verify its legitimacy, such as whether the voting information is legal, whether the transaction list is consistent with the transaction list in the cache, and if the verification is passed, a new block can be accessed.

在一些实施例中，投票通过的门槛可以是50％，也可以视需求更动为特定值。In some embodiments, the threshold for voting can be 50%, or it can be changed to a specific value as needed.

然而，在一些实施例中，交易单上还可以指定至少一优先投票节点130验证交易是否合法后进行签章，所述优先投票节点110可以例如为银行或其他的查核单位的审核装置。在前述的投票环节中，会优先看优先投票节点130的投票信息，于所有的优先投票节点都通过时，才考虑仲裁会成员120的投票信息。如此一来，可以由查核单位作为优先投票节点130，确保每一交易均经过查核单位检验。在一些实施例中，由于查核单位可能因营业时间的关系不能全时进行审核，因此当查核单位验证完之后该笔交易可能已经过期(亦即已有其他交易被打包上链)。在此情形下，若优先投票节点130通过之后，再由当下的仲裁会成员120(即依照最新区块200获得的杂凑值所决定出的仲裁会成员120)投票，于仲裁会成员120投票通过验证后，便可打包至新的区块200(即生长新的区块200)。However, in some embodiments, at least onepriority voting node 130 may also be designated on the transaction sheet to verify whether the transaction is legal and then sign. In the aforementioned voting session, the voting information of thepriority voting nodes 130 will be prioritized, and the voting information of thearbitration committee members 120 will be considered only when all the priority voting nodes have passed. In this way, the checking unit can be used as thepriority voting node 130 to ensure that each transaction is checked by the checking unit. In some embodiments, since the verification unit may not be able to conduct full-time review due to business hours, the transaction may have expired after verification by the verification unit (ie, other transactions have been packaged and uploaded to the chain). In this case, if thepriority voting node 130 is passed, the current quorum members 120 (that is, thequorum members 120 determined according to the hash value obtained from the latest block 200 ) vote, and thequorum members 120 vote to pass After verification, it can be packaged into a new block 200 (ie, anew block 200 is grown).

请参阅图4，图4是本发明一实施例的区块链100的共识方法流程图。区块链100的共识方法包括：依据最新区块200获得杂凑值(步骤S01)；依据杂凑值利用椭圆曲线算法产生基准点(步骤S02)；依据基准点与每一在线节点110的公钥进行一相关性运算(步骤S03)；以及依据运算结果选出最相关的若干在线节点110作为多个仲裁会成员120(步骤S04)。Please refer to FIG. 4 , which is a flowchart of a consensus method of theblockchain 100 according to an embodiment of the present invention. The consensus method of theblockchain 100 includes: obtaining a hash value according to the latest block 200 (step S01 ); using an elliptic curve algorithm to generate a reference point according to the hash value (step S02 ); A correlation operation (step S03 ); and selecting the most relevantonline nodes 110 as a plurality ofquorum members 120 according to the operation result (step S04 ).

决定出仲裁会成员120之后，可依据运算出的相关性排序仲裁会成员120，仲裁会成员120依序有一权限时间来生长区块200(步骤S05)。若前一个仲裁会成员120在权限时间内没有生长区块200，则由下一个仲裁会成员120生长区块200(步骤S06)。After thearbitration committee members 120 are determined, thearbitration committee members 120 can be sorted according to the calculated correlations, and thearbitration committee members 120 have an authorized time to grow theblock 200 in sequence (step S05 ). If theprevious arbiter member 120 does not grow theblock 200 within the authorization time, thenext arbiter member 120 will grow the block 200 (step S06 ).

综上，本发明提供一种区块链及其共识方法，能够让每一在线节点计算得每一轮的仲裁会成员及其排序，而无需通信协调，能够减少通信资源与时间。且因每一轮的仲裁会成员120均不固定，可降低有心人士的干预风险。除此之外，还可指定优先投票节点110验证区块，并且在交易单过期后，仍可转为正式的交易记录，避免资源浪费。To sum up, the present invention provides a blockchain and a consensus method thereof, which enables each online node to calculate the members of the arbiter and their ranking in each round without communication coordination, which can reduce communication resources and time. Moreover, since themembers 120 of the arbitration committee in each round are not fixed, the risk of intervention by interested persons can be reduced. In addition, thepriority voting node 110 can also be designated to verify the block, and after the transaction slip expires, it can still be converted into a formal transaction record to avoid waste of resources.

虽然本发明的技术内容已经以较佳实施例揭露如上，然其并非用以限定本发明，任何熟习此技艺者，在不脱离本发明的精神所作些许的更动与润饰，皆应涵盖于本发明的范畴内，因此本发明的专利保护范围当以前列的权利范围所界定者为准。Although the technical content of the present invention has been disclosed above with preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art, without departing from the spirit of the present invention, makes some changes and modifications, shall be covered in this book. Therefore, the scope of patent protection of the present invention shall be determined by the scope of the preceding rights.

Claims (10)

1. A blockchain, comprising:

the system comprises a plurality of online nodes, wherein each online node obtains a hash value according to a latest block, generates a reference point by utilizing an elliptic curve algorithm according to the hash value, performs correlation operation according to the reference point and a public key of each online node, selects a plurality of online nodes which are most correlated according to the operation result as a plurality of arbitration member members, sorts the arbitration member according to the calculated correlation, generates a growth block by the arbitration member in sequence with an authority time, and generates a growth block by the next arbitration member if the previous arbitration member does not generate a growth block within the authority time.

2. The blockchain of claim 1, wherein the correlation operation is a distance calculation.

3. The blockchain of claim 1, wherein each of said online nodes generates said reference point according to said hash value and a time parameter and using said elliptic curve algorithm.

4. The blockchain of claim 3, wherein the time parameter is a current time.

5. The blockchain of claim 1, wherein the member of the arbitrator having the time of authority packages at least one received transaction list into a block and broadcasts the block to other members of the arbitrator for verification and voting.

6. The blockchain of claim 5 further comprising at least one priority voting node, wherein the arbitration member authenticates the block and votes when all of the at least one priority voting node passes.

7. A method for block chain consensus, comprising:

obtaining a hash value according to a latest block;

generating a reference point by using an elliptic curve algorithm according to the hash value;

performing a correlation operation according to the reference point and a public key of each online node; and

and selecting the most relevant online nodes as a plurality of arbitration member according to the operation result.

8. The method of claim 7, further comprising:

sorting the arbitration member according to the calculated correlation, wherein the arbitration member has an authority time to grow a block in sequence; and

and if the previous arbitration member does not grow the block in the permission time, growing the block by the next arbitration member.

9. The method of claim 8, further comprising:

and the arbitration party member with the permission time packs at least one received transaction list into a block and broadcasts the block to other arbitration party members for verifying the block and voting.

10. The method of claim 9, further comprising:

the arbitration member verifies the block and votes when all of the at least one priority voting node passes.

Images