> For the complete documentation index, see [llms.txt](https://change-chain-1.gitbook.io/change-chain/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://change-chain-1.gitbook.io/change-chain/architecture/transaction-processing/high-throughput-mechanisms.md).

# High Throughput Mechanisms

## **Parallel Transaction Processing**: <a href="#parallel-transaction-processing" id="parallel-transaction-processing"></a>

* Transactions that do not interact with the same state (e.g., different accounts or contracts) are processed in parallel.Comment
* Utilizes multi-threading and optimized concurrency control.Comment

## **Sharding (Future Implementation)**: <a href="#sharding-future-implementation" id="sharding-future-implementation"></a>

* Plans to implement state sharding to divide the network into smaller partitions (shards), each processing its own transactions.Comment
* Increases scalability by parallelizing transaction processing across shards.Comment

## **Optimized Data Structures**: <a href="#optimized-data-structures" id="optimized-data-structures"></a>

* **Merkle Patricia Trees**:
  * Combines Merkle trees and Patricia tries for efficient storage and retrieval of account states

## **Bloom Filters**: <a href="#bloom-filters" id="bloom-filters"></a>

* Used in blocks to quickly verify the presence of certain transactions or logs.