# Merging incomparable linearizations

**URL:** <https://delvingbitcoin.org/t/merging-incomparable-linearizations/209>\
**Category:** Implementation\
**Tags:** wg-cluster-mempool, mempool\
**Created:** [November 19, 2023, 4:12am UTC](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209 "2023-11-19T04:12:15Z")\
**Posts on this page:** 1\
**Showing post:** 46

<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:** [May 30, 2024, 2:44pm UTC](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209/46 "2024-05-30T14:44:23Z")

</div>

Just a quick note, using insights from the [composition algorithm](https://delvingbitcoin.org/t/cluster-mempool-definitions-theory/202/14), it appears possible to further simplify merging:

- Instead of finding the input linearization with the best remaining prefix, it is possible to only consider prefixes of what remains of the _original_ chunks the input linearizations had.
- Instead of trying the intersection of that best prefix with every prefix of what remains of the other linearization, it suffices to only consider prefixes aligning with the chunk boundaries of the remainder, or even of just the original chunk boundaries.

---

_[View the full topic](https://delvingbitcoin.org/t/merging-incomparable-linearizations/209)._