Kiln art study
Five pieces of engine art
Each figure carries one spatial claim, drawn by hand in our tokens. Tap a stage to play it.
pointers · indexes · latency · channels · stack
Memory
The value lives once
p holds x’s address. Run *p = 20 and read x again.
Indexes
Order turns 4,096 reads into 12
Same row, two ways to reach it. The heap reads everything. The tree decides.
heap scan—
index seek—
Latency
The average lies
Thirty-five requests land together. The mean still says 137 ms.
typical—
p99—
Channels
The buffer buys time
produce() is faster than consume(). Five slots stand between them — until they don’t.
buffer0 / 5
delivered0
Call stack
Plates come off top-first
Three calls go down. Watch the order they come back up.
The set
Five claims, one system
Every figure: one spatial claim, ink-only text, three hues with jobs.
Pointer
one value, many names
Index
order skips work
Latency
the tail is real
Channel
capacity absorbs speed
Stack
last in, first out