Fast writes
Append-first ingestion keeps the foreground path short: log, memtable, then immutable sorted runs.
Product
Append-first ingestion keeps the foreground path short: log, memtable, then immutable sorted runs.
Immutable sorted runs move through compacted levels, keeping the storage shape predictable over time.
WAL replay and manifest checkpoints make restart behaviour explicit, testable, and easy to reason about.
Journal
journal/threads/ thread-local-storage-matrix.md
How Ordinum implemented thread local storage for it's subsystems and the design decisions involved.
journal/product/ why-ordinum-exists.md
An introduction to what Ordinum is, an overview of LSM Tree architecture and the purpose of Ordinum.
Timeline
The first stable shape of the write path and persisted sorted runs.
Ordered in-memory writes with flush boundaries.
Initial sorted-run format and metadata layout.
Replay rules, truncation checks, and manifest reconciliation.
Index block cadence and seek behaviour for point reads.
Turning immutable runs into predictable read behaviour over time.
Working assumptions for run placement and fanout.
Debt tracking, candidate selection, and foreground pressure limits.
Merged iteration across memtables and segment levels.
The parts that make the engine understandable under real workloads.
Public notes for design decisions and benchmark reports.
Sustained ingestion, mixed read-write loads, and recovery timing.
Compaction debt, read amplification, segment counts, and disk growth.
Build log