프로토타입 · 미리 보기: 공식 레지스트리의 모든 서버를 담고 있으며 30분마다 동기화해요. 리뷰와 계정 기능은 다음 단계에서 열려요.
PopNx MCPAI를 쓰는 사람을 위한 MCP 서버 · 쉬운 말로 설명해요

Ori Memory

제작자: aayoawoyemi버전 0.3.0i★ –i내 컴퓨터에서 실행
레지스트리 이름io.github.aayoawoyemi/ori-memory

설치

개요

제작자가 쓴 설명(영어 원문)

Persistent memory infrastructure for AI agents. Identity, knowledge graph, and search.

PopNx MCP의 세 기둥

이 세 가지는 절대 하나의 점수로 합치지 않아요. 의견, 측정, 인기는 서로 다른 것이니까요.

할 수 있는 일

이 서버는 아직 쉬운 말로 된 요약을 쓰지 못했어요. 아래는 레지스트리에서 읽어 온 사실이에요.

  • 연결 방식: 내 컴퓨터에서 실행
  • 전송 방식: stdio
  • 카테고리: 검색 및 AI 기억

설치

쓰고 있는 AI 앱을 고른 다음 설정을 복사하세요.

설치하기 전에

  • 기본 점검: 1개 중 1개 통과
  • 내 컴퓨터에서 내 사용자 계정의 권한(파일, 네트워크, 앱)으로 실행돼요.
  • 레지스트리에 입력해야 할 키가 나와 있지 않아요.

필요한 것

  • npmNode.js 설치(npx 명령어용)

어떤 앱을 쓰세요?

위에서 앱을 고르세요. 기억해 두었다가 다음부터는 버튼에 “…에 설치”라고 표시해요.

Claude Desktop → Settings → Developer → Edit Config를 열고 claude_desktop_config.json에 이 내용을 붙여 넣으세요

{
  "mcpServers": {
    "ori-memory": {
      "command": "npx",
      "args": [
        "-y",
        "ori-memory"
      ]
    }
  }
}

터미널에서 이 명령어를 실행하세요

claude mcp add ori-memory -- npx -y ori-memory

Cursor에서 열기

또는 설정을 직접 복사하기

프로젝트의 .cursor/mcp.json 또는 ~/.cursor/mcp.json에 붙여 넣으세요

{
  "mcpServers": {
    "ori-memory": {
      "command": "npx",
      "args": [
        "-y",
        "ori-memory"
      ]
    }
  }
}

브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.

VS Code에서 열기

또는 설정을 직접 복사하기

프로젝트의 .vscode/mcp.json에 붙여 넣으세요

{
  "servers": {
    "ori-memory": {
      "type": "stdio",
      "command": "npx",
      "args": [
        "-y",
        "ori-memory"
      ]
    }
  }
}

브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.

이 서버는 내 컴퓨터에서 실행되는데, ChatGPT는 인터넷에 있는 서버에만 연결할 수 있어요. 다른 앱을 고르세요.

선택한 앱은 이 기기의 쿠키에만 저장돼요. 계정은 필요 없어요.

이 설정은 제작자의 레지스트리 정보로 만들었어요. README와 다르면 README를 따르세요.

할 수 있는 일

내 컴퓨터에서 실행돼요. 설치하면 AI 앱에 도구 목록이 나타나요.

기본 점검i

누구나 볼 수 있는 정보를 점검했고, 코드는 읽지 않았어요. 해당하지 않는 항목은 개수에서 뺐어요. · 2026년 11월 8일 점검

  • ✓ 통과

    제작자와 저장소 일치

    레지스트리 이름이 GitHub 계정 aayoawoyemi 기준으로 확인되었고, 이 계정이 저장소를 소유하고 있어요

  • … 아직 점검 안 함

    계속 관리되고 있음

    아직 GitHub에서 이 저장소를 읽어 오지 않았어요

  • … 아직 점검 안 함

    라이선스 있음

    아직 GitHub에서 이 저장소를 읽어 오지 않았어요

  • – 해당 없음

    엔드포인트 응답

    내 컴퓨터에서 실행되는 서버라 인터넷 엔드포인트가 없어요

  • – 해당 없음

    OAuth로 로그인

    내 컴퓨터에서 실행되며, 대신 로컬 설정을 사용해요

  • … 아직 점검 안 함

    도구 설명에 숨겨진 지시 없음

    내 컴퓨터에서 실행돼요. 도구 목록은 인터넷 엔드포인트가 있는 서버에서만 읽을 수 있어요

검색 및 AI 기억 카테고리의 다른 서버와 비교i

  • 이 카테고리의 다른 서버 5670개 중 0%보다 스타가 많아요
  • 이 카테고리의 다른 서버 5670개 중 4%보다 최근에 레지스트리에 공개됐어요
  • 기본 점검 결과가 이 카테고리의 다른 서버 5670개 중 100%와 같거나 더 좋아요

레지스트리에서 이 카테고리의 활성 서버 전체와 비교했어요. 스타는 게시자가 저장소를 소유한 경우에만 세요.

자주 묻는 질문

Ori Memory, 안전한가요?

해당하는 기본 점검 1개 중 1개를 통과했어요. 코드는 읽지 않았어요. 키나 토큰을 넣기 전에 서버가 어떤 권한을 요구하는지 확인하고, 꼭 필요한 권한만 있는 키를 쓰세요.

어떤 키나 코드가 필요한가요?

레지스트리에 필수 키가 나와 있지 않아요. 다만 처음 쓸 때 로그인을 요구하는 서버도 있어요.

내 컴퓨터에서 실행되나요, 클라우드에서 실행되나요?

내 컴퓨터에서 실행돼요. AI 앱이 필요할 때 실행하고, 데이터는 제작자의 서버를 거치지 않아요(서버 자체가 온라인 서비스를 호출하는 경우는 제외).

아직 관리되고 있나요?

GitHub 저장소는 마지막으로 – 변경됐고, 최신 버전(0.3.0)은 8개월 전 레지스트리에 올라왔어요.

어떤 앱에서 쓸 수 있나요?

Claude Desktop, Claude Code, Cursor, VS Code처럼 MCP를 지원하는 앱에서 쓸 수 있어요. 내 컴퓨터에 Node.js도 있어야 해요.

대신 쓸 수 있는 건 뭐가 있나요?

같은 카테고리에는: Context7, Codebase Memory, Exa

대안

같은 카테고리에서 다른 제작자가 만든 서버예요. 스타 순으로 정렬했어요.

카드 보는 법:★ GitHub 스타i세 기둥: 리뷰 · 점검 · 사용 정도i업데이트 = 최신 버전을 레지스트리에 공개한 날i

Context7

제작자: upstash

Up-to-date docs for AI agents

컴퓨터 또는 클라우드★ 64,224MIT어제 업데이트
설치

Codebase Memory

제작자: DeusData

Codebase knowledge graph for AI agents — 162 languages, sub-ms queries, 99% fewer tokens.

내 컴퓨터에서 실행★ 48,148MIT21일 전 업데이트
설치

Exa

제작자: exa-labs

Connect AI agents to Exa for web search, content fetching, and multi-step research.

클라우드에서 실행★ 5,213MIT2개월 전 업데이트
설치

제작자의 README

README 열기

제작자의 저장소에서 쓰인 그대로 가져왔어요. PopNx MCP가 검토하거나 보증한 내용이 아니에요. HTML, 이미지, 스크립트는 제거했어요. 링크를 누르면 이 사이트를 벗어나요.

Ori Mnemos

Open-source persistent memory infrastructure for AI agents.

Ori implements human cognition as mathematical models on a knowledge graph. Activation decay from ACT-R. Spreading activation along wiki-link edges. Hebbian co-occurrence from retrieval patterns. Reinforcement learning on retrieval itself. Recursive graph traversal with sub-question decomposition. The system learns what matters, forgets what doesn't, and optimizes its own retrieval pipeline.

Persistent memory across sessions, clients, and machines. Zero-infrastructure retrieval that matches and in several cases strongly outperforms incumbents on benchmarks — and you own every byte of your data. Markdown on disk. Wiki-links as graph edges. Git as version control. No database lock-in, no cloud dependency, no vendor capture.

v0.7.0 · npm · Paper · Apache-2.0


Use

Ori is three surfaces over one index. The markdown is the truth; the index is derived. The learned half — Q-values, LinUCB arms, retrieval history — is not, so export it before deleting anything (see When to rebuild).

CLI

npx ori init          # scaffold a vault

npx ori index build # derive the index npx ori explore "…" # navigated retrieval npx ori sql "…" # read-only SQL over the index

MCP server — ori serve, registered in a client config. This is how an agent uses it.

Library — recall is the same wired entry the CLI and the MCP ori_recall tool both go through, so the programmatic path and the agent path cannot drift.

import { recall } from "ori-memory";

const res = await recall("./vault", "what did we decide about caching?", { limit: 5 }); for (const hit of res.data.results) console.log(hit.title, hit.score);

searchComposite is also exported for callers that have already assembled vectors, graph metrics and a config; recall does that assembly for you.

The export surface is deliberately small and is a semver contract; the rest of src/core is internal. Versions before 0.8.0 shipped no main and no exports, so a bare import threw and the library path did not exist — but the CLI and MCP paths always worked, and existing users were unaffected.

ori-memory/cli resolves to the CLI entry, for callers that need to locate the binary and spawn it rather than link against it. require.resolve on it is the intended use; importing it runs the CLI.

Benchmarks

ForgetEval — Can It Forget On Command?

deeplethe/lethe, bench/forgeteval/, MIT. No API key, no network, no LLM judge. The scorer is a ~20-line deterministic substring check in GeneratedCase.run(): it calls recall_texts(query, k=10) itself, joins the top 10, and tests must_contain / must_not_contain. Generation is random.Random(42) over templates. The optional LLM hook is llm=None by default and was not used.

familyOriwhat it requires
supersession200 / 200replace a fact, old value must not surface
decay200 / 200release(query) — soft-evict on demand
amnesia198 / 200evict one subject, keep the bystanders
purge182 / 200hard-delete, verbatim secret must be gone
drift198 / 200two supersessions in sequence, only the last survives
overall978 / 1000 (97.8%)1,000 generated cases, seed 42

Not fitted to the suite: unseen seeds give 97.2% (seed 7) and 98.0% (seed 123). The fixes were structural bugs in the matcher, not case-specific patches.

Quote these against a 35% floor, not against zero. The oracle is must_contain AND must_not_contain over the top 10, and when must_contain is empty — every decay case and 150 of 200 purge cases, 350 of 1,000 — a system that returns *nothing* passes vacuously. A null adapter that accepts writes and never returns anything scores 350/1000 = 35%, including 100% on the whole decay family. On the 650 cases that actually discriminate, Ori is 628/650 = 96.6% and its purge drops from 91% to 64%, which is its real weak spot. The published LangMem 99.5 / Lethe 99.3 / Mem0 88.8 are full-suite and carry the same floor. See docs/falsification/forgeteval-validity.md.

Systemtemplateadversarial
LangMem99.5—
Lethe v199.363.4
Ori Mnemos97.865.7
Mem088.868.3
MemPalace0—

Ori scored 0/1000 on this benchmark earlier the same day. Not a low score — a structural zero. ForgetEval's adapter protocol has three optional operations, supersede, release and purge, and Ori had none of them: zero source hits across src/. Every case was N/A. The ACT-R decay and Ebbinghaus curves Ori already had are ranking-time priors, and no benchmark measures those; ForgetEval's "decay" family means an explicit release(query) call. src/core/forget.ts is 305 lines and closed the whole gap in a day, which is the most informative number on this page.

That table is not a ranking, and "third" would be a bad way to read it.

ForgetEval's code lives inside deeplethe/lethe — the benchmark and its top-scoring system are the same org, in a repo with 14 stars. The template column has four entries, one of which (MemPalace) scores 0 by construction because it exposes no deletion primitive at all. Two of the rest saturate. On the adversarial layer Ori is 5th of 14 configurations and lands inside the 63–68% band the paper's own McNemar test calls noise (χ²=0.125, p=0.724); the paper's words are "the bench reads the trade-off, not a winner." The one comparison that is statistically real is Ori vs Lethe on template, z=2.81, p=0.005 — Lethe is genuinely ahead.

Who is missing matters more than who placed. Supermemory (30.6k stars, $2.6M seed) ships POST /v4/memories/forget-matching — natural-language forgetting with dryRun, threshold, maxForget and an audit handle — plus versioned PATCH supersession. That is a better-specified control plane than anything scored here, and it maps onto the adapter protocol almost verbatim. It has never been benchmarked. Neither have Hindsight (24.0k), Cognee (30.8k, excluded for API incompatibility), MemOS (11.5k) or Honcho (7.3k).

So the honest claim is not that Ori forgets better than the field. It is that Ori forgets offline, with no API key, and that the field has no idea how well it forgets:

Fifteen agent-memory systems were checked. **Zero publish a forgetting

benchmark for their own system.** Five such benchmarks exist — ForgetEval,

Memora/FAMA, MemoryAgentBench-SF, StateMemBench, MemLeak — and vendors

cite none of them. Every forgetting number in existence was produced by a

rival or an outsider.

Read the adversarial column with one more caveat. 253 of its 385 cases were admitted only if the vendor's own system passed them, annotated in adversarial.py as "Oracle-validated (Lethe / Lethe+LLM passes the case)". The authors' own blind 77-case external subset drops the whole field from the 63–68% band to 28–33%, which says the in-house suite is materially easier. A benchmark whose admission filter is "the measurer's system solves it" cannot rank the measurer.

Reproduce:

git clone https://github.com/deeplethe/lethe && cd lethe

cp /bench/forgeteval_ori_adapter.py bench/forgeteval/ori_adapter.py export ORI_BRIDGE= /bench/forgeteval-bridge.mjs python -m bench.forgeteval.run --adapter ori --suite template --scale 200 --seed 42

Four minutes, 1,000 cases, $0.00. The adapter talks NDJSON to a resident Node process because the harness makes ~10 calls per case and a CLI subprocess per call would spend hours on interpreter startup.

HotpotQA — Multi-Hop Retrieval

Head-to-head against Mem0. Both systems indexed the same documents and answered the same questions in the same run.

MetricOri MnemosMem0 1.0.6Δ
Recall@50.870.293.0×
MRR0.910.422.2×
Retrieval F10.510.262.0×
Answer proxy0.730.342.1×
InfrastructureMarkdown + SQLiteRedis + Qdrant + cloud—

n = 50, single run, no seed averaging, topK = 5. Mem0 at 1.0.6 (March 2026); 2.x is not yet re-run, so read this as a point-in-time comparison, not a current one. Raw output: bench/results/, reproduce with bench/hotpotqa-eval.ts and bench/mem0-hotpotqa.py.

These are not HotpotQA's official metrics and must not be compared to the HotpotQA leaderboard. The official scorer, hotpot_evaluate_v1.py, reports answer EM/F1 under its own normalize_answer, plus supporting-fact F1 over (title, sentence_id) pairs, plus joint EM/F1. The table above is a title-level retrieval metric defined in bench/hotpotqa-eval.ts, and "answer proxy" is not a HotpotQA metric at all — it is token recall of the gold answer against retrieved text. The comparison is valid in one direction only: Ori and Mem0 went through the *same* harness on the *same* questions, so the ratio between the two columns means something. The absolute numbers do not transfer anywhere.

At n = 50 the Wilson 95% intervals are Ori [0.75, 0.94] and Mem0 [0.18, 0.43] on Recall@5. They do not overlap, so the gap is real, but the two-decimal precision in the table is not: read 0.87 as "high 0.80s".

Latency is not reported here. The evaluation harness does not record it, so any number would be recalled rather than measured. What is measured is that Ori answers from markdown plus a local SQLite index with no API key and no network.

LoCoMo — Long-Term Conversational Memory

1,536 questions over 10 conversations. Retrieval is BM25 + embedding + PageRank fusion at top-5. No API key and no network: the answer column is an extractive proxy, token recall of the ground-truth answer against retrieved text, not a generated answer.

CategoryRecallAnswer F1MRRn
open-domain0.9430.929—841
single-hop0.8630.758—321
multi-hop0.5280.670—282
temporal0.5650.478—92
overall0.8270.8190.7291,536

Raw output: bench/results/locomo-eval-2026-09-19T22-37-31-698Z.json. Reproduce with npx tsx bench/locomo-eval.ts --json; the run takes 48 s.

Multi-hop and temporal are the weak categories and are reported as such.

Two corrections to earlier versions of this file, both found on 2026-09-19:

  • It previously reported 695 questions and an overall recall of 0.687. That subset silently excluded the open-domain category, which is 841 of the 1,536 questions — more than half the benchmark. The per-category figures were close to correct; the "overall" was an average over a hand-picked three categories. bench/README.md carried a third set of numbers again (44.7% recall) that reproduces nothing in the current harness. One number now, with the run file beside it.
  • The 2026-09-19 run reproduces the 2026-07-22 run to three decimals, so these figures are stable across the retrieval-metric repair in 09ac45d and the lambda change in 72fdd13.

No comparison table against published LoCoMo leaderboards is given, on purpose. Those are LLM-judge scores; the above is token F1. They are different quantities and putting them in one column would invent a ranking rather than report one. A previous version of this README did exactly that.

LoCoMo itself has known defects. An independent audit found 6.4% of questions carry wrong answer keys, putting the theoretical ceiling at 93.57%, and the standard gpt-4o-mini judge accepts 62.81% of deliberately wrong answers. At least one publ

앞부분만 보여 드려요. 나머지는 저장소에서 읽어 보세요

PopNx에게 묻기