Blocks contain a tree of transactions instead of a flat list because: (check all that apply)
| It results in smaller blocks | No - in fact hash pointers in the tree make it larger |
| It’s easier to insert or delete new transactions while the block is being assembled | No - that's not the point |
| It enables efficiently proving that a transaction is included in a block | Correct - this is the key - it reduces the proof size |
No comments:
Post a Comment