Nacre Array: A Segmented Dynamic Array with Thermal State Management and Structural Fracture Planes

Read full text Summarise with VIRAT
Authors: Wm. B. Phillips
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The Nacre Array is a segmented dynamic array with three properties absent from conventional contiguous arrays: (1) per-element metadata headers that make elements self-describing without external bookkeeping, (2) a four-state thermal machine (Hot/Warm/Cold/Compressed) that allows cold segments to compress in place via LZ4 or Zstd while hot segments remain uncompressed and mutable, and (3) fracture planes at segment boundaries that enable structural splits without copying element payloads. These properties target a recurring constraint class: sequence workloads where structural mutation, selective compression, and low-cost partitioning matter more than uniform random-access throughput. Inspired by nacre (mother-of-pearl), where layered aragonite tablets bonded by organic biopolymer achieve roughly 3,000x the fracture resistance of the raw mineral [9, 10], the structure organizes elements into fixed-capacity segments with per-segment summaries and a tick-driven cooldown finite-state machine. The implementation evaluated here performs mutations locally within a segment, updates cumulative suffix metadata incrementally after insert/remove, splits cumulative metadata alongside segments instead of rebuilding both halves from scratch, and exposes an explicit reheat path for compressed segments through owned reads and mutable accessors. Against Rust's Vec on the Criterion harness used in this paper (12-byte elements: 4-byte SlimElementHeader + 8-byte u64), Nacre splits 7.5x faster than Vec::split_off at 100K elements and inserts 3.7x faster at the midpoint, while pure random access is 7.9x slower at 100K with the segment cache disabled. These structural win factors are element-size-sensitive: larger elements amplify the advantage because Nacre avoids per-element copying in split and bounds shift cost in insert, while Vec copies or shifts the full suffix. A brief 100K push win over default-growth Vec persists, but push throughput is not treated here as a structural Nacre advantage because preallocated Vec remains faster. Mixed hot/cold memory-reduction claims are deferred until a reproducible benchmark harness for that workload is checked into the repository. The paper positions Nacre as a specialized segmented-sequence primitive for workloads where these structural operations dominate, not as a blanket replacement for contiguous arrays.

Fields of Study & Subjects

Algorithms and Data Compression Advanced Database Systems and Queries Parallel Computing and Optimization Techniques

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
24 March 2026
Language
EN
Document type
Preprint