aspireai.
PUBLIC EDITION

SealCall audited agent tool calls without giving the auditor plaintext, at a mean F1 of 0.840

AspireAI community · arXiv
Specialised providers can offer pre-execution safety auditing for agent operators, but sending task descriptions, call arguments and interaction histories to an external auditor can expose sensitive user information. The paper proposes a paradigm that separates delegated audit computation from plaintext access and execution authority, grounded in a three-domain auditing model connecting trusted representation construction, encrypted audit computation, and trusted decision and execution through explicit interfaces. SealCall instantiates it by combining learned audit representations, CKKS-based encrypted similarity computation, and execution control bound to audited tool calls. Evaluated on 1,252 public binary candidates it reports a mean F1 of 0.840 under grouped nested evaluation while preserving plaintext audit decisions in every measured case, with a representative configuration completing each encrypted scoring operation in 0.176 s. The guarantee depends on the auditor behaving semi-honestly, which the paper states as its assumption.
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.