"Cluster Mempool1 is a complete reworking of how the mempool handles organizing and sorting transactions, conceptualized and implemented by Suhas Daftuar and Pieter Wuille. The design aims to simplify the overall architecture, better align transaction sorting logic with miner incentives, and improve security for second layer protocols. It was merged into Bitcoin Core in PR #33629 2 on November 25, 2025."
"When a miner is deciding whether to include a transaction in their block, their node looks at that transaction, and any ancestors that must be confirmed first for it to be valid in a block, and look at the average feerate per byte across all of them together considering the individual fees they paid as a whole. If that group of transactions fits within the blocksize limit while outcompeting others in fees, it is included in the next block. This is done for every transaction."
Cluster Mempool is a complete reworking of mempool organization and sorting, implemented by Suhas Daftuar and Pieter Wuille and merged into Bitcoin Core on November 25, 2025. The design simplifies mempool architecture, aligns transaction sorting with miner incentives, and improves security for second-layer protocols. The mempool stores pending transactions used for fee estimation, replacement validation, and block construction. Prior to Cluster Mempool, Bitcoin Core maintained ancestor and descendant combined feerate views to decide evictions and block inclusion. Miners evaluate transactions by averaging feerate per byte across a transaction and its ancestors; nodes evict transactions and their children when lower feerates are outcompeted.
Read at Bitcoin Magazine
Unable to calculate read time
Collection
[
|
...
]