Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

A base could remember what it was asked for: retrieval, decay, expiry

Open
  • Is something wrong?
#1,277 1 comment 0 reactions 0 assignees View on GitHub

Maintainers usually reply within 1 day

@gedaiu is already working on this.

Since Oct 16, 2026.

  • #1279 by @gedaiu — open

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
15/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Active
Tech stack
postgresql, rust
Domain
database, search

Research direction

This is design work: the issue asks for an ADR before any code, and it names no files, tests or entry points. Start by reading the search and RRF ranking code that #1271 (search returning scores) would change, and the Lore memory behaviour it describes. Done means an accepted ADR covering the side table, strength formula, read recording, salience blend and sweep, with the first small PRs scoped.

Written by the indexing model from the issue text.

Description

enhancement

A base remembers what documents say, but not what people and agents actually use. For a base that serves an agent's memory (notes, episodes), that is the missing half: Lore's memory today ranks by how often an item was retrieved and how recently, lets an item fade on a half-life, expires items with a TTL, caps how many an agent keeps, and boosts or penalizes what contributed to a merged or rejected pull request. Moving that memory into Utopia needs somewhere for those signals to live.

Proposal, as a general feature rather than anything Lore-specific ("use decays; the ledger does not"):

  • a side table keyed by target (fact, document or chunk), so facts stay append-only and confidence keeps meaning what the source said: retrieval count, last retrieved, half-life, importance, an optional expires_at
  • pure arithmetic: strength 0.5^(age / half_life); a retrieval lengthens the half-life (capped) and re-anchors it; boost and penalize move it; staleness is computed when read, never stored
  • recording what reads actually return (search, search_chunks, entity_facts), with an opt-out for probes and evals
  • ranking blends salience into the RRF score only when a base turns it on (salience_weight, default 0, so nothing changes for anyone else)
  • an hourly sweep that expires (a reversible deletion for documents, a world-axis close for facts, audited) and evicts the weakest from a source over its cap

ADR first, then small PRs. Related: #1271 (search returns scores, which the blend builds on), #1276 (reading a record back by its name).

Dominant language
Rust
Stars
8.1k
Forks
1.1k
Avg merge
21h 30m
Merged PRs (30d)
251

Getting set up

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from deeplethe/utopia

All issues in deeplethe/utopia

Similar issues

More Rust issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.