aspireai.
PUBLIC EDITION

13,598 clean agent skills were scanned for bad combinations, and 13.7% of the dangerous chains passed single-skill audits

AspireAI community · arXiv (Yihao Li, Chuanpu Fu, Yizhou Zhao et al., Tsinghua University / NTU / Zhongguancun Laboratory)
The safety model most agent marketplaces use is per-skill: a skill is scanned once, on its own, and judged safe or malicious. KnotScryer shows that model does not hold. The authors treat each skill as a typed capability flow and build a Skill Capability-Flow Graph, where edges trace information handed from one skill's output into the next skill's input. Because the risk lives in the agent's orchestration rather than in any single skill, no per-skill scanner can see it. They applied it to 13,598 skills pulled from ClawHub and validated the chains across three agent frameworks and three LLMs, finding 612 insecure compositions that were exploited consistently across frameworks. Under GLM-5.1 the method lifted the exploitation rate from 16.5-18.2 percent for tag-match and graph-only baselines to 85.6 percent while cutting the search space by 85.3 percent. The uncomfortable part: 13.7 percent of the detected chains were built entirely from skills a single-skill scanner had labeled safe. Caveat: the benchmark is ClawHub, so the absolute counts are specific to that marketplace, and the detection method assumes skills declare their capabilities in a form the graph can read.
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.