Typhon's spatial index can promote a dense cell from a linear scan to a per-cell R-Tree. It ships with that promotion disabled — the threshold is int.MaxValu...

Full ACID transactions. Microsecond latency. An ECS data model built for real-time systems. An 8-slide technical intro.

Every database has a primary key index, and almost every one of them is a tree. Typhon's was too — until we noticed that nothing had ever asked it for a key ...

A reader-writer lock with a shared counter, three classes of waiter, an owning thread id, a contention flag and a state machine — all inside a single ulong, ...

Classic MVCC clones the whole row on every update. Typhon versions individual components — an entity with eight components that changes one appends a single ...

Traditional page caches reference-count every page access — two atomic operations per page, per transaction, on counters that bounce between cores. Typhon re...

YouTube video by Log2n

How Typhon lets a single transaction choose between volatile, group-committed, or immediate-FUA durability — same WAL, same engine, per-commit override.

Why Typhon ships without a deadlock detector — three structural decisions that make lock-dependency cycles architecturally impossible.

Five design principles that let a C#/.NET database engine hit sub-microsecond transaction latency — from cache-line-aware structs to JIT-eliminated dead code.

Game engines and databases solved the same problem independently. Typhon draws from both traditions to build a database engine purpose-built for game servers.

Everyone says you need C, C++, or Rust for a high-performance database engine. I chose C# — here's why that's not as crazy as it sounds.