首页 资讯正文

区块链入门教程

资讯 2024-06-28 阅读:55 评论:0
美化布局示例
欧意最新版本

欧易(OKX)最新版本

【遇到注册下载问题请加文章最下面的客服微信】永久享受返佣20%手续费！

APP下载   全球官网 大陆官网
欧意最新版本

币安(Binance)最新版本

币安交易所app【遇到注册下载问题请加文章最下面的客服微信】永久享受返佣20%手续费！

APP下载   官网地址
欧意最新版本

火币HTX最新版本

火币老牌交易所【遇到注册下载问题请加文章最下面的客服微信】永久享受返佣20%手续费！

APP下载   官网地址

GongchuangSu 说：

GongchuangSu says:

哈哈 沙发 期待下一篇关于比特币的介绍

Ha, ha, sofa. Looking forward to the next presentation on Bitcoin.

2017年12月26日 21:04 | # | 引用

December 26, 2017 21:04

zhiyang 说：

zhiyang says

比特币的中心思想好像就是这个，去中心化，每进行一笔交易，周围所有的节点都会知道这笔交易

The central idea of Bitcoin seems to be this. Decentralize. Every deal, every node around it will know about it.

2017年12月26日 21:26 | # | 引用

26 December 2017 21:26

逆寒 说：

says:

那辛辛苦苦挖出来的区块后面接着的未能达到6个，而是采用了另一条长的，是不是意味着白挖了。。

The block, which was so painstakingly dug, was not followed by six, but by another long one, which meant that it had been dug for nothing.

2017年12月26日 21:50 | # | 引用

December 26, 2017 < 21:50

EricJin 说：

EricJin said:

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。

For example, the Hash of the 123 string is a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0 (hexadecimal), the binary is 256 and only 123 can get this Hash.

而且只有123能得到这个 Hash。

And only 123 can get this Hash.

这句话是错的。很多字符串都能得到这个hash，但是他们之间差异很大。

That's wrong. A lot of strings can get this whash, but there's a lot of difference between them.

2017年12月26日 21:58 | # | 引用

26 December 2017 21:58

朴素 说：

said:

真正潜心搞区块链技术研究的没多少，都去炒币了。几乎零投入今年赚了十几万。可想而知币圈暴富了多少人吧。

There's not a lot of real block-link technology research going on. Almost zero investment this year has made more than a hundred thousand dollars. Let's see how rich the money circle is.

2017年12月27日 08:50 | # | 引用

08:50 Quoted > ;

Ryan 说：

says:

确实目前来说使用区域链非常有限

It's true that the use of regional chains is very limited at the moment.

2017年12月27日 10:01 | # | 引用

10:01 December 2017

zyg 说：

zyg says

期待下篇

Looking forward to the next one.

2017年12月27日 10:56 | # | 引用

10:56

dudulang1998 说：

dudulang1998 said

言简意赅，把复杂的道理说到本质而通俗，抽象总结能力大赞~

It's simple. It's so simple. It's so simple.

2017年12月27日 11:25 | # | 引用

27 December 2017 11:25

一地风飞 说：

says:

还有不少疑问，希望懂的人给解释一下：

There's still a lot of questions. Those who want to know explain it to me:

1.

区块头里有两个hash，一个是指向上一块的hash(应该是上一区块体的hash?)，这个应该是已确定的。

There are two hash in the block, one of which refers to the hash up in the block (should it be the hash of the previous block?), which should be determined.

另一个是即将要加入的区块自身的hash，这个hash从本身的内容计算得出（采矿）

The other is the area that is about to be added to its own hash, which is calculated from its own content.

既然“同一内容，hash出来的值”是一样的，那就意味着，区域在加入链之前，内容是不确定的？

Since the “same content, the shash value” is the same, does that mean that the content is uncertain before the region joins the chain?

不知道这样理解对不对： 区块先生成必要的数据（比如 A转帐给B多少），然后加上会变化的"随机数"，来算hash,算出来满足后，就加到链上。如果是这样，这个“随机数”一般是什么？

I don't know if that's correct: Mr. Block makes the necessary data (e.g. how much A transfers to B) and then adds "random numbers" that can change to calculate the hash and then adds them to the chain when it's satisfied. If so, what is this "random numbers" usually?

2. 区块的数据格式有约定吗

Do you have an agreed data format for blocks

2017年12月27日 12:12 | # | 引用

12:12 December 2017

frank-young 说：

frank-youung says

阮老师怎么看矿工在这个生态里的作用

Mr. Nguyen, what do you think of the role of the miners in this ecology?

2017年12月27日 12:14 | # | 引用

December 27, 2017 12:14

biykb 说：

biykb says

区块包含上一个区块的哈希(即上一个区块的哈希)，本区块的哈希。这样理解正确吗？

Blocks include Hashi of the previous block, and Hashi of this block. Is that correct?

2017年12月27日 17:18 | # | 引用

17:18 December 2017:

一地风飞 说：

says:

搜了一下网上的其它文章，加深了了解：

Searched other articles on the Internet to deepen understanding:

1.本区块的hash，是用区块头来计算，然后区块头会有一个随机数(nouce)来难度值来证明工作量

1. The hash of this block is calculated using the head of the block, and then the head of the block has a random number (nouce) to support the workload.

2.比特币的区块头里有个32字节的Merkle的Root hash来验证区块体里数据

There's a 32-bit Merkle root ash in Bitcoin's block to verify the data in the block

2017年12月27日 17:33 | # | 引用

17:33 December 2017:

Kalay 说：

Kalay says: 

引用EricJin的发言：

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。

For example, the Hash of the 123 string is a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0 (hexadecimal), the binary is 256 and only 123 can get this Hash.

而且只有123能得到这个 Hash。

And only 123 can get this Hash.

这句话是错的。很多字符串都能得到这个hash，但是他们之间差异很大。

That's wrong. A lot of strings can get this whash, but there's a lot of difference between them.

您说的"很多字符串都能得到这个hash，但是他们之间差异很大。"怎么理解,
是这个hash值被123占有之后, 所有字符串都能知道这个hash被占有了?还是123有了这个hash的同时,其他字符串比如234也能申请一个同样的hash?

You said, "Many strings can get this hash, but there's a lot of difference between them." How do you understand,
is that this hash is taken by 123, and all the strings know that this hash is occupied? Or, with 123 hash, other strings like 234 can apply for the same hash?

这两个问题后者应该是不对的吧, 如果是前者,这不正是作者表达的吗?还是有更深层次的意义我没有领悟到,小白,望解答.

These two questions must be wrong, if they are the former, isn't that what the authors say? Or is there something deeper that I don't understand, White?

2017年12月27日 17:51 | # | 引用

17:51 December 2017:

googya 说：

googya says

牵一发而动全身， 真的动了的话， 确实需要巨大的能量

It really takes a lot of energy to move your whole body.

2017年12月27日 18:13 | # | 引用

December 27, 2017 18:13

星辰 说：

says:

实际上，有无限多的字符串能得到同一个hash，但是，碰撞的概率相当低。
区块链的应用场景除了密码学货币，更重要的，还有以太坊的智能合约。

In fact, there are an infinite number of strings that can get the same hash, but the probability of collision is quite low. The application of the
block chain, in addition to cryptographic currency, is more important, as well as the Etherm intellectual contract.

2017年12月27日 22:00 | # | 引用

22:00 ;

jojoyoung 说：

jojoyouung says

最好懂的区块链教程

The best part of the block chain.

2017年12月27日 22:35 | # | 引用

22:35

kevinliu.lj 说：

kevinliu.lj says

在有限长度的字符串中，hash可以认为不会碰撞。

In a string of limited length, hash can be assumed not to collide.

要碰撞的字符串会长到现有的存储空间无法存放，所以暂时可以认为不会碰撞

Strings to collide will grow to an existing storage space that cannot be stored, so it can be assumed for the time being that there will be no collision

2017年12月27日 23:15 | # | 引用

23:15 December 2017 >

[email protected] 说：

said: 

引用顾唐散人的发言：

文中对hash值的描述有误，不同的字符串存在hash碰撞的可能性。

There is an erroneous description of the hash value in the text, and there is a potential for hash collision in different strings.

hash碰撞那是sha1和md5，sha256你碰一个给我试试

Hash crashes is sha1 and md5, sha256 and you touch one for me.

2017年12月28日 09:01 | # | 引用

09:01

wZi 说：

says

一张添加下一级速度很慢的链表

A chain table that adds a very slow speed to the next level.

2017年12月28日 10:05 | # | 引用

28 December 2017 10:05

songke.online 说：

songke.online says

nonce值不一定是HASH重算的次数啊，因为矿工不一定从1开始递增去碰nonce值。

The nonce value is not necessarily the number of times the HASH is recalculated, as miners do not necessarily increase from 1 to touch the nonce value.

2017年12月28日 10:34 | # | 引用

28 December 2017 10:34

Leo Liu 说：

Leo Liu says:

针对最后的总结部分。
老师说的主要是关于公有链的一些特点和需要。事实上现在区块链的商业应用上主要是同盟链与私有链。适应的场景与公有链区别非常大。

For the last part of the summary.
The teacher is talking about some of the characteristics and needs of the public chain. In fact, the commercial application of the block chain is now mainly the alliance chain and the private one. The adaptation scene is very different from the public chain.

2017年12月28日 10:43 | # | 引用

10:43 December 2017:

soul 说：

sooul says

有几个问题想问一下。
1.第四点中说到一个区块改变自己的内容后面的区块会丢失这个区块的指针，结合"六次确认"的理论，所以区块链的结构我理解很有可能是这样的：
a b c
| | |
1--2--3--4--5--6--7--8--9--10--。。。
| | |
d e g
对吗？
2.全文都没有怎么提区块的内容是什么，但还是很在意，看本文所引用图片好像是数据交换记录，也就是比特币交易记录，那么没有交易发生时内容存的是什么？

There are a few questions that I would like to ask.
1. The fourth point says that a block that changes its content will lose the pointer of the block, combined with the theory of six confirmations, so the structure of the block chain may well be as follows:
a b c
br/> br/> 1-2-3-4-5-6-7-8-10.
bd g
>.
the whole text does not mention the content of the block, but it is still interesting to see what the picture quoted here is a data exchange record, that is, a bitcoin transaction record, so what was stored when no transaction took place?

2017年12月28日 11:14 | # | 引用

December 28, 2017 11:14

章鱼哥 说：

says

可以看看这篇文章，精通比特币，很详细！
http://zhibimo.com/read/wang-miao/mastering-bitcoin/index.html

Read this article, excellent in Bitcoin, very detailed!

2017年12月28日 11:27 | # | 引用

28 December 2017 11:27

ixx 说：

ixx says 

引用Kalay的发言：

您说的"很多字符串都能得到这个hash，但是他们之间差异很大。"怎么理解,
是这个hash值被123占有之后, 所有字符串都能知道这个hash被占有了?还是123有了这个hash的同时,其他字符串比如234也能申请一个同样的hash?

You said, "Many strings can get this hash, but there's a lot of difference between them." How do you understand,
is that this hash is taken by 123, and all the strings know that this hash is occupied? Or, with 123 hash, other strings like 234 can apply for the same hash?

这两个问题后者应该是不对的吧, 如果是前者,这不正是作者表达的吗?还是有更深层次的意义我没有领悟到,小白,望解答.

These two questions must be wrong, if they are the former, isn't that what the authors say? Or is there something deeper that I don't understand, White?

hash是一种算法，根据你的输入计算出定长的输出，他说的意思是除了“123”能计算出“ a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0”，还有可能存在其它的字符串能计算得出“ a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0”的值，这叫"HASH碰撞"，具体是哪个值或者说有没有都是不确定的，只是一种理论上的可能存在

Hash is an algorithm that calculates the output of a fixed length based on your input, and he says it means that the value "a8fdc205a9f19c9f19c7507a60c4f01b13d11d7fd0" can be calculated in addition to the value "a8fdc205a9f19c9c7c7507c4f01b13d11d7fd0" which is known as "HASH Collision" and which value, or whether, is uncertain, is only a theoretical possibility of existence.

2017年12月28日 11:58 | # | 引用

28 December 2017 11:58

千帆万桅 说：

区块头中包含区块体的 Hash，如果一个区块的实际数据发生了改变，那么区块体的 Hash 就会发生改变，这一改变会导致当前区块的区块头发生改变，从而使得区块的 Hash 发生改变，当前区块的 Hash 发生改变又会引起下一个区块的区块头发生改变。如此一来，产生了骨牌效应。

Hash, which contains block sizes in the head of a block, changes in the physical data of a block will result in a change in the head of the block, which will result in a change in the head of the current block, and a change in the head of the next block, which will result in a change in the head of the next block.

修改一个区块时，如果不能同时修改后面所有的区块，就会导致当前区块与后面的区块失去连接。所以合适的做法就是不去修改区块。可是万一就有人非要去修改区块该怎么办呢？上面提到的这种联动机制看起来只会使得修改区块后果严重，并不能阻止修改区块的行为。

When you change a block, if you do not change all the later blocks at the same time, you lose the connection between the current block and the later block. So it's appropriate not to change the block. But what if someone doesn't have to do with the block? The connection mechanism mentioned above seems to only make the modification of the block serious and does not prevent the modification of the block.

2017年12月28日 18:00 | # | 引用

December 28, 2017 at 18:00

Jigsaw 说：

Jigsaw says

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。
'a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0'.length
40
40位16进制转换成2进制是160位吧
40位对应的是SHA1的算法

For example, the Hash of the string 123 is a8fdc205a9f19c9f19c7507c60c4f01b13d11fd7d0 (hexadecimal), the conversion to binary is 256 places, and only 123 have access to this.
>a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0'. Length
40
40
40-bit16 is 160 bits
> 40-bit the calculation of SHA1

2017年12月29日 09:39 | # | 引用

09:39

fadeer 说：

says:

感兴趣可以去听听这两集中文博客：

If you are interested, you can listen to these two blog posts:

82.聊聊比特币背后的技术和Blockchain
http://teahour.fm/2015/12/27/talk-with-jan-about-bitcoin-and-blockchain.html

82. Talk about the technology behind Bitcoin and Blockchain
http://teahour.fm/2015/12/27/talk-with-jan-about-bitcoin-and-blockchain.html

83.这次我们聊聊超酷的Ethereum
http://teahour.fm/2016/01/19/talk-with-jan-about-ehtereum.html

http://teahour.fm/16/01/19/talk-with-jan-about-ehtereum.html>

2017年12月31日 23:10 | # | 引用

December 31, 2017 23:10

你家卢哥哥 说：

虽然现在的趋势是公有链，但对于很多项目来说，其实私有链和联盟链更适合。所以个人拙见，并不能说区块链的应用场景只有加密货币，而且，去中心化和中心化可以互补的，这样应用场景就更广了

Although the trend is public, for many projects private and union chains are more appropriate. So it's not easy for individuals to say that the application of block chains is only encoded currency, and decentralized and centralized can complement each other, so that the application is broader.

2018年1月 1日 10:37 | # | 引用

10:37 January 2018: > >

aaron67 说：

aarron67 says

我自己整理了一部分区块链的好文和工具，分享给大家 https://bitcoincash.best/wiki
里面有区块链的基础知识 比特币的基础知识科普和误解 区块链现在的应用情况 分叉币的讨论
当然也有部分技术讨论
欢迎大家阅读 更欢迎大家的分享

I've sorted out some of the good pieces and tools of the block chain and shared them with you
with the basic knowledge of the block chain, the basic knowledge of Bitcoin and the misunderstandings, the current application of the block chain, and, of course, the discussion of split currency

2018年1月 1日 19:01 | # | 引用

1 January 2018: 19:01 /aa href=https://www.ruanyifeng.com/blog/2017> >19:01 > https://www.ruanyifeng.com/blog/2017/12/blockchain-tutoral.html#comment-text'title=" quotes aaron67's message "onclick="return commentQuote' (comment-quote-383924,'aaron67');

晓峰 说：

says 

引用nextzeus的发言：

传闻黑客攻击了比特币，很好奇是怎么做到的？

It's a rumor that hackers attacked Bitcoin. Wonder how?

你指的应该是攻击了比特币的交易所，就相当于抢银行吧。

You're talking about attacking the Bitcoin exchange, it's like robbing a bank.

2018年1月 2日 10:51 | # | 引用

2 January 2018 10:51

晓峰 说：

says

@soul：

区块内存的是比特币的交易记录。如果没有发生交易，区块内容可以为空。

Blocks contain transactions in bitcoin. If no transaction takes place, the block contents can be empty.

2018年1月 2日 10:55 | # | 引用

2 January 2018 10:55

吕浩 说：

said:

阮老师，您好，我是一名高中生，由于研究课需要，我在网上查到了贝叶斯算法，并且看到了您的日志。可能由于网的问题，您的日志中的部分图片加载不出，我想如果您有空的话，是否可以直接发给我一份？

Mr. Nguyen, I'm a high school student. I found the Bayesian algorithm online, and I saw your log. Perhaps, because of the Internet problem, some of the pictures in your logs can't be loaded. I wonder if you could just send me a copy if you're free.

2018年1月 2日 12:39 | # | 引用

2 January 2018 12:39

skip 说：

skip says:

有人做个了区块链的Demo https://anders.com/blockchain/ 形象直接

Demo

2018年1月 2日 17:59 | # | 引用

January 2, 2018 17:59

ghosts 说：

said:

我比较好奇的是，分支之后那个区块会被怎么操作？丢弃么？

What I'm curious about is how that block will operate after the branch?

2018年1月 3日 11:44 | # | 引用

11:44 January 2018 > > >

v5 说：

v5 says:

新的区块是如何同步的呢？如果同步的过程中是无法产生新的区块吗？

How does a new block synchronize? If a new block cannot be created during the synchronization process?

2018年1月 3日 17:26 | # | 引用

3 January 2018 17:26

July 说：

Juli says:

反对《熵：宇宙的终极规则》中的世界观。
热力学第二定律是一个观察的结果，是一个热力学适用的定律。
宇宙中太多太多违背人们逻辑的存在，没有任何定律能够完全在宇宙的尺度下经历了严格的考验。量子力学越来越被验证不过是时间短而已，一如当初的牛顿力学，电磁学。
更何况有 刘维尔极力反对，导致了庞加莱回归定理的诞生。
庞加莱回归：
孤立的、有限的保守动力学系统在有限的时间内回复到任意接近初始组态的组态。
如果宇宙是有限的离散动力系统，那就不是“任意接近”，而是完全回到初始状态了。
就是一切都是轮回。

The second law of thermodynamics is the result of an observation.
Too much of the universe contradicts people's logic.
There are so many laws in the universe that no strict test can be tested entirely at the scale of the universe.
The quantum mechanics are increasingly proving to be short in time, as in the case of the original Newton mechanics, electromagnetics.
Even more so is Liu Weir's strong opposition, which led to the birth of a return to the theory.
The return to the theory.
The isolated, limited system of conservative dynamics returns to the formation of an arbitrary approach to the initial configuration within a limited period of time.
If the universe is a limited dispersive system, it is not an “attended approach” but a complete return to its original state.
It is all the wheels.

还有这些研究都不适用于智慧生命。人类目前的研究连自行车为啥不倒都搞不明白，离弄清楚智慧差太多太多。

And these studies don't apply to intelligent life. Humans' current research doesn't understand why bicycles don't fall, it's too much to understand.

感谢作者的电子书《未来世界的幸存者》看的真过瘾。一口气读完。

Thanks to the author's e-book, Survivors of the Future World. Read it once and for all.

2018年1月 3日 18:54 | # | 引用

January 3, 2018 18:54

he 说：

he says:

而且可以保证，只要原始内容不同，对应的 Hash 一定是不同的。

And it can be assured that the corresponding Hash must be different as long as the original content is different.

这句话就不对，任何hash都不能保证，因为原始内容是无穷的，hash是有限的字符串。所以原始内容和hash必定是多对1的。

That is not true; there is no hash to guarantee, because the original content is infinite and the hash is a limited string. So the original content and the hash must be more than one pair.

2018年1月 4日 10:42 | # | 引用

10:42 January 2018 > ; > > > ;

okevin 说：

okevin says:

Hash 的有效性跟目标值密切相关，只有小于目标值的 Hash 才是有效的，否则 Hash 无效，必须重算。由于目标值非常小，Hash 小于该值的机会极其渺茫，可能计算10亿次，才算中一次。

Hash effectiveness is closely related to the target value. Only Hash, which is smaller than the target value, is valid. Otherwise, Hash is invalid and must be recalculated. Because the target value is very small, Hash’s chances of being less than the value are extremely slim, and may be calculated one billion times.

——————————前面不是说，Hash是唯一的吗？为什么会算出来那么多？

Wasn't it said earlier that Hash was the only one? Why is that so much?

2018年1月 4日 11:08 | # | 引用

11:08 January 2018 > > > https://www.ruanyifeng.com/blog/2017/12/blockchain-tutorial.html#comment-text'title = "Quoting the note from koevin"

gaozhe 说：

gaozhe says 

引用EricJin的发言：

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。

For example, the Hash of the 123 string is a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0 (hexadecimal), the binary is 256 and only 123 can get this Hash.

而且只有123能得到这个 Hash。

And only 123 can get this Hash.

这句话是错的。很多字符串都能得到这个hash，但是他们之间差异很大。

That's wrong. A lot of strings can get this whash, but there's a lot of difference between them.

是这样. 可以这么说: 123 的 hash 值肯定是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0, 如果数据的 hash 值不是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0,那它一定不是123. 这样就可以知道数据是否被修改.

As you can see: 123 hash must be a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0, if the hash is not a8fdc205a9f19cc17507a60c4f01b13d11d7fd0, it must not be 123.

2018年1月 4日 11:36 | # | 引用

11:36 > January 4, 2018 > >

问天玄铁 说：

says:

等到比特币将中本聪快要变成世界首富的时候，比尔盖茨控制windows系统在同一时间检测每台机有没有比特币区块，有的话就写入一个假账。其实一个全球都在用的软件就能够摧毁这个分布式账本。

By the time Bitcoin becomes the richest in the world, Bill Gates controls the Windows system at the same time to check if each machine has a bitcoin block, or if so, to write a false account. Indeed, a software that is used globally can destroy this distribution book.

2018年1月 4日 16:13 | # | 引用

4 January 2018 16:13 ;

Tidus 说：

Tidus says

顺便说一下，hash有很多种算法，作者举例的hash，其实是 hash 中的一种算法，叫做 sha1
在 linux 控制台运行 echo "123" | sha1sum
就可以得到 a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0

By the way, hash has a number of algorithms, and the author's example of hash is actually an algorithm in hash called sha1
running on the linux Console echo "123" sha1sum
gets a8fdc205a9f19cc1c7507a60f01b13d11d7fd0

但实际上，计算的是 "123 " 的值，因为echo 输出包含了换行符的。
单纯 "123" 的 sha1 值应该是
202CB962AC59075B964B07152D234B70

In practice, however, the calculation is " 123 ", because the echo output contains line breaks.
the simple "123" sha1 value should be
202CB962AC5975B9664B07152D234B70

我也是奇怪为啥会出现不一致去搜索了一下，才找到别人的这个解答

I'm also surprised why there's a discrepancy in the search to find someone else's answer.

2018年1月 9日 00:12 | # | 引用

9 January 2018 00:12 > ;

Tidus 说：

Tidus says 

引用千帆万桅的发言：

修改一个区块时，如果不能同时修改后面所有的区块，就会导致当前区块与后面的区块失去连接。所以合适的做法就是不去修改区块。可是万一就有人非要去修改区块该怎么办呢？上面提到的这种联动机制看起来只会使得修改区块后果严重，并不能阻止修改区块的行为。

When a block is modified, failure to modify all the later blocks at the same time can lead to the loss of connection between the current block and the latter block. So it is appropriate not to modify the block. What if someone has to do something about it? The connection mechanism mentioned above would only seem to make the modification of the block serious and would not prevent the modification of the block.

所以，比特币白皮书的方案，是从成本上避免这个的。

So the formula for the Bitcoin White Paper avoids this at cost.

1.他要去改某个时刻开始，到后面所有的区块，那么后面的区块越多，他要算的就越多。 这要求他有十分强大的算力。
大约是需要全比特币网中 51% 以上的算力。

He's going to start at some point and go to all the blocks in the back, and the more the blocks in the back, the more he's going to count.
is going to need more than 51% of the entire bitcoin network.

2.他要得到如此大的算力，需要付出很大的成本。 如果他改区块链账本得不到这么多收益，那么做这件事他得不偿失。

2. He would have to pay a great price for such a great deal of money, which he would have had if he had not earned so much in the chain of blocks.

3.就算他无论如何也要给作假，改出假账本，让自己活得巨量比特币。 但这件事本身会导致比特币的信任度降低，使比特币失去价值

3. Even if he were to fake and change the books so that he could live with a lot of bitcoin, this would itself lead to a loss of trust in bitcoin and a loss of value to bitcoin.

2018年1月 9日 00:29 | # | 引用

9 January 2018 00:29 ;

Tidus 说：

Tidus says 

引用问天玄铁的发言：

等到比特币将中本聪快要变成世界首富的时候，比尔盖茨控制windows系统在同一时间检测每台机有没有比特币区块，有的话就写入一个假账。其实一个全球都在用的软件就能够摧毁这个分布式账本。

By the time Bitcoin becomes the richest in the world, Bill Gates controls the Windows system at the same time to check if each machine has a bitcoin block, or if so, to write a false account. Indeed, a software that is used globally can destroy this distribution book.

做假账，也要计算的啊。而且因为主链是一条完整的，前后可以验证的。所以，没法去改很久之前的记录。这意味着，你要把全世界算几年的所有东西，瞬间全部算出来？

And because the main chain is complete and can be verified before and after. So you can't change the record for a long time. That means you're going to count the whole world for a few years, and you're going to do it all at once?

你去改最新的数据，给某个账户加钱，那么，钱从哪来？ 每个挖矿的都可以查所有账单记录，钱不可能凭空转给你。
你在不知道别人密钥的情况下， 也不能伪造 别人给你转钱的数据

Every miner can check all the bills and the money can't be transferred to you empty.
You can't falsify the data you've been transferred without knowing someone else's key.

2018年1月 9日 00:35 | # | 引用

9 January 2018 00:35

Tidus 说：

Tidus says 

引用jackcai的发言：

这个难度系统是系统设计时就已经集成了这个功能？会动态调整？ 还是说现在中本聪会监控干预调整？

Is this a difficult system that has been integrated into the system at the time of its design? Will it be dynamically adjusted, or will it now be monitored for intervention adjustments?

系统设计时就已经集成了这个功能。比特币现在基本全靠开始就设计好的思路在运行。 而现在出现比特币交易拥堵，确认越来越慢，这也是当初没有意料到的。 为了解决这问题，所以大家全体（矿工和核心代码维护者等）经过反复权衡和分裂，才分叉出比特币现金 BCH。

The system was designed with this feature. Bitcoin is now basically running with the idea that it was designed from the beginning. And now that there is a bitcoin trade congestion, confirming that it is getting slower, which was unexpected.

2018年1月 9日 00:40 | # | 引用

9 January 2018 00:40

sdfasdg 说：

sdfasdg says 

引用nextzeus的发言：

传闻黑客攻击了比特币，很好奇是怎么做到的？

It's a rumor that hackers attacked Bitcoin. Wonder how?

攻击比特币本身没做到，只是攻击比特币平台，就像一个保险箱里放着美金，黑客攻击的是保险箱，美金本身还安全，攻击成功也就是从保险箱的美金拿出来而已，目前还做不到印假钞

The attack on Bitcoin didn't happen. It was just an attack on the Bitcoin platform. It was like a safe deposit box with dollars in it. The hackers attacked the safe. The money itself was safe.

2018年1月10日 15:40 | # | 引用

15:40

fogin 说：

fogin says

我想知道中本聪是怎么做到动态调整难度系数的， 没有中心，他是怎么做到要求大家都遵守他动态调节难度系数这个规则的？

I want to know how Nakamoto made the dynamic adjustment difficulty factor, how did he expect everyone to adhere to the rule of his dynamic adjustment difficulty factor without the centre?

2018年1月10日 15:50 | # | 引用

15:50

张鹏 说：

@一地风飞：

@At the wind:

同样的疑惑， 相同的区块体，计算出来的hash值不是唯一的么？ 为什么可以重算很多次？

The same confusion, the same block, the calculated hash value is not the only one, why can it be recalculated many times?

另外一个问题， 每一笔交易，都独占一个区块么？

Another question, is there a single block in every deal?

2018年1月10日 17:16 | # | 引用

January 10, 2018 17:16

John 说：

John said:

@张鹏 有变量 就是 nonce 这个随机数 因为生成的 hash 要达到一定标准才被承认 所以要不断变化 nonce 去碰出一个符合要求的随机数 一个区块上的交易数大于等于一 具体多少由矿工决定 因为每笔交易是带交易费的 交易费根据交易发起人自己设定有多有少 矿工有权选择交易费多的 因此交易费多的更早被打包到区块链

@JanPong, there's a variable, and that's the random number that's recognized because the hash generated has to meet a certain standard, so it's going to have to change since it's going to hit a random number that meets the requirements, and the number of transactions on a block is greater than or equal to one, and it's up to the miners to decide how much, because each transaction is with a transaction fee, and the transaction fee is set by the sponsors themselves, so the miners have the right to choose the transaction fee, so the transaction fee is much higher than the transaction fee.

2018年1月11日 08:31 | # | 引用

11 January 2018 08:31 ; and

天空 说：

感谢博主的无私分享。文章写的非常好，我反复看了好几遍，以下是我的一些疑问向您请教一下：
1、区块的计算是持续的，无论网络上面是否有交易都会计算并产生新的区块。因此第一个区块内应该是没有包含任何交易信息的，第一枚比特币是生产第一个区块是奖励给矿工产生的？

Thanks to the owner's selfless sharing. The article is very well written. I've read it over and over again. Here are some of my questions:
1, the calculation of blocks is ongoing, whether or not there are any transactions on the network will calculate and create new blocks. So the first block is supposed to contain no information about the transaction, and the first bitcoin is a reward for the miners?

2、比特币网络中的节点指的是矿工，而不是在网络上交易比特币的普通用户？

2. Nodes in the Bitcoin network refer to miners rather than ordinary users trading bitcoin on the network?

3、需要消耗大量的算力才能产生一个新的区块，目的是为了保证比特币的安全，因此比特币区块链这个算力的设计即是它的优点也是它的硬伤？

3. Would it take a great deal of money to create a new block in order to ensure the safety of bitcoin, and therefore is it its virtue and its hardness to design therithmetic chain of bitcoin?

4、目前是每产生一个新的区块奖励12.5个比特币，当前市价100多万人民币，如果这个区块包含的所有交易总量只有1个比特币，那么这个奖励和这个交易本身相比是否太高了？这个交易费用和大量消耗的算力是否会成为制约比特币的致命问题？

4. Is this incentive too high as compared to the transaction itself, given that for every block that produces a new one, 12.5 bits of bitcoins, with a market value of more than RMB 1 million? Will this transaction cost and the power of a large consumption be a fatal problem in controlling bitcoins?

5、比特币算力日益集中，有没有可能几个矿场联合起来拥有超过51%的算力？

5. Is it possible for several mines to combine with more than 51 per cent of the increasingly concentrated Bitcoins?

2018年1月11日 23:27 | # | 引用

11 January 2018 23:27

bboxhe 说：

bboxhe says

这矿场配图不会是宝二爷吧。。。

This mine map won't be Master Po.

2018年1月13日 15:42 | # | 引用

13 January 2018 15:42

foxpsd 说：

foxpsd says

「这意味着，如果当前区块的内容变了，或者上一个区块的 Hash 变了，一定会引起当前区块的 Hash 改变。」
这句话怎么理解呢？上一个区块的hash为什么会变呢？不是写入区块链就固定了么？

"It means that if the content of the current block changes, or if the Hash of the previous block changes, it will cause the Hash of the current block to change."
How do you understand that? Why does the hash of the last block change?

2018年1月15日 14:49 | # | 引用

15 January 2018 14:49

DeanFeng 说：

DeanFeng says

我又一个问题，如果比较靠前的区块链发生了改变，后面的所有都要重新计算。
是不是交易记录写入后，就不会在改变了？新的交易记录只会在新的区块链被写入。
这也就是所谓历史发生了了就发生了，不能再被更改的意思。

Another question is, if the previous block chain changes, then everything else will be recalculated.
will not change when the record of the transaction is written. The new record of the transaction will only be written in the new chain of blocks.
That is what it means to say that history has happened and can't be changed.

2018年1月19日 09:54 | # | 引用

19 January 2018 09:54

老姚 说：

文中说“举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位”

It says, "The Hash of the 123 string, for example, is a8fdc205a9f19cc1c755007a60c4f01b13d11d7fd0 (hexadecimal), and the binary is 256."

这个hash才40位啊，转换为2进制后才160位。

This hash is only 40 places, and it's only 160 places since it's converted to a 2-digit system.

2018年1月19日 10:02 | # | 引用

10:02 January 2018

sedic 说：

sidec says

`a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0`换成2进制是160,明显是sha1算法算出来的
而且123的sha1值为`40bd001563085fc35165329ea1ff5c5ecbdbbeef`
根据上面留言的提示，`123 `的sha1值为a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0

`a8fdc205a9f19cc1755007a60c4f01b13d11d7fd0 `for a 2-edition system is 160, clearly
from the sha1 algorithm and `40bd001563085fc35165329ea1ff5c5ebbbbeef

这个留言是不对的，这个123的hash值并没有包括换行符在里面，是sha1本来就是160位的，等效为40位16进制数，而且以你自己的计算机算出来的123对应的sha1值，一定会跟文章中的一样，肯定是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0，因为是处于同一个有限的数值空间中

This message is incorrect. This 123 hash value does not include the line changer, which is 160 bits, the sha1 is an equivalent of 40 bits of 16-digit, and the corresponding sha1 value of 123, calculated from your own computer, must be a8fdc 205a9f19c9f1c7507a4f01b13d11d7fd0, because it is in the same limited numeric space.

2018年1月22日 22:15 | # | 引用

22:15 January 2018:

sedic 说：

sidec says

我觉得区块链的设计，还不是很完美，怎么说，就是感觉不是特别靠谱的那种。当然，也可能是我眼界窄
以这个为例
“现在的规则是，新节点总是采用最长的那条区块链。如果区块链有分叉，将看哪个分支在分叉点后面，先达到6个新区块（称为"六次确认"）。按照10分钟一个区块计算，一小时就可以确认”
林子大了，什么鸟都有，万一不止一个人同时达到6个呢，该取谁？继续？那又万一有两个人同时计算出12个，怎么办呢？
有点想不通，求解

I don't think the design of the block chain is perfect, but it doesn't feel special. Of course, it may be that I have a narrow eye
for example
. "The rule is that the new node always uses the longest block chain. If there's a fork in the block chain, we'll see which branch reaches six new blocks at the end of the fork.

时间的精度可以达到10E-18以上，这意味着基本不可能同时达到

The accuracy of time can be more than 10E-18, which means that it can hardly be achieved at the same time.

2018年1月22日 22:24 | # | 引用

22:24 January 2018:

sedic 说：

sidec says

@一地风飞：

@At the wind:

同样的疑惑， 相同的区块体，计算出来的hash值不是唯一的么？ 为什么可以重算很多次？

The same confusion, the same block, the calculated hash value is not the only one, why can it be recalculated many times?


注意hash值是基于区块头算出来的，而每个区块头里有一个独一无二的值，生成时间.....
所以每个区块的hash值肯定不一样


Note that the hash value is based on the head of a block, and each block has a unique value that generates the time...
so the hash value of each block must be different

2018年1月22日 22:28 | # | 引用

22:28 January 2018:

sedic 说：

sidec says

这个留言是不对的，这个123的hash值并没有包括换行符在里面，是sha1本来就是160位的，等效为40位16进制数，而且以你自己的计算机算出来的123对应的sha1值，一定会跟文章中的一样，肯定是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0，因为是处于同一个有限的数值空间中

This message is incorrect. This 123 hash value does not include the line changer, which is 160 bits, the sha1 is an equivalent of 40 bits of 16-digit, and the corresponding sha1 value of 123, calculated from your own computer, must be a8fdc 205a9f19c9f1c7507a4f01b13d11d7fd0, because it is in the same limited numeric space.

修正一下错误，echo的确默认会有换行符在里面，可以使用echo -n '123' | sha1sum得到123真正的hash值，40bd001563085fc35165329ea1ff5c5ecbdbbeef，跟之前几位讲的一样

By correcting the error, echo did agree that there would be a line break in it, and that you could get a real hash value of 123 using the echo-n '123' ssha1sum, 40bd 0015563085fc 35165329ea1ff5c5ecbdbbeef, as the others have said.

2018年1月22日 22:46 | # | 引用

22:46 January 2018

ghoulich 说：

says: 

引用fogin的发言：

我想知道中本聪是怎么做到动态调整难度系数的， 没有中心，他是怎么做到要求大家都遵守他动态调节难度系数这个规则的？

I want to know how Nakamoto made the dynamic adjustment difficulty factor, how did he expect everyone to adhere to the rule of his dynamic adjustment difficulty factor without the centre?

你的这个提问真是提到关键点上了，在去中心化的环境中，到底是哪个角色负责调整这个动态难度系数，这个问题竟然没有大牛回答，我也想知道。。。

Your question really refers to the key point, and I would also like to know which role, in a decentralized environment, is responsible for adjusting this dynamic difficulty factor, which has not been answered by the bull.

2018年1月23日 16:17 | # | 引用

23 January 2018 16:17

阿布 说：

says:

"而且可以保证，只要原始内容不同，对应的 Hash 一定是不同的。"

"and can be assured that the corresponding Hash must be different as long as the original content is different."

这句话会不会有问题? 哈希值相等,原内容可能不相等,可能出现哈希碰撞.

Is that a problem? Ha-ha-ha-ha-ha-ha-ha-ha-ha-ha-ha.

2018年1月26日 09:30 | # | 引用

> 09:30

tony 说：

said: 

引用why的发言：

分叉还是不大懂。

The fork still doesn't quite understand.

就是在限定的时间里分叉的两个链条哪个最长就用哪条

It's the longest of the two chains fork in a limited time.

2018年1月29日 14:52 | # | 引用

January 29, 2018 14:52

R4y 说：

R4y says 

引用一地风飞的发言：

还有不少疑问，希望懂的人给解释一下：

There's still a lot of questions. Those who want to know explain it to me:

1.

不知道这样理解对不对： 区块先生成必要的数据（比如 A转帐给B多少），然后加上会变化的"随机数"，来算hash,算出来满足后，就加到链上。如果是这样，这个“随机数”一般是什么？

I don't know if that's correct: Mr. Block makes the necessary data (e.g. how much A transfers to B) and then adds "random numbers" that can change to calculate the hash and then adds them to the chain when it's satisfied. If so, what is this "random numbers" usually?

2. 区块的数据格式有约定吗

2. Is there an agreement on the format of data for blocks?


以自己的理解一个个回答吧

Answer it one by one.

1. 一个chunk 的确有两个hash, 第一个是上个区块的hash , 第二个是经过挖矿计算得到的.

1. A chunk does have two hashs, the first one is the one from the last block, and the second one is calculated by mining.

那么挖矿 的过程, 实际上是把当前区块的内容(有上个hash), 和一个随机数一起, 进行hash.

So the process of mining is actually taking the content of the current block (with the last hash), together with a random number, to do the hash.

当然可以很轻松的得到一个值, 所以这里存在一个难度, 比如规定, 得到的hash 必须以000000(六个零开头)那么难度就会大大的增大(具体的要求和这个类似,所以存在难度系数).

Of course, it's easy to get a value, so there's a difficulty here, for example, that the hash that gets has to be 000 000 (six zeroes) will be much more difficult (specific requirements and this kind of thing, so there's a difficulty factor).

一旦这行hash满足了要求, 那么立马全网广播 mined!

Once this hash meets the requirements, then it's all over the Internet.

2是有固定格式的, 是json和十六进制数 https://webbtc.com , 用区块浏览器可以很轻松的看到

2 is in a fixed format with json and hexadecimal numbers , which is easily visible with block browsers.

2018年2月 2日 23:52 | # | 引用

23:52 February 2018 https://www.ruanyifeng.com/blog/2017/12/blockchain-turial.html#comment-385423 >

Jinyu LIU 说：

Jinyu LIU says

"区块链作为无人管理的分布式数据库，从2009年开始已经运行了8年，没有出现大的问题。"

"The block chain, as an unmanaged distributed database, has been in operation for eight years since 2009, without major problems."

这其实应该是“比特币”，而不是区块链。这是两回事。

It's actually a bitcoin, not a block chain. It's two things.

2018年2月 5日 20:34 | # | 引用

5 February 2018: 20:34

Jinyu LIU 说：

Jinyu LIU says

"区块链是一种特殊的分布式数据库 ... ... 主要作用是储存信息。任何需要保存的信息，都可以写入区块链，也可以从里面读取，所以它是数据库。"

"The block chain is a special distributed database... the primary function of which is to store information. Any information that needs to be saved can be written into the block chain or read from it, so it's a database."

这个表述我认为是有问题的，区块链不能称之为“数据库”，并不是可以存储数据就可以叫“数据库”的。

This expression, which I think is problematic, cannot be called a “database”, nor can data be stored to be called a “database”.

关于数据库的定义，在中文维基百科中如下定义，https://zh.wikipedia.org/wiki/%E6%95%B0%E6%8D%AE%E5%BA%93，“数据库 ... ...
用户可以对文件中的数据运行新增、截取、更新、删除等操作”。

For the definition of a database, in Chinese Wikipedia, https://zh.wikipedia.org/wiki/ %E6%95%B0%E6%E6%D%E%E5%BA%93, “Database...
Users can add, intercept, update, delete, etc. to the data in the file”.

在 webster 词典中定义如下，https://www.merriam-webster.com/dictionary/database，“数据库是一系列有组织的数据，特别用于快速查询和存取”。

The following is defined in the Webster dictionary: https://www.merriam-webster.com/dictionary/database, “Database is a set of organized data, especially for quick search and access”.

首先，区块链可以新增数据，但是不具备“更新”和“删除”功能。其次，区块链可以存储数据，但是不具备“快速查询和存取“的功能。第三，广义上的区块链是可以存储任意数据，但是目前区块链实际应用最广泛的两个应用，比特币和以太坊，一个只能记录一系列输入和输出的数字，一个只能记录 token，最多是以附言的方式记录简短的一段信息，并不具备数据存储的实用性。

First, the block chain can add new data, but it does not have the " update " and " delete " functions. Second, the block chain can store data, but it does not have the " fast search and access " function. Third, the block chain in the broad sense can store any data, but currently, the block chain actually uses two of the widest applications, Bitcoin and Etheria, one can record only a series of input and output figures, one can only record token, and at best a short piece of information is recorded in an adjunct format and does not have the practicality of data storage.

进一步的，考虑到区块链每个节点的都是存储了所有历史信息的这个特点，利用区块链来存储大量数据也是非常不切实际的。

Further, considering that each node of the block chain is a feature of which all historical information is stored, it is highly impractical to use the block chain to store large amounts of data.

2018年2月 5日 20:44 | # | 引用

February 5, 2018:44

Jinyu LIU 说：

Jinyu LIU says 

引用strickland的发言：

不是很多，准确的说应该是无数。

Not many, to be precise, should be numerous.

但是你在有生之年就是找不到

But you can't find it in your lifetime.

2018年2月 5日 20:50 | # | 引用

5 February 2018: 20:50 https://www.ruanyifeng.com/blog/2017/12/blockchain-turial.html#comment-385558 > > ; > >20:50 > > > > https://www.ruanyifeng.com/blog/2017/12/blockin-tutoral.html#comment-text'title = "Quoting this message from Jinyu LIU's "oncick="return commentQuote (`comment-quote-385558','Jinyu LIU') );

LeoLiao 说：

LeoLiao says: 

引用ghoulich的发言：

你的这个提问真是提到关键点上了，在去中心化的环境中，到底是哪个角色负责调整这个动态难度系数，这个问题竟然没有大牛回答，我也想知道。。。

Your question really refers to the key point, and I would also like to know which role, in a decentralized environment, is responsible for adjusting this dynamic difficulty factor, which has not been answered by the bull.

动态难度系数的调整就是代码里面的逻辑，因为所有节点运行的客户端程序都一样，所以没有那个角色负责调整难度系数。当然调整难度系数也是可以做到的，首先要通过比特币社区的提案，然后开发出新的版本就可以。

The adjustment of the dynamic difficulty factor is the logic of the code, because all nodes run the same client program, so no role is responsible for adjusting the difficulty factor. Of course, the adjustment of the difficulty factor is possible, first through the proposal of the Bitcoin community, and then by developing a new version.

2018年2月 8日 15:19 | # | 引用

8 February 2018: 15:19 > ; >

uuy 说：

says:

您好，我有一个疑问，如果有人恶意修改当前区块的内容，然后区块失效，这个区块丢失之后，会不会导致当前区块的内容丢失呢？这个内容已经备份到所有的区块里面了吗？

Hello, I have a question as to whether, if someone malignly changes the content of the current block and then the block lapses, the loss of the block will result in the loss of the content of the current block. Has it been backed up into all the blocks?

还有一个问题就是后面链接的所有区块都得修改，否则以后所有的区块都断掉了，这个区块里面的内容究竟是全量的，所有区块都相同的，还是只保存当前操作的

There's also the question of whether all the blocks on the back link have to be modified, or whether all the blocks have been cut off, whether the contents in this block are full, all of them are the same, or whether only the current operation is preserved.

2018年2月 8日 17:40 | # | 引用

February 8, 2018 at 17:40 );

ryt 说：

says:

没讲清楚为什么采矿时会不断算出来不同的hash，什么是变量。对已经确定的上一个block求hash 结果是唯一的。

It's not clear why there's always a difference in the hash when mining, what the variable is. The only result for the last Block is determined to be the haash.

2018年2月 9日 02:43 | # | 引用

9 February 2018 02:43 > ;

Simon 说：

said 

引用EricJin的发言：

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。

For example, the Hash of the 123 string is a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0 (hexadecimal), the binary is 256 and only 123 can get this Hash.

而且只有123能得到这个 Hash。

And only 123 can get this Hash.

这句话是错的。很多字符串都能得到这个hash，但是他们之间差异很大。

That's wrong. A lot of strings can get this whash, but there's a lot of difference between them.

--这个是hash碰撞对吗？

- This is a hash collision, isn't it?

2018年2月11日 15:25 | # | 引用

February 11, 2018 15:25

baiyi 说：

baiyi says

@一地风飞：

@At the wind:

随机数就是区块数据中的Nonce值

Random number is the Nonce value in block data

2018年2月13日 20:11 | # | 引用

20:11 February 2018:

回忆i 说：

recalls:

这个区块链让我看见了神经元的运作，怕是区块链可以加速人工智能的发展甚至直接衍生AI

This chain of blocks shows me how the neurons work, fearing that the chain of blocks can accelerate the development of artificial intelligence and even directly derive AI from it.

2018年2月17日 21:17 | # | 引用

February 17, 2018 21:17

nslam 说：

nslam says 

引用Nameless的发言：

你这个很多字符串说得真是张口就来。

You've got a lot of strings to say.

他说的还真没错，确实有很多字符串，或者说这个数字是无穷大。从任意位数到这个256位的有限映射，要说和“123”这个冲突的字符串，不是很多是什么呢？只是很难找到，差异很大罢了，这点他也提到了。

He's right, there's a lot of strings, or this number is infinite. From any number to this limited map of 256 digits, it's not much of a conflict with the "123" string. It's just hard to find, it's very different, as he mentioned.

2018年2月21日 15:19 | # | 引用

February 21, 2018 15:19

zqinfo 说：

zqinfo says

区块链怎么用？
用什么工具？

How does the block chain work?

2018年2月23日 23:33 | # | 引用

23:33 February 2018 ); and

qiwihui 说：

iwihui says:

我觉得这边博客对于区块链的理解很局限于比特币，而且有些混淆了区块链和比特币。其中关于区块链的应用的描述也很片面：

I think this blog's understanding of block chains is very limited to bitcoin, and there's some confusion between block chains and bitcoins. The description of the application of block chains is also one-sided:

目前，区块链最大的应用场景（可能也是唯一的应用场景），就是以比特币为代表的加密货币。

如果真是这样的话，那全世界这么多机构画力气研究和部署区块链真的是很令人费解。
所以我赞同一下的发言：

If that's the case, it's really hard to understand that so many institutions around the world are working hard to develop and deploy blocks.
So I would like to associate myself with this statement:

引用心心还爱你的发言：

大神的这篇文章还是有点儿失水准啊...........................

This article of the Great God is a little out of place.

2018年3月 4日 19:18 | # | 引用

4 March 2018: 19:18

郭鸿程 说：

says 

引用天空的发言：

感谢博主的无私分享。文章写的非常好，我反复看了好几遍，以下是我的一些疑问向您请教一下：

Thank the blogger for his selfless sharing. It's very good. I've read it several times. Here's some of my questions.

1、区块的计算是持续的，无论网络上面是否有交易都会计算并产生新的区块。因此第一个区块内应该是没有包含任何交易信息的，第一枚比特币是生产第一个区块是奖励给矿工产生的？

1. The calculation of blocks is ongoing. Whether or not there are any transactions on the network calculates and creates new blocks. So the first block should contain no information about the transaction, and the first bitcoin is the production of the first block to reward the miners?

2、比特币网络中的节点指的是矿工，而不是在网络上交易比特币的普通用户？

2. Nodes in the Bitcoin network refer to miners rather than ordinary users trading bitcoin on the network?

3、需要消耗大量的算力才能产生一个新的区块，目的是为了保证比特币的安全，因此比特币区块链这个算力的设计即是它的优点也是它的硬伤？

3. Would it take a great deal of money to create a new block in order to ensure the safety of bitcoin, and therefore is it its virtue and its hardness to design therithmetic chain of bitcoin?

4、目前是每产生一个新的区块奖励12.5个比特币，当前市价100多万人民币，如果这个区块包含的所有交易总量只有1个比特币，那么这个奖励和这个交易本身相比是否太高了？这个交易费用和大量消耗的算力是否会成为制约比特币的致命问题？

4. Is this incentive too high as compared to the transaction itself, given that for every block that produces a new one, 12.5 bits of bitcoins, with a market value of more than RMB 1 million? Will this transaction cost and the power of a large consumption be a fatal problem in controlling bitcoins?

5、比特币算力日益集中，有没有可能几个矿场联合起来拥有超过51%的算力？

5. Is it possible for several mines to combine with more than 51 per cent of the increasingly concentrated Bitcoins?

感谢老师这么辛苦的整理文档！

Thank you for your hard work!

不过如果仅仅用分布式看待区块链，个人觉得欠妥。我认为区块链仅仅是使用了分布式数据库。

But if you look at the block chain only in a distributed way, it doesn't feel right. I think the block chain is just using a distributed database.

所以结论部分，我觉得基本上是不太成立的，具体请参考超级账本的发展。

So, in the conclusion part, I think it's basically unsound, but please refer to the development of the superbook.

还有hash计算中的随机值和梅克尔树都是重点，这里没有提到，有时间的话，麻烦老师更新一下吧。然后长链替代短链的机制可以更加具体的说明，比如和难度值是不是有关系。是不是只要长度长就一定能成功替换短的？谢谢！

And the random values in the hash calculations and the Merkel trees are the focus, and it's not mentioned here that if you have time, please let the teacher update it. Then the mechanism of long chains to replace short chains can be more specific, for example, and whether the difficulty values are relevant. Is it always possible to replace short ones if they are long? Thank you!

我看到天空同学的发言，就想回答一下，有不对的地方，烦请老师指正：

I saw the sky students' statements, and I wanted to answer something wrong, and I asked the teacher to point out:

1、区块链支持无交易记录也能出块，此时交易记录只有默认的第一条，金额是系统发放的（目前是12.5，达到总量之后是0）+交易费（可能是0）的总和。如果此时有其他交易，交易记录就会变多，但是最多不能超过一个块的容量（1M，升级后的是2M，具体看客户端版本）。比特币所有金额总量是有限的，系统分批次奖励给前期的矿工，之后就停止了。所有的交易，金额只能是从一个账户转移到另一个账户，不能新增。

1. Block chains support the creation of blocks without a transaction record, when the transaction record is only the first by default, and the amount is the sum of the system's issuances (currently 12.5, followed by zero) + transaction fees (perhaps zero). If there are other transactions at this time, the transaction record becomes larger, but not more than the capacity of one block (1M, 2M after upgrade, depending on the client's end version). The total amount of all bitcoins is limited, and the system's batch reward is given to the miners in the previous period, and then stops. All transactions can only be transferred from one account to another and cannot be added.

2、网络节点可以是矿工，也可以是普通用户。可以是客户端，也可以是符合它规则的其他客户端或者恶意软件。只要符合规则（哪怕是带有恶意的）就能加入，这就是去中心化。

A network node can be a miner or a general user. It can be a client, or another client that meets its rules, or a malware.

3、没错。工作量证明机制，即是优点、也是硬伤。看你的需求。

Three, that's right. The workload proof mechanism is both good and hard. Look at your needs.

4、奖励是系统规则，每21000块减半。至于价值（人民币汇率），则是人定义的。汇率高-》有机会赚钱-》激励算力投入-》更加耗费能源；费率低-》可能亏本-》打击算力投入-》不太消耗能源。我倒是觉得是一种合理的情况，没啥问题啊。

4 Incentives are the rules of the system, reducing by half every 21,000. As for value (the renminbi exchange rate), it is defined as a person. High exchange rates – the opportunity to make money – stimulate arithmetic inputs – are more energy-consuming; low rates – the risk of a loss – the impact of arithmetic inputs – are less energy-consuming.

5、如果矿场联合起来攻击，那确实有可能。所以比特币在这种情况下，是不可靠的。问题是人家为什么要攻击自己？

5. It is possible if the mines come together to attack. So Bitcoin is unreliable in this case. The question is why does he attack himself?

2018年3月 5日 11:15 | # | 引用

5 March 2018 11.15 a href="https://www.ruanyifeng.com/blog/2017/12/blockchain-tutoral.html#comment-text"title= "onlick="retürn Comment Quote (`comment-quote-3886356', `Ko Hong'), citing

hooyes 说：

says

阮老师总是能找到当前技术热点，标题也起得到位，“区块链 教程” 百度排第一位。

Mr. Nguyen always finds the current technology hotspots, the title comes to the top, "The Block Chain Tutor" comes in first place.

2018年3月 5日 21:21 | # | 引用

5 March 2018: 21:21

西格玛 说：

says:

有个关于哈希的地方说的不太合适。
a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0理论上有无数个字符串的哈希值是它，只是我们找到这些串的难度极高而已。
说“其他字符串也有可能得到这个哈希，但是概率极低，可以近似认为不可能发生。”可能会让人误认为有可能这个哈希值不存在其他字符串对应。

One place about Hash is not very appropriate.
a8fdc205a9f19cc1c755007a60c4f01b13d11d7fd0 is the Hashi value, which theoretically has numerous strings, except that it is extremely difficult for us to find them.
says that “the other strings are also likely to get this Hashi, but the probability is very low, and it can be assumed that it is unlikely.

2018年3月 6日 13:48 | # | 引用

13:48 March 2018 > > > https://www.ruanyifeng.com/blog/2017/12/blockin-tutoral.html#comment-text'title = "Quette >, citing Sigma's "onclick ="return comment Quote' (comment-quote-386391), `Sigma');

陈帅k 说：

哇，太棒了吧，讲的十分好，点个赞！

Wow, that's great. That's great. That's great.

2018年3月 7日 11:33 | # | 引用

11:33 > > ;

gary 说：

gary says: 

引用qiwihui的发言：

我觉得这边博客对于区块链的理解很局限于比特币，而且有些混淆了区块链和比特币。其中关于区块链的应用的描述也很片面：

I think this blog's understanding of block chains is very limited to bitcoin, and there's some confusion between block chains and bitcoins. The description of the application of block chains is also one-sided:

片面吗？是全世界看起来都在想法构建区块链，可是有一个落地的应用吗？博主说目前只有比特币一个应用没有错啊。

One-sided? The whole world seems to be thinking of building blocks, but is there a landing application? The blogger says there's only one bitcoin application at the moment.

2018年3月 8日 12:00 | # | 引用

8 March 2018 12 noon citing

乌拉拉 说：

says

真的是一篇很赞的科普文章！但是在区块头的结构图部分有点问题，区块头只包括上一区块的哈希值，并不包括该区块自身的哈希值

It's a really nice Cope article! But there's something wrong with the structure of the block, which includes only the Hashi value of the previous block, and not the Hashi value of the block itself.

2018年3月 9日 10:51 | # | 引用

9 March 2018 10:51

世外 说：

says: 

引用EricJin的发言：

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。

For example, the Hash of the 123 string is a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0 (hexadecimal), the binary is 256 and only 123 can get this Hash.

而且只有123能得到这个 Hash。

And only 123 can get this Hash.

这句话是错的。很多字符串都能得到这个hash，但是他们之间差异很大。

That's wrong. A lot of strings can get this whash, but there's a lot of difference between them.

举个例子，随便列出几个你说的很多字符串得到的相同hash

For example, just a few of your many strings get the same hash

2018年3月13日 10:27 | # | 引用

13 March 2018 10:27

dreamcatcher-cx 说：

dreamcatcher-cx says 

引用顾唐散人的发言：

文中对hash值的描述有误，不同的字符串存在hash碰撞的可能性。

There is an erroneous description of the hash value in the text, and there is a potential for hash collision in different strings.

作者不是说了么，其他字符串也有可能得到这个哈希，只是概率极小而已

Didn't the author say that there's a chance that other strings might get this one, just a very low probability.

2018年3月15日 10:12 | # | 引用

15 March 2018 10:12

chenjw 说：

chenjw says 

引用EricJin的发言：

举例来说，字符串123的 Hash 是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个 Hash。

For example, the Hash of the 123 string is a8fdc205a9f19c7c7507a60c4f01b13d11d7fd0 (hexadecimal), the binary is 256 and only 123 can get this Hash.

而且只有123能得到这个 Hash。

And only 123 can get this Hash.

这句话是错的。很多字符串都能得到这个hash，但是他们之间差异很大。

That's wrong. A lot of strings can get this whash, but there's a lot of difference between them.

赞同，比如如果我们的原始内容有超过2的256次方种，那么必然有哈希一样的。只能说2个原始数据的哈希一样的概率很低。

We agree, for example, that if we have more than 256 squares of original content, there's gotta be the same as Hashi. We can only say that two original data have the same low probability.

2018年3月22日 16:03 | # | 引用

16:03

Aida 说：

says:

建议楼主可以做一下评论分页，

It is suggested that the owner of the building could make a comment break.

2018年3月26日 13:06 | # | 引用

March 26, 2018 13, 2018:06 a href="https://www.ruanyifeng.com/blog/2017/12/blockchain-tutoral.html#comment-text"title= quotes Aida's "onclick="return CommentQuote (`comment-quote-3887106', 'Aida');

lemontee 说：

lemontee says

@John Shen：

就算hash值一样，生成的区块加入到链中（加上一条的header）也是唯一的吧，毕竟没有谁一次性可以插入两条一模一样的数据到链里。

Even if the ash is the same, it's the only thing that can be added to the chain (with one header), after all, no one can insert two identical data into the chain at once.

2018年3月29日 15:39 | # | 引用

March 29, 2018 15:39

浪桭 说：

says:

请问各位看官，谁看了这篇博文后入门了？

Excuse me, ladies and gentlemen, who's reading this post?

2018年4月 2日 15:32 | # | 引用

2 April 2018: 15:32

Mr.Panda 说：

Mr. Panda said:

前面部分还行~后面就看不懂了。。。

The front part's fine. I don't get it.

我的智商。。。

My IQ.

2018年4月 4日 00:00 | # | 引用

April 4th, 2018 <00

佩奇 说：

says:

多个中心相当于没有中心

Multiple centers are equivalent to no centers.

2018年4月 4日 07:04 | # | 引用

April 4, 2018 07:04

Eric 说：

says:

Hash冲突的问题怎么解决？

How do we resolve the Hash conflict?

2018年4月 4日 14:52 | # | 引用

14:52 April 2018:

tester 说：

tester says:

我能说 123 的 SHA256 是 a665a45920422f9d417e4867efdc4fb8a04a1f3fff1fa07e998e86f7f7a27ae3，而不是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0吗...

Can I say that SHA256 is a665a459222f9d417e4867efdc4fb8a04a1f3fff1fa07e998e86f7f7a27ae3 instead of a8fdc205a9f19cc1c7507a60f01b13d11d7fd0...

2018年4月 6日 17:23 | # | 引用

April 6, 2018 17:23

梦元 说：

says

有没有大佬解答下我的疑问：

Do you have any answers to my question?

先总结下：区块分为区块头（header）和区块体(body)。header包含当前区块hash和上一区块hash还有时间戳等信息；body包含账单内容。推论一：Hash=SHA256( 区块头 )，就是说当前区块的hash是根据当前的header当然还有随机Nonce生成的，跟body没有关系。

To sum up: blocks are divided into blocks (header) and blocks (body). Header contains information about the current block (hash) and the previous block (hash) and time stamp; body (body) contains bill contents. Inference number one: Hash=SHA256 (block head), which means that the current block (hash) is generated by the current header and, of course, random Nonce, has nothing to do with body.

那么假设一个旷工算出了符合规则的hash值，然后他开始记账，如果它此时改变了区块体body的账本内容（比如说张三给李四转了1btc改成转了2btc），按照上面的推论一hash值不会随之改变的，然后它广播请求此区块同步到全网。问题来了：此时的hash值是符合规则的，那么其它节点怎么知道这笔账单是有被蹿改的呢？或者如何限制旷工不改变区块体呢？

So, assuming that a truancy calculates a rule-based hash value, then he starts to account for it, if it changes the content of the block body's account book (for example, Zhang San turned 1btc to Lee instead of 2btc), the above inference that one hash value will not change, and then it broadcasts a request that the block be synchronized to the whole net. The question arises: the rule is correct at this point, how does the other nodes know that the bill has been altered? Or how can they limit absenteeism from changing the block?

2018年4月27日 11:35 | # | 引用

April 27, 2018 11:35 );

罗啦啦 说： 

引用乌拉拉的发言：

真的是一篇很赞的科普文章！但是在区块头的结构图部分有点问题，区块头只包括上一区块的哈希值，并不包括该区块自身的哈希值

It's a really nice Cope article! But there's something wrong with the structure of the block, which includes only the Hashi value of the previous block, and not the Hashi value of the block itself.

对，你说的对，我刚看的时候也觉得有问题，区块主标识符是它的加密哈希值，一个通过SHA256算法对区块头进行二次哈希计算而得到的数字指纹。产生的32字节哈希值被称为区块哈希值，但是更准确的名称是：区块头哈希值，因为只有区块头被用于计算。并且任何节点通过简单地对区块头进行哈希计算都可以独立地获取该区块哈希值。请注意，区块哈希值实际上并不包含在区块的数据结构里，不管是该区块在网络上传输时，抑或是它作为区块链的一部分被存储在某节点的永久性存储设备上时。相反，区块哈希值是当该区块的下一个子区块从网络被接收时由每个节点计算出来的，该子区块将会把这个父区块的Hash值写进自己的区块头里。区块的哈希值可能会作为区块元数据的一部分被存储在一个独立的数据库表中，以便于索引和更快地从磁盘检索区块。

You're right, I was right when I looked at it. The main block identifier is its encrypted Hashi value, a digital fingerprint obtained by using the SHA256 algorithm to calculate the block's head twice. The resulting 32-bit Hashi value is called the Hashi value of the block, but it is more accurately called the Hashi value of the block because only the head of the block is used to calculate it. And any node can independently capture the Hashi value of the block by simply calculating the block's head. Please note that the Hash value of the block is not actually contained in the data structure of the block, whether it is transmitted on the network or it is stored as part of the chain of the block on a permanent storage device at a certain point. On the contrary, the Hashi value of the block is calculated by each node from each node when it is received from the network. The Hash value of the block may be stored as part of an independent database to facilitate the indexing and retrieval of the disk.

2018年5月10日 19:43 | # | 引用

May 10, 2018 19:43

骨哥 说：

said:

第三节“区块”部分中，区块头中包含的有“上一区块头的HASH”，而并非“上一区块的HASH”。

In section III, Blocks, the head of the block contains “HASH in the head of the previous block” rather than “HASH in the head of the previous block”.

2018年5月16日 10:44 | # | 引用

16 May 2018 10:44

哇嘎嘎 说：

says

浅显易懂

It's easy to understand.

2018年6月23日 21:33 | # | 引用

23 June 2018 21:33

rocky 说：

rocky says:

意思是说，如果往里面写数据，就每个区块都写入相应的数据，是这样吧？

It means that if you write the data inside, each block will write the corresponding data, right?

2018年6月25日 16:17 | # | 引用

June 25, 2018 16:17

萝卜 说：

感谢阮老师的文章，我打算以您这三篇文章为基础，入门区块链。
下面一段话，是有问题的：

Thanks to Mr. Nguyen's article, I intend to build on your three articles, the entry block chain.
The following paragraph is problematic:

举例来说，字符串123的哈希是a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0（十六进制），转成二进制就是256位，而且只有123能得到这个哈希。

For example, a8fdc205a9f19cc1c7507a60c4f01b13d11d7fd0 (hexadecimal) for a string 123 is 256 places in a binary system, and only 123 have access to this.

首先，这段哈希码是 40 个十六进制字符，转换成二进制，该是 160 位。
另外，字符串 123 的哈希值，我算了一下，如下，
"md5 202cb962ac59075b964b07152d234b70"
"sha1 40bd001563085fc35165329ea1ff5c5ecbdbbeef"
"sha256 a665a45920422f9d417e4867efdc4fb8a04a1f3fff1fa07e998e86f7f7a27ae3"
与您的数据对不起来。

First of all, the Hashi code is 40 hexadecimal characters, converted to binary, which is 160 bits.
Also, the Hashi value of the string 123, I calculate, as follows,
"md5 202cb962ac59075b964b07152d 234b70"
sha1 40bd0015685fc35165329ea5c5c5cbbbeef"

我不知道您的引用从哪里来的，百度了一下，这段多是引用您的，我也没有找到源头。
推测，您这里是 160 位，sha0 和 sha1 都是 160 位输出，我没有找到 sha0 的方法，估计是很久以前，某人用这个算法生成的摘要。但我没找到验证的工具和办法。

I don't know where your quote came from, but I didn't find the source.
Guess you're 160 bits, sha0 and sha1 are 160 bits of output. I didn't find a way to sha0.

2018年6月29日 12:54 | # | 引用

12:54 June 2018

李春林 说：

says Lee Chunlin 

引用千帆万桅的发言：

区块头中包含区块体的 Hash，如果一个区块的实际数据发生了改变，那么区块体的 Hash 就会发生改变，这一改变会导致当前区块的区块头发生改变，从而使得区块的 Hash 发生改变，当前区块的 Hash 发生改变又会引起下一个区块的区块头发生改变。如此一来，产生了骨牌效应。

Hash, which contains block sizes in the head of a block, changes in the physical data of a block will result in a change in the head of the block, which will result in a change in the head of the current block, and a change in the head of the next block, which will result in a change in the head of the next block.

修改一个区块时，如果不能同时修改后面所有的区块，就会导致当前区块与后面的区块失去连接。所以合适的做法就是不去修改区块。可是万一就有人非要去修改区块该怎么办呢？上面提到的这种联动机制看起来只会使得修改区块后果严重，并不能阻止修改区块的行为。

When a block is modified, failure to modify all the later blocks at the same time can lead to the loss of connection between the current block and the latter block. So it is appropriate not to modify the block. What if someone has to do something about it? The connection mechanism mentioned above would only seem to make the modification of the block serious and would not prevent the modification of the block.


如果你只修改你自己的区块那么需要51%的其他机器同意才能写入，也就是你要修改其中某一个区块但是你不修改之后的所有区块，每一台机器都不会同意你写入，就不会实际写入主链。

If you only change your own block, you need 51% of the other machines to write it, that is, you want to change one of the blocks, but you don't change all of the blocks, each machine will not agree to write you, and it will not actually be written into the main chain.

2019年3月 6日 16:55 | # | 引用

March 6, 2019 16:55

业余草 说：

says:

“每个节点都是平等的，都保存着整个数据库。”那我的数据库是不是越来越大，大到普通矿机都无法处理这么大的数据。未来是不是只有超级计算机才能支持其他人的查询？

"Every node is equal, and the entire database is kept." Does my database grow so big that the average miner can't handle this much data? Is it possible for a supercomputer to support other people's queries in the future?

2019年6月25日 13:46 | # | 引用

June 25, 2019 13:46 a href="https://www.ruanyifeng.com/blog/2017/12/blockchain-tutoral.html#comment-text"title= "onclick="return commentQuote (`comment-quote-411888',') ;

kbs2936 说：

kbs2936 says

阮老师文中的 targetmax 值应该是写错了，正确的应该是下面那个：
targetmax=0x00000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

The value of Targetmax in Mr. Nguyen's text should be wrong, and the right one should be the following:
targetmax=0x000000000

2019年8月16日 17:01 | # | 引用

August 16, 2019 17:01

京灰 说：

says

你好博主，请问几个小问题：第一个区块记录的是什么呢？50个比特币的奖励是谁来发放呢？

Hello, boss. Let me ask you a few small questions: What is the first block recording? Who gives 50 bitcoin prizes?

2019年10月27日 15:31 | # | 引用

27 October 2019 15:31

李晓铭 说：

says

请问博主，矿工们如何收集交易请求啊？我有一个交易，如何发给矿工呢？这个过程，需要一个中心转发吗？矿工们之间如何联系呢？
就像bt技术一样，最终离不开一个中心来发布种子和登记提供bt服务的ip地址，比特币和区块链能完全脱离一个中心吗？

Excuse me, Boss, how do miners collect requests for transactions? I have a deal, how do I send them to miners? Does this process require a central relay? How do miners communicate? Like bt technology, can you eventually leave a centre to publish seeds and register an ip address to provide bt services, and can Bitcoin and the block chain be completely separated from a centre?

2019年12月18日 17:39 | # | 引用

December 18, 2019 17:39

agiler 说：

agile says: 

引用顾唐散人的发言：

文中对hash值的描述有误，不同的字符串存在hash碰撞的可能性。

There is an erroneous description of the hash value in the text, and there is a potential for hash collision in different strings.

从长到短，肯定有碰撞，要不然变成压缩算法了

From long to short, there must have been a collision, or it would have been a compression algorithm.

2020年9月28日 15:29 | # | 引用

28 September 2020 15:29

spring 说：

如果计算了2亿多次还未计算到符合要求的hash，这时，协议允许矿工改变区块体，开始新的计算。作者对此能有进一步说明吗？这种计算完2亿多次还没计算出结果的情况多吗？，改变区块体怎么改变？有没有什么规则或说明改哪里。

If more than 200 million dollars have not been counted to meet the required hash, then the agreement allows miners to change blocks and start new calculations. Can the author further explain this?

2021年4月21日 13:28 | # | 引用

13:28 April 2021

Nil 说：

Nil says: 

引用spring的发言：

如果计算了2亿多次还未计算到符合要求的hash，这时，协议允许矿工改变区块体，开始新的计算。作者对此能有进一步说明吗？这种计算完2亿多次还没计算出结果的情况多吗？，改变区块体怎么改变？有没有什么规则或说明改哪里。

If more than 200 million dollars have not been counted to meet the required hash, then the agreement allows miners to change blocks and start new calculations. Can the author further explain this?

首先是改变随机数，然后coinbase交易里有的字段也可以更改

First, you change random numbers, and then the fields in the coinbase deal can be changed.

2021年10月 3日 18:18 | # | 引用

October 3, 2021 < 18:18

ww 说：

www says

当今社会，把区块链看作是下一代革命技术，我看未必，目前已成为传销组织的洗脑利剑。

In today's society, where the chain of blocks is seen as the next generation of revolutionary technology, I do not think that it has become the brainwashing sword of a distribution organization.

2021年12月16日 09:50 | # | 引用

09:50

美化布局示例
欧意最新版本

欧易(OKX)最新版本

【遇到注册下载问题请加文章最下面的客服微信】永久享受返佣20%手续费！

APP下载   全球官网 大陆官网
欧意最新版本

币安(Binance)最新版本

币安交易所app【遇到注册下载问题请加文章最下面的客服微信】永久享受返佣20%手续费！

APP下载   官网地址
欧意最新版本

火币HTX最新版本

火币老牌交易所【遇到注册下载问题请加文章最下面的客服微信】永久享受返佣20%手续费！

APP下载   官网地址
文字格式和图片示例

注册有任何问题请添加 微信：MVIP619 拉你进入群

弹窗与图片大小一致 文章转载注明

分享：

扫一扫在手机阅读、分享本文

上一篇：区块链介绍 区块链特征→MAIGOO百科 下一篇：区块链到底是什么
相关阅读
发表评论
平台列表
美化布局示例
欧意最新版本

欧易(OKX)

  全球官网 大陆官网
币安

币安(Binance)

  官网
火币HTX

火币（HTX）

  官网
火币HTX

Gate.io

  官网
火币HTX

Bitget

  官网
火币HTX

deepcoin

  官网
随机文章
热门文章

  • 从 IPFS社区Meetup谈谈2020年的IPFS的发展历程

    从 IPFS社区Meetup谈谈2020年的IPFS的发展历程
    8月3日， IPFS社区Meetup 如期举办，这一次的社区Meetup由交流与演讲和闪电演示两部分组成，其实该会议主要带领我们回顾了IPFS在2020年的发展历程（包括项目进展、IPFS生态发展等），展示了IPFS及其生态。2020年对于IPFS而言是不平凡的一年，其唯一激励层Filecoin的主网即将上线，这让IPFS和Filecoin在全球范围内得到了前所未有的关注，也推动了IPFS的高速发展。接下来，我们一起走进IPFS在20...

  • 超10万人爆仓，比特币跳水，发生了什么

    超10万人爆仓，比特币跳水，发生了什么
    现货比特币ETF上市第二日，数字货币再迎来抛售。比特币一度跌破42000美元/枚，截止1月13日内跌幅超7%，报42562.1美元/枚。The current Bitcoin ETF is on the second day of the market and the digital currency is sold again. Bitcoin fell by over 7% to $4562.1 on 13 January.现货比特币ETF普遍跌6%左右。其中，DEFI跌...

  • 兴业基金调研远光软件、东芯股份

    兴业基金调研远光软件、东芯股份
    根据6月6日公布的公开市场信息和机构研究,世界安全基金会最近对下列两家上市公司进行了一项研究: 1) 光电软件(工程师基金参与公司专项研究) 其中一个亮点是该公司深入参与建造南方网中心和技术平台,导致南网市场在 " 九天 " 平台产品方面取得重大突破;该公司的Won-宇宙大厅已上线,而且,除了Won-宇宙之外,远洋宇宙的应用现已扩大到Won-宇宙发射、Won-宇宙-教师和政党建设-宇宙;该公司的Far-O-Cloud平台已经实现了完全成熟的国家生产,也可以在全国云中运作。...

  • 0.00003374个比特币等于多少人民币／美金

    0.00003374个比特币等于多少人民币／美金
    0.00003374比特币等于多少人民币？根据比特币对人民币的最新汇率，0.00003374比特币等于2.2826 1222美元/16.5261124728人民币。比特币(BTC)美元（USDT）人民币（CNY）0.00003374克洛克-0/22216.5261124728比特币对人民币的最新汇率为:489807.72 CNY（1比特币=489807.72人民币）（1美元=7.24人民币）（0.00003374USDT=0.0002442776 CNY）。汇率更新于2024...

  • $DOG暴涨400%，加密货币或许正在重新定义和计量“价值”

    $DOG暴涨400%，加密货币或许正在重新定义和计量“价值”
    近/克洛克-0/5，Meme币狗？走吗？去哪？那个？MOON（$ DOG）连续上涨超过230%，突破前期高点，达到0.0062美元。在同一时期，比特币生态的许多主流L2协议代币下跌了50%以上。这些就是我们所说的“价值币”。虽然大起大落不能说明什么，但从过去的牛市来看，领头羊MemeCoin表现非凡。在上一轮牛市中，$DOGE的价格上涨了超过150倍，其市值接近900亿美元。还有其他MemeCoin，如$Shib、$People、$ELON、$AKITA等。2 vkwmkpm...
最近发表
标签列表

    在NFT-1.com，探索最新的NFT艺术、加密艺术和数字艺术，了解区块链艺术的最新趋势。加入我们，参与最热门的NFT市场交易和收藏，获取独特的NFT收藏品。

    OK币圈网 | 比特币买卖交易网 | 比特币网 | NFT资讯网 | NFT15 | ETH27 | BTC Music Shop | BTC Music Store | BJ-ACC | 9DZT | 币圈子 | 惊蛰财经网 | 区块链新闻资讯 | 比特币价格历史走势 | 币界网 | 币币情 | 比特币之家 | 知你太美 | 币圈交易员之家 | 币牛牛 | 世链财经 | 博链财经

    Powered By Z-BlogPHP  Theme By 老白编程