Live cache keys, derived in your browser

The paper’s worked example, detached from the paper. The four-cell DAG below is compiled and hashed by marimo’s real BlockHasher — the keys you see are the keys the cache would use.

# a · seed        # b · random input            # c · model               # d · forward pass
seed = N           x = rng(seed).normal(64)      model = TinyNet()         y = model(x)

Drag the seed. a, b, and d re-key on every move; c never does — the model cell’s only outside reference is the module-pinned np, so the seed is not among its refs. Drag back to a previous value and the keys return exactly: content addressing has no memory of when a value was last seen, only what it is.