HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
vac-architector
VAC-Memory-System
Python2025–2026
vac-architector / VAC-Memory-System

VAC-Memory-System

From cell-tower climber & handyman to AI Architect in 4.5 months via Claude CLI. Built VAC Memory System: SOTA RAG (80.1% LoCoMo) on gpt-4o-mini. Proprietary MCA ranking, <$0.10/M cost, 100% isolation. Open to partnerships.

3Distinct people
12Mentions
0Explicit recommenders
33GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

From cell-tower climber & handyman to AI Architect in 4.5 months via Claude CLI. Built VAC Memory System: SOTA RAG (80.1% LoCoMo) on gpt-4o-mini. Proprietary MCA ranking, <$0.10/M cost, 100% isolation. Open to partnerships.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 8–Nov 15 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/15/2026, 12:03:30 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by week12 dated mentions

Observed mentions: 2025-11-24 16:43:22 UTC to 2026-01-04 01:18:45 UTC. Weeks start Monday, UTC.

02462025-11-24 00:00:00 UTC to 2025-12-01 00:00:00 UTC (exclusive): 6 mentions; 5 submissions, 1 commentsNov 242025-12-01 00:00:00 UTC to 2025-12-08 00:00:00 UTC (exclusive): 2 mentions; 2 submissions, 0 comments2025-12-08 00:00:00 UTC to 2025-12-15 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsDec 82025-12-15 00:00:00 UTC to 2025-12-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-12-22 00:00:00 UTC to 2025-12-29 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 comments2025-12-29 00:00:00 UTC to 2026-01-05 00:00:00 UTC (exclusive): 2 mentions; 1 submissions, 1 commentsDec 29

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Nov 242025-11-24 00:00:00 UTC2025-12-01 00:00:00 UTC651
Dec 12025-12-01 00:00:00 UTC2025-12-08 00:00:00 UTC220
Dec 82025-12-08 00:00:00 UTC2025-12-15 00:00:00 UTC110
Dec 152025-12-15 00:00:00 UTC2025-12-22 00:00:00 UTC000
Dec 222025-12-22 00:00:00 UTC2025-12-29 00:00:00 UTC110
Dec 292025-12-29 00:00:00 UTC2026-01-05 00:00:00 UTC211

What Hacker News says

1 sources
ViktorKuz·Dec 12, 2025Submission

Show HN: Change the model. Same output. The pipeline decides. VAC Memory System

I’ve been experimenting with long-term memory architectures for agent systems and wanted to share some technical results that might be useful to others working on retrieval pipelines. Benchmark: LoCoMo (10 runs × 10 conversation sets) Average accuracy: 80.1% Setup: full isolation across all 10 conv groups (no cross-contamination, no shared memory between runs) Architecture (all open weights except answer generation) 1. Dense retrieval BGE-large-en-v1.5 (1024d) FAISS IndexFlatIP Standard BGE instruction prompt: “Represent this sentence for searching relevant passages.” 2. Sparse retrieval BM25 via classic inverted index Helps with low-embedding-recall queries and keyword-heavy prompts 3. MCA (Multi-Component Aggregation) ranking A simple gravitational-style score combining: keyword coverage token importance local frequency signal MCA acts
Read the rest
as a first-pass filter to catch exact-match questions. Threshold: coverage ≥ 0.1 → keep top-30 4. Union strategy Instead of aggressively reducing the union, the system feeds 112–135 documents directly to a re-ranker. In practice this improved stability and prevented loss of rare but crucial documents. 5. Cross-Encoder reranking bge-reranker-v2-m3 Processes the full union (rare for RAG pipelines, but worked best here) Produces a final top-k used for answer generation 6. Answer generation GPT-4o-mini, used only for the final synthesis step No agent chain, no tool calls, no memory-dependent LLM logic Performance <3 seconds per query on a single RTX 4090 Deterministic output between runs Reproducible test harness (10×10 protocol) Why this worked Three things seemed to matter most: MCA-first filter to stabilize early recall Not discarding the union before re-ranking Proper dense embedding instruction, which massively affects BGE performance Notes LoCoMo remains one of the hardest public memory benchmarks: 5,880 multi-hop, temporal, negation-rich QA pairs derived from human–agent conversations. Would be interested to compare with others working on long-term retrieval, especially multi-stage ranking or cross-encoder heavy pipelines. Github: https://github.com/vac-architector/VAC-Memory-System
1 points · Open discussion

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.