# LIMO: combining the best parts of linearization search and merging

**URL:** <https://delvingbitcoin.org/t/limo-combining-the-best-parts-of-linearization-search-and-merging/825>\
**Category:** Implementation\
**Tags:** mempool\
**Created:** [April 23, 2024, 2:43am UTC](https://delvingbitcoin.org/t/limo-combining-the-best-parts-of-linearization-search-and-merging/825 "2024-04-23T02:43:58Z")\
**Posts on this page:** 1\
**Showing post:** 4

<div class="post-metadata">

**Author:** ![ajtowns](https://delvingbitcoin.org/user_avatar/delvingbitcoin.org/ajtowns/32/417_2.png) [@ajtowns](https://delvingbitcoin.org/u/ajtowns)\
**Post date:** [April 25, 2024, 1:11am UTC](https://delvingbitcoin.org/t/limo-combining-the-best-parts-of-linearization-search-and-merging/825/4 "2024-04-25T01:11:42Z")

</div>

I wonder if doing the intersections first would be an optimisation? ie S\_1, S\_1 \cap S\_2, S\_2, S\_1 \cap S\_2 \cap S\_3, S\_1 \cap S\_3, S\_2 \cap S\_3, S\_3

---

_[View the full topic](https://delvingbitcoin.org/t/limo-combining-the-best-parts-of-linearization-search-and-merging/825)._