Manual commit.

This commit is contained in:
1HXb9KMAtwNJqz4egi6hJx08EQgJajiBTH
2019-12-18 15:28:23 -05:00
parent 0affbab7ff
commit cad7cd5d80
4 changed files with 10 additions and 6 deletions
+1 -4
View File
@@ -13,10 +13,7 @@
- [Block](/protocol/blockchain/block)
- [Header](/protocol/blockchain/block/block-header)
- [Merkle Tree](/protocol/blockchain/block/merkle-tree)
- [Partial Merkle Tree](/protocol/blockchain/block/merkle-tree/partial-merkle-tree)
- Transactions
- Legacy Transaction Ordering
- Canonical Transaction Ordering (CTOR)
- [Transaction Ordering](/protocol/blockchain/block/transaction-ordering)
- [Script](/protocol/blockchain/script)
- Opcodes
...
+1 -1
View File
@@ -6,4 +6,4 @@ In Bitcoin Cash, the transactions in a [block](/protocol/blockchain/block) are b
Using a merkle tree to manage hashing the transactions in a block enables efficient addition of newly submitted transactions to a block being mined. Rather than re-hashing the entirety of the data of the transactions to be included in the block, the new transaction can be hash and then a small number of hashes can be recalculated, leading up to the merkle root. For large blocks this can heavily reduce the amount of data to be (re-)hashed.
Using merkle trees also allows for transferring only a subset of a block while still providing confidence that the data provided in fact appeared in the block in question. For more information, see [Partial Merkle Tree](/protocol/blockchain/block/merkle-tree/partial-merkle-tree).
Using merkle trees also allows for transferring only a subset of a block while still providing confidence that the data provided in fact appeared in the block in question. For more information, see [Merkle Block](/protocol/network/messages/merkleblock).
@@ -1 +0,0 @@
# Partial Merkle Tree
@@ -0,0 +1,8 @@
# Transaction Ordering
## Canonical Transaction Ordering (CTOR)
## Legacy Transaction Ordering