Context Warp Drive – deterministic, zero-LLM context compaction
Deterministic folding beats LLM summarization with 92% cache hits and zero extra model calls.

15-18pp fact recall boost over flat summarization with full provenance tracing.
LLM application developers, AI researchers
Ran seven trials against flat summarization. UF led by 15-18pp on fact recall in every trial. One hit significance (p=0.039), the rest are directional. The interesting finding: flat summaries drop "footnote" facts (cron schedules, webhook paths) because they compete against headline facts for space. Per-cluster summaries don't have that pressure.
Code and trial logs: https://github.com/kimjune01/union-find-compaction
Deterministic folding beats LLM summarization with 92% cache hits and zero extra model calls.
Persistent memory for Claude Code with auto-compaction recovery—but relies entirely on external API.
Runs 80M tokens in one session by evicting context instead of summarizing.
Project memory that survives tool switching—what Claude learns, Cursor can use.
Another context management pitch when Cursor and Continue already solve this.
Free browser-based repo converter when JinaAI and Firecrawl already exist.