WO2019192062A1 - 一种基于信任成员的动态权益的共识方法 - Google Patents

一种基于信任成员的动态权益的共识方法 Download PDF

Info

Publication number
WO2019192062A1
WO2019192062A1 PCT/CN2018/088111 CN2018088111W WO2019192062A1 WO 2019192062 A1 WO2019192062 A1 WO 2019192062A1 CN 2018088111 W CN2018088111 W CN 2018088111W WO 2019192062 A1 WO2019192062 A1 WO 2019192062A1
Authority
WO
WIPO (PCT)
Prior art keywords
consensus
group
node
nodes
list
Prior art date
Application number
PCT/CN2018/088111
Other languages
English (en)
French (fr)
Inventor
高西林
黄浩
Original Assignee
上海金丘信息科技股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 上海金丘信息科技股份有限公司 filed Critical 上海金丘信息科技股份有限公司
Publication of WO2019192062A1 publication Critical patent/WO2019192062A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • 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/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
    • 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/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0609—Buyer or seller confidence or verification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H04L9/3255—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using group based signatures, e.g. ring or threshold signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • 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
    • G06Q2220/00—Business processing using cryptography

Definitions

  • the present application relates to the field of blockchain technology, and in particular to a consensus method based on dynamic rights of trusted members.
  • Blockchain as a distributed ledger technology, the most used is the workload proof accounting method, that is, all billing nodes compete for billing rights through calculation.
  • the disadvantages of this method are as follows: 1) waste of computing power; 2) Block confirmation time is difficult to shorten; 3) easy to fork, need to wait for confirmation; 4) can be anonymously recorded, difficult to review.
  • Other blockchains use the equity proof bookkeeping method, that is, all billing nodes determine the voting rights for each round in a random or fixed order.
  • the disadvantages of this method are as follows: 1) Without specialization, participants with equity do not necessarily want to participate in accounting; 2) are prone to forks and need to wait for multiple confirmations.
  • the embodiment of the present application provides a consensus method based on the dynamic rights of trusted members, which is used to solve the problem that the method of determining the accounting rights in the prior art wastes computational power, is easy to fork, and waits for the confirmation time to be too long.
  • a consensus method based on the dynamic rights of trusted members including the following steps:
  • All representative nodes in the representative node list are run by a random number algorithm, and each group uses a BFT algorithm to elect a speaker node of the group, and the speaker node generates an candidate block;
  • the random number algorithm is not a completely random result, but uses an unpredictable seed to generate an algorithm that determines the result.
  • This application combines a random algorithm with a blockchain to ensure that the blockchain technology realizes decentralized, open and transparent on the existing distributed ledger technology. To allow participants to participate in consensus in a more efficient and reasonable manner.
  • the DSC dynamically elects a number of bookholders, and then selects some of the bookkeepers to participate in the bookkeeping according to the specified rules.
  • the BFT method is adopted for the transaction consensus among the bookkeepers. Each consensus should not allow too many bookholders to participate, but Bookkeepers have the opportunity to participate in bookkeeping, which can effectively improve consensus performance.
  • the DSC consensus requires only a small amount of computation, and there is only a small risk of forking.
  • the delay in generating a block on the chain is similar to the delay in completing the block broadcast in the network.
  • the DSC consensus does not Pursuing the high efficiency of POS and DPOS, we are looking for a comprehensive balance point in terms of security, scale, consistency and usability while focusing on efficiency.
  • Figure 1 is an overall flow chart from a consensus based on the dynamic rights of trusted members
  • FIG. 3 is a consensus flow chart of dynamic rights based on trusted members described from the perspective of a common node.
  • FIG. 1 it is an overall flow chart based on the consensus of the dynamic rights of trusted members. Participants initiate a billing application through their own weights, wait for other participants to apply for a bill or vote, start billing, generate a block of consensus, and initiate a billing application:
  • the pre-positioned participants need to first reach a consensus on the distribution of the certificate and write it into the founding block of each node.
  • Each participant starts each node program and the system starts to run;
  • the client that needs to submit the winding transaction (which can be a mobile APP, WeChat, webpage, etc.) is connected to any participant to initiate the transaction;
  • the transaction is broadcast to the entire network
  • the participant broadcasts the election request to the entire network as needed. It can be set in the node program to ensure that the function is always valid, that is, the participant will automatically participate in each round of accounting elections. Generally, the main initiator will always initiate the accounting request, and the node needs to Retaining a certain pass in the account will impose certain penalties on the behavioral platform that intentionally destroys the system;
  • FIG. 2 is a consensus flowchart of a dynamic member based on trust members described from the perspective of a representative node. After the blockchain is officially run, the block is generated with the current block height h as the block height h+1, as follows:
  • the user node that has the certificate passes the voting to become the representative node or deposits the deposit into the smart contract to become the representative node.
  • the representative nodes of the first round are preset by the system, and both the election and the voting are ongoing, but if the election result changes, The list of delegates has changed and will take effect in the next round of consensus; the number of groups and the number of nodes in each group are preset by the system.
  • the system elects n representatives based on the number of statistical votes.
  • the former w represents the member, the w+1 to n representatives are called observers, n and w are preset by the program, and all elected representatives must be online. If the total number of online representatives is less than 2, the current round of consensus fails and waits for the next round of consensus.
  • the election election message was elected to the speaker. There was no speaker in the beginning group. All the members were equal. When there were members in the group, they were (The number of signatures includes the speaker himself) The number of votes is upgraded to the speaker, and the confirmation broadcast is initiated within the group. If the election timeout period is reached, no member has obtained it. If the number of votes is changed, the status of the group becomes waiting. If the status of the m-1 group in the m group of billers becomes waiting, all the groups enter the broadcast election message to elect the speaker wheel;
  • the speaker generates a list of transaction number lists and broadcasts them in the group.
  • the members of the group perform verification and sign the signed signature.
  • the speaker collects them.
  • an candidate block is generated for the block h+1 height, if not collected within the broadcast transaction number list timeout period
  • the signed message agreed above enters the second overall order and is automatically upgraded to the speaker and repeats the generation of the transaction number list proposal and broadcasts the process within the group;
  • the speaker After the speaker generates the candidate block, it broadcasts in the group. If the speaker does not broadcast the block within the timeout period of generating the candidate block, the second-order member automatically upgrades to the speaker and uses the collected The transaction number list of the signed message agreed to generate the candidate block and broadcast in the group. After all the members in the group verify that the candidate block is correct, the group state becomes the ready state;
  • all the random functions representing the running confirmation block select one of the candidate blocks as the official block of h+1 and broadcast the block, and the current round of consensus ends.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Finance (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • Technology Law (AREA)
  • General Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本申请提供了一种基于信任成员的动态权益的共识方法(DSC)，是一种彻底消除区块链分叉可能性的共识机制，并在性能、规模和安全之间取得均衡。DSC通过动态选举若干记账者，然后按照指定规则轮流选择部分记账者参与记账，在这些记账者间采用BFT方式进行交易共识，每次共识尽量不让过多记账者参与，但记账者都有参与记账的机会，这样可以有效提高共识性能。

Description

一种基于信任成员的动态权益的共识方法 技术领域
本申请涉及区块链技术领域，特别涉及一种基于信任成员的动态权益的共识方法。
背景技术
区块链作为一种分布式账本技术，采用最多的是工作量证明记账方式，即所有记账节点通过运算来争夺记账权，这种方法缺点如下：1)浪费算力；2)区块的确认时间难以缩短；3)容易产生分叉，需要等待确认；4)可匿名记账，难以审查。另一些区块链采用的是权益证明记账方式，即所有记账节点按随机或固定顺序的方式来决定每一轮次的记账权。这种方法缺点如下：1)没有专业化，拥有权益的参与者未必希望参与记账；2)容易产生分叉，需要等待多个确认。
发明内容
针对上述不足，本申请实施例提供一种基于信任成员的动态权益的共识方法，用于解决现有技术中决定记账权的方式浪费算力、容易分叉、等待确认时间过长的问题。
为了解决上述技术问题，本申请所采用的技术方案如下：
一种基于信任成员的动态权益的共识方法，包括如下步骤：
代表节点列表中的所有代表节点运行随机数算法进行分组，每组内采用BFT算法选举出本组的议长节点，议长节点生成备选区块；
当所有组备选区块就绪后，所有代表节点均运行随机数算法，从所有组的备选区块中选出一个作为新区块并广播，本轮共识结束；
更新代表节点列表，开始下一轮共识。
随机数算法并非完全的随机产生结果，而是使用一个不可预测的种子，通过这个种子产生一个确定结果的算法。
本申请采用上述技术方案所能达到的有益效果是：本申请把随机算法与区块链结合，保 证区块链技术在实现已有的分布式账本技术，实现去中心化、公开透明的基础上，让参与者能以更高效合理的方式参与共识。
DSC通过动态选举若干记账者，然后按照指定规则轮流选择部分记账者参与记账，在这些记账者间采用BFT方式进行交易共识，每次共识尽量不让过多记账者参与，但记账者都有参与记账的机会，这样可以有效提高共识性能。
DSC共识与目前其他主流共识方法相比，只需要很少的计算量，只有极小的分叉风险，链上生成一个块的延迟近似于在网络中完成区块广播的延迟，DSC共识并没有追求POS和DPOS超高效率，而是在重点关注效率的同时，在安全性、规模、一致性、可用性方面寻找了一个综合平衡点。
附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲,在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1是从基于于信任成员的动态权益的共识的整体流程图；
图2是从代表节点角度描述的基于信任成员的动态权益的共识流程图；
图3是从普通节点角度描述的基于信任成员的动态权益的共识流程图。
具体实施方式
为了使本申请的技术特点及效果更加明显，下面结合附图对本申请的技术方案做进一步说明，本申请也可有其他不同的具体实例来加以说明或实施，任何本领域技术人员在权利要求范围内做的等同变换均属于本申请的保护范围。
如图1所示，为基于信任成员的动态权益的共识的整体流程图。参与者通过自身权重发起记账申请，等待其他参与者进行记账申请或投票，开始记账，共识生成区块，重复发起记 账申请：
在***的发起阶段，预置参与者需要先就通证分配达成共识并写入各节点的创始块中。
各参与者启动各节点程序，***开始运转；
开始接收外部交易，需要提交上链交易的客户端(可以是手机APP、微信、网页等)连接到任意参与者发起交易；
参与者验证交易发起者签名无误后，向全网广播交易；
所有参与者接收到交易后，会根据交易时间戳将交易缓存到本地交易池，如果多笔交易时间戳一致，则以本参与者接收到的先后顺序为准，生成区块时是以记账者记录的顺序为准；
参与者根据需要向全网广播选举请求，可以在节点程序中设置为该功能一直有效，即该参与者会自动参与每轮记账选举，一般主要发起者都会一直发起记账请求，该节点需要在账户中保留一定的通证，对于故意破坏***运行的行为平台将进行一定的惩罚；
确认登记成功选取权的参与者对所有有效的记账候选者进行投票，投票结果向全网广播，如果参与者在准备阶段未能正常登记选举权成功或者投票给一个无效的记账候选者，则该投票会被忽略；
图2是从代表节点角度描述的基于信任成员的动态权益的共识流程图，在区块链正式运行后，以当前区块高度h为区块高度h+1生成区块，具体如下：
拥有通证的用户节点通过投票成为代表节点或在智能合约中存入保证金成为代表节点，首轮的代表节点都由***预设，同时选举与投票都在不断进行，但如果选举结果有变化导致代表列表有了变化，将会在下一轮共识时生效；所述分组的数量和每组内的节点数量由***预设。
具体的，***依据统计票数选举出n个代表，前w位代表称议员，第w+1至n位代表称为观察员，n和w由程序预设，所有选出的代表必须处于在线状态，如果在线代表总数小于2组，本轮共识失败，等待下轮共识。
使用随机函数从议员和观察员中采用加密抽签的方式选出m组记账人，每一组记账总人数为n/m＝p，都是使用随机函数分别从议员和观察员中各选出；
同组中广播选举消息选举议长，期初组内并没有议长，所有议员均身份均等，当组内有议员获取
Figure PCTCN2018088111-appb-000001
(签名数包括议长自己)票数的时升级为议长，并在组内发起确认交易广播，若达到选举超时时间还没有任何议员获取
Figure PCTCN2018088111-appb-000002
选举票数则本组的状态变为等待，如果m组记账人中m-1组状态都变为等待，则所有组进入广播选举消息选举议长轮；
议长生成交易编号列表提案并在组内广播，组内议员进行校验并签署同意的签名，议长在收集到
Figure PCTCN2018088111-appb-000003
以上同意的签名消息后，为区块h+1高度生成备选区块，如果在广播交易编号列表超时时间内未收集到
Figure PCTCN2018088111-appb-000004
以上同意的签名消息则进入第二顺位议员自动升级为议长并重复生成交易编号列表提案并在组内广播过程；
议长生成备选区块后在组内广播，如果在生成备选区块超时时间内议长未广播区块则第二顺位议员自动升级为议长并利用已收集
Figure PCTCN2018088111-appb-000005
以上同意的签名消息的交易编号列表生成备选区块并在组内广播，组内所有成员校验备选区块无误后该组状态变为就绪状态；
当所有组备选区块就绪后，所有代表运行确认区块的随机函数从备选区块中选择一个作为h+1的正式区块并广播区块，本轮共识结束。
更新代表节点列表，开始下一轮共识。
对普通节点来说，只需要参与投票、记录代表列表，然后在收到新区块的时候根据代表列表进行校验即可，如图3所示；
每一轮的共识只会在选举出来的代表之间进行，但最后广播正式区块的时候所有节点都会对新区块的有效性进行校验。
以上所述仅用于说明本申请的技术方案，任何本领域普通技术人员均可在不违背本申请的精神及范畴下，对上述实施进行修饰与改变。因此，本申请的权利保护范围应视权利要求范围为准。

Claims (10)

  1. 一种基于信任成员的动态权益的共识方法，其特征在于，包括如下步骤：
    代表节点列表中的所有代表节点运行随机数算法进行分组，分为议员节点组和观察员节点组，每组内采用BFT算法选举出本组的议长节.点，议长节点生成备选区块；
    当所有组备选区块就绪后，所有代表节点均运行随机数算法，从所有组的备选区块中选出一个作为新区块并广播，本轮共识结束；
    更新代表节点列表，开始下一轮共识。
  2. 根据权利要求1所述的一种基于信任成员的动态权益的共识方法，其特征在于，拥有通证的用户节点通过投票成为代表节点或在智能合约中存入保证金成为代表节点。
  3. 根据权利要求1所述的一种基于信任成员的动态权益的共识方法，其特征在于，首轮的代表节点都由***预设，同时选举与投票都在不断进行，但如果选举结果有变化导致代表列表有了变化，将会在下一轮共识时生效。
  4. 根据权利要求1所述的一种基于信任成员的动态权益的共识方法，其特征在于，所述分组的数量和每组内的节点数量由***预设。
  5. 根据权利要求4所述的一种基于信任成员的动态权益的共识方法，其特征在于，当分组的数量小于2时，本轮共识失败，等待下轮共识。
  6. 根据权利要求1所述的一种基于信任成员的动态权益的共识方法，其特征在于，议长节点生成交易编号列表提案并在组内广播，组内议员节点进行校验并签署同意的签名，议长在收集到
    Figure PCTCN2018088111-appb-100001
    以上同意的签名消息后生成备选区块，其中p为组内总成员数。
  7. 根据权利要求6所述的一种基于信任成员的动态权益的共识方法，其特征在于，如果在广播交易编号列表超时时间内未收集到
    Figure PCTCN2018088111-appb-100002
    以上同意的签名消息，则进入第二顺位议员节点自动升级为议长节点，并重复生成交易编号列表提案并在组内广播过程。
  8. 根据权利要求7所述的一种基于信任成员的动态权益的共识方法，其特征在于，议长 节点生成备选区块后在组内广播，如果在生成备选区块超时时间内议长节点未广播备选区块，则第二顺位议员自动升级为议长并利用已收集
    Figure PCTCN2018088111-appb-100003
    以上同意的签名消息的交易编号列表生成备选区块并在组内广播，组内所有成员校验备选区块无误后该组状态变为就绪状态。
  9. 根据权利要求1所述的一种基于信任成员的动态权益的共识方法，其特征在于，对普通节点来说，只需要参与投票、记录代表节点列表，然后在收到新区块的时候，根据代表节点列表进行校验。
  10. 根据权利要求1所述的一种基于信任成员的动态权益的共识方法，其特征在于，每一轮的共识只会在选举出来的代表之间进行，但最后广播正式区块的时候所有节点都会对新区块的有效性进行校验。
PCT/CN2018/088111 2018-04-04 2018-05-24 一种基于信任成员的动态权益的共识方法 WO2019192062A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810300483.5A CN108564468A (zh) 2018-04-04 2018-04-04 一种基于信任成员的动态权益的共识方法
CN201810300483.5 2018-04-04

Publications (1)

Publication Number Publication Date
WO2019192062A1 true WO2019192062A1 (zh) 2019-10-10

Family

ID=63534139

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/088111 WO2019192062A1 (zh) 2018-04-04 2018-05-24 一种基于信任成员的动态权益的共识方法

Country Status (2)

Country Link
CN (1) CN108564468A (zh)
WO (1) WO2019192062A1 (zh)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110784478A (zh) * 2019-10-31 2020-02-11 深圳前海微众银行股份有限公司 超时时长的调整方法、装置、设备及计算机可读存储介质
CN111083221A (zh) * 2019-12-13 2020-04-28 北京菲林方德科技有限公司 一种交易验证方法及装置
CN111327414A (zh) * 2020-01-20 2020-06-23 布比（北京）网络技术有限公司 一种区块链共识方法、***及计算机存储介质、电子设备
CN111461885A (zh) * 2020-03-31 2020-07-28 财付通支付科技有限公司 共识网络管理方法、装置、计算机以及可读存储介质
CN111556149A (zh) * 2020-04-27 2020-08-18 中国银行股份有限公司 一种基于Raft共识算法的节点选择方法及装置
CN111666343A (zh) * 2020-06-12 2020-09-15 武汉斗鱼鱼乐网络科技有限公司 基于共识机制的数据上链方法、装置及可读存储介质
CN111866066A (zh) * 2020-06-04 2020-10-30 江苏理工学院 基于DPoS的车联网共识算法
CN112102079A (zh) * 2020-08-07 2020-12-18 柳州市蓝海数链科技有限公司 业务数据的处理方法、装置、计算机设备及存储介质
CN112180956A (zh) * 2020-09-07 2021-01-05 航天东方红卫星有限公司 一种基于区块链的星群协同运控规划共识方法
CN113452747A (zh) * 2021-05-13 2021-09-28 西安电子科技大学 可扩展和安全的共识方法、***、存储介质、智能终端

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109255713B (zh) * 2018-11-12 2022-02-01 裴若含 一种区块链网络中某一时间段内记账权的获取方法
CN109523260A (zh) * 2018-11-28 2019-03-26 段红 一种动态节点选举的高并发共识机制
CN110188137B (zh) * 2019-04-19 2021-08-31 杭州电子科技大学 一种基于诚信的区块链共识机制
CN111372220B (zh) * 2020-02-28 2024-03-05 广州大鱼创福科技有限公司 一种应用于车联网的区块链共识方法
CN113379539B (zh) * 2020-03-09 2024-02-23 ***通信集团设计院有限公司 基于区块链的委托权益证明共识方法及装置
CN111695996B (zh) * 2020-05-12 2024-02-20 成都芯域矩阵科技有限公司 一种基于预交诚意金的区块链共识方法及***
CN111641616B (zh) * 2020-05-19 2023-02-03 全链通有限公司 区块链网络中记账权的处理方法、设备及存储介质
CN113518005B (zh) * 2021-06-22 2021-11-16 腾讯科技（深圳）有限公司 一种区块共识方法、装置、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107360206A (zh) * 2017-03-29 2017-11-17 阿里巴巴集团控股有限公司 一种区块链共识方法、设备及***
CN107450981A (zh) * 2017-05-31 2017-12-08 阿里巴巴集团控股有限公司 一种区块链共识方法及设备
CN107766542A (zh) * 2017-10-30 2018-03-06 上海分布信息科技有限公司 一种分区的区块链网络及其实现分区查询的方法
CN107766540A (zh) * 2017-10-31 2018-03-06 上海分布信息科技有限公司 一种分区的区块链网络及其实现分区存储的方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106445711B (zh) * 2016-08-28 2019-04-30 杭州云象网络技术有限公司 一种应用于区块链的拜占庭容错共识方法
CN107578336A (zh) * 2017-09-29 2018-01-12 左鹏 基于动态股权的区块链记账方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107360206A (zh) * 2017-03-29 2017-11-17 阿里巴巴集团控股有限公司 一种区块链共识方法、设备及***
CN107450981A (zh) * 2017-05-31 2017-12-08 阿里巴巴集团控股有限公司 一种区块链共识方法及设备
CN107766542A (zh) * 2017-10-30 2018-03-06 上海分布信息科技有限公司 一种分区的区块链网络及其实现分区查询的方法
CN107766540A (zh) * 2017-10-31 2018-03-06 上海分布信息科技有限公司 一种分区的区块链网络及其实现分区存储的方法

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110784478B (zh) * 2019-10-31 2024-04-30 深圳前海微众银行股份有限公司 超时时长的调整方法、装置、设备及计算机可读存储介质
CN110784478A (zh) * 2019-10-31 2020-02-11 深圳前海微众银行股份有限公司 超时时长的调整方法、装置、设备及计算机可读存储介质
CN111083221A (zh) * 2019-12-13 2020-04-28 北京菲林方德科技有限公司 一种交易验证方法及装置
CN111083221B (zh) * 2019-12-13 2023-08-04 北京菲林方德科技有限公司 一种交易验证方法及装置
CN111327414A (zh) * 2020-01-20 2020-06-23 布比（北京）网络技术有限公司 一种区块链共识方法、***及计算机存储介质、电子设备
CN111461885A (zh) * 2020-03-31 2020-07-28 财付通支付科技有限公司 共识网络管理方法、装置、计算机以及可读存储介质
CN111461885B (zh) * 2020-03-31 2024-03-19 财付通支付科技有限公司 共识网络管理方法、装置、计算机以及可读存储介质
CN111556149B (zh) * 2020-04-27 2022-10-21 中国银行股份有限公司 一种基于Raft共识算法的节点选择方法及装置
CN111556149A (zh) * 2020-04-27 2020-08-18 中国银行股份有限公司 一种基于Raft共识算法的节点选择方法及装置
CN111866066A (zh) * 2020-06-04 2020-10-30 江苏理工学院 基于DPoS的车联网共识算法
CN111866066B (zh) * 2020-06-04 2023-11-07 江苏理工学院 基于DPoS的车联网共识算法
CN111666343B (zh) * 2020-06-12 2022-05-10 武汉斗鱼鱼乐网络科技有限公司 基于共识机制的数据上链方法、装置及可读存储介质
CN111666343A (zh) * 2020-06-12 2020-09-15 武汉斗鱼鱼乐网络科技有限公司 基于共识机制的数据上链方法、装置及可读存储介质
CN112102079B (zh) * 2020-08-07 2024-05-17 柳州市蓝海数链科技有限公司 业务数据的处理方法、装置、计算机设备及存储介质
CN112102079A (zh) * 2020-08-07 2020-12-18 柳州市蓝海数链科技有限公司 业务数据的处理方法、装置、计算机设备及存储介质
CN112180956A (zh) * 2020-09-07 2021-01-05 航天东方红卫星有限公司 一种基于区块链的星群协同运控规划共识方法
CN112180956B (zh) * 2020-09-07 2023-06-06 航天东方红卫星有限公司 一种基于区块链的星群协同运控规划共识方法
CN113452747A (zh) * 2021-05-13 2021-09-28 西安电子科技大学 可扩展和安全的共识方法、***、存储介质、智能终端

Also Published As

Publication number Publication date
CN108564468A (zh) 2018-09-21

Similar Documents

Publication Publication Date Title
WO2019192062A1 (zh) 一种基于信任成员的动态权益的共识方法
US20230129822A1 (en) Resource transfer system
Poon et al. Plasma: Scalable autonomous smart contracts
US11636450B2 (en) Blockchain system to which proof-of-transaction consensus algorithm is applied, and method therefor
CN111563786B (zh) 一种基于区块链的虚拟电厂调控平台及运行方法
CN108805627B (zh) 媒体资源分配方法、装置、***、介质及设备
US11593321B2 (en) Systems and methods of self-administered protocols on a blockchain platform
CN110855432B (zh) 基于可验证随机函数分配验证者奖励的异步bft&dpos共识机制
CN110851531B (zh) 协作边缘计算方法、区块链和协作边缘计算***
CN110751468A (zh) 用于区块链扩展的多向状态通道方法、***及介质
US20210326879A1 (en) Blockchain protocol and a blockchain network
CN108712468B (zh) 一种区块链收益分配方法和分配***
CN112118138B (zh) 区块链共识机制实现***和方法
Goswami et al. E-governance: A tendering framework using blockchain with active participation of citizens
CN116366669A (zh) 一种适用于众包***的基于信誉值分权制衡的共识方法
CN111582864A (zh) 一种区块链数据量证明共识协议
KR102192695B1 (ko) 블록체인 기반의 광고 서비스 시스템의 동작 방법 및 서비스 환경을 구현하기 위한 시스템
US20180041446A1 (en) Resource path monitoring
WO2022079431A1 (en) Block reward management in blockchain
Abidha et al. Gas-efficient decentralized random beacons
CN116452334B (zh) 一种基于区块链的工业园区多边碳交易方法及***
Bachmann Proof of Stake for Bazo
CN110335156A (zh) 区块链的规则维护方法及其***
GB2599734A (en) Blockchain
CN113435949B (zh) 基于智能合约的去中心化联邦机器学习方法、***及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18913711

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 25/01/2021)

122 Ep: pct application non-entry in european phase

Ref document number: 18913711

Country of ref document: EP

Kind code of ref document: A1