diff --git a/lib/morpho-data-structures b/lib/morpho-data-structures
index 0cd679077..f19cd8176 160000
--- a/lib/morpho-data-structures
+++ b/lib/morpho-data-structures
@@ -1 +1 @@
-Subproject commit 0cd679077f2e80f4db85dcd87bd8a5087d060cdb
+Subproject commit f19cd81768febf42bf6325b5fa288ed36d39c2ea
diff --git a/src/compound/MorphoStorage.sol b/src/compound/MorphoStorage.sol
index d32b8dcb8..066676113 100644
--- a/src/compound/MorphoStorage.sol
+++ b/src/compound/MorphoStorage.sol
@@ -7,7 +7,7 @@ import "./interfaces/IIncentivesVault.sol";
 import "./interfaces/IRewardsManager.sol";
 import "./interfaces/IInterestRatesManager.sol";
 
-import "./libraries/DoubleLinkedList.sol";
+import "@morpho-dao/morpho-data-structures/DoubleLinkedList.sol";
 import "./libraries/Types.sol";
 
 import "@openzeppelin/contracts-upgradeable/security/ReentrancyGuardUpgradeable.sol";
diff --git a/src/compound/libraries/DoubleLinkedList.sol b/src/compound/libraries/DoubleLinkedList.sol
deleted file mode 100644
index 52261a3ea..000000000
--- a/src/compound/libraries/DoubleLinkedList.sol
+++ /dev/null
@@ -1,154 +0,0 @@
-// SPDX-License-Identifier: GNU AGPLv3
-pragma solidity ^0.8.0;
-
-/// @title Double Linked List.
-/// @author Morpho Labs.
-/// @custom:contact security@morpho.xyz
-/// @notice Modified double linked list with capped sorting insertion.
-library DoubleLinkedList {
-    /// STRUCTS ///
-
-    struct Account {
-        address prev;
-        address next;
-        uint256 value;
-    }
-
-    struct List {
-        mapping(address => Account) accounts;
-        address head;
-        address tail;
-    }
-
-    /// ERRORS ///
-
-    /// @notice Thrown when the account is already inserted in the double linked list.
-    error AccountAlreadyInserted();
-
-    /// @notice Thrown when the account to remove does not exist.
-    error AccountDoesNotExist();
-
-    /// @notice Thrown when the address is zero at insertion.
-    error AddressIsZero();
-
-    /// @notice Thrown when the value is zero at insertion.
-    error ValueIsZero();
-
-    /// INTERNAL ///
-
-    /// @notice Returns the `account` linked to `_id`.
-    /// @param _list The list to search in.
-    /// @param _id The address of the account.
-    /// @return The value of the account.
-    function getValueOf(List storage _list, address _id) internal view returns (uint256) {
-        return _list.accounts[_id].value;
-    }
-
-    /// @notice Returns the address at the head of the `_list`.
-    /// @param _list The list to get the head.
-    /// @return The address of the head.
-    function getHead(List storage _list) internal view returns (address) {
-        return _list.head;
-    }
-
-    /// @notice Returns the address at the tail of the `_list`.
-    /// @param _list The list to get the tail.
-    /// @return The address of the tail.
-    function getTail(List storage _list) internal view returns (address) {
-        return _list.tail;
-    }
-
-    /// @notice Returns the next id address from the current `_id`.
-    /// @param _list The list to search in.
-    /// @param _id The address of the account.
-    /// @return The address of the next account.
-    function getNext(List storage _list, address _id) internal view returns (address) {
-        return _list.accounts[_id].next;
-    }
-
-    /// @notice Returns the previous id address from the current `_id`.
-    /// @param _list The list to search in.
-    /// @param _id The address of the account.
-    /// @return The address of the previous account.
-    function getPrev(List storage _list, address _id) internal view returns (address) {
-        return _list.accounts[_id].prev;
-    }
-
-    /// @notice Removes an account of the `_list`.
-    /// @param _list The list to search in.
-    /// @param _id The address of the account.
-    function remove(List storage _list, address _id) internal {
-        Account memory account = _list.accounts[_id];
-        if (account.value == 0) revert AccountDoesNotExist();
-
-        if (account.prev != address(0)) _list.accounts[account.prev].next = account.next;
-        else _list.head = account.next;
-        if (account.next != address(0)) _list.accounts[account.next].prev = account.prev;
-        else _list.tail = account.prev;
-
-        delete _list.accounts[_id];
-    }
-
-    /// @notice Inserts an account in the `_list` at the right slot based on its `_value`.
-    /// @param _list The list to search in.
-    /// @param _id The address of the account.
-    /// @param _value The value of the account.
-    /// @param _maxIterations The max number of iterations.
-    function insertSorted(
-        List storage _list,
-        address _id,
-        uint256 _value,
-        uint256 _maxIterations
-    ) internal {
-        if (_value == 0) revert ValueIsZero();
-        if (_id == address(0)) revert AddressIsZero();
-        if (_list.accounts[_id].value != 0) revert AccountAlreadyInserted();
-
-        uint256 numberOfIterations;
-        address next = _list.head; // If not added at the end of the list `_id` will be inserted before `next`.
-
-        while (
-            numberOfIterations < _maxIterations &&
-            next != address(0) &&
-            _list.accounts[next].value >= _value
-        ) {
-            next = _list.accounts[next].next;
-            unchecked {
-                ++numberOfIterations;
-            }
-        }
-
-        // Account is not the new tail.
-        if (numberOfIterations < _maxIterations && next != address(0)) {
-            // Account is the new head.
-            if (next == _list.head) {
-                _list.accounts[_id] = Account({prev: address(0), next: next, value: _value});
-                _list.head = _id;
-                _list.accounts[next].prev = _id;
-            }
-            // Account is not the new head.
-            else {
-                address prev = _list.accounts[next].prev;
-                _list.accounts[_id] = Account({prev: prev, next: next, value: _value});
-                _list.accounts[prev].next = _id;
-                _list.accounts[next].prev = _id;
-            }
-        }
-        // Account is the new tail.
-        else {
-            // Account is the new head.
-            if (_list.head == address(0)) {
-                _list.accounts[_id] = Account({prev: address(0), next: address(0), value: _value});
-                _list.head = _id;
-                _list.tail = _id;
-            }
-            // Account is not the new head.
-            else {
-                address tail = _list.tail;
-                _list.accounts[_id] = Account({prev: tail, next: address(0), value: _value});
-                _list.accounts[tail].next = _id;
-                _list.tail = _id;
-            }
-        }
-    }
-}