Sweep K · read the elbow
The plain transformer is the K = N end (no clustering, 100% variance, output agreement 1.0 — a self-test anchor). Everything at K < N is the silo trading fidelity for compute. Type a context; the sweep, the elbow, and the verdict update live and deterministically.
90% variance
What this settles — and what it doesn't
What it settles
The silo's cost/benefit is a genuine rate–distortion trade-off: it buys a K²/N² attention reduction for (1 − variance explained) lost. The elbow shows where the curve turns. python selftest.py proves the metrics and the anchors (K=N ≡ plain, agreement 1.0) with no network (14 checks).
What it doesn't
It does not claim the silo is better — the self-test literally forbids the verdict from saying "beats" or "wins." Whether the compression helps a trained model on real data is a different, empirical question. That would be v3: real training, a real benchmark, honestly reported.
bench.py (explained_variance · attention_pairs · compare · sweep · verdict) · silo.py (v1 engine, vendored) · selftest.py (metrics + honest framing). Head-to-head of transformer-silo v1.