A Bruket research project

Lavett

Memory with aim.

A semantic compiler for language-model memory.

Lavett is a Bruket research project building the support structure language models are missing: a way to turn raw conversation into a living web of meaning — with evidence, lifecycle, and routing — instead of a flat pile of tokens.

LAVETT
Fig. 01 — Memory routequery → role → concept → evidence → answer

Against flat context.

Modern language models can read enormous amounts of text, but a bigger context window does not create structured memory. It just postpones the same problem at a higher token cost.

Most AI memory still behaves like a pile: previous messages, compressed summaries, or retrieved chunks. Useful, but not the same as understanding how ideas connect, what changed, and what the evidence was.

A recurring mistake, a corrected belief, a changing goal, and a stable preference should not all live as equal pieces of text. They need structure, scope, evidence, and a lifecycle.

  • Raw context is expensive and grows without bound.
  • Summaries save space but quietly lose detail.
  • Vector search finds similar chunks but misses relationships.
  • Old facts and new facts are left to silently conflict.
  • Models struggle to track what changed over time.
  • Personalization needs remembered patterns, not just messages.

A support structure for reasoning.

A lavett is the carriage beneath the cannon: the structure that carries, stabilizes, and aims it. The barrel does the firing; the carriage decides where it points.

Lavett applies that idea to AI. The base language model stays the engine of language and reasoning. Lavett builds the support layer around it — memory, routing, context compilation, evidence paths, and semantic structure — so the same model reasons from better-aimed input.

Without Lavett

questionraw contextmodel

With Lavett

questionrole graphmemory routescompiled proof pathmodel

The architecture inside Lavett

NodeWeb: the memory architecture.

NodeWeb is the memory architecture Lavett is built on. It treats prior interactions as structured, evolving memory rather than a flat pile of old tokens — turning language into connected meaning events: entities, actions, objects, corrections, contradictions, goals, and evidence.

The first goal is narrow and testable: not to replace the language model, but to find out whether an ordinary or smaller model becomes more useful when it is given better memory structure.

  • Meaning Event Graph

    Language is decomposed into structured events: subject, action, object, time, attributes, and evidence.

    learner → omitted → article ("the")

  • Concept Gravity

    Recurring or important concepts gain weight over time, so retrieval is more likely to surface what actually matters.

    concept recurs → gravity ↑ → routing favors it

  • Truth Lifecycle

    Facts are not treated as permanently equal. They can be current, uncertain, contradicted, corrected, or superseded — and the transition stays inspectable.

    old belief → corrected → marked superseded

  • Multi-Route Retrieval

    Different routes search memory differently: entities, actions, timelines, corrections, contradictions, goals, and evidence — run in parallel and competed.

    route(roles) ∥ route(timeline) ∥ route(evidence)

  • Correction Trajectories

    The system tracks the arc of a mistake instead of a single snapshot: mistake → correction → recurrence → improvement.

    mistake → corrected → recurs → resolved

  • Context Compiler

    Instead of dumping raw chunks, NodeWeb compiles a task-specific briefing split into proof context, background, and what it dropped.

    chunks ✗ → compiled proof path ✓

  • Scope-Bound Memory

    Memory is scoped by source workspace, so a coding-project answer is not contaminated by unrelated tutoring or research notes.

    answer ⊂ dominant workspace

  • Explainable Memory Paths

    Every answer can show the memory route behind it — the roles, events, and evidence it actually used.

    answer ⟵ route ⟵ evidence span

How meaning is decomposed

RoleGraph: the original thesis.

Lavett does not only remember facts. It decomposes language into reusable, role-linked nodes — subjects, actions, objects, attributes, modifiers, time, locations, claims, and evidence — and tracks those roles across repeated occurrences in timeline order.

It also separates four things most systems flatten together: the literal surface form, the immediate error object, the broader practice target, and the wider domain topic. That separation keeps the graph from over-merging unrelated ideas and lets it compile smaller, evidence-backed proof paths.

A normal knowledge graph stores facts. RoleGraph stores recurring language roles and their evidence-backed occurrences over time.

RoleNode
a reusable canonical role part — learner, omit, article, yesterday
RoleOccurrence
one evidence-backed appearance, anchored to a source file and line range
RoleEdge
a typed, evidence-backed relationship — subject_performed_action, claim_supported_by_evidence
sentencesrolesrepeated nodestimelineevidence-backed context

Today and tomorrow

The substrate underneath.

The readable proof path is an adapter for today’s LLMs — not the final form. Underneath, Lavett is building a layered substrate: raw archive pointers, sentence and clause capsules, a concept dictionary, the role graph, an inspectable semantic bytecode, and timeline and evidence indexes.

Clause capsules matter because one line often carries two signals. Lavett keeps them separate instead of flattening them into one event.

raw archivesentence capsulesclause capsulesrole graphsemantic bytecodeproof-path compilerLLM todaymemory-native model later

Readable proof paths are for today’s models. Semantic bytecode is for internal indexing now and, eventually, direct consumption by a memory-native model.

One line, two signals

The auth bug is fixed, but the refresh-token test still fails.

resolved: auth bugunresolved: refresh-token test

I feel better about work, but I still don’t know what to do about money.

improved: workopen: money decision

What this looks like in practice.

A learner repeatedly drops the article before a noun. NodeWeb stores it not as another message, but as a correction trajectory in the role graph.

Learner writes

I went to store yesterday.

I went to the store yesterday.

Stored as structure

learner        → omitted        → article
error_object   → article ("the")
practice_target→ English article usage
concept        → has_gravity    → recurring
status         → unresolved
nodeweb · resolve
A later question: What should the learner practice next?

NodeWeb path

learner

→ recurring omission

→ articles

→ corrected in earlier sessions

→ still unresolved

→ evidence found

Answer

Practice English article usage — especially inserting “the” before specific singular nouns like “store”.

Honest, narrow results

The evidence so far.

The benchmark is small but no longer single-domain: it now spans language tutoring, long-form conversation, coding-project memory, and research-note memory, sharing one retrieval substrate. The goal at this stage is not polish — it is evidence.

On the current 22-case suite, the tight Lavett mode answers more questions correctly than raw context while sending far less of it. These are real, reproducible numbers on a deliberately small set — not a broad claim.

0.939

answer recall · lavett tight

vs 0.689 for raw context

≈62%

fewer packed-context tokens

≈67 tokens vs 176 raw

0.977

required-evidence recall

currently tied with raw

Still small and inspectable. Extraction is heuristic, contradiction logic is narrow, and the open target is keeping proof-path compression evidence-complete as the benchmark grows.

Measurement, not model hype

Research instrumentation.

Pay compute in proportion to new information, amortize it across queries, and share it across models.

This is an organizing principle for the research program, not a claim that Lavett is changing model internals today.

Lavett includes a measurement sandbox for asking sharper questions about the existing NodeWeb substrate: how much of a proof path is redundant, how much evidence is grounded, which lifecycle cues matter, and where cheap deterministic structure can reduce model work.

These reports are first drafts over a small corpus. They analyze and stress-test the current memory layer; they are not product promises, not benchmark victory laps, and not claims about training a new model architecture.

Proof-path leanness

Measures internal redundancy in the selected evidence path. Useful for compression work, but not a proof that the path is globally optimal.

Grounding checks

Tracks whether answer-specific claims are present in the evidence corpus. Good for fabrication detection; relation-level faithfulness remains open work.

Bounded generator baselines

Optional real-model answer generation is offline-by-default, cache-first, case-limited, cost-capped, and scored by the deterministic benchmark scorer.

Legibility gates

Compact derived structures must decode back to faithful human-readable text. Raw evidence stays the provenance source.

≈0.005internal proof-path redundancyvs 0.115 raw; descriptive, not an optimality proof
≈98%spans resolved by cheap structurea substrate measurement on the current corpus

Current measurement threads include:

  • sufficient-statistic routing
  • proof-carrying memory
  • entropy-proportional compute
  • predictive-coding memory
  • negative memory
  • interference-typed belief
  • Grounding Conservation Principle
  • canonical semantic hashing
  • holographic memory
  • capability-preserving forgetting
  • epistemic half-life
  • semantic error-correcting codes

A constraint, not a feature

Legibility is not optional.

One rule overrides every other goal in the project, including compression and efficiency: nothing Lavett stores, routes, derives, or emits is allowed to exist without a deterministic, total decoder back to faithful human-readable text. A representation without a registered decoder is rejected at write time.

Honestly scoped: this makes the Lavett substrate auditable by construction. It does not make a consuming model’s internal forward-pass interpretable — no deployed technique does. The strategy is to push as much reasoning as possible into the legible substrate and watch the residual rather than pretend it away.

Efficiency never buys hidden cognition.

The thesis.

Lavett starts from a simple suspicion: the next improvement in useful AI may not only come from larger models, but from better support structures around them.

If memory can be represented as a living web of meaning — with evidence, scope, recurrence, contradiction handling, and task-specific routing — then smaller, more accessible models may become more capable at long-term reasoning, tutoring, project memory, and personal context.

We are testing whether structured memory routing can improve:

  • long-conversation recall
  • contradiction handling
  • evidence quality
  • provenance
  • token efficiency
  • explainability
  • personalization
  • smaller-model usefulness

A staged plan

The road from here.

Lavett is staged deliberately, evidence before hype. Today’s work sits at the start of that ladder; each stage has to earn the next.

  1. Stage 0now

    Research prototype

    inspectable CLI, storage, evaluation

  2. Stage 1now

    Evidence-grade benchmark

    beat raw context on a real metric

  3. Stage 2

    Semantic memory addon

    drop-in memory for existing LLMs

  4. Stage 3

    Specialized product layer

    one vertical where memory pays off

  5. Stage 4

    Research architecture

    reproducible results vs strong baselines

  6. Stage 5

    Memory-native model

    the moonshot

Tutoring is the first benchmark only because it is easy to evaluate — not the destination. The same substrate aims at:

  • long-form conversation & advice
  • coding & project memory
  • research assistants
  • education & tutoring
  • personal & project memory

Current status.

Lavett is early. NodeWeb runs today as a Python research prototype: a CLI-first memory engine with SQLite storage, heuristic meaning-event and RoleGraph extraction, multi-route retrieval, evidence-aware context compilation, ablation-backed evaluation, and bounded baseline tooling. The codebase is being kept clean for eventual open-source release, but the research is still young.

lavett ingestlavett asklavett compile-contextlavett inspectlavett evallavett generate-baseline

Current focus

  • growing the multi-domain benchmark
  • keeping proof-path compression evidence-complete
  • hardening RoleGraph extraction beyond heuristics
  • driving ungrounded specificity toward zero
  • tracking correction and lifecycle authority
  • measuring routed memory against raw context
  • keeping optional real-model baselines bounded and cache-first

Not yet

  • not a foundation model
  • not a public chatbot
  • not a proven benchmark winner
  • not a finished product
  • not a claim about model-internal architecture

A Bruket research project.

Bruket is the workshop behind Hyral, KVITT, Spegeln, Vilse, and Lavett.

Where Hyral works on housing discovery, KVITT on receipt intelligence, Spegeln on public-record transparency, and Vilse on emergent-simulation worlds, Lavett is Bruket’s research branch for AI memory systems and language-model support structures.


Memory should have shape.

Lavett is a bet that language models need more than longer context. They need memory with structure, evidence, and aim — and a representation a human can still read.

NodeWeb is the first attempt to build that support structure.