jcode: memory recall without embeddings
Project / 项目 · In the catalogue / 在目录中查看
What Jev decides here · Jev 在这里做什么决定
Search & ranking (检索与排序), Context compaction (上下文压缩)
noul: read in the code by a person 由人在代码里读到
a person read the call site 有人读过调用点 · · Cited file / 引用的文件: crates/jcode-base/src/jev.rs
Summary · 摘要
Replaces the whole retrieval stack for memory recall — no embeddings, no BM25, no reranker — with one batched Noul per candidate memory.
把记忆召回的整套检索栈替换掉 —— 不用 embedding、不用 BM25、不用重排器 —— 改为对每条候选记忆批量问一个 Noul。
Notes · 备注
The most aggressive substitution found: it removes retrieval infrastructure rather than augmenting it. Whether that trade holds at scale is unmeasured.
找到的最激进的替换：它是移除检索基础设施，而不是给它做增强。这个取舍在大规模下是否成立，尚无实测。
Launches · 发布记录
Not launched yet. 还没有发布过。 Launch it / 发布它 ↗ · How a product launches / 怎样发布一个产品
Makers · Maker
Made this? Confirm or correct its entry / 这是你做的？确认或更正条目 ↗
The same form takes the product's one line and a demo link, in its maker's own words. 同一个表单也可以补上产品的一句话和演示链接，用 Maker 自己的话。
Badge for its README · README 徽章
[](https://kydlikebtc.github.io/awesome-jev/products/jcode-memory-recall.html)One line for the product's README, linked to this page. The picture says that it is listed; while it is on the launch board, that it is launching; after a week in the top three, its place. It is rebuilt with the site, so the line never needs changing. 放进产品 README 的一行，链接到本页。图片显示已收录；在发布榜上时显示正在发布；进过某周前三后显示名次。它随网站一起重建，这一行不用再改。
Also under this pattern · 同一模式的其他产品
AutoGPT TypeSafe blocks
Seven production blocks — choice, score, yes/no, ask-many, route, pick-best, filter — with a UTF-8 byte budget, verbatim wire capture and eleven test files.
OpenViking: retrieval reranking
One Noul per candidate document in a single batched request, with the yes-probability used directly as the relevance score.
oh-my-pi
⌥ Coding agent with the IDE wired in
FastMCP jev_search transform
Two-stage MCP tool search: a wide Choice coarse-ranks the whole catalogue, then a shortlist gets full descriptions plus one Noul each to decide whether it does the job at all.
XERJ
Local-first search engine and MCP server in one Rust binary. Its optional `rerank` stage asks Jev one `noul` per top hit (does `document` answer the query in the state?) and re-sorts by the probabilities. The authors report FiQA nDCG@10 rising from 0.24 to 0.36, about $0.64 for 648 searches.