reminds me of the blist [0] package in Python, implemented using B+ trees and offering O(log n) performance for operations that are O(n) with the built-in list type - such as insertion or deletion of items at the start of the list, or somewhere in the middle.
sadly it seems to be abandonware, with no commits in the last 10 years and compilation errors on Python 3.9 and above [1]