Elden Tyrell [ARCHIVE] on Nostr: {"author":"Elden Tyrell","date":"2012-01-02T05:04:03","text":"Satoshi's paper ...
{"author":"Elden Tyrell","date":"2012-01-02T05:04:03","text":"Satoshi's paper mentions that storage requirements for the blockchain \ncan be reduced by deleting transactions whose outputs have been spent.\n\nIf I understand correctly, this technique can only be used for reducing \n*storage* requirements, not *bandwidth* needed for the initial chain \ndownload by a high-security client that doesn't trust any of its peers \n-- right?\n\nThe rule is \"trust the longest valid chain of blocks\". Part of a block \nbeing \"valid\" is that each transaction's inputs are unspent and their \nsum exceeds the transaction's outputs unless it is a coinbase. This \ncannot be verified for \"stubbed out\" transactions -- they have outputs \nbut no inputs, and aren't coinbases. So a paranoid client booting up \nfor the first time needs to be given an un-stubbed chain, right?\n\nOf course, if a client decided to accept a stubbed blocks only when the \nsum of the difficulties in the blocks after it exceeds some number N, \nthen attacking it could be made very expensive by picking a large \nenough N.\n\nPlease let me know if I have misunderstood something."}
Published at
2023-06-06 01:49:03Event JSON
{
"id": "b5a17e8d08257a7d827a6e4e75a0c935390066f5bb7437dcbbf040ca3cf1b2a4",
"pubkey": "cb909578c1c5b5fa9fb52a030ac64f353e2d2e7a9376a66f1e78998016d23500",
"created_at": 1686016143,
"kind": 1,
"tags": [
[
"e",
"ad43b2bb0c9294f73865807b5159b905963e0493108450f5fd1db4fe4e901363",
"",
"reply"
]
],
"content": "{\"author\":\"Elden Tyrell\",\"date\":\"2012-01-02T05:04:03\",\"text\":\"Satoshi's paper mentions that storage requirements for the blockchain \\ncan be reduced by deleting transactions whose outputs have been spent.\\n\\nIf I understand correctly, this technique can only be used for reducing \\n*storage* requirements, not *bandwidth* needed for the initial chain \\ndownload by a high-security client that doesn't trust any of its peers \\n-- right?\\n\\nThe rule is \\\"trust the longest valid chain of blocks\\\". Part of a block \\nbeing \\\"valid\\\" is that each transaction's inputs are unspent and their \\nsum exceeds the transaction's outputs unless it is a coinbase. This \\ncannot be verified for \\\"stubbed out\\\" transactions -- they have outputs \\nbut no inputs, and aren't coinbases. So a paranoid client booting up \\nfor the first time needs to be given an un-stubbed chain, right?\\n\\nOf course, if a client decided to accept a stubbed blocks only when the \\nsum of the difficulties in the blocks after it exceeds some number N, \\nthen attacking it could be made very expensive by picking a large \\nenough N.\\n\\nPlease let me know if I have misunderstood something.\"}",
"sig": "1fa77cf2948e5be02419add83b8d6b8986af16e1f7fd849bee8b415d3204bfe2b4d8a79edb9f41c51d63eaf519f6f094d05c172cf81a42742f34c455aa9f7c72"
}