让区块链连接起来的是什么,让区块链连接起来的是version

让区块链连接起来的是version拓展，其中包括了三个关键词：共识算法、网络安全和去中心化。

共识算法是指区块链网络中的一组算法，它们使区块链网络中的节点可以相互协作，以确保区块链的安全性和可靠性。共识算法的目的是确保区块链网络中的所有节点都能够达成一致，以确保交易的正确性。最常见的共识算法是工作量证明（Proof of Work）和权益证明（Proof of Stake）。

网络安全也是区块链连接起来的重要因素。网络安全是指确保网络系统的安全性，以保护其中存储的数据和信息免受未经授权的访问或改动。区块链技术的安全性得益于其分布式设计，可以有效防止黑客进入网络，以破坏或改变网络中的数据。

去中心化是指没有单一权威控制的网络，它是区块链技术的基础。去中心化的网络结构提供了一种可以自动执行交易的机制，而不需要任何中央机构或者第三方来监督或者管理。由于没有单一权威控制，去中心化的网络更加安全，因为黑客无法攻击整个网络而只能攻击单个节点。

总之，version拓展的三个关键词：共识算法、网络安全和去中心化，是让区块链连接起来的关键因素。它们的目的是保障区块链网络的安全性和可靠性，以便于实现可靠的分布式交易。

A. When was the blockchain technology born?

The idea of ​​blockchain technology can be traced back to 1991. In order to ensure that the timestamp file cannot be traced and tampered with, two scientists at the time, Stuart Haber and W. Scott Stornetta, launched a practical computing solution.
The system uses a block encryption chain to store timestamp files, and in 1992, Merkle trees were also incorporated into the system, a new technology that grouped multiple documents into one block. , greatly improving efficiency. Unfortunately, no one cared about this technology and it was slowly abandoned. The patent also expired in 2004, four years before Bitcoin was born.

B. Let you quickly understand the technical model architecture of blockchain in 1 minute

Blockchain technology is not a single technology, but the integration and innovation of multiple technologies The result is essentially a weakly centered, self-reliant underlying architecture technology.
The blockchain technical model includes the data information layer, the consensus layer of the transmission layer, the incentive layer, the contract layer and the network layer from top to bottom. Each layer has an important role, and different levels cooperate with each other to build a value transfer system that goes to the management center.

The characteristics of the data information layer are that it cannot be forged, fully backed up data, and completely fair (data information, management permissions, encoding), and its algorithm design is a blockchain, including blockchain headers and blocks material. The blockchain header consists of three sets of blockchain databases. One set of databases is the parent blockchain hash value, which is used to connect the block to the previous block in the blockchain. The second set of databases is the Merkle root. An algorithm designed to effectively summarize all transactions in the blockchain; the three sets of databases are the difficulty target, time format and Nonce related to the production of the blockchain.

The transport layer encapsulates technologies such as P2P network mechanism, dissemination and authentication mechanism. In the transport layer, new transactions are broadcast to major websites. Each node will include the received transaction information in a blockchain, and each node will try to add it to its own blockchain. Find a proof of workload with sufficient difficulty. When a node finds a proof of workload (qualified to package the blockchain), it broadcasts the program (newly packaged blockchain) to major websites. When And only if all transactions included in the block are valid and have not existed before, other nodes will recognize the validity of the block, and the way to express acceptance is to follow the block. At the end of the block, a new block is created to add to the chain, and any hash of the accepted block is treated as any hash of the new block.

The consensus layer encapsulates various consensus mechanism optimization algorithms of nodes. It is the key technology of the blockchain, because it determines the performance of the blockchain.As a result, the accounting decision method may affect the security and stability of the entire system. At present, more than ten consensus mechanism algorithms have been produced, among which the well-known ones are the proof-of-work mechanism (POW), the easy-to-use Byzantine fault tolerance algorithm (PBFT), the proof-of-interest mechanism (POS), and the equity authorization proof mechanism.

The encouragement layer includes an offering system and an incentive system. Simply put, the incentive system is to encourage nodes to participate in maintaining the optimal operation of the blockchain system in a balanced economic manner, to avoid falsification of the general ledger, and to maintain the driving force for the operation of the blockchain network in the long term.

The contract layer has the characteristics of a programmable controller, which mainly includes smart contracts, consensus algorithms, scripting, and coding. It is the basis for the characteristics of a blockchain programmable controller. Insert the code into the blockchain or dynamic password to implement a customizable smart contract, and under certain specific constraints, it can be executed automatically without going through a third party, which is trustworthy in the blockchain. Basic.
The network layer encapsulates various application fields and examples of blockchain, which is very similar to computer applications and portals on computer browsers. It deploys blockchain core technologies on things such as Ethereum. , EOS and implemented in practice.

#BTC[超话]# #digital currency#

C. Merkle Tree-Merkle Trees

Merkle Tree is a Binary trees can quickly check and summarize large amounts of data and can be used to verify the integrity of transaction records in blocks.

The Merkle tree is an important data structure of the blockchain. Its function is to quickly summarize and verify the existence and integrity of the block data. In a general sense, it is a way of hashing large amounts of aggregated data "chunks" that relies on splitting these data "chunks" into smaller units of data, each bucket containing only a few data "chunks" , and then take each bucket unit data block and hash it again, repeating the same process until the total number of remaining hashes becomes only 1.

In this number, each transaction can be deleted individually. You only need to save the hash value of the transaction. In this way, the memory of each block can be greatly reduced and more latest transactions can be stored. Therefore, in the UTXO model, using the Merkle tree structure, there is no need to worry about excessive data growth.

Usage scenarios:
1. The block header maintains the Merkel tree of the transaction;
2. The transaction verification of SPV wallet communication stores the tree.

Welcome to leave a message for discussion. Please point out any errors, thank you!

[To contact me (QQ: 3500229193) or join the community, please click here! 】

D. What is a Merkle tree?

First of all, it is not a plum tree. Although the name is somewhat similar, this tree is not that tree. The Merkle tree is one of the three giants in the block header. We must know that the block is the basic structural unit of the blockchain. It consists of a block header containing metadata and a block body containing transaction data. And our plum tree is a major member of the block header.

Maybe you are curious, what is the block header? Is it a mutated header? In fact, it is very simple. As the name suggests, the block header is the front part of a block, which is equivalent to the head of the human body and controls key parts of the human body. The block header consists of three sets of metadata, one is the hash value of the parent area; the other is the mining difficulty, Nonce, timestamp; the third is the Merkel tree root, which is our protagonist today. Don’t underestimate this tree, it It can quickly summarize and verify all the transaction data in the block. Isn’t it super excellent~

The blockchain uses the data structure of the Merkel tree to store the values ​​of all leaf nodes and generates them based on this. A unified hash value. The leaf nodes of the Merkle tree store the hash value of the data information, and the non-leaf nodes store the hash value obtained by hashing the combination of all leaf nodes below it.

There is another point that needs to be paid attention to, just like we pay attention to our college entrance examination results, that is, any change in the data in the block will cause the Merkle tree structure to change. In the verification and comparison of transaction information, In the process, the Merkle tree structure can greatly reduce the amount of data calculation. After all, we only need to verify the unified hash value generated by the Merkle tree structure.

See a world in a grain of sand, a paradise in a wild flower, put infinity in the palm of your hand, and collect eternity in a moment. Blake’s words could not be more appropriate to explain the Merkel tree.

E. What is the origin between blockchain and artificial intelligence

Jinwowo Network Technology believes that the block formation process in the blockchain is as follows:
1- Record: Record the transaction information in the local memory into the block body
2-Generate: Generate the Merkle tree of all transaction information in this block in the block body, and save the value of the Merkle tree root in the block In the block header
3-Fill in the parent hash value: Use the SHA256 algorithm to generate a hash value from the block header data of the previous block just generated and fill it in the parent hash value of the current block
4-Time preservation: Save the current time in the timestamp field
5-Difficulty coefficient: The difficulty value field will be adjusted according to the average generation time of blocks in the previous period to cope with the changing overall calculation of the entire network Total amount, if calculatedIf the total calculation amount increases, the system will increase the difficulty value of the math questions so that the expected time to complete the next block is still within a certain period of time.

F. What is a Merkle tree

Merkle trees are the basic component of the blockchain. Although in theory it is certainly possible to have a blockchain without a Merkle tree, by simply creating a huge block header that directly contains each transaction, doing so would undoubtedly bring risks. Scalability challenges mean that in the long run, only the most powerful computers will be able to run these trustless blockchains. It is precisely because of Merkle trees that Ethereum nodes can be built and run on all computers, laptops, smartphones, and even those IoT devices produced by Slock.it. So, how exactly do Merkle trees work, and what value can they provide, now and in the future?
First, let’s talk about some basic knowledge. Merkle tree, in a general sense, is a way of hashing large amounts of aggregated data "chunks", which relies on splitting these data "chunks" into smaller units (buckets) of data, each A bucket block contains only a few data "chunks", and then each bucket unit data block is hashed again, and the same process is repeated until the total number of remaining hashes becomes only 1: the root hash.