回复：工作量证明难度上升
原始发布页
打开来源页面查看 1 个交叉存档
这是个好主意。我还不确定具体该把它放在哪里，但它肯定可以计算生成区块之间的预期平均时间，这样大家就知道该期待什么了。
每个节点和每个处理器的区块中都有不同的公钥，因此可以保证它们扫描的是不同区域。
每当 32 位 nonce 从 1 重新开始时，bnExtraNonce 就会递增；它是一个任意精度整数。
英文原文
展开英文原文
That's a good idea. I'm not sure where exactly to fit that in, but it could certainly calculate the expected average time between blocks generated, and then people would know what to expect.
Every node and each processor has a different public key in its block, so they're guaranteed to be scanning different territory.
Whenever the 32-bit nonce starts over at 1, bnExtraNonce gets incremented, which is an arbitrary precision integer.