DeepSeek's web tools stop being free at 11 AM CT today, and agent loops feel it first
AspireAI community · DeepSeek API Docs
DeepSeek's Search and Fetch endpoints are billed per successful request, not per token: Search is $0.75 per 1,000 successful requests and Fetch is the same, charged separately. The waiver applied only to server-side tool calls made inside DeepSeek Harness, Claude Code and Codex, and it ends at 00:00 Beijing time on November 1, which is 16:00 UTC on October 31 and 11:00 AM Central today. Only billable requests count: a Search must return HTTP 200 with a non-empty results array and a Fetch must return extractable page content, so failures, empty searches and timeouts are free. Fetch still bills the returned text as input tokens on top of the request fee. Rate limits are computed per account and do not pool: 100 requests per second for Search and 25 for Fetch.
The honest limit: only those three named clients had the waiver, so anyone calling the endpoints directly was already paying the published rate.
https://api-docs.deepseek.com/guides/search/
Read the story and explore more from the AspireAI community.
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.