conductor/rune
1
2 Fork 1
Code Issues 38 Pull Requests 32 Actions 6 Packages Projects Releases 564 Wiki Activity

Future: GitHub code-search prior-art audit for graph and vector memory #182

New Issue
Closed
opened 2026-09-06 04:46:45 +01:00 by conductor · 7 comments
conductor commented 2026-09-06 04:46:45 +01:00
Owner
Copy link
Copy source
id, kind, subsystem, status, version_intent, depends_on, blocks
id kind subsystem status version_intent depends_on blocks
182 research memory open none

Auditing prior art by reading real code, not marketing

What is this about: When this work eventually runs: inspect real implementation code (not READMEs) of prior art — Graphiti, temporal graph systems, vector stores — via code search.

Why do we need it: Marketing lies; source code doesn't.

Why is it still open: Deliberately parked as future research.

What would let us close this

  • Prior-art audit performed on actual code, findings written to a durable document

Version impact (declared at submission — verified at merge)

  • major — breaking: changes a contract, schema, or interface others depend on
  • minor — new capability: something becomes possible that wasn't
  • patch — repair: same behaviour, done correctly
  • none — touches no released artifact (docs, memory, process notes)

Technical details (original description, preserved)

Original issue body

STATUS: FUTURE (deferred research — low priority)

Part of epic #181 (evidence-driven memory architecture). No implementation now.

Required work when eventually executed

Use gh / GitHub code search to inspect actual implementation code (not READMEs/marketing) for serious prior art:

  • Graphiti (temporal knowledge graphs: bi-temporal facts, invalidation, hybrid retrieval);
  • Neo4j agent-memory implementations;
  • Qdrant-based memory/retrieval systems;
  • other mature temporal graph / agent-memory projects.

For each mechanism capture: canonical data model; temporal validity representation; supersession/invalidation; entity resolution; provenance; retrieval path; graph/vector interaction; promotion/consolidation; deletion/forgetting; rebuildability; observed tests/benchmarks.

Deliverable

An ADOPT / ADAPT / BORROW / BUILD matrix with repository/code references per mechanism, so Nick can inspect exactly why Rune adopts or rejects each idea.

Anti-pathology

No prior-art tourism: every inspected mechanism must end in an explicit classification with evidence, or it does not count.

Dependencies

Read-only research; findings feed the typed-temporal-semantics child and the #161/#162/#163 benchmark work. Should precede any BUILD justification.

How Nick can verify this: a prior-art report exists with per-mechanism code references and an ADOPT/ADAPT/BORROW/BUILD verdict each; no verdict is asserted without cited implementation code.

--- id: 182 kind: research subsystem: memory status: open version_intent: none depends_on: [] blocks: [] --- # Auditing prior art by reading real code, not marketing **What is this about:** When this work eventually runs: inspect real implementation code (not READMEs) of prior art — Graphiti, temporal graph systems, vector stores — via code search. **Why do we need it:** Marketing lies; source code doesn't. **Why is it still open:** Deliberately parked as future research. # What would let us close this - [ ] Prior-art audit performed on actual code, findings written to a durable document # Version impact (declared at submission — verified at merge) - [ ] major — breaking: changes a contract, schema, or interface others depend on - [ ] minor — new capability: something becomes possible that wasn't - [ ] patch — repair: same behaviour, done correctly - [x] none — touches no released artifact (docs, memory, process notes) # Technical details (original description, preserved) <details><summary>Original issue body</summary> ## STATUS: FUTURE (deferred research — low priority) Part of epic #181 (evidence-driven memory architecture). No implementation now. ## Required work when eventually executed Use `gh` / GitHub **code search** to inspect actual implementation code (not READMEs/marketing) for serious prior art: - Graphiti (temporal knowledge graphs: bi-temporal facts, invalidation, hybrid retrieval); - Neo4j agent-memory implementations; - Qdrant-based memory/retrieval systems; - other mature temporal graph / agent-memory projects. For each mechanism capture: canonical data model; temporal validity representation; supersession/invalidation; entity resolution; provenance; retrieval path; graph/vector interaction; promotion/consolidation; deletion/forgetting; rebuildability; observed tests/benchmarks. ## Deliverable An **ADOPT / ADAPT / BORROW / BUILD** matrix with repository/code references per mechanism, so Nick can inspect exactly why Rune adopts or rejects each idea. ## Anti-pathology No prior-art tourism: every inspected mechanism must end in an explicit classification with evidence, or it does not count. ## Dependencies Read-only research; findings feed the typed-temporal-semantics child and the #161/#162/#163 benchmark work. Should precede any BUILD justification. **How Nick can verify this:** a prior-art report exists with per-mechanism code references and an ADOPT/ADAPT/BORROW/BUILD verdict each; no verdict is asserted without cited implementation code. </details>
conductor added the memorygovernanceinfrastructureP3 — low labels 2026-09-06 04:46:45 +01:00
conductor commented 2026-09-06 04:47:10 +01:00
Author
Owner
Copy link
Copy source

Part of epic #181. Depends on: none (read-only research) — but its findings are required before any BUILD justification in #161/#162/#163.

Part of epic #181. Depends on: none (read-only research) — but its findings are required before any BUILD justification in #161/#162/#163.
gitea-actions Bot added the ready label 2026-09-09 19:04:08 +01:00
gitea-actions Bot commented 2026-09-09 19:04:08 +01:00
Copy link
Copy source

🎓 NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory — dependencies satisfied (closed: #282); Rune may start.

🎓 **NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory** — dependencies satisfied (closed: #282); Rune may start.
gitea-actions Bot commented 2026-09-09 19:23:56 +01:00
Copy link
Copy source

🎓 NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory — dependencies satisfied (scheduled sweep); Rune may start.

🎓 **NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory** — dependencies satisfied (scheduled sweep); Rune may start.
gitea-actions Bot commented 2026-09-09 20:23:58 +01:00
Copy link
Copy source

🎓 NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory — dependencies satisfied (scheduled sweep); Rune may start.

🎓 **NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory** — dependencies satisfied (scheduled sweep); Rune may start.
gitea-actions Bot commented 2026-09-11 13:11:44 +01:00
Copy link
Copy source

🎓 NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory — dependencies satisfied (closed: #288); Rune may start.

🎓 **NEXT: #182 — Future: GitHub code-search prior-art audit for graph and vector memory** — dependencies satisfied (closed: #288); Rune may start.
gitea-actions Bot added the perception label 2026-09-19 14:53:14 +01:00
conductor added the research label 2026-09-19 14:56:35 +01:00
gitea-actions Bot commented 2026-09-19 15:01:02 +01:00
Copy link
Copy source

⚠️ Priority gate: this issue has no priority. Assign exactly one of P0 — critical (spine/correctness/blocks), P1 — high (material value or real defect), P2 — medium (quality/consolidation), P3 — low (measurement/deferred). An issue without a priority is not filed.

⚠️ **Priority gate:** this issue has no priority. Assign exactly one of **P0 — critical** (spine/correctness/blocks), **P1 — high** (material value or real defect), **P2 — medium** (quality/consolidation), **P3 — low** (measurement/deferred). An issue without a priority is not filed.
conductor commented 2026-09-19 16:27:43 +01:00
Author
Owner
Copy link
Copy source

Plain summary — why this closed

This idea now lives inside its parent epic #181 as a tracked checklist item — one open note per idea, less clutter on the board. Nothing was deleted: this issue's full detail is preserved below and in #181's absorbed-children section.

Technical details

  • STATE: HISTORICAL_EVIDENCE — absorbed into #181 on 2026-09-19
  • REVERSIBLE: re-mint as a standalone issue when the idea becomes live work
  • SUMMARY CARRIED: Auditing prior art by reading real code, not marketing
## Plain summary — why this closed This idea now lives inside its parent epic #181 as a tracked checklist item — one open note per idea, less clutter on the board. Nothing was deleted: this issue's full detail is preserved below and in #181's absorbed-children section. ## Technical details - **STATE:** HISTORICAL_EVIDENCE — absorbed into #181 on 2026-09-19 - **REVERSIBLE:** re-mint as a standalone issue when the idea becomes live work - **SUMMARY CARRIED:** Auditing prior art by reading real code, not marketing
Sign in to join this conversation.
No Branch/Tag Specified
Labels
Clear labels
P0 — critical
Spine/core correctness or blocks other work — do first
 P1 — high
Material user value or real defect (money, bugs, next-stage dep)
 P2 — medium
Quality/consolidation improvement
 P3 — low
Measurement / benchmark / deferred policy
 blocked
Dependencies open
 bug
Confirmed defect or regression
 custodian
epic
Rune v1 course-correction issue graph
 feature
New capability or improvement
 governance
growth
identity
in-progress
Currently being worked on by Rune
 incomplete
Incomplete work — draft PR with ledger, awaiting resume
 infrastructure
life
memory
memory-atlas
Memory Research Atlas child domain
 needs-testing
Needs manual testing with dumbed-down steps before close
 perception
ready
Order satisfied - Rune may start
 release-drift
research
Research jobs — spikes, watchlists, evidence work
 rune
rune
 scaffolding
scaffolding
 spine,correction
spine,correction
 spine,deferred
spine,deferred
 spine,resolved
spine,resolved
 strangler,burn,endgame,deferred
strangler,burn,endgame,deferred
 strangler,burn,endgame,inventory,epic
strangler,burn,endgame,inventory,epic
 tui
tui
 tui,epic
tui,epic
 tui,openspec
tui,openspec
 v1-course-correction
Rune v1 course-correction issue graph
No labels P3 — low governance infrastructure memory perception ready research
Milestone
No items
No Milestone
Projects
Clear projects
No projects
Assignees
Clear assignees
conductor
No Assignees
2 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: conductor/rune#182