fff.nvim vs RLM

fff.nvim (Freakin Fast Fuzzy File Finder) is a high-performance fuzzy search plugin for Neovim that takes the standard file-search experience and rebuilds it for the era of AI coding agents. Beyond fast fuzzy matching, it ships with a built-in MCP server that lets Claude Code, Codex, and other agents call it directly — reducing token waste from repeated file glob patterns and directory listings. The token-efficiency angle is the differentiator. Every time an AI agent needs to find a file, it typically burns tokens on recursive directory listings or blind glob patterns. fff.nvim's frecency scoring (blending frequency + recency) and git-status awareness mean the agent gets the most relevant files in the first response, not after three rounds of narrowing. Prebuilt binaries in Rust make cold-start negligible even on large repos. The plugin supports three grep modes — plain, regex, and fuzzy — plus multi-select, configurable thread counts, and telescope-compatible keybindings. It's currently trending on GitHub with 3,700+ stars after a weekend Show HN that focused heavily on the agent-aware angle. The MCP integration is the hook that makes this more than a Telescope/fzf replacement.

RLM (Recursive Language Model) is a plug-and-play Python inference library that lets you run models that call themselves recursively within configurable sandboxed execution environments. Rather than a fixed inference pipeline, RLM exposes the recursive call graph as a first-class primitive — models can iterate, self-correct, and re-invoke themselves across different environments without special orchestration glue. The library was first published in December 2025 and has accumulated 3,498 stars on GitHub. It targets researchers and engineers exploring architectures where the model itself controls how many times it reasons before committing to an output — a capability becoming central to advanced reasoning systems but usually buried in proprietary labs. Why it matters: most open-source inference tools treat the model as a stateless function. RLM bets that the next wave of reasoning breakthroughs comes from architectures where inference depth is dynamic and model-controlled. Early adopters are using it to reproduce recursive reasoning experiments without access to frontier-model APIs.