CODExSIMS

Hard ideas,
shown not told.

Data Infrastructure

How does an LLM-maintained wiki compound knowledge over time?

9 stages · ~8 min

How does DuckDB turn SQL into vectorized pipelines so quickly?

8 stages · ~7 min

Why do Kafka consumers stop for a rebalance and reshuffle?

8 stages · ~7 min

How do Cassandra nodes discover peers and detect failures without a leader?

6 stages · ~5 min

How can distributed systems order events when clocks disagree?

17 stages · ~16 min

How does Jepsen find distributed system bugs under real faults?

17 stages · ~14 min

When does a retried operation really happen only once?

15 stages · ~13 min

How does Postgres read old rows without locking everything up?

8 stages · ~7 min

What do databases mean when they promise consistency?

8 stages · ~7 min

Why do RocksDB LSM trees stay write-fast even when compaction gets messy?

8 stages · ~7 min

How does Flink keep duplicate writes out of the picture?

8 stages · ~7 min

How can you check a distributed protocol across every ugly interleaving?

17 stages · ~14 min

How do realtime workers keep ClickHouse ingestion fast and safe?

8 stages · ~7 min

How does Pinot keep stream rows queryable while it builds immutable segments?

18 stages · ~16 min

How does Pinot keep one logical row while old versions remain inside segments?

27 stages · ~19 min

How does Pinot turn one SQL query into coordinated distributed stages?

10 stages · ~9 min

How does Spark choose between broadcast speed and shuffle pain?

8 stages · ~7 min

How does Iceberg time travel without copying the whole table?

8 stages · ~7 min

How does Arrow make columnar data zero-copy across every language?

8 stages · ~7 min

How does Parquet turn tables into tiny columnar files?

8 stages · ~7 min

How does RAG dig up the right context?

8 stages · ~7 min

LLM & AI Systems

JVM Internals

Web & Protocols

Field Notes