"considered to have an implicit input equal in size to the subsidy, followed by\nan input for every fee-paying transaction in the block, in the order that those\ntransactions appear in the block. The implicit subsidy input carries the\nblock's newly created sats. The implicit fee inputs carry the sats that were\npaid as fees in the block's transactions.\n\nUnderpaying the subsidy does not change the ordinal numbers of sats mined\nin subsequent blocks. Ordinals depend only on how many sats could have been\nmined, not how many actually were.\n\n=== Specification ===\n\nSats are numbered and transferred with the following algorithm:\n\n<pre>\n# subsidy of block at given height\ndef subsidy(height):\n  return 50 * 100_000_000 >> height // 210_000\n\n# first ordinal of subsidy of block at given height\ndef first_ordinal(height):\n  start = 0\n  for height in range(height):\n    start += subsidy(height)\n  return start\n\n# assign ordinals in given block\ndef assign_ordinals(block):\n  first = first_ordinal(block.height)\n  last = first + subsidy(block.height)\n"