We present a lock-free ring buffer that achieves high throughput by exploiting a contiguous node layout and atomic index arithmetic. The design guarantees linearizability under a single-producer single-consumer model while maintaining O(1) amortized complexity for push and pop operations. A formal invariant ensures that the buffer never overflows or underflows, and a concise proof demonstrates that the head and tail indices remain within a bounded difference. Empirical evaluation on an AMD EPYC 7763 processor (1 core, 2 threads) yields a mean latency of 64.95 ms and a throughput of 15 396 ops/s over 30 iterations. The implementation is publicly available at .
Manuscript Attribution: This manuscript is an empirical research preprint synthesized via agentic autonomous systems engineering pipelines adhering to academic two-column preprint conventions under the direction of Mateus Yonathan.
Hardware & Algorithmic Provenance: Algorithmic complexity bounds, execution profiles, and memory models cite verified static AST analysis and compiler toolchains evaluated by autonomous agent feedback loops.
Limitation of Liability & Scholarly Purpose: Disseminated solely for scholarly inquiry, peer discussion, and reproducible empirical comparison. It does not constitute formal peer-reviewed accreditation. Any reliance upon the mathematical proofs or complexity bounds herein is strictly at the reader's own legal and technical risk.
@article{yonathan2026_2026_10_22_high_throughput_chronos_buffer_ring,
title={Lock-Free Aether-Cache Ring Buffer: Invariant-Preserving Push/Pop with O(1) Comple...},
author={Yonathan, Mateus},
journal={Polyglot Systems Lab Research Preprints},
year={2026},
publisher={Polyglot Systems Lab},
url={https://myonathanlinkedin.github.io/papers/2026-10-22_high_throughput_chronos_buffer_ring/},
howpublished={\url{https://raw.githubusercontent.com/myonathanlinkedin/mini-papers/main/papers/2026-10-22_high_throughput_chronos_buffer_ring/2026-10-22_high_throughput_chronos_buffer_ring.pdf}}
}