model card (BABEL codec v1.0.0)
Browse files
README.md
ADDED
|
@@ -0,0 +1,167 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
tags:
|
| 4 |
+
- interpretability
|
| 5 |
+
- mechanistic-interpretability
|
| 6 |
+
- gpt2
|
| 7 |
+
- explainable-ai
|
| 8 |
+
---
|
| 9 |
+
|
| 10 |
+
# The BABEL codec β a certified two-way dictionary between GPT-2's insides and plain English
|
| 11 |
+
|
| 12 |
+
[](https://doi.org/10.5281/zenodo.21230108)
|
| 13 |
+
[](LICENSE)
|
| 14 |
+
|
| 15 |
+
This repository contains **the BABEL codec**: the first complete, certified, bidirectional decode
|
| 16 |
+
of an entire production language model β a two-way dictionary between GPT-2 small's internal
|
| 17 |
+
state and plain English.
|
| 18 |
+
|
| 19 |
+
Neural networks are famously black boxes: hundreds of millions of numbers change at every layer,
|
| 20 |
+
and nobody can say what each one means. This work cracks that box open for one real model β and
|
| 21 |
+
"cracks open" here means something precise: every dimension of GPT-2 small's internal state, at
|
| 22 |
+
every one of its 13 layer checkpoints, in three kinds of text, is **priced** (how much
|
| 23 |
+
does the model's behavior depend on it?), **read** (what does it say in English β or is it proven
|
| 24 |
+
word-less?), and **written** (edit the English, and the model obeys) β with the pass bar for every
|
| 25 |
+
claim written down and locked *before* the data, and every number traceable to a frozen,
|
| 26 |
+
hash-stamped file in this repo. The honest boundary comes with the claim: 94.7% of behavior
|
| 27 |
+
reconstructed from the certified dictionary; the remaining 5.3% resisted every translation method
|
| 28 |
+
we tried β it transfers only as its exact raw configuration, never through any compressed or
|
| 29 |
+
named form.
|
| 30 |
+
|
| 31 |
+

|
| 32 |
+
*The headline in one picture: hand-edit ONE English field of the decoded state (rows), re-encode,
|
| 33 |
+
and watch which vocabulary the model pushes up (columns). Turn up the "naval/warship" field and
|
| 34 |
+
GPT-2 starts predicting "amphib, sunk, ashore, reefs, sailed, submarine". Three of four named
|
| 35 |
+
axes steer the model in their own words; random edits of the same size never do.*
|
| 36 |
+
|
| 37 |
+
## The claim, precisely
|
| 38 |
+
|
| 39 |
+
**The first complete, certified, bidirectional decode of an entire production language model.**
|
| 40 |
+
Not the first "activations β English" concept β Anthropic's Natural Language Autoencoders and the
|
| 41 |
+
independent Cycle-Consistent Activation Oracles published that idea in spring 2026, and are
|
| 42 |
+
credited below. The claim here is *completeness with proofs*:
|
| 43 |
+
|
| 44 |
+
- **Priced:** rebuild the full hidden state from only what the decoder reads, at all 39
|
| 45 |
+
(boundary Γ text-regime) checkpoints β behavior stays inside the model's own noise floor at
|
| 46 |
+
**39/39** on the primary meter (36/39 on the stricter legacy meter; both always reported).
|
| 47 |
+
The unexplained mass fell 11.2 β 0.000 nats across six pre-registered "not yet" verdicts.
|
| 48 |
+
- **Read:** all 351 decoder channels put on trial against matched random directions β **53.6%
|
| 49 |
+
carry an explicit English meaning; 46.4% are *proven* to carry no word** (the test that proves
|
| 50 |
+
it is part of the record). How meanings move between layers is linear-certified at all 36 seams.
|
| 51 |
+
- **Written:** the inverse (English β state) is exact algebra, not a trained network. Read β say
|
| 52 |
+
it in English β write it back is behaviorally invisible at 39/39 checkpoints; transplanting the
|
| 53 |
+
English between contexts carries **94.7%** of the behavioral meaning (random control: 18.6%;
|
| 54 |
+
measured on 16 prose pairs at one mid-stack checkpoint);
|
| 55 |
+
and 3 of 4 hand-editable axes steer the model in their own vocabulary.
|
| 56 |
+
- **The honest boundary β measured and certified:** 94.7% of behavior reconstructed from the
|
| 57 |
+
certified dictionary; the remaining 5.3% resisted every translation method we tried β it
|
| 58 |
+
transfers only as its exact raw configuration, never through any compressed or named form: it
|
| 59 |
+
lies *outside* the whole certified dictionary (L5), and it is diffuse across a 329-dimension
|
| 60 |
+
"dark" subspace with no low-rank carrier and almost no nameable structure (L6). The fourth edit
|
| 61 |
+
axis is certified unusable as a steering lever at both tested doses: it does not separate from
|
| 62 |
+
an honest 20-draw random floor at either dose (at Β±3Ο its tiny effect sits within the floor's
|
| 63 |
+
own draw-to-draw spread across two pre-registered 20-draw nulls) and it scales sub-linearly β
|
| 64 |
+
a gauge, not a lever. The boundary of translation is measured and certified, not shrugged at.
|
| 65 |
+
|
| 66 |
+
### Why "first" β the prior-art table
|
| 67 |
+
|
| 68 |
+
Four properties define the claim: whole-model coverage with a priced remainder; behavioral
|
| 69 |
+
certification (not plausibility); a route through the model's *own* certified channels; and a
|
| 70 |
+
two-way behavioral round trip. Every prior or concurrent line lacks at least one; this work fills
|
| 71 |
+
all four. (β provided Β· β partial Β· β absent; full citations and the generous version of every
|
| 72 |
+
row: paper Β§7, Table 1.)
|
| 73 |
+
|
| 74 |
+
| work | whole-model, priced remainder | behavioral certification | model's own channels | two-way round trip |
|
| 75 |
+
|---|---|---|---|---|
|
| 76 |
+
| SAE feature dictionaries (2023β26, incl. all-layer GPT-2-small/Gemma Scope releases + all-neuron scoring) | β all-layer coverage w/ CE pricing; remainder open "dark matter" | β | β | β steering demos |
|
| 77 |
+
| LatentQA (2024) | β | β | β | β control via trained decoder |
|
| 78 |
+
| Activation Oracles (Dec 2025) | β | β | β | β |
|
| 79 |
+
| Predictive Concept Decoders (Dec 2025) | β | β predicts behavior | β | β |
|
| 80 |
+
| Natural Language Autoencoders (May 2026) | β | β | β | β activation-space round trip + qualitative steering demo |
|
| 81 |
+
| Cycle-Consistent Activation Oracles (Mar 2026) | β | β | β | β activation-space cycle |
|
| 82 |
+
| **the BABEL codec (this repo)** | **β 39/39, remainder certified** | **β 351/351 vs matched nulls** | **β + exact algebraic inverse** | **β 94.7% transplant, 3/4 edit axes** |
|
| 83 |
+
|
| 84 |
+
**Why you can check this rather than trust it:** every pass bar in the record was locked in an
|
| 85 |
+
append-only findings pen *before* the measurement it governs (the pre-registration block behind
|
| 86 |
+
each number is cited in the paper's Appendix A); every verdict-bearing artifact here is frozen and
|
| 87 |
+
SHA-256-stamped (`artifacts/HASHES.txt`); and every headline number is byte-replayable from those
|
| 88 |
+
artifacts on one workstation GPU (see "Verify it yourself").
|
| 89 |
+
|
| 90 |
+
**If any prior work provides all four properties for any model, we will amend this claim.** Open
|
| 91 |
+
an issue at https://github.com/wpferrell/babel-codec-gpt2 or write to wpferrell@gmail.com. Confidence here is meant as openness,
|
| 92 |
+
not bravado.
|
| 93 |
+
|
| 94 |
+
## What am I looking at?
|
| 95 |
+
|
| 96 |
+
| artifact | plain description |
|
| 97 |
+
|---|---|
|
| 98 |
+
| `LEXICON_V3.md` (+ `LEXICON_V4_ADDENDUM.md`) | the vocabulary: every channel's English meaning, or its certified proof of word-lessness (+ 2 faint provisional signatures found in the dark mass) |
|
| 99 |
+
| `GRAMMAR_TABLE_V1.json` | the grammar: how meanings move from each layer to the next (linear, at all 36 seams) |
|
| 100 |
+
| `decoder_v7_tensors.pt` / `decoder_v7.json` | the reader: internal state β English |
|
| 101 |
+
| `_l3_encoder.pt` / `ENCODER_V1.json` | the writer: English β internal state (exact inverse of the reader) |
|
| 102 |
+
| `_l4_result.json`, `_l5_result.json`, `_l6_result.json` | the proof it runs both ways: the speak test (reconstruct / transplant / human-edit) and the certified-negative closures of its two loose ends |
|
| 103 |
+
| `_v5_floors_recal.json` | the meter: the model's own per-checkpoint noise floors β the pass bar for everything |
|
| 104 |
+
| `_v7_result.json` | the final 39/39 completeness verdict |
|
| 105 |
+
| `HASHES.txt` (repo root) | how you verify nothing changed: every artifact's SHA-256 in `sha256sum` format, matching the paper's Appendix A |
|
| 106 |
+
|
| 107 |
+
## Jargon box (all you need)
|
| 108 |
+
|
| 109 |
+
- **residual stream** β the model's running scratchpad: a 768-number state carried from layer to
|
| 110 |
+
layer; everything the model "thinks" passes through it.
|
| 111 |
+
- **activation** β the value of that state at some point; the raw numbers this work decodes.
|
| 112 |
+
- **layer boundary** β a checkpoint between layers where the state is read (13 of them in GPT-2 small).
|
| 113 |
+
- **noise floor** β how much you can jiggle the state before behavior changes; the model's own
|
| 114 |
+
tolerance, used as the pass bar everywhere.
|
| 115 |
+
- **certification** β a claim passes only by beating a pre-committed numeric bar against matched
|
| 116 |
+
random controls; "sounds right" never counts.
|
| 117 |
+
- **pre-registration** β the bar, the test, and the expected outcome are written and locked
|
| 118 |
+
*before* the experiment runs; misses are published, not patched.
|
| 119 |
+
- **transplant / speak test** β read context A's state as English, write that English into
|
| 120 |
+
context B's state, and measure how much of A's behavior the model now shows.
|
| 121 |
+
- **dark mass** β the part of the state the certified dictionary cannot read; here it is measured,
|
| 122 |
+
bounded (5.3% of transplantable meaning), and certified to resist every translation method
|
| 123 |
+
tried β it moves only as its exact raw configuration β not ignored.
|
| 124 |
+
|
| 125 |
+
## Verify it yourself
|
| 126 |
+
|
| 127 |
+
```bash
|
| 128 |
+
git clone https://github.com/wpferrell/babel-codec-gpt2 && cd babel-codec-gpt2 # 1. get the record
|
| 129 |
+
sha256sum artifacts/* # 2. hash every frozen artifact
|
| 130 |
+
diff <(sha256sum artifacts/* | sed 's|artifacts/||') HASHES.txt # 3. compare to the shipped list at the repo root (sha256sum format; first 16 hex chars of each hash appear in paper Appendix A)
|
| 131 |
+
pip install numpy matplotlib # 4. the only figure dependencies
|
| 132 |
+
cp artifacts/*.json . && python figs/make_paper_figs.py # 5. regenerate every paper figure (CPU, seconds) β the frozen script reads its 9 input JSONs from its parent directory, hence the copy to the repo root
|
| 133 |
+
```
|
| 134 |
+
|
| 135 |
+
Reproducing a full verdict row (GPU, minutes): see `repro/README.md`. Everything in the paper ran
|
| 136 |
+
on one 20 GB workstation GPU β there is no scale barrier between you and any number here.
|
| 137 |
+
|
| 138 |
+

|
| 139 |
+
*Why you might believe it: the completeness verdict came back "NOT YET" six pre-registered times
|
| 140 |
+
(11.2 β 3.1 unexplained nats), gap tables published each time, nothing relaxed β before the band
|
| 141 |
+
was finally met at 0.000.*
|
| 142 |
+
|
| 143 |
+
## Related work (credited, not competed with)
|
| 144 |
+
|
| 145 |
+
Anthropic's **Natural Language Autoencoders** (Transformer Circuits, May 2026) and **Cycle-
|
| 146 |
+
Consistent Activation Oracles** (Chalnev, March 2026) published the Englishβactivation translation
|
| 147 |
+
concept first; this record claims the whole-model, certified, behavioral complement. Four precise
|
| 148 |
+
differences (paper Β§7): coverage (every dimension at every boundary vs sampled mid-layer
|
| 149 |
+
activations), certification vs plausibility (falsifiable per-channel verdicts incl. proven
|
| 150 |
+
word-lessness vs learned glosses scored by reconstruction), constructive route (the model's own
|
| 151 |
+
certified channels + algebraic inverse vs a trained external translator), and a behavioral round
|
| 152 |
+
trip (the model *obeys* the edited English, scored against matched-random nulls, vs a round trip
|
| 153 |
+
scored in activation space β NLA's qualitative steering demo via reconstructed activations is
|
| 154 |
+
credited in the paper's Table 1). The read-direction
|
| 155 |
+
lineage (logit lens β LatentQA / ParaScopes / DecoderLens / Patchscopes) and the full-coverage
|
| 156 |
+
SAE releases (Bloom 2024, Gemma Scope, Bills et al. 2023) are engaged in the paper.
|
| 157 |
+
|
| 158 |
+
## Read more
|
| 159 |
+
|
| 160 |
+
- **The paper:** `paper/PAPER_V1.pdf` β every claim with its evidence hash (Appendix A maps each
|
| 161 |
+
number to its frozen source).
|
| 162 |
+
- **One-page summary:** `paper/PLAIN_SUMMARY.md`.
|
| 163 |
+
- **The closure records:** `paper/L5_CLOSEOUT.md`, `paper/L6_CLOSEOUT.md` + addenda β the two
|
| 164 |
+
loose ends hunted to certified negatives (five of seven favorite bets lost; every loss logged).
|
| 165 |
+
|
| 166 |
+
*If you re-run a row and get a different digit, open an issue β that is exactly what the hashes
|
| 167 |
+
are for.*
|