# Linearization post-processing (O(n^2) fancy chunking)

**URL:** <https://delvingbitcoin.org/t/linearization-post-processing-o-n-2-fancy-chunking/201>\
**Category:** Implementation\
**Tags:** wg-cluster-mempool\
**Created:** [November 16, 2023, 10:45pm UTC](https://delvingbitcoin.org/t/linearization-post-processing-o-n-2-fancy-chunking/201 "2023-11-16T22:45:48Z")\
**Posts on this page:** 1\
**Showing post:** 8

<div class="post-metadata">

**Author:** ![sipa](https://delvingbitcoin.org/user_avatar/delvingbitcoin.org/sipa/32/1100_2.png) [@sipa](https://delvingbitcoin.org/u/sipa)\
**Post date:** [November 29, 2023, 10:34pm UTC](https://delvingbitcoin.org/t/linearization-post-processing-o-n-2-fancy-chunking/201/8 "2023-11-29T22:34:17Z")

</div>

Another observation (noticed by @sdaftuar): the [gathering theorem](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209/28) from [prefix-intersection merging](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209) also applies here (it shows why swapping adjacent disconnected transaction sequences in a linearization, which each individually would be chunked together, where the latter one has higher feerate, is always an improvement).

---

_[View the full topic](https://delvingbitcoin.org/t/linearization-post-processing-o-n-2-fancy-chunking/201)._