[
 {
  "category_zh": "地址",
  "category_en": "Addresses",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "作为额外的防火墙，每笔交易都应使用新的密钥对，以防交易被关联到同一所有者。对多输入交易而言，某种关联仍不可避免，因为这类交易必然暴露其输入属于同一所有者。风险在于：如果某个密钥的所有者身份被揭露，关联分析就可能暴露属于同一所有者的其他交易。",
  "text_en": "As an additional firewall, a new key pair should be used for each transaction to keep them from being linked to a common owner. Some linking is still unavoidable with multi-input transactions, which necessarily reveal that their inputs were owned by the same owner. The risk is that if the owner of a key is revealed, linking could reveal other transactions that belonged to the same owner.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "银行",
  "category_en": "Banks",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "我们必须信任银行来保管我们的钱并以电子方式转移，但它们却以一波波信贷泡沫把钱贷出去，准备金少得可怜。我们不得不把隐私托付给它们，相信它们不会让身份盗窃者掏空我们的账户。它们庞大的运营成本使得微支付成为不可能。",
  "text_en": "Banks must be trusted to hold our money and transfer it electronically, but they lend it out in waves of credit bubbles with barely a fraction in reserve. We have to trust them with our privacy, trust them not to let identity thieves drain our accounts. Their massive overhead costs make micropayments impossible.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们提出了一种不依赖信任的电子交易系统。我们从由数字签名构成的货币的常规框架入手，它能提供强有力的所有权控制，但若没有防止双重支付的方法，这个框架并不完整。为解决这一问题，我们提出使用工作量证明的点对点网络来记录公开的交易历史；只要诚实节点控制多数 CPU 算力，这段历史将迅速变得在计算上让攻击者难以篡改。",
  "text_en": "We have proposed a system for electronic transactions without relying on trust. We started with the usual framework of coins made from digital signatures, which provides strong control of ownership, but is incomplete without a way to prevent double-spending. To solve this, we proposed a peer-to-peer network using proof-of-work to record a public history of transactions that quickly becomes computationally impractical for an attacker to change if honest nodes control a majority of CPU power.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "虽然可以逐个处理每一枚货币，但转账中每分钱都单独做一笔交易未免过于笨拙。为使价值可以拆分和合并，交易包含多个输入和输出。通常情况下，要么是来自较大前序交易的单一输入，要么是多个合并小额的输入，而输出至多两个：一个用于付款，另一个在有找零时把找零返还给付款方。",
  "text_en": "Although it would be possible to handle coins individually, it would be unwieldy to make a separate transaction for every cent in a transfer. To allow value to be split and combined, transactions contain multiple inputs and outputs. Normally there will be either a single input from a larger previous transaction or multiple inputs combining smaller amounts, and at most two outputs: one for the payment, and one returning the change, if any, back to the sender.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "不运行完整网络节点也能验证付款。用户只需保留最长工作量证明链的区块头——通过查询网络节点直到确信自己拿到了最长链——并获取将交易链接到其所在时间戳区块的默克尔分支。他无法亲自核验这笔交易，但通过将其链接到链上的某个位置，他能看到某个网络节点已接受了它，之后追加的区块则进一步确认网络接受了它。因此，只要诚实节点控制网络，这种验证就是可靠的；但若网络被攻击者压制，它就更脆弱。网络节点可以自行核验交易，而简化方法可能被攻击者伪造的交易欺骗，持续多久取决于攻击者能压制网络多久。一种防范策略是：接受网络节点在检测到无效区块时发出的警报，提示用户软件下载完整区块及被提醒的交易。",
  "text_en": "It is possible to verify payments without running a full network node. A user only needs to keep a copy of the block headers of the longest proof-of-work chain, which he can get by querying network nodes until he's convinced he has the longest chain, and obtain the Merkle branch linking the transaction to the block it's timestamped in. He can't check the transaction for himself, but by linking it to a place in the chain, he can see that a network node has accepted it, and blocks added after it further confirm the network has accepted it. \nAs such, the verification is reliable as long as honest nodes control the network, but is more vulnerable if the network is overpowered by an attacker. While network nodes can verify transactions for themselves, the simplified method can be fooled by an attacker's fabricated transactions for as long as the attacker can continue to overpower the network. One strategy to protect against this would be to accept alerts from network nodes when they detect an invalid block, prompting the user's software to download the full block and alerted transactions to confirm the inconsistency. Businesses that receive frequent payments will probably still want to run their own nodes for more independent security and quicker verification.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "一个不含交易的区块头大约 80 字节。假设每 10 分钟产生一个区块，80 字节 × 6 × 24 × 365 ＝ 每年 4.2MB。以 2008 年计算机通常配备 2GB 内存、摩尔定律预测每年增长 1.2GB 来看，即使区块头必须常驻内存，存储也不成问题。",
  "text_en": "A block header with no transactions would be about 80 bytes. If we suppose blocks are generated every 10 minutes, 80 bytes * 6 * 24 * 365 = 4.2MB per year. With computer systems typically selling with 2GB of RAM as of 2008, and Moore's Law predicting current growth of 1.2GB per year, storage should not be a problem even if the block headers must be kept in memory.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "一旦一枚货币的最新交易被埋在足够多的区块之下，它之前的已花费交易就可以丢弃以节省磁盘空间。为在不破坏区块哈希的前提下实现这一点，交易被组织成默克尔树进行哈希，只有树根包含在区块哈希中。这样旧区块就可以通过剪除树的分支来压缩，内部哈希无需存储。",
  "text_en": "Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree, with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "运行网络的步骤如下：\n\n1. 新交易向所有节点广播。\n2. 每个节点将新交易收集进一个区块。\n3. 每个节点为其区块寻找困难的工作量证明。\n4. 当某个节点找到工作量证明，它将区块广播给所有节点。\n5. 节点仅在区块内所有交易都有效且未被花费时接受该区块。\n6. 节点通过使用已接受区块的哈希作为前一区块哈希、着手创建链中的下一个区块，来表达对该区块的接受。",
  "text_en": "The steps to run the network are as follows:\n\n1. New transactions are broadcast to all nodes.\n2. Each node collects new transactions into a block.\n3. Each node works on finding a difficult proof-of-work for its block.\n4. When a node finds a proof-of-work, it broadcasts the block to all nodes.\n5. Nodes accept the block only if all transactions in it are valid and not already spent.\n6. Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-11-01",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "主要特性：\n双重支付由点对点网络防止。\n没有铸币厂或其他受信任方。\n参与者可以匿名。\n新货币由 Hashcash 风格的工作量证明产生。\n用于新币生成的证明工作也为网络防止双重支付提供动力。",
  "text_en": "The main properties: \n Double-spending is prevented with a peer-to-peer network.\n No mint or other trusted parties.\n Participants can be anonymous.\n New coins are made from Hashcash style proof-of-work.\n The proof-of-work for new coin generation also powers the network to prevent double-spending.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/1/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-11-01",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "我一直在开发一种全新的电子现金系统，它完全是点对点的，没有可信第三方。",
  "text_en": "I've been working on a new electronic cash system that's fully peer-to-peer, with no trusted third party.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/1/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "在过去一年半的编码过程中，我相信我已经把所有这些细节都想通了，而且细节非常多。论文没有涉及功能细节，但源代码很快就会发布。我已把主要文件发给你了。（目前可按需索取，完整版本即将发布）",
  "text_en": "I believe I've worked through all those little details over the last year and a half while coding it, and there were a lot of them. The functional details are not covered in the paper, but the sourcecode is coming soon. I sent you the main files. (available by request at the moment, full release soon)",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/15/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "我开发了一种名为比特币的新型开源 P2P 电子现金系统。它完全去中心化，没有中央服务器或可信方，因为一切都基于密码学证明而非信任。试试它，或者看看截图和设计论文：\n\n请下载比特币 v0.1：http://www.bitcoin.org",
  "text_en": "I've developed a new open source P2P e-cash system called Bitcoin. It's completely decentralized, with no central server or trusted parties, because everything is based on crypto proof instead of trust. Give it a try, or take a look at the screenshots and design paper: \n\nDownload Bitcoin v0.1 at http://www.bitcoin.org",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "结果是一个没有单点故障的分布式系统。用户持有自己资金的密码学密钥，彼此直接交易，并借助 P2P 网络检查双重支付。",
  "text_en": "The result is a distributed system with no single point of failure. Users hold the crypto keys to their own money and transact directly with each other, with the help of the P2P network to check for double-spending.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2009-02-18",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "它是一个全球分布式数据库，数据库的增补由多数方同意，遵循一套规则：\n\n——每当有人找到工作量证明生成一个区块，他就获得一些新货币\n——工作量证明难度每两周调整一次，目标是全网平均每小时 6 个区块\n——每个区块发放的货币每 4 年减半",
  "text_en": "It is a global distributed database, with additions to the database by consent of the majority, based on a set of rules they follow: \n\n- Whenever someone finds proof-of-work to generate a block, they get some new coins\n- The proof-of-work difficulty is adjusted every two weeks to target an average of 6 blocks per hour (for the whole network)\n- The coins given per block is cut in half every 4 years",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/3/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-01-28",
  "context": "BitcoinTalk · Re: A newb's test - anyone want to buy a picture for $1?",
  "text_zh": "我很想找到办法加入一条短消息，但问题是，全世界都能看到这条消息。尽管你可以一再提醒人们这条消息完全没有隐私，但那就像在等一场意外发生。",
  "text_en": "I very much wanted to find some way to include a short message, but the problem is, the whole world would be able to see the message.  As much as you may keep reminding people that the message is completely non-private, it would be an accident waiting to happen.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/33/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-02-06",
  "context": "BitcoinTalk · Re: How divisible are bitcoins and other market/economic questions",
  "text_zh": "如果处理小数字让人厌烦，我们可以改动显示小数点的位置。货币数量不变，只是逗号和小数点位置的惯例不同。比如把小数点移动三位：如果之前是 1.00000，现在就显示为 1,000.00。",
  "text_en": "If it gets tiresome working with small numbers, we could change where the display shows the decimal point.  Same amount of money, just different convention for where the \",\"'s and \".\"'s go.  e.g. moving the decimal place 3 places would mean if you had 1.00000 before, now it shows it as 1,000.00.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/46/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-02-06",
  "context": "BitcoinTalk · Re: How divisible are bitcoins and other market/economic questions",
  "text_zh": "如果它真的发展壮大，最终全世界 68 亿人至多只有 2100 万枚货币。但别担心，还有 6 位不显示的小数位，内部总共 8 位小数。显示的是 1.00，内部实际是 1.00000000。如果未来出现大规模通缩，软件可以显示更多小数位。",
  "text_en": "Eventually at most only 21 million coins for 6.8 billion people in the world if it really gets huge.\n\nBut don't worry, there are another 6 decimal places that aren't shown, for a total of 8 decimal places internally.  It shows 1.00 but internally it's 1.00000000.  If there's massive deflation in the future, the software could show more decimal places.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/46/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-02-26",
  "context": "BitcoinTalk · Re: New icon/logo",
  "text_zh": "大家觉得那个外面带两条竖线的 B 符号怎么样？能把它当作我们的标志吗？",
  "text_en": "How does everyone feel about the B symbol with the two lines through the outside?  Can we live with that as our logo?",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/83/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-05-16",
  "context": "BitcoinTalk · Re: Could the bitcoin network be destroyed by someone generating endless bitcoin add",
  "text_zh": "生成一个新的比特币地址时，只占用你自己电脑上一点磁盘空间（约 500 字节）。就像生成一个新的 PGP 私钥，但因为用的是 ECC，CPU 开销更小。地址空间实际上是无限的。这不会伤害任何人，所以想生成多少就生成多少。",
  "text_en": "When you generate a new bitcoin address, it only takes disk space on your own computer (like 500 bytes).  It's like generating a new PGP private key, but less CPU intensive because it's ECC.  The address space is effectively unlimited.  It doesn't hurt anyone, so generate all you want.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/98/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-05-16",
  "context": "BitcoinTalk · Re: removing bitcoin addresses",
  "text_zh": "你生成的比特币地址会被永久保留。比特币地址必须保留，以证明发送到该地址的任何资金的所有权。如果你删除了一个比特币地址，而有人向它发送了资金，这笔钱就会丢失。它们只有约 500 字节大小。",
  "text_en": "Bitcoin addresses you generate are kept forever.  A bitcoin address must be kept to show ownership of anything sent to it.  If you were able to delete a bitcoin address and someone sent to it, the money would be lost.  They're only about 500 bytes.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/102/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-05-18",
  "context": "BitcoinTalk · Re: Ummmm... where did my bitcoins go?",
  "text_zh": "简化支付验证面向只做交易、不生成也不参与节点网络的轻量级纯客户端用户。他们不需要下载区块，只需下载哈希链——目前约 2MB，验证非常快（不到一秒就能验证整条链）。如果网络变得非常大，比如超过 10 万个节点，我们就用它来让普通用户无需成为完整节点也能做交易。到那时，大多数用户应该开始运行纯客户端软件，只有专业服务器农场继续运行完整网络节点，有点像 Usenet 网络的整合。\nSPV 还未实现，在遥远的未来之前不会实现，但当前实现的所有设计都是围绕支持它展开的。",
  "text_en": "Simplified Payment Verification is for lightweight client-only users who only do transactions and don't generate and don't participate in the node network.  They wouldn't need to download blocks, just the hash chain, which is currently about 2MB and very quick to verify (less than a second to verify the whole chain).  If the network becomes very large, like over 100,000 nodes, this is what we'll use to allow common users to do transactions without being full blown nodes.  At that stage, most users should start running client-only software and only the specialist server farms keep running full network nodes, kind of like how the usenet network has consolidated. \nSPV is not implemented yet, and won't be implemented until far in the future, but all the current implementation is designed around supporting it.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/105/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-06-17",
  "context": "BitcoinTalk · Re: Transactions and Scripts: DUP HASH160 ... EQUALVERIFY CHECKSIG",
  "text_zh": "比特币的本质是，一旦 0.1 版本发布，核心设计就终身钉死不变了。因此，我想让它能支持我能想到的每一种可能的交易类型。问题是，每种类型都需要专门的支持代码和数据字段，无论用不用，而且每次只覆盖一个特例。这会是特例的爆炸。解决方案是脚本，它把问题泛化——交易双方可以把交易描述为一个谓词，由节点网络求值。节点只需理解交易到能判断发送方条件是否满足的程度。",
  "text_en": "The nature of Bitcoin is such that once version 0.1 was released, the core design was set in stone for the rest of its lifetime.  Because of that, I wanted to design it to support every possible transaction type I could think of.  The problem was, each thing required special support code and data fields whether it was used or not, and only covered one special case at a time.  It would have been an explosion of special cases.  The solution was script, which generalizes the problem so transacting parties can describe their transaction as a predicate that the node network evaluates.  The nodes only need to understand the transaction to the extent of evaluating whether the sender's conditions are met.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/126/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-06-17",
  "context": "BitcoinTalk · Re: Transactions and Scripts: DUP HASH160 ... EQUALVERIFY CHECKSIG",
  "text_zh": "设计支持我几年前设计好的极其多样的可能交易类型。托管交易、担保合约、第三方仲裁、多方签名等等。如果比特币大规模流行起来，未来我们会想探索这些，但它们都必须在最开始就设计好，以确保以后有可能实现。",
  "text_en": "The design supports a tremendous variety of possible transaction types that I designed years ago.  Escrow transactions, bonded contracts, third party arbitration, multi-party signature, etc.  If Bitcoin catches on in a big way, these are things we'll want to explore in the future, but they all had to be designed at the beginning to make sure they would be possible later.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/126/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-06-18",
  "context": "BitcoinTalk · Re: Transactions and Scripts: DUP HASH160 ... EQUALVERIFY CHECKSIG",
  "text_zh": "从 2007 年开始。某个时刻我确信有一种方法可以完全不需要任何信任，于是忍不住一直想下去。设计的工作量远大于编码。\n\n幸运的是，到目前为止提出的所有问题，都是我之前考虑过并规划过的。",
  "text_en": "Since 2007.  At some point I became convinced there was a way to do this without any trust required at all and couldn't resist to keep thinking about it.  Much more of the work was designing than coding.\n\nFortunately, so far all the issues raised have been things I previously considered and planned for.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/127/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-07-23",
  "context": "BitcoinTalk · Faster initial block download (5x faster)",
  "text_zh": "通过调整数据库设置，我把初始区块下载提速了约 5 倍。现在大约 30 分钟就能下载完。\n\n数据库默认是每个区块同步写入磁盘，这并无必要。我改成让它把变更缓存在内存中，批量写出。区块仍然是事务性写入的，所以要么完整变更生效，要么完全不生效，无论哪种情况数据都保持有效状态。\n\n我只在初始区块下载期间启用这个改动。当接近最新区块 2000 个以内时，这些改动会关闭，恢复到旧方式。",
  "text_en": "By making some adjustments to the database settings, I was able to make the initial block download about 5 times faster.  It downloads in about 30 minutes. \n \nThe database default had it writing each block to disk synchronously, which is not necessary.  I changed the settings to let it cache the changes in memory and write them out in a batch.  Blocks are still written transactionally, so either the complete change occurs or none of it does, in either case the data is left in a valid state. \n \nI only enabled this change during the initial block download.  When you come within 2000 blocks of the latest block, these changes turn off and it slows down to the old way.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/258/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-07-29",
  "context": "BitcoinTalk · Re: Implementation bug prior to 0.3.6",
  "text_zh": "其实直接给我发私信就行。修的人是我。如果你发现安全漏洞，我肯定希望你私下告诉我，以便在公开之前修复。",
  "text_en": "Actually, it works well to just PM me.  I'm the one who's going to be fixing it.  If you find a security flaw, I would definitely like to hear from you privately to fix it before it goes public.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/294/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-09-19",
  "context": "BitcoinTalk · Re: Bug?  /usr/bin/bitcoind \"\"",
  "text_zh": "我对那些 bug 跟踪器一无所知。如果要有，我们得做一番充分调研再选。目前只用论坛管理得挺好。我在论坛上更容易看到 bug 帖子，我觉得其他用户也更愿意在这里帮忙解决和追问，而不是在 bug 跟踪器里。关键一步是其他用户帮忙解决那些其实不是 bug、只是误解或困惑的简单问题。我把在论坛上看到的所有未解决 bug 都记了个清单。有些情况下，我还在思考修复的最佳设计。这种软件不是那种未解决 bug 多到需要跟踪器的类型。",
  "text_en": "I don't know anything about any of the bug trackers.  If we were to have one, we would have to make a thoroughly researched choice. We're managing pretty well just using the forum.  I'm more likely to see bugs posted in the forum, and I think other users are much more likely to help resolve and ask follow up questions here than if they were in a bug tracker.  A key step is other users helping resolve the simple stuff that's not really a bug but some misunderstanding or confusion. I keep a list of all unresolved bugs I've seen on the forum.  In some cases, I'm still thinking about the best design for the fix.  This isn't the kind of software where we can leave so many unresolved bugs that we need a tracker for them.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/454/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-11-13",
  "context": "BitcoinTalk · Re: New icon/logo",
  "text_zh": "如果有艺术才能的人愿意贡献替代方案，我很欢迎。图标/标志的设计初衷是在 16×16 和 20×20 像素尺寸下好看。我觉得它是最好的程序图标，但用作网站图形的大尺寸版本还有改进空间。如果作者能把图形设为公有领域，会简单得多。",
  "text_en": "I'm happy if someone with artistic skill wants to contribute alternatives.  The icon/logo was meant to be good as an icon at the 16x16 and 20x20 pixel sizes.  I think it's the best program icon, but there's room for improvement at larger sizes for a graphic for use on websites. It'll be a lot simpler if authors could make their graphics public domain.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/500/"
 },
 {
  "category_zh": "比特币设计",
  "category_en": "Bitcoin Design",
  "date": "2010-12-05",
  "context": "BitcoinTalk · Re: Wikileaks contact info?",
  "text_zh": "项目需要逐步成长，软件才能在成长中不断加固。我呼吁 WikiLeaks 不要试图使用比特币。比特币还处在婴儿期，是一个很小的测试社区。",
  "text_en": "The project needs to grow gradually so the software can be strengthened along the way. I make this appeal to WikiLeaks not to try to use Bitcoin.  Bitcoin is a small beta community in its infancy.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/523/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "激励机制可能有助于鼓励节点保持诚实。如果贪婪的攻击者能够集结超过所有诚实节点的 CPU 算力，他就必须在两个选择之间抉择：用它通过收回已付出去的款项来欺诈，或者用它来生成新货币。他应该会发现，遵守规则更有利可图——按规则他获得的新货币比其他所有人加起来还多——而不是破坏系统和他自身财富的有效性。",
  "text_en": "The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people by stealing back his payments, or using it to generate new coins. He ought to find it more profitable to play by the rules, such rules that favour him with more new coins than everyone else combined, than to undermine the system and the validity of his own wealth.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "激励也可以用交易费来资助。如果一笔交易的输出值小于其输入值，差额就是交易费，会加到包含该交易的区块的激励值中。一旦预定数量的货币进入流通，激励就可以完全过渡到交易费，实现完全无通胀。",
  "text_en": "The incentive can also be funded with transaction fees. If the output value of a transaction is less than its input value, the difference is a transaction fee that is added to the incentive value of the block containing the transaction. Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "按惯例，区块中的第一笔交易是一笔特殊交易，它创建归区块创建者所有的新货币。这为节点支持网络提供了激励，也提供了一种最初把货币分配进流通的方式，因为没有中央机构来发行货币。稳定地增加固定数量的新货币，类似于金矿工耗费资源把黄金加入流通。在我们的例子中，耗费的是 CPU 时间和电力。",
  "text_en": "By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. This adds an incentive for nodes to support the network, and provides a way to initially distribute coins into circulation, since there is no central authority to issue them. The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2008-11-08",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "新货币不断产生意味着货币供应按计划数量增加，但这不一定导致通胀。如果货币供应增长的速度与使用它的人数增长速度相同，价格就保持稳定。如果供应增长慢于需求增长，就会出现通缩，货币的早期持有者会看到其价值上升。货币总得有个初始分配的方式，固定速率似乎是最好的公式。",
  "text_en": "The fact that new coins are produced means the money supply increases by a planned amount, but this does not necessarily result in inflation. If the supply of money increases at the same rate that the number of people using it increases, prices remain stable. If it does not increase as fast as demand, there will be deflation and early holders of money will see its value increase. Coins have to get initially distributed somehow, and a constant rate seems like the best formula.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/5/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2008-11-10",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "如果你对通胀问题感到困扰，很容易把它改成交易费模式。简单到这样：让每笔交易的输出值比输入值少 1 分。要么客户端软件自动把交易写成比预期付款值多 1 分，要么从收款方那边出。当节点为区块找到工作量证明时，激励值就是区块内所有费用的总和。",
  "text_en": "If you're having trouble with the inflation issue, it's easy to tweak it for transaction fees instead. It's as simple as this: let the output value from any transaction be 1 cent less than the input value. Either the client software automatically writes transactions for 1 cent more than the intended payment value, or it could come out of the payee's side. The incentive value when a node finds a proof-of-work for a block could be the total of the fees in the block.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/9/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "会有交易费，所以节点有动力接收并打包它们能收到的所有交易。当创造的货币总量达到预定上限后，节点最终将只靠交易费获得补偿。",
  "text_en": "There will be transaction fees, so nodes will have an incentive to receive and include all the transactions they can. Nodes will eventually be compensated by transaction fees alone when the total coins created hits the pre-determined ceiling.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2009-01-09",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "总流通量将是 21,000,000 枚。它会在节点生成区块时分配给网络节点，数量每 4 年减半。\n\n最初 4 年：10,500,000 枚\n接下来 4 年：5,250,000 枚\n接下来 4 年：2,625,000 枚\n接下来 4 年：1,312,500 枚\n以此类推……\n\n当这些发完后，系统可以靠交易费维持（如果需要的话）。这是基于公开市场竞争的，应该总会有节点愿意免费处理交易。",
  "text_en": "Total circulation will be 21,000,000 coins. It'll be distributed to network nodes when they make blocks, with the amount cut in half every 4 years.\n\nfirst 4 years: 10,500,000 coins\nnext 4 years: 5,250,000 coins\nnext 4 years: 2,625,000 coins\nnext 4 years: 1,312,500 coins\netc...\n\nWhen that runs out, the system can support transaction fees if needed. It's based on open market competition, and there will probably always be nodes willing to process transactions for free.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/16/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2009-01-17",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "趁它还没流行起来，先弄一点也许是个好主意。如果足够多的人都这么想，它就会成为自我实现的预言。一旦启动起来，如果你能像往自动售货机投币一样轻松地向网站支付几分钱，会有太多应用场景。",
  "text_en": "It might make sense just to get some in case it catches on. If enough people think the same way, that becomes a self fulfilling prophecy. Once it gets bootstrapped, there are so many applications if you could effortlessly pay a few cents to a website as easily as dropping coins in a vending machine.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/17/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2009-02-18",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "回答 Sepp 的问题，确实没有人能充当中央银行或联邦储备，在用户群体增长时调节货币供应。那需要一个可信方来确定价值，因为我不知道有什么办法能让软件知道现实世界中东西的真实价值。",
  "text_en": "To Sepp's question, indeed there is nobody to act as central bank or federal reserve to adjust the money supply as the population of users grows. That would have required a trusted party to determine the value, because I don't know a way for software to know the real world value of things.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/3/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2009-02-18",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "可以说货币是由多数方发行的。它们以有限的、预定的数量发行。",
  "text_en": "You could say coins are issued by the majority. They are issued in a limited, predetermined amount.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/3/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2009-02-18",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "在这个意义上，它更像贵金属。不是供应变化来保持价值不变，而是供应预定、价值变化。随着用户数量增长，每枚货币的价值上升。它有形成正反馈循环的潜力：用户增加，价值上升，又可能吸引更多用户来利用不断上升的价值。",
  "text_en": "In this sense, it's more typical of a precious metal. Instead of the supply changing to keep the value the same, the supply is predetermined and the value changes. As the number of users grows, the value per coin increases. It has the potential for a positive feedback loop; as users increase, the value goes up, which could attract more users to take advantage of the increasing value.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/3/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2009-12-10",
  "context": "BitcoinTalk · Re: Questions about Bitcoin",
  "text_zh": "那些货币永远无法找回，总流通量变少了。有效流通量减少，所有剩下的货币都稍微更值钱一点。这正好和政府印钞、现有货币贬值相反。",
  "text_en": "Those coins can never be recovered, and the total circulation is less.  Since the effective circulation is reduced, all the remaining coins are worth slightly more.  It's the opposite of when a government prints money and the value of existing money goes down.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/17/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-02-06",
  "context": "BitcoinTalk · Re: How divisible are bitcoins and other market/economic questions",
  "text_zh": "如果它真的发展壮大，最终全世界 68 亿人至多只有 2100 万枚货币。但别担心，还有 6 位不显示的小数位，内部总共 8 位小数。显示的是 1.00，内部实际是 1.00000000。如果未来出现大规模通缩，软件可以显示更多小数位。",
  "text_en": "Eventually at most only 21 million coins for 6.8 billion people in the world if it really gets huge.\n\nBut don't worry, there are another 6 decimal places that aren't shown, for a total of 8 decimal places internally.  It shows 1.00 but internally it's 1.00000000.  If there's massive deflation in the future, the software could show more decimal places.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/46/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-02-14",
  "context": "BitcoinTalk · Re: What's with this odd generation?",
  "text_zh": "几十年后当奖励变得太小时，交易费将成为节点的主要报酬。",
  "text_en": "In a few decades when the reward gets too small, the transaction fee will become the main compensation for nodes.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/57/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-02-14",
  "context": "BitcoinTalk · Re: What's with this odd generation?",
  "text_zh": "我确信 20 年后要么有非常大的交易量，要么根本没有交易量。",
  "text_en": "I'm sure that in 20 years there will either be very large transaction volume or no volume.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/57/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-02-21",
  "context": "BitcoinTalk · Re: Current Bitcoin economic model is unsustainable",
  "text_zh": "任何商品的价格都倾向于向生产成本靠拢。如果价格低于成本，生产就会放缓；如果价格高于成本，生产并出售更多就能获利。同时，产量的增加会提高难度，把生成成本推向价格。",
  "text_en": "The price of any commodity tends to gravitate toward the production cost.  If the price is below cost, then production slows down.  If the price is above cost, profit can be made by generating and selling more.  At the same time, the increased production would increase the difficulty, pushing the cost of generating towards the price.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/65/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-02-21",
  "context": "BitcoinTalk · Re: Current Bitcoin economic model is unsustainable",
  "text_zh": "目前，生成算力正在迅速增长，表明人们估计的现值高于当前的生产成本。",
  "text_en": "At the moment, generation effort is rapidly increasing, suggesting people are estimating the present value to be higher than the current cost of production.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/65/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-06-21",
  "context": "BitcoinTalk · Re: Dying bitcoins",
  "text_zh": "丢失的货币只会让其他人的货币稍微更值钱一点。把它看作给所有人的捐赠吧。",
  "text_en": "Lost coins only make everyone else's coins worth slightly more.  Think of it as a donation to everyone.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/131/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-08-07",
  "context": "BitcoinTalk · Re: Bitcoin minting is thermodynamically perverse",
  "text_zh": "这和黄金、淘金的情况一样。淘金的边际成本倾向于贴近金价。淘金是浪费，但这种浪费远小于拥有黄金作为交换媒介所带来的效用。\n我认为比特币的情况也一样。比特币所促成的交易所带来的效用，将远远超过所耗电力的成本。因此，没有比特币才是净浪费。",
  "text_en": "It's the same situation as gold and gold mining.  The marginal cost of gold mining tends to stay near the price of gold.  Gold mining is a waste, but that waste is far less than the utility of having gold available as a medium of exchange. \nI think the case will be the same for Bitcoin.  The utility of the exchanges made possible by Bitcoin will far exceed the cost of electricity used.  Therefore, not having Bitcoin would be the net waste.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/327/"
 },
 {
  "category_zh": "比特币经济学",
  "category_en": "Bitcoin Economics",
  "date": "2010-08-27",
  "context": "BitcoinTalk · Re: Bitcoins are most like shares of common stock",
  "text_zh": "比特币没有股息，也没有未来股息的可能，所以不像股票。\n\n更像收藏品或商品。",
  "text_en": "Bitcoins have no dividend or potential future dividend, therefore not like a stock.\n\nMore like a collectible or commodity.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/427/"
 },
 {
  "category_zh": "加密货币",
  "category_en": "Cryptocurrency",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "纯粹点对点版本的电子现金，将允许在线支付直接从一方发送到另一方，而无需经过金融机构。",
  "text_en": "A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "加密货币",
  "category_en": "Cryptocurrency",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "需要的是基于密码学证明而非信任的电子支付系统，让任何两个愿意的双方可以直接交易，无需可信第三方。计算上难以逆转的交易将保护卖方免受欺诈，常规的托管机制则可以轻松实现以保护买方。",
  "text_en": "What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "加密货币",
  "category_en": "Cryptocurrency",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们需要一种方法，让收款方知道之前的拥有者没有签署过更早的交易。就我们的目的而言，最早的交易才是有效的，所以我们不关心后来的双重支付企图。确认一笔交易不存在的唯一方法是知晓所有交易。在基于铸币厂的模型中，铸币厂知晓所有交易并决定哪笔先到。要在没有可信方的情况下做到这一点，交易必须公开宣布，我们需要一个系统让参与者就收到的交易顺序的单一历史达成一致。收款方需要证明：在每笔交易发生时，多数节点都同意它是第一个收到的。",
  "text_en": "We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don't care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced, and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "加密货币",
  "category_en": "Cryptocurrency",
  "date": "2009-01-17",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "如果 10 年后我们还没以某种方式用上电子货币，我会很惊讶——既然我们已经知道有一种做法，不会因为可信第三方打退堂鼓就不可避免地变质。",
  "text_en": "I would be surprised if 10 years from now we're not using electronic currency in some way, now that we know a way to do it that won't inevitably get dumbed down when the trusted third party gets cold feet.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/17/"
 },
 {
  "category_zh": "加密货币",
  "category_en": "Cryptocurrency",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "基于密码学证明的电子货币，无需信任第三方中介，货币可以安全，交易可以毫不费力。",
  "text_en": "With e-currency based on cryptographic proof, without the need to trust a third party middleman, money can be secure and transactions effortless.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "加密货币",
  "category_en": "Cryptocurrency",
  "date": "2009-02-15",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "很多人因为 90 年代以来倒闭的公司太多，就自动认定电子货币是注定失败的事业。我希望显而易见的是：害死它们的只是那些系统的中央集权本质。我认为，这是我们第一次尝试去中心化、不基于信任的系统。",
  "text_en": "A lot of people automatically dismiss e-currency as a lost cause because of all the companies that failed since the 1990's. I hope it's obvious it was only the centrally controlled nature of those systems that doomed them. I think this is the first time we're trying a decentralized, non-trust-based system.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/2/"
 },
 {
  "category_zh": "难度",
  "category_en": "Difficulty",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "为抵消硬件速度的提升和人们随时间运行节点的兴趣变化，工作量证明的难度由一个滑动平均值决定，目标是每小时平均产生的区块数。如果区块生成过快，难度就会上调。",
  "text_en": "To compensate for increasing hardware speed and varying interest in running nodes over time, the proof-of-work difficulty is determined by a moving average targeting an average number of blocks per hour. If they're generated too fast, the difficulty increases.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "难度",
  "category_en": "Difficulty",
  "date": "2008-11-08",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "随着计算机越来越快、用于创造比特币的总算力不断增加，难度会按比例上调，以保持新币总产量恒定。因此，未来每一年将产生多少新比特币，事先就是已知的。",
  "text_en": "As computers get faster and the total computing power applied to creating bitcoins increases, the difficulty increases proportionally to keep the total new production constant. Thus, it is known in advance how many new bitcoins will be created every year in the future.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/5/"
 },
 {
  "category_zh": "难度",
  "category_en": "Difficulty",
  "date": "2008-11-11",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "区块之间的目标间隔大概是 10 分钟。每个区块都包含其创建时间。如果时间偏差超过 36 小时，其他节点就不会在它上面继续工作。如果过去 6×24×30 个区块的时间跨度不足 15 天，说明区块生成过快，工作量证明难度翻倍。每个人都用同样的链上数据做同样的计算，所以大家在链的同一环节都会得出同样的结果。",
  "text_en": "The target time between blocks will probably be 10 minutes. Every block includes its creation time. If the time is off by more than 36 hours, other nodes won't work on it. If the timespan over the last 6*24*30 blocks is less than 15 days, blocks are being generated too fast and the proof-of-work difficulty doubles. Everyone does the same calculation with the same chain data, so they all get the same result at the same link in the chain.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/10/"
 },
 {
  "category_zh": "难度",
  "category_en": "Difficulty",
  "date": "2010-07-16",
  "context": "BitcoinTalk · Re: Proof-of-work difficulty increasing",
  "text_zh": "没错，难度调整的目标是让全网平均每小时生成 6 个区块。你的区块成熟所需的时间始终在 20 小时左右。",
  "text_en": "Right, the difficulty adjustment is trying to keep it so the network as a whole generates an average of 6 blocks per hour.  The time for your block to mature will always be around 20 hours.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/225/"
 },
 {
  "category_zh": "难度",
  "category_en": "Difficulty",
  "date": "2010-07-16",
  "context": "BitcoinTalk · Re: The dollar cost of bitmining energy",
  "text_zh": "难度刚刚提高了 4 倍，所以你现在的成本是每枚比特币 0.02 美元。",
  "text_en": "Difficulty just increased by 4 times, so now your cost is US$0.02/BTC.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/223/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "问题当然在于，收款人无法验证某个币的前任持有者是否没有双重支付过这枚币。常见的做法是引入一个受信任的中央权威——铸币厂——来检查每笔交易是否存在双重支付。每次交易后，币必须交回铸币厂换取新币，只有由铸币厂直接发行的币才被信任不会被双重支付。这个方案的问题在于，整个货币体系的命运都系于运营铸币厂的公司，每笔交易都必须经过它，就像银行一样。",
  "text_en": "The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the company running the mint, with every transaction having to go through them, just like a bank.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们提出用点对点网络来解决双重支付问题。网络通过将交易哈希进一条持续延伸的基于哈希的工作量证明链来为交易打上时间戳，形成一条记录：不重做工作量证明就无法篡改。最长链不仅证明了所见证事件的顺序，也证明了它来自最大的 CPU 算力池。只要多数 CPU 算力由不合谋攻击网络的节点控制，它们就会生成最长链，跑赢攻击者。网络本身需要的结构极少。",
  "text_en": "We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "在本文中，我们提出用点对点分布式时间戳服务器来解决双重支付问题，生成交易时序的计算证明。只要诚实节点共同控制的 CPU 算力超过任何合谋的攻击者节点群体，系统就是安全的。",
  "text_en": "In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-02",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "早在网络达到那种规模之前，用户就可以安全地使用简化支付验证（第 8 节）来防范双重支付，它只需要持有区块头链，大约每天 12KB。",
  "text_en": "Long before the network gets anywhere near as large as that, it would be safe for users to use Simplified Payment Verification (section 8) to check for double spending, which only requires having the chain of block headers, or about 12KB per day.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/2/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "攻击者不是在链尾追加区块。他必须回头重做他那笔交易所在的区块及其之后的所有区块，还要加上在他重做的同时网络不断在末尾新增的区块。他是在改写历史。一旦他的分支更长，它就成为新的有效链。",
  "text_en": "The attacker isn't adding blocks to the end. He has to go back and redo the block his transaction is in and all the blocks after it, as well as any new blocks the network keeps adding to the end while he's doing that. He's rewriting history. Once his branch is longer, it becomes the new valid one.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-11",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "收到那笔最终失效的双重支付的人，从一开始就不认为自己真正拿到过这笔钱。他的软件会把这笔交易的状态从\"未确认\"变为\"无效\"。如有必要，界面可以做到在交易未深入到区块链足够深度之前先隐藏它。",
  "text_en": "The guy who received the double-spend that became invalid never thought he had it in the first place. His software would have shown the transaction go from \"unconfirmed\" to \"invalid\". If necessary, the UI can be made to hide transactions until they're sufficiently deep in the block chain.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/10/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-11",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "收款人必须等待大约一小时后才能确认收款有效。到那时，网络会解决所有可能的双重支付竞争。",
  "text_en": "The receiver of a payment must wait an hour or so before believing that it's valid. The network will resolve any possible double-spend races by then.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/10/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-11",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "当同一笔交易的多个双重支付版本并存时，有且只有一个会成为有效版本。",
  "text_en": "When there are multiple double-spent versions of the same transaction, one and only one will become valid.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/10/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "没必要搞什么\"双重支付证据\"的举报机制。如果同一条链包含了两笔支付，该区块无效，会被拒绝。工作量证明不足的区块也一样——无效，被拒绝。没必要为此四处传播报告。每个节点在转发之前就能自己看出来并拒绝它。",
  "text_en": "There's no need for reporting of \"proof of double spending\" like that. If the same chain contains both spends, then the block is invalid and rejected. \n Same if a block didn't have enough proof-of-work. That block is invalid and rejected. There's no need to circulate a report about it. Every node could see that and reject it before relaying it.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "我们不是在\"盯梢\"双重支付、拉响警报抓骗子。我们只是裁决哪一笔支付有效。交易接收者必须等待几个区块，确保裁决有足够时间完成。想作弊的人尽管去同时双重支付试试，他们唯一能做到的就是：几个区块之内，其中一笔支付生效，其余失效。一旦主链上已有了一笔支付，之后任何双重支付都会被立即拒绝。",
  "text_en": "We're not \"on the lookout\" for double spends to sound the alarm and catch the cheater. We merely adjudicate which one of the spends is valid. Receivers of transactions must wait a few blocks to make sure that resolution has had time to complete. Would be cheaters can try and simultaneously double-spend all they want, and all they accomplish is that within a few blocks, one of the spends becomes valid and the others become invalid. Any later double-spends are immediately rejected once there's already a spend in the main chain.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "竞赛在于谁先把自己的交易传播到网络。想想六度空间——它是按指数级扩散的。一笔交易只需大约 2 分钟就能传播得足够广泛，迟到的竞争者几乎没机会在第一笔交易席卷全网之前抢到多少节点。在这 2 分钟里，商家的节点可以盯着有没有双重支付的交易。双重支付者不可能在商家收不到的情况下把他的替代交易撒向全世界，所以他只能等着再动手。",
  "text_en": "The race is to spread your transaction on the network first. Think 6 degrees of freedom -- it spreads exponentially. It would only take something like 2 minutes for a transaction to spread widely enough that a competitor starting late would have little chance of grabbing very many nodes before the first one is overtaking the whole network. During those 2 minutes, the merchant's nodes can be watching for a double-spent transaction. The double-spender would not be able to blast his alternate transaction out to the world without the merchant getting it, so he has to wait before starting.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/14/"
 },
 {
  "category_zh": "双重支付",
  "category_en": "Double Spending",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "任何持有者都可以通过再次签名，把已经花出去的币又转给别人，试图重复花费。通常的做法是找一家有中央数据库的可信公司来检查双重支付，但这又回到了信任模型。凭其中心地位，公司可以凌驾于用户之上，而维持公司运营所需的费用又让小额支付变得不切实际。比特币的方案是用点对点网络来检查双重支付。简单说，网络就像一台分布式时间戳服务器，为第一笔花费某枚币的交易盖戳。它利用了信息的一个特性：易于传播，难以压制。",
  "text_en": "Any owner could try to re-spend an already spent coin by signing it again to another owner. The usual solution is for a trusted company with a central database to check for double-spending, but that just gets back to the trust model. In its central position, the company can override the users, and the fees needed to support the company make micropayments impractical. \nBitcoin's solution is to use a peer-to-peer network to check for double-spending. In a nutshell, the network works like a distributed timestamp server, stamping the first transaction to spend a coin. It takes advantage of the nature of information being easy to spread but hard to stifle.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "经济学",
  "category_en": "Economics",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "问题当然在于，收款人无法验证某个币的前任持有者是否没有双重支付过这枚币。常见的做法是引入一个受信任的中央权威——铸币厂——来检查每笔交易是否存在双重支付。每次交易后，币必须交回铸币厂换取新币，只有由铸币厂直接发行的币才被信任不会被双重支付。这个方案的问题在于，整个货币体系的命运都系于运营铸币厂的公司，每笔交易都必须经过它，就像银行一样。",
  "text_en": "The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the company running the mint, with every transaction having to go through them, just like a bank.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "经济学",
  "category_en": "Economics",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "传统货币的根本问题在于，让它运转所需的信任太多了。中央银行必须被信任不会让货币贬值，但法定货币的历史上充满了这种信任被背叛的记录。",
  "text_en": "The root problem with conventional currency is all the trust that's required to make it work. The central bank must be trusted not to debase the currency, but the history of fiat currencies is full of breaches of that trust.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "经济学",
  "category_en": "Economics",
  "date": "2010-02-21",
  "context": "BitcoinTalk · Re: Current Bitcoin economic model is unsustainable",
  "text_zh": "对于预期会升值的东西，其理性市场价格早已折现了预期的未来涨幅。你在心里会做一个概率估算，权衡它继续上涨的几率。",
  "text_en": "A rational market price for something that is expected to increase in value will already reflect the present value of the expected future increases.  In your head, you do a probability estimate balancing the odds that it keeps increasing.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/65/"
 },
 {
  "category_zh": "经济学",
  "category_en": "Economics",
  "date": "2010-02-21",
  "context": "BitcoinTalk · Re: Current Bitcoin economic model is unsustainable",
  "text_zh": "任何商品的价格都趋向于向生产成本靠拢。价格低于成本，生产就会放缓；价格高于成本，生产更多、卖出就能获利。同时，产量增加会推高难度，把生产成本推向价格。",
  "text_en": "The price of any commodity tends to gravitate toward the production cost.  If the price is below cost, then production slows down.  If the price is above cost, profit can be made by generating and selling more.  At the same time, the increased production would increase the difficulty, pushing the cost of generating towards the price.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/65/"
 },
 {
  "category_zh": "经济学",
  "category_en": "Economics",
  "date": "2010-07-09",
  "context": "BitcoinTalk · Re: BTC Vulnerability? (Massive Attack against BTC system. Is it really?)",
  "text_zh": "当有人试图买断全世界某种稀缺资产的供给时，买得越多，价格涨得越高。到某个点，他们就再也买不起了。这对先前持有的人是好事，因为他们可以把币以疯狂的高价卖给这个想囤积的人。随着价格一路走高，总有人继续惜售，等着更高的价格。",
  "text_en": "When someone tries to buy all the world's supply of a scarce asset, the more they buy the higher the price goes.  At some point, it gets too expensive for them to buy any more.  It's great for the people who owned it beforehand because they get to sell it to the corner at crazy high prices.  As the price keeps going up and up, some people keep holding out for yet higher prices and refuse to sell.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/174/"
 },
 {
  "category_zh": "经济学",
  "category_en": "Economics",
  "date": "2010-08-27",
  "context": "BitcoinTalk · Re: Bitcoin does NOT violate Mises' Regression Theorem",
  "text_zh": "思想实验：想象有一种像黄金一样稀缺的基础金属，具有以下属性：\n- 灰扑扑的，颜色很无趣\n- 不是良好的电导体\n- 强度一般，既不延展也不易锻造\n- 没有任何实际或装饰用途\n\n还有一个特殊的、神奇的属性：\n- 可以通过通信信道传输\n\n如果它不知出于什么原因居然获得了一点点价值，那么任何想把财富转移到远方的人都可以买一点，发过去，再让接收方卖掉。\n\n它或许能获得一个初始价值",
  "text_en": "As a thought experiment, imagine there was a base metal as scarce as gold but with the following properties:\n- boring grey in colour\n- not a good conductor of electricity\n- not particularly strong, but not ductile or easily malleable either\n- not useful for any practical or ornamental purpose\n\nand one special, magical property:\n- can be transported over a communications channel\n\nIf it somehow acquired any value at all for whatever reason, then anyone wanting to transfer wealth over a long distance could buy some, transmit it, and have the recipient sell it.\n\nMaybe it could get an initial value",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/428/"
 },
 {
  "category_zh": "加密",
  "category_en": "Encryption",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "一代人以前，多用户分时计算机系统也有过类似的问题。在强加密出现之前，用户只能靠密码保护文件的安全，把隐私托付给系统管理员，相信他会为信息保密。隐私随时可能被管理员凌驾：他会按自己的判断权衡隐私原则与其他考量，或听命于上级。后来强加密走向大众，信任不再是必需品。数据可以用一种方式保护起来，让别人从物理上就无法访问——无论出于什么理由，无论借口多么冠冕堂皇，无论如何。",
  "text_en": "A generation ago, multi-user time-sharing computer systems had a similar problem. Before strong encryption, users had to rely on password protection to secure their files, placing trust in the system administrator to keep their information private. Privacy could always be overridden by the admin based on his judgment call weighing the principle of privacy against other concerns, or at the behest of his superiors. Then strong encryption became available to the masses, and trust was no longer required. Data could be secured in a way that was physically impossible for others to access, no matter for what reason, no matter how good the excuse, no matter what.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "加密",
  "category_en": "Encryption",
  "date": "2010-06-14",
  "context": "BitcoinTalk · Re: Dealing with SHA-256 Collisions",
  "text_zh": "SHA-256 非常强。它不像从 MD5 到 SHA1 那样只是渐进的一步。除非出现某种重大的突破性攻击，否则它能撑几十年。",
  "text_en": "SHA-256 is very strong.  It's not like the incremental step from MD5 to SHA1.  It can last several decades unless there's some massive breakthrough attack.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/119/"
 },
 {
  "category_zh": "加密",
  "category_en": "Encryption",
  "date": "2010-06-14",
  "context": "BitcoinTalk · Re: Dealing with SHA-256 Collisions",
  "text_zh": "如果 SHA-256 被彻底攻破，我想我们可以就麻烦开始之前那条诚实的区块链达成某种共识，把它锁定，然后从那里开始换用新的哈希函数继续。",
  "text_en": "If SHA-256 became completely broken, I think we could come to some agreement about what the honest block chain was before the trouble started, lock that in and continue from there with a new hash function.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/119/"
 },
 {
  "category_zh": "手续费",
  "category_en": "Fees",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "激励也可以由交易费来提供。如果一笔交易的输出值小于输入值，差额就是交易费，计入包含该交易的区块的激励。一旦预定数量的币进入流通，激励就可以完全转为交易费，实现完全无通胀。",
  "text_en": "The incentive can also be funded with transaction fees. If the output value of a transaction is less than its input value, the difference is a transaction fee that is added to the incentive value of the block containing the transaction. Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "手续费",
  "category_en": "Fees",
  "date": "2008-11-10",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "如果你在通胀问题上卡住了，改成交易费很容易。就这么简单：让每笔交易的输出值比输入值少 1 分。要么客户端软件自动把交易写成比预期付款金额多 1 分，要么从收款方那边扣。节点找到一个区块的工作量证明时获得的激励，可以就是该区块中所有手续费的总和。",
  "text_en": "If you're having trouble with the inflation issue, it's easy to tweak it for transaction fees instead. It's as simple as this: let the output value from any transaction be 1 cent less than the input value. Either the client software automatically writes transactions for 1 cent more than the intended payment value, or it could come out of the payee's side. The incentive value when a node finds a proof-of-work for a block could be the total of the fees in the block.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/9/"
 },
 {
  "category_zh": "手续费",
  "category_en": "Fees",
  "date": "2010-02-14",
  "context": "BitcoinTalk · Re: What's with this odd generation?",
  "text_zh": "几十年后，当区块奖励变得太少，交易费将成为节点的主要报酬。",
  "text_en": "In a few decades when the reward gets too small, the transaction fee will become the main compensation for nodes.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/57/"
 },
 {
  "category_zh": "手续费",
  "category_en": "Fees",
  "date": "2010-02-14",
  "context": "BitcoinTalk · Re: What's with this odd generation?",
  "text_zh": "如果你心疼这笔手续费，大可以反过来自己运行一个节点，说不定哪天自己也能收一笔 0.44 的手续费。",
  "text_en": "If you're sad about paying the fee, you could always turn the tables and run a node yourself and maybe someday rake in a 0.44 fee yourself.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/56/"
 },
 {
  "category_zh": "手续费",
  "category_en": "Fees",
  "date": "2010-09-07",
  "context": "BitcoinTalk · Re: Always pay transaction fee?",
  "text_zh": "另一个办法是减少每个区块在要求手续费之前允许的免费交易数量。节点每个区块只接受若干 KB 的免费交易，超过之后就要求至少 0.01 的交易费。这个门槛大概应该比现在低一些。但我不认为门槛应该降到 0。我们应该始终允许至少一部分免费交易。",
  "text_en": "Another option is to reduce the number of free transactions allowed per block before transaction fees are required.  Nodes only take so many KB of free transactions per block before they start requiring at least 0.01 transaction fee. The threshold should probably be lower than it currently is. I don't think the threshold should ever be 0.  We should always allow at least some free transactions.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/439/"
 },
 {
  "category_zh": "手续费",
  "category_en": "Fees",
  "date": "2010-09-08",
  "context": "BitcoinTalk · Re: Always pay transaction fee?",
  "text_zh": "目前付手续费是靠 -paytxfee 开关手动控制的。让软件自动检查最近区块的大小、判断要不要付费，其实很容易实现。我们离触及门槛还远得很，暂时还不需要。不管怎么说，先看看手动控制的效果也是个好主意。",
  "text_en": "Currently, paying a fee is controlled manually with the -paytxfee switch.  It would be very easy to make the software automatically check the size of recent blocks to see if it should pay a fee.  We're so far from reaching the threshold, we don't need that yet.  It's a good idea to see how things go with controlling it manually first anyway.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/441/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-03-23",
  "context": "BitcoinTalk · Re: who is bitcoin.com",
  "text_zh": ".com 域名的注册费实在太便宜了，所以你能想到的任何好名字，都早已被某个域名投机者抢注。好在开源项目本来就多用 .org。",
  "text_en": "The price of .com registrations is lower than it should be, therefore any good name you might think of is always already taken by some domain name speculator.  Fortunately, it's standard for open source projects to be .org.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/94/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-06-18",
  "context": "BitcoinTalk · Re: Get 5 free bitcoins from freebitcoins.appspot.com",
  "text_zh": "首个项目选得非常好，干得漂亮。本来我想着，如果没人做，我就自己来做这个——等到凡人再也挖不出 50BTC 的时候，新用户一进来就能先拿到点币试试。捐赠应该能让它一直有货。页面上显示分发机的余额，会鼓励大家往里添币。\n\n你应该在页面上放一个捐赠用的比特币地址，方便想添币的人打款；理想情况下，每收到一笔捐款，就换一个新地址。",
  "text_en": "Excellent choice of a first project, nice work.  I had planned to do this exact thing if someone else didn't do it, so when it gets too hard for mortals to generate 50BTC, new users could get some coins to play with right away.  Donations should be able to keep it filled.  The display showing the balance in the dispenser encourages people to top it up.\n\nYou should put a donation bitcoin address on the page for those who want to add funds to it, which ideally should update to a new address whenever it receives something.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/129/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-07-05",
  "context": "BitcoinTalk · Re: Slashdot Submission for 1.0",
  "text_zh": "给普通大众写一段介绍这东西的文案，实在太难了——根本找不到任何可以类比的参照。",
  "text_en": "Writing a description for this thing for general audiences is bloody hard.  There's nothing to relate it to.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/167/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-07-10",
  "context": "BitcoinTalk · Re: They want to delete the Wikipedia article",
  "text_zh": "时间点很蹊跷：我们刚在 Slashdot 上露脸，第三方报道正迅速增多，就有人提议删除条目。希望他们不会急着收尾讨论做决定。维基百科一般会让这类讨论开放多久征求意见？\n条目最好尽快精简一下，别写得像软文。只需告诉人们它是什么、在电子货币的版图里处于什么位置，而不是说服他们相信它有多好。估计他们想要的，就是大致说明它是个什么东西，而不是解释它全部的工作原理。",
  "text_en": "The timing is strange, just as we are getting a rapid increase in 3rd party coverage after getting slashdotted.  I hope there's not a big hurry to wrap the discussion and decide.  How long does Wikipedia typically leave a question like that open for comment? \nIt would help to condense the article and make it less promotional sounding as soon as possible.  Just letting people know what it is, where it fits into the electronic money space, not trying to convince them that it's good.  They probably want something that just generally identifies what it is, not tries to explain all about how it works.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/249/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-07-25",
  "context": "BitcoinTalk · Re: md5?",
  "text_zh": "留个记录，这是我的公钥。自 2008 年 bitcoin.org 上线以来，它一直就在那里。现在就存下来，以备后用。http://www.bitcoin.org/Satoshi_Nakamoto.asc",
  "text_en": "For future reference, here's my public key.  It's the same one that's been there since the bitcoin.org site first went up in 2008.  Grab it now in case you need it later. http://www.bitcoin.org/Satoshi_Nakamoto.asc",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/276/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-08-11",
  "context": "BitcoinTalk · Re: Escrow",
  "text_zh": "那你们也应该反对常见的先付款制度——因为在那里，客户永远是输家。\n\n先付款：客户亏了，贼拿到了钱。\n简单托管：客户亏了，但贼也拿不到钱。\n你们的意思难道是，先付款更好——因为至少贼拿到了钱，至少有人赚到了？\n\n想象一下，有人偷了你的东西，你要不回来。但假如它有个可以远程触发的自毁开关，你会不会按下？如果小偷们知道，你所有的东西都有自毁开关，偷了也等于白偷（虽然你自己也损失了），这是不是好事？如果他们还回来，你可以重新激活它。\n\n想象一下，黄金被偷之后变成铅。小偷交回来，它又变回黄金。\n\n我还是觉得，问题可能出在表达方式上。比如在博弈论讨论里，不要那么直白地提\"烧钱\"这个词。钱从来没有被真正烧掉，你永远、随时都有权释放它。",
  "text_en": "Then you must also be against the common system of payment up front, where the customer loses.\nPayment up front: customer loses, and the thief gets the money.\nSimple escrow: customer loses, but the thief doesn't get the money either.\nAre you guys saying payment up front is better, because at least the thief gets the money, so at least someone gets it?\nImagine someone stole something from you.  You can't get it back, but if you could, if it had a kill switch that could be remote triggered, would you do it?  Would it be a good thing for thieves to know that everything you own has a kill switch and if they steal it, it'll be useless to them, although you still lose it too?  If they give it back, you can re-activate it.\nImagine if gold turned to lead when stolen.  If the thief gives it back, it turns to gold again.\nIt still seems to me the problem may be one of presenting it the right way.  For one thing, not being so blunt about \"money burning\" for the purposes of game theory discussion.  The money is never truly burned.  You have the option to release it at any time forever.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/340/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-09-23",
  "context": "BitcoinTalk · Re: Porn",
  "text_zh": "比特币对这类人会很方便：没有信用卡的人，或不想用手头卡的人——要么是不想让配偶在账单上看到，要么是不放心把卡号交给那些\"成人网站\"，要么是害怕被反复扣费。",
  "text_en": "Bitcoin would be convenient for people who don't have a credit card or don't want to use the cards they have, either don't want the spouse to see it on the bill or don't trust giving their number to \"porn guys\", or afraid of recurring billing.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/460/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-09-30",
  "context": "BitcoinTalk · Re: BitCoin Wikipedia page DELETED!!!",
  "text_zh": "我倒希望，与其删条目，不如给个篇幅限制。不够知名的话，至少可以保留一个说明它是什么的小条目。我经常看到维基上讨厌的红链——那些词条明明应该至少有个存在感。\n\n条目可以简单到一句话：\"比特币是一种点对点去中心化电子货币。\"\n\n更合维基惯例的做法是：在我们所属的更大分类下写一段介绍，比如\"电子货币\"或\"电子现金\"。我们应该能在那里立足一段。还是那句话：保持简短，只说明它是什么。",
  "text_en": "I wish rather than deleting the article, they put a length restriction.  If something is not famous enough, there could at least be a stub article identifying what it is.  I often come across annoying red links of things that Wiki ought to at least have heard of. \nThe article could be as simple as something like: \"Bitcoin is a peer-to-peer decentralised /link/electronic currency/link/.\" \nThe more standard Wiki thing to do is that we should have a paragraph in one of the more general categories that we are an instance of, like Electronic Currency or Electronic Cash.  We can probably establish a paragraph there.  Again, keep it short.  Just identifying what it is.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/467/"
 },
 {
  "category_zh": "综合",
  "category_en": "General",
  "date": "2010-12-11",
  "context": "BitcoinTalk · Re: PC World Article on Bitcoin",
  "text_zh": "要是在别的场合得到这样的关注该多好。维基解密捅了马蜂窝，蜂群正朝我们飞来。",
  "text_en": "It would have been nice to get this attention in any other context.  WikiLeaks has kicked the hornet's nest, and the swarm is headed towards us.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/542/"
 },
 {
  "category_zh": "政府",
  "category_en": "Government",
  "date": "2008-11-07",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "政府很擅长砍掉像 Napster 这样中央控制网络的脑袋，但纯点对点网络——比如 Gnutella 和 Tor——看起来各自都守住了阵地。",
  "text_en": "Governments are good at cutting off the heads of a centrally controlled networks like Napster, but pure P2P networks like Gnutella and Tor seem to be holding their own.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/4/"
 },
 {
  "category_zh": "身份",
  "category_en": "Identity",
  "date": "2014-03-07",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "我不是多利安·中本。",
  "text_en": "I am not Dorian Nakamoto.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/4/"
 },
 {
  "category_zh": "微支付",
  "category_en": "Micropayments",
  "date": "2009-01-17",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "它已经可以用来做\"付费发邮件\"了。发送对话框可以调整大小，想写多长都行；一连上网就直接发出去。收件人双击那笔交易就能看到完整消息。如果某个名人收到的邮件多到看不完，但还想让粉丝有个联系上他的渠道，他可以装上比特币，在网站上公布 IP 地址：\"往这个 IP 的优先热线打 X 个比特币，我亲自读信。\"",
  "text_en": "It can already be used for pay-to-send e-mail. The send dialog is resizeable and you can enter as long of a message as you like. It's sent directly when it connects. The recipient doubleclicks on the transaction to see the full message. If someone famous is getting more e-mail than they can read, but would still like to have a way for fans to contact them, they could set up Bitcoin and give out the IP address on their website. \"Send X bitcoins to my priority hotline at this IP and I'll read the message personally.\"",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/17/"
 },
 {
  "category_zh": "微支付",
  "category_en": "Micropayments",
  "date": "2009-01-17",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "订阅类网站如果想给免费试用加一道工作量证明门槛，避免试用蚕食订阅，可以用比特币来收试用费。",
  "text_en": "Subscription sites that need some extra proof-of-work for their free trial so it doesn't cannibalize subscriptions could charge bitcoins for the trial.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/17/"
 },
 {
  "category_zh": "微支付",
  "category_en": "Micropayments",
  "date": "2009-01-17",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "趁还没火起来，先囤一点也不失为明智之举。如果足够多的人都这么想，这就成了自我实现的预言。一旦它启动起来，应用场景数不胜数——如果能像往自动贩卖机投币一样，毫不费力地给网站付几分钱。",
  "text_en": "It might make sense just to get some in case it catches on. If enough people think the same way, that becomes a self fulfilling prophecy. Once it gets bootstrapped, there are so many applications if you could effortlessly pay a few cents to a website as easily as dropping coins in a vending machine.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/17/"
 },
 {
  "category_zh": "微支付",
  "category_en": "Micropayments",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "银行必须被信任，才能让它替我们保管钱、电子转账，但它却把钱一波波贷出去吹大信用泡沫，准备金率低得可怜。我们不得不把隐私托付给它，不得不相信它不会让身份窃贼掏空我们的账户。它们庞大的运营开销，让微支付成为不可能。",
  "text_en": "Banks must be trusted to hold our money and transfer it electronically, but they lend it out in waves of credit bubbles with barely a fraction in reserve. We have to trust them with our privacy, trust them not to let identity thieves drain our accounts. Their massive overhead costs make micropayments impossible.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "微支付",
  "category_en": "Micropayments",
  "date": "2010-08-04",
  "context": "BitcoinTalk · Re: Flood attack 0.00000001 BC",
  "text_zh": "比特币目前还不适合极小的微支付。比如按次搜索、按页面付费这类场景，没有聚合机制就玩不转；低于 0.01 的支付也不行。尘埃垃圾限额，是首次有意限制这类过小微支付的尝试。\n比特币适合的，是比现有支付方式能处理的更小的交易——小到覆盖所谓的微支付上限区间。但它并不声称能处理任意小的微支付。",
  "text_en": "Bitcoin isn't currently practical for very small micropayments.  Not for things like pay per search or per page view without an aggregating mechanism, not things needing to pay less than 0.01.  The dust spam limit is a first try at intentionally trying to prevent overly small micropayments like that. \nBitcoin is practical for smaller transactions than are practical with existing payment methods.  Small enough to include what you might call the top of the micropayment range.  But it doesn't claim to be practical for arbitrarily small micropayments.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/317/"
 },
 {
  "category_zh": "微支付",
  "category_en": "Micropayments",
  "date": "2010-08-05",
  "context": "BitcoinTalk · Re: Flood attack 0.00000001 BC",
  "text_zh": "漏说了微支付的好消息。虽然我不认为比特币现在适合更小的微支付，但随着存储和带宽成本持续下降，它终究会适合。如果比特币大规模流行起来，到那时可能已经不是问题了。另一个让它更实用的办法：我可以实现纯客户端模式，网络节点收缩为数量更少的专业服务器机房。无论你需要多小的微支付，最终都会变得实用。我想，再过 5 到 10 年，带宽和存储都会变得微不足道。",
  "text_en": "Forgot to add the good part about micropayments.  While I don't think Bitcoin is practical for smaller micropayments right now, it will eventually be as storage and bandwidth costs continue to fall.  If Bitcoin catches on on a big scale, it may already be the case by that time.  Another way they can become more practical is if I implement client-only mode and the number of network nodes consolidates into a smaller number of professional server farms.  Whatever size micropayments you need will eventually be practical.  I think in 5 or 10 years, the bandwidth and storage will seem trivial.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/318/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "按照惯例，区块中的第一笔交易是一笔特殊交易，它创造出归区块创建者所有的新币。这激励节点去支持网络，也提供了一种最初发行货币进入流通的方式——因为没有中央机构来发行货币。稳定地新增固定数量的新币，就好比金矿工耗费资源把黄金开采出来投入流通。在我们这里，耗费的是 CPU 算力和电力。",
  "text_en": "By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. This adds an incentive for nodes to support the network, and provides a way to initially distribute coins into circulation, since there is no central authority to issue them. The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "这个网络胜在无结构的简单，坚韧无比。节点同时工作，几乎不需要协调。它们不需要身份标识，因为消息不发往任何特定地点，只需尽力送达。节点可以随时离开、随时重返，把工作量证明链当作它们离线期间所发生事情的证据。它们用 CPU 算力投票：接受有效区块，就接着往上延长；拒绝无效区块，就拒绝为它工作。一切必要的规则和激励，都可以用这个共识机制来执行。",
  "text_en": "The network is robust in its unstructured simplicity. Nodes work all at once with little coordination. They do not need to be identified, since messages are not routed to any particular place and only need to be delivered on a best effort basis. Nodes can leave and rejoin the network at will, accepting the proof-of-work chain as proof of what happened while they were gone. They vote with their CPU power, expressing their acceptance of valid blocks by working on extending them and rejecting invalid blocks by refusing to work on them. Any needed rules and incentives can be enforced with this consensus mechanism.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "设想这样一种场景：攻击者试图生成一条比诚实链更快的替代链。即使他成功了，系统也不会因此任人篡改——比如凭空创造价值，或者夺取从不属于他的钱。节点不会接受无效交易作为支付，诚实节点也绝不会接受包含无效交易的区块。攻击者唯一能做的，就是试图修改自己的一笔交易，拿回自己刚花出去的钱。",
  "text_en": "We consider the scenario of an attacker trying to generate an alternate chain faster than the honest chain. Even if this is accomplished, it does not throw the system open to arbitrary changes, such as creating value out of thin air or taking money that never belonged to the attacker. Nodes are not going to accept an invalid transaction as payment, and honest nodes will never accept a block containing them. An attacker can only try to change one of his own transactions to take back money he recently spent.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "激励有助于让节点保持诚实。即使一个贪婪的攻击者集齐了超过所有诚实节点的 CPU 算力，他也必须二选一：用它作弊、拿回自己付出去的钱；或者用它来生成新币。他会发现，按规则行事更赚钱——规则会让他获得比其他所有人加起来更多的新币，而不是去破坏系统、动摇自己财富的有效性。",
  "text_en": "The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people by stealing back his payments, or using it to generate new coins. He ought to find it more profitable to play by the rules, such rules that favour him with more new coins than everyone else combined, than to undermine the system and the validity of his own wealth.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-03",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "比特币网络甚至可能减少垃圾邮件——把僵尸网络引去挖比特币。",
  "text_en": "The Bitcoin network might actually reduce spam by diverting zombie farms to generating bitcoins instead.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/3/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-03",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "要求是：好人一方的 CPU 算力总和，超过任何单个攻击者。",
  "text_en": "The requirement is that the good guys collectively have more CPU power than any single attacker.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/3/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-03",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "会有很多小型僵尸网络，大到不足以压制网络，但照样能靠生成比特币赚钱。这些小网络就是\"诚实节点\"。（我需要比\"诚实\"更好的词。）转行生成比特币的小网络越多，压制网络的门槛就越高，大网络也变得不够大，索性也加入挖矿。按照\"长尾\"理论，小型、中型和仅仅是大型网络加起来，应该远超最大的那个僵尸网络。",
  "text_en": "There would be many smaller zombie farms that are not big enough to overpower the network, and they could still make money by generating bitcoins. The smaller farms are then the \"honest nodes\". (I need a better term than \"honest\") The more smaller farms resort to generating bitcoins, the higher the bar gets to overpower the network, making larger farms also too small to overpower it so that they may as well generate bitcoins too. According to the \"long tail\" theory, the small, medium and merely large farms put together should add up to a lot more than the biggest zombie farm.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/3/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-03",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "即使坏人真的压制了网络，也不是瞬间暴富。他唯一能做的，就是拿回自己花出去的钱，就像跳票的支票。想作恶，他得先从商家买东西，等发货后，再压制网络、试图把钱要回来。我不觉得靠这种盗刷伎俩，能比老老实实生成比特币赚得多。手里有这么大的僵尸网络，他生成比特币的数量能超过其他所有人加起来。",
  "text_en": "Even if a bad guy does overpower the network, it's not like he's instantly rich. All he can accomplish is to take back money he himself spent, like bouncing a check. To exploit it, he would have to buy something from a merchant, wait till it ships, then overpower the network and try to take his money back. I don't think he could make as much money trying to pull a carding scheme like that as he could by generating bitcoins. With a zombie farm that big, he could generate more bitcoins than everyone else combined.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/3/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-08",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "随着计算机越来越快，投入生成比特币的总算力增加，难度会按比例上升，以保持新币总产量不变。因此，未来每年会生成多少新比特币，是事先就知道的。",
  "text_en": "As computers get faster and the total computing power applied to creating bitcoins increases, the difficulty increases proportionally to keep the total new production constant. Thus, it is known in advance how many new bitcoins will be created every year in the future.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/5/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "最长链永远被视为有效链，这一点严格必要。在场的节点或许记得某个分支先出现、后被取代，但没法让不在场的人相信。不能让节点分成小派系：有的死守自己先看到的分支，有的先看到另一条分支，后来的则根本没见过发生了什么。CPU 算力的工作量证明投票必须一锤定音。让所有人达成共识的唯一方式，就是认定：无论如何，最长链永远有效。",
  "text_en": "It is strictly necessary that the longest chain is always considered the valid one. Nodes that were present may remember that one branch was there first and got replaced by another, but there would be no way for them to convince those who were not present of this. We can't have subfactions of nodes that cling to one branch that they think was first, others that saw another branch first, and others that joined later and never saw what happened. The CPU power proof-of-work vote must have the final say. The only way for everyone to stay on the same page is to believe that the longest chain is always the valid one, no matter what.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-14",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "广播大概率会几乎完全可靠。如今 TCP 传输极少丢包，广播协议还有重试机制，过一阵可以从其他节点拿到数据。如果实际广播比预期慢，区块目标间隔就得延长，以免浪费算力。我们希望区块的传播时间通常远小于生成时间，否则节点会浪费太多时间在过时区块上。",
  "text_en": "Broadcasts will probably be almost completely reliable. TCP transmissions are rarely ever dropped these days, and the broadcast protocol has a retry mechanism to get the data from other nodes after a while. If broadcasts turn out to be slower in practice than expected, the target time between blocks may have to be increased to avoid wasting resources. We want blocks to usually propagate in much less time than it takes to generate them, otherwise nodes would spend too much time working on obsolete blocks.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/12/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "工作量证明是 Hashcash 风格的 SHA-256 碰撞寻找。这是一个无记忆过程：每秒做几百万次哈希，每次都有微小的成功概率。最快的 3 或 4 个节点的优势，也只与它们占总 CPU 算力的份额成正比。任何人在任何时刻找到解的概率，都与它的 CPU 算力成正比。",
  "text_en": "The proof-of-work is a Hashcash style SHA-256 collision finding. It's a memoryless process where you do millions of hashes a second, with a small chance of finding one each time. The 3 or 4 fastest nodes' dominance would only be proportional to their share of the total CPU power. Anyone's chance of finding a solution at any time is proportional to their CPU power.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2009-01-09",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "你可以让人给你转点币，或者打开 选项→生成币，运行一个节点、生成区块。起初我把工作量证明难度设得极低，所以一开始的这段时间，一台普通电脑几小时就能生成币。等竞争者多了、自动调整把难度推上去，就会难得多。生成的币必须等 120 个区块成熟后才能花。",
  "text_en": "You can get coins by getting someone to send you some, or turn on Options->Generate Coins to run a node and generate blocks. I made the proof-of-work difficulty ridiculously easy to start with, so for a little while in the beginning a typical PC will be able to generate coins in just a few hours. It'll get a lot harder when competition makes the automatic adjustment drive up the difficulty. Generated coins must wait 120 blocks to mature before they can be spent.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/16/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2009-11-22",
  "context": "BitcoinTalk · Re: Repost: Bitcoin Maturation",
  "text_zh": "把它想成众人合作打造一条链。你要加一环，必须先找到链的当前末端。如果你找到最后一环，转身花一小时锻造你那一环，回来把它接在你离开时的末端上——别人可能已经接了好几环，他们才不想要你这条从中间岔出去的分叉环。",
  "text_en": "Think of it as a cooperative effort to make a chain.  When you add a link, you must first find the current end of the chain.  If you were to locate the last link, then go off for an hour and forge your link, come back and link it to the link that was the end an hour ago, others may have added several links since then and they're not going to want to use your link that now branches off the middle.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/8/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2009-12-12",
  "context": "BitcoinTalk · Re: A few suggestions",
  "text_zh": "全网每天生成的币平均总数不变。更快的机器，只是分到比慢机器更大的份额。如果所有人都换了更快的机器，每个人拿到的币并不会比原来多。",
  "text_en": "The average total coins generated across the network per day stays the same.  Faster machines just get a larger share than slower machines.  If everyone bought faster machines, they wouldn't get more coins than before.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/20/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2009-12-12",
  "context": "BitcoinTalk · Re: A few suggestions",
  "text_zh": "为了网络好，我们应该有个君子协定：尽可能推迟 GPU 军备竞赛。如果新用户不用折腾显卡驱动和兼容性，上手会容易得多。现在这样挺好——只要有 CPU，人人都能公平竞争。",
  "text_en": "We should have a gentleman's agreement to postpone the GPU arms race as long as we can for the good of the network.  It's much easer to get new users up to speed if they don't have to worry about GPU drivers and compatibility.  It's nice how anyone with just a CPU can compete fairly equally right now.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/20/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2010-02-14",
  "context": "BitcoinTalk · Re: What's with this odd generation?",
  "text_zh": "要是心疼那点手续费，不妨换个思路：自己跑个节点，说不定哪天你也能收上 0.44 的手续费。",
  "text_en": "If you're sad about paying the fee, you could always turn the tables and run a node yourself and maybe someday rake in a 0.44 fee yourself.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/56/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2010-08-09",
  "context": "BitcoinTalk · Re: Bitcoin minting is thermodynamically perverse",
  "text_zh": "如果你本来就要给家里供暖，电脑的热量就不是浪费。如果你们家用电供暖，那电脑的热量一点也不浪费——用电和用电脑发热，成本是一样的。\n如果你家有比电暖更便宜的取暖方式，那浪费的只是差价。\n如果是夏天开空调，那就是双倍开销。\n比特币生成最终会流向成本最低的地方。也许是寒冷地区、用电供暖的地方——在那里，成本几乎为零。",
  "text_en": "The heat from your computer is not wasted if you need to heat your home.  If you're using electric heat where you live, then your computer's heat isn't a waste.  It's equal cost if you generate the heat with your computer. \nIf you have other cheaper heating than electric, then the waste is only the difference in cost.\nIf it's summer and you're using A/C, then it's twice. \nBitcoin generation should end up where it's cheapest.  Maybe that will be in cold climates where there's electric heat, where it would be essentially free.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/337/"
 },
 {
  "category_zh": "挖矿",
  "category_en": "Mining",
  "date": "2010-08-15",
  "context": "BitcoinTalk · Re: Potential disaster scenario",
  "text_zh": "生成币最终会聚集到这几类地方：\n1）成本最低或免费的地方\n2）出于理念想帮忙的人\n3）想拿币、又懒得做交易去买的人\n\n确实有一些正当的免费场景。凡是用电供暖的地方，生成币基本就是免费的——因为电脑的热量抵消了踢脚线电暖器的耗电。很多小公寓图省事都用电暖。",
  "text_en": "Some places where generation will gravitate to: \n1) places where it's cheapest or free\n2) people who want to help for idealogical reasons\n3) people who want to get some coins without the inconvenience of doing a transaction to buy them\n\nThere are legitimate places where it's free.  Generation is basically free anywhere that has electric heat, since your computer's heat is offsetting your baseboard electric heating.  Many small flats have electric heat out of convenience.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/364/"
 },
 {
  "category_zh": "动机",
  "category_en": "Motives",
  "date": "2008-11-07",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "是的，但我们可以在这场军备竞赛中赢得一场重大战役，并赢得数年之久的一片新的自由领地。",
  "text_en": "Yes, but we can win a major battle in the arms race and gain a new territory of freedom for several years.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/4/"
 },
 {
  "category_zh": "动机",
  "category_en": "Motives",
  "date": "2008-11-13",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "如果能把它解释清楚，它对自由意志主义的观点很有吸引力。不过我更擅长写代码，不擅长言辞。",
  "text_en": "It's very attractive to the libertarian viewpoint if we can explain it properly. I'm better with code than with words though.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/12/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "节点始终将最长链视为正确的链，并持续在其上扩展工作。如果两个节点同时广播了下一个区块的不同版本，一些节点可能先收到其中一个。在这种情况下，它们先在收到的第一个区块上工作，但把另一个分支保存下来，以防它后来变长。当下一个工作量证明被找到、其中一个分支变长时，僵局就会打破；那些在另一分支上工作的节点随后就会切换到更长的那条。",
  "text_en": "Nodes always consider the longest chain to be the correct one and will keep working on extending it. If two nodes broadcast different versions of the next block simultaneously, some nodes may receive one or the other first. In that case, they work on the first one they received, but save the other branch in case it becomes longer. The tie will be broken when the next proof-of-work is found and one branch becomes longer; the nodes that were working on the other branch will then switch to the longer one.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "网络以其无结构的简单性而健壮。节点无需太多协调，同时并行工作。它们不需要被识别，因为消息不发往任何特定地点，只需尽力送达即可。节点可以随意离开并重新加入网络，接受工作量证明链作为它们离线期间所发生之事的证明。它们用 CPU 算力投票：通过在有效区块上继续扩展工作来表达对其的接受，通过拒绝在无效区块上工作来拒绝它们。所有必要的规则和激励都可以通过这种共识机制来执行。",
  "text_en": "The network is robust in its unstructured simplicity. Nodes work all at once with little coordination. They do not need to be identified, since messages are not routed to any particular place and only need to be delivered on a best effort basis. Nodes can leave and rejoin the network at will, accepting the proof-of-work chain as proof of what happened while they were gone. They vote with their CPU power, expressing their acceptance of valid blocks by working on extending them and rejecting invalid blocks by refusing to work on them. Any needed rules and incentives can be enforced with this consensus mechanism.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "无需运行完整的网络节点也能验证支付。用户只需保留最长工作量证明链的区块头副本——通过向网络节点查询，直到确信自己拥有最长链——并获取将交易与其所处区块的时间戳关联起来的默克尔分支。他无法亲自核验交易，但通过把它锚定在链上的某个位置，他可以看到已有网络节点接受了它，而之后追加的区块则进一步证实了网络的接受。\n\n因此，只要诚实节点控制着网络，这种验证就是可靠的；但如果网络被攻击者压倒，风险就更大。虽然网络节点可以亲自验证交易，但简化的方法可能被攻击者伪造的交易所欺骗——只要攻击者能持续压制网络。一种防范策略是：当网络节点检测到无效区块时发出警报，促使用户的软件下载完整区块和被警示的交易，以确认不一致。经常收款的商户可能仍希望运行自己的节点，以获得更独立的安全性和更快的验证。",
  "text_en": "It is possible to verify payments without running a full network node. A user only needs to keep a copy of the block headers of the longest proof-of-work chain, which he can get by querying network nodes until he's convinced he has the longest chain, and obtain the Merkle branch linking the transaction to the block it's timestamped in. He can't check the transaction for himself, but by linking it to a place in the chain, he can see that a network node has accepted it, and blocks added after it further confirm the network has accepted it. \nAs such, the verification is reliable as long as honest nodes control the network, but is more vulnerable if the network is overpowered by an attacker. While network nodes can verify transactions for themselves, the simplified method can be fooled by an attacker's fabricated transactions for as long as the attacker can continue to overpower the network. One strategy to protect against this would be to accept alerts from network nodes when they detect an invalid block, prompting the user's software to download the full block and alerted transactions to confirm the inconsistency. Businesses that receive frequent payments will probably still want to run their own nodes for more independent security and quicker verification.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "运行网络的步骤如下：\n\n1. 新交易被广播到所有节点。\n2. 每个节点把新交易收集进一个区块。\n3. 每个节点为其区块寻找一个困难的工作量证明。\n4. 当某个节点找到工作量证明，就把区块广播到所有节点。\n5. 只有当区块中的所有交易都有效且尚未被花费，节点才接受该区块。\n6. 节点通过在该链上创建下一个区块来表达对其的接受，使用已接受区块的哈希作为前一哈希。",
  "text_en": "The steps to run the network are as follows:\n\n1. New transactions are broadcast to all nodes.\n2. Each node collects new transactions into a block.\n3. Each node works on finding a difficult proof-of-work for its block.\n4. When a node finds a proof-of-work, it broadcasts the block to all nodes.\n5. Nodes accept the block only if all transactions in it are valid and not already spent.\n6. Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们需要一种让收款方知道先前的所有者没有签署过更早的交易的方法。对我们而言，最早的交易才是算数的那一笔，所以我们不关心后来的双重支付企图。确认一笔交易不存在的唯一方式，是知晓所有交易。在基于铸币机构的模型中，铸币机构知晓所有交易并决定哪一笔先到。为了在没有可信第三方的情况下实现这一点，交易必须公开宣布，而且我们需要一套系统，让参与者就接收到的交易顺序的唯一历史达成一致。收款方需要证明：在每笔交易发生时，多数节点都同意它是第一个收到的。",
  "text_en": "We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don't care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced, and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-02",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "起初，大多数用户都会运行网络节点，但当网络增长超过一定规模后，这件事会越来越多地留给拥有服务器机房和专用硬件的专家。服务器机房只需要在网络上有一个节点，机房内的其余局域网设备都连接到这个节点。",
  "text_en": "At first, most users would run network nodes, but as the network grows beyond a certain point, it would be left more and more to specialists with server farms of specialized hardware. A server farm would only need to have one node on the network and the rest of the LAN connects with that one node.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/2/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-02",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "只有想创造新币的人才需要运行网络节点。",
  "text_en": "Only people trying to create new coins would need to run network nodes.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/2/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "当节点收到一个区块，会对照区块中以往交易检查其中每一笔交易的签名。区块只能包含依赖于以往区块（或同一区块）中有效交易的那些交易。交易 C 可以依赖同一区块中的交易 B，而 B 依赖更早区块中的交易 A。",
  "text_en": "When a node receives a block, it checks the signatures of every transaction in it against previous transactions in blocks. Blocks can only contain transactions that depend on valid transactions in previous blocks or the same block. Transaction C could depend on transaction B in the same block and B depends on transaction A in an earlier block.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "没错，节点会把交易保留在自己的工作集中，直到它们被收进区块。如果一笔交易到达了 90% 的节点，那么每当一个新区块被找到，它就有 90% 的概率被收进其中。",
  "text_en": "Right, nodes keep transactions in their working set until they get into a block. If a transaction reaches 90% of nodes, then each time a new block is found, it has a 90% chance of being in it.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "必须严格规定：最长链始终被视为有效链。在场的节点可能记得某个分支先出现、后来被另一分支取代，但它们无法让不在场的人信服这一点。我们不能让节点出现派系分化：一部分人固执地认准自己先看到的分支，另一部分人先看到另一个分支，还有后来加入、从未见证过当时情形的人。CPU 算力的工作量证明投票必须拥有最终话语权。要让所有人保持一致，唯一的办法就是认定最长链始终是有效的链，无论发生什么。",
  "text_en": "It is strictly necessary that the longest chain is always considered the valid one. Nodes that were present may remember that one branch was there first and got replaced by another, but there would be no way for them to convince those who were not present of this. We can't have subfactions of nodes that cling to one branch that they think was first, others that saw another branch first, and others that joined later and never saw what happened. The CPU power proof-of-work vote must have the final say. The only way for everyone to stay on the same page is to believe that the longest chain is always the valid one, no matter what.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "交易会迅速在全网传播，所以如果同一笔交易有两个版本在接近同一时间被报告，先出发的那个会在率先到达更多节点方面占据巨大优势。节点只会接受自己先看到的那个，拒绝后来到达的第二个版本，因此更早的交易会有多得多的节点努力把它收进下一个工作量证明。实际上，每个节点都通过把它先看到的交易纳入自己的工作量证明工作，为自己的观点投票。如果两笔交易确实在同一时间到来、平分秋色，那就是一场抛硬币：看哪个先进入工作量证明，就由它决定哪个有效。",
  "text_en": "A transaction will quickly propagate throughout the network, so if two versions of the same transaction were reported at close to the same time, the one with the head start would have a big advantage in reaching many more nodes first. Nodes will only accept the first one they see, refusing the second one to arrive, so the earlier transaction would have many more nodes working on incorporating it into the next proof-of-work. In effect, each node votes for its viewpoint of which transaction it saw first by including it in its proof-of-work effort. If the transactions did come at exactly the same time and there was an even split, it's a toss up based on which gets into a proof-of-work first, and that decides which is valid.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/8/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "当某个节点找到工作量证明，新区块就会在全网传播，每个人都把它加到链上，开始在它之后工作下一个区块。那些手里拿着另一笔交易的节点会停止尝试把它收进区块，因为按照被接受的链，它现在已经无效。",
  "text_en": "When a node finds a proof-of-work, the new block is propagated throughout the network and everyone adds it to the chain and starts working on the next block after it. Any nodes that had the other transaction will stop trying to include it in a block, since it's now invalid according to the accepted chain.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/8/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-11",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "有了我最近发布的那套基于交易费的激励系统，节点就有动力把收到的所有付费交易都收进区块。",
  "text_en": "With the transaction fee based incentive system I recently posted, nodes would have an incentive to include all the paying transactions they receive.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/10/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2008-11-14",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "广播大概率会非常可靠。如今 TCP 传输极少丢包，而且广播协议带有重试机制，一段时间后可以从其他节点获取数据。如果实践中广播比预期更慢，可能就得延长区块之间的目标时间，避免浪费算力。我们希望区块通常在远小于其生成时间的时间内传播完毕，否则节点会把太多时间花在过时的区块上。",
  "text_en": "Broadcasts will probably be almost completely reliable. TCP transmissions are rarely ever dropped these days, and the broadcast protocol has a retry mechanism to get the data from other nodes after a while. If broadcasts turn out to be slower in practice than expected, the target time between blocks may have to be increased to avoid wasting resources. We want blocks to usually propagate in much less time than it takes to generate them, otherwise nodes would spend too much time working on obsolete blocks.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/12/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2009-01-09",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "如果你能保持一个接受入站连接的节点运行，那真是给网络帮了大忙。防火墙上需要打开 8333 端口以接收入站连接。",
  "text_en": "If you can keep a node running that accepts incoming connections, you'll really be helping the network a lot. Port 8333 on your firewall needs to be open to receive incoming connections.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/16/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2010-02-14",
  "context": "BitcoinTalk · Re: What's with this odd generation?",
  "text_zh": "如果你对付手续费感到心疼，随时可以反过来自己运行一个节点，也许某天你也能大赚一笔 0.44 的手续费。",
  "text_en": "If you're sad about paying the fee, you could always turn the tables and run a node yourself and maybe someday rake in a 0.44 fee yourself.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/56/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2010-07-14",
  "context": "BitcoinTalk · Re: Scalability",
  "text_zh": "设计方案勾勒了一种不需要完整区块链的轻量客户端。在设计 PDF 里它叫\"简化支付验证\"（Simplified Payment Verification）。轻量客户端可以发送和接收交易，只是不能生成区块。它不需要信任某个节点来验证支付，自己就能验证。\n\n轻量客户端还没实现，但计划在需要的时候实现。目前大家都还是运行完整的网络节点。",
  "text_en": "The design outlines a lightweight client that does not need the full block chain.  In the design PDF it's called Simplified Payment Verification.  The lightweight client can send and receive transactions, it just can't generate blocks.  It does not need to trust a node to verify payments, it can still verify them itself. \nThe lightweight client is not implemented yet, but the plan is to implement it when it's needed.  For now, everyone just runs a full network node.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/188/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2010-07-14",
  "context": "BitcoinTalk · Re: Scalability",
  "text_zh": "在达到均衡规模时，许多节点会是服务器机房——一两个网络节点通过局域网为机房内其余设备提供服务。",
  "text_en": "At equilibrium size, many nodes will be server farms with one or two network nodes that feed the rest of the farm over a LAN.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/188/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2010-07-14",
  "context": "BitcoinTalk · Re: Scalability",
  "text_zh": "我预计节点总数永远不会超过 10 万，可能更少。它会达到一个均衡：再多节点加入就不划算了。其余的将是轻量客户端，可能达到数百万。",
  "text_en": "I anticipate there will never be more than 100K nodes, probably less.  It will reach an equilibrium where it's not worth it for more nodes to join in.  The rest will be lightweight clients, which could be millions.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/188/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2010-07-29",
  "context": "BitcoinTalk · Re: Scalability and transaction rate",
  "text_zh": "当前每个用户都是一个网络节点的系统，并非为大规模场景设计的配置。这就像每个 Usenet 用户都运行自己的 NNTP 服务器一样。设计支持让用户就做用户。运行节点的负担越重，节点就会越少。那少数节点将是大型服务器机房，其余的则是只做交易、不生成区块的客户端节点。",
  "text_en": "The current system where every user is a network node is not the intended configuration for large scale.  That would be like every Usenet user runs their own NNTP server.  The design supports letting users just be users.  The more burden it is to run a node, the fewer nodes there will be.  Those few nodes will be big server farms.  The rest will be client nodes that only do transactions and don't generate.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/287/"
 },
 {
  "category_zh": "节点",
  "category_en": "Nodes",
  "date": "2010-09-07",
  "context": "BitcoinTalk · Re: Always pay transaction fee?",
  "text_zh": "另一个办法是减少每个区块允许的免费交易数量，超过之后就必须收交易费。节点每个区块只收这么多 KB 的免费交易，之后就要求至少 0.01 的交易费。这个阈值大概应该比现在更低一些。我认为阈值永远不该是 0——至少应该永远允许一些免费交易。",
  "text_en": "Another option is to reduce the number of free transactions allowed per block before transaction fees are required.  Nodes only take so many KB of free transactions per block before they start requiring at least 0.01 transaction fee. The threshold should probably be lower than it currently is. I don't think the threshold should ever be 0.  We should always allow at least some free transactions.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/439/"
 },
 {
  "category_zh": "P2P网络",
  "category_en": "P2P Networks",
  "date": "2008-11-07",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "政府擅长砍掉像 Napster 这样中央控制网络的头，但纯粹的 P2P 网络如 Gnutella 和 Tor 似乎都能站稳脚跟。",
  "text_en": "Governments are good at cutting off the heads of a centrally controlled networks like Napster, but pure P2P networks like Gnutella and Tor seem to be holding their own.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/4/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "作为一道额外的防火墙，每笔交易都应使用新的密钥对，以防止它们被关联到同一个所有者。多输入交易仍不可避免地会产生关联，因为它必然暴露其输入属于同一所有者。风险在于：如果某个密钥的所有者身份被揭露，关联分析就可能暴露属于同一所有者的其他交易。",
  "text_en": "As an additional firewall, a new key pair should be used for each transaction to keep them from being linked to a common owner. Some linking is still unavoidable with multi-input transactions, which necessarily reveal that their inputs were owned by the same owner. The risk is that if the owner of a key is revealed, linking could reveal other transactions that belonged to the same owner.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "传统银行模式通过把信息访问限制在相关方和可信第三方之间来实现一定程度的隐私。所有交易都必须公开宣布，这就排除了这种做法，但隐私仍可以在另一个环节上保全：让公钥保持匿名。公众能看到有人向另一个人发送了一笔金额，但没有任何信息能把这笔交易和任何人联系起来。这与证券交易所发布的信息类似：每笔交易的成交时间和规模（即\"行情带\"）是公开的，但不透露交易双方是谁。",
  "text_en": "The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous. The public can see that someone is sending an amount to someone else, but without information linking the transaction to anyone. This is similar to the level of information released by stock exchanges, where the time and size of individual trades, the \"tape\", is made public, but without telling who the parties were.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "我们必须信任银行来保管我们的钱并以电子方式转移它，但它们却以几乎没有准备金的信用泡沫一轮轮地放贷。我们必须信任它们保护我们的隐私，信任它们不让身份窃贼掏空我们的账户。它们庞大的运营成本让小额支付成为不可能。",
  "text_en": "Banks must be trusted to hold our money and transfer it electronically, but they lend it out in waves of credit bubbles with barely a fraction in reserve. We have to trust them with our privacy, trust them not to let identity thieves drain our accounts. Their massive overhead costs make micropayments impossible.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2009-11-25",
  "context": "BitcoinTalk · Re: Repost: How anonymous are bitcoins?",
  "text_zh": "为了更好的隐私，比特币地址最好只使用一次。",
  "text_en": "For greater privacy, it's best to use bitcoin addresses only once.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/11/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2010-02-06",
  "context": "BitcoinTalk · Re: Repost: Request: Make this anonymous?",
  "text_zh": "如果你不想让任何人知道你在使用比特币，可以用 TOR。",
  "text_en": "You could use TOR if you don't want anyone to know you're even using Bitcoin.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/45/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2010-02-06",
  "context": "BitcoinTalk · Re: Repost: Request: Make this anonymous?",
  "text_zh": "比特币还非常新，尚未经过独立分析。如果你真的在意隐私，使用 TOR 是明智的预防措施。",
  "text_en": "Bitcoin is still very new and has not been independently analysed.  If you're serious about privacy, TOR is an advisable precaution.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/45/"
 },
 {
  "category_zh": "隐私",
  "category_en": "Privacy",
  "date": "2010-08-11",
  "context": "BitcoinTalk · Re: Not a suggestion",
  "text_zh": "很难想出在这个场景里怎么应用零知识证明。",
  "text_en": "It's hard to think of how to apply zero-knowledge-proofs in this case.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/339/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们考虑这样一种情形：攻击者试图生成一条比诚实链更快的替代链。即使成功了，系统也不会因此被随意篡改——比如凭空创造价值，或者夺取从不属于攻击者的钱。节点不会接受无效交易作为支付，诚实节点也绝不会接受包含它们的区块。攻击者唯一能做的，是试图更改自己的一笔交易，拿回他最近花掉的钱。",
  "text_en": "We consider the scenario of an attacker trying to generate an alternate chain faster than the honest chain. Even if this is accomplished, it does not throw the system open to arbitrary changes, such as creating value out of thin air or taking money that never belonged to the attacker. Nodes are not going to accept an invalid transaction as payment, and honest nodes will never accept a block containing them. An attacker can only try to change one of his own transactions to take back money he recently spent.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们提出用点对点网络解决双重支付问题。网络通过把交易哈希进一条持续的、基于哈希的工作量证明链来为交易打上时间戳，形成一条不重做工作量证明就无法更改的记录。最长链不仅证明了所见证的事件序列，还证明它来自最大的 CPU 算力池。只要多数 CPU 算力由不合谋攻击网络的节点控制，它们就会生成最长链并超越攻击者。网络本身只需要极简的结构。",
  "text_en": "We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "在本文中，我们提出用点对点分布式时间戳服务器解决双重支付问题，以计算生成交易时间顺序的证明。只要诚实节点集体控制的 CPU 算力超过任何合谋的攻击者节点群体，系统就是安全的。",
  "text_en": "In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "要在点对点的基础上实现分布式时间戳服务器，我们需要使用类似 Adam Back 的 Hashcash 那样的工作量证明系统，而不是报纸或 Usenet 帖子。工作量证明要扫描出一个值，使得它被哈希（如 SHA-256）后，哈希以若干个零比特开头。所需的平均工作量随零比特数指数增长，而验证只需执行一次哈希。",
  "text_en": "To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proof-of-work system similar to Adam Back's Hashcash, rather than newspaper or Usenet posts. The proof-of-work involves scanning for a value that when hashed, such as with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required and can be verified by executing a single hash.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "在我们的时间戳网络中，工作量证明的实现方式是：不断递增区块中的 nonce，直到找到一个值，使该区块的哈希满足所需的零比特数。一旦付出的 CPU 努力让区块满足了工作量证明，不重做这份工作就无法更改该区块。随着后来的区块链接其后，要更改该区块就得重做它之后所有区块的工作。",
  "text_en": "For our timestamp network, we implement the proof-of-work by incrementing a nonce in the block until a value is found that gives the block's hash the required zero bits. Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. As later blocks are chained after it, the work to change the block would include redoing all the blocks after it.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "工作量证明还解决了多数决策中代表权确定的问题。如果多数基于\"一 IP 一票\"，任何人只要能分配大量 IP 就能颠覆它。工作量证明本质上是\"一 CPU 一票\"。多数决策由最长链来代表——它投入了最大的工作量证明努力。如果多数 CPU 算力由诚实节点控制，诚实链会增长得最快，超越任何竞争链。要修改过去的区块，攻击者必须重做该区块及其后所有区块的工作量证明，然后追上并超过诚实节点的工作量。我们稍后会证明：较慢的攻击者追赶成功的概率，会随着后续区块的增加呈指数下降。",
  "text_en": "The proof-of-work also solves the problem of determining representation in majority decision making. If the majority were based on one-IP-address-one-vote, it could be subverted by anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote. The majority decision is represented by the longest chain, which has the greatest proof-of-work effort invested in it. If a majority of CPU power is controlled by honest nodes, the honest chain will grow the fastest and outpace any competing chains. To modify a past block, an attacker would have to redo the proof-of-work of the block and all blocks after it and then catch up with and surpass the work of the honest nodes. We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "为了补偿硬件速度的提升和长期以来运行节点意愿的变化，工作量证明的难度由一个移动平均值决定，目标是每小时平均生成若干个区块。如果生成太快，难度就会上升。",
  "text_en": "To compensate for increasing hardware speed and varying interest in running nodes over time, the proof-of-work difficulty is determined by a moving average targeting an average number of blocks per hour. If they're generated too fast, the difficulty increases.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "运行网络的步骤如下：\n\n1. 新交易被广播到所有节点。\n2. 每个节点把新交易收集进一个区块。\n3. 每个节点为其区块寻找一个困难的工作量证明。\n4. 当某个节点找到工作量证明，就把区块广播到所有节点。\n5. 只有当区块中的所有交易都有效且尚未被花费，节点才接受该区块。\n6. 节点通过在该链上创建下一个区块来表达对其的接受，使用已接受区块的哈希作为前一哈希。",
  "text_en": "The steps to run the network are as follows:\n\n1. New transactions are broadcast to all nodes.\n2. Each node collects new transactions into a block.\n3. Each node works on finding a difficult proof-of-work for its block.\n4. When a node finds a proof-of-work, it broadcasts the block to all nodes.\n5. Nodes accept the block only if all transactions in it are valid and not already spent.\n6. Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "节点始终将最长链视为正确的链，并持续在其上扩展工作。如果两个节点同时广播了下一个区块的不同版本，一些节点可能先收到其中一个。在这种情况下，它们先在收到的第一个区块上工作，但把另一个分支保存下来，以防它后来变长。当下一个工作量证明被找到、其中一个分支变长时，僵局就会打破；那些在另一分支上工作的节点随后就会切换到更长的那条。",
  "text_en": "Nodes always consider the longest chain to be the correct one and will keep working on extending it. If two nodes broadcast different versions of the next block simultaneously, some nodes may receive one or the other first. In that case, they work on the first one they received, but save the other branch in case it becomes longer. The tie will be broken when the next proof-of-work is found and one branch becomes longer; the nodes that were working on the other branch will then switch to the longer one.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "工作量证明链本身就是不言自明的证据，证明它来自全球共享的视图。只有全网多数节点合在一起，才有足够的 CPU 算力生成如此困难的工作量证明链。任何用户在收到工作量证明链后，都能看到全网多数认可了什么。一旦一笔交易被哈希进链上往后数几个链接的位置，它就被牢牢地刻进了全球历史。",
  "text_en": "The proof-of-work chain is itself self-evident proof that it came from the globally shared view. Only the majority of the network together has enough CPU power to generate such a difficult chain of proof-of-work. Any user, upon receiving the proof-of-work chain, can see what the majority of the network has approved. Once a transaction is hashed into a link that's a few links back in the chain, it is firmly etched into the global history.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/8/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "必须严格规定：最长链始终被视为有效链。在场的节点可能记得某个分支先出现、后来被另一分支取代，但它们无法让不在场的人信服这一点。我们不能让节点出现派系分化：一部分人固执地认准自己先看到的分支，另一部分人先看到另一个分支，还有后来加入、从未见证过当时情形的人。CPU 算力的工作量证明投票必须拥有最终话语权。要让所有人保持一致，唯一的办法就是认定最长链始终是有效的链，无论发生什么。",
  "text_en": "It is strictly necessary that the longest chain is always considered the valid one. Nodes that were present may remember that one branch was there first and got replaced by another, but there would be no way for them to convince those who were not present of this. We can't have subfactions of nodes that cling to one branch that they think was first, others that saw another branch first, and others that joined later and never saw what happened. The CPU power proof-of-work vote must have the final say. The only way for everyone to stay on the same page is to believe that the longest chain is always the valid one, no matter what.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "工作量证明链是同步问题的解决方案，也是无需信任任何人就能知晓全球共享视图的方案。",
  "text_en": "The proof-of-work chain is the solution to the synchronisation problem, and to knowing what the globally shared view is without having to trust anyone.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/8/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "当某个节点找到工作量证明，新区块就会在全网传播，每个人都把它加到链上，开始在它之后工作下一个区块。那些手里拿着另一笔交易的节点会停止尝试把它收进区块，因为按照被接受的链，它现在已经无效。",
  "text_en": "When a node finds a proof-of-work, the new block is propagated throughout the network and everyone adds it to the chain and starts working on the next block after it. Any nodes that had the other transaction will stop trying to include it in a block, since it's now invalid according to the accepted chain.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/8/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-13",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "工作量证明链是拜占庭将军问题的解决方案。我试着在那个语境下重新表述一下。\n\n若干位拜占庭将军每人有一台计算机，想通过暴力破解国王 Wi-Fi 的密码来攻击它——他们已得知密码是固定长度的。一旦他们刺激网络生成一个数据包，就必须在有限时间内破解密码、潜入并清除日志，否则就会被发现、惹上麻烦。只有多数人同时攻击，他们的 CPU 算力才够快，足以及时破解。\n\n他们不太在乎攻击具体在什么时候，只希望达成一致。已经决定：任何想宣布时间的人都可以宣布，第一个被听到的时间就是官方攻击时间。问题在于网络不是瞬时的，如果两位将军在接近同一时间宣布了不同的攻击时间，有人会先听到这个，有人会先听到那个。他们用工作量证明链来解决这个问题。每位将军收到自己先听到的攻击时间后，就让计算机去解一道极难的工作量证明题——该题的哈希包含这个攻击时间。工作量证明难到预计要他们全体一起工作 10 分钟，才能有一人找到解。一旦某位将军找到工作量证明，他就把它广播到全网，大家把当前正在算的工作量证明改成包含这个工作量证明的哈希。如果有人在算另一个攻击时间，就切换到这个，因为它的工作量证明链现在更长了。\n\n两小时后，某个攻击时间应该已经被一条包含 12 个工作量证明的链哈希过。每位将军只需验证工作量证明链的难度，就能估算出它耗费了多少并行 CPU 算力/小时，并看出要在规定时间内产出这么多工作量证明，必定需要多数计算机参与。他们一定都见过它，因为工作量证明就是他们为之工作过的证明。如果工作量证明链展现的 CPU 算力足以破解密码，他们就可以放心地在约定的时间发动攻击。\n\n工作量证明链就是你们问到的所有同步问题、分布式数据库问题和全局视图问题的解法。",
  "text_en": "The proof-of-work chain is a solution to the Byzantine Generals' Problem. I'll try to rephrase it in that context.\nA number of Byzantine Generals each have a computer and want to attack the King's wi-fi by brute forcing the password, which they've learned is a certain number of characters in length. Once they stimulate the network to generate a packet, they must crack the password within a limited time to break in and erase the logs, otherwise they will be discovered and get in trouble. They only have enough CPU power to crack it fast enough if a majority of them attack at the same time. \n They don't particularly care when the attack will be, just that they all agree. It has been decided that anyone who feels like it will announce a time, and whatever time is heard first will be the official attack time. The problem is that the network is not instantaneous, and if two generals announce different attack times at close to the same time, some may hear one first and others hear the other first. They use a proof-of-work chain to solve the problem. Once each general receives whatever attack time he hears first, he sets his computer to solve an extremely difficult proof-of-work problem that includes the attack time in its hash. The proof-of-work is so difficult, it's expected to take 10 minutes of them all working at once before one of them finds a solution. Once one of the generals finds a proof-of-work, he broadcasts it to the network, and everyone changes their current proof-of-work computation to include that proof-of-work in the hash they're working on. If anyone was working on a different attack time, they switch to this one, because its proof-of-work chain is now longer.\n After two hours, one attack time should be hashed by a chain of 12 proofs-of-work. Every general, just by verifying the difficulty of the proof-of-work chain, can estimate how much parallel CPU power per hour was expended on it and see that it must have required the majority of the computers to produce that much proof-of-work in the allotted time. They had to all have seen it because the proof-of-work is proof that they worked on it. If the CPU power exhibited by the proof-of-work chain is sufficient to crack the password, they can safely attack at the agreed time.\n The proof-of-work chain is how all the synchronisation, distributed database and global view problems you've asked about are solved.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/11/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "确立一个人真实身份的凭证，是提供 CPU 算力的能力。",
  "text_en": "The credential that establishes someone as real is the ability to supply CPU power.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/14/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "工作量证明是 Hashcash 风格的 SHA-256 碰撞寻找。它是一个无记忆过程：你每秒做数百万次哈希，每次都有很小的概率找到解。最快的 3 或 4 个节点的主导地位，只与其占总 CPU 算力的份额成正比。任何人在任何时刻找到解的概率，都与其 CPU 算力成正比。",
  "text_en": "The proof-of-work is a Hashcash style SHA-256 collision finding. It's a memoryless process where you do millions of hashes a second, with a small chance of finding one each time. The 3 or 4 fastest nodes' dominance would only be proportional to their share of the total CPU power. Anyone's chance of finding a solution at any time is proportional to their CPU power.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2010-08-07",
  "context": "BitcoinTalk · Re: Bitcoin minting is thermodynamically perverse",
  "text_zh": "工作量证明有个很好的特性：它可以通过不可信的中间人转交。我们不必担心通信的保管链条。无论是谁告诉你一条最长链都无关紧要，工作量证明自己会说话。",
  "text_en": "Proof-of-work has the nice property that it can be relayed through untrusted middlemen.  We don't have to worry about a chain of custody of communication.  It doesn't matter who tells you a longest chain, the proof-of-work speaks for itself.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/327/"
 },
 {
  "category_zh": "工作量证明",
  "category_en": "Proof-of-Work",
  "date": "2010-08-16",
  "context": "BitcoinTalk · Re: checkpointing the block chain",
  "text_zh": "软件没有办法自动判断哪条链更好，除了看谁的工作量证明最大。在设计中，它必须切换到更长的链，无论要回溯多远。",
  "text_en": "There is no way for the software to automatically know if one chain is better than another except by the greatest proof-of-work.  In the design it was necessary for it to switch to a longer chain no matter how far back it has to go.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/394/"
 },
 {
  "category_zh": "版本发布",
  "category_en": "Releases",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "我会尽量加快进度，尽快发布源代码，作为澄清所有这些实现问题的参考。",
  "text_en": "I'll try and hurry up and release the sourcecode as soon as possible to serve as a reference to help clear up all these implementation questions.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "版本发布",
  "category_en": "Releases",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "过去一年半里，我在写代码的同时已经解决了所有那些细节问题，而且数量非常多。论文里没有涵盖功能细节，但源代码很快就会发布。我已把主要文件发给你。（目前可按需索取，完整版即将发布）",
  "text_en": "I believe I've worked through all those little details over the last year and a half while coding it, and there were a lot of them. The functional details are not covered in the paper, but the sourcecode is coming soon. I sent you the main files. (available by request at the moment, full release soon)",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/15/"
 },
 {
  "category_zh": "版本发布",
  "category_en": "Releases",
  "date": "2009-01-09",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "宣布比特币第一个版本发布：这是一个利用点对点网络防止双重支付的新型电子现金系统。它是完全去中心化的，没有服务器，也没有中央权威机构。",
  "text_en": "Announcing the first release of Bitcoin, a new electronic cash system that uses a peer-to-peer network to prevent double-spending. It's completely decentralized with no server or central authority.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/16/"
 },
 {
  "category_zh": "版本发布",
  "category_en": "Releases",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "我开发了一个名为比特币的新型开源 P2P 电子现金系统。它是完全去中心化的，没有中央服务器，也没有可信方，因为一切都建立在密码学证明而非信任的基础上。试用一下，或看看截图和设计论文：\n\n在 http://www.bitcoin.org 下载比特币 v0.1",
  "text_en": "I've developed a new open source P2P e-cash system called Bitcoin. It's completely decentralized, with no central server or trusted parties, because everything is based on crypto proof instead of trust. Give it a try, or take a look at the screenshots and design paper: \n\nDownload Bitcoin v0.1 at http://www.bitcoin.org",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "版本发布",
  "category_en": "Releases",
  "date": "2010-05-26",
  "context": "BitcoinTalk · Re: Website translations",
  "text_zh": "有人愿意翻译比特币客户端本身吗？0.3 版本如果能至少再有一种语言就太好了。",
  "text_en": "Does anyone want to translate the Bitcoin client itself?  It would be great to have at least one other language in the 0.3 release.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/111/"
 },
 {
  "category_zh": "版本发布",
  "category_en": "Releases",
  "date": "2010-07-06",
  "context": "BitcoinTalk · Bitcoin 0.3 released!",
  "text_zh": "宣布比特币 0.3 版本发布，这是一种 P2P 加密货币！比特币是一种运用密码学和分布式网络取代可信中央服务器的数字货币。摆脱中央管理货币的任意通胀风险吧！比特币的总发行量上限为 2100 万枚。币会根据各节点贡献的 CPU 算力逐步释放给网络节点，所以你可以通过贡献闲置 CPU 时间来分得一份。",
  "text_en": "Announcing version 0.3 of Bitcoin, the P2P cryptocurrency!  Bitcoin is a digital currency using cryptography and a distributed network to replace the need for a trusted central server.  Escape the arbitrary inflation risk of centrally managed currencies!  Bitcoin's total circulation is limited to 21 million coins.  The coins are gradually released to the network's nodes based on the CPU power they contribute, so you can get a share of them by contributing your idle CPU time.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/168/"
 },
 {
  "category_zh": "可扩展性",
  "category_en": "Scalability",
  "date": "2010-07-14",
  "context": "BitcoinTalk · Re: Scalability",
  "text_zh": "设计方案中描绘了一种不需要完整区块链的轻量客户端。在设计论文 PDF 里，它叫作简易支付验证（SPV）。轻量客户端可以发送和接收交易，只是不生成区块。它验证支付时无需信任某个节点，自己就能验证。\n轻量客户端尚未实现，但计划在有需要时实现。目前大家都运行完整的网络节点。",
  "text_en": "The design outlines a lightweight client that does not need the full block chain.  In the design PDF it's called Simplified Payment Verification.  The lightweight client can send and receive transactions, it just can't generate blocks.  It does not need to trust a node to verify payments, it can still verify them itself. \nThe lightweight client is not implemented yet, but the plan is to implement it when it's needed.  For now, everyone just runs a full network node.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/188/"
 },
 {
  "category_zh": "可扩展性",
  "category_en": "Scalability",
  "date": "2010-07-14",
  "context": "BitcoinTalk · Re: Scalability",
  "text_zh": "我预计节点总数永远不会超过 10 万，可能更少。网络会达到一个均衡点：更多节点加入已不划算。其余的将是轻量客户端，可能达到数百万。",
  "text_en": "I anticipate there will never be more than 100K nodes, probably less.  It will reach an equilibrium where it's not worth it for more nodes to join in.  The rest will be lightweight clients, which could be millions.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/188/"
 },
 {
  "category_zh": "可扩展性",
  "category_en": "Scalability",
  "date": "2010-09-08",
  "context": "BitcoinTalk · Re: Always pay transaction fee?",
  "text_zh": "这个阈值将来很容易改动。时机成熟时我们可以决定提高它。把阈值保持在较低水平作为熔断器、需要时再提高，这是个好主意。如果现在就触及阈值，那几乎肯定是某种洪水攻击而非真实使用。保持较低的阈值有助于限制这种情况下浪费的磁盘空间。",
  "text_en": "The threshold can easily be changed in the future.  We can decide to increase it when the time comes.  It's a good idea to keep it lower as a circuit breaker and increase it as needed.  If we hit the threshold now, it would almost certainly be some kind of flood and not actual use.  Keeping the threshold lower would help limit the amount of wasted disk space in that event.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/441/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们需要一种办法，让收款人确信之前的拥有者没有签署过更早的交易。对我们而言，最早的交易才是有效的，所以我们不关心之后的双重支付企图。确认一笔交易不存在的唯一办法，就是知晓所有交易。在基于铸币厂的模型中，铸币厂知晓所有交易，并决定哪笔先到。要在没有可信方的情况下实现这一点，交易必须公开广播，并且需要一个让参与者就交易被接收顺序的唯一历史达成一致的系统。收款人需要证明：在每笔交易发生时，大多数节点都同意它是先被接收的那笔。",
  "text_en": "We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don't care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced, and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们把电子货币定义为一条数字签名链。每位拥有者将电子货币转让给下一位时，会对上一笔交易的哈希和下一位拥有者的公钥进行数字签名，并将签名附加到货币末尾。收款人可以通过验证签名来验证所有权链。",
  "text_en": "We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin. A payee can verify the signatures to verify the chain of ownership.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "值得注意的是，分叉（fan-out）在这里不是问题：即便一笔交易依赖于几笔交易，而那几笔交易又依赖于更多交易，也无妨。我们从不需要提取一笔交易的完整独立历史副本。",
  "text_en": "It should be noted that fan-out, where a transaction depends on several transactions, and those transactions depend on many more, is not a problem here. There is never the need to extract a complete standalone copy of a transaction's history.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "虽然可以逐个处理每枚货币，但为每分钱都单独做一笔交易太过笨拙。为了实现价值的拆分与合并，交易包含多个输入和输出。通常要么是来自一笔较大先前交易的单个输入，要么是合并多个小额的多个输入；输出至多两个：一个用于付款，另一个将找零（如果有）返还给发送者。",
  "text_en": "Although it would be possible to handle coins individually, it would be unwieldy to make a separate transaction for every cent in a transfer. To allow value to be split and combined, transactions contain multiple inputs and outputs. Normally there will be either a single input from a larger previous transaction or multiple inputs combining smaller amounts, and at most two outputs: one for the payment, and one returning the change, if any, back to the sender.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "新交易广播不一定非要触达所有节点。只要触达足够多的节点，它很快就会被纳入某个区块。区块广播对丢包也有容忍度。如果某个节点没收到某个区块，它在收到下一个区块并发现自己漏了一个时，会主动请求补回。",
  "text_en": "New transaction broadcasts do not necessarily need to reach all nodes. As long as they reach many nodes, they will get into a block before long. Block broadcasts are also tolerant of dropped messages. If a node does not receive a block, it will request it when it receives the next block and realizes it missed one.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们提出的方案始于一台时间戳服务器。时间戳服务器的工作方式是：对一批待加时间戳的条目取哈希，然后广泛公布该哈希，比如发表在报纸或 Usenet 帖子中。时间戳证明了数据在当时必然已经存在——显然，只有存在的数据才能被哈希。每个时间戳都会在自己的哈希中包含前一个时间戳，从而形成一条链，每新增一个时间戳都会强化之前的所有时间戳。",
  "text_en": "The solution we propose begins with a timestamp server. A timestamp server works by taking a hash of a block of items to be timestamped and widely publishing the hash, such as in a newspaper or Usenet post. The timestamp proves that the data must have existed at the time, obviously, in order to get into the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "传统银行模式通过将信息访问限制在相关方和可信第三方之间来实现一定程度的隐私。公开广播所有交易的要求排除了这种做法，但隐私仍可在另一处切断信息流来维持：保持公钥匿名。公众能看到有人把一笔钱转给了另一个人，但无法将交易与任何人关联起来。这类似于证券交易所披露的信息：每笔交易的时间和金额（即“纸带”）公开，但不透露交易双方是谁。",
  "text_en": "The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous. The public can see that someone is sending an amount to someone else, but without information linking the transaction to anyone. This is similar to the level of information released by stock exchanges, where the time and size of individual trades, the \"tape\", is made public, but without telling who the parties were.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "如果交易需要多等一个或几个周期才能进入区块，也不是问题。",
  "text_en": "It's not a problem if transactions have to wait one or a few extra cycles to get into a block.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/7/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "交易接收者通常需要持有交易约一小时或更久，以便让这种可能性有时间消除。他们仍可以立即转手这些币，但在发货等行动之前应当等待。",
  "text_en": "Receivers of transactions will normally need to hold transactions for perhaps an hour or more to allow time for this kind of possibility to be resolved. They can still re-spend the coins immediately, but they should wait before taking an action such as shipping goods.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-11-09",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "接收者只需沿区块链向后验证到足够深的深度，这通常只需要 2 笔交易的深度。此前的所有交易都可以丢弃。",
  "text_en": "The recipient just needs to verify it back to a depth that is sufficiently far back in the block chain, which will often only require a depth of 2 transactions. All transactions before that can be discarded.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/6/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-11-11",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "即时不可否认性并非其特性，但它依然比现有系统快得多。纸质支票可能一两周后才跳票。信用卡交易在 60 到 180 天内都可能被撤销。而比特币交易在一两小时内就可达到充分的不可逆转。",
  "text_en": "Instantant non-repudiability is not a feature, but it's still much faster than existing systems. Paper cheques can bounce up to a week or two later. Credit card transactions can be contested up to 60 to 180 days later. Bitcoin transactions can be sufficiently irreversible in an hour or two.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/10/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "基本交易就是第 2 节图中所见的样子：一个（买方）签名，满足上一笔交易中的公钥条件；以及一个（卖方）新公钥，下次花费时必须满足该公钥条件。",
  "text_en": "A basic transaction is just what you see in the figure in section 2. A signature (of the buyer) satisfying the public key of the previous transaction, and a new public key (of the seller) that must be satisfied to spend it the next time.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/13/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2008-11-17",
  "context": "Cryptography Mailing List · Bitcoin P2P e-cash paper",
  "text_zh": "如果商家真的遇到盗窃问题，可以让顾客等 2 分钟，或者等一封电子邮件，许多商家本来就这样做。如果想进一步优化，比如是大文件下载，他们可以在交易被证实为双重支付时中途取消下载。如果是网站访问，通常让顾客先用 5 分钟再视情况切断也不是什么大事——反正很多这类网站都有免费试用。",
  "text_en": "If a merchant actually has a problem with theft, they can make the customer wait 2 minutes, or wait for something in e-mail, which many already do. If they really want to optimize, and it's a large download, they could cancel the download in the middle if the transaction comes back double-spent. If it's website access, typically it wouldn't be a big deal to let the customer have access for 5 minutes and then cut off access if it's rejected. Many such sites have a free trial anyway.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/14/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2009-01-09",
  "context": "Cryptography Mailing List · Bitcoin v0.1 released",
  "text_zh": "发送资金有两种方式。如果接收者在线，你可以输入其 IP 地址，它会自动连接、获取一个新的公钥，并附带留言发送交易。如果接收者不在线，可以发送到其比特币地址，即他们提供给你的公钥哈希。他们下次联网并收到包含该交易的区块时就能收到这笔钱。这种方式的缺点是无法附带留言信息，且地址多次使用会损失一些隐私，但如果双方不能同时在线，或接收者无法接受外来连接，这仍是一个实用的备选方案。",
  "text_en": "There are two ways to send money. If the recipient is online, you can enter their IP address and it will connect, get a new public key and send the transaction with comments. If the recipient is not online, it is possible to send to their Bitcoin address, which is a hash of their public key that they give you. They'll receive the transaction the next time they connect and get the block it's in. This method has the disadvantage that no comment information is sent, and a bit of privacy may be lost if the address is used multiple times, but it is a useful alternative if both users can't be online at the same time or the recipient can't receive incoming connections.",
  "source_url": "https://satoshi.nakamotoinstitute.org/emails/cryptography/16/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2009-02-11",
  "context": "P2P Foundation · Bitcoin open source implementation of P2P currency",
  "text_zh": "数字货币包含其拥有者的公钥。转让时，拥有者对该货币连同下一位拥有者的公钥进行签名。任何人都可以通过检查签名来验证所有权链。",
  "text_en": "A digital coin contains the public key of its owner. To transfer it, the owner signs the coin together with the public key of the next owner. Anyone can check the signatures to verify the chain of ownership.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/p2pfoundation/1/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2009-11-25",
  "context": "BitcoinTalk · Re: Repost: How anonymous are bitcoins?",
  "text_zh": "为了更好的隐私，比特币地址最好只使用一次。",
  "text_en": "For greater privacy, it's best to use bitcoin addresses only once.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/11/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2010-02-24",
  "context": "BitcoinTalk · Re: URI-scheme for bitcoin",
  "text_zh": "这在销售终端会很实用。收银机在屏幕上显示一个编码了比特币地址和金额的二维码，你用手机拍下即可。",
  "text_en": "That would be nice at point-of-sale.  The cash register displays a QR-code encoding a bitcoin address and amount on a screen and you photo it with your mobile.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/73/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2010-06-17",
  "context": "BitcoinTalk · Re: Transactions and Scripts: DUP HASH160 ... EQUALVERIFY CHECKSIG",
  "text_zh": "设计支持非常丰富的可能交易类型，都是我多年前就设计好的。托管交易、保证合约、第三方仲裁、多方签名等。如果比特币大规模流行起来，这些都是未来我们想探索的方向，但它们都必须在最初就设计好，以确保日后能够实现。",
  "text_en": "The design supports a tremendous variety of possible transaction types that I designed years ago.  Escrow transactions, bonded contracts, third party arbitration, multi-party signature, etc.  If Bitcoin catches on in a big way, these are things we'll want to explore in the future, but they all had to be designed at the beginning to make sure they would be possible later.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/126/"
 },
 {
  "category_zh": "交易",
  "category_en": "Transactions",
  "date": "2010-09-30",
  "context": "BitcoinTalk · Re: I broke my wallet, sends never confirm now.",
  "text_zh": "正如你发现的，根本问题在于：在交易至少获得 1 个确认之前，我们不该将其计入余额或花掉。0 确认/未确认的交易是彻底的二等公民。它们最多只能作为“已收到某笔资金”的提示，把它们计入余额或花掉都为时尚早。",
  "text_en": "As you figured out, the root problem is we shouldn't be counting or spending transactions until they have at least 1 confirmation.  0/unconfirmed transactions are very much second class citizens.  At most, they are advice that something has been received, but counting them as balance or spending them is premature.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/464/"
 },
 {
  "category_zh": "可信第三方",
  "category_en": "Trusted Third Parties",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "互联网商业几乎完全依赖作为可信第三方处理电子支付的金融机构。虽然这个系统对大多数交易而言运作得还不错，但它仍然受到信任模型的内在弱点之害。",
  "text_en": "Commerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust based model.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "可信第三方",
  "category_en": "Trusted Third Parties",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "完全不可逆的交易实际上不可能存在，因为金融机构无法避免调解纠纷。调解成本推高了交易成本，限制了实际可行的最小交易规模，扼杀了小额随意交易的可能性；还有一种更广泛的代价，即失去了为不可逆服务进行不可逆支付的能力。有了可逆的可能，对信任的需求便会蔓延。",
  "text_en": "Completely non-reversible transactions are not really possible, since financial institutions cannot avoid mediating disputes. The cost of mediation increases transaction costs, limiting the minimum practical transaction size and cutting off the possibility for small casual transactions, and there is a broader cost in the loss of ability to make non-reversible payments for non-reversible services. With the possibility of reversal, the need for trust spreads.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "可信第三方",
  "category_en": "Trusted Third Parties",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们需要的是一种基于密码学证明而非信任的电子支付系统，让任何两个愿意的当事方无需可信第三方即可直接交易。计算上不可逆的交易可以保护卖家免受欺诈，而常规的托管机制也可轻松实现以保护买家。",
  "text_en": "What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "可信第三方",
  "category_en": "Trusted Third Parties",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "传统银行模式通过将信息访问限制在相关方和可信第三方之间来实现一定程度的隐私。公开广播所有交易的要求排除了这种做法，但隐私仍可在另一处切断信息流来维持：保持公钥匿名。公众能看到有人把一笔钱转给了另一个人，但无法将交易与任何人关联起来。这类似于证券交易所披露的信息：每笔交易的时间和金额（即“纸带”）公开，但不透露交易双方是谁。",
  "text_en": "The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous. The public can see that someone is sending an amount to someone else, but without information linking the transaction to anyone. This is similar to the level of information released by stock exchanges, where the time and size of individual trades, the \"tape\", is made public, but without telling who the parties were.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "可信第三方",
  "category_en": "Trusted Third Parties",
  "date": "2008-10-31",
  "context": "Bitcoin: A Peer-to-Peer Electronic Cash System",
  "text_zh": "我们提出了一种不依赖信任的电子交易系统。我们从数字签名构成货币的常规框架起步，它提供了对所有权的强大控制，但若没有防止双重支付的办法就不完整。为解决这一问题，我们提出了一种采用工作量证明的点对点网络，记录公开的交易历史；只要诚实节点控制多数 CPU 算力，攻击者很快就无法在计算上改变这段历史。",
  "text_en": "We have proposed a system for electronic transactions without relying on trust. We started with the usual framework of coins made from digital signatures, which provides strong control of ownership, but is incomplete without a way to prevent double-spending. To solve this, we proposed a peer-to-peer network using proof-of-work to record a public history of transactions that quickly becomes computationally impractical for an attacker to change if honest nodes control a majority of CPU power.",
  "source_url": "https://nakamotoinstitute.org/library/bitcoin/"
 },
 {
  "category_zh": "可信第三方",
  "category_en": "Trusted Third Parties",
  "date": "2009-12-10",
  "context": "BitcoinTalk · Re: Questions about Bitcoin",
  "text_zh": "开源意味着任何人都能独立审查代码。如果是闭源的，没人能验证其安全性。我认为这类程序必须是开源的，这一点至关重要。",
  "text_en": "Being open source means anyone can independently review the code.  If it was closed source, nobody could verify the security.  I think it's essential for a program of this nature to be open source.",
  "source_url": "https://satoshi.nakamotoinstitute.org/posts/bitcointalk/17/"
 }
]