WO2020107919A1 - 基于创新性的信誉证明共识协议的分布式网络及生态系统 - Google Patents

基于创新性的信誉证明共识协议的分布式网络及生态系统 Download PDF

Info

Publication number
WO2020107919A1
WO2020107919A1 PCT/CN2019/098108 CN2019098108W WO2020107919A1 WO 2020107919 A1 WO2020107919 A1 WO 2020107919A1 CN 2019098108 W CN2019098108 W CN 2019098108W WO 2020107919 A1 WO2020107919 A1 WO 2020107919A1
Authority
WO
WIPO (PCT)
Prior art keywords
nodes
reputation
node
transaction
data
Prior art date
Application number
PCT/CN2019/098108
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 WO2020107919A1 publication Critical patent/WO2020107919A1/zh

Links

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/08—Payment architectures
    • G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
    • G06Q20/102—Bill distribution or payments
    • 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
    • G06Q20/3827—Use of message hashing
    • 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/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/405—Establishing or using transaction specific rules

Definitions

  • the present invention relates to the field of Internet technology, in particular to a distributed network and ecosystem based on an innovative reputation proof consensus protocol.
  • Scalability The scalability of the blockchain, that is, how to increase the transaction speed and transaction throughput is the focus of current blockchain research. Multiple applications (DApps) in the ecosystem may generate high concurrent requests.
  • the system throughput should be at least sufficient to process tens of thousands of transactions per second, at or near the level of Visa/Mastercard.
  • File storage The development of many commercial application products often involves the storage and transmission of large files, such as self-media, social software, e-commerce platforms, live video, games and other applications require large file storage functions.
  • the classic blockchain does not support storing large files and cannot meet the development needs of the blockchain in actual landing applications.
  • C-end users want to use platform resources for free or at low cost, but the accounting nodes need sufficient incentives to pay for the operating costs of the equipment and maintain a continuous enthusiasm for participation to maintain the decentralization of the decentralized system. How to effectively balance the contradiction between the two is the key to establishing a sustainable development of the underlying system.
  • Smart contract is iterable and easy to use: applications developed on the blockchain need to have a reasonable mechanism to support software upgrades when iterating on functions. All software may be affected by bugs. When a blockchain underlying platform or running application encounters a bug, it needs to be able to fix the bug from the bug.
  • Blockchain is sought after in some areas because of its anonymity. Anonymity is to hide the identity of the user and protect the privacy of the user's information. However, in real business applications, pure anonymity may bring problems such as fraud, breach of contract, and difficulty in safeguarding rights. When a user selects a service provider, he has the right to know whether the service provider is honest and credible.
  • the present invention provides a distributed network and ecosystem based on an innovative reputation proof consensus protocol, which can solve the problems pointed out in the background art.
  • Each computer in the network serves as a node, which is divided into general user nodes and accounting nodes.
  • User nodes only use the various Function, the accounting node is responsible for the maintenance of the system; the system is composed of the application layer, virtual machine, incentive layer, consensus layer, network layer and data layer, where,
  • Application layer equipped with various application software; set up light nodes or full nodes, modify smart contracts, perform zero-knowledge verification, side chain support, distributed storage and computing power platform; virtual machine: virtual machine provides a common interface for users to program The language is used to compile the software of the application layer, and the application layer is converted into the general computer commands at the bottom through the virtual machine, thereby saving the data in the data layer;
  • Incentive layer Responsible for reputation rewards and decentralized distribution mechanisms, accounting nodes get rewards through accounting
  • Consensus layer The POR reputation proof and payment channel are implemented through the application layer; the reputation value is adjusted according to the transaction, and the bookkeeping node is determined, and the bookkeeping node is rewarded through the incentive layer;
  • Network layer The transmission of the underlying data and commands is completed through the network layer; responsible for P2P communication, relay networks and verification mechanisms; thus achieving the transmission and storage of data and commands between computer networks;
  • Data layer Describes the data model, functions and structure of the system, specifically:
  • each leaf node uses the hash of the data block as a label, and the nodes other than the leaf node use the encrypted hash of its child node label as a label, which is used to verify large data
  • each node has a corresponding address. By referring to the address, the information owned by each node can be queried without additional operations.
  • the consensus layer uses an Ethereum-like account structure to perform reputation verification.
  • the process is as follows:
  • Each user is set up with an account.
  • the account records each user's BUS balance and reputation value data.
  • the integrity nodes containing multiple high reputation value data are selected, and these nodes are marked together.
  • Mutual trust nodes include two types: relative and friend mutual trust nodes and high reputation mutual trust nodes.
  • relative and friend mutual trust nodes When the social interaction between the two honest nodes is frequent, the bottom of the blockchain will be reflected as frequent transactions. , It can be considered that these two points have a deep social relationship, that is, friends and family mutual trust nodes or high reputation mutual trust nodes;
  • the integrity node verifies new transactions in the network through the Byzantine fault tolerance process. Successful transactions are recorded in the distributed ledger by the system.
  • the distributed ledger is Refers to a complete backup of an accounting system that simultaneously stores multiple computing devices connected through the network, and each device uses a certain consistency protocol to ensure that each ledger can maintain consistency and integrity, while increasing the reputation value of the corresponding node ;
  • Integrity nodes contribute computing power.
  • the contribution of integrity nodes comes from the computing and storage resources they share.
  • the integrity of the system is ensured by the contribution of integrity nodes.
  • the nodes receive rewards for the corresponding reputation of the system.
  • the amount of computing power is set by the program;
  • the integrity node list Nodes take turns participating in the verification consensus, each round will run the Byzantine fault tolerance protocol to verify the newly generated transaction, if All the nodes in the agreement are agreed, and the transaction is confirmed;
  • Selection method (1) According to all nodes Sort in descending order (2) Generate m random numbers at [0, N), and then round down; in order to prevent repetition, according to the most recent and high reputation value of the unselected nodes, select from high reputation nodes to low reputation nodes in order;
  • Distribution function It is an exponential distribution function. Compared with the triangular distribution, constructing an exponential distribution can give higher-reputation nodes a higher chance and suppress low-reputation nodes.
  • the Byzantine fault tolerance process is specifically that, after obtaining a list of integrity nodes, the reputation certificate verifies the correctness of the transaction through a Byzantine fault tolerance process and updates the ledger.
  • Non-faulty node a node that runs normally in the system, abides by the rules and has no errors.
  • Faulty node the node where the error occurred, including timeout, data corruption and malicious behavior, ie Byzantine error;
  • Nodes use 1 or 0 to indicate transaction verification results. 0 means successful verification and 1 means failed verification; all honest nodes will make decisions within a limited time; all honest nodes will make the same decisions.
  • the proof of reputation divides the consensus into several cycles, each cycle has several rounds, and each round will process several transaction data, so it can be defined
  • the consensus process is:
  • Tx0 and Tx1 are combined into a pending transaction list Tx;
  • Tx will be Broadcast The node in will verify the transaction. If the transaction is verified by enough nodes, the transaction will be updated to the distributed ledger;
  • the malicious node is less than m/3, then the round is defined as success, The contribution activity of the middle node increases, and the transaction activity of the corresponding node increases.
  • the invention provides a distributed network and ecosystem based on an innovative reputation proof consensus protocol. Through ingenious design, it innovatively proposes a PoR reputation consensus algorithm, a decentralized reputation system based on Social Graph and a decentralized reputation system. Incentive system, and meet the technical requirements of large-scale commercial landing applications, especially high-frequency small and micro transactions and social applications in terms of scalability, security, decentralization, etc., with the aim of establishing tens of millions of users
  • the decentralized distributed blockchain underlying public chain and business ecosystem. The cost is low, which is convenient for promotion and use.
  • FIG. 1 is a schematic diagram of the overall structure of a distributed network and ecosystem based on an innovative reputation proof consensus protocol provided by the present invention.
  • 1(a) is a schematic diagram of a DAG number structure of a distributed network and an ecosystem data layer based on an innovative reputation proof consensus protocol provided by the present invention.
  • FIG. 2(a) is a schematic diagram of a new transaction generation and verification based on an innovative reputation proof consensus protocol distributed network and ecosystem provided by the present invention.
  • 2(b) is a schematic diagram of the impact of a new transaction based on an innovative reputation proof consensus protocol distributed network and ecosystem on a social graph.
  • FIG. 3 is a schematic diagram of a social graph structure of a distributed network and ecosystem based on an innovative reputation proof consensus protocol provided by the present invention when two erroneous transactions appear in the system at the same time.
  • FIG. 5 is a schematic diagram of an interactive relationship between a main network and a side chain of a distributed network and an ecosystem based on an innovative reputation proof consensus protocol provided by the present invention.
  • FIG. 6 is a schematic diagram of a distributed network and ecosystem node users based on an innovative reputation proof consensus protocol provided by the present invention to the system through shared computing and storage space.
  • This system is a distributed network system, and each computer in the network can be called a node. According to the division of roles, it can be divided into general user nodes and accounting nodes.
  • the user node (or user for short) only uses the various functions provided by the network of the system, and is not responsible for the maintenance of the network (such as storage, calculation and data verification, etc.).
  • the accounting node is responsible for system maintenance.
  • Accounting nodes can obtain system rewards by participating in system maintenance (also called accounting).
  • DAG directed acyclic graph
  • the system uses an encryption algorithm (quantum hash function) with anti-quantum attack characteristics to encrypt and verify data.
  • the system improves the data processing speed and security.
  • This system adopts distributed hash table technology, and stores a large file on the blockchain by breaking up a large file and storing it on each node of the network.
  • Merkle Tree is a tree-shaped data structure, each leaf node is labeled with the hash of the data block, and the nodes other than the leaf node are labeled with the encrypted hash of its child node label.
  • This system uses the Account system, that is, each node has a corresponding address. By changing the address by reference, you can accurately query the relevant information such as the balance that each node has, without the need to proceed Extra operations.
  • FIG. 1-6 a distributed network and ecosystem based on an innovative reputation proof consensus protocol is composed of an application layer, a virtual machine, an incentive layer, a consensus layer, a network layer, and a data layer.
  • Figure 1 shows the system Schematic diagram of the overall structure of Figure 1. There is a bottom-up logical relationship between each level in Figure 1, that is, the lower level is the basis for the realization of the upper level, and the complete cycle of the system is: transactions between users (taking transactions between two users as an example), Based on the reputation value recorded by the system, the system selects a node with a high reputation value as the accounting node from the system. The selected accounting node is rewarded. The balance of these two users is changed by the code according to the transaction. The code will modify the reputation value of the node.
  • the BVM virtual machine uses an extended instruction set; programmers use their familiar programming languages, such as JAVA, C++ language to write code programs, these codes are converted into the underlying BO instruction set, and then call the underlying network layer and data layer and storage. In order to achieve the final function at the bottom, which:
  • Quantum hash function construct a new quantum fuzzy commitment scheme, and the information processing process can resist quantum Fourier sampling attack in quantum computing environment;
  • Quantum encryption algorithm Quantum encryption is based on complex and difficult mathematical problems to provide better security than traditional encryption
  • Distributed hash table It is a type of distributed computing system used to distribute a set of keys to all nodes in a distributed system
  • Merkle Tree A hash tree is a tree-shaped data structure. Each leaf node is labeled with the hash of the data block, and the nodes other than the leaf node are encrypted with the hash of their child node labels. Tags; hash trees can efficiently and securely verify the contents of large data structures and are a popular form of hash chain
  • Account Each user is called an Account.
  • a and b are two people, they can be expressed as two vertices Va and Vb. If a transaction occurs between a and b, it can be defined as (a, b), which is an edge from a to b, E(a, b). We express the number and number of transactions as edge E(a, b) the weight of.
  • Mutual trust nodes can open "transaction channels" to perform high-frequency offline transactions.
  • Mutual trust nodes include two types, relative and friend mutual trust nodes and high reputation mutual trust nodes.
  • Mutual trust nodes include two types: relative and friend mutual trust nodes and high-reputation mutual trust nodes.
  • Mutual trust nodes refer to two nodes that have reached a mutual trust consensus in some way.
  • family and friends that is, two nodes interact frequently (that is, transactions). We believe that this kind of deep interaction represents a trust relationship.
  • High reputation type two nodes with high reputation value, although they may not have much interaction with each other, but because of their good history (ie high reputation value), they are also given the privilege of offline verification.
  • the bottom of the blockchain will reflect frequent transactions, and these two points can be considered to have a deep social relationship.
  • Jenny and Alice are friends. They often interact through social tools, such as encrypted WeChat chats, sending pictures, sending red envelopes/rewards, and self-media mutual evaluation.
  • Baker Chain defines Jenny and Alice as two nodes with deep social relationships, called “family and friends mutual trust nodes", which are suitable for high-frequency offline transactions.
  • reputation value R the degree to which an individual is recognized in a social network.
  • reputation R the degree to which an individual is recognized in a social network.
  • social activity D the degree to which an individual is recognized in a social network.
  • time activity T the time activity of a social network.
  • contribution activity C contribution activity
  • ⁇ _n is the weight, within a certain time t, D( ⁇ ,t) is the social activity of the node, T( ⁇ ,t) is the time activity of each node, and C( ⁇ ,t) is the contribution activity .
  • D( ⁇ ,t) is the social activity of the node
  • T( ⁇ ,t) is the time activity of each node
  • C( ⁇ ,t) is the contribution activity .
  • R decays with time.
  • the decay rate of reputation value R with time is ⁇ , as shown in formula (2):
  • Social activity D It is determined by a number of factors such as the number of friends of a node in the application social network, the frequency of interaction with friends (ie, popularity), the reputation value of the friends, and the size of the transaction amount.
  • the formula is as follows:
  • E i is the weight function of each transaction, E i is positively related to the transaction amount, D r is the transaction object, log(D r ) is the logarithmic function of the reputation value of D r , used to control when D r is too small, That is, a node and one or more low-credit transactions cannot significantly improve its own Value, which effectively circumvents the possibility of attempting to increase the credibility of malicious users by adding false users.
  • Jack's D value is much higher than Tom's D value.
  • Time activity T This indicator is mainly determined by the currency age of users holding BUS. We believe that long-term holders of tokens are more credible than non-holders and have less motives for doing evil. But unlike Stake equity in the PoS consensus, wealth is not the only criterion for measuring the credibility of a node. As shown in Fig. 6, the logarithmic formula of T( ⁇ ,t) provides the middle-class users with a high reputation opportunity. The formula is as follows:
  • Contribution activity C This indicator describes the contribution of node users to the system C ( ⁇ , t), which indicates how much the node has contributed to the system at time t, N is the system Account Nonce value, used to record the user’s The frequency of system contributions (ie sharing files and participating in bookkeeping in distributed bookkeeping). The system will check the file status according to the scheduled task.
  • Integrity nodes are divided into full-node candidates and light-node candidates.
  • Full node users may come from commercial developers or other community organizations in the Baker Chain ecosystem. Since light nodes can run on devices such as smartphones and home computers, almost all users can become light node candidates. The way that full nodes and light nodes jointly keep accounts can not only stimulate the enthusiasm of both commercial developers and ordinary users, but also restrict the possible centralization tendency.
  • the integrity node in the verification of new transactions in the network through the Byzantine fault tolerance process. Successfully verified transactions are recorded in the system's distributed ledger, while increasing the reputation value of the corresponding node.
  • the Byzantine fault-tolerant process can still provide security and activity guarantee for the system when there are limited malicious nodes.
  • the data layer adopts the data structure of DAG directed acyclic graph.
  • Tx0 is the creation transaction, that is, the first transaction of the entire network at runtime, and the BUS is allocated to the initial user by a special address.
  • Tx1, Tx2, Tx3, Tx4, Tx5, Tx6, ..., Txn are subsequent transactions. Because each transaction has a time (Time) and an order (Order), it forms a directional and acyclic graph of DAG.
  • Tx0 is a transaction record for recharging node N1, corresponding to the first user N1 in Figure 1(b).
  • Tx1 is the second transaction N1 ⁇ N2, that is, N1 transfers several BUS to N2, and users N1 to N2 in the social graph will add an edge, that is, N1 and N2 start to establish a social relationship.
  • N1 and N2 start to establish a social relationship.
  • Figure 1 (a) and (b) show the interactive relationship between DAG data structure and social graph. 15 users generated 14 transactions from Tx0, Tx1 to Tx13, and built the social relationship shown in (b).
  • Tx14 and Tx15 are generated.
  • Tx14 indicates that N1 transfers N BUS to N4, and Tx15 indicates that N5 transfers N BUS to N1. If m>n, because the transaction amount is positively related to the E value, Tx14 is greater than Tx15 for the credit contribution of N1.
  • Tx15 is greater than Tx15 for the credit contribution of N1.
  • the impact of new transactions on the social graph As transactions continue to increase, the connections between the various nodes in the social graph continue to increase, providing more social data to feed the reputation value.
  • Figure 2(a) also demonstrates the system's ability to handle concurrent transactions.
  • Tx14 and Tx15 are generated at the same time, the system can concurrent multiple Byzantine fault-tolerant processes to improve the efficiency of transaction verification.
  • the so-called distributed ledger refers to a complete backup of an accounting system that stores multiple computing devices connected through the network at the same time, and each device is guaranteed by some kind of consistency protocol. Each ledger can maintain consistency and integrity, the English abbreviation is DLT (Distributed Ledger Technology).
  • FIG. 3 it is a schematic diagram of a social graph structure of a distributed network and ecosystem based on an innovative reputation proof consensus protocol provided by the present invention when a double-spending transaction is confirmed in the system.
  • Double-spending transaction refers to the use of a sum of money twice or more), that is, double payment (also known as double-spending, double-spending) is a concept of a digital currency failure mode, that is, the same number
  • the token can be used more than twice.
  • physical currency such as coins
  • electronic files can be copied, so spending this behavior does not remove the possessed state from the original holder, that is, "creating" paid but not removed currency.
  • Adding the same amount of money that has been paid by the beneficiary, or making the beneficiary more than the amount of multiple payments out of thin air is like fake banknotes, which causes inflation and leads to currency depreciation, which no longer makes people trust and willing to hold And circulation.
  • the malicious N1 node will be traced back and punished, the reputation value will be reduced, and it will lose the qualification to participate in the trusted node. Because the cost of doing evil in N1 is much higher than the possible benefits of doing evil, the motivation for doing evil is extremely low.
  • An embodiment of the present invention provides a distributed network and ecosystem based on an innovative reputation proof consensus protocol, which will generate 50 billion BUS tokens without the need for mining. 20% of which is 10 billion BUS will be used as the initial reward pool of PoR reputation consensus. All full nodes and light nodes have the opportunity to be selected to participate in consensus and get rewards.
  • the reward pool will be continuously supplemented by the revenue obtained from the business ecosystem, such as transaction fees, application development fees, and promotion income.
  • a sustainable reward pool can maintain the node's enthusiasm for participation and contribute to the sustainable and healthy development of the ecosystem.
  • the Baker Chain contains full nodes and light nodes, which are selected by users according to their own devices and interests. Full nodes and light nodes will share the BUS rewarded by the system in a 3:2 ratio.
  • the reputation consensus mechanism provided by the embodiments of the present invention not only excels in supporting high throughput and high concurrency, but also has positive scalability. The more users, the faster the transaction speed. While maintaining a low usage fee, maintain the enthusiasm of all people to participate through credibility incentives and maintain the decentralization of the entire network.
  • Embodiments of the present invention provide a smart contract template that can be modified by a user. According to the provided templates and rules, users can develop smart contracts that are easy to upgrade and manage. Due to the central idea that blockchain data cannot be changed, any modification on the blockchain has the potential to fork, so for smart contracts or similar changes that have major stakes, Baker Chain uses the voting method: stakes Fang uses his Stake (token) to vote at a certain time.
  • Asymmetrical encryption algorithms such as ECC256, SHA256, SHA3, etc. These encryption algorithms are easily cracked by quantum computers.
  • Embodiments of the present invention support developers to create their own distributed applications by providing multiple tools to enrich the ecosystem.
  • Baker Chain provides the programming language BO based on Solidity and the corresponding virtual machine BVM as shown in Figure 4, where the square on the left represents the functions of BVM, and the square on the right represents the functions.
  • Developers transform business logic into smart contracts through programming languages, and smart contracts use virtual machines (Virtual Machine) to program programming languages into bytecodes that machines can run.
  • the virtual opportunities provided by the embodiments of the present invention provide more optional opcodes and standard libraries to expand the functions of more social and landing applications. Because there are usually a large number of tokens in smart contracts, once an error occurs, it will cause huge losses to developers and users. Therefore, BVM will provide smart tools to detect transaction sequences, time stamps, accidental processing, and reentrant vulnerabilities (Reentrancy Vulnerability) and other common bugs. In order to improve the development speed and make it easier for developers to write smart contracts, BVM will be a register-based virtual machine.
  • the BVM Compared with the sandbox environment where the EVM is isolated from the outside world (the network, files, or other process permissions cannot be used), the BVM establishes a transmission channel through digital signatures to solve the communication problem between the smart contract and the outside world.
  • BVM In order to allow more developers to join the Baker Chain community, BVM will support Python, Java, C++ and other development languages in the future.
  • the embodiment of the present invention provides a distributed network and ecosystem based on an innovative reputation proof consensus protocol that supports different hooking mechanisms (Two-way Peg/Two-way Anchorage) to realize the combination of the main chain and the side chain, and will be Developers provide sidechain development templates.
  • a distributed network and ecosystem based on an innovative reputation proof consensus protocol provided by embodiments of the present invention, as the main chain will mainly provide trusted bookkeeping and reputation management, and richer business functions Will open and support the implementation of the side chain.
  • distributed storage will be provided, and developers can implement functions such as file storage and multimedia on their side chains.

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Computer Security & Cryptography (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

本发明公开了一种基于创新性的信誉证明共识协议的分布式网络及生态系统，由应用层、虚拟机、激励层、共识层、网络层和数据层构成，采用了DAG有向无环图的数据结构以保持系统的正向可扩展性，支持智能手机轻节点客户端以抗击系统的去中心化，保持分散性，具有更可靠的安全性，提供了友好的DApp和侧链开发环境以满足某些应用在大文件存储、低交易成本、用户信息保护、侧链和智能合约迭代及Bug修复等方面的技术要求，解决了区块链的可扩展性和分散性难点，是目前最可行的高频小微交易和社交应用的区块链生态系统，用户以通过活跃的社交互动和积极使用生态系统中的商业应用来提升信誉值，增加被选为可信轻节点的几率，便于推广使用。

Description

基于创新性的信誉证明共识协议的分布式网络及生态系统 技术领域
本发明涉及互联网技术领域，特别涉及一种基于创新性的信誉证明共识协议的分布式网络及生态系统。
背景技术
比特币的诞生使区块链技术从单纯的理论研究一跃成为全世界瞩目的创新科技，被寄予厚望，希望通过“区块链改变世界”。以太坊提出智能合约，使区块链的落地应用成为可能。
由于众多技术瓶颈的限制，目前区块链距离大规模的商业落地应用可能还需要解决以下技术瓶颈问题：
可扩展性：区块链的可扩展性问题，即如何提高交易的速度和交易的吞吐量是目前区块链研究的重点。生态系统中多个应用(DApp)可能产生高并发请求，系统吞吐量应至少满足每秒处理数万笔交易，达到或接近Visa/万事达卡的水平。
系统安全性与去中心化：经典区块链为了确保交易安全性，需要每个客户端都下载备份全网的交易数据，称为“全节点”。但多数情况下运行全节点是极其昂贵和迟缓的，对于商业应用中的大多数用户都在处理小微交易，并没有能力与需求购置大型计算机和承担相应的运行费用。因此，中小用户无法参与系统运算，无法获得系统奖励，从而形成了少数用户的算力垄断。
文件存储：很多商业应用产品的开发往往涉及大文件存储和传输，例如自媒体、社交软件、电商平台、视频直播、游戏等应用都需要较大的文件存储功能。经典区块链不支持存储大文件，无法满足区块链在实际落地应用中的开发需求。
低交易手续费和有效激励：商业应用场景主要是面对中小用户的高频小微交易，因此交易成本将会成为项目落地应用的重要考虑因素。比特币的交易成本已经超过1美元/次，以太坊的交易成本在0.01～0.02ETH/次，约合5～10美元/次。过高的交易成本显然无法满足高频小微交易的商业需求。
C端用户希望免费或低成本使用平台资源，但记账节点需要足够的激励来支付设备运行 成本，并保持持续的参与热情，以维持去中心化系统的分散性。如何有效平衡两者的矛盾，是建立一个可持续发展的底层系统的关键。
智能合约可迭代与易用性：区块链上开发的应用程序在进行功能迭代时需要有一套合理的机制支持软件升级。所有软件都有可能受到bug的影响，当一个区块链底层平台或运行的应用遭遇bug的时候，需要能够从bug中修复错误。
用户信息保护：区块链在某些领域因为匿名性而受到追捧。匿名性在于隐藏了用户的身份，将用户信息进行隐私性保护，但在真实的商业应用中，单纯的匿名性可能带来欺诈、违约、难以维权等问题。当用户选择服务商时，有权利知道该服务商是否诚实可信。
发明内容
针对上述背景内容中提出的实质性缺陷和不足，本发明提供一种基于创新性的信誉证明共识协议的分布式网络及生态系统，可以解决背景技术中所指出的问题。
一种基于创新性的信誉证明共识协议的分布式网络及生态系统，在网络中的每一个计算机作为一个节点，分为一般的用户节点和记账节点，用户节点只是利用本系统提供的各种功能，记账节点则负责系统的维护；系统由应用层、虚拟机、激励层、共识层、网络层和数据层构成，其中，
应用层：装备各种应用软件；设置有轻节点或全节点，修改智能合约、进行零知识验证、侧链支持、分布式存储和算力平台；虚拟机：虚拟机提供通用接口，用户使用编程语言去编制应用层的软件，同时应用层通过虚拟机转换成底层通用的计算机命令，从而把数据保存在数据层；
激励层：负责信誉奖励和去中心化分配机制，记账节点此通过记账获得奖励；
共识层：通过应用层来实现POR信誉证明和支付通道；根据交易调整信誉值，确定记账节点，记账节点通过激励层获得奖励；
网络层：底层数据和命令的传输通过网络层完成；负责P2P通信、中继网络和验证机制；从而实现数据和命令在计算机网络之间的传输和存储；
数据层：描述了本系统中的数据模型、函数和结构，具体为：
(1)利用有向无环图(DAG)的数据结构，对于发生在分布式记账网络上的交易行为建模，技术的交易数据和存储数据保持在数据层中；
(2)采用了具有抗量子级攻击特性的加密算法即量子哈希函数对于数据进行加密、校验；(3)采用分布式哈希表技术，通过将一个大文件打散之后分别存储在网络的各个节点之上；
(4)使用Merkle Tree树形数据结构，每个叶节点均以数据块的哈希作为标签，而除了叶节点以外的节点则以其子节点标签的加密哈希作为标签，用作验证大型数据结构的内容；
(5)使用账户系统，即每个节点都有一个对应的地址，通过引用改地址，查询到每个节点所拥有的信息，而不需要再进行额外的运算。
在上述技术方案中，共识层采用类以太坊的账户架构来进行信誉证明，过程如下：
(一)定义可信节点列表
每个用户均设置有一个账户，账户中记载了每个用户的BUS余额、信誉值数据，根据每个节点的信誉值筛选出包含有多个个高信誉值数据的诚信节点，这些节点共同标记为一个诚信节点列表；
诚信节点分为全节点和轻节点，互信节点包括两种类型：亲友型互信节点和高信誉互信节点，当两个诚信节点之间的社交互动频繁，在区块链底层将反映为交易次数频繁，则可认为这两个点具有深度的社交关系，即为亲友型互信节点或高信誉互信节点；
(二)通过拜占庭容错过程验证交易
互信节点用户之间可开启小微交易支付通道，进行离线高速交易，诚信节点通过拜占庭容错过程，验证网络中的新交易，验证成功的交易被系统记录到分布式账本之中，分布式账本是指一个记账系统的完整备份同时存储多个通过网络连接的计算设备上，各个设备之间通过某种一致性协议保证每个账本都能保持一致性和完整性，同时增加相应节点的信誉值；
(三)系统通过信誉值动态筛选具有可信赖度的诚信节点；
(四)诚信节点通过贡献算力，诚信节点的贡献来自于他们分享的运算和存储资源，系统的完整性因为诚信节点的贡献而得以保证，同时节点获得系统相应的信誉值的奖励，节点贡献算力的大小通过程序设定完成；
(五)互为可信任节点之间的大额交易，以及非互相可信任节点之间的交易，由诚信节点验证，所有的交易，根据交易对手的不同进行分类，一般情况下，所有的交易都需要提交诚信节点进行验证，如果交易对手互为可信节点，则通过离线验证的方式提升他们之间的交易速度。
在上述技术方案中，诚信节点列表中
Figure PCTCN2019098108-appb-000001
的节点，轮流参与验证共识，每一轮都会运行拜占庭容错协议来验证新生成的交易，如果
Figure PCTCN2019098108-appb-000002
中的所有节点，均达成一致，则交易获得确认；
Figure PCTCN2019098108-appb-000003
根据每个节点当前的
Figure PCTCN2019098108-appb-000004
值和一个分布函数
Figure PCTCN2019098108-appb-000005
来选择，对于节点x来说，他的R x越高，则越容易被记录到
Figure PCTCN2019098108-appb-000006
中；
用
Figure PCTCN2019098108-appb-000007
表示一个节点被选入
Figure PCTCN2019098108-appb-000008
的概率，则有如下：
Figure PCTCN2019098108-appb-000009
选择方法：(1)根据所有节点的
Figure PCTCN2019098108-appb-000010
降序排序(2)根据
Figure PCTCN2019098108-appb-000011
在[0，N)生成m个随机数，然后向下取整；为了防止取重复，根据最近的和高信誉值的未选择节点，依照顺序从高信誉节点向低信誉节点选择；
分布函数
Figure PCTCN2019098108-appb-000012
是一个指数型分布函数，相比较于三角分布，构造指数分布可以给高信誉的节点更高的机会，并且压制低信誉的节点。
在上述技术方案中，拜占庭容错过程具体为，在获得一个诚信节点列表后，信誉证明通过一个拜占庭容错过程验证交易的正确性并更新账本，做出如下定义：
非故障节点：系统中运行正常，遵守规则和无错误的节点。
故障节点：出现错误的节点，包括超时、数据损坏和恶意行为即拜占庭错误；
节点使用1或者0表示交易验证结果，0为验证成功，1为验证失败；所有的诚信节点会在有限时间内做出决策；所有的诚信节点会做出相同决策。
在上述技术方案中，信誉证明将共识分为若干个周期，每个周期有若干回合，每回合会处理若干交易数据，因此可定义
Figure PCTCN2019098108-appb-000013
为第k回合的诚信节点列表，达成共识流程为：
上一回合结束；
有若干未验证交易Tx0；
本回合又有若干新交易生成Tx1；
有Tx0和Tx1组合成待验证交易列表Tx；
Tx会在
Figure PCTCN2019098108-appb-000014
中广播，
Figure PCTCN2019098108-appb-000015
中的节点会验证交易，若交易获得足够多的节点验证，则该交易会被更新到分布式账本中；
Figure PCTCN2019098108-appb-000016
的作恶节点小于m/3，则该回合定义为成功，
Figure PCTCN2019098108-appb-000017
中节点的贡献活跃度增加，相应节点的交易活跃度增加。
本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统，通过巧妙的设计，创新性的提出了PoR信誉共识算法、基于Social Graph社交图谱建立的去中心化信誉体系和激励系统，并分别通过以下技术满足大规模商业落地应用，特别是高频小微交易和社交应用在可扩展性、安全性、分散性等方面的技术要求，旨在建立可服务千万级用户的去中心化的分布式区块链底层公链和商业生态系统。成本较低，便于推广使用。
附图说明
图1为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的 整体结构示意图。
图1(a)为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的数据层的DAG数型结构示意图。
图2(a)为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的新交易产生及验证的示意图。
图2(b)为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的新交易对社交图谱的影响的示意图。
图3为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的当系统同时出现2个错误交易被确认时的社交图谱结构示意图。
图5为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的主网与侧链的交互关系示意图。
图6为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的节点用户对于系统的贡献度通过共享运算和存储空间的结构示意图。
具体实施方式
下面结合附图，对本发明的一个具体实施方式进行详细描述，但应当理解本发明的保护范围并不受具体实施方式的限制。
本系统是一个分布式网络系统，在网络中的每一个计算机可以称为一个节点。按照角色分工，可以分为一般的用户节点和记账节点。用户节点(或简称用户)只是利用本系统网络提供的各种功能，不负责网络的维护(如存储、运算和数据校验等)。记账节点则负责系统的维护。
为了能让系统可以持续的、健康的运行，我们设计了一套去中心化的激励分配奖励机制，记账节点可以通过参与系统维护(也可以称之为记账)，从而获得系统奖励。
利用了有向无环图(DAG)的数据结构，对于发生在分布式记账网络上的交易行为建模。有向无环图是计算机科学中常用的一种数据结构，通过有向无环图可以快速的时间数据的查找、修改、删除和建立。
(2)本系统采用了具有抗量子级攻击特性的加密算法(量子哈希函数)对于数据进行加密、校验等，本系统提高了数据的处理速度和安全性。(3)本系统采用了分布式哈希表技术，通过将一个大文件打散之后分别存储在网络的各个节点之上，从而实现了在区块链上的大文件存储。
(4)Merkle Tree是一种树形数据结构，每个叶节点均以数据块的哈希作为标签，而 除了叶节点以外的节点则以其子节点标签的加密哈希作为标签。使用Merkle Tree可在系统中高效、安全地验证大型数据结构的内容。本系统采用改良版本的Merkle Tree用于提升数据处理速度。
(5)本系统使用了账户(Account)系统，即每个节点都有一个对应的地址，通过引用改地址，可以准确查询到每个节点所拥有的如余额等相关信息，而不需要再进行额外的运算。
如图1-6所示，一种基于创新性的信誉证明共识协议的分布式网络及生态系统，由应用层、虚拟机、激励层、共识层、网络层和数据层构成，图1为系统的整体结构示意图，图1各层级之间存在自底向上的逻辑关系，即下层即为上层级实现的基础，系统的完整周期是：用户发生交易(以两个用户间发生交易为例)，系统会根据系统记录的信誉值，从系统中选择高信誉值的节点作为记账节点。被选中的记账节点获得奖励。这两个用户的余额根据交易由代码进行变化。代码会修改节点的信誉值。
BVM虚拟机使用了扩展的指令集；程序员使用自己熟悉的编程语言，譬如JAVA,C++语言编写代码程序，这些代码转换为底层的BO指令集，进而对底层的网络层和数据层进行调用和存储。从而在底层实现最终功能，其中：
量子哈希函数：构造一种新的量子模糊承诺方案，信息处理过程可抵抗量子计算环境下的量子傅立叶取样攻击；
量子加密算法：量子加密基于复杂困难的数学问题以提供优于传统加密的安全性；
分布式哈希表：是分布式计算系统中的一类，用来将一个键(key)的集合分散到所有在分布式系统中的节点；
Merkle Tree：哈希树(hash tree)是一种树形数据结构，每个叶节点均以数据块的哈希作为标签，而除了叶节点以外的节点则以其子节点标签的加密哈希作为标签；哈希树能够高效、安全地验证大型数据结构的内容，是哈希链的推广形式
Account：每个用户又叫一个Account。
信誉模型和数学抽象
对社交网络，Social Graph，进行建模和数学抽象。每个人可以被抽象成一个个的点(Vertices/Node)，人与人之间的关系可以抽象成为图的一个边，我们可以用数学描述图的方式来描述人与人之间的社交关系、亲密程度以及个人信誉度。
社交关系
假设a和b为两个人，他们可以表示为两个顶点Va和Vb。如果a和b发生了交易行为，则可以定为(a,b)即从a到b的一条边，E(a,b)，我们将交易的数量和次数表示为边E(a,b) 的权重。
互信节点
对于小微交易，互信节点可以开启“交易通道”执行高频离线交易。互信节点包括两种类型，亲友型互信节点和高信誉互信节点。
诚信节点分为全节点和轻节点，互信节点包括两种类型：亲友型互信节点和高信誉互信节点，互信节点是指两个节点之间，通过某种方式达成了相互信任的共识，这种互信有两种：亲友型，即两个节点通过频繁的互动(即交易)，我们认为这种深度的互动代表一种信任关系。高信誉型，具有高信誉值的两个节点，虽然他们彼此之间可能没有很多的互动，但是由于他们良好的历史(即高信誉值)，因此也赋予他们离线验证的特权。
如果两个节点之间的社交互动频繁，在区块链底层将反映为交易次数频繁，则可认为这两个点具有深度的社交关系。Jenny和Alice是朋友，她们经常通过社交工具进行互动，例如：加密微信聊天、传图片、发红包/打赏、自媒体互评等。贝克链定义Jenny和Alice是具有深度社交关系的两个节点，称为“亲友型互信节点”，适用于高频离线交易。
本身具有高信誉值的两个节点即便是第一次进行小微交易也将开启“交易通道”执行高频离线交易。例如具有高信誉的Tom和Jack被视为“高信誉互信节点”，他们虽然是第一次交易，但由于各自在自己的社交网络中拥有良好的信誉表现，对于小微交易来说，作恶之后信誉损失的成本远远大于可能的收益。
信誉值量化
我们定义信誉值R是个体在一个社交网络中被认可的程度。在区块链网络中，我们将信誉R由三个维度构建：社交活跃度D、时间活跃度T和贡献活跃度C。公式如下:
Figure PCTCN2019098108-appb-000018
其中ω_n为权重，在某个时间t内，D(α,t)为节点的社交活跃度，T(β,t)为每个节点的时间活跃度，C(γ,t)为贡献活跃度。为了能让用户有持续不断的活跃度，同时也为了让后来者能更加公平的参与系统运行，避免先行者优势(FMA)带来的马太效应，我们规定R随着时间而进行衰减。声誉值R随着时间衰减率为μ，如公式(2)所示：
Figure PCTCN2019098108-appb-000019
社交活跃度D：由一个节点在应用社交网络中朋友的数量、与朋友互动的频率(即热度)、朋友的信誉值和交易额大小等多种因素决定。公式如下:
Figure PCTCN2019098108-appb-000020
其中E i为每次交易的权重函数，E i与交易金额正相关，D r是交易对象，log(D r)为关于D r信誉值的对数函数，用于控制当D r过小时，即一个节点和一个或者多个低信誉度交易，并不能显著提高自己的
Figure PCTCN2019098108-appb-000021
值，这有效规避了试图通过增加虚假用户恶意提升信誉的可能。
Tom只有少数几个朋友，而且都是低频次单向交流。而Jack有很多朋友，与朋友之间也是频繁互动的，有的朋友是高信誉用户，与有的朋友之间互为可信节点，适用于“交易通道”的高频离线交易。则Jack的D值远远高于Tom的D值。
时间活跃度T：该指标主要由用户持有BUS的币龄决定，我们认为通证的长期持有者比非持有者更可信，作恶动机更小。但与PoS共识中Stake权益不同，财富并非衡量节点是否可信的唯一标准。如图6所示，T(β,t)的对数公式为广大的中产阶级用户提供获得高信誉机会。公式如下：
Figure PCTCN2019098108-appb-000022
贡献活跃度C：该指标描述节点用户对于系统的贡献度C(γ,t)，表示在时间为t时，节点对于系统做了多少的贡献，N是系统Account Nonce值，用于记录用户对于系统贡献的频率(即分享文件和在分布式记账本中参与记账)。系统将会按定时任务对文件状态进行检查。
Figure PCTCN2019098108-appb-000023
共识过程
信誉证明的共识过程分为两部分：
(一)定义可信节点列表
(二)通过拜占庭容错过程验证交易
定义诚信节点(Transaction Validator)，在区块链网络中，有N个用户，每个用户都有信誉值
Figure PCTCN2019098108-appb-000024
根据每个节点的信誉
Figure PCTCN2019098108-appb-000025
筛选出包含有n个高
Figure PCTCN2019098108-appb-000026
值的节点，标记为列表
Figure PCTCN2019098108-appb-000027
诚信节点分为全节点候选人和轻节点候选人。全节点的用户可能来自于贝克链生态中的商业开发者或其他社群机构。由于轻节点可以运行在智能手机和家用电脑等设备上，所以几乎所有的用户都可以成为轻节点候选人。全节点和轻节点共同记账的方式不仅可以激发商业开发者和普通用户双方的积极性，还能制约可能出现的中心化倾向。
Figure PCTCN2019098108-appb-000028
中的诚信节点通过拜占庭容错过程，验证网络中的新交易。验证成功的交易被记录到 系统的分布式账本之中，同时增加相应节点的信誉值。拜占庭容错过程，可以在有限作恶节点存在时，仍然为系统提供安全性和活性的保证。
数据结构和交易关系
数据层采用DAG有向无环图的数据结构，如图1(a)所示，Tx0为创世交易，即整个网络在运行时的第一笔交易，由一条特殊地址向初始用户分配BUS。Tx1，Tx2，Tx3，Tx4，Tx5，Tx6，…，Txn为后续的交易。因为每笔交易存在时间(Time)和顺序(Order)，构成DAG有方向且无环图。
Tx0是一条为节点N1充值的交易记录，对应着图1(b)中有了第一个用户N1。Tx1为第二笔交易N1→N2，即N1向N2转账若干BUS，社交图谱中用户N1至N2将增加一条边，即N1和N2开始建立起社交关系。随着交易Tx的增多，社交图谱中各个节点之间会有越来越多的边，社交网络趋向成熟。
图1(a)和(b)展示了DAG数据结构和社交图谱之间的互动关系。15个用户产生了从Tx0，Tx1到Tx13的14笔交易，构建了如(b)所示的社交关系。
如图2(a)所示，新交易Tx14和Tx15生成。其中Tx14表示N1向N4转账m个BUS，Tx15表示N5向N1转账n个BUS，如果m>n，由于交易额度与E值正相关，对于N1的信用贡献，Tx14大于Tx15的权重。如图2(b)所示，新交易对社交图谱的影响：随着交易的不断增多，社交图谱中各个节点之间的联系不断增加，提供更多的社交数据喂养信誉值。
图2(a)还演示了系统处理并发交易的能力，当Tx14和Tx15同时产生时，系统可以并发多个拜占庭容错过程，提高交易验证的效率。
验证成功的交易被系统记录到分布式账本之中，所谓分布式账本是指一个记账系统的完整备份同时存储多个通过网络连接的计算设备上，各个设备之间通过某种一致性协议保证每个账本都能保持一致性和完整性，英文简称为DLT(Distributed Ledger Techonology)。
如图3所示，为本发明提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的当系统出现双花交易被确认时的社交图谱结构示意图。
双花交易是指一笔钱被使用了两次或多次)即双重支付(又称一币多付、双花攻击，double-spending)是一种数字货币失败模式的构想，即同一个数字token可以被花用两次以上。不像具有实体的符号货币如硬币，电子文件可被复制，所以花用这个行为并不会从原持有者身上移除拥有的状态，也就是"创建"已支付但未移除的货币，加上属于收款者的已支付的同金额货币，或是使收款者凭空多出多重支付的金额，犹如伪钞般，造成通货膨胀而导致货币贬值，从而不再让人信任并愿意持有及流通。
若系统出现双花交易Tx16和Tx17(N1作恶)，(由于拜占庭容错过程的确定性特质，即使Tx16和Tx17被同时确认，当其中的一个被更新到账本上后，另一个由于余额不足就会被自动舍弃，从而避免了双花攻击的出现。
作恶的N1节点将被追溯并收到惩罚，信誉值降低，失去参选信任节点的资格。因为N1的作恶成本远高于作恶可能带来的收益，所以作恶动机极低。
信誉证明的系统激励
本发明实施例提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统的，将产生500亿枚BUS通证，不需要挖矿。其中20％即100亿枚BUS将作为PoR信誉共识的初始奖励池。所有全节点和轻节点都有机会被选中参与共识，获得奖励。
奖励池除了100亿枚初始BUS以外，还将通过商业生态系统中获得的收益进行源源不断的补充，例如：交易手续费、应用开发费、推广收入等。可持续的奖励池能够保持节点的参与热情，有助于生态系统的可持续健康发展。
贝克链包含全节点和轻节点，由用户根据自己的设备和兴趣自主选择。全节点和轻节点将按照3:2的比例分享系统奖励的BUS。
持有早期ERC20BCOO通证(发行总量10亿枚)的用户可以在主网上线后按1:50的比例映射迁移，兑换成主网通证。
信誉共识与各种共识机制的比较
由下表对比可知，本发明实施例提供的信誉共识机制不仅在支持高吞吐量和高并发量方面表现卓越，且具有正向可扩展性，用户越多交易速度越快。在保持低使用手续费的同时，通过信誉激励维持全民参与的积极性，保持全网的分散性。
Figure PCTCN2019098108-appb-000029
在本发明实施例提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统中，还提供以下功能机制：
智能合约与分叉管理
本发明实施例提供可以让用户生成可修改的智能合约模板。用户根据提供的模板和规则，可以开发出易于升级和管理的智能合约。由于区块链数据不可更改的中心思想，任何对于区块链上的修改都有潜在的分叉可能，因此对于具有重大利益相关的智能合约或者类似的更改，贝克链采用投票的方式：利益相关方在一定时间用自己的Stake(通证)进行投票。
量子级加密算法
比特币和以太坊等传统区块链都使用了非对称性加密算法(Asymmetrical)，如ECC256、SHA256、SHA3等，这些加密算法容易被量子计算机破解。
虚拟机和编程语言
本发明实施例通过提供多种工具支持开发者打造属于自己的分布式应用，丰富生态系统。贝克链提供了基于Solidity的编程语言BO和相对应的虚拟机BVM如图4所示，其中左边的方块表示了BVM的各项功能，右边方块表示了各项功能。开发者通过编程语言将商业逻辑转化为智能合约，智能合约通过虚拟机(Virtual Machine)，将编程语言编程成机器可以运行的字节码。
BVM相对于EVM有三大优势：
第一、更容易开发强大功能的智能合约
相比较以太坊的65个opcodes，为了方便开发者能开发更优质的DApp，本发明实施例提供的虚拟机会提供更多可选的opcodes和标准库，扩展更多的社交和落地应用的功能。因为智能合约中通常都有大量的代币存在，一旦出现错误将对开发者和用户造成巨大损失，因此BVM将会提供智能工具，检测交易顺序、时间戳、意外处理和可重入漏洞(Reentrancy Vulnerability)等常见Bug。为了提升开发速度，让开发者更容易编写智能合约，BVM将是一个基于寄存器的虚拟机。
第二、提供接口，使智能合约和外部进行通信
相对于EVM和外部世界隔离(无法使用网络、文件或者其他进程的权限)的沙箱环境，BVM通过数字签名建立传输通道，解决智能合约和外部世界的通信问题。
第三、支持多语言开发
为了能让更多的开发者加入贝克链社区，BVM未来将支持Python，Java，C++等多种开发语言。
侧链支持
本发明实施例提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统，支持不同的挂钩机制(Two-way Peg/双向锚地)实现主链和侧链的结合，并将为开发者提供侧链开发模板。在未来的应用场景中，本发明实施例提供的一种基于创新性的信誉证明共识协议的分布式网络及生态系统，作为主链将主要提供可信记账和信誉管理，更丰富的商业功能将开放并支持侧链进行实施。例如：将提供分布式存储功能，开发者可以在自己的侧链上实现文件存储、多媒体等功能。
一种基于创新性的信誉证明共识协议的分布式网络及生态系统的主网与侧链的交互关 系如图5所示，大部分的商业应用可能会通过侧链运行，交易信息被记录在主网上，同时为主网提供信誉数据喂养。各个应用产品自带流量的同时，用户之间不可避免的存在交互共享，勾勒了更加丰富的社交图谱和生态系统。商业应用开发者由于本身具有更多元的社交图谱和频繁交易，往往可以累积更高的信誉值，被选为“诚信节点”的概率也越高，获得的系统奖励也越多。
以上公开的仅为本发明的几个具体实施例，但是，本发明实施例并非局限于此，任何本领域的技术人员能思之的变化都应落入本发明的保护范围。

Claims (5)

  1. 一种基于创新性的信誉证明共识协议的分布式网络及生态系统，其特征在于，在网络中的每一个计算机作为一个节点，分为一般的用户节点和记账节点，用户节点只是利用本系统提供的各种功能，记账节点则负责系统的维护；系统由应用层、虚拟机、激励层、共识层、网络层和数据层构成，其中，
    应用层：装备各种应用软件；设置有轻节点或全节点，修改智能合约、进行零知识验证、侧链支持、分布式存储和算力平台；虚拟机：虚拟机提供通用接口，用户使用编程语言去编制应用层的软件，同时应用层通过虚拟机转换成底层通用的计算机命令，从而把数据保存在数据层；
    激励层：负责信誉奖励和去中心化分配机制，记账节点此通过记账获得奖励；
    共识层：通过应用层来实现POR信誉证明和支付通道；根据交易调整信誉值，确定记账节点，记账节点通过激励层获得奖励；
    网络层：底层数据和命令的传输通过网络层完成；负责P2P通信、中继网络和验证机制；从而实现数据和命令在计算机网络之间的传输和存储；
    数据层：描述了本系统中的数据模型、函数和结构，具体为：
    (1)利用有向无环图(DAG)的数据结构，对于发生在分布式记账网络上的交易行为建模，技术的交易数据和存储数据保持在数据层中；
    (2)采用了具有抗量子级攻击特性的加密算法即量子哈希函数对于数据进行加密、校验；(3)采用分布式哈希表技术，通过将一个大文件打散之后分别存储在网络的各个节点之上；
    (4)使用Merkle Tree树形数据结构，每个叶节点均以数据块的哈希作为标签，而除了叶节点以外的节点则以其子节点标签的加密哈希作为标签，用作验证大型数据结构的内容；
    (5)使用账户系统，即每个节点都有一个对应的地址，通过引用改地址，查询到每个节点所拥有的信息，而不需要再进行额外的运算。
  2. 根据权利要求1所述的一种基于创新性的信誉证明共识协议的分布式网络及生态系统，其特征在于，共识层采用类以太坊的账户架构来进行信誉证明，过程如下：
    (一)定义可信节点列表
    每个用户均设置有一个账户，账户中记载了每个用户的BUS余额、信誉值数据，根据每个节点的信誉值筛选出包含有多个个高信誉值数据的诚信节点，这些节点共同标记为一个 诚信节点列表；
    诚信节点分为全节点和轻节点，互信节点包括两种类型：亲友型互信节点和高信誉互信节点，当两个诚信节点之间的社交互动频繁，在区块链底层将反映为交易次数频繁，则可认为这两个点具有深度的社交关系，即为亲友型互信节点或高信誉互信节点；
    (二)通过拜占庭容错过程验证交易
    互信节点用户之间可开启小微交易支付通道，进行离线高速交易，诚信节点通过拜占庭容错过程，验证网络中的新交易，验证成功的交易被系统记录到分布式账本之中，分布式账本是指一个记账系统的完整备份同时存储多个通过网络连接的计算设备上，各个设备之间通过某种一致性协议保证每个账本都能保持一致性和完整性，同时增加相应节点的信誉值；
    (三)系统通过信誉值动态筛选具有可信赖度的诚信节点；
    (四)诚信节点通过贡献算力，诚信节点的贡献来自于他们分享的运算和存储资源，系统的完整性因为诚信节点的贡献而得以保证，同时节点获得系统相应的信誉值的奖励，节点贡献算力的大小通过程序设定完成；
    (五)互为可信任节点之间的大额交易，以及非互相可信任节点之间的交易，由诚信节点验证，所有的交易，根据交易对手的不同进行分类，一般情况下，所有的交易都需要提交诚信节点进行验证，如果交易对手互为可信节点，则通过离线验证的方式提升他们之间的交易速度。
  3. 根据权利要求1所述的一种基于创新性的信誉证明共识协议的分布式网络及生态系统，其特征在于，诚信节点列表中
    Figure PCTCN2019098108-appb-100001
    的节点，轮流参与验证共识，每一轮都会运行拜占庭容错协议来验证新生成的交易，如果
    Figure PCTCN2019098108-appb-100002
    中的所有节点，均达成一致，则交易获得确认；
    Figure PCTCN2019098108-appb-100003
    根据每个节点当前的
    Figure PCTCN2019098108-appb-100004
    值和一个分布函数
    Figure PCTCN2019098108-appb-100005
    来选择，对于节点x来说，他的R x越高，则越容易被记录到
    Figure PCTCN2019098108-appb-100006
    中；
    用
    Figure PCTCN2019098108-appb-100007
    表示一个节点被选入
    Figure PCTCN2019098108-appb-100008
    的概率，则有如下：
    Figure PCTCN2019098108-appb-100009
    选择方法：(1)根据所有节点的
    Figure PCTCN2019098108-appb-100010
    降序排序(2)根据
    Figure PCTCN2019098108-appb-100011
    在[0，N)生成m个随机数，然后向下取整；为了防止取重复，根据最近的和高信誉值的未选择节点，依照顺序从高信誉节点向低信誉节点选择；
    分布函数
    Figure PCTCN2019098108-appb-100012
    是一个指数型分布函数，相比较于三角分布，构造指数分布可以给高信誉的节点更高的机会，并且压制低信誉的节点。
  4. 根据权利要求1所述的一种基于创新性的信誉证明共识协议的分布式网络及生态系统， 其特征在于，拜占庭容错过程具体为，在获得一个诚信节点列表后，信誉证明通过一个拜占庭容错过程验证交易的正确性并更新账本，做出如下定义：
    非故障节点：系统中运行正常，遵守规则和无错误的节点；
    故障节点：出现错误的节点，包括超时、数据损坏和恶意行为即拜占庭错误；
    节点使用1或者0表示交易验证结果，0为验证成功，1为验证失败；所有的诚信节点会在有限时间内做出决策；所有的诚信节点会做出相同决策。
  5. 根据权利要求1所述的一种基于创新性的信誉证明共识协议的分布式网络及生态系统，其特征在于，信誉证明将共识分为若干个周期，每个周期有若干回合，每回合会处理若干交易数据，因此可定义
    Figure PCTCN2019098108-appb-100013
    为第k回合的诚信节点列表，达成共识流程为：
    上一回合结束；
    有若干未验证交易Tx0；
    本回合又有若干新交易生成Tx1；
    有Tx0和Tx1组合成待验证交易列表Tx；
    Tx会在
    Figure PCTCN2019098108-appb-100014
    中广播，
    Figure PCTCN2019098108-appb-100015
    中的节点会验证交易，若交易获得足够多的节点验证，则该交易会被更新到分布式账本中；
    Figure PCTCN2019098108-appb-100016
    的作恶节点小于m/3，则该回合定义为成功，
    Figure PCTCN2019098108-appb-100017
    中节点的贡献活跃度增加，相应节点的交易活跃度增加。
PCT/CN2019/098108 2018-11-26 2019-07-29 基于创新性的信誉证明共识协议的分布式网络及生态系统 WO2020107919A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811416359.1A CN109697606A (zh) 2018-09-30 2018-11-26 基于创新性的信誉证明共识协议的分布式网络及生态系统
CN201811416359.1 2018-11-26

Publications (1)

Publication Number Publication Date
WO2020107919A1 true WO2020107919A1 (zh) 2020-06-04

Family

ID=70859716

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/098108 WO2020107919A1 (zh) 2018-11-26 2019-07-29 基于创新性的信誉证明共识协议的分布式网络及生态系统

Country Status (2)

Country Link
CN (1) CN109697606A (zh)
WO (1) WO2020107919A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220092592A1 (en) * 2019-05-10 2022-03-24 nChain Holdings Limited Methods and Devices for Registering and Authenticating Miner Identity in a Blockchain Network
US11755562B2 (en) 2021-05-13 2023-09-12 International Business Machines Corporation Score based endorsement in a blockchain network

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109697606A (zh) * 2018-09-30 2019-04-30 贝克链区块链技术有限公司 基于创新性的信誉证明共识协议的分布式网络及生态系统
CN109598149B (zh) * 2018-11-20 2020-04-07 阿里巴巴集团控股有限公司 业务处理的方法和装置
CN110097467B (zh) * 2019-05-05 2021-04-13 华中科技大学 一种针对智能合约安全性和稳定性的侧链测试系统和方法
CN110149379B (zh) * 2019-05-06 2022-01-11 山东公链信息科技有限公司 一种基于层逻辑的多原链吞吐量扩展方法
CN110189128B (zh) * 2019-06-06 2021-05-14 西安安盟智能科技股份有限公司 一种用于区块快速生成的分布式共识的方法和装置
CN110517138A (zh) * 2019-08-20 2019-11-29 深圳市网心科技有限公司 智能合约处理方法、装置、计算机设备及存储介质
US11520904B2 (en) 2019-08-27 2022-12-06 Accenture Global Solutions Limited AI-based blockchain hybrid consensus
CN110598420B (zh) * 2019-09-17 2022-03-01 北京丁牛科技有限公司 一种跨文件智能合约可重入漏洞防御方法及装置
CN111080288B (zh) * 2019-10-18 2023-08-18 湖南天河国云科技有限公司 一种基于有向无环图的区块链共识达成方法及装置
CN110971663B (zh) * 2019-10-28 2021-03-12 北京大学 一种面向数据交易的可信处理方法与系统
CN111047329A (zh) * 2019-12-27 2020-04-21 浙江工商大学 一种基于区块链的产业链大数据共享与流通系统
CN111209341B (zh) * 2020-01-07 2023-03-14 北京众享比特科技有限公司 区块链的数据存储方法、装置、设备及介质
CN111222645B (zh) * 2020-01-14 2023-02-14 智慧谷(厦门)物联科技有限公司 基于物联网区块链量子算法人工智能的管理系统及方法
CN111432026B (zh) * 2020-04-14 2022-10-28 杭州复杂美科技有限公司 平行链交易执行方法、设备和存储介质
CN111539723A (zh) * 2020-04-14 2020-08-14 浙江浙燃能源有限公司 区块链交易记录方法、设备、区块链节点及计算机介质
CN111724145B (zh) * 2020-05-25 2022-09-30 天津大学 一种区块链系统分片协议的设计方法
CN111429122A (zh) * 2020-06-11 2020-07-17 卓尔智联(武汉)研究院有限公司 基于dag区块链的数据验证方法、装置和计算机设备
CN112073382B (zh) * 2020-08-12 2021-06-18 北京大学 一种基于随机共识的图式账本节点维护方法和装置
CN112073222B (zh) * 2020-08-18 2021-11-12 西北工业大学 一种基于区块链跨链技术的空天地网络移动管理架构
CN113159333B (zh) * 2021-03-27 2022-10-11 北京邮电大学 一种基于分层分片区块链的联邦学习方法、系统及装置
CN113472870B (zh) * 2021-06-25 2022-04-19 南京航空航天大学 基于有向无环图的支持合约的分布式账本共识方法与系统
CN114629654B (zh) * 2022-03-09 2024-05-24 东北大学 一种面向信任管理机制的双链区块链及其共识方法
CN114900837B (zh) * 2022-04-06 2023-12-05 中国电信股份有限公司 网络处理方法、装置、系统、设备及介质
CN115694876A (zh) * 2022-08-26 2023-02-03 国网电动汽车服务有限公司 一种区块链电力交易系统、共识方法、设备和存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108122165A (zh) * 2017-12-15 2018-06-05 北京中电普华信息技术有限公司 一种区块链共识方法及系统
CN108596586A (zh) * 2017-12-01 2018-09-28 中国联合网络通信集团有限公司 区块链运行方法及记账权节点
CN109697606A (zh) * 2018-09-30 2019-04-30 贝克链区块链技术有限公司 基于创新性的信誉证明共识协议的分布式网络及生态系统

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014193708A1 (en) * 2013-05-25 2014-12-04 North Carolina State University Large-scale, time-sensitive secure distributed control systems and methods
JP6827327B2 (ja) * 2017-01-05 2021-02-10 株式会社日立製作所 分散コンピューティングシステム
CN108492103B (zh) * 2018-02-07 2021-04-27 北京大学深圳研究生院 一种联盟区块链共识方法
CN112767158A (zh) * 2018-02-27 2021-05-07 创新先进技术有限公司 基于区块链的交易执行方法及装置、电子设备
CN109872161B (zh) * 2019-03-01 2021-05-04 山东大学 一种加速iota子链交易验证过程的芯片及系统
US11379462B2 (en) * 2019-04-05 2022-07-05 Comcast Cable Communications, Llc Systems and methods for a reputation-based consensus protocol
CN110097458A (zh) * 2019-04-11 2019-08-06 贝克链区块链技术有限公司 一种基于区块链技术的量化信誉体系

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108596586A (zh) * 2017-12-01 2018-09-28 中国联合网络通信集团有限公司 区块链运行方法及记账权节点
CN108122165A (zh) * 2017-12-15 2018-06-05 北京中电普华信息技术有限公司 一种区块链共识方法及系统
CN109697606A (zh) * 2018-09-30 2019-04-30 贝克链区块链技术有限公司 基于创新性的信誉证明共识协议的分布式网络及生态系统

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
ANONYMOUS: "Evil behavior is an ecological cancer. How does Baker chain strerilize?", 27 July 2018 (2018-07-27), pages 1 - 4, XP055711096, Retrieved from the Internet <URL:https://mp.weixin.qq.com/s/hkxHNnxKo9tznLRHIXCvbg> *
BCOO CHAIN: "Bitconc Chain BCOO, Tokyo Debuting Proof of Reputation (POR) Consensus", MP.WEIXIN.QQ.COM, 10 July 2018 (2018-07-10), pages 1 - 16, XP009521411 *
JIAN PEI: "Database systems for advanced applications 23rd International Conference, DASFAA 2018", part 2 12 May 2018, SPRINGER BERLIN HEIDELBERG, Berlin Germany, ISBN: 978-3-642-36741-0, ISSN: 10.1007/978-3-319-91458-9_41, article FANGYU GAI ET AL: "Proof of Reputation: A Reputation-Based Consensus Protocol for Peer-to-Peer Network", pages: 666 - 681, XP047545742 *
LEEK BEAR : "Evil behavior is an ecological tumor. How does Baker Chain sterilize?", MP.WEIXIN.QQ.COM/, 10 July 2018 (2018-07-10), XP009521410, Retrieved from the Internet <URL:https://mp.weixin.qq.com/s/hkxHNnxKo9tznLRHIXCvbg> *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220092592A1 (en) * 2019-05-10 2022-03-24 nChain Holdings Limited Methods and Devices for Registering and Authenticating Miner Identity in a Blockchain Network
US11755562B2 (en) 2021-05-13 2023-09-12 International Business Machines Corporation Score based endorsement in a blockchain network

Also Published As

Publication number Publication date
CN109697606A (zh) 2019-04-30

Similar Documents

Publication Publication Date Title
WO2020107919A1 (zh) 基于创新性的信誉证明共识协议的分布式网络及生态系统
Ghosh et al. Security of Cryptocurrencies in blockchain technology: State-of-art, challenges and future prospects
Kolb et al. Core concepts, challenges, and future directions in blockchain: A centralized tutorial
US11651219B2 (en) Architectures, systems and methods for program defined transaction system and decentralized cryptocurrency systems
Bacon et al. Blockchain demystified: a technical and legal introduction to distributed and centralized ledgers
Wang et al. Challenges of blockchain in new generation energy systems and future outlooks
Chatterjee et al. Quantitative analysis of smart contracts
Buterin A next-generation smart contract and decentralized application platform
KR102162762B1 (ko) 아이템 추적 기법
Yadav Blockchain security
Wang et al. Bft in blockchains: From protocols to use cases
Zhang et al. Deconstructing Blockchains: Concepts, Systems, and Insights.
Ko et al. Survey on blockchain‐based non‐fungible tokens: History, technologies, standards, and open challenges
Tabatabaei et al. Understanding blockchain: Definitions, architecture, design, and system comparison
Yu et al. Technology and security analysis of cryptocurrency based on blockchain
Bashir et al. Advanced Blockchain Development: Build highly secure, decentralized applications and conduct secure transactions
KR102151731B1 (ko) 아이템 셀프 처리를 허용하기 위한 기법
Ning et al. On the exploitation of blockchain for distributed file storage
KR20200108763A (ko) 탈중앙 게임 운영 방법
Lin et al. Refiner: a reliable and efficient incentive-driven federated learning system powered by blockchain
KR102169840B1 (ko) 확률형 아이템 판매의 신뢰를 보증하는 방법
JP6896813B2 (ja) トランザクション実行方法およびシステム
CN113298574A (zh) 基于区块链的积分管理方法、装置及存储介质
Antal et al. Distributed Ledger Technology Review and Decentralized Applications Development Guidelines. Future Internet 2021, 13, 62
Attia et al. Securing federated learning with blockchain: A systematic literature review

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: 19888817

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 31/08/2021)

122 Ep: pct application non-entry in european phase

Ref document number: 19888817

Country of ref document: EP

Kind code of ref document: A1