区块链的完全信任机制是什么,区块链的完全信任机制包括
请查看相关英文文档
『一』What is the main way to ensure the security of blockchain?
Blockchain technology is a distributed recording technology that encrypts and distributes data. storage to ensure data security and reliability.
The security of the blockchain is mainly ensured through the following methods:
1. Encryption technology: The blockchain uses symmetric encryption and asymmetric encryption algorithms, which can effectively protect the security of data.
2. Distributed storage: Blockchain data is not stored centrally on a single node, but is stored dispersedly on various nodes in the network, which effectively prevents data tampering and loss.
3. Consensus mechanism: Blockchain usually uses a consensus mechanism to confirm the legitimacy of transactions, which helps prevent malicious transactions from occurring.
4. Contract mechanism: Blockchain can automatically execute transactions through smart contracts, which helps prevent manipulation of transactions.
Blockchain technology also brings some challenges while achieving security. For example, the security of the blockchain can be attacked by vulnerabilities, or assets can be stolen because private keys are leaked. Therefore, when using blockchain technology, you also need to pay attention to issues such as identity authentication and password security to ensure the security of the blockchain.
In addition, the security of blockchain technology may also be affected by policies, regulations, etc. For example, in some countries and regions, blockchain technology may be subject to censorship and restrictions, which may also have an impact on the security of the blockchain.
In general, the security of blockchain technology is mainly guaranteed through encryption technology, distributed storage, consensus mechanism and contract mechanism, but other challenges and influencing factors need to be paid attention to.
『二』Four consensus mechanisms of blockchain
The consensus mechanism of blockchain can be divided into the following four categories: Proof of Stake mechanism, Proof of Work mechanism, Pool verification and Pool share authorization certification mechanism.
Blockchain is a chain composed of blocks one after another. Each block stores a certain amount of information, and they are connected into a chain in the order in which they were generated. This chain is saved in all servers. As long as one server in the entire system can work, the entire blockchain is safe. These servers are called nodes in the blockchain system, and they provide storage space and computing power support for the entire blockchain system.
『三』 Consensus mechanism of blockchain
1. The goal of blockchain consensus mechanism
What is blockchain? Simply put, blockchain is a decentralized database, or it can be called a distributed ledger. Traditionally, all databases are centralized. For example, a bank's ledger is stored in the bank's central server. The disadvantage of a centralized database is that the security and accuracy of the data depend entirely on the database operator (i.e., the bank), because anyone with access to the centralized database (such as bank employees or hackers) can destroy or modify the data in it..
Blockchain technology allows databases to be stored on thousands of computers around the world, and everyone’s ledgers are synchronized through a peer-to-peer network. Once a user adds a transaction, the transaction information will be notified to other users through the network for verification and recorded in their respective ledgers. Blockchain gets its name because it is a data structure composed of blocks containing transaction information linked in an orderly manner from back to front.
Many people’s question about blockchain is that if each user has an independent ledger, does it mean that they can add to their own ledger? Arbitrary transaction information, and how can thousands of ledgers ensure the consistency of accounting? Solving the problem of accounting consistency is the goal of the blockchain consensus mechanism. The blockchain consensus mechanism aims to ensure that the data in all nodes in the distributed system are exactly the same and can reach agreement on a certain proposal (for example, a transaction record). However, due to the introduction of multiple nodes in a distributed system, various very complex situations will occur in the system; as the number of nodes increases, node failure or failure, network communication between nodes is interfered or even blocked, etc. In addition to common problems, solving various boundary conditions and unexpected situations in distributed systems also increases the difficulty of solving distributed consistency problems.
Blockchain can be divided into three types:
Public chain: full Anyone in the world can enter the system at any time to read data, send confirmed transactions, and compete for accounting in the blockchain. Public blockchains are generally considered "completely decentralized" because no one or institution can control or tamper with the reading and writing of data. Public chains generally encourage participants to compete for accounting through a token mechanism to ensure data security.
Alliance chain: Alliance chain refers to a blockchain in which several institutions jointly participate in management. Each institution runs one or more nodes, and the data in it only allows different institutions within the system to read, write and send transactions, and jointly record transaction data. This type of blockchain is considered “partially decentralized.”
Private chain: refers to a blockchain whose write permission is controlled by an organization or institution. Qualifications for participating nodes will be strictly restricted. Since participating nodes are limited and controllable, private chains can often have extremely fast transaction speeds, better privacy protection, lower transaction costs, and are not prone to malicious attacks. , and can meet the necessary requirements of the financial industry such as identity authentication. Compared with centralized databases, private chains can prevent single nodes within an organization from deliberately concealing or tampering with data. Even if an error occurs, the source can be quickly discovered, so many large financial institutions are currentlyMore inclined to use private chain technology.
2. Classification of blockchain consensus mechanisms
The difficulty of solving distributed consistency problems has given rise to several consensus mechanisms, each of which has its own advantages and disadvantages, and is also suitable for different environment and issues. The consensus mechanisms that are common knowledge include:
l PoW (Proof of Work) workload proof mechanism
l PoS (Proof of Stake) ) Equity/Equity Proof Mechanism
l DPoS (Delegated Proof of Stake) Share Authorization Proof Mechanism
l PBFT (Practical Byzantine Fault Tolerance) Practical Byzantine Fault Tolerance Algorithm
l DBFT (Delegated Byzantine Fault Tolerance) Authorized Byzantine Fault Tolerance Algorithm
l SCP (Stellar Consensus Protocol) Stellar Consensus Protocol
l RPCA (Ripple Protocol Consensus Algorithm) Ripple Consensus Algorithm
p>l Pool verification pool consensus mechanism
(1) PoW (Proof of Work) workload proof mechanism
< br />
1. Basic introduction
In this mechanism, every node on the network is using the SHA256 hash function (hash function) Calculate the hash value (hash sum) of a changing block header. Consensus requires that the calculated value must be equal to or less than a given value. In a distributed network, all participants need to continuously calculate the hash value using different random numbers until the goal is reached. When one node calculates an exact value, all other nodes must confirm with each other that the value is correct. Transactions in new blocks will then be verified to prevent fraud.
In Bitcoin, the above nodes that calculate hash values are called "miners", and the PoW process is called "mining". Mining is a time-consuming process, so incentives have been proposed (such as granting miners a small share of Bitcoin). The advantage of PoW is complete decentralization. Its disadvantage is the waste of resources caused by consuming a lot of computing power, the cycle of reaching consensus is also relatively long, and the consensus efficiency is low, so it is not very suitable for commercial use.
2. Application examples of cryptocurrency
Although the PoW mechanism has successfully proved its long-term stability and relative fairness, under the existing framework, the use of PoW's "mining" form will consume A lot of energy. The energy it consumes is just to continuously perform SHA256 calculations to ensure a fair workload, and has no other meaning of existence. The current transaction efficiency that BTC can achieve is about 5TPS (5 transactions/second). Ethereum is currently subject to the upper limit of the total amount of GAS in a single block, and the transaction frequency that can be achieved is about 25TPS, which is the same as the average thousand times per second and peak performance. There is a huge difference between VISA and MASTERCARD, which can achieve processing efficiency of 10,000 times per second.
3. Simple diagram understanding mode
(ps: The process of calculating the hash value of A, B, C, and D is "mining". In order to reward the time cost, the mechanism will use a certain number of Bitcoins as incentives.)
(Ps: In PoS mode, your "mining" income is proportional to the age of your currency (number of coins * number of days), and has nothing to do with the computing performance of the computer. We can think that the accumulation of any probabilistic events is proof of work, such as gold mining. Assuming that the gold content of ore is p% mass, when you get a certain amount of gold, we can think that you must have dug 1/p mass of ore. And The more gold you get, the more reliable this proof is.)
(2) PoS (Proof of Stake) equity/stake proof mechanism
< p>1. Basic introduction
PoS requires people to prove their ownership of the currency amount, and they believe that they have more currency people are less likely to attack the network. Selection based on account balance is highly unfair, as the single richest person is bound to dominate the network, so many solutions have been proposed.
In the proof-of-stake mechanism, whenever a block is created, miners need to create a transaction called "coin rights", which will pre-issue some coins to the miners in a certain proportion. Then the equity proof mechanism reduces the mining difficulty of nodes in equal proportions based on the proportion and time of tokens held by each node (coin age) according to the algorithm, so as to speed up the node's search for random numbers and shorten the time required to reach consensus.
Compared with PoW, PoS can save more energy and be more efficient. But since the mining cost is close to 0, it may be vulnerable to attacks. And PoS still essentially requires nodes in the network to perform mining operations, so it is also difficult to apply in the commercial field.
2. Application examples of digital currency
The more mature digital currencies under the PoS mechanism are Peercoin and NXT. Compared with PoW, the PoS mechanism saves energy and introduces the concept of "coin days" to participate in random operations. The PoS mechanism allows more currency holders to participate in the accounting work without the need to purchase additional equipment (mining machines, graphics cards, etc.). The computing power of each unit token is positively related to the length of time it is held. That is, the more tokens a holder holds and the longer the time, the greater the probability that the holder can sign and produce the next block. Once it signs the next block, the currency days held by the currency holder will be cleared and a new cycle will be re-entered.
PoS is suitable for public chains.
3. How to generate block signers
Under the PoS mechanism, Because the signers of blocks are randomly generated, some currency holders will hold tokens for a long time and in large amounts to obtain a greater probability of generating blocks, and to clear as many of their "coin days" as possible. Therefore, the number of circulating tokens in the entire network will decrease, which is not conducive to the circulation of tokens on the chain, and prices will be more susceptible to fluctuations. Since there may be a small number of large investors holding most of the tokens in the entire network, the entire network may become more and more centralized as the running time increases. Compared with PoW, the cost of doing evil under the PoS mechanism is very low, so for forking or double-spending attacks, more mechanisms are needed to ensure consensus. Under stable conditions, approximately 12 transactions can be generated per second, but due to network delays and consensus issues, it takes about 60 seconds to fully broadcast the consensus block. In the long run, the speed of generating blocks (i.e. clearing "coin days") is much lower than the speed of network propagation and broadcasting. Therefore, under the PoS mechanism, it is necessary to "limit the speed" of generated blocks to ensure the stability of the main network. transportOK.
4. Simple diagram understanding mode
(PS: The more “shares” you own, the easier it is for you to obtain account rights. It refers to how much currency you get, which depends on the workload you contribute to mining and the performance of your computer. The better, the more mines will be allocated to you.)
(In a pure POS system, such as NXT, there is no mining process, and the initial equity The distribution has been fixed, and then only the equity is transferred among traders, very similar to stocks in the real world.)
(3) DPoS (Delegated Proof of Stake) ) Share authorization certification mechanism
1. Basic introduction
Due to various disadvantages of PoS , thus the DPoS (Delegated Proof of Stake), the first equity representation mechanism pioneered by BitShares, came into being. The core element of the DPoS mechanism is election. Holders of each system's native tokens can participate in elections in the blockchain, and the balance of the tokens they hold is the voting weight. Through voting, shareholders can elect board members and express their attitudes on issues related to the development direction of the platform, all of which form the basis of community autonomy. In addition to voting in elections themselves, shareholders can also vote on their behalf by authorizing their election votes to other accounts they trust.
Specifically, DPoS was invented by the Bitshares project team. Stakeholders elect their representatives to generate and verify blocks. DPoS is similar to a modern corporate board of directors system. The BitShares system refers to token holders as shareholders, and shareholders vote to elect 101 representatives. These representatives are then responsible for generating and verifying blocks. If a currency holder wants to be called a representative, he must first use his public key to register on the blockchain and obtain a unique 32-bit identity identifier. Shareholders can vote on this identifier in the form of transactions and get votes. The top 101 people were selected as representatives.
Representatives take turns to generate blocks, and the profits (transaction fees) are equally divided. The advantage of DPoS is that it greatly reduces the number of nodes participating in block verification and accounting, thereby shortening the time required for consensus verification and greatly improving transaction efficiency. From a certain perspective, DPoS can be understood as a polycentric system, which has the advantages of both decentralization and centralization. Advantages: It greatly reduces the number of nodes participating in verification and accounting, and can achieve second-level consensus verification. lackPoints: Voting enthusiasm is not high, and most token holders did not participate in voting; in addition, the entire consensus mechanism still relies on tokens, and many commercial applications do not require the existence of tokens.
The DPoS mechanism requires that before generating the next block, it must be verified that the previous block has been signed by a trusted node. Compared with PoS's "National Mining", DPoS uses a system similar to the "Congress" to directly select trusted nodes, and these trusted nodes (i.e. witnesses) exercise power on behalf of other currency holders. Witnesses Nodes are required to be online for a long time, thus solving a series of problems such as delays in block production that may be caused by PoS block signers not always being online. The DPoS mechanism can usually reach a transaction speed of 10,000 times per second, and can reach the level of 100,000 seconds when the network delay is low, which is very suitable for enterprise-level applications. Because Gongxinbao Data Exchange has high requirements for data transaction frequency and long-term stability, DPoS is a very good choice.
2. Institutions and systems under the share authorization certification mechanism
The board of directors is the authority of the blockchain network. The candidates for the board of directors are elected by system shareholders (i.e. currency holders). Board members have the right to initiate motions and vote on motions.
One of the important responsibilities of the Board of Directors is to adjust the variable parameters of the system as needed. These parameters include:
l Fee related: rates for various transaction types.
l Authorization related: parameters related to charges and subsidies for third-party platforms that access the network.
l Block production related: block production interval, block reward.
l Identity review related: review and verify the information of abnormal institutional accounts.
l At the same time, matters related to the interests of the Board of Directors will not be set by the Board of Directors.
In the Finchain system, witnesses are responsible for collecting various transactions broadcast when the network is running and packaging them into blocks. Their work is similar to that of the Bitcoin network In the Bitcoin network that adopts PoW (Proof of Work), a lottery method in which the probability of winning depends on the hash power determines which miner node generates the next block. In a financial chain network that adopts the DPoS mechanism, the number of witnesses is determined by voting by the board of directors, and the candidates for the witnesses are determined by voting by currency holders. The selected active witnesses package transactions and produce blocks in order. After each round of block production, the witnesses will randomly shuffle the cards to determine the new order before entering the next round.Block production.
3. Application examples of DPoS
Bitshares uses DPoS. DPoS is mainly suitable for alliance chains.
4. Simple diagram understanding mode
(4) PBFT (Practical Byzantine Fault Tolerance) Practical Byzantine Fault Tolerance Algorithm
1. Basic introduction
PBFT is an algorithm based on strict mathematical proof, which requires three stages of information interaction and local consensus to achieve the final unanimous output. The three stages are pre-prepare, prepare, and commit. The PBFT algorithm proves that as long as there are more than 2/3 normal nodes in the system, it can ensure that a consistent consensus result can be output in the end. In other words, in a system using the PBFT algorithm, it can tolerate no more than 1/3 of the total number of nodes in the system (including nodes that intentionally mislead, intentionally damage the system, time out, repeatedly send messages, forge signatures, etc., also known as " Byzantium" node).
2. Application examples of PBFT
The famous alliance chain Hyperledger Fabric v0.6 uses PBFT, and v1.0 launched an improved version of PBFT, SBFT. PBFT is mainly suitable for private chains and consortium chains.
3. Simple diagram understanding mode
The above figure shows a simplified PBFT protocol communication model, where C is the client, 0 – 3 represents the service node, where 0 is the master node and 3 is the fault node . The basic process of the entire protocol is as follows:
(1) The client sends a request to activate the service operation of the master node;
(2) When the master node receives the request, it starts the three-phase protocol toEach slave node broadcasts a request;
(a) In the sequence number allocation stage, the master node assigns a sequence number n to the request, broadcasts the sequence number allocation message and the client's request message m, and constructs a pre-prepare message to each slave Node;
(b) In the interaction phase, receive pre-prepare messages from nodes and broadcast prepare messages to other service nodes;
(c) In the sequence number confirmation phase, each node will After verifying the request and sequence, broadcast the commit message, execute the received client request and respond to the client.
(3) The client waits for responses from different nodes. If m+1 responses are the same, the response is the result of the operation;
p>
(5) DBFT (Delegated Byzantine Fault Tolerance) authorized Byzantine fault tolerance algorithm
1. Basic introduction
DBFT is based on PBFT. In this mechanism, there are two types of participants, one is the "super node" who specializes in accounting , one is an ordinary user who does not participate in accounting in the system. Ordinary users vote for super nodes based on the proportion of their equity holdings. When a consensus (accounting) needs to be passed, a spokesperson is randomly selected among these super nodes to formulate a plan, and then other super nodes use Byzantine fault tolerance to algorithm (see above), that is, the principle of majority submission. If more than 2/3 of the super nodes agree with the speaker plan, a consensus is reached. This proposal becomes the final published block, and the block is irreversible, and all transactions in it are 100% confirmed. If a consensus proposal has not been reached within a certain period of time, or if illegal transactions are discovered, other super nodes can reinitiate the proposal and repeat the voting process until a consensus is reached.
2. Application examples of DBFT
NEO, a domestic cryptocurrency and blockchain platform, is the developer and adopter of the DBFT algorithm.
3. Simple diagram understanding mode
Assume that there are only four super nodes in the system voted by ordinary users. When a consensus needs to be passed, the system will randomly select one of the representatives to speak. HumanoidMake a plan. The spokesperson will hand over the prepared plan to each representative. Each representative will first determine whether the speaker's calculation results are consistent with their own records, and then discuss with other representatives to verify whether the calculation results are correct. If 2/3 of the representatives unanimously agree that the calculation results of the speaker's plan are correct, then the plan is passed.
If less than 2/3 of the representatives reach a consensus, a new speaker will be randomly selected and the above process will be repeated. This system is designed to protect the system from leaders who are unable to function.
The above figure assumes that all nodes are honest and reach 100% consensus, and plan A (block) will be verified.
Given that the spokesperson is a randomly selected representative, he may be dishonest or malfunctioning . The above figure assumes that the spokesperson sends malicious messages to 2 of the 3 representatives (scenario B), and at the same time sends a correct message to 1 representative (scenario A).
In this case, the malicious information (Option B) cannot pass. The calculation results of the representatives in the middle and on the right were inconsistent with those sent by the spokesperson, so they could not verify the plan drawn up by the spokesperson, causing the two people to reject the plan. The representative on the left received correct information that was consistent with his own calculation results, so he was able to confirm the plan and successfully completed a verification. However, this plan still failed to pass because less than 2/3 of the representatives reached a consensus. A new spokesperson will then be randomly selected and the consensus process will begin again.
The above picture assumes that the speaker is honest, but One of the representatives experienced an anomaly; the representative on the right sent incorrect information to the other representatives (B).
In this case, the correct information (A) formulated by the speaker can still be verified, because both the honest representatives on the left and the middle can verify that the correct information (A) formulated by the spokesperson The plan drawn up by the spokesperson reached a 2/3 consensus. The representative can also determine whether the speaker is lying to the node on the right or the node on the right is being dishonest.
(6) SCP (Stellar Consensus Protocol) Stellar Consensus Protocol
1. Basic introduction
SCP is the development and use of Stellar (a decentralized global payment protocol based on the Internet)Consensus algorithm based on Federated Byzantine Agreement. Although traditional non-federated Byzantine protocols (such as PBFT and DBFT above) ensure that consensus can be reached through distributed methods and achieve Byzantine fault tolerance (can tolerate at most failed nodes that do not exceed 1/3 of the total number of nodes in the system), it is a Centralized system - The number and identity of nodes in the network must be known and verified in advance. The difference of the Federated Byzantine Agreement is that it can be decentralized and Byzantine fault-tolerant at the same time.
[…]
(7) RPCA (Ripple Protocol Consensus Algorithm) Ripple Consensus algorithm
1. Basic introduction
RPCA is Ripple (an Internet-based Open source payment protocol, which can realize decentralized currency exchange, payment and settlement functions) consensus algorithm developed and used. In Ripple's network, transactions are initiated by the client (application) and broadcast to the entire network through the tracking node or validating node. The main function of the tracking node is to distribute transaction information and respond to client ledger requests. In addition to all the functions of the tracking node, the verification node can also add new ledger instance data to the ledger through the consensus protocol.
Ripple's consensus occurs between verification nodes. Each verification node is pre-configured with a list of trusted nodes, called UNL (Unique Node). List). Nodes on the list can vote on the transaction. The consensus process is as follows:
(1) Each verification node will continuously receive transactions sent from the network. After verification with the local ledger data, they are illegal. The transactions will be discarded directly, and the legal transactions will be summarized into a transaction candidate set (candidate set). The transaction candidate set also includes transactions left over from the previous consensus process that could not be confirmed.
(2) Each verification node sends its own transaction candidate set as a proposal to other verification nodes.
(3) After the verification node receives a proposal from other nodes, if it is not from a node on UNL, it will ignore the proposal; if it is from a node on UNL, it will compare it with the proposal. Transaction and local transaction candidate set, if there is the same transaction, the transaction is obtainedOne ticket. Within a certain period of time, when a transaction receives more than 50% of the votes, the transaction enters the next round. Transactions that do not exceed 50% will be left for the next consensus process to be confirmed.
(4) The verification node sends transactions with more than 50% of the votes as proposals to other nodes, and at the same time increases the threshold of the required votes to 60%, repeating steps (3) and (4) until the threshold Reach 80%.
(5) The verification node formally writes the transactions confirmed by 80% UNL nodes into the local ledger data, which is called the last closed ledger, which is the last (latest) status of the ledger.
In Ripple's consensus algorithm, the identities of participating voting nodes are known in advance. Therefore, the algorithm is more efficient than anonymous consensus algorithms such as PoW. Transactions The confirmation time only takes a few seconds. This also determines that the consensus algorithm is only suitable for alliance chains or private chains. The Byzantine Fault Tolerance (BFT) capability of the Ripple consensus algorithm is (n-1)/5, which means it can tolerate Byzantine errors in 20% of the nodes in the entire network without affecting the correct consensus.
2. Simple diagram understanding mode
Schematic diagram of node interaction in the consensus process:
Consensus algorithm process:
< br />
(8) POOL verification pool consensus mechanism
Pool verification pool The consensus mechanism is a mechanism developed based on traditional distributed consensus algorithms (Paxos and Raft). The Paxos algorithm is a consensus algorithm based on message passing and highly fault-tolerant proposed in 1990. In the past, Paxos has been the standard for distributed protocols, but Paxos is difficult to understand and even more difficult to implement. Raft is a consensus algorithm released in 2013 that is simpler than Paxos and can realize the problems solved by Paxos. The process of reaching consensus in Paxos and Raft is like an election. Candidates need to convince the majority of voters (servers) to vote for them and follow their actions once selected. The difference between Paxos and Raft lies in the specific process of election. The Pool verification pool consensus mechanism is based on these two mature distributed consensus algorithms, supplemented by a data verification mechanism.
『四』 Since blockchain technology has a trust mechanism, where can How can it be applied?
Jinwowo analyzed that the application of blockchain technology can start from the following aspects:
① Places with weak trust relationships, no trust relationships, and multiple trust relationships;
②Where large-scale consensus is required, that is, multi-party collaboration, which requires distributed ledgers to establish large-scale consensus;
③Where medium and low-frequency transactions are required, because the current technical stage does not support large-scale high-frequency concurrency;
>④ Fields that can form a win-win mechanism, because in this way everyone has the motivation to use;
⑤ Markets with network effects, the larger the scale (the more people use them), the higher the benefits, including social networking and Didi Chuxing .
『五』What is blockchain and how to introduce blockchain in a simple and easy-to-understand manner
Many people don’t know what blockchain is. Here I will give you a detailed introduction. Blockchain is a new technology that subverts the old model. Just like people tend to ignore the invisible but indispensable oxygen, people often ignore the most important thing in the market economy, which is trust. Without trust, no transaction can be established.
In addition, different races, nationalities, cultures, religious beliefs, etc. will form a trust gap. Due to the lack of mutual understanding and necessary trust between strangers, transactions are difficult to occur. The market economy emerged in large numbers among strangers. The emergence and development of the market economy lies in the birth of a new mechanism, which solves the problem of trust between strangers.
The concept of blockchain was first proposed in a paper written by Bitcoin founder Satoshi Nakamoto in 2008. Blockchain can be understood as a kind of public accounting. Technical solution: All data will be open and transparent, without the need for a central server as a trust intermediary, thus ensuring the authenticity, immutability and credibility of information on a technical level. The immutability of data is very important.
Because the blockchain has the technical characteristics of large-scale expansion, open and transparent data, and because the data of each client is consistent, even if some clients are destroyed, it will not affect the reliability of data security. In particular, it can effectively solve the problem of trust between strangers, so this technology can be extended to all fields that can be digitized, such as digital currency, payment settlement, digital bills, proof of rights, credit information, government services, medical records, etc. If blockchain technology develops, it will be closely related to everyone in the future.
『Lu』 The trust of the blockchain is based on the consensus of a large number of participants. What kind of trust mechanism is it?
It is not a consensus mechanism, but a distributed accounting , recorded currency transaction records, these records are said to not change, a distributed accounting method written with technology
『撒』Why do banks love blockchain so much
Banks Many problems need to be solved in the competition for blockchain
As a traditionalTraditional financial institutions, banks are the most active pathfinders in the blockchain field. In recent years, many domestic and foreign banks have applied blockchain technology to credit, clearing and other fields. The unique trust mechanism of blockchain is regarded by banks as a key technological breakthrough for innovative risk management and simplified transaction processes. However, as an emerging technology, the blockchain ecosystem is still in the process of being established, its applications are very limited, and many problems still need to be gradually solved during development.
“At present, the blockchain cannot run high-frequency and concurrent transactions, and the network speed and computing power cannot support it. For example, in the payment field, if it is online shopping, it can still be achieved; if It’s high-frequency trading in futures, so it can’t be done,” Huang Zhen said.
Jiang Peng said that at the beginning of designing the blockchain system, CITIC Bank carefully demonstrated the business links suitable for using blockchain.
“From global experience, it is not suitable to use blockchain to build large and complex systems. Don’t try to use blockchain to solve all problems, but focus on solving core problems. Do too much Complex systems are time-consuming, and technology develops so fast that before the old system is completed, it will face iterations of new technologies," Jiang Peng said.
The idea of "only solving core problems" ensures that after the blockchain is launched, the relevant business operations of CITIC Bank branches can achieve business upgrades without process modification.
Fan Bin admitted that it will take time for banks to fully apply blockchain. IBM’s investment in the blockchain open source community will continue, on the one hand, to cultivate the market, and on the other hand, to compete for blocks. The commanding heights of the chain platform. With the rapid iteration of blockchain technology itself, there is still a lot of room for imagination in the scenarios in which financial institutions can use this new technology.
Content comes from Xinhuanet
