2 ms·
> unless you also have blocks B, and C. It suffices to have the headers of blocks B and C. Which, at only 80 bytes per header, is quite manageable.
by tromp 10y ago
> unless you also have blocks B, and C.
It suffices to have the headers of blocks B and C.
Which, at only 80 bytes per header, is quite manageable.
- thefreeman 10y agoAre you sure? The header for C will tell you the hash of B. How will you verify the header given for B if you cannot hash the entire block and compare it to the hash you got in the header of C?
- pash 10y agoEach block's header contains a hash that is the root of a Merkle tree [0] of the transactions in the block. The Merkle-root hash effectively summarizes all of the block's transactions, which allows the overall block hash to be a hash just of the constituents of the header. Thus if you have the header, you do indeed have everything you need to produce a hash and verify that it matches the hash referenced in the succeeding block. You do not need the information describing individual transactions. 0. https://en.m.wikipedia.org/wiki/Merkle_tree https://en.m.wikipedia.org/wiki/Merkle_tree