The claim

CASE-154’s construction: X₁, X₂ independent fair bits, and an observer that reads one coordinate and cannot compute XOR. The raw pair U = (X₁, X₂) gives error 50% on Q_A = X₁ ⊕ X₂ and 0% on Q_B = X₁; the compressed V = X₁ ⊕ X₂ gives 0% and 50%. Passing from U to V makes Q_A legible and Q_B illegible for the same observer, so neither representation is better for that observer apart from the task. CASE-154: “a learned legibility regime can be competence-enhancing for one perspective and disabling for another, with no task-independent sense in which it is better or worse.”

It completes CLAIM-199. That claim holds that a garbling can raise a given receiver’s usable information, but never above what the source makes possible; V is a garbling of U, and it raises the observer’s usable information on Q_A. What CLAIM-199 does not say is that the same garbling lowers it on Q_B. Legibility (TERM-064) is relative to an observer and a task, and the construction shows the task argument cannot be dropped even with the observer fixed.

What it does not say

  • Which task should win. Choosing a regime is choosing whose distinction counts, a normative question the construction does not touch (CLAIM-348).
  • That the observer could not learn XOR. The observer is bounded by stipulation; a richer observer orders U above V by Blackwell’s order.
  • Anything about real institutions. CASE-154’s examples (reporting that forecasts output better and registers grievances worse) are illustrations, not findings.