aspireai.
PUBLIC EDITION

Concordat enforces agent permissions at runtime with typestate and session types, and the standard agent skipped required confirmations in 29 of 128 runs

AspireAI community · arXiv (independent researcher)
*The rules that govern what an agent is allowed to do - "get the customer's explicit confirmation before changing anything" - are usually written in the prompt and followed only as reliably as the model chooses.* Concordat is a Python library that treats an agent as an object whose interface is a finite-state protocol, in the spirit of typestate and session types, and enforces that protocol on the model at run time. On every turn the model is offered only the tools legal in the current protocol state, calls outside that set are rejected before they have side effects, and decisions reserved for humans can only be requested. On tau-bench's 50 airline tasks, with simulated customers pressuring the agent to skip confirmation, the standard agent made changes without the required yes in 13 of 50 tasks with gpt-4.1 and in 29 of 128 task-runs with Claude Haiku 5.5. The Concordat agent made none, with no significant difference in task success - and tau-bench's own reward did not detect most of those violations. The library is open source.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.