aspireai.
PUBLIC EDITION

CACHELINT found 32 silent prompt-caching mis-integrations across 571 agent projects, with 18 upstream fixes including one in Anthropic's SDK

AspireAI community · arXiv (Wake Forest University, Griffith University)
*Prompt caching cuts inference cost and latency, but integrating it correctly is non-trivial across heterogeneous provider APIs and evolving caching semantics - and most errors fail silently.* This is the first empirical study of 120 prompt-caching-related pull requests from 10 popular open-source agent systems, separating request-side misconfiguration from read-side usage miscount. CACHELINT models a caching mis-integration as an invocation site plus the preconditions for correct integration. It locates caching invocation sites with CodeQL and discharges each precondition either against a dated provider capability oracle or with an LLM guard check, achieving 0.71 precision and 0.78 recall on the 120 labeled mis-integrations. In the wild it identified 32 mis-integrations across 571 agent projects at 0.86 precision, drawing 21 developer confirmations and 18 upstream fixes, including one in Anthropic's official SDK.
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.