Replicated lists in distributed systems ensure high availability but face challenges in handling concurrent insertions. This work introduces the Replicated Dense List (RDL), a pure op-based replicated list using a Cartesian tree set for efficient ordering and O(log n) operations. RDL enables manual conflict resolution, allowing users to adjust order retrospectively. Unlike existing approaches, it achieves commutativity without strict causality. Additionally, RDL supports cardinality constraints, dynamically omitting or resurrecting elements to maintain list size. This makes it a simple, flexible, and efficient alternative for replicated lists. Future work includes performance evaluation and optimized kernel operator design.

Семенов Г.В. (науч. рук. Грищенко В.С.) Pure op-based replicated list with cardinality constraints // Сборник тезисов докладов конгресса молодых ученых. Электронное издание. – СПб: Университет ИТМО, [2025]. URL: https://kmu.itmo.ru/digests/article/15402