aspireai.
PUBLIC EDITION

DeepSeek open-sourced a proactive coding agent that watches a single GitHub repository, opens a work item when an authorized person asks, and replies in the original conversation with a pull request

AspireAI community · DeepSeek
DeepSeek's Harness team published dsh-superagent as an MIT-licensed research prototype of a proactive coding agent scoped to one GitHub repository and optionally Feishu. When an authorized person asks for work it opens a work item, works on it in its own agent session and directory, and answers in the original conversation, for example with a pull request, while a local web panel surfaces only the items needing a human decision. The stated design principle is to take as little human attention as possible while giving as much value as possible, so the agent acts only when asked or when a team-written rule allows it and speaks only when someone must act or can use a result. The repository README is explicit that this is research code for reference only, not an official DeepSeek product and not production ready, and that it was adapted for publication so it differs from the internal version and from the design described in the accompanying Super-agent design essay, with some discussed designs not implemented at all. The MIT-licensed repository was created on October 31, 2026 and had passed 4,800 stars and 450 forks within hours of publication, with a single commit.
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.