[
  {
    "path": "LICENSE",
    "content": "                                 Apache License\n                           Version 2.0, January 2004\n                        http://www.apache.org/licenses/\n\n   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n   1. Definitions.\n\n      \"License\" shall mean the terms and conditions for use, reproduction,\n      and distribution as defined by Sections 1 through 9 of this document.\n\n      \"Licensor\" shall mean the copyright owner or entity authorized by\n      the copyright owner that is granting the License.\n\n      \"Legal Entity\" shall mean the union of the acting entity and all\n      other entities that control, are controlled by, or are under common\n      control with that entity. For the purposes of this definition,\n      \"control\" means (i) the power, direct or indirect, to cause the\n      direction or management of such entity, whether by contract or\n      otherwise, or (ii) ownership of fifty percent (50%) or more of the\n      outstanding shares, or (iii) beneficial ownership of such entity.\n\n      \"You\" (or \"Your\") shall mean an individual or Legal Entity\n      exercising permissions granted by this License.\n\n      \"Source\" form shall mean the preferred form for making modifications,\n      including but not limited to software source code, documentation\n      source, and configuration files.\n\n      \"Object\" form shall mean any form resulting from mechanical\n      transformation or translation of a Source form, including but\n      not limited to compiled object code, generated documentation,\n      and conversions to other media types.\n\n      \"Work\" shall mean the work of authorship, whether in Source or\n      Object form, made available under the License, as indicated by a\n      copyright notice that is included in or attached to the work\n      (an example is provided in the Appendix below).\n\n      \"Derivative Works\" shall mean any work, whether in Source or Object\n      form, that is based on (or derived from) the Work and for which the\n      editorial revisions, annotations, elaborations, or other modifications\n      represent, as a whole, an original work of authorship. For the purposes\n      of this License, Derivative Works shall not include works that remain\n      separable from, or merely link (or bind by name) to the interfaces of,\n      the Work and Derivative Works thereof.\n\n      \"Contribution\" shall mean any work of authorship, including\n      the original version of the Work and any modifications or additions\n      to that Work or Derivative Works thereof, that is intentionally\n      submitted to Licensor for inclusion in the Work by the copyright owner\n      or by an individual or Legal Entity authorized to submit on behalf of\n      the copyright owner. For the purposes of this definition, \"submitted\"\n      means any form of electronic, verbal, or written communication sent\n      to the Licensor or its representatives, including but not limited to\n      communication on electronic mailing lists, source code control systems,\n      and issue tracking systems that are managed by, or on behalf of, the\n      Licensor for the purpose of discussing and improving the Work, but\n      excluding communication that is conspicuously marked or otherwise\n      designated in writing by the copyright owner as \"Not a Contribution.\"\n\n      \"Contributor\" shall mean Licensor and any individual or Legal Entity\n      on behalf of whom a Contribution has been received by Licensor and\n      subsequently incorporated within the Work.\n\n   2. Grant of Copyright License. Subject to the terms and conditions of\n      this License, each Contributor hereby grants to You a perpetual,\n      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n      copyright license to reproduce, prepare Derivative Works of,\n      publicly display, publicly perform, sublicense, and distribute the\n      Work and such Derivative Works in Source or Object form.\n\n   3. Grant of Patent License. Subject to the terms and conditions of\n      this License, each Contributor hereby grants to You a perpetual,\n      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n      (except as stated in this section) patent license to make, have made,\n      use, offer to sell, sell, import, and otherwise transfer the Work,\n      where such license applies only to those patent claims licensable\n      by such Contributor that are necessarily infringed by their\n      Contribution(s) alone or by combination of their Contribution(s)\n      with the Work to which such Contribution(s) was submitted. If You\n      institute patent litigation against any entity (including a\n      cross-claim or counterclaim in a lawsuit) alleging that the Work\n      or a Contribution incorporated within the Work constitutes direct\n      or contributory patent infringement, then any patent licenses\n      granted to You under this License for that Work shall terminate\n      as of the date such litigation is filed.\n\n   4. Redistribution. You may reproduce and distribute copies of the\n      Work or Derivative Works thereof in any medium, with or without\n      modifications, and in Source or Object form, provided that You\n      meet the following conditions:\n\n      (a) You must give any other recipients of the Work or\n          Derivative Works a copy of this License; and\n\n      (b) You must cause any modified files to carry prominent notices\n          stating that You changed the files; and\n\n      (c) You must retain, in the Source form of any Derivative Works\n          that You distribute, all copyright, patent, trademark, and\n          attribution notices from the Source form of the Work,\n          excluding those notices that do not pertain to any part of\n          the Derivative Works; and\n\n      (d) If the Work includes a \"NOTICE\" text file as part of its\n          distribution, then any Derivative Works that You distribute must\n          include a readable copy of the attribution notices contained\n          within such NOTICE file, excluding those notices that do not\n          pertain to any part of the Derivative Works, in at least one\n          of the following places: within a NOTICE text file distributed\n          as part of the Derivative Works; within the Source form or\n          documentation, if provided along with the Derivative Works; or,\n          within a display generated by the Derivative Works, if and\n          wherever such third-party notices normally appear. The contents\n          of the NOTICE file are for informational purposes only and\n          do not modify the License. You may add Your own attribution\n          notices within Derivative Works that You distribute, alongside\n          or as an addendum to the NOTICE text from the Work, provided\n          that such additional attribution notices cannot be construed\n          as modifying the License.\n\n      You may add Your own copyright statement to Your modifications and\n      may provide additional or different license terms and conditions\n      for use, reproduction, or distribution of Your modifications, or\n      for any such Derivative Works as a whole, provided Your use,\n      reproduction, and distribution of the Work otherwise complies with\n      the conditions stated in this License.\n\n   5. Submission of Contributions. Unless You explicitly state otherwise,\n      any Contribution intentionally submitted for inclusion in the Work\n      by You to the Licensor shall be under the terms and conditions of\n      this License, without any additional terms or conditions.\n      Notwithstanding the above, nothing herein shall supersede or modify\n      the terms of any separate license agreement you may have executed\n      with Licensor regarding such Contributions.\n\n   6. Trademarks. This License does not grant permission to use the trade\n      names, trademarks, service marks, or product names of the Licensor,\n      except as required for reasonable and customary use in describing the\n      origin of the Work and reproducing the content of the NOTICE file.\n\n   7. Disclaimer of Warranty. Unless required by applicable law or\n      agreed to in writing, Licensor provides the Work (and each\n      Contributor provides its Contributions) on an \"AS IS\" BASIS,\n      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n      implied, including, without limitation, any warranties or conditions\n      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n      PARTICULAR PURPOSE. You are solely responsible for determining the\n      appropriateness of using or redistributing the Work and assume any\n      risks associated with Your exercise of permissions under this License.\n\n   8. Limitation of Liability. In no event and under no legal theory,\n      whether in tort (including negligence), contract, or otherwise,\n      unless required by applicable law (such as deliberate and grossly\n      negligent acts) or agreed to in writing, shall any Contributor be\n      liable to You for damages, including any direct, indirect, special,\n      incidental, or consequential damages of any character arising as a\n      result of this License or out of the use or inability to use the\n      Work (including but not limited to damages for loss of goodwill,\n      work stoppage, computer failure or malfunction, or any and all\n      other commercial damages or losses), even if such Contributor\n      has been advised of the possibility of such damages.\n\n   9. Accepting Warranty or Additional Liability. While redistributing\n      the Work or Derivative Works thereof, You may choose to offer,\n      and charge a fee for, acceptance of support, warranty, indemnity,\n      or other liability obligations and/or rights consistent with this\n      License. However, in accepting such obligations, You may act only\n      on Your own behalf and on Your sole responsibility, not on behalf\n      of any other Contributor, and only if You agree to indemnify,\n      defend, and hold each Contributor harmless for any liability\n      incurred by, or claims asserted against, such Contributor by reason\n      of your accepting any such warranty or additional liability.\n\n   END OF TERMS AND CONDITIONS\n\n   APPENDIX: How to apply the Apache License to your work.\n\n      To apply the Apache License to your work, attach the following\n      boilerplate notice, with the fields enclosed by brackets \"{}\"\n      replaced with your own identifying information. (Don't include\n      the brackets!)  The text should be enclosed in the appropriate\n      comment syntax for the file format. We also recommend that a\n      file or class name and description of purpose be included on the\n      same \"printed page\" as the copyright notice for easier\n      identification within third-party archives.\n\n   Copyright {yyyy} {name of copyright owner}\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n       http://www.apache.org/licenses/LICENSE-2.0\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n   See the License for the specific language governing permissions and\n   limitations under the License.\n"
  },
  {
    "path": "README.md",
    "content": "# My First Bitcoin Miner\nFor the people who are curious to understand in a simplified setup:\n- **How the Bitcoin blockchain works**\n- **How mining works**\n\nFor a complete implementation (that can actually mine!), please browse this repository https://github.com/jgarzik/pyminer.\n\nThis miner is not connected to the bitcoin network and is a very simplified version of what would be a real bitcoin miner. The purpose of this implementation is to provide a basic comprehension of the mining logic.\n\n## What are bitcoin miners really solving?\n\n### Step 1\n\nAt a high level, the miner software takes a list of active transactions, and then groups them together in something called a \"block\".\n\nOr more *accurately stated*: The miner software converts all the transactions into a summary view called a \"merkle root\", and hashes it, which is representative of the transactions.\n\n### Step 2\n\nThe mining software then converts this to into a binary format called a Block Header, which also references the previous blocks (also called a chain).\n\n```\nField           Purpose                          Updated when...               Size (Bytes)\nVersion         Block version number             You upgrade the software and   4\n                                                 it specifies a new version \n\nhashPrevBlock   256-bit hash of the previous     A new block comes in          32\n                block header    \nhashMerkleRoot  256-bit hash based on all        A transaction is accepted     32\n                the transactions in the block       \n\nTime            Current timestamp as seconds     Every few seconds              4\n                since 1970-01-01T00:00 UTC  \n\nBits            Current target in compact format   The difficulty is adjusted   4\n\nNonce           32-bit number (starts at 0)       A hash is tried (increments)  4\n```\n\n### Step 3\n\nThe miner hardware changes a small portion of this block called a \"nonce\".\n\n### Step 4\n\nThe block header is hashed and compared to the Target as if it were simply a large number like 10,000,000 > 7,000,000 (the real numbers are much bigger, and in hex). The target is compressed and stored in each block in a field called bits.\n\nAn expanded target looks like this:\n\n```\n  Target   0000000000000083ef00000000000000000000000000000000000000000000000\n```\n\nAnd the goal is to make sure the SHA256 hash of the block is less than this value. In the example below \"83ee\" is smaller than \"83ef\"\n\nTo simplify this concept, you can ballpark the target by counting the leading zeros (as the other answer here explains). Here is an example:\n\nHere is a sample block with transactions you can view on BlockChain.info. Look in the upper right hand corner of the webpage for this hash:\n\n```\n   Hash 0000000000000083ee9371ddff055eed7f02348e4eda36c741a2fc62c85bc5cf\n```\n\nThat previous hash was from today and has 14 leading zeroes. Let's compare that to what was needed 3 years ago with block 100 which has 8 leading zeros.\n\n```\n   Hash 00000000a8ed5e960dccdf309f2ee2132badcc9247755c32a4b7081422d51899\n```\n\n### Summary\n\nSo at the end of the day, all a miner does is:\n\n- Take a block header as input.\n- Change the nonce.\n- Test if the Block Header hash is less than the Target. If it is, you win.\n- Go to step 2 (or go to step 1 if someone else won the block).\n\n\n## References\n- https://bitcoin.stackexchange.com/questions/8031/what-are-bitcoin-miners-really-solving\n- https://en.bitcoin.it/wiki/Difficulty\n- https://en.bitcoin.it/wiki/Target\n- https://bitcoin.stackexchange.com/questions/30467/what-are-the-equations-to-convert-between-bits-and-difficulty\n- https://stackoverflow.com/questions/22059359/trying-to-understand-nbits-value-from-stratum-protocol/22161019#22161019\n- https://en.bitcoin.it/wiki/Nonce\n"
  },
  {
    "path": "Resources",
    "content": "https://bitcoin.stackexchange.com/questions/8031/what-are-bitcoin-miners-really-solving\n\nhttps://en.bitcoin.it/wiki/Difficulty\n\nhttps://en.bitcoin.it/wiki/Target\n\nhttps://bitcoin.stackexchange.com/questions/30467/what-are-the-equations-to-convert-between-bits-and-difficulty\n\nhttps://stackoverflow.com/questions/22059359/trying-to-understand-nbits-value-from-stratum-protocol/22161019#22161019\n\nhttps://en.bitcoin.it/wiki/Nonce"
  },
  {
    "path": "miner.py",
    "content": "import hashlib\nfrom time import sleep\n\n\ndef hash_256(string):\n    return hashlib.sha256(string.encode('utf-8')).hexdigest()\n\n\nclass TransactionGenerator:\n    def __init__(self):\n        self.random_seed = 0\n\n    def generate_transaction(self):\n        transaction_payload = 'This is a transaction between A and B. ' \\\n                              'We add a random seed here {} to make its hash unique'.format(self.random_seed)\n        transaction_hash = hash_256(transaction_payload)\n        self.random_seed += 1\n        return transaction_hash\n\n\n# a block is a set of transactions and contains information of the previous blocks.\n# https://bitcoin.stackexchange.com/questions/8031/what-are-bitcoin-miners-really-solving\nclass Block:\n    def __init__(self, hash_prev_block, target):\n        self.transactions = []\n        self.hash_prev_block = hash_prev_block  # hash of the all previous blocks. used to maintain integrity.\n        self.hash_merkle_block = None\n        self.target = target\n        self.nounce = 0\n\n    def add_transaction(self, new_transac):\n        if not self.is_block_full():\n            self.transactions.append(new_transac)\n            self.hash_merkle_block = hash_256(str('-'.join(self.transactions)))\n\n    def is_block_full(self):\n        # blocks cannot go above 1Mb. Here let's say we cannot go above 1000 transactions.\n        return len(self.transactions) >= 1000\n\n    def is_block_ready_to_mine(self):\n        return self.is_block_full()\n\n    def __str__(self):\n        return '-'.join([self.hash_merkle_block, str(self.nounce)])\n\n    def apply_mining_step(self):\n        current_block_hash = hash_256(self.__str__())\n        print('CURRENT_BLOCK_HASH = {}, TARGET = {}'.format(current_block_hash, self.target))\n        if int(current_block_hash, 16) < int(self.target, 16):\n            print('Block was successfully mined! You will get a reward of x BTC!')\n            print('It took {} steps to mine it.'.format(self.nounce))\n            return True\n        else:\n            # Incrementing the nounce to change current_block_hash to hope to be below the target.\n            self.nounce += 1\n        return False\n\n\nclass BlockChain:\n    def __init__(self):\n        self.block_chain = []\n\n    def push(self, block):\n        self.block_chain.append(block)\n\n    def notify_everybody(self):\n        print('-' * 80)\n        print('TO ALL THE NODES OF THE NETWORK, THIS BLOCK HAS BEEN ADDED:')\n        print('[block #{}] : {}'.format(len(self.block_chain), self.get_last_block()))\n        print('-' * 80)\n\n    def get_last_block(self):\n        return self.block_chain[-1]\n\n\ndef my_first_miner():\n    last_block_header = '0e0fb2e3ae9bd2a0fa8b6999bfe6ab7df197a494d4a02885783a697ac74940d9'\n    last_block_target = '000ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd'\n\n    # init the block chains\n    block_chain = BlockChain()\n\n    transaction_generator = TransactionGenerator()\n\n    # fills a block with transactions. We have 1500 pending transactions.\n    # Sorry 500 transactions will have to wait for the next block!\n    block = Block(last_block_header, last_block_target)\n    for i in range(1500):\n        block.add_transaction(transaction_generator.generate_transaction())\n\n    assert block.is_block_full()\n    assert block.is_block_ready_to_mine()\n\n    # now that our block is full, we can start to mine it.\n    while not block.apply_mining_step():\n        continue\n\n    block_chain.push(block)\n    block_chain.notify_everybody()\n    sleep(5)\n\n    # Difficulty is updated every 2016 blocks.\n    # Objective is one block generated every 10 minutes.\n    # If during the last two weeks, blocks are generated every 5 minutes, then difficulty is multiplied by 2.\n    last_block_header = hash_256(str(block_chain.get_last_block()))\n\n    block_2 = Block(last_block_header, last_block_target)\n\n    for i in range(1232):\n        block_2.add_transaction(transaction_generator.generate_transaction())\n\n    assert block_2.is_block_full()\n    assert block_2.is_block_ready_to_mine()\n\n    # now that our block is full, we can start to mine it.\n    while not block_2.apply_mining_step():\n        continue\n\n    block_chain.push(block_2)\n    block_chain.notify_everybody()\n    sleep(5)\n\n    # now let's increase the difficulty.\n    # we have now 4 zeros at the beginning instead of 3.\n    last_block_target = '0000dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd'\n\n    last_block_header = hash_256(str(block_chain.get_last_block()))\n\n    block_3 = Block(last_block_header, last_block_target)\n\n    for i in range(1876):\n        block_3.add_transaction(transaction_generator.generate_transaction())\n\n    assert block_3.is_block_full()\n    assert block_3.is_block_ready_to_mine()\n\n    # now that our block is full, we can start to mine it.\n    while not block_3.apply_mining_step():\n        continue\n\n    block_chain.push(block_3)\n    block_chain.notify_everybody()\n    sleep(5)\n\n    print('')\n    print('SUMMARY')\n    print('')\n    for i, block_added in enumerate(block_chain.block_chain):\n        print('Block #{} was added. It took {} steps to find it.'.format(i, block_added.nounce))\n    print('Difficulty was increased for the last block!')\n\n\nif __name__ == '__main__':\n    my_first_miner()\n"
  }
]