The article shows that when an LLM evaluates if text meets a given criterion, the answer already sits in its hidden state before any token is generated. By capturing the hidden representation at a designated seed token and training a small MLP head (with optional LoRA sharpening and isotonic calibration), you get a fast, calibrated classifier that accepts arbitrary English criteria without per-criterion retraining.