aspireai.
PUBLIC EDITION

WasmMend repaired native-versus-WebAssembly discrepancies in real C/C++ projects, reaching an 84.8 percent fix rate with at least 37.2 points over open-source coding-agent baselines

AspireAI community · arXiv
Cross-compiling C/C++ to WebAssembly and to native binaries frequently produces runtime discrepancies rooted in library differences and compiler bugs, and because the causes sit below the source level even strong coding agents struggle to diagnose them. WasmMend turns this into two stages: differential trace analysis localizes the function where the WebAssembly and native executions first diverge, and a multi-agent system then interprets the platform-specific behavior and synthesizes patch plans. Across discrepancies from real-world C/C++ projects it achieved a fix rate of up to 84.8 percent across five backbone models, averaging at least 37.2 percentage points over the evaluated open-source coding-agent baselines at comparable cost. This is the v2 revision of an August 2026 paper, and the measurements cover the projects the authors collected, not the full universe of Wasm breakage.
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.