
Open-source Semantic Control Plane for long-horizon agents & agent teams (6.7k+ ★). Built by @huangruiteng. Works with Codex, Claude Code, Gemini & DeepSeek.
- Tweets44
- Following13
- Followers6
- Likes17

ALT vLLM sparse-indexer TP row sharding. The old activation floor was 16,384 prefill rows per rank: 65,536 total rows at TP4, but 131,072 at TP8. In the reported 8-H100 setup, a 65,536-token batch budget could not reach the TP8 floor; raising the budget to 131,072 caused an out-of-memory failure. Merged PR 61647 sets the default floor to 65,536 total prefill rows through AttentionConfig.indexer_tp_shard_min_rows. It counts the current prefill batch, not full prompt length. To first order, both saved indexer computation and per-rank index exchange scale with (TP minus 1) divided by TP; a total-row floor need not grow linearly with TP. The default was calibrated on H200 with NVSwitch, not every interconnect. Other backend conditions still apply. TP2 deliberately moves from 32K to 64K. This diagram explains activation thresholds and a user report; it is not a new speed benchmark. Sources: zigzagcai, vLLM PR 54951 comment r4267244007 and PR 61647 (merged Oct 15). K means 1024 rows.

ALT Fork-and-Flush schematic: copy workspace files into four branches with new chats; select by score and continue. Polyomino mean scores: single run 88.56, flush only 85.91, fork only 90.74, fork-and-flush 94.41. Credits exclude solver/training compute. Paper-reported results, arXiv2610.07447v1; not independently replicated.

ALT Contributor case by @zigzagcai, vLLM PR #54951. Reported throughput includes input and output tokens: 17,856 to 23,675 tokens/s, +32.6%; TTFT 54.15 to 40.39 seconds. Conditions: GLM-5.3-Flash, 4 H200 GPUs, tensor parallelism 4, one sequential request, 1M input tokens, 256 output tokens, 65,536 batch budget, legacy runner with FA3. Mechanism: instead of every rank repeating all sparse-indexer MQA scoring and top-k query rows during prefill, assign cost-balanced contiguous row slices. Each rank retains the full causal key history; all_gatherv reassembles final indices. Decode kernels unchanged. Diagram uses 12 illustrative rows. At TP4 the new path needs at least 65,536 scheduled prefill rows plus backend gates; 1M context with an 8,192 budget is insufficient. Targeted retrieval: answer present 132/132 in each arm. General quality and bitwise equivalence unproven. Measured commits 5893426b to 16934c6e differ from final head a9fd692d. No independent GPU rerun.

ALT LoopX 六个长程问题的阶段判断,2026-10-24。1=有实现;2*=指定链路跑通;3=可比预算下有重复收益。主观工程进度,不是效果得分:通信拓扑/角色1/3;任务DAG1/3;轨迹信息2*/3;分层记忆2*/3;抽象与信念修正1/3;预算分配2*/3。仍待验证:按任务选拓扑与完整协作;拆分能否少返工;提炼信息能否改变后续行动;记忆分层、纠错遗忘及独立后续收益;何时提升抽象或修正信念;完整边际成本及分配收益。2*仅限定链路,不代表整个问题已完成。依据公开源码main c1a589a的Overall Roadmap §2/§5、Long-Horizon Harness Research RFC §4/§6/§8与已合并PR #7233的限定阅读链路。通用最优性与收益仍待验证。

ALT Engineering diagram of LoopX periodic-report recovery from merged PR #7207 (0c0d3dd). Left: one recovery may be admitted for the exact stale_goal_authority prelaunch refusal while retaining the same native Turn, task and report window; no host start or output, no completed native phases or effects, no frozen report, and fresh authority, idle chat and native lease are required. Right: a timeout or lost transport alone, started work, unknown or conflicting history, an existing report, revoked authority, busy chat or failed recovery do not authorize automatic retry. The allowed branch resumes the original native transaction once, then report body and original-chat delivery need separate verification. This is a policy diagram, not a product screenshot. A pure source admission check does not verify installed delivery.

ALT Source-based mechanism diagram for LoopX PR #7191, merge b8b9c1d, not a product screenshot or an installed recovery demonstration. After a host restart interrupts an ordinary private project request with tool activity but no final answer: keep the original failed Turn, verify source/binding/grant and stable idle native inventory, then reserve one read-only review in the original thread. Review existing results or report a concrete verification gap; verify delivery through the original transport separately. Final answers, stop/correction intent, live work, unstable inventory, or revoked/changed source or grant block recovery. The review profile disables writes, network, MCP, Apps and delegation. Steward, attached and group requests are excluded. Observed tool activity is not proof of business success. Installed result return remains unverified.

ALT Synthetic LoopX input-share example, not a product screenshot or a real research measurement. The same packet is estimated as two o200k_base tokens in request A (100 native input tokens) and request B (900). Summing per request gives four estimated packet tokens divided by 1,000 native input tokens, or 0.4%. Input includes cache. With partial request coverage, the overall percentage is unknown; packet cache allocation is unknown. Local tiktoken 0.12.0; the provider model tokenizer is unverified. Source revision 385771e.

ALT Two synthetic LoopX BM25 examples. Query 态机, document 状态机: default word analysis does not return it; explicit Han bigrams returns it via 态机. Query 状态机, document 状态检查: default word analysis does not return it; Han bigrams also returns it because only 状态 overlaps. Native calls on two synthetic documents, not a retrieval-quality benchmark. Source revision bd67d651ac.

ALT Illustrated teaching workflow, not live execution. A requester sends a correction through the maintainer to the build peer's existing work session. A research peer provides an artifact dependency; evidence returns through the maintainer to the requester. Each peer accepts its own scope. Dependency is not proof of adoption, and returned evidence is not outcome acceptance. LoopX 2.0 development preview; no measured capability or efficiency gain is shown.

ALT Teaching example with synthetic files. The receipt matches checker.py, expected.txt and result.txt. After result.txt changes, its SHA-256 no longer matches, so current success becomes stale while the historical receipt is kept. Inspect reads current bytes without executing checks. The example illustrates the optional owner-pinned checker contract in LoopX v1.4.2; it is not an app screenshot, sandbox guarantee, independent review or a benchmark result.

ALT LoopX research-method graphic. One historical Portfolio observation: risk evidence was recorded, tail protection was implemented, and stress checks passed, but allocations on the observed inputs were unchanged. Recording, implementation and tests did not establish an actual intervention. The case does not isolate the value of LoopX or a memory graph; compare with equivalent file or conversation notes before attributing gains.

ALT LoopX evidence graphic. Zheng Cai reports using LoopX as a vLLM optimization workflow engine. Upstream PR 54951 merged October 11, 2026 UTC. Reported total-token throughput gains rise from 2.79% at 128K input to 32.59% at one million input tokens. At 1M, server TTFT falls from 54.154 to 40.388 seconds. GLM-5.3-Flash, four H200 GPUs, TP4, concurrency one, 256 output tokens, 65536-token batch budget, legacy runner with FA3, four fresh-process A/B pairs, warmups excluded. These are workload-specific upstream reports, not independently rerun, saturated serving throughput or an isolated LoopX uplift.


