Merge remote-tracking branch 'origin/master' into temp/push-distributed-gguf-4cae4a6

relay anounced on node ready

.agents/skills/claude-handoff/SKILL.md

@@ -0,0 +1,18 @@
+---
+name: claude-handoff
+description: Hand the current conversation off to a fresh background agent that picks up the work immediately.
+argument-hint: "What will the next session be used for?"
+disable-model-invocation: true
+---
+
+Write a handoff summary of the current conversation so a fresh agent can continue the work. Instead of saving it, launch a background agent seeded with the summary as its prompt: `claude --bg --name "<descriptive name>" "<handoff summary>"`. It starts in the current working directory and returns immediately; the user manages it with `claude agents`.
+
+Always pass `-n`/`--name` with a descriptive name (e.g. `--name "Fix login bug"`) — it sets the display name shown in the job list, session picker, and terminal title.
+
+Include a "suggested skills" section in the summary, which suggests skills that the agent should invoke.
+
+Do not duplicate content already captured in other artifacts (PRDs, plans, ADRs, issues, commits, diffs). Reference them by path or URL instead.
+
+Redact any sensitive information, such as API keys, passwords, or personally identifiable information — the summary becomes the agent's prompt.
+
+If the user passed arguments, treat them as a description of what the next session will focus on and tailor the summary accordingly.

.agents/skills/close-feature/SKILL.md

@@ -0,0 +1,115 @@
+---
+name: close-feature
+description: Graduate a completed feature from .scratch/<slug>/ into the permanent docs/ structure. Run when all issues in the feature are done, or when the agent notices a feature looks complete. Always confirm with the user before moving files.
+---
+
+# Close Feature
+
+Merge a completed `.scratch/<slug>/` feature into the permanent `docs/` structure and delete the scratch directory.
+
+## When to run
+
+Run this skill when:
+- The user explicitly calls `/close-feature <slug>`
+- You notice during any task that ALL issues in a `.scratch/<slug>/issues/` directory have `Status: done` — surface this proactively and offer to close ("It looks like <slug> is fully done. Want me to graduate it to docs/?")
+
+Always confirm before moving any files.
+
+## Process
+
+### 1. Identify the slug
+
+If called with an argument (`/close-feature <slug>`), use that. Otherwise list all `.scratch/` directories and ask the user which one to close.
+
+### 2. Verify all issues are done
+
+Read every file in `.scratch/<slug>/issues/`. Check for a `Status:` line.
+
+If any issue does NOT have `Status: done`, list the incomplete ones and stop — ask the user whether to mark them wontfix or wait.
+
+### 3. Show the user what will move
+
+Present a summary:
+- N issues → `docs/issues/` (renumbered from next available)
+- PRD.md → `docs/PRD.md` (or merged if one already exists)
+- prd.json → `docs/prd.json` (merged into existing user stories array)
+- Any ADRs written during the feature → `docs/adr/` (renumbered from next available)
+- `.scratch/<slug>/` deleted
+
+Ask: "Proceed?" before touching anything.
+
+### 4. Move issues
+
+Find the highest existing number in `docs/issues/`. Issues from `.scratch/<slug>/issues/` take the next slots in dependency order (lowest numbered first).
+
+Use `git mv` for each file so history is preserved:
+```
+git mv .scratch/<slug>/issues/01-foo.md docs/issues/<next>-foo.md
+```
+
+### 5. Merge PRD
+
+If `docs/PRD.md` does not exist: `git mv .scratch/<slug>/PRD.md docs/PRD.md`
+
+If `docs/PRD.md` already exists: append the feature's Problem Statement and Solution sections under a `## <Feature Name>` heading. Do not overwrite the existing file.
+
+### 6. Merge prd.json
+
+If `docs/prd.json` does not exist: `git mv .scratch/<slug>/prd.json docs/prd.json`
+
+If `docs/prd.json` already exists: merge the `userStories` array from the scratch prd.json into the main one, assigning new sequential ids to avoid collisions. Update all merged stories to `"status": "done"`.
+
+### 7. Move ADRs
+
+If any `.md` files exist directly in `.scratch/<slug>/` (not in `issues/`) that look like ADRs (contain `## Status` and `## Decision`), move them to `docs/adr/` renumbered from the next available slot.
+
+### 8. Delete scratch directory
+
+```
+git rm -r .scratch/<slug>/
+```
+
+If `.scratch/` is now empty, remove it too (it has no meaning without sub-features).
+
+### 9. Commit
+
+```
+git add docs/
+git commit -m "docs: close feature <slug> — graduate to docs/"
+```
+
+### 10. Update ralph default (if needed)
+
+If `scripts/ralph_progress.py` exists and its `DEFAULT_PRD` still points at `.scratch/<slug>/prd.json`, update it to `docs/prd.json`.
+
+## Machine setup reference
+
+Skills are stored in `.agents/skills/` and symlinked into `.claude/skills/`. Both directories are git-tracked so cloning the repo gives you all skills automatically.
+
+**On a new machine (Linux/Mac):**
+```bash
+git clone <repo>
+# Skills work immediately — .claude/skills/ symlinks resolve automatically.
+# .claude/settings.local.json is machine-local (gitignored).
+# Recreate it if you need custom permission allowlists.
+```
+
+**On Windows:**
+```bash
+git clone -c core.symlinks=true <repo>
+# Requires Developer Mode or admin rights for symlink creation.
+# If symlinks didn't resolve, run: scripts/link-skills.sh (or re-run /setup-matt-pocock-skills)
+```
+
+**Codex:** reads `AGENTS.md` at the repo root — already tracked, no setup needed.
+
+**Hermes / other local LLM tools:** add their context files to the repo root or `docs/` and commit. Point the tool at that file in its config.
+
+**To add a new skill to the repo:**
+```bash
+mkdir .agents/skills/<name>
+# write .agents/skills/<name>/SKILL.md
+ln -s ../../.agents/skills/<name> .claude/skills/<name>
+git add .agents/skills/<name> .claude/skills/<name>
+git commit -m "skill: add <name>"
+```

.agents/skills/code-review/SKILL.md

@@ -0,0 +1,89 @@
+---
+name: code-review
+description: Review the changes since a fixed point (commit, branch, tag, or merge-base) along two axes — Standards (does the code follow this repo's documented coding standards?) and Spec (does the code match what the originating issue/PRD asked for?). Runs both reviews in parallel sub-agents and reports them side by side. Use when the user wants to review a branch, a PR, work-in-progress changes, or asks to "review since X".
+---
+
+Two-axis review of the diff between `HEAD` and a fixed point the user supplies:
+
+- **Standards** — does the code conform to this repo's documented coding standards?
+- **Spec** — does the code faithfully implement the originating issue / PRD / spec?
+
+Both axes run as **parallel sub-agents** so they don't pollute each other's context, then this skill aggregates their findings.
+
+The issue tracker should have been provided to you — run `/setup-matt-pocock-skills` if `docs/agents/issue-tracker.md` is missing.
+
+## Process
+
+### 1. Pin the fixed point
+
+Whatever the user said is the fixed point — a commit SHA, branch name, tag, `main`, `HEAD~5`, etc. If they didn't specify one, ask for it.
+
+Capture the diff command once: `git diff <fixed-point>...HEAD` (three-dot, so the comparison is against the merge-base). Also note the list of commits via `git log <fixed-point>..HEAD --oneline`.
+
+Before going further, confirm the fixed point resolves (`git rev-parse <fixed-point>`) and the diff is non-empty. A bad ref or empty diff should fail here — not inside two parallel sub-agents.
+
+### 2. Identify the spec source
+
+Look for the originating spec, in this order:
+
+1. Issue references in the commit messages (`#123`, `Closes #45`, GitLab `!67`, etc.) — fetch via the workflow in `docs/agents/issue-tracker.md`.
+2. A path the user passed as an argument.
+3. A PRD/spec file under `docs/`, `specs/`, or `.scratch/` matching the branch name or feature.
+4. If nothing is found, ask the user where the spec is. If they say there isn't one, the **Spec** sub-agent will skip and report "no spec available".
+
+### 3. Identify the standards sources
+
+Anything in the repo that documents how code should be written, such as `CODING_STANDARDS.md` or `CONTRIBUTING.md`.
+
+On top of whatever the repo documents, the Standards axis always carries the **smell baseline** below — a fixed set of Fowler code smells (_Refactoring_, ch.3) that applies even when a repo documents nothing. Two rules bind it:
+
+- **The repo overrides.** A documented repo standard always wins; where it endorses something the baseline would flag, suppress the smell.
+- **Always a judgement call.** Each smell is a labelled heuristic ("possible Feature Envy"), never a hard violation — and, like any standard here, skip anything tooling already enforces.
+
+Each smell reads *what it is* → *how to fix*; match it against the diff:
+
+- **Mysterious Name** — a function, variable, or type whose name doesn't reveal what it does or holds. → rename it; if no honest name comes, the design's murky.
+- **Duplicated Code** — the same logic shape appears in more than one hunk or file in the change. → extract the shared shape, call it from both.
+- **Feature Envy** — a method that reaches into another object's data more than its own. → move the method onto the data it envies.
+- **Data Clumps** — the same few fields or params keep travelling together (a type wanting to be born). → bundle them into one type, pass that.
+- **Primitive Obsession** — a primitive or string standing in for a domain concept that deserves its own type. → give the concept its own small type.
+- **Repeated Switches** — the same `switch`/`if`-cascade on the same type recurs across the change. → replace with polymorphism, or one map both sites share.
+- **Shotgun Surgery** — one logical change forces scattered edits across many files in the diff. → gather what changes together into one module.
+- **Divergent Change** — one file or module is edited for several unrelated reasons. → split so each module changes for one reason.
+- **Speculative Generality** — abstraction, parameters, or hooks added for needs the spec doesn't have. → delete it; inline back until a real need shows.
+- **Message Chains** — long `a.b().c().d()` navigation the caller shouldn't depend on. → hide the walk behind one method on the first object.
+- **Middle Man** — a class or function that mostly just delegates onward. → cut it, call the real target direct.
+- **Refused Bequest** — a subclass or implementer that ignores or overrides most of what it inherits. → drop the inheritance, use composition.
+
+### 4. Spawn both sub-agents in parallel
+
+Send a single message with two `Agent` tool calls. Use the `general-purpose` subagent for both.
+
+**Standards sub-agent prompt** — include:
+
+- The full diff command and commit list.
+- The list of standards-source files you found in step 3, **plus the smell baseline from step 3** pasted in full — the sub-agent has no other access to it.
+- The brief: "Report — per file/hunk where relevant — (a) every place the diff violates a documented standard: cite the standard (file + the rule); and (b) any baseline smell you spot: name it and quote the hunk. Distinguish hard violations from judgement calls — documented-standard breaches can be hard, but baseline smells are always judgement calls, and a documented repo standard overrides the baseline. Skip anything tooling enforces. Under 400 words."
+
+**Spec sub-agent prompt** — include:
+
+- The diff command and commit list.
+- The path or fetched contents of the spec.
+- The brief: "Report: (a) requirements the spec asked for that are missing or partial; (b) behaviour in the diff that wasn't asked for (scope creep); (c) requirements that look implemented but where the implementation looks wrong. Quote the spec line for each finding. Under 400 words."
+
+If the spec is missing, skip the Spec sub-agent and note this in the final report.
+
+### 5. Aggregate
+
+Present the two reports under `## Standards` and `## Spec` headings, verbatim or lightly cleaned. Do **not** merge or rerank findings — the two axes are deliberately separate (see _Why two axes_).
+
+End with a one-line summary: total findings per axis, and the worst issue _within each axis_ (if any). Don't pick a single winner across axes — that's the reranking the separation exists to prevent.
+
+## Why two axes
+
+A change can pass one axis and fail the other:
+
+- Code that follows every standard but implements the wrong thing → **Standards pass, Spec fail.**
+- Code that does exactly what the issue asked but breaks the project's conventions → **Spec pass, Standards fail.**
+
+Reporting them separately stops one axis from masking the other.

.agents/skills/research/SKILL.md

@@ -0,0 +1,12 @@
+---
+name: research
+description: Investigate a question against high-trust primary sources and capture the findings as a Markdown file in the repo. Use when the user wants a topic researched, docs or API facts gathered, or reading legwork delegated to a background agent.
+---
+
+Spin up a **background agent** to do the research, so you keep working while it reads.
+
+Its job:
+
+1. Investigate the question against **primary sources** — official docs, source code, specs, first-party APIs — not a secondary write-up of them. Follow every claim back to the source that owns it.
+2. Write the findings to a single Markdown file, citing each claim's source.
+3. Save it where the repo already keeps such notes; match the existing convention, and if there is none, put it somewhere sensible and say where.

.agents/skills/wayfinder/SKILL.md

@@ -0,0 +1,101 @@
+---
+name: wayfinder
+description: Plan a huge chunk of work — more than one agent session can hold — as a shared map of investigation tickets on your issue tracker, and resolve them one at a time until the way to the goal is clear.
+---
+
+A loose idea has arrived — too big for one agent session, and wrapped in fog: the route from here to a plan isn't visible yet. This skill charts it as a **shared map** on the repo's issue tracker, then works its tickets one at a time. The map is domain-agnostic — engineering work, course content, whatever fits the shape.
+
+## Refer by name
+
+Every map and ticket is an issue, so it has a **name** — its title. In everything the human reads — narration, the map's Decisions-so-far — refer to it by that name, never by a bare id, number, or slug. A wall of `#42, #43, #44` is illegible; names read at a glance. The id and URL don't vanish — a name wraps its link — but they ride *inside* the name, never stand in for it.
+
+## The Map
+
+The map is a single issue on this repo's issue tracker, labelled `wayfinder:map` — the canonical artifact. Its tickets are child issues of the map.
+
+The map is an **index**, not a store. It lists the decisions made and points at the tickets that hold their detail; a decision lives in exactly one place — its ticket — so the map never restates it, only gists it and links.
+
+**Where the map, its child tickets, blocking, and frontier queries physically live is tracker-specific.** Consult `docs/agents/issue-tracker.md` (the "Wayfinding operations" section) for how _this_ repo expresses them. If that doc is absent, default to the local-markdown tracker.
+
+### The map body
+
+The whole map at low resolution, loaded once per session. Open tickets are **not** listed — they are open child issues, found by query.
+
+```markdown
+## Notes
+
+<domain; skills every session should consult; standing preferences for this effort>
+
+## Decisions so far
+
+<!-- the index — one line per closed ticket: enough to judge relevance, then zoom the link for the detail the ticket holds -->
+
+- [<closed ticket title>](link) — <one-line gist of the answer>
+
+## Fog
+
+<!-- see "Fog of war" for what belongs here -->
+```
+
+### Tickets
+
+Each ticket is a **child issue** of the map; the tracker's issue id is its identity. Its body is the question, sized to one 100K token agent session:
+
+```markdown
+## Question
+
+<the decision or investigation this ticket resolves>
+```
+
+Each ticket carries a `wayfinder:<type>` label — one of `research`, `prototype`, `grilling`, `task` (see [Ticket Types](#ticket-types)).
+
+A session **claims** a ticket by assigning it to the dev driving the map, **first**, before any work, so concurrent sessions skip it. That assignee _is_ the claim: an open, unassigned ticket is unclaimed.
+
+Blocking uses the tracker's **native** dependency relationship — essential because it renders the frontier _visually_ in the tracker's own UI, so the human sees what's takeable without opening the map. Only a tracker that lacks native blocking falls back to a body convention. A ticket is **unblocked** when every ticket blocking it is closed; the **frontier** is the open, unblocked, unclaimed children — the edge of the known.
+
+The answer isn't part of the body — it's recorded on resolution (see [Work through the map](#work-through-the-map)). Assets created while resolving a ticket are linked from the issue, not pasted in.
+
+## Ticket Types
+
+- **Research**: Reading documentation, third-party APIs, or local resources like knowledge bases. Creates a markdown summary as a linked asset. Use when knowledge outside the current working directory is required.
+- **Prototype**: Raise the fidelity of the discussion by making a cheap, rough, concrete artifact to react to — an outline, a rough take, a stub, or UI/logic code via the /prototype skill. Links the prototype as an asset. Use when "how should it look" or "how should it behave" is the key question.
+- **Grilling**: Conversation with the agent. Uses the /grilling and /domain-modeling skills. Asks one question at a time. The default case.
+- **Task**: Literal manual work that must be done before the discussion can move forward — nothing to decide, prototype, or research. Moving data, signing up for a service, provisioning access. The agent automates it where it can; otherwise it hands the human a precise checklist. Resolved when the work is done; the answer records what was done and any resulting facts (credentials location, new URLs, row counts) later tickets depend on.
+
+## Fog of war
+
+The map is _deliberately_ incomplete: don't chart what you can't yet see. Beyond the tickets lies fog — the dim view of decisions and investigations you can tell are coming but can't yet pin down, because they hang on questions still open. Resolving a ticket clears the fog ahead of it, graduating whatever's now specifiable into fresh tickets — one at a time, until the way to the goal is clear and no tickets remain.
+
+The map's **Fog** section is where that dim view is written down: the suspected question, the area to revisit later, the risk you're deferring. Write as loosely or as fully as the view allows; it doubles as a signpost for collaborators reading where the effort is headed.
+
+**Fog or ticket?** The test is whether you can state the question precisely now — _not_ whether you can answer it now.
+
+- **Ticket when** the question is already sharp — even if it's blocked and you can't act on it yet.
+- **Fog when** you can't yet phrase it that sharply. Don't pre-slice fog into ticket-sized pieces: it's coarser than a ticket, and one patch may graduate into several tickets, or none, once the frontier reaches it.
+
+Fog excludes only what's already decided (that's Decisions so far) and what's already a ticket.
+
+## Invocation
+
+Two modes. Either way, **never resolve more than one ticket per session.**
+
+### Chart the map
+
+User invokes with a loose idea.
+
+1. Run a `/grilling` and `/domain-modeling` session to surface the open decisions.
+2. **Create the map** (label `wayfinder:map`): Notes filled in, Decisions-so-far empty, Fog sketched.
+3. **Create the tickets you can specify now** as child issues of the map — then wire blocking edges in a **second pass** (issues need ids before they can reference each other). Wiring sorts them into the frontier and the blocked; everything you can't yet specify stays in the Fog.
+4. Stop — charting the map is one session's work; do not also resolve tickets.
+
+### Work through the map
+
+User invokes with a map (URL or number). A ticket is **optional** — without one, you pick the next decision, not the user.
+
+1. Load the **map** — the low-res view, not every ticket body.
+2. Choose the ticket. If the user named one, use it. Otherwise take the first frontier ticket in order. **Claim it**: assign it to yourself before any work.
+3. Resolve it — **zoom as needed**: fetch the full body of any related or closed ticket on demand; invoke the skills the `## Notes` block names. If in doubt, use `/grilling` and `/domain-modeling`.
+4. Record the resolution: post the answer as a **resolution comment**, **close** the issue, and **append a context pointer** to the map's Decisions-so-far.
+5. Add newly-surfaced tickets (create-then-wire); graduate any fog the answer has made specifiable, clearing each graduated patch from the Fog so it lives only as its new ticket. If the decision invalidates other parts of the map, update or delete those tickets.
+
+The user may run unblocked tickets in parallel, so expect other sessions to be editing the tracker concurrently.

.agents/skills/wizard/SKILL.md

@@ -0,0 +1,45 @@
+---
+name: wizard
+description: Generate an interactive bash wizard that walks a human through a manual procedure — third-party setup, a one-off migration, an A→B state transition — opening URLs, capturing values, confirming each step, and writing .env files and GitHub Actions secrets.
+disable-model-invocation: true
+---
+
+# Wizard
+
+A **wizard** is a bash script that walks a human, step by step, through a manual procedure that's tedious to do by hand and tedious to re-explain to an AI every time. It opens each URL, says exactly what to click and copy, captures the values, writes them where they belong (`.env`, GitHub secrets), confirms at every stage, and shows how much is left. It might configure third-party services, run a one-off migration, or move the project from one state to another.
+
+The delightful UX is already solved by [template.sh](template.sh) — progress with time-remaining, confirmation gates, cross-platform URL opening (including WSL), hidden secret entry, idempotent `.env` upserts, `gh secret`/`gh variable` writes, and a closing summary. **Your job is only to scope the procedure and author its stages.** The library above the `STAGES` marker is identical in every wizard; that consistency is the point — never hand-edit it.
+
+A wizard is ephemeral by default — built for one run, saved to a scratch or `scripts/` path, deleted when the job's done. Commit it only when the user wants a repeatable setup path that should live in the repo.
+
+## Process
+
+### 1. Scope the procedure
+
+Work out every manual step the human must take and every value that gets captured along the way. Read the repo first — don't ask cold:
+
+- For setup: `.env`, `.env.example`, `.env.*`, `README`, `docker-compose*`, framework config, and `.github/workflows/*` (every `secrets.*` / `vars.*` reference is a value the wizard must produce).
+- For a migration or transition: the current state, the target state, and the irreversible actions between them.
+
+Then show the user the ordered list of stages and the values each produces, and confirm — they may add, drop, or reorder.
+
+**Done when:** every stage is named in order, and for each captured value you know (a) where the human gets it, (b) where it's written (`.env`, a GitHub secret, both, or nowhere — some stages are pure actions), and (c) whether it's secret (hidden entry) or public.
+
+### 2. Map each stage's journey
+
+For each stage, write the precise path a human follows: which URL to open, what to do there, where a value is shown, which variable it fills — e.g. "Dashboard → Developers → API keys → Reveal test key → copy". Where you don't actually know the current UI or the exact command, say so and ask the user or check the docs — never invent steps that may not exist.
+
+**Done when:** every stage traces to concrete instructions a stranger could follow.
+
+### 3. Author the wizard
+
+Copy `template.sh` to the target path. Replace the example stage with one `stage` per step, in dependency order. Use the library helpers — `stage`, `say`/`step`, `open_url`, `ask`/`ask_secret`, `write_env`, `set_secret`/`set_var`, `pause`/`confirm` — and set `TOTAL_STAGES` and `TOTAL_MINUTES` to honest estimates (this drives the time-remaining display).
+
+Hold the bar the template sets: open the URL before asking for its value, use `ask_secret` for anything secret, `write_env` every persisted value, `set_secret` only the values CI actually needs, and `confirm` before any irreversible action. Each `stage` clears the screen so only the current step is visible — keep a stage to one focused task so nothing the human needs scrolls away. Don't touch the library above the marker.
+
+### 4. Verify and hand off
+
+- `bash -n <script>`; run `shellcheck` if available.
+- `chmod +x <script>`.
+- Don't run it end-to-end yourself — it opens browsers and blocks on human input. Trace it statically instead: every value from step 1 is captured and lands where step 1 said, and every `set_secret` name exactly matches a `secrets.*` reference in CI.
+- Tell the user how to run it. If it's a repeatable setup path, commit it and link it from the README so the next person runs the script instead of asking an AI.

.claude/memory/MEMORY.md

@@ -0,0 +1,10 @@
+# Memory Index
+
+- [Product selling points](product-selling-points.md) — key differentiators and landing page angles for neuron-tai
+- [User profile](user-profile.md) — who Dobromir is and how to work with him
+- [Project status](project-status.md) — 35/35 stories done; alpha hardening next
+- **Alpha hardening** — `.scratch/alpha-hardening/` (22 issues, ADRs 0016–0019, [README](../../.scratch/alpha-hardening/README.md), [handoff](../../.scratch/alpha-hardening/handoff.md))
+- [Alpha hardening navigation](alpha-hardening-navigation.md) — locked fraud/auth decisions, Bucket-1 order, handoff pointers
+- **Node capability admission** — `.scratch/node-capability-admission/` (P0 plan: generic doctor/real-forward validation, fail-closed readiness, tracker admission gate; [PRD](../../.scratch/node-capability-admission/PRD.md), [README](../../.scratch/node-capability-admission/README.md), ADR-0023)
+- **Distributed relay performance** — relay `/rpc` requester sockets are persistent per Route Session and Activation Seam as of 2026-07-10; `request_id` remains unique per activation while `X-Meshnet-Session` remains stable for KV state. Next low-risk priorities: persistent direct/loopback HTTP, seam byte/latency telemetry, then trace-driven zstd tuning.
+- **Distributed GGUF direction** — benchmark-gated native runtime: compare controlled Transformers/safetensors and whole-model llama.cpp lanes before expensive work; ship only for measured speed or model-fit advantage. Public parallelism is contiguous Shards in an Inference Route; concurrency comes from per-node continuous batching across isolated Route Sessions, while tensor/expert collectives stay inside optional trusted composite providers. Native data plane uses versioned Protobuf over long-lived gRPC/HTTP2 seam streams, with existing relay carrying the same opaque frames when needed. llama.cpp/GGML remains the substrate behind a project-owned standalone worker and small pinned fork; vLLM is an optional complete managed provider and concept donor, not a fork. Nakshatra, `prima.cpp`, `llama-gguf`, LiGGUF and historical GPUStack are source/test donors only. Active plan: [README](../../.scratch/distributed-gguf-runtime/README.md), [architecture](../../.scratch/distributed-gguf-runtime/architecture.md), [PRD](../../.scratch/distributed-gguf-runtime/PRD.md), [Ralph backlog](../../.scratch/distributed-gguf-runtime/prd.json). Research: [landscape](../../docs/research/distributed-gguf-landscape.md), [GitHub follow-up](../../docs/research/distributed-gguf-github-followup.md), [vLLM](../../docs/research/vllm-distributed-gguf-assessment.md).

.claude/memory/alpha-hardening-navigation.md

@@ -0,0 +1,36 @@
+---
+name: alpha-hardening-navigation
+description: Where the alpha-hardening plan lives, locked design decisions, and implementation order
+metadata:
+  node_type: memory
+  type: project
+---
+
+Active workstream (started 2026-07-04): alpha hardening of the money/trust path. Full handoff at `/mnt/c/Users/popov/Downloads/neuron-tai-alpha-handoff-2026-07-04.md` (note: its "planning artifacts missing" section is stale — ADRs 0016–0019 and `.scratch/alpha-hardening/issues/` were created in commit 68e0572).
+
+**Navigation:** `.scratch/alpha-hardening/README.md` = index + phase order; `research-verifiable-inference.md` §8 = layered fraud scheme, §9 = build-vs-adopt; ADR-0018 = flagship fraud design; `docs/agents/issue-tracker.md` = issue conventions (active work in `.scratch/<slug>/`).
+
+**Locked decisions (do not re-derive):** TOPLOC ADOPT (`pip install toploc`, teacher-forced prefill, one canonical precision per model); audit 5% default escalating on anomaly/low-rep/disputes; blame via on-demand per-hop activation commitments + bisection (fixes validator `_final_text_node` bug — it blames only the last hop); reputation = persisted graduated ×0.8-per-strike multiplier affecting routing + audit rate; full pending forfeiture stays the primary penalty; accounting becomes tracker-authoritative (count tokens from the proxied stream, work units from tracker-assigned spans — node self-reports are untrusted); strikes/bans/reputation must survive restart (RegistryWallet is RAM-only today); multi-tracker money fixes (C2/C3/C4/A3/H1) designed in ADR-0019 but implementation deferred.
+
+**Implementation state (2026-07-05):** Alpha-scoped blocker implementation is done: auth boundary + gossip + validator service token (02/01/20), persist strike/ban/reputation (05), starting credit 0 + spend cap (03), tracker-authoritative accounting (04), wallet binding proof (11), and fraud arc (06–10). `.scratch/alpha-hardening/issues/` now has 16 `done` and 6 `ready-for-human` items.
+
+**Auth foundation now available (commit 81719ed):** `packages/tracker/meshnet_tracker/auth.py` = hive HMAC (`sign_hive_request`/`verify_hive_request`, X-Meshnet-Hive-Signature/Timestamp, 300s skew) + `is_validator_token`. In the handler: `_require_role("admin"|"validator")`, `_resolve_identity()` (validator token / admin session / client-key→no-role), `_read_hive_authenticated_body()`. `TrackerServer(validator_service_token=, hive_secret=)` also read from MESHNET_VALIDATOR_SERVICE_TOKEN / MESHNET_HIVE_SECRET; CLI `--validator-service-token` / `--hive-secret`. Outgoing gossip signed via `_push_to_peers`. Tests use these fixtures — reuse the pattern in 05/03/04.
+
+**Remaining work classification:** 12–15 are multi-tracker money/Raft ordering hardening deferred beyond single-settlement alpha; 17 needs human approval for canonical duplicate US-020 renumbering. Full pytest suite re-verified 2026-07-06: 317 passed, 3 skipped, clean.
+
+**Launch-readiness grilling (2026-07-06):** Locked launch plan — devnet dev/test run now, then **real mainnet SOL/USDT** (not devnet, not a new public token) for the first cohort: friends (API clients) + hired VPS/VPC hosts (our own test infra, not third-party volunteers — stake-free, risk-free if something breaks, not a long-term topology). Pricing: clients are the only party spending real money; nodes only accumulate off-chain credit and get paid in batches (30min dev / 24h later) — a failed distribution leaves funds parked, not lost, so mainnet-vs-devnet mixups are lower-risk than initially assumed. TAI token: do NOT issue/list now — ADR-0002 already locks listing behind $50k volume + 25 nodes/15 wallets plus an unresolved securities-review gate; only a dormant mainnet mint (cheap, ~few $ SOL) for name/branding reservation is in scope, bundled with treasury-key work, not before it. Treasury custody: bare keypair file (current runbook 02) is not acceptable for real funds — plan is **free native SPL multisig** (`spl-token create-multisig`, no protocol fee unlike Squads' 0.5 SOL), 2-of-3 signers, at least one cold/offline, others one-per-hired-VPS-provider to avoid correlated compromise (not yet built — ops task, no issue filed). Stake/slash asymmetry (registry/slash is a local Python adapter per ADR-0007, not on-chain) accepted for now since hired hosts are our own infra and friends aren't node operators — revisit before opening to real third-party node operators. A mainnet-vs-devnet boot guardrail was proposed and explicitly declined by the owner given the safe-by-default money flow above.
+
+**Two new issues from this session, both `ready-for-agent`:**
+- **21 — Honest-noise calibration corpus** (`.scratch/alpha-hardening/issues/21-honest-noise-calibration-corpus.md`) rescoped from "prod gate" to a **hard alpha-release blocker**. Confirmed by code read: `verify_activation_proofs()` (`packages/validator/meshnet_validator/audit.py:94-127`) returns bool only, no raw divergence value; fleet-dispatch exists but wrong shape (`server.py:2998-3104`, pinned routes + latency, not full-fleet + TOPLOC divergence); storage wrong shape (`registry_events` has no divergence/hardware columns). Three-part build: (1) surface raw TOPLOC distance from audit.py, (2) extend dispatch to hit every registered node with fixed prompt/seed, (3) new SQLite table keyed by node+GPU+dtype. Small-fleet exception granted (N = actual hired-VPS fleet size). Hired VPS hosts stay stake-free until this closes.
+- **23 — Dynamic HF-benchmarked pricing** (`.scratch/alpha-hardening/issues/23-dynamic-hf-pricing.md`), high priority but not a release blocker. Pricing today is 100% static (`DEFAULT_PRICE_PER_1K_TOKENS = 0.02`, `billing.py:21`; `model_presets.json` has no per-model price). Target: 80% of cheapest comparable provider on `https://huggingface.co/inference/models` (per-provider-per-model marketplace, `?search=` query param works, no confirmed JSON API — plain scrape attempted first, escalate to headless browser only if the table isn't in raw HTML). Human-verified `hf_aliases` + `hf_verified_match_note` (params/quantization) per model, not auto-discovered matching. Reuses the `_settlement_loop` daemon-thread pattern for a daily refresh; falls back silently to the static default on any failure.
+
+Both are already migrated into `.scratch/alpha-hardening/prd.json` (AH-021 updated, AH-023 added) and the README index — ready for Ralph to pick up unattended.
+
+**Ralph note:** `scripts/ralph_progress.py` tracks `docs/prd.json` (35/35 done) and does NOT see `.scratch/alpha-hardening/issues/`. No ralph loop is running and no `.ralph-tui/` state exists. `.scratch/alpha-hardening/prd.json` now has 23 stories (AH-001…AH-023); point Ralph at that file for the alpha-hardening branch. Do NOT use `ralph auto --parallel` on server.py-touching issues — 21 and 23 both touch `server.py`/`billing.py`/`audit.py`; if run in the same Ralph pass, run them serially, not in parallel (merge-conflict risk, same lesson as 03/04 previously).
+
+**Why:** three audits agreed the alpha blockers are unauthenticated gossip (anyone can inject billing events), the free-credit faucet, and ephemeral bans.
+**How to apply:** work test-first per issue acceptance criteria; use `.venv`; `cryptography` belongs in node deps (wallet.py imports it — causes many of the 24 "failures" in a fresh env). See [[project-status]] and [[autonomous-work-style]].
+
+## Routing telemetry resume (2026-07-07)
+
+`.scratch/alpha-hardening/issues/24-routing-telemetry-resume.md` / AH-024 captures the interrupted Claude handoff. Learned routing is already committed at `518c259`; the dirty tree contains live-progress/current-request heartbeat/dashboard telemetry. First known blocker: `packages/tracker/meshnet_tracker/server.py:1490` uses `threading.Lock | None`, which crashes import because `threading.Lock` is a factory function at runtime. Fix that before running the targeted telemetry tests. Keep `.claude/settings.local.json` uncommitted unless explicitly approved.

.claude/memory/autonomous-work-style.md

@@ -0,0 +1,13 @@
+---
+name: autonomous-work-style
+description: Dobromir wants autonomous batch execution — ask only for architecture decisions, never permissions
+metadata:
+  node_type: memory
+  type: feedback
+---
+
+When given a backlog, work through all open tasks autonomously and report back when done. Ask questions only for implementation/architecture decisions that genuinely need his input (grilling-style, one at a time with a recommendation) — never for permission to proceed, and don't checkpoint between tasks. Running tests is ALWAYS allowed (allowlisted in settings).
+
+**Why:** he said "work on all the tasks and come back when done. ask only for implementation or architecture decisions and not for permissions" and "I ALWAYS ALLOW running tests! stop asking" (2026-07-02, reward-system session).
+
+**How to apply:** default to acting; batch the full backlog from docs/prd.json ([[project-status]]); surface completed-work summaries at the end, not between stories.

.claude/memory/product-selling-points.md

@@ -0,0 +1,38 @@
+---
+name: product-selling-points
+description: Key differentiators and landing page angles for neuron-tai distributed inference network
+metadata: 
+  node_type: memory
+  type: project
+  originSessionId: 8fb120ee-7b8e-45be-98c0-b5ae9c64d1ec
+---
+
+# neuron-tai — Product Selling Points
+
+## Core pitch
+Volunteer GPU network for distributed LLM inference. Small GPU owners contribute compute and earn TAI tokens. Clients get inference on models larger than any single machine can serve.
+
+## Confirmed technical differentiators (verified working)
+
+### Mixed hardware inference routes
+The tracker can chain CPU nodes and GPU nodes into a single inference route. Shard A on a CPU node → Shard B on a GPU node → valid streamed response. Each participant in the route only needs to fit *their shard* in memory, not the whole model.
+
+**Angle for landing page:** "Run a 70B model across three laptops and a gaming PC. Each machine only holds the layers it can fit."
+
+**Nuance to acknowledge:** PyTorch/HuggingFace `device_map="auto"` already does CPU+GPU mixing on a single machine. Our value-add is doing this *across machines over the network*, democratizing access to models that no single volunteer machine could serve alone.
+
+### Hardware-aware routing
+Tracker scores nodes by `benchmark_tokens_per_sec / (queue_depth + 1)` and always routes to the fastest available node per shard range. A GPU node at 11,200 throughput index beats a CPU node at 626 automatically — no user configuration needed.
+
+### Zero port-forwarding required
+Nodes connect outbound to the relay via WebSocket. Works from behind NAT, WSL2, 5G, or a home router with no config. The public tracker at ai.neuron.d-popov.com handles discovery.
+
+### OpenAI-compatible API
+Any app using the OpenAI Python SDK works by changing only `base_url`. No code changes for the client.
+
+## Landing page content TODO
+- User asked to capture these points for the landing page copy (2026-07-01)
+- No landing page file exists in the repo yet
+- When writing copy, lead with the "run models bigger than your GPU" angle, then support with mixed-hardware routing, relay, and OpenAI compat
+
+**How to apply:** When writing product descriptions, pitches, or landing page copy, use these as the primary hooks. The mixed-network inference route (CPU+GPU across machines) is the biggest differentiator vs. single-machine solutions.

.claude/memory/project-status.md

@@ -0,0 +1,53 @@
+---
+name: project-status
+description: Current state of neuron-tai development as of 2026-07-02
+metadata:
+  node_type: memory
+  type: project
+---
+
+# Project Status (2026-07-02)
+
+All 35 user stories in docs/prd.json are done (35/35), including the reward-system arc US-030…US-035 completed 2026-07-02:
+
+- **BillingLedger** (packages/tracker/meshnet_tracker/billing.py): event-sourced USDT ledger, gossip-replicated across the hive (id-deduped events), SQLite-persisted. 90/10 split by work units, per-model per-1K-token pricing, 402 before routing.
+- **Solana custodial adapter** (packages/contracts/meshnet_contracts/solana_adapter.py): urllib JSON-RPC + solders signing. NOTE: installed solana-py 0.40 has NO sync client — don't import solana.rpc.api / spl.token.client.
+- **scripts/devnet_setup.py**: creates mock-USDT mint + treasury, writes .env.devnet; --mint-to funds test clients.
+- **TrackerServer threads**: deposit watcher (exactly-once via deposit-<sig> event ids) + leader-only settlement loop (threshold OR max-period, dust floor, resend-by-settlement-id → no double-pay).
+- **Forfeiture penalty**: validator forfeits pending balance + strike; 3 strikes ban; probation redirects shares to protocol cut. Math in packages/validator/README.md.
+- **Web dashboard**: GET /dashboard on any tracker, embedded dashboard.html, 4s polling.
+- **Observed routing throughput**: tracker records rolling observed tokens/sec per `(node_id, model)` from completed proxied inference requests, exposes it via `/v1/stats` and `/v1/network/map`, shows it on the dashboard, and prefers observed per-model TPS over startup benchmark for routing when samples exist.
+
+Suite: 222 passed, 3 skipped (openai/langchain packages missing in .venv — pre-existing).
+
+**Why:** design locked in ADR-0015 (USDT custodial settlement; TAI deferred, protocol cut = future TAI liquidity).
+**How to apply:** next steps are live devnet verification (run devnet_setup.py, start tracker with --solana-rpc-url/--usdt-mint/--treasury-keypair --billing-db), then the TAI mint when volume justifies it. Work not yet committed to git as of session end — check git status.
+
+## Alpha hardening (2026-07-05)
+
+Implementation complete for alpha-scoped blockers in `.scratch/alpha-hardening/`: 16/22 issues are `done`, including auth/gossip/service-token, persisted strike/ban/reputation, zero starting credit + spend cap, tracker-authoritative accounting, wallet binding proof, TOPLOC audit primitive, hop bisection, reputation scoring/routing, adaptive audits, and penalty wiring. Remaining 6/22 are `ready-for-human` / post-alpha or ops-gated: 12–15 multi-tracker money/Raft ordering hardening, 17 duplicate US-020 renumbering approval, and 21 honest-noise calibration corpus before production audit thresholds. Current verification: `uv run pytest -k 'not test_legacy_start_without_port_uses_next_available_port'` passes 316, skips 3; full `uv run pytest` has one environmental failure while local `meshnet-node` PID 1263451 occupies port 7000.
+
+Historical handoff note: `/mnt/c/Users/popov/Downloads/neuron-tai-alpha-handoff-2026-07-04.md` is useful for navigation and original audit context, but it predates the completed `.scratch/alpha-hardening/` planning artifacts. Treat its "missing ADR/issues/README" statements as stale; prefer `.scratch/alpha-hardening/README.md` and `.scratch/alpha-hardening/handoff.md` for current task order.
+
+## Node capability admission P0 (2026-07-09)
+
+Planning is ready at `.scratch/node-capability-admission/` with five sequential Ralph stories and ADR-0023. The design is model-agnostic: a Node must validate its selected Model Artifact/shard with a bounded real forward before Tracker routing; Qwen3.6 is only an optional development fixture. P0 adds a versioned local recipe-manifest/report contract, `meshnet-node doctor`, fail-closed startup admission, and tracker route gating. It intentionally excludes dynamic recipe/dependency installation and the future signed Node updater.
+
+## Windows CUDA node (working as of 2026-07-01)
+- miniforge3 base env, torch 2.7.1+cu118, torchvision 0.22.x+cu118
+- RTX 4060 Laptop GPU, 8 GB VRAM, benchmark index ~11,200
+- Run: `meshnet-node start --tracker https://ai.neuron.d-popov.com --model Qwen/Qwen2.5-0.5B-Instruct`
+- Known: tracker registration fails with `http://` — must use `https://`
+- pynvml deprecation warning is harmless (use nvidia-ml-py to silence it)
+
+## Model cache layout (2026-07-07)
+- Node downloads now cache files directly under `<download_dir>/<model>/`, not `<model>/layers_<start>-<end>/`, so a wider cached layer assignment can satisfy a later narrower assignment without duplicate shard folders.
+- Downloader checks tracker-advertised `files` + `file_sizes` before peer/HF download; complete local files return immediately and preserve any extra files already in the model folder.
+- Verification: downloader/startup targeted subset passes (`pytest tests/test_node_startup.py -k "download_shard or same_shard"`). Full `tests/test_node_startup.py` has 46 passed and 4 unrelated Windows chmod/path separator failures.
+- Live Windows confirmation: `meshnet-node start --tracker http://192.168.0.179:8080 --model Qwen3.6-35B-A3B` reuses `F:\_STORAGE\models\qwen3.6-35b-a3b`, prints `Cached at`, registers, and reaches ready as node `5gMLrmyB-26b1f8a4204a`.
+- Follow-up fix: preset-model startup now starts the heartbeat thread after registration; without this, the node appeared briefly on the dashboard and was purged on first inference/route after heartbeat expiry. Tracker dashboard now has a "Console output" panel backed by `/v1/console` for node register/expiry, routing failures, and proxy events.
+- Qwen3.6-35B-A3B CPU runtime cap (2026-07-08): the old reserve-based split could assign an 79 GB CPU node layers 0-36, but real partial loading can exceed that budget and die without a Python traceback. Node startup now clips oversized CPU auto-assignments before loading, and tracker CPU assignment uses a stricter runtime headroom factor; do not revert this to the old 20% reserve-only policy.
+- Route hardening: tracker chat proxy and `/v1/route` diagnostics now use alias-aware preset node matching for split Qwen3.6 routes; dashboard derives grouped inference history from proxy route/complete console events and shows observed TPS after completion.
+- Live proxy hardening: model lookup trims outer whitespace before alias matching (`qwen3.6-35b-a3b ` resolves), and tracker route logs/dashboard queue depth combine heartbeat queue with tracker-local proxy in-flight counts so Postman-style bursts no longer show every selected route as queue `0`.
+- Split-shard streaming hardening: Qwen3.6-style distributed generation now emits SSE chunks token-by-token from the head node instead of buffering all generated text until completion. Tracker direct/relay stream proxy logs `proxy progress` with live tokens/TPS, dashboard Inference history shows currently processing requests with live TPS/tokens/queue, and relay stream completion no longer references an undefined `session_id`.
+- Native Windows Qwen3.6-MoE import fix: `flash-linear-attention` imports `triton`; without `triton-windows`, startup fails with misleading `Could not import module 'Qwen3_5MoeForCausalLM'`. Installed `triton-windows` in `C:\Users\popov\miniforge3` and added it as a Windows-only node dependency.

.claude/memory/user-profile.md

@@ -0,0 +1,15 @@
+---
+name: user-profile
+description: Who Dobromir is and how to collaborate effectively
+metadata: 
+  node_type: memory
+  type: user
+  originSessionId: 8fb120ee-7b8e-45be-98c0-b5ae9c64d1ec
+---
+
+# Dobromir Popov
+
+- Building neuron-tai: a distributed LLM inference network with volunteer GPU nodes, tracker, relay, and token rewards
+- Works across Linux (AMD Ryzen AI Max APU, 124 GB RAM) and Windows 11 (RTX 4060 Laptop GPU, 8 GB VRAM, miniforge3 Python env)
+- Uses ralph for project management (prd.json + issues in .scratch/)
+- Iterates quickly — prefers short, direct answers and learns from real output/errors rather than pre-emptive explanations

.claude/settings.json

@@ -0,0 +1,27 @@
+{
+  "hooks": {
+    "PreToolUse": [
+      {
+        "matcher": ".*",
+        "hooks": [
+          {
+            "type": "command",
+            "command": "bash -c 'SRC=\"/mnt/d/DEV/workspace/REPOS/git.d-popov.com/neuron-tai/.claude/memory\" && DST=\"/home/dev/.claude/projects/-mnt-d-DEV-workspace-REPOS-git-d-popov-com-neuron-tai/memory\" && mkdir -p \"$DST\" && rsync -a --update \"$SRC/\" \"$DST/\" 2>/dev/null; true'",
+            "runOncePerSession": true
+          }
+        ]
+      }
+    ],
+    "PostToolUse": [
+      {
+        "matcher": "Write|Edit",
+        "hooks": [
+          {
+            "type": "command",
+            "command": "bash -c 'SRC=\"/mnt/d/DEV/workspace/REPOS/git.d-popov.com/neuron-tai/.claude/memory\" && DST=\"/home/dev/.claude/projects/-mnt-d-DEV-workspace-REPOS-git-d-popov-com-neuron-tai/memory\" && mkdir -p \"$DST\" && rsync -a \"$SRC/\" \"$DST/\" 2>/dev/null; true'"
+          }
+        ]
+      }
+    ]
+  }
+}

.claude/skills/close-feature

@@ -0,0 +1 @@
+../../.agents/skills/close-feature

.codex/hooks.json

@@ -0,0 +1,15 @@
+{
+  "hooks": {
+    "PostToolUse": [
+      {
+        "matcher": "Write|Edit",
+        "hooks": [
+          {
+            "type": "command",
+            "command": "bash -c 'SRC=\"/mnt/d/DEV/workspace/REPOS/git.d-popov.com/neuron-tai/.claude/memory\" && DST=\"/home/dev/.claude/projects/-mnt-d-DEV-workspace-REPOS-git-d-popov-com-neuron-tai/memory\" && mkdir -p \"$DST\" && rsync -a \"$SRC/\" \"$DST/\" 2>/dev/null; true'"
+          }
+        ]
+      }
+    ]
+  }
+}

.dockerignore

@@ -0,0 +1,12 @@
+.git
+.venv
+__pycache__
+*.py[cod]
+.pytest_cache
+*.egg-info
+build
+dist
+.ralph-tui
+.scratch
+.claude
+.env*

.env.testnet

@@ -5,3 +5,9 @@ MESHNET_CONTRACT_ADAPTER=solana-testnet
 MESHNET_REGISTRY_PROGRAM_ID=
 MESHNET_PAYMENT_PROGRAM_ID=
 MESHNET_SETTLEMENT_PROGRAM_ID=
+
+# MESHNET_DOWNLOAD_DIR=
+#  HF_TOKEN=
+# URL_TRACKER=
+# DEFAULT_MODEL=
+

.gitattributes

@@ -0,0 +1,28 @@
+# Normalize line endings across Windows/Linux checkouts.
+# All text files are stored as LF in the repo and checked out as LF
+# on every OS. Git auto-detects text vs binary.
+* text=auto eol=lf
+
+# Explicitly binary — never touch these bytes.
+*.png binary
+*.jpg binary
+*.jpeg binary
+*.gif binary
+*.ico binary
+*.pdf binary
+*.zip binary
+*.gz binary
+*.tar binary
+*.wasm binary
+*.sqlite binary
+*.sqlite3 binary
+*.safetensors binary
+*.gguf binary
+
+# Scripts that must stay LF even if someone forces CRLF locally.
+*.sh text eol=lf
+*.py text eol=lf
+
+# Windows batch files genuinely need CRLF.
+*.bat text eol=crlf
+*.cmd text eol=crlf

.gitignore

@@ -10,4 +10,21 @@ dist/
 .venv/
 
 # Ralph local runtime state
-.ralph-tui/
+.ralph-tui/*
+!.ralph-tui/config.toml
+
+
+.env
+.env.*
+!.env.example
+!.env.testnet
+.rocm-local/*
+.pytest-tmp/*
+
+# Local tracker/node sqlite databases (never commit runtime state)
+*.sqlite
+*.sqlite3
+logs/tracker/error.log
+logs/tracker/info.log
+logs/tracker/warning.log
+.venv*

.ralph-tui/config.toml

@@ -0,0 +1,12 @@
+# Ralph TUI Configuration
+# Generated by setup wizard
+# See: ralph-tui config help
+
+configVersion = "2.1"
+tracker = "json"
+agent = "opencode"
+maxIterations = 0
+autoCommit = true
+
+[trackerOptions]
+[agentOptions]

.scratch/alpha-hardening/README.md

@@ -0,0 +1,109 @@
+# Alpha hardening — planning index
+
+Pre-release alpha audit + grilling (2026-07-04). Bucket 1 trust-boundary blockers + fraud arc: **done** (16/22 original issues). Bucket 2 (12-15, multi-tracker) and 17 (doc dedup) remain deferred/human-gated — not launch blockers.
+
+**Launch-readiness grilling (2026-07-06):** locked plan is devnet dev/test run now, then real mainnet SOL/USDT for the first cohort — friends (API clients) + hired VPS/VPC hosts (own test infra, not third-party volunteers, stake-free). No new public token; TAI stays dormant per ADR-0002's existing volume/legal gates. Two new issues came out of this session:
+
+- **[21 — Honest-noise calibration corpus](./issues/21-honest-noise-calibration-corpus.md)** — rescoped from "prod gate" to a hard **alpha-release blocker**. `Status: ready-for-human` — engineering (audit.py raw divergence, tracker dispatch endpoint, SQLite corpus, p99 envelope) done 2026-07-06; blocked on a human running the calibration job against the real hired-VPS fleet before launch.
+- **[23 — Dynamic HF-benchmarked pricing](./issues/23-dynamic-hf-pricing_completed.md)** — new, high priority but not a release blocker. `Status: done` — engineering complete 2026-07-06 (hf_pricing.py, opt-in daily refresh loop, GET /v1/pricing/hf/history); real `hf_aliases` curation per model is a follow-up human sign-off, not a completion blocker.
+
+Locked scope: one settlement tracker, open node join, devnet mock-USDT, reputation carries forward → fraud must be bounded. See [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md).
+
+**Resume task (2026-07-07):** [24 - Routing telemetry resume](./issues/24-routing-telemetry-resume.md) is `ready-for-agent`. Learned-routing commit `518c259` is already present; dirty tree contains current-request heartbeat/dashboard telemetry and a known import-time annotation crash in `server.py:1490`.
+
+**Perf follow-up (2026-07-08):** [25 — Sharded per-node KV cache for distributed generation](./issues/25-per-node-kv-cache-distributed.md) is **implemented** ([ADR-0022](../../docs/adr/0022-sharded-per-node-kv-cache.md)): per-generation session ids, prefill/decode wire protocol (`X-Meshnet-Cache`/`X-Meshnet-Past-Len`), per-node sharded `DynamicCache(config=…)` (hybrid-attention-aware), TTL+LRU eviction with 409 cache-miss → full re-prefill fallback. Golden test proves token-identical output vs the stateless path; CPU two-shard measurement: 7.05 tps decaying 32% → 18.93 tps flat (2.68×). Remaining: re-measure on the live 2-node GPU topology and the Qwen3.6-35B-A3B mixed topology.
+
+## Artifacts
+
+| Path | Status |
+|---|---|
+| [research-verifiable-inference.md](./research-verifiable-inference.md) | Complete — SOTA research, §8 layered scheme, TOPLOC adopt |
+| [handoff.md](./handoff.md) | Session handoff — locked decisions, env notes |
+| [docs/adr/0016–0019](../../docs/adr/) | Alpha scope, auth, fraud, multi-tracker design |
+| [issues/](./issues/) | 25 work items (Buckets 1–3 + perf follow-ups) |
+
+## ADRs (this feature)
+
+| ADR | Title |
+|---|---|
+| [0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md) | Alpha scope & known limitations |
+| [0017](../../docs/adr/0017-tracker-authentication-and-authorization.md) | Tracker authentication & authorization |
+| [0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) | Fraud detection, verification & reputation (flagship) |
+| [0019](../../docs/adr/0019-money-path-consistency-multi-tracker.md) | Money-path consistency — design accepted, impl deferred |
+| [0002](../../docs/adr/0002-dual-token-payment-model.md) | Amended — settlement superseded by 0015 |
+| [0010](../../docs/adr/0010-p2p-gossip-and-nat-relay.md) | Amended — TLS alpha reality (relay only) |
+
+## Recommended implementation order
+
+**Implement Bucket 1 first.** Fraud arc depends on **auth foundation (02 + 20)**, **hive gossip enforcement (01)**, and **persistence (05)**.
+
+### Phase 1 — Trust boundary (alpha blockers)
+
+| Order | Issue | ID | Depends on |
+|---|---|---|---|
+| 1 | [Unified auth boundary](./issues/02-a2-unified-auth-boundary_completed.md) + [Validator service token](./issues/20-validator-service-token_completed.md) | A2, — | — |
+| 2 | [C1 hive gossip auth enforcement](./issues/01-c1-gossip-auth_completed.md) | C1 | 02 |
+| 3 | [Persist strike/ban/reputation](./issues/05-a1-a5-persist-strike-ban-reputation_completed.md) | A1/A5 | 02 |
+| 4 | [Starting credit 0 + spend cap](./issues/03-c5-starting-credit-zero_completed.md) | C5, M1 | 02 |
+| 5 | [Tracker-authoritative accounting](./issues/04-h2-tracker-authoritative-accounting_completed.md) | H2 | 02 |
+| 6 | [Wallet binding proof](./issues/11-c6-wallet-binding-proof_completed.md) | C6 | 02, 03 |
+
+### Phase 2 — Fraud arc (after Phase 1)
+
+| Order | Issue | Depends on |
+|---|---|---|
+| 6 | [TOPLOC integration](./issues/06-fraud-toploc-integration_completed.md) | 05 |
+| 7 | [Commitment + bisection blame](./issues/07-fraud-commitment-bisection-blame_completed.md) | 06 |
+| 8 | [Reputation model](./issues/08-fraud-reputation-model-persistence_completed.md) | 05, 07 |
+| 9 | [Routing + adaptive audit](./issues/09-fraud-reputation-routing-adaptive-audit_completed.md) | 08 |
+| 10 | [Penalty calibration wiring](./issues/10-fraud-penalty-calibration-wiring_completed.md) | 07, 08, 02 |
+
+**Prod gate:** [21 honest-noise calibration corpus](./issues/21-honest-noise-calibration-corpus.md) must complete before enabling production TOPLOC audit thresholds (issues 09–10 in prod). Dev/staging TOPLOC wiring (06–08) may proceed in parallel.
+
+### Phase 3 — Bucket 2 (post-alpha, design tracked)
+
+| Issue | ADR |
+|---|---|
+| [12 C2 on-chain idempotency](./issues/12-c2-on-chain-idempotency.md) | 0019 §1 |
+| [13 C3/C4 consensus-gated settlement](./issues/13-c3-c4-consensus-gated-settlement.md) | 0019 §2 |
+| [14 A3 durable Raft term/vote](./issues/14-a3-raft-durable-term-vote.md) | 0019 §3 |
+| [15 H1 commutative forfeit](./issues/15-h1-commutative-forfeit.md) | 0019 §4 |
+
+### Phase 4 — Doc hygiene (parallel anytime)
+
+| Issue |
+|---|
+| [16 US-006 + fraud issue reconciliation](./issues/16-doc-us006-reconciliation_completed.md) |
+| [17 Duplicate US-020 dedup](./issues/17-doc-duplicate-us020-dedup.md) |
+| [18 Operational runbooks](./issues/18-doc-operational-runbooks_completed.md) |
+| [19 Cryptography + test env](./issues/19-doc-cryptography-test-env_completed.md) |
+| [22 MEMORY + project-status index](./issues/22-doc-memory-project-status_completed.md) (done) |
+| [21 Honest-noise calibration corpus](./issues/21-honest-noise-calibration-corpus.md) (ops; prod gate for audits) |
+
+### Phase 5 — Distributed-inference performance (post-routing-fix)
+
+| Issue | Depends on |
+|---|---|
+| [25 Sharded per-node KV cache](./issues/25-per-node-kv-cache-distributed.md) | ADR-0020 routing fix (done), [24 routing telemetry resume](./issues/24-routing-telemetry-resume.md) |
+
+## First 3 to implement
+
+1. **02 + 20** — Unified auth boundary + validator service token (shared helper and roles)
+2. **01** — Apply hive auth to billing/accounts/stats gossip endpoints
+3. **05** — Persist strike/ban/reputation (penalties must survive restart)
+
+## Research anchor
+
+Fraud design cites [.scratch/alpha-hardening/research-verifiable-inference.md](./research-verifiable-inference.md):
+
+- **ADOPT** TOPLOC (§8–9, build-vs-adopt table)
+- **On-demand** commitments, not every request (§8 layer 1 footnote; ADR-0018 §3)
+- **5% audit budget** as target, not cap (§1.1, §6)
+- **19× deterrence** via full pending forfeiture (§1.1)
+- **Hop bisection** blame pattern (§1.2, §8 layer 3)
+- **Honest-noise corpus** before prod thresholds (§8 layer 3; issue 21)
+- **Roadmap-only:** zkML, TEE, Gensyn RepOps (§9)
+
+## Comments
+
+<!-- Append triage / implementation notes below -->

.scratch/alpha-hardening/handoff.md

@@ -0,0 +1,111 @@
+# neuron-tai — Alpha Hardening Handoff
+
+**Date:** 2026-07-04  
+**Repo:** `D:/DEV/git.d-popov.com/neuron-tai`  
+**Prior session:** Pre-release alpha audit + grilling (design locked; planning artifacts complete)
+
+---
+
+## 1. Mission / where we are
+
+neuron-tai is a volunteer-GPU, pipeline-parallel LLM inference network with a working routing layer and a **broken money/trust path**. Three independent audits agreed: unauthenticated gossip, free-credit faucet, double-pay risks, ephemeral bans, and node self-reported accounting undermine alpha release. The owner locked alpha scope (single settlement tracker, open node join, devnet mock-USDT, carried-forward reputation) and a fraud/verification design (TOPLOC adoption, adaptive audits, on-demand hop bisection, persisted graduated reputation, tracker-authoritative accounting). **Research and planning artifacts are complete** (ADRs 0016–0019, 22 issue files, README index). Next: implement Bucket 1 blockers test-first.
+
+---
+
+## 2. Locked decisions
+
+Point to artifacts — do not re-derive from this handoff.
+
+| Decision | Status | Reference |
+|---|---|---|
+| Alpha scope: one settlement tracker, open join, devnet mock-USDT, reputation carries forward | Locked | `docs/adr/0016-alpha-scope-and-known-limitations.md` |
+| Two fraud types: correctness (bad output) vs accounting (inflated tokens/shard span) | Locked | Session grilling; research §8 |
+| Detection: **ADOPT TOPLOC** (MIT, `pip install toploc`); teacher-forced prefill; pin one canonical precision per model | Locked | `.scratch/alpha-hardening/research-verifiable-inference.md` §8 |
+| Audit rate: **5% default, not a cap**; escalate on anomaly, low reputation, disputes | Locked | Research §1.1, §6, §8 |
+| Blame: **on-demand** per-hop activation commitments + bisection to first divergent hop (Verde/Truebit **pattern only**) | Locked | Research §1.2; ADR-0018 §3–4 |
+| Reputation: graduated multiplier (×0.8-per-strike shape), persisted, affects routing + audit rate | Locked | ADR-0018 §6; `packages/validator/README.md` |
+| Penalty: **full pending forfeiture** is primary hammer (19× deterrence at 5% audit); ×0.8 is routing/payout decay | Locked | Research §1.1; ADR-0018 §1 |
+| Accounting: tracker authoritative — count tokens from proxied stream; work units from **tracker-assigned** shard span | Locked | ADR-0018 §5; issue 04 |
+| Persistence prerequisite: strike/ban/reputation/probation must survive tracker restart | Locked | Issue 05 |
+| Validator service token for forfeit | Locked | ADR-0017 §4; issue 20 |
+| Honest-noise corpus before prod audit thresholds | Locked | ADR-0018 consequences; issue 21 |
+| Build vs adopt: TOPLOC **ADOPT**; Verde bisection **ADAPT**; zkML/TEE **roadmap-only** | Locked | Research §9 |
+| Multi-tracker money-path (C2/C3/C4/A3/H1): **design now, implement later** | Locked | `docs/adr/0019-money-path-consistency-multi-tracker.md` |
+| Routing layer | **Solid** — no redesign needed | ADR-0013 |
+
+**Existing ADRs still relevant:** ADR-0003 (historical prototype), ADR-0015 (USDT custodial settlement).
+
+---
+
+## 3. Artifact index (read first)
+
+| Path | What it contains |
+|---|---|
+| `.scratch/alpha-hardening/README.md` | Issue/ADR index + implementation order |
+| `.scratch/alpha-hardening/issues/` | 22 work items (Buckets 1–3) |
+| `.scratch/alpha-hardening/research-verifiable-inference.md` | SOTA research, layered alpha scheme (§8), build-vs-adopt (§9) |
+| `docs/adr/0016–0019` | Alpha scope, auth, fraud, multi-tracker design |
+| `docs/agents/issue-tracker.md` | Issue file conventions |
+| `packages/validator/meshnet_validator/__init__.py` | Current validator; `_final_text_node` blame bug |
+| `packages/tracker/meshnet_tracker/server.py` | Auth gaps, gossip handlers, proxy accounting |
+| `.claude/memory/MEMORY.md` | Agent memory index |
+| Agent transcript (grilling session) | [Alpha audit grilling](4406ccbb-011a-4157-851d-b5b242bba7f7) |
+
+### Bucket summaries
+
+**Bucket 1 — Alpha blockers:** C1 gossip auth; A2 unified auth + issue 20 validator token; C5 starting credit; H2 tracker accounting; A1/A5 persistence; C6 wallet binding; fraud arc 06–10.
+
+**Bucket 2 — Design deferred:** C2, C3/C4, A3, H1 (issues 12–15).
+
+**Bucket 3 — Doc hygiene:** US-006/07/34 reconciliation (16), MEMORY index (22), runbooks (18), cryptography test env (19).
+
+---
+
+## 4. Recommended implementation order
+
+See `.scratch/alpha-hardening/README.md` for full table.
+
+**First 3:**
+
+1. **02 + 20** — Unified auth boundary + validator service token
+2. **01** — Apply hive auth to billing/accounts/stats gossip endpoints
+3. **05** — Persist strike/ban/reputation
+
+**Prod gate:** issue **21** (honest-noise corpus) before enabling production audit thresholds.
+
+---
+
+## 5. Open questions / deferred
+
+| Topic | State |
+|---|---|
+| Multi-tracker consensus & settlement idempotency | Bucket 2 (ADR-0019) |
+| `/v1/gossip` node throughput auth | Out of scope alpha — ADR-0017 §3 note |
+| Seed-synchronized exact-token audits | Optional complement; depends on sampler control |
+| ADR-0010 TLS everywhere | Relay TLS only in alpha; ADR amended |
+
+---
+
+## 6. Environment notes
+
+| Item | Detail |
+|---|---|
+| OS | Windows 10 |
+| Repo path | `D:/DEV/git.d-popov.com/neuron-tai` |
+| Python venv | `.venv/Scripts/python.exe` |
+| CUDA node | RTX 4060 8 GB; tracker registration requires `https://` |
+| Secrets | Do not commit `.env.devnet`, keypairs, treasury material |
+
+---
+
+## 7. Suggested skills
+
+| Skill | When |
+|---|---|
+| **implement** | Bucket 1 code work |
+| **tdd** | All Bucket 1 fixes |
+| **diagnosing-bugs** | Auth/gossip/accounting failures |
+| **domain-modeling** | ADR cross-links |
+| **code-review** | After each blocker milestone |
+
+Read `.claude/memory/MEMORY.md` at session start.

.scratch/alpha-hardening/issues/01-c1-gossip-auth_completed.md

@@ -0,0 +1,41 @@
+Status: done
+
+# 01 — C1: Authenticate hive gossip endpoints
+
+## What to build
+
+Add authenticated peer identity to all tracker gossip mutation endpoints. Today any caller can push billing, account, and stats events without verification.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_billing_gossip` (~2414–2427)
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_accounts_gossip` (~2610–2623)
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_stats_gossip` (~2355–2364)
+- `packages/tracker/meshnet_tracker/billing.py` — `apply_events` (~301–311)
+- `packages/tracker/meshnet_tracker/accounts.py` — `apply_events` (~220–226)
+
+Implement per ADR-0017 §3 using the auth helper/config from issue 02: shared hive HMAC (body + timestamp) or mutual TLS between configured tracker peers. Reject unauthenticated gossip with 401.
+
+**Note:** `/v1/gossip` (node throughput fan-out, `server.py` ~1331) is **not** in scope for this issue — see ADR-0017 §3 out-of-scope note.
+
+## Test-first
+
+1. Red: unauthenticated POST to `/v1/billing/gossip` applies a credit event today — test must fail after fix.
+2. Red: authenticated peer with valid HMAC applies events; invalid/missing auth returns 401 and `applied: 0`.
+3. Green: wire the issue-02 verifier/config (`--hive-secret` or peer cert paths) into the three hive mutation endpoints.
+
+## Acceptance criteria
+
+- [ ] `/v1/billing/gossip`, `/v1/accounts/gossip`, `/v1/stats/gossip` reject requests without valid hive auth
+- [ ] Authenticated peers replicate events as today (id-dedup preserved)
+- [ ] Config documented for multi-tracker dev setups
+- [ ] Tests cover reject + accept paths without live network
+
+## ADR links
+
+- [ADR-0017](../../docs/adr/0017-tracker-authentication-and-authorization.md)
+- [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md)
+
+## Blocked by
+
+- `02-a2-unified-auth-boundary_completed.md` — owns shared auth middleware/config. Implement in the same PR if simpler.

.scratch/alpha-hardening/issues/02-a2-unified-auth-boundary_completed.md

@@ -0,0 +1,46 @@
+Status: done
+
+# 02 — A2: Unified auth boundary for privileged and financial reads
+
+## What to build
+
+Replace header-presence stubs with a single auth middleware that resolves API keys, admin sessions, validator service tokens, and hive peer identity. Close leaks on financial and operator endpoints. This is the auth foundation issue; issue 01 should only apply hive auth to gossip endpoints once the helper exists.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_billing_forfeit` (~2429–2464) — H3: non-empty `Authorization` only
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_benchmark_hop_penalty` (~2650–2658), `_handle_benchmark_results` (~2745–2748) — H3
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_billing_summary` (~2366–2371) — H4
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_billing_settlements` (~2407–2412) — H4
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_registry_wallets` (~2391–2405) — H4
+- `packages/tracker/meshnet_tracker/server.py` — `_session_account` (~2468+), `_handle_admin_accounts` (~2588–2608) — H4
+- `packages/tracker/meshnet_tracker/accounts.py` — `session_account()`, `create_session()` only (session store; not handler wiring)
+
+Per ADR-0017 §4: forfeit → validator or admin; benchmark → admin; billing summary/settlements/registry wallets → admin session. Include the validator service token shape from `20-validator-service-token_completed.md` in the same implementation if practical.
+
+## Test-first
+
+1. Red: POST `/v1/billing/forfeit` with `Authorization: Bearer garbage` succeeds today — must require validator/admin identity.
+2. Red: GET `/v1/billing/summary` without admin session returns 401/403.
+3. Green: middleware + role checks; existing inference API-key path unchanged.
+
+## Acceptance criteria
+
+- [ ] Single `_require_auth(role=...)` (or equivalent) used by all privileged handlers
+- [ ] Shared auth config supports admin sessions, validator service token, and hive peer HMAC/mTLS
+- [ ] Forfeit accepts only validator service token or admin session — not arbitrary Bearer strings
+- [ ] Financial read endpoints require admin session (alpha posture)
+- [ ] Benchmark write/read require admin or service token
+- [ ] Integration tests for each endpoint class (reject unauth, accept valid)
+
+## ADR links
+
+- [ADR-0017](../../docs/adr/0017-tracker-authentication-and-authorization.md)
+
+## Related
+
+- `20-validator-service-token_completed.md` — checklist for validator service token format, rotation, forfeit auth
+
+## Blocked by
+
+None. This issue should land before `01-c1-gossip-auth_completed.md`.

.scratch/alpha-hardening/issues/03-c5-starting-credit-zero_completed.md

@@ -0,0 +1,38 @@
+Status: done
+
+# 03 — C5 + M1: Starting credit 0, funded-account gate, spend cap
+
+## What to build
+
+Close the free-credit faucet. New API keys start at **0 USDT**; inference requires a real deposit or admin credit. Add a configurable per-request spend cap (M1) to limit runaway charges on compromised keys.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/billing.py` — `DEFAULT_STARTING_CREDIT = 1.0` (~22), `ensure_client` (~73–85), `has_funds` (~87–88), duplicate credit on charge (~130–138)
+- `packages/tracker/meshnet_tracker/server.py` — billing gate before routing (~1667–1690)
+
+Per ADR-0017 §2 and ADR-0016 §3.
+
+## Test-first
+
+1. Red: new API key gets 1.0 USDT implicit credit — test expects 0 balance until deposit.
+2. Red: first inference without deposit returns 402.
+3. Green: `DEFAULT_STARTING_CREDIT = 0.0`; optional `--max-charge-per-request` config.
+
+## Acceptance criteria
+
+- [ ] `DEFAULT_STARTING_CREDIT` is 0.0; no automatic caller credit on first touch
+- [ ] `has_funds` false for fresh keys; 402 before routing (server.py ~1684)
+- [ ] Admin `credit_client` or bound-wallet deposit still funds accounts
+- [ ] Configurable max charge per request (M1) rejects oversize completions with clear error
+- [ ] Tests: fresh key blocked; after credit/deposit, inference proceeds
+
+## ADR links
+
+- [ADR-0017](../../docs/adr/0017-tracker-authentication-and-authorization.md)
+- [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md)
+- [ADR-0015](../../docs/adr/0015-usdt-custodial-settlement.md)
+
+## Blocked by
+
+- `02-a2-unified-auth-boundary_completed.md` (admin credit path secured)

.scratch/alpha-hardening/issues/04-h2-tracker-authoritative-accounting_completed.md

@@ -0,0 +1,38 @@
+Status: done
+
+# 04 — H2: Tracker-authoritative token and work-unit accounting
+
+## What to build
+
+Stop trusting node-reported usage for billing. The tracker already proxies responses — use tracker-observed response data and request limits to cap billable tokens, and compute work units from the **route it constructed**, not node declarations.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — `node_work` from route construction (~1776–1782, ~1781–1782)
+- `packages/tracker/meshnet_tracker/server.py` — streaming token/chunk billing (~1890–1921)
+- `packages/tracker/meshnet_tracker/server.py` — non-streaming `_usage_total_tokens` (~1938–1943)
+- `packages/tracker/meshnet_tracker/billing.py` — `charge_request` node_work split (~104–151)
+
+Accounting fraud = inflating tokens or shard span. Per ADR-0018 §5.
+
+## Test-first
+
+1. Red: mock upstream returns inflated `usage.total_tokens` in body but tracker bills that value — test expects the tracker to cap billable tokens from observed stream chunks or request bounds.
+2. Red: node registers false `shard_end`; billing uses tracker route span, not registration field alone.
+3. Green: authoritative counters; ignore node-reported work units on charge path.
+
+## Acceptance criteria
+
+- [ ] Streaming token count uses tracker-observed chunks/tokens; upstream `usage.total_tokens` can only lower or match that observed count, never inflate it
+- [ ] Non-streaming token count caps upstream `usage.total_tokens` by tracker-known request bounds (`max_tokens`, and prompt estimate if available); exact tokenizer-backed counts are deferred unless already available locally
+- [ ] Work units = tracker-computed layer span per hop at route build time (~1781–1782)
+- [ ] Nodes cannot increase payout by lying about shard range mid-request
+- [ ] Integration test: malicious node metadata does not inflate `charge_request` shares
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) §5
+
+## Blocked by
+
+- `02-a2-unified-auth-boundary_completed.md`

.scratch/alpha-hardening/issues/05-a1-a5-persist-strike-ban-reputation_completed.md

@@ -0,0 +1,40 @@
+Status: done
+
+# 05 — A1/A5: Persist strike, ban, and reputation state
+
+## What to build
+
+Registry strike/ban/reputation state today lives in RAM-only `_LocalContractState` — tracker restart wipes penalties. Persist to SQLite (same pattern as `BillingLedger` and `AccountStore`) so reputation carries forward per ADR-0016 §4.
+
+**Code refs:**
+
+- `packages/contracts/meshnet_contracts/__init__.py` — `RegistryContract`, `RegistryWallet`, in-memory `_state.registry` (~103–206)
+- `packages/tracker/meshnet_tracker/billing.py` — SQLite persistence pattern (~60, event log)
+- `packages/tracker/meshnet_tracker/accounts.py` — SQLite + event replication (~40–56)
+
+Include fields for: `strike_count`, `banned`, `completed_job_count`, graduated **reputation score** (float, default 1.0), `last_audit_ts`, probation tracking.
+
+**Scope split:** this issue owns **schema + persistence + load/reload** only. Reputation **scoring deltas** (audit pass/fail adjustments, decay rules) belong in issue 08.
+
+## Test-first
+
+1. Red: record strike, restart tracker process, strike count is 0 — must fail.
+2. Green: persist + reload; gossip replicates strike events if multi-tracker.
+3. Red: banned wallet registers node — must reject (wire to routing).
+
+## Acceptance criteria
+
+- [ ] Strike/ban/reputation survive tracker restart (SQLite or equivalent)
+- [ ] `RegistryContract.list_wallets` reflects persisted state
+- [ ] Banned wallet rejected at registration and excluded from routes
+- [ ] Reputation score field present for routing/audit issues (08–09)
+- [ ] Event-sourced mutations compatible with future Raft (ADR-0019)
+
+## ADR links
+
+- [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md) §4
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) §6
+
+## Blocked by
+
+- `02-a2-unified-auth-boundary_completed.md`

.scratch/alpha-hardening/issues/06-fraud-toploc-integration_completed.md

@@ -0,0 +1,47 @@
+Status: done
+
+# 06 — FRAUD: TOPLOC integration (teacher-forced audit primitive)
+
+## What to build
+
+Adopt [TOPLOC](https://github.com/PrimeIntellect-ai/toploc) (MIT, `pip install toploc`) for activation fingerprint commit and verify. Replace string-equality validator checks with teacher-forced prefill + TOPLOC tolerance matching.
+
+**Estimated effort:** 2+ sessions. First landing should be the validator-only TOPLOC primitive and docs; node runtime commitments/on-demand capture can follow in issue 07 if this grows.
+
+| Subtask | Owner package | Deliverable |
+|---|---|---|
+| Validator audit primitive | `packages/validator/` | Teacher-forced prefill, TOPLOC verify, unit tests with stub tensors |
+| Node runtime commitments | `packages/node/` (if prover-side) | On-demand activation fingerprint generation on audit-selected requests; move to issue 07 if it blocks the validator primitive |
+
+**Code refs:**
+
+- `packages/validator/meshnet_validator/__init__.py` — `_run_reference`, `_outputs_match` (~92–148)
+- `packages/validator/README.md` — deterrence math (update for 19× at p=0.05)
+- Research: `.scratch/alpha-hardening/research-verifiable-inference.md` §8 layers 1–2, build-vs-adopt table
+
+Pin one canonical precision/quantization per model preset. Add `toploc` to validator (and node if prover-side) dependencies.
+
+## Test-first
+
+1. Red: validator compares final text strings — fails on cross-GPU honest divergence (document expected).
+2. Green: stub activation tensors + TOPLOC proofs round-trip in unit test.
+3. Integration: reference node teacher-forces tokens; verify accepts honest proof, rejects swapped precision.
+
+## Acceptance criteria
+
+- [x] `toploc` dependency declared; `build_proofs_*` / `verify_proofs_*` wired
+- [x] Validator re-runs claimed token sequence as prefill, not free generation
+- [x] Model preset documents canonical dtype/quantization
+- [x] README updated: 19× deterrence at 5% audit (research §1.1)
+- [x] Tests with deterministic stub tensors (no GPU required in CI)
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) §2
+- Research: [research-verifiable-inference.md](../research-verifiable-inference.md) §8, §9 build-vs-adopt
+
+## Blocked by
+
+- `05-a1-a5-persist-strike-ban-reputation_completed.md`
+
+**Prod gate:** do not enable production audit thresholds until `21-honest-noise-calibration-corpus.md` completes (see README Phase 2 note).

.scratch/alpha-hardening/issues/07-fraud-commitment-bisection-blame_completed.md

@@ -0,0 +1,35 @@
+Status: done
+
+# 07 — FRAUD: On-demand commitment + hop bisection blame
+
+## What to build
+
+On audit selection, require nodes to supply TOPLOC-style fingerprints of **output boundary activations** per hop (on-demand, brief retention). On verify failure, referee identifies the **first divergent hop** — not always the last text node.
+
+**Code refs:**
+
+- `packages/validator/meshnet_validator/__init__.py` — `_slash_route`, `_final_text_node` bug (~102–140) — blames `max(shard_end)` only
+- `packages/tracker/meshnet_tracker/server.py` — route hop construction (~1774–1783) — cut-points for bisection
+- Research: `.scratch/alpha-hardening/research-verifiable-inference.md` §1.2, §8 layer 3 (Verde **pattern**, not on-chain game)
+
+## Test-first
+
+1. Red: two-hop route, corrupt hop-0 activations — `_final_text_node` blames hop-1 — test must fail.
+2. Green: bisection selects hop-0; forfeit targets hop-0 wallet.
+3. On-demand: commitment requested only when audit flag set on proxied request.
+
+## Acceptance criteria
+
+- [x] Audit requests carry tracker RNG/VRF flag indistinguishable from normal traffic (research §6) — the existing post-hoc `sample_rate` RNG gate in `ValidatorProcess.validate_once` already decides audit selection after the original proxied request completed, so the request the client/nodes saw is unaffected either way; locked in by `test_hop_commitments_are_not_requested_unless_the_event_is_audit_selected`
+- [x] Nodes retain recent boundary activations for on-demand commit window (configurable TTL) — `ToplocAuditConfig.commitment_ttl_seconds`; expired commitments fall back to the text-only path (`test_expired_commitment_window_falls_back_to_text_only_audit`)
+- [x] Validator/tracker compares fingerprints at each hop cut-point; first mismatch = culprit — `_hop_commitments_from_event` + `_first_divergent_hop` in `packages/validator/meshnet_validator/__init__.py`
+- [x] `_final_text_node` removed or limited to text-only fallback — only called from the plain-text divergence branch of `_validate_event` now
+- [x] Integration test: multi-hop pipeline, fault injected at known hop — `tests/test_hop_bisection.py`
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) §3–4
+
+## Blocked by
+
+- `06-fraud-toploc-integration_completed.md`

.scratch/alpha-hardening/issues/08-fraud-reputation-model-persistence_completed.md

@@ -0,0 +1,39 @@
+Status: done
+
+# 08 — FRAUD: Reputation model + persistence
+
+## What to build
+
+Implement graduated reputation per ADR-0018 §6: score derives only from tracker audit outcomes + uptime/latency. Slow build, instant loss, inactivity decay. ×0.8 routing multiplier per strike (not whole penalty — forfeiture stays full pending).
+
+**Scope split:** issue 05 owns **schema + SQLite persistence**; this issue owns **scoring rules** (deltas, decay, strike→multiplier wiring) on top of persisted fields.
+
+**Code refs:**
+
+- `packages/contracts/meshnet_contracts/__init__.py` — extend `RegistryWallet` / persistence from issue 05
+- `packages/validator/meshnet_validator/__init__.py` — `_slash_route` forfeiture path (~125–133)
+- `packages/tracker/meshnet_tracker/billing.py` — `forfeit_pending` (~280–292)
+- Research: `.scratch/alpha-hardening/research-verifiable-inference.md` §6
+
+## Test-first
+
+1. Red: persisted reputation/strike fields from issue 05 are ignored by scoring/routing today.
+2. Green: clean audit +0.05 (tunable); failed audit −0.3 and strike; three strikes → ban persisted via issue-05 fields.
+3. Inactivity decay after N days without completed jobs.
+
+## Acceptance criteria
+
+- [ ] Uses `reputation_score` and strike/ban fields persisted by issue 05; does not introduce a second schema path
+- [ ] Audit pass/fail updates score with documented deltas
+- [ ] Strike applies ×0.8 multiplier to routing weight (separate from forfeiture amount)
+- [ ] Ban at 3 strikes; probation job count still enforced
+- [ ] No peer-to-peer reputation inputs
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) §6
+
+## Blocked by
+
+- `05-a1-a5-persist-strike-ban-reputation_completed.md`
+- `07-fraud-commitment-bisection-blame_completed.md` (audit outcomes feed reputation)

.scratch/alpha-hardening/issues/09-fraud-reputation-routing-adaptive-audit_completed.md

@@ -0,0 +1,38 @@
+Status: done
+
+# 09 — FRAUD: Reputation-weighted routing + adaptive audit rate
+
+## What to build
+
+Wire reputation into route selection and audit sampling. Default network audit budget ≈5% — **not a cap**. New/low-reputation nodes: 20–30% audit rate; veterans: 2–3% floor ≥2%. Tripwires escalate rate without direct punishment.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — route selection `_select_route`, `_effective_throughput` (~1747, routing helpers)
+- `packages/validator/meshnet_validator/__init__.py` — `sample_rate=0.05`
+- Research: `.scratch/alpha-hardening/research-verifiable-inference.md` §1.1, §6, §8 layers 2–4
+
+Audit selection must be unpredictable at request time (tracker RNG after commitment window opens).
+
+## Test-first
+
+1. Red: uniform 5% sample regardless of reputation — test expects higher rate for low-reputation wallet.
+2. Green: budget balancer keeps fleet-wide average ≈ configured target.
+3. Routing prefers higher reputation among equal throughput candidates.
+
+## Acceptance criteria
+
+- [ ] Per-wallet audit probability function of reputation (newcomer high, veteran low, floor ≥2%)
+- [ ] Fleet-wide audit budget configurable (~5% default target); over ≥1000 requests with fixed seed, measured fleet audit rate within **±1.0 percentage point** of configured target (e.g. 4.0–6.0% at 5% default)
+- [ ] Route scoring includes reputation multiplier (earnings scale with tenure)
+- [ ] Passive tripwire flags (perplexity/repetition) bump audit rate only
+- [ ] Tests: deterministic seed for sampling distribution checks
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) §1, §6–7
+- [ADR-0013](../../docs/adr/0013-rolling-stats-smart-routing.md)
+
+## Blocked by
+
+- `08-fraud-reputation-model-persistence_completed.md`

.scratch/alpha-hardening/issues/10-fraud-penalty-calibration-wiring_completed.md

@@ -0,0 +1,42 @@
+Status: done
+
+# 10 — FRAUD: Penalty calibration wiring (forfeit + strike + ban)
+
+## What to build
+
+End-to-end wiring: confirmed audit failure → atomic pending forfeiture + strike + reputation decay + audit-rate snap to max. Ensure payout cannot race penalty (ADR-0015). Document 19× deterrence math in validator README.
+
+**Code refs:**
+
+- `packages/validator/meshnet_validator/__init__.py` — `_slash_route` (~102–134)
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_billing_forfeit` (~2429–2464)
+- `packages/tracker/meshnet_tracker/billing.py` — `forfeit_pending` (~280–292), payout exclusion for banned (~3337–3344 in settlement loop)
+- `packages/validator/README.md` — update 20× → 19× at p=0.05
+
+Per ADR-0018: **full pending forfeiture** is primary penalty; ×0.8 is routing decay per strike, not partial forfeit.
+
+## Test-first
+
+1. Red: integration from issue 34 — extend with multi-hop blame wallet from issue 07.
+2. Green: node with pending balance → audit fail → pending zero, strike++, banned on 3rd, excluded from next settlement.
+3. Settlement loop skips banned wallets (~3337–3344).
+
+## Acceptance criteria
+
+- [x] Audit failure triggers forfeiture + strike in one tracker transaction — `ValidatorProcess._slash_node` (in-process) and the tracker's `_handle_billing_forfeit` handler (remote) both forfeit-then-strike synchronously in a single call path; each already existed pre-AH-010 and is exercised by `tests/test_forfeiture_penalty.py`
+- [x] Banned nodes excluded from `payables` / settlement — `BillingLedger.settle_node_payout` now clamps to the wallet's *current* pending balance under the same lock as the debit, and `_settlement_loop` rechecks ban status and uses the post-clamp amount before sending, so a forfeiture landing between the `payables()` snapshot and the actual payout can never be paid out on top of (ADR-0015 race); covered by `test_60_request_stream_bans_intermittent_first_hop_cheater_not_last_hop`
+- [x] Validator uses authenticated forfeit endpoint (issue 02) — `POST /v1/billing/forfeit` is validator-token/admin-gated (ADR-0017 §4, issue 20) and is the documented remote path (`packages/validator/README.md` Usage section); `test_forfeit_endpoint_requires_auth_and_forfeits` exercises the 401→200 flow. No standalone remote-validator process exists in this codebase yet (`contracts` has no networked implementation), so the in-process `ValidatorProcess` continues to call `BillingLedger.forfeit_pending` directly when co-located with the tracker — adding an HTTP-only forfeit client with no real consumer was judged out of scope/overengineering for this issue
+- [x] README: `L > 19× g` at p=0.05; pending balance = collateral — already present in `packages/validator/README.md` ("Why the penalty deters cheating")
+- [x] Integration test: 60-request fraud scenario → ban within threshold — `tests/test_forfeiture_penalty.py::test_60_request_stream_bans_intermittent_first_hop_cheater_not_last_hop`
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md)
+- [ADR-0015](../../docs/adr/0015-usdt-custodial-settlement.md)
+- Research: [research-verifiable-inference.md](../research-verifiable-inference.md) §1.1
+
+## Blocked by
+
+- `07-fraud-commitment-bisection-blame_completed.md`
+- `08-fraud-reputation-model-persistence_completed.md`
+- `02-a2-unified-auth-boundary_completed.md`

.scratch/alpha-hardening/issues/11-c6-wallet-binding-proof_completed.md

@@ -0,0 +1,37 @@
+Status: done
+
+# 11 — C6: Wallet binding ownership proof + binding overwrite safety
+
+## What to build
+
+`POST /v1/wallet/register` binds a client Solana wallet to an API key for deposit attribution. Today any Bearer key can bind any wallet string without proving ownership. Prevent hijack and accidental overwrite.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — `_handle_wallet_register` (~2625–2648)
+- `packages/tracker/meshnet_tracker/billing.py` — `bind_wallet` (~153+), `_wallet_bindings` / direct overwrite on apply (~351)
+
+Require signed message from wallet pubkey (ed25519 via `cryptography` / solders). Reject rebinding without admin or signed release. Use explicit overwrite policy — today `~351` overwrites binding directly; gossip apply must reject conflicting binds instead of silently clobbering.
+
+## Test-first
+
+1. Red: bind wallet A with only API key, no signature — must fail after fix.
+2. Red: wallet already bound to key1; key2 cannot steal without proof.
+3. Green: valid signature binds; deposit watcher credits correct API key.
+
+## Acceptance criteria
+
+- [x] Wallet binding requires cryptographic proof of pubkey ownership
+- [x] One wallet → one API key (or documented admin override)
+- [x] Gossip `bind` events cannot overwrite existing binding via direct overwrite at `~351`
+- [x] Tests with deterministic keypairs (local adapter)
+
+## ADR links
+
+- [ADR-0017](../../docs/adr/0017-tracker-authentication-and-authorization.md) §5
+- [ADR-0015](../../docs/adr/0015-usdt-custodial-settlement.md)
+
+## Blocked by
+
+- `02-a2-unified-auth-boundary_completed.md`
+- `03-c5-starting-credit-zero_completed.md`

.scratch/alpha-hardening/issues/12-c2-on-chain-idempotency.md

@@ -0,0 +1,29 @@
+Status: ready-for-human
+
+# 12 — C2: On-chain settlement idempotency (deferred)
+
+## What to build
+
+Harden payout idempotency so Solana transaction retries never double-pay. Design accepted in ADR-0019 §1; **implementation deferred post-alpha**.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — `_settlement_loop` resend (~3331–3356), `_send_settlement` (~3358–3376)
+- `packages/contracts/meshnet_contracts/solana_adapter.py` — `send_payouts` (~186–213)
+
+Today: pending debited before broadcast with stable `settlement_id`; unconfirmed batches resent. Gap: on-chain confirmation vs ledger state if tx succeeds but confirm fails.
+
+## Acceptance criteria
+
+- [ ] `confirm_settlement` only after RPC finalized confirmation
+- [ ] Retry path reuses same `settlement_id` and detects already-confirmed signature
+- [ ] Property test: N retries → single on-chain transfer per wallet per settlement_id
+- [ ] Document recovery procedure for stuck unconfirmed batches
+
+## ADR links
+
+- [ADR-0019](../../docs/adr/0019-money-path-consistency-multi-tracker.md) §1
+
+## Blocked by
+
+Alpha release (ADR-0016 single settlement tracker)

.scratch/alpha-hardening/issues/13-c3-c4-consensus-gated-settlement.md

@@ -0,0 +1,31 @@
+Status: ready-for-human
+
+# 13 — C3/C4: Consensus-gated money mutations (deferred)
+
+## What to build
+
+Route money-affecting ledger events through Raft commit, not gossip-only apply. Extend `raft.py` command set beyond register/deregister. Settlement remains leader-only with treasury key.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/server.py` — settlement leader gate (~3331–3332), payout batch (~3353–3356)
+- `packages/tracker/meshnet_tracker/raft.py` — log entry types (~26–27)
+- `packages/tracker/meshnet_tracker/billing.py` — `apply_events` (~301–311)
+
+Design: ADR-0019 §2. **Deferred post-alpha** while single operator holds settlement.
+
+## Acceptance criteria
+
+- [ ] `charge`, `payout`, `forfeit`, `credit`, `settlement`, `bind` commit via Raft log
+- [ ] Followers reject direct gossip money mutations
+- [ ] Leader-only `_settlement_loop` unchanged in semantics
+- [ ] Migration plan from gossip-only billing to Raft-backed log
+
+## ADR links
+
+- [ADR-0019](../../docs/adr/0019-money-path-consistency-multi-tracker.md) §2
+
+## Blocked by
+
+- `12-c2-on-chain-idempotency.md`
+- `14-a3-raft-durable-term-vote.md`

.scratch/alpha-hardening/issues/14-a3-raft-durable-term-vote.md

@@ -0,0 +1,25 @@
+Status: ready-for-human
+
+# 14 — A3: Durable Raft term and vote state (deferred)
+
+## What to build
+
+Persist Raft `currentTerm`, `votedFor`, and log metadata to disk. In-memory-only term (~26) risks split leadership after tracker restart → duplicate settlement epochs.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/raft.py` — `LogEntry.term` (~25–27), election state in `RaftNode`
+
+## Acceptance criteria
+
+- [ ] Term/vote persisted alongside tracker data dir
+- [ ] Restart resumes as follower/candidate with monotonic term
+- [ ] Test: kill leader mid-settlement, restart, no duplicate payout batch
+
+## ADR links
+
+- [ADR-0019](../../docs/adr/0019-money-path-consistency-multi-tracker.md) §3
+
+## Blocked by
+
+Alpha single-settlement posture

.scratch/alpha-hardening/issues/15-h1-commutative-forfeit.md

@@ -0,0 +1,27 @@
+Status: ready-for-human
+
+# 15 — H1: Commutative forfeit event ordering (deferred)
+
+## What to build
+
+Define deterministic ordering when `forfeit`, `charge`, and `payout` events replicate concurrently. Forfeit snapshots amount at creation (~287) but apply order can desync pending balances under gossip.
+
+**Code refs:**
+
+- `packages/tracker/meshnet_tracker/billing.py` — `forfeit_pending` (~280–292), `_apply_locked` forfeit branch (~345–349)
+- `packages/tracker/meshnet_tracker/billing.py` — `_pending_since.setdefault` (~324), wallet bind direct overwrite (~351)
+
+## Acceptance criteria
+
+- [ ] Documented commit order: charges before forfeit before payout for same wallet epoch
+- [ ] Forfeit events carry pending snapshot or `(term, index)` for tie-break
+- [ ] `setdefault` replaced with explicit merge rules on out-of-order apply
+- [ ] Property tests under shuffled event delivery
+
+## ADR links
+
+- [ADR-0019](../../docs/adr/0019-money-path-consistency-multi-tracker.md) §4
+
+## Blocked by
+
+- `13-c3-c4-consensus-gated-settlement.md`

.scratch/alpha-hardening/issues/16-doc-us006-reconciliation_completed.md

@@ -0,0 +1,30 @@
+Status: done
+
+# 16 — DOC: US-006 reconciliation note
+
+## What to build
+
+Reconcile stale US-006 (Solana testnet stake contracts) with ADR-0015/0016 devnet custodial settlement. Issue `docs/issues/06-solana-stake-and-settlement.md` says "never devnet"; ADR-0015 explicitly targets devnet mock-USDT.
+
+Also reconcile legacy fraud issues with the alpha-hardening fraud arc:
+
+- `docs/issues/07-fraud-detection-slash.md` — on-chain stake slash model superseded by pending-balance forfeiture + TOPLOC (ADR-0018)
+- `docs/issues/34-forfeiture-penalty.md` — partially implemented; remaining fraud work lives in `.scratch/alpha-hardening/issues/06-fraud-toploc-integration_completed.md` through `10-fraud-penalty-calibration-wiring_completed.md`
+
+## Acceptance criteria
+
+- [ ] Add reconciliation comment atop `docs/issues/06-solana-stake-and-settlement.md` (Status: superseded for alpha — see ADR-0015, issue 33/34)
+- [ ] Add **superseded** banner atop `docs/issues/07-fraud-detection-slash.md` → ADR-0018 + issues 06–10
+- [ ] Add **superseded for remaining scope** banner atop `docs/issues/34-forfeiture-penalty.md` → ADR-0018 + issues 06–10 (note done items: basic forfeiture wired)
+- [ ] Update `docs/prd.json` US-006 description footnote if present
+- [ ] Cross-link ADR-0015 devnet decision
+- [ ] No production code changes
+
+## ADR links
+
+- [ADR-0015](../../docs/adr/0015-usdt-custodial-settlement.md)
+- [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md)
+
+## Blocked by
+
+None

.scratch/alpha-hardening/issues/17-doc-duplicate-us020-dedup.md

@@ -0,0 +1,23 @@
+Status: ready-for-human
+
+# 17 — DOC: Duplicate US-020 issue dedup
+
+## What to build
+
+Two files share the US-020 number with different slugs:
+
+- `docs/issues/20-memory-budget-shard-slots-and-dropout-relocation.md` (ready-for-agent)
+- `docs/issues/20-tracker-node-hardening.md` (done)
+
+Resolve numbering collision without losing history.
+
+## Acceptance criteria
+
+- [ ] Document canonical mapping in this issue's Comments or a short `docs/issues/README.md` note
+- [ ] Renumber or prefix disambiguation (e.g. keep done item as US-020a, renumber memory-budget to next slot) — **human approval before git mv**
+- [ ] Update any prd.json / cross-links that reference US-020 ambiguously
+- [ ] No production code changes
+
+## Blocked by
+
+Human approval for renumbering. An agent may prepare the mapping note, but must not run `git mv` or rewrite cross-links until the canonical number is approved.

.scratch/alpha-hardening/issues/18-doc-operational-runbooks_completed.md

@@ -0,0 +1,27 @@
+Status: done
+
+# 18 — DOC: Operational runbooks (stubs)
+
+## What to build
+
+Add operational runbook stubs for alpha operators under `docs/runbooks/` (or `.scratch/alpha-hardening/runbooks/` until close-feature):
+
+1. **Ledger backup** — billing SQLite, accounts SQLite, registry DB paths; gossip pause procedure
+2. **Treasury key rotation** — devnet mock-USDT mint + treasury keypair rotation without double-credit
+3. **Upgrade path** — tracker rolling restart with persisted strike/reputation (post issue 05)
+
+## Acceptance criteria
+
+- [ ] Three markdown runbook stubs with prerequisites, steps, rollback
+- [ ] Reference ADR-0015 settlement loop and ADR-0016 trust assumptions
+- [ ] Secrets handling: never commit `.env.devnet`, keypairs
+- [ ] No production code changes
+
+## ADR links
+
+- [ADR-0015](../../docs/adr/0015-usdt-custodial-settlement.md)
+- [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md)
+
+## Blocked by
+
+None (stubs can land before issue 05; update after persistence ships)

.scratch/alpha-hardening/issues/19-doc-cryptography-test-env_completed.md

@@ -0,0 +1,31 @@
+Status: done
+
+# 19 — DOC: Cryptography dependency + test environment note
+
+## What to build
+
+Document and verify test/dev environment setup for wallet crypto paths. `packages/node/meshnet_node/wallet.py` uses `cryptography`; failures occur when `.venv` lacks deps. `cryptography>=41` is already declared in `packages/node/pyproject.toml`, so this issue should focus on documenting the editable-install path and only add root/dev extras if tests still import the node wallet without installing the node package.
+
+**Code refs:**
+
+- `packages/node/pyproject.toml` — `cryptography>=41` (verify declared)
+- `packages/node/meshnet_node/wallet.py`
+- Handoff: tests fail without `cryptography`, `openai`, `langchain` in `.venv`
+
+## Acceptance criteria
+
+- [x] Confirm `cryptography>=41` remains in node package deps; add to root/dev extras only if tests import wallet without node install
+- [x] Add short **Test environment** section to `docs/dev/test-env.md` (or `CONTRIBUTING.md` if created): use `.venv/Scripts/python.exe`, `pip install -e packages/node ...`, optional dep skips
+- [x] Note which tests require optional deps (`--ignore=test_openai_gateway,...`)
+- [x] No unrelated production code changes
+
+## Blocked by
+
+None
+
+## Resolution
+
+- `packages/node/pyproject.toml` already declared `cryptography>=41` — no change needed.
+- `conftest.py` adds every `packages/*` dir to `sys.path`, so first-party imports (e.g. `meshnet_node.wallet`) resolve without an editable install of that package — but third-party deps like `cryptography` still must be installed separately. Added `cryptography>=41` to the root `pyproject.toml` `dev` extra so `pip install -e ".[dev]"` alone covers the wallet tests (`test_node_startup.py`, `test_wallet_binding_proof.py`, `test_devnet_treasury.py`, etc.) without requiring a full `packages/node` install (which would otherwise pull in torch/transformers/accelerate/bitsandbytes).
+- Added `docs/dev/test-env.md` with setup instructions (Linux + Windows `.venv\Scripts\python.exe`), and a note on optional-dependency tests: `test_real_model_backend.py` / `test_devnet_treasury.py` use `pytest.importorskip` and skip cleanly; `test_openai_gateway.py` hard-imports `openai`/`langchain_openai` with no skip guard (both already in the `dev` extra) — documented the `--ignore=tests/test_openai_gateway.py` fallback for minimal installs.
+- Full suite: 311 passed, 3 skipped, 3 pre-existing failures unrelated to this issue (`test_billing_ledger.py::test_proxy_chat_splits_payout_by_tracker_assigned_route_span`, `test_forfeiture_penalty.py::test_probation_earns_nothing_then_earning_begins`, `test_mining_cli.py::test_legacy_start_without_port_uses_next_available_port` — port-in-use env artifact). Wallet-specific tests (`test_wallet_binding_proof.py`, `test_node_startup.py`, `test_devnet_treasury.py`): 50 passed, 2 skipped.

.scratch/alpha-hardening/issues/20-validator-service-token_completed.md

@@ -0,0 +1,52 @@
+Status: done
+
+# 20 — Validator service token for `/v1/billing/forfeit`
+
+## What to build
+
+Define and implement a **validator service token** distinct from client API keys and admin sessions. The validator process must authenticate when calling `POST /v1/billing/forfeit`; arbitrary Bearer strings and client API keys must be rejected. This is a checklist subtask for issue 02 and should normally land in the same PR as the unified auth middleware.
+
+Per [ADR-0017 §4](../../docs/adr/0017-tracker-authentication-and-authorization.md): forfeit accepts **validator service identity or admin session** only.
+
+## Configuration
+
+| Item | Alpha default |
+|---|---|
+| Env var | `MESHNET_VALIDATOR_SERVICE_TOKEN` (tracker + validator) |
+| Config flag | `--validator-service-token` / tracker config file equivalent |
+| Header format | `Authorization: Bearer <service-token>` with a dedicated prefix or separate header scheme documented in runbooks (e.g. `Authorization: Service <token>` — pick one and test consistently) |
+| Rotation | Manual: set new token on tracker + validator, restart both; document zero-downtime rotation as post-alpha |
+
+## Rejection rules
+
+- Client API keys (`sk-mesh-…`) → **403** on forfeit (even if valid for inference)
+- Non-empty garbage Bearer → **401/403**
+- Missing auth → **401**
+- Valid validator service token → **200** (existing forfeit semantics)
+- Admin session → **200** (operator override)
+
+## Test-first
+
+1. Red: validator (or test client) posts forfeit with a valid API key — must fail after fix.
+2. Red: `Authorization: Bearer garbage` — must fail (covered by issue 02; this issue defines the accepted token).
+3. Green: configured service token succeeds; wrong token fails.
+
+## Acceptance criteria
+
+- [ ] Service token configurable via env/flag on tracker and validator
+- [ ] Unified auth middleware resolves service token → `validator` role (issue 02)
+- [ ] API keys explicitly rejected on forfeit path
+- [ ] Integration test: validator client with service token forfeit succeeds; API key forfeit fails
+- [ ] Runbook stub: rotation procedure (manual alpha)
+
+## ADR links
+
+- [ADR-0017](../../docs/adr/0017-tracker-authentication-and-authorization.md) §4
+
+## Related
+
+- `02-a2-unified-auth-boundary_completed.md` — middleware + role checks
+
+## Blocked by
+
+- `02-a2-unified-auth-boundary_completed.md`

.scratch/alpha-hardening/issues/21-honest-noise-calibration-corpus.md

@@ -0,0 +1,52 @@
+Status: ready-for-human
+
+**BLOCKS ALPHA RELEASE.** Scoped 2026-07-06 during alpha-launch-readiness grilling session — must complete before real-money (mainnet SOL/USDT) traffic goes live for the friends + hired-VPS-host launch. Loose/uncalibrated thresholds + manual admin slash-reversal are the stopgap only until this closes.
+
+**Engineering complete 2026-07-06; blocked on a human running it against the real hired-VPS fleet before launch.** The three code gaps below are closed and unit-tested (see Deliverables), but nothing in a dev session can stand in for actually dispatching the job at real hardware — that step, plus the threshold/FPR write-up that depends on its output, needs an operator with the live fleet. See the validator README's "Honest-noise calibration corpus" section for the operational how-to.
+
+# 21 — Honest-noise TOPLOC calibration corpus
+
+## What to build
+
+Before enabling production TOPLOC audit thresholds, collect an **honest-noise baseline** across the active fleet. Run identical inference jobs on every active node/GPU combo; measure the divergence envelope (TOPLOC exponent/mantissa deltas, logprob-rank spread) under real hardware variance. This must be driven by the tracker (scheduled/dispatched job), not a manual one-off script, so it can be re-run as the fleet's hardware mix changes.
+
+Per [ADR-0018 consequences](../../docs/adr/0018-fraud-detection-verification-and-reputation.md): threshold calibration requires an honest-noise corpus across the fleet before production thresholds.
+
+Research anchor: `.scratch/alpha-hardening/research-verifiable-inference.md` §8 layer 3 — "collect this first — run identical jobs across the current node fleet to measure the honest divergence envelope before setting thresholds."
+
+**Launch context (why this is buildable now, not a research project):** first-launch nodes are hired VPS/VPC hosts under our own direct control (test infrastructure we pay for, not third-party volunteers) — not a long-term topology, but risk-free for calibration purposes since there's no external party to dispute a bad reading. Friends are client-side users of the API in this phase, not node operators. Run the calibration pass against this small, fully-controlled fleet first; hired hosts stay stake-free until it's done, then move to real staking once thresholds derive from their own hardware.
+
+**Current gap (confirmed 2026-07-06 by code read):** none of the three pieces below exist yet.
+
+1. `verify_activation_proofs()` (`packages/validator/meshnet_validator/audit.py:94-127`) returns a **plain bool** — no raw TOPLOC divergence/distance value is ever computed or surfaced. Every "done" fraud-detection issue (06–10) currently runs on a guessed threshold baked into that bool, not a calibrated one.
+2. Fleet dispatch exists but is the wrong shape: `_handle_benchmark_hop_penalty` / `_handle_benchmark_results` (`packages/tracker/meshnet_tracker/server.py:2998-3104`, from the old US-030 latency work) targets pinned 1–3-node *routes* and measures latency, not TOPLOC divergence across *every* registered node.
+3. Storage is the wrong shape: `record_audit_outcome` (`packages/contracts/meshnet_contracts/__init__.py:416`) persists only `strike_count`/`banned`/`passed` to `registry_events` — no divergence value, no GPU/dtype/hardware-profile column anywhere. Benchmark results otherwise land in a flat JSON file (`server.benchmark_results_path`), not a queryable per-node/hardware schema.
+
+## Deliverables
+
+- [x] Extend the TOPLOC verify call path (`audit.py`) to return the raw distance/divergence metric alongside the existing bool — `verify_activation_proofs_detailed()` / `ToplocVerificationResult` in `packages/validator/meshnet_validator/audit.py`; `verify_activation_proofs()` kept as a thin bool-only wrapper for existing callers. Also fixes a real bug this issue's code-read surfaced: the old code did `bool(_call_toploc(...))`, which is always `True` for the real `toploc` library's non-empty per-chunk `VerificationResult` list regardless of divergence — `tests/test_toploc_audit.py::test_verify_activation_proofs_detailed_aggregates_per_chunk_divergence` exercises this directly.
+- [x] Extend the existing fleet-dispatch pattern (`server.py:2998+`) from pinned-route benchmarking to a tracker-scheduled job that hits **every currently registered node** with a fixed prompt/model/seed — `POST /v1/calibration/toploc/run` (admin/validator-gated, same shape as `POST /v1/benchmark/hop-penalty`) in `packages/tracker/meshnet_tracker/server.py`. Dispatches to every node that can solo-serve the full model range (single-hop pinned route, isolating one node's hardware noise from route-composition effects); partial-shard nodes are reported under `skipped_partial_shard_node_ids`, and nodes that don't answer the on-demand TOPLOC commitment fetch are reported per-node under `"skipped": "..."` rather than counted as pass or fail. See `tests/test_toploc_calibration_dispatch.py`.
+- [x] Add a small SQLite table (same pattern as `billing.py`/`accounts.py`) keyed by node wallet + GPU model + dtype, storing the divergence value per calibration run — `packages/tracker/meshnet_tracker/calibration.py::ToplocCalibrationStore`, `toploc_calibration_runs` table.
+- [x] Aggregation: p99 honest envelope + safety margin computed from that table, written as the recommended tolerance constants — `ToplocCalibrationStore.envelope()`, exposed via `GET /v1/calibration/toploc/results`.
+- [x] Gate checklist: production audit enable blocked until corpus covers ≥N distinct hardware profiles — `ToplocCalibrationStore.gate_status(min_hardware_profiles=N)`; N is `--toploc-calibration-gate-min-hardware-profiles` (default 1) on the tracker CLI, documented alpha exception in the validator README.
+
+## Acceptance criteria
+
+- [ ] Corpus collected from the current hired-VPS fleet (documented as a small-fleet alpha corpus, not the eventual volunteer-fleet corpus) — **not done: needs a human to run `POST /v1/calibration/toploc/run` against the live hired-VPS fleet before launch; no such fleet exists in a dev session.**
+- [ ] Threshold constants in validator config derived from corpus, not guessed — mechanically ready (`envelope()` returns them) but depends on the real corpus above; not yet wired into `ToplocAuditConfig` as enforced thresholds (deliberately — enforcing unvalidated thresholds would be worse than today's guessed bool).
+- [ ] False-positive rate estimate documented at chosen thresholds — `envelope()` returns `estimated_false_positive_rate` (in-sample: fraction of the recorded corpus the recommended thresholds would themselves flag); needs the real corpus to be a meaningful number, and should be written up in the runbook once collected.
+- [x] README / runbook cross-link: **do not enable production audits** until this issue closes — `packages/validator/README.md` "TOPLOC audit contract" section, updated with the full operational how-to.
+- [x] Note in the runbook that this alpha corpus must be re-run once the fleet grows beyond the hired-VPS set (different hardware mix invalidates the envelope) — same README section.
+
+## ADR links
+
+- [ADR-0018](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) — Consequences (honest-noise corpus)
+
+## Blocked by
+
+- `06-fraud-toploc-integration_completed.md` (TOPLOC wired; calibration uses same primitive) — done
+
+## Blocks (prod gate)
+
+- Alpha release to real-money friends+hired-VPS launch (raised from "production adaptive audit thresholds" to a hard alpha-release gate during 2026-07-06 grilling)
+- Production enable of adaptive audit thresholds (issues 09–10 in prod)

.scratch/alpha-hardening/issues/22-doc-memory-project-status_completed.md

@@ -0,0 +1,25 @@
+Status: done
+
+# 22 — DOC: MEMORY.md + project-status alpha-hardening index
+
+## What to build
+
+Update persistent memory files so agents and humans find the alpha-hardening feature without stale handoff paths.
+
+## Acceptance criteria
+
+- [x] `.claude/memory/MEMORY.md` — index entry for alpha-hardening (`.scratch/alpha-hardening/`, ADRs 0016–0019, issue count)
+- [x] `.claude/memory/project-status.md` — brief alpha-hardening section: planning complete, Bucket 1 blockers next, link README
+- [x] Cross-link `.scratch/alpha-hardening/handoff.md` from README (not temp path)
+
+## ADR links
+
+- [ADR-0016](../../docs/adr/0016-alpha-scope-and-known-limitations.md)
+
+## Blocked by
+
+None — completed
+
+## Comments
+
+2026-07-04 triage: already satisfied by `.claude/memory/MEMORY.md`, `.claude/memory/project-status.md`, and `.scratch/alpha-hardening/README.md`.

.scratch/alpha-hardening/issues/23-dynamic-hf-pricing_completed.md

@@ -0,0 +1,53 @@
+Status: done
+
+Scoped 2026-07-06 during alpha-launch-readiness grilling session. High priority, ship-soon for launch — **not** an alpha-release blocker (unlike issue 21): a stale/static price is a revenue/business-model risk, not a safety risk, so the friends + hired-VPS launch may proceed on the current static default while this lands in parallel.
+
+# 23 — Dynamic per-model pricing benchmarked against HuggingFace inference rates
+
+## What to build
+
+Client-facing price per model should track the market: **80% of the cheapest comparable provider rate on HuggingFace's inference marketplace** (`https://huggingface.co/inference/models`), refreshed daily, auto-adjusting so served models stay competitively priced as the market moves. Nodes are unaffected by this loop (per launch design: clients are the only party spending real money; node payouts come from the 90/10 split of whatever price is charged, per ADR-0015/`packages/validator/README.md`).
+
+**Current state (confirmed by code read 2026-07-06):** pricing is 100% static today. `DEFAULT_PRICE_PER_1K_TOKENS = 0.02` (`packages/tracker/meshnet_tracker/billing.py:21`) is the fallback nearly every model hits, since `model_presets.json` currently has no `price_per_1k_tokens` key for any preset. `BillingLedger.set_price(model, price)` (`billing.py:67-69`) is the only write path and already exists — no CLI/admin route calls it yet. No external HTTP/market-data integration exists anywhere in the tracker.
+
+**Data source:** `https://huggingface.co/inference/models` aggregates multiple providers (novita, together, fireworks-ai, deepinfra, etc.) with per-model, per-provider $/1M input and output token pricing; the "cheapest" badge already identifies the lowest-cost provider per model on the page itself. It supports a GET query param for filtering, e.g. `?search=GLM`. **No confirmed public JSON API was found** during this session's fetch — the page reads as a rendered table. Owner's suggestion: try a plain `requests` + BeautifulSoup scrape first; if the pricing table turns out to be client-rendered (not present in the initial HTML), that's the fallback signal to escalate to a headless-browser fetch (e.g. Playwright) — confirm which is needed during implementation before building the full pipeline around it. Another data source is acceptable if more convenient/stable, owner is not wedded to this specific page.
+
+## Deliverables
+
+- [x] Live-fetch attempt (requests + BeautifulSoup against the HF page with `?search=<model-family>`, or an equivalent stable source) as the primary path — confirm during implementation whether the pricing table is present in the raw HTML or requires a headless-browser fetch, and note which in the PR
+- [x] Extend `model_presets.json` per model with: `hf_aliases` (curated list of comparable HF model+provider IDs — **human-verified, not auto-discovered**), `hf_verified_match_note` (free text: params count + quantization confirmation, so a human signs off once per alias that it is a fair comparable before it's used for auto-pricing), `hf_last_price_per_1k` (derived from the $/1M rate), `hf_last_updated` (ISO date)
+- [x] Daily refresh job reusing the tracker's existing daemon-thread pattern (`_settlement_loop`/`_deposit_loop` in `server.py`, `threading.Event().wait(interval)` loop) — for each preset with a non-empty `hf_aliases` list, fetch current pricing for those aliases, compute `0.8 × cheapest matched alias price`, call `set_price()`, and update `hf_last_price_per_1k`/`hf_last_updated`
+- [x] Every price change logged (old price, new price, source alias, timestamp) — needed for dispute auditability if a client questions a charge
+- [x] Fallback behavior: empty/missing `hf_aliases`, fetch failure, or no verified match → silently keep the existing static default price. Never error the pricing path, never zero-price a model
+
+## Acceptance criteria
+
+- [x] At least one model preset has a working end-to-end refresh (alias → live fetch → 80% computed price → `set_price()` called → metadata updated) demonstrated in a test
+- [x] Models without a curated/verified alias continue to use the static default, unaffected by this feature
+- [x] Fetch failures (network error, page structure change, no match found) degrade gracefully — logged, not raised to the request path
+- [x] Price-change log is queryable/inspectable (doesn't need a UI yet — a log line or table row is sufficient for alpha)
+- [x] Note in the runbook/issue on which fetch mechanism (plain HTTP scrape vs. headless browser) was actually required, so the next person doesn't have to rediscover it
+
+## Implementation notes (2026-07-06)
+
+**Fetch mechanism confirmed: plain HTTP scrape, no headless browser needed.** Live-fetched `https://huggingface.co/inference/models?search=GLM` this session — the pricing table is server-rendered into the initial HTML response (SvelteKit SSR), confirmed by grepping the raw response for `cheapest`/`$`-prefixed price cells before any JS runs. A stdlib `urllib.request` GET + `html.parser.HTMLParser`-based table walk is sufficient; no `requests`/`bs4`/Playwright dependency was added, matching this package's existing zero-new-HTTP-dependency convention (`gossip.py`/`raft.py`/`server.py` all use `urllib.request` only). Each row's most stable extraction anchor turned out to be the `<a href="/<org>/<repo>/?inference_api=true&inference_provider=<provider>">` link, not the display text (which duplicates the repo id at two responsive breakpoints and is easy to mis-parse).
+
+**What shipped:** new `packages/tracker/meshnet_tracker/hf_pricing.py` — pure HTML parser (`parse_hf_pricing_table`), alias matching (`cheapest_matching_quote`, supports both `org/repo` and `org/repo::provider` forms so a human can pin a specific provider's deployment), a pure per-preset computation function (`refresh_preset_price`, never raises), and `HfPricingLog` (SQLite-backed change log, same shape as `billing.py`/`calibration.py`). `TrackerServer` gained an opt-in (`enable_hf_pricing=True` / `--enable-hf-pricing`) daily daemon thread (`_hf_pricing_loop`, same `threading.Event().wait(interval)` shape as `_settlement_loop`) and `GET /v1/pricing/hf/history` (admin/validator-gated, mirrors `/v1/calibration/toploc/results`). `model_presets.json`'s `kimi-k2.7` preset now carries the `hf_aliases`/`hf_verified_match_note` schema fields, left as an empty list pending a human sign-off on a genuinely comparable HF listing (params count + quantization) — per this issue's own "human-verified, not auto-discovered" requirement, an agent should not fabricate that sign-off. This also means the shipped default config demonstrates the required "no alias → static price, unaffected" fallback for a real production preset; the alias→live-fetch→80%→set_price() path is demonstrated end-to-end against an injected fetch backend in `tests/test_hf_pricing_dispatch.py` (the `fetch_html=`/`hf_pricing_fetch_html=` injection point mirrors this codebase's `backend=` convention for anything that would otherwise hit the network in tests).
+
+**Bug caught and fixed while wiring this in:** `TrackerServer` previously did `dict(DEFAULT_MODEL_PRESETS)` when no explicit `model_presets` was passed — a shallow copy that aliases every preset's inner dict to the shared module-level global. Writing `hf_last_price_per_1k`/`hf_last_updated` in place would have leaked across every other `TrackerServer` instance in the same process (real risk in the test suite, and in any future multi-tracker-in-one-process embedding). Fixed with a `_clone_model_presets()` helper that also shallow-copies each preset dict.
+
+**Follow-up for a human (not a completion blocker):** populate real `hf_aliases`/`hf_verified_match_note` entries for production presets once someone has confirmed a genuinely comparable HF-listed deployment (params + quantization) — that activates dynamic pricing for that model on the next refresh tick. Until then every preset safely stays on its static price.
+
+Tests: `tests/test_hf_pricing.py` (11 tests: parsing, blended-price math, alias matching incl. provider-scoped aliases, all three fallback paths, log persistence) + `tests/test_hf_pricing_dispatch.py` (5 tests: full TrackerServer end-to-end refresh, unaffected-without-alias, history auth gating, history content, history model filter). Full suite (`pytest tests/ -q -k "not integration"`): 346 passed, 2 skipped.
+
+## ADR links
+
+- [ADR-0015](../../docs/adr/0015-usdt-custodial-settlement.md) — settlement/pricing this touches (90/10 split, per-model pricing)
+
+## Blocked by
+
+None — independent of the alpha-hardening trust-boundary work; touches `billing.py`/`server.py` pricing paths only.
+
+## Blocks
+
+None — ship-soon for launch quality, not a release gate (see status note above).

.scratch/alpha-hardening/issues/24-routing-telemetry-resume.md

@@ -0,0 +1,92 @@
+Status: ready-for-agent
+
+Scoped 2026-07-07 from an interrupted Claude session. This is a resume/cleanup task for routing and live-progress work that is partly committed and partly left dirty in the working tree.
+
+# 24 - Finish learned-routing telemetry and live-progress cleanup
+
+## Current state
+
+The main dynamic routing feature is already committed at `518c259` (`routing improvements - dynamic (wip)`):
+
+- `packages/tracker/meshnet_tracker/routing_stats.py` - decayed-EWMA route stats store, epsilon-greedy route selection, diagnostics.
+- `packages/tracker/meshnet_tracker/server.py` - route enumeration per head, bandit selection in the chat proxy, epoch bumps on node join/leave, `/v1/routing`, route sample recording with 8-token hygiene.
+- `packages/tracker/meshnet_tracker/cli.py` - `--route-explore-share`, `--route-weight-alpha`, `--route-stats-half-life` and env vars.
+- `packages/tracker/meshnet_tracker/dashboard.html` - "Routing (learned)" panel.
+- `docs/adr/0021-dynamic-statistical-routing.md` - design record.
+- `tests/test_dynamic_routing.py` - includes the exact GPU(0-21)+CPU(0-39) topology, hybrid downstream `start_layer=22`, 0.6/0.4 traffic split for a 1.5 TPS ratio, and scout-rate behavior.
+
+The current working tree still has uncommitted follow-up work:
+
+- `packages/node/meshnet_node/torch_server.py` - tracks in-flight chat requests, exposes `TorchNodeServer.current_requests`, prints generation progress with TPS.
+- `packages/node/meshnet_node/startup.py` - sends `current_requests` in heartbeat payloads and increases heartbeat cadence while busy.
+- `packages/tracker/meshnet_tracker/server.py` - accepts heartbeat `current_requests`, includes them in `/v1/network/map`, and logs `proxy connecting` before upstream connection.
+- `packages/tracker/meshnet_tracker/dashboard.html` - enriches the call wall from heartbeat `current_requests` so active requests remain visible even before terminal proxy events.
+- `tests/test_real_model_backend.py` and `tests/test_tracker_routing.py` - targeted coverage for current-request snapshots, heartbeat sanitization/storage, and TPS progress logging.
+- `QUICKSTART.md` - documents optional linear-attention fast-path packages for Qwen3.5/3.6 GPU nodes.
+
+There is also an untracked local file, `.claude/settings.local.json`, which should not be included unless the owner explicitly wants local Claude settings committed.
+
+## Known blocker found during resume
+
+Targeted pytest currently fails during import before reaching the new tests:
+
+```text
+TypeError: unsupported operand type(s) for |: 'builtin_function_or_method' and 'NoneType'
+```
+
+Immediate cause: `packages/tracker/meshnet_tracker/server.py:1490` annotates `ws_lock: threading.Lock | None = None`. `threading.Lock` is a factory function at runtime, not a type, so `| None` evaluates eagerly and crashes. This exists on `HEAD` too, not just in the dirty telemetry changes.
+
+Fix options:
+
+- Add `from __future__ import annotations` at the top of `server.py`, then run enough tests to catch any annotation side effects.
+- Or change that annotation to a safe runtime type such as `Any | None` / remove the union annotation. Keep the change minimal.
+
+## What to do next
+
+1. Fix the import-time `threading.Lock | None` crash.
+2. Re-run the targeted tests:
+
+   ```bash
+   .\.venv\Scripts\python.exe -m pytest tests/test_tracker_routing.py::test_tracker_heartbeat_stores_current_requests tests/test_tracker_routing.py::test_normalize_current_requests_sanitizes_payload tests/test_real_model_backend.py::test_current_requests_snapshot_while_generating tests/test_real_model_backend.py::test_distributed_generating_log_includes_tps -q
+   ```
+
+3. Run the relevant routing regression tests:
+
+   ```bash
+   .\.venv\Scripts\python.exe -m pytest tests/test_dynamic_routing.py tests/test_tracker_routing.py -q
+   ```
+
+4. If practical, run the non-integration suite:
+
+   ```bash
+   .\.venv\Scripts\python.exe -m pytest tests/ -q -m "not integration"
+   ```
+
+5. Confirm or document the pre-existing failure from the interrupted session: `test_proxy_chat_splits_payout_by_tracker_assigned_route_span` reportedly failed on `HEAD` too and was unrelated.
+6. Commit the intentional work in two commits if it remains naturally split:
+   - learned routing is already committed in `518c259`; leave it alone unless fixing regressions there.
+   - commit the live-progress/current-request telemetry cleanup separately after tests pass.
+
+## Acceptance criteria
+
+- [ ] Importing `meshnet_tracker.server` no longer crashes on the lock annotation.
+- [ ] Current-request heartbeat payloads are sanitized and surfaced in `/v1/network/map`.
+- [ ] Node-side in-flight chat snapshots report request id, model, token count, elapsed seconds, tokens/sec, and routing completion.
+- [ ] Dashboard call wall can show active requests from heartbeat data, not only tracker console terminal events.
+- [ ] Targeted telemetry tests pass.
+- [ ] Dynamic routing tests still pass, including GPU(0-21)+CPU(0-39) hybrid-route enumeration and traffic split behavior.
+- [ ] Full or non-integration suite result is recorded; unrelated pre-existing failures are named explicitly.
+- [ ] `.claude/settings.local.json` remains uncommitted unless intentionally approved.
+
+## ADR links
+
+- [ADR-0020](../../docs/adr/0020-chat-streaming-live-progress-and-mixed-topology-routing.md)
+- [ADR-0021](../../docs/adr/0021-dynamic-statistical-routing.md)
+
+## Blocked by
+
+None. The import-time annotation crash is the first fix.
+
+## Blocks
+
+Clean handoff/commit of the interrupted live routing progress work.

.scratch/alpha-hardening/issues/25-per-node-kv-cache-distributed.md

@@ -0,0 +1,58 @@
+Status: implemented 2026-07-08 — pending live 2-node GPU verification
+
+Implemented in `packages/node/meshnet_node/model_backend.py` + `torch_server.py`; design in
+[ADR-0022](../../../docs/adr/0022-sharded-per-node-kv-cache.md); tests in
+`tests/test_kv_cache_distributed.py` (11 fast tests + env-gated golden test,
+`MESHNET_REAL_MODEL_TESTS=1`).
+
+**Measured (two-shard Qwen2.5-0.5B 0-11/12-23, CPU, 44-token prompt, 40 steps):**
+stateless 7.05 tps decaying 32% (8.09 → 5.50 first-10 vs last-10); cached 18.93 tps and
+FLAT (17.21 → 19.28) — 2.68× overall, gap grows quadratically with length. Remaining
+acceptance item: re-measure on the live 2-node GPU topology (needs both machines).
+
+Scoped 2026-07-08 from a live two-machine distributed-inference debugging session (Qwen2.5-0.5B GPU+GPU pipeline, and Qwen3.6-35B-A3B mixed GPU/CPU). The ADR-0020 mixed-topology `start_layer` bug is fixed (`518c259`, `e44abc9`, `1ecc599`); this issue is the next performance blocker in the same code path.
+
+# 25 — Sharded per-node KV cache for distributed generation (MoE/hybrid-attention aware)
+
+## What to build
+
+The distributed generation loop (`torch_server.py:515-612`, `_do_chat_completions` distributed path) currently has **no KV cache at all**: `model_backend.py` passes `use_cache: False` in every layer-forward call (lines 763, 768, 770-771), and each autoregressive step re-encodes the *entire* prompt-so-far from scratch (`backend.encode_prompt(current_text)`), re-running every layer on every node in the route for every generated token.
+
+Observed cost of this on a live 2-node Qwen2.5-0.5B GPU pipeline (layers 0-20 / 21-23): tps decayed from 22.3 (at 235 output tokens) to 12.6 (at 449 tokens) within a single generation — the expected quadratic-cost signature. On the Qwen3.6-35B-A3B mixed-topology case this collapses to ~0.07 tps even after the routing fix, partly for this reason.
+
+`X-Meshnet-Session` already exists on the wire (`torch_server.py:707`, minted fresh **per token**, not per generation) but today only labels one activation transfer for chunk reassembly/logging — it is not used to key any cached state.
+
+| Subtask | Owner package | Deliverable |
+|---|---|---|
+| Session lifecycle | `packages/node/meshnet_node/torch_server.py` | Mint session ID once per chat request (not per token); reuse across all steps of that generation; add `X-Meshnet-Seq-Len` / position header so a node can tell prefill from decode steps |
+| Per-node sharded cache | `packages/node/meshnet_node/model_backend.py` | `TorchModelShard` holds a `session_id → cache_state` map scoped to *its own* layer range only (naturally sharded — no node stores another node's KV); `forward_bytes` takes `use_cache=True` and returns/reuses `past_key_values` (or `use_cache=False` for the prefill token to keep failure/eviction simple) |
+| Prefill vs. decode split | `packages/node/meshnet_node/torch_server.py` | Step 0 sends the full prompt activation (current behavior); steps 1+ send only the newest token's hidden state (`[1, 1, hidden]`) with correct `position_ids`, cutting per-step payload from O(seq_len) to O(1) |
+| MoE / hybrid-attention state | `packages/node/meshnet_node/model_backend.py` | Cache abstraction must hold "whatever `use_cache=True` returns for this layer range," not assume standard K/V tensors — Qwen3.6's linear-attention/hybrid layers (see `[transformers] The fast path is not available...` warning already logged at startup) cache **recurrent conv/delta state**, not K/V pairs. MoE expert routing itself is layer-local and needs no cross-token cache, but confirm no expert-choice state leaks across the stateless-vs-cached boundary when `use_cache` toggles between prefill and decode |
+| Cache lifecycle | `packages/node/meshnet_node/torch_server.py` | TTL + LRU eviction per node (bounded by `max_loaded_shards`/memory budget); explicit "cache miss" response so a restarted/evicted node causes the head to fall back to a full re-prefill instead of a hard error — keep today's fully-stateless path as the recovery mode |
+| Correctness parity | `tests/` | Golden-output test: distributed multi-token output with caching enabled must match the existing stateless path token-for-token (or within sampling tolerance) for a fixed prompt/seed |
+
+**Non-goals for first landing:** cross-node cache migration/rebalancing on route change (evict + re-prefill is acceptable initially); speculative decoding; batching multiple concurrent sessions' KV within one node beyond what eviction already requires.
+
+**Code refs:**
+
+- `packages/node/meshnet_node/torch_server.py:515-612` — distributed generation loop (`current_text = current_text + token_str`, full re-encode every step)
+- `packages/node/meshnet_node/torch_server.py:690-789` — `_run_downstream_pipeline`, session minting, `X-Meshnet-Session`/`X-Meshnet-Hop-Index`/`X-Meshnet-Start-Layer` headers
+- `packages/node/meshnet_node/model_backend.py:189-201, 330-351, 763-771` — `use_cache: False` call sites, `effective_start` layer-slicing logic that any cache keying must respect
+- `docs/adr/0020-chat-streaming-live-progress-and-mixed-topology-routing.md` — prerequisite routing fix this issue builds on
+- `docs/adr/0021-dynamic-statistical-routing.md` — route selection this cache must stay compatible with (a route change mid-generation should trigger cache-miss fallback, not corruption)
+
+## Acceptance criteria
+
+- [x] A session ID is stable across all steps of one chat generation (not re-minted per token) — minted once in `_do_chat_completions`, asserted in `test_session_is_stable_and_decode_payloads_are_single_token`
+- [x] Steps after the first prefill send only the new token's activation (`[1, 1, hidden]` via `encode_next_token`) with `X-Meshnet-Cache: decode` + `X-Meshnet-Past-Len`
+- [x] Each node caches state only for its own shard's layer range (`TorchModelShard.kv_sessions`; sharding falls out of per-node layer execution)
+- [x] Cache abstraction is not K/V-shaped-only: `DynamicCache(config=model.config)` — the same construction Qwen3.6-Next's own forward uses for hybrid linear-attention conv/delta state; store treats it as opaque; `TypeError` fallback disables caching per-backend
+- [x] Bounded memory: TTL (600 s, `MESHNET_KV_TTL_SECONDS`) + LRU (8, `MESHNET_KV_MAX_SESSIONS`); miss → HTTP 409 `{"error": "cache_miss"}` → head re-prefills (tested)
+- [x] Golden-output test: cached and stateless produce identical token ids on real two-shard Qwen2.5-0.5B (`test_cached_distributed_generation_matches_stateless_golden`, passed)
+- [x] Measured (CPU two-shard proxy, 40 steps): stateless 7.05 tps w/ 32% decay → cached 18.93 tps flat, 2.68×. ⚠️ still to run on the live 2-node GPU topology
+- [x] `tests/test_two_node_pipeline.py` and `tests/test_dynamic_routing.py` pass (30 passed; 6 tmp-dir fixture errors are a pre-existing Windows temp-permission env issue, identical on clean tree)
+- [x] Design captured in [ADR-0022](../../../docs/adr/0022-sharded-per-node-kv-cache.md) incl. cache-miss/route-change interaction with ADR-0021
+
+## Notes
+
+MoE routing (router + expert FFN) is layer-local per token and does not itself need a cross-token cache — it was ruled out as the cause of the earlier Qwen3.6 garbage-output bug (that was the ADR-0020 `start_layer` double-execution). The MoE angle that *does* matter here is architecture-awareness in the cache design: don't hardcode a K/V tensor shape assumption that breaks on Qwen3.6's hybrid attention layers.

.scratch/alpha-hardening/research-verifiable-inference.md

@@ -0,0 +1,281 @@
+# Verifiable Inference & Fraud Layer — Research Findings
+
+**Date:** 2026-07-04
+**Scope:** Ground the neuron-tai fraud/verification layer in 2026 state-of-the-art and in what comparable decentralized compute networks actually do.
+**Alpha context assumed throughout:** volunteer consumer GPUs (8 GB class, e.g. RTX 4060), pipeline-parallel multi-hop inference where different nodes hold different layer ranges, a single trusted tracker (coordinator), devnet mock-USDT payments but reputation that carries forward, and an owner-approved verification budget of roughly 5% redundant recomputation.
+
+---
+
+## Executive summary
+
+1. **The proven, deployed pattern for exactly our setting is: optimistic acceptance + random teacher-forced re-verification + slashing/reputation penalties.** This is what Prime Intellect runs in production for INTELLECT-2 (TOPLOC validators, random sampling, slash-and-evict) and what Hyperbolic formalized game-theoretically (Proof of Sampling). At a 5% audit rate the math works if the penalty for a caught cheat exceeds ~19× the per-job gain — which carried-forward reputation plus forfeited pending balance easily provides.
+2. **Teacher-forced logit/activation re-verification is a recognized, robust technique** — it is the core of TOPLOC (ICML 2025), Token-DiFR (2025), and log-probability auditing papers. It sidesteps autoregressive divergence entirely and is up to ~100× cheaper than the original generation because verification prefill is compute-bound while generation is memory-bound.
+3. **Bitwise output equality is unattainable across heterogeneous volunteer GPUs**; honest nodes on different hardware/batch conditions produce different tokens even at temperature 0. All robust schemes compare in *logit/activation space with tolerances* (TOPLOC exponent/mantissa thresholds, DiFR divergence scores) or force bitwise reproducibility with special kernels (Gensyn RepOps) at a performance cost.
+4. **zkML and GPU TEEs are roadmap-only.** zkML in 2025–2026 proves GPT-2-scale models in tens of seconds per inference (100–10,000× overhead); nothing near serving speed for multi-billion-parameter models. GPU confidential computing exists only on H100/Blackwell-class datacenter hardware paired with server CPUs (SEV-SNP/TDX) — categorically unavailable on consumer volunteer cards.
+5. **Layer-skipping is NOT reliably detectable by output quality.** Careful pruning of ~25% of layers keeps ~90% of benchmark scores (ShortGPT); models degrade gracefully until a sharp collapse around 20–55% removal depending on family. But any layer skipping changes hidden states and logits drastically, so per-position activation/logit comparison catches it essentially always (TOPLOC reports 100% detection of model modifications in its evals). Verify in logit space, not by eyeballing text quality.
+6. **Classic PoW is Sybil/hardware admission control, not correctness proof** — io.net's hourly PoW is the cautionary tale (it verifies a GPU exists and has claimed VRAM, nothing about job correctness). Self-computed activation checksums are *binding commitments*, not correctness proofs: a cheater simply commits to its wrong values. Commitments earn their keep only when a referee later recomputes and compares — i.e., for audit pinning and dispute bisection.
+
+---
+
+## 1. Technique-by-technique review
+
+### 1.1 Optimistic verification + spot-checking (probabilistic deterrence)
+
+**Mechanism.** Accept results by default; re-run a random, unpredictable subset with an independent replica; punish divergences. Hyperbolic's Proof of Sampling (PoSP) paper proves a pure-strategy Nash equilibrium in which rational nodes are honest, and claims the spot-check approach adds well under 1% overhead when everyone is rational ([PoSP, arXiv:2405.00295](https://arxiv.org/html/2405.00295); [Hyperbolic spML breakdown](https://www.hyperbolic.ai/blog/spml-breakdown)). VeriLLM adds VRF-selected audit indices over Merkle-committed hidden states so verifiers can't be lazy or predictable ([VeriLLM, arXiv:2509.24257](https://arxiv.org/html/2509.24257v3)). Prime Intellect's production deployment: validators randomly sample committed batches, and "since the Inference Provider does not know which generations will be checked, they are incentivized to be honest on all generations" ([INTELLECT-2, arXiv:2505.07291](https://arxiv.org/html/2505.07291)).
+
+**Sampling math.** With independent audit probability *p* per job:
+
+- A node that cheats on every job survives *N* jobs undetected with probability (1−p)^N. At p = 0.05: ~36% survive 20 jobs, ~4.6% survive 60 jobs, ~0.6% survive 100 jobs. Detection is near-certain over any meaningful volume.
+- A node that cheats on a fraction *f* of jobs is caught per job with probability *p·f*; expected jobs until caught = 1/(p·f). At p = 0.05, f = 0.2: caught within ~100 jobs on average. Low-rate cheating stretches time-to-detection linearly — this is why the penalty must scale with accumulated stake/reputation, not per-incident.
+- **Deterrence condition (rational node):** cheating gains *g* per job and loses *L* when caught, so expected value of cheating is (1−p)·g − p·L. Honesty dominates iff **L > g·(1−p)/p ≈ 19·g at p = 0.05**. If a caught node forfeits its pending balance and a reputation that gates future routing (i.e., discounted future earnings), L is orders of magnitude above 19× a single job's margin. This is exactly the structure PoSP formalizes and the existing neuron-tai forfeiture design (pending-balance forfeiture + strikes + ban) already implements.
+
+**The verifier-incentive caveat.** Truebit identified the classic failure mode: if the system works and nobody cheats, verifiers never earn anything and stop checking; Truebit's answer was "forced errors" with jackpot payouts, and it estimated the verification tax at 500–5000% of task cost to keep independent verifiers attentive ([Truebit whitepaper §2, §4](http://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf)). **This whole problem disappears in a single-tracker alpha**: the tracker audits as a protocol function paid from the protocol cut, not as a profit-seeking third party. It becomes relevant again only when verification is decentralized.
+
+**Feasibility for alpha: HIGH.** This is the anchor technique. 5% audit budget is in the same range as deployed systems (OTR proposes ρ ≈ 1% spot-checks as sufficient deterrent in a TEE-hybrid design — [arXiv:2512.20176](https://doi.org/10.48550/arxiv.2512.20176)); 5% gives comfortable margin for a young network with thin reputational stakes.
+
+### 1.2 Interactive verification / refereed delegation (Truebit-style bisection)
+
+**Mechanism.** Solver commits Merkle roots of intermediate execution states. On dispute, challenger and solver binary-search over the committed states to the first step where they diverge; a referee (smart contract or trusted party) recomputes only that single step and rules. One honest challenger suffices; the game costs O(log n) rounds ([Truebit whitepaper](http://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf); [Truebit explainer, Medium](https://medium.com/truebit/truebit-the-marketplace-for-verifiable-computation-f51d1726798f)).
+
+**ML adaptation.** Gensyn's Verde adapts this to neural networks with a two-phase bisection: first narrow to the training/inference *step*, then to the single *operator* in the computational graph; the referee recomputes one operator, needing ~two orders of magnitude less compute than the full job. Crucially, Verde only works because RepOps makes execution **bitwise reproducible across heterogeneous hardware** by fixing floating-point operation order — otherwise honest nodes diverge and bisection finds spurious "fraud" ([Verde paper, arXiv:2502.19405](https://arxiv.org/html/2502.19405v1); [Gensyn Verde blog](https://blog.gensyn.ai/verde-a-verification-system-for-machine-learning-over-untrusted-nodes/)).
+
+**Mapping to our multi-hop pipeline.** Our pipeline is naturally pre-bisected: each hop's boundary activations are the "intermediate states." A workable scheme:
+
+1. Each node commits a compact fingerprint (TOPLOC-style top-k encoding, not a raw hash — see §2) of its input and output boundary activations per request.
+2. When an end-to-end audit fails, the referee (tracker) teacher-forces the full claimed token sequence through a reference model and computes reference boundary activations at each hop cut-point in one forward pass.
+3. The first hop whose committed output fingerprint diverges from the reference (beyond tolerance) while its input fingerprint matched is the culprit. No interactive game is needed at hop granularity because the number of hops is small — the referee can check all cut-points in a single replay.
+4. Bisection *within* a hop (to a layer or operator, Verde-style) is only needed if you must prove fault to a third party at fine granularity; for internal blame assignment, hop granularity is enough since payment and reputation are per node.
+
+The main adaptation cost is the referee needing enough VRAM to run the full model (or to re-run hop layer-ranges one at a time, which any 8 GB card can do for its own range).
+
+**Feasibility for alpha: MEDIUM-HIGH** in the simplified "referee replays and compares committed hop boundaries" form (no on-chain game, tracker as referee). The full trustless interactive game with bitwise-reproducible kernels is roadmap.
+
+### 1.3 zkML (zero-knowledge proofs of inference)
+
+**2025–2026 state.** The frontier moved fast but remains far from LLM serving speed:
+
+- EZKL (ONNX→Halo2) is the most-used toolkit; generic overhead is characterized as 100–10,000× native execution, and much real usage is verifiable data science rather than LLMs ([Equilibrium Labs survey](https://equilibrium.co/writing/state-of-verifiable-inference)).
+- zkGPT (USENIX Security 2025) proves a GPT-2 inference in **under 25 seconds** on a CPU server — 185× faster than the prior ZKML system ([zkGPT](https://www.usenix.org/conference/usenixsecurity25/presentation/qu-zkgpt)).
+- NanoZK (2026) proves GPT-2-scale transformer blocks in ~43 s with 6.9 KB proofs via layerwise decomposition, 52–228× faster than EZKL ([NanoZK, arXiv:2603.18046](https://arxiv.org/html/2603.18046v1)).
+- For a 7B model, one estimate puts pure-zkML verification at **over 20 minutes per inference** ([Optimistic TEE-Rollups, arXiv:2512.20176](https://doi.org/10.48550/arxiv.2512.20176)).
+- Project reality check: Modulus Labs (authored the field-defining benchmark ["The Cost of Intelligence"](https://eprint.iacr.org/2026/1063), demonstrated proving of a multi-billion-parameter LLM as a feat, not a service) was acquired by Tools for Humanity in 2024 and now does World ID cryptography ([announcement](https://world.org/blog/announcements/modulus-labs-joins-tfh-support-applied-research-world)). Giza uses ZK proofs for *small, simple* DeFi-agent models on Starknet ([Equilibrium survey](https://equilibrium.co/writing/state-of-verifiable-inference)). EZKL itself has drifted toward verifiable data science and co-SNARKs.
+
+**Honest read:** proving is ~GPT-2 scale (~1.5B params max in tens of seconds), on beefy servers, per short inference. For a volunteer network serving multi-billion-parameter models interactively, zkML is 3+ orders of magnitude away, and proof generation would crush an 8 GB consumer card regardless.
+
+**Feasibility for alpha: NONE (roadmap-only).**
+
+### 1.4 TEE / confidential computing on GPUs
+
+**What it gives.** NVIDIA H100 is the first GPU with a hardware TEE anchored in an on-die root of trust: measured/secure boot, SPDM session with a driver inside a CPU confidential VM, and a signed **attestation report** covering GPU firmware/state that a remote party verifies against NVIDIA's attestation service before releasing work ([NVIDIA blog](https://developer.nvidia.com/blog/confidential-computing-on-h100-gpus-for-secure-and-trustworthy-ai/); [CACM: Creating the First Confidential GPUs](https://cacm.acm.org/practice/creating-the-first-confidential-gpus/)). Combined with CPU TEE attestation (AMD SEV-SNP or Intel TDX measuring the VM image), you get a verifiable claim that *a specific measured software stack loaded a specific model and ran on genuine hardware*, with only ~2–6% overhead (Blackwell figures, [GPUYard setup guide](https://www.gpuyard.com/tutorials/howto/nvidia-blackwell-confidential-computing-setup/)) or ~5–10% generally ([Equilibrium survey](https://equilibrium.co/writing/state-of-verifiable-inference)). Phala runs exactly this to sell "verifiable LLMs" through OpenRouter ([Phala blog](https://phala.com/posts/GPU-TEEs-is-Alive-on-OpenRouter)).
+
+**Caveats.** Attestation proves the *environment*, not the mathematics — you trust NVIDIA/AMD/Intel hardware and are exposed to side channels and firmware bugs (the OTR paper layers ZK spot-checks on top of TEEs precisely because of compromised-TEE risk). And critically for us: CC mode requires Hopper/Blackwell datacenter GPUs plus server platforms with SEV-SNP/TDX enabled in BIOS and the open kernel modules ([NVIDIA deployment guide](https://docs.nvidia.com/cc-deployment-guide-tdx-snp.pdf)). **No RTX consumer card supports it.** Volunteer nodes on 4060-class hardware categorically cannot provide GPU TEE attestation; Intel SGX on client CPUs is likewise not a path (deprecated on consumer parts, and it would only cover CPU-side code anyway).
+
+**Feasibility for alpha: NONE for volunteer nodes.** Roadmap option: a *TEE tier* — if datacenter H100/Blackwell operators ever join, attest them and route confidentiality-sensitive or high-value jobs there; also usable for the tracker's own reference validator.
+
+---
+
+## 2. The non-determinism problem for output comparison
+
+### 2.1 Why honest nodes disagree
+
+- **Floating-point non-associativity** is the root cause, but the *mechanism* that surfaces it is batch-variant kernels: inference servers pick different kernels/split strategies depending on batch size and load, changing reduction order and hence results — the same request returns different logits depending on what else is in the batch ([Thinking Machines: Defeating Nondeterminism in LLM Inference](https://thinkingmachines.ai/blog/defeating-nondeterminism-in-llm-inference/)).
+- **Even greedy (temperature-0) decoding diverges across configurations**: changing batch size, GPU count, GPU architecture, or tensor-parallel size measurably changes outputs under greedy decoding, and small numerical differences get **amplified autoregressively** — one flipped token early in a long generation cascades into a completely different continuation ([arXiv:2506.09501](https://arxiv.org/html/2506.09501v2); [arXiv:2511.17826](https://arxiv.org/html/2511.17826v2)).
+- Temperature > 0 sampling adds outright randomness on top unless seeds and the sampling algorithm (e.g. Gumbel-max in vLLM) are synchronized.
+
+**Consequence:** naive "re-run the prompt, compare the text" audits will flag honest heterogeneous nodes as cheaters. Never compare free-running generations token-for-token across different hardware.
+
+### 2.2 Techniques that make honest-vs-honest comparison robust
+
+1. **Teacher-forced re-verification (per-position logit/activation check) — yes, this is a recognized, state-of-the-art technique.**
+   - **TOPLOC** (Prime Intellect, ICML 2025): the prover commits top-k values/indices of the last hidden state per decode chunk (258 bytes per 32 tokens, ~1000× smaller than raw activations); the validator *re-runs the claimed token sequence as a single prefill* (teacher forcing) and checks the committed top-k against recomputed values using exponent/mantissa error thresholds. Reported: 100% detection of model, prompt, or precision substitutions with zero false positives across different GPUs, tensor-parallel layouts, and attention implementations, and validation up to **100× faster than the original inference** because prefill is compute-bound while decode is memory-bound ([TOPLOC, arXiv:2501.16007](https://arxiv.org/html/2501.16007v1); [GitHub](https://github.com/PrimeIntellect-ai/toploc)).
+   - **Token-DiFR / Activation-DiFR** (2025): synchronize the sampling seed (Gumbel-max), then compare the provider's tokens against a reference re-generation — with a shared seed, >98% of tokens match exactly for honest providers, so token divergence itself becomes the audit signal; detects 4-bit quantization with AUC > 0.999 within 300 tokens. Activation-DiFR compresses activations with random orthogonal projections and detects the same with 2 tokens. Released as a vLLM integration ([DiFR, arXiv:2511.20621](https://arxiv.org/pdf/2511.20621); [author explainer](https://technicallyprivate.substack.com/p/token-difr-llm-inference-verification)).
+   - **Log-probability auditing**: comparing per-token logprob distributions against a reference model detects even single-step fine-tuning or quantization changes; simple statistical tests (permutation test on per-token mean logprobs, KS tests) overcome logprob noise ([Logprob Tracking, arXiv:2512.03816](https://arxiv.org/html/2512.03816v1); [model-substitution audit, arXiv:2504.04715](https://arxiv.org/html/2504.04715v1)).
+2. **Tolerance-based matching, not bitwise equality.** TOPLOC accepts bounded exponent-intersection and mantissa-error deviations; DiFR scores divergence-from-reference against an honest-noise baseline. Both are explicitly designed so cross-GPU numerical noise passes while quantization/model swaps fail.
+3. **Beware scalar aggregate thresholds alone.** The DiFR authors note that a single statistic like mean cross-entropy can be gamed — a malicious provider can tune its sampling temperature until the aggregate matches expectation. Seed-synchronized token matching or per-position top-k activation checks leave far fewer degrees of freedom ([DiFR explainer](https://technicallyprivate.substack.com/p/token-difr-llm-inference-verification)).
+4. **Bitwise-deterministic kernels** (Gensyn RepOps; Thinking Machines' batch-invariant kernels; TBIK for cross-tensor-parallel invariance) make exact comparison possible but require replacing the whole operator stack and sacrifice performance — practical for a controlled verification environment, unrealistic to impose on volunteer nodes running stock llama.cpp/transformers ([Gensyn](https://blog.gensyn.ai/verde-a-verification-system-for-machine-learning-over-untrusted-nodes/); [Thinking Machines](https://thinkingmachines.ai/blog/defeating-nondeterminism-in-llm-inference/); [arXiv:2511.17826](https://arxiv.org/html/2511.17826v2)).
+
+**Practical recipe for our audits:** record prompt, claimed output tokens, sampling params, and per-hop activation fingerprints. Audit = one teacher-forced forward pass of the claimed tokens on a reference node; compare per-position: (a) hop-boundary fingerprints TOPLOC-style, and/or (b) whether each claimed token is plausible under the reference distribution (rank/logprob within tolerance; exact match if seeds are synchronized). This is cheap (single prefill), robust to hardware noise, and immune to autoregressive divergence because the token sequence is fixed.
+
+---
+
+## 3. Layer-skipping detectability
+
+**How gracefully do transformers degrade when layers are dropped?**
+
+- **Careful pruning degrades subtly.** ShortGPT removes ~25% of layers (chosen by Block Influence, training-free) and keeps ~90% of benchmark performance — e.g. LLaMA2-13B MMLU drops only 55.0→52.2 after removing 10 of 40 layers ([ShortGPT, arXiv:2403.03853](https://arxiv.org/pdf/2403.03853)). Gromov et al. find a "characteristic flat region of robust performance" on QA benchmarks followed by a **sharp collapse to random accuracy** at a model-dependent threshold: ~45–55% of layers for Llama-2 family, ~35% for Mistral-7B, ~25% for Phi-2, ~20% for Qwen — and up to ~half of Llama-2-70B's layers with healing finetuning ([The Unreasonable Ineffectiveness of the Deeper Layers, arXiv:2403.17887](https://arxiv.org/html/2403.17887v1)). LayerDrop showed a decade of precedent: networks *trained* with layer dropout can be pruned at inference with modest loss ([arXiv:1909.11556](https://arxiv.org/abs/1909.11556)).
+- **So: would skipping ~36 of 100 layers produce gibberish?** Probably not gibberish. For a Llama-like model, 36% removal of *well-chosen* layers sits below the collapse threshold — output would be degraded but often fluent, and on easy prompts might look acceptable. A lazy cheater skipping a contiguous middle block *without* choosing layers carefully does worse — Gromov et al. show the naive heuristic's loss "begins to increase very rapidly even with small amounts of pruning" before healing — but "worse" still means plausible-looking text on many prompts, not obvious garbage. **Human-eyeball or coarse quality checks are not a reliable fraud detector.**
+- **Statistical detection: yes, and easily.** Without healing, C4 validation loss rises sharply with pruning fraction (Gromov et al. Fig. 3), so perplexity of the node's outputs under a reference model shifts detectably given enough tokens. But the far stronger signal is direct: skipping any layer changes the hidden states and output logits at *every* position by amounts vastly exceeding floating-point noise. TOPLOC's evaluation explicitly includes detecting modified models with 100% accuracy; DiFR detects even 4-bit quantization (a much subtler perturbation than deleting layers) with AUC > 0.999 in ≤300 tokens. **A single teacher-forced audit pass catches layer-skipping essentially deterministically.**
+- **Pipeline nuance:** in multi-hop inference, a node that skips layers inside its assigned range corrupts its output boundary activations; the hop-boundary fingerprint comparison in §1.2 localizes exactly which node did it.
+
+---
+
+## 4. Why classic PoW does not solve verifiable useful computation
+
+- **PoW's defining property is verification asymmetry over an *arbitrary* puzzle**: work is hard to produce, trivially cheap to check (hash preimage with leading zeros), and the puzzle content is irrelevant — it exists purely to price Sybil identities and block production ([Wikipedia: Proof of work](https://en.wikipedia.org/wiki/Proof_of_work)). Useful computation generally lacks this asymmetry: checking an ML result naively requires re-executing it, which is the whole problem. This is the central, repeatedly confirmed obstacle in the Proof-of-Useful-Work literature — "the main weakness that all presented PoUW approaches have in common is the verification of results" ([Challenges of PoUW, arXiv:2209.03865](https://doi.org/10.48550/arxiv.2209.03865); [SoK: Is Proof-of-Useful-Work Really Useful?, IACR 2025/1814](https://eprint.iacr.org/2025/1814.pdf)). Expensive verification then triggers the **verifier's dilemma**: rational verifiers skip checking, and security collapses ([Truebit whitepaper §1](http://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf)).
+- **Live case study:** io.net's hourly "Proof-of-Work" makes GPUs solve hash puzzles and proves *the hardware exists, has the claimed VRAM, and is online* ([io.net PoW docs](https://io.net/docs/guides/workers/proof-of-work)). It was bolted on after the April 2024 Sybil attack (~1.8M fake GPUs spoofed via a shared auth token to farm airdrops) and says nothing about whether any customer job was computed correctly ([io.net 2026 analysis](https://cryptoaianalysis.com/io-net-io-analysis-2026/)). PoW = admission control and capacity attestation; correctness needs a separate mechanism.
+- **Self-computed checksums/commitments: confirmed — no standalone correctness guarantee.** A hash or Merkle commitment over activations is *binding* (the node can't later change its story) and possibly *hiding*, but the committed values are whatever the node computed — a malicious node honestly commits to its dishonest activations, and the checksum verifies perfectly. Correctness only enters when an independent party recomputes and compares against the commitment. That is precisely how the serious systems use commitments: Truebit's Merkle state roots and Verde's checkpoint hashes exist to make **dispute bisection** possible and to **pin claims before an unpredictable audit** (so a node can't retroactively fix its answer once it learns it's being checked), never as proof by themselves ([Truebit](http://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf); [Verde, arXiv:2502.19405](https://arxiv.org/html/2502.19405v1); TOPLOC commitments are verified by validator recomputation — [arXiv:2501.16007](https://arxiv.org/html/2501.16007v1)).
+
+---
+
+## 5. What comparable networks actually do
+
+| Network | Verification of outputs | Sybil / fraud handling | Notes |
+|---|---|---|---|
+| **Prime Intellect** | TOPLOC activation commitments per sequence; validators teacher-force-recompute (sampled, up to 100× faster than generation); plus sampling-sanity and data-sanity checks | Invalid batches → node **slashed and evicted** from compute pool; hardware checks at registration | Deployed at scale for INTELLECT-2 (32B RL run over permissionless nodes) ([arXiv:2505.07291](https://arxiv.org/html/2505.07291)) |
+| **Gensyn** | Verde refereed delegation: bisect disputes to a single operator; referee recomputes it; requires RepOps bitwise-reproducible kernels | Correct result guaranteed if ≥1 of the assigned providers is honest; economic penalties on losers of disputes | The most rigorous trustless design; reproducibility stack is the price ([Verde](https://arxiv.org/html/2502.19405v1); [docs](https://docs.gensyn.ai/core-components)) |
+| **Bittensor** | No direct output verification: subnet **validators score miners**; Yuma Consensus aggregates stake-weighted scores into emissions | Registration costs + stake; the notorious **weight-copying** problem (validators free-riding by copying consensus weights) countered by Commit-Reveal v3: timelock-encrypted weights revealed epochs later so copiers only get stale data ([weight copying](https://docs.learnbittensor.org/concepts/weight-copying-in-bittensor); [commit-reveal](https://docs.learnbittensor.org/concepts/commit-reveal)) | Verification quality is per-subnet and heuristic; consensus rewards conformity, not proven correctness |
+| **io.net** | None for job outputs | Hourly hash-puzzle PoW + VRAM check + Proof of Time-Lock (uptime), added after the Apr 2024 fake-GPU Sybil attack; failed checks → excluded from rewards/hiring ([PoW docs](https://io.net/docs/guides/workers/proof-of-work); [Messari overview](https://messari.io/report/understanding-io-net-a-comprehensive-overview)) | Marketplace model: hardware attestation only, correctness left to the customer |
+| **Ritual (Infernet)** | Modular: nodes may attach ZK, optimistic, or TEE proofs; consumer contracts opt in ([Ritual blog](https://ritual.net/blog/celestia)) | ChainLight's security review: base Infernet has **no aggregation of multiple nodes, no reputation, no penalty for malicious nodes returning wrong results** ([ChainLight](https://blog.chainlight.io/ecosystem-explorer-exploring-security-risks-in-ai-blockchain-projects-2c490a726d13)) | "Verification-optional" in practice |
+| **Hyperbolic** | PoSP/spML: random spot-check by a second node; disagreement → arbitration; slashing of the dishonest party ([PoSP, arXiv:2405.00295](https://arxiv.org/html/2405.00295)) | Nash-equilibrium argument that rational nodes stay honest; validator anonymity until finalization to resist collusion | Closest published formalization of our intended scheme |
+| **Akash** | None (general compute marketplace) | **Auditor-attested provider tiers**: governance-approved auditors post on-chain attestations; no provider staking/slashing — ChainLight flags malicious-provider risk as an accepted gap ([ChainLight](https://blog.chainlight.io/ecosystem-explorer-exploring-security-risks-in-ai-blockchain-projects-2c490a726d13); [Akash docs](https://akash.network/docs/providers/getting-started/should-i-run-a-provider/)) | Reputation = audit badge + market history |
+| **Petals** (closest architectural cousin: volunteer, pipeline-parallel, consumer GPUs) | **None** — the paper and docs openly state malicious peers can alter outputs; mitigation is "use a private swarm of people you trust"; devs planned a centralized points system for nodes that "consistently return correct results" ([GitHub](http://github.com/bigscience-workshop/petals); [dev comments on HN](https://news.ycombinator.com/item?id=34215665)) | Proof that the architecture works, and that the fraud layer is the missing piece we're building |
+| **Together AI** | Centralized provider; no public trustless verification protocol — trust is contractual/reputational | n/a | Included for contrast: the "trusted provider" baseline |
+| **Atoma / Ambient** (emerging) | Atoma: TEE where available, else user-configurable redundant sampling; Ambient: "Proof of Logits" fingerprinting with ~0.1% claimed overhead but no open implementation ([Equilibrium survey](https://equilibrium.co/writing/state-of-verifiable-inference)) | — | Signal of where the field is converging: logit fingerprints + sampling |
+
+**Pattern:** nobody in production uses zkML for LLM serving; nobody offers TEE on consumer GPUs; every serious inference-verification deployment converges on *commit → sampled teacher-forced recompute → slash/reputation*, with refereed delegation as the trustless escalation path.
+
+---
+
+## 6. Reputation systems for routing and audit-rate weighting
+
+**Foundations.** EigenTrust computes global trust as the principal eigenvector of normalized local trust ratings and remains the canonical design; in simulation it suppresses malicious collectives up to large fractions of the network, but it depends on pre-trusted peers and majority-honest aggregation ([EigenTrust, WWW'03](https://nlp.stanford.edu/pubs/eigentrust.pdf)).
+
+**Documented pitfalls** (from EigenTrust's own threat models and the P2P reputation-attack literature — [survey](https://cnitarot.github.io/papers/p2p-reputation-survey.pdf)):
+
+- **Sybil flooding / whitewashing:** free identities let attackers dominate the "unknown newcomer" pool and shed bad reputations by rejoining. Defense: entry cost (stake, invite, proof-of-hardware), newcomer probation with low routing weight and *elevated* audit rates.
+- **Reputation farming / milking:** behave honestly on cheap jobs to build score, then cash in on expensive ones ("moles" that interleave honest work are documented in real systems like Maze). Defense: value-weighted reputation (a job's reputation contribution ∝ its audited value), and audit probability that never floors at zero for anyone.
+- **Collusion rings:** peers mutually inflating ratings. Defense: in our alpha, reputation should derive **only from tracker-verified audit outcomes**, never from peer ratings — this deletes the collusion surface EigenTrust suffers from. (EigenTrust++ hardens propagation with feedback-similarity for when peer ratings do get introduced — [EigenTrust++](https://doi.org/10.4108/icst.collaboratecom.2012.250420).)
+- **Weight-copying (Bittensor's lesson):** any published evaluation signal will be free-ridden by lazy evaluators; the fix is delaying/encrypting evaluations (commit-reveal timelock) until they're stale ([Bittensor docs](https://docs.learnbittensor.org/concepts/weight-copying-in-bittensor)). Relevant to us only when third-party validators exist; a single tracker has no one to copy from.
+
+**Reputation-weighted routing + audit rates in practice.** io.net gates hiring and block rewards on rolling verification status; Akash routes via audit-tier filters; Bittensor routes emissions via consensus-weighted scores. The clean design for us, consistent with PoSP-style deterrence:
+
+- **Routing weight** increases with reputation (and observed TPS, already tracked), so honest nodes earn more — making L (loss-on-catch, §1.1) grow with tenure.
+- **Audit rate** decreases with reputation but has a hard floor (e.g. new node 20–30% → veteran 2–3%, floor ≥ 2%), keeping the overall budget ≈ 5% while making cheating-as-a-newcomer maximally risky and reputation-then-defect still irrational.
+- **Asymmetric dynamics:** slow to build, instant to lose (existing 3-strike forfeiture design already matches this), plus decay on inactivity so parked identities can't hoard trust.
+- **Unpredictability is load-bearing:** audit selection must be indistinguishable from normal traffic at request time (same request format, decided by tracker RNG/VRF after commitment), or nodes cheat only on non-audited requests — the exact property both PoSP and INTELLECT-2 rely on.
+
+---
+
+## 7. Feasibility table for the neuron-tai alpha
+
+Alpha constraints: volunteer 8 GB consumer GPUs, single trusted tracker, mock-USDT but real carried-forward reputation, ~5% audit budget, small models today (0.5B-class) scaling up.
+
+| Technique | Alpha feasibility | Overhead | What it buys | Verdict |
+|---|---|---|---|---|
+| Optimistic accept + random teacher-forced audit (~5%) | **High** — tracker (or a trusted validator node) re-runs claimed tokens as one prefill | ~5% of serving compute; audits themselves up to ~100× cheaper than original generation | Detects wrong model, quantization, layer-skipping, garbage outputs; rational-cheating deterrence at L > 19× per-job gain | **Do now (anchor)** |
+| Per-hop activation fingerprints (TOPLOC-style top-k, tolerance matching) | **High** — few hundred bytes per response per hop; nodes already stream activations | Negligible at inference; storage ~258 B/32 tokens/hop | Pins claims before audit; localizes blame to the exact hop on audit failure | **Do now** |
+| Hop-boundary replay "bisection" (referee = tracker, non-interactive) | **Medium-high** — needs a reference node able to run the full model or per-hop ranges | Only on audit failure / dispute | Culprit identification in multi-hop pipelines; fair slashing | **Do now (simplified form)** |
+| Seed-synchronized sampling (Token-DiFR-style exact-token audits) | **Medium** — requires controlling the sampler (Gumbel-max w/ shared seed) in node runtime | Zero at serve time | Strongest per-token evidence; >98% exact match for honest nodes | **Do if node runtime is ours; else logprob-rank tolerance** |
+| Statistical logprob/perplexity monitoring (passive, on all traffic) | **High** — reference-free heuristics (output perplexity, repetition, truncation) + periodic logprob tests | Tiny | Cheap tripwire that raises a node's audit rate when outputs look off | **Do now (cheap complement)** |
+| Reputation-weighted routing + reputation-weighted audit rate with floor | **High** — extends existing tracker reputation/strikes | None | Makes deterrence math work; concentrates audits on new/suspect nodes | **Do now** |
+| Full interactive verification game (Truebit/Verde) with bitwise RepOps kernels | Low — requires replacing node operator stacks, decentralized referees | High engineering; runtime penalty for reproducible kernels | Trustless dispute resolution without a trusted tracker | **Roadmap (multi-tracker era)** |
+| zkML proofs of inference | None — GPT-2-scale, tens of seconds per proof, server-class hardware ([zkGPT](https://www.usenix.org/conference/usenixsecurity25/presentation/qu-zkgpt); [NanoZK](https://arxiv.org/html/2603.18046v1)) | 100–10,000× | Cryptographic soundness | **Roadmap-only; re-evaluate yearly** |
+| GPU TEE attestation | None on consumer cards (H100/Blackwell + SEV-SNP/TDX servers only — [NVIDIA guide](https://docs.nvidia.com/cc-deployment-guide-tdx-snp.pdf)) | ~2–10% where available | Hardware-rooted "right model+code ran" | **Roadmap: optional attested tier for datacenter contributors** |
+| PoW-style hardware challenges (io.net-like) | Medium — trivial to add | Idle-time only | Sybil/VRAM/capacity attestation at registration; NOT output correctness | **Optional, registration-time only; don't confuse with fraud layer** |
+
+---
+
+## 8. Recommended layered scheme for alpha
+
+1. **Commit layer (on-demand, audit-selected):** when a request is selected for audit, each hop signs and reports a TOPLOC-style top-k fingerprint of its output boundary activations plus the sampling metadata (params, seed if controlled). Client-visible response carries the full claimed token sequence. Commitments are cheap and make retroactive lying impossible — they are *audit pins, not proofs* (§4).[^alpha-on-demand]
+
+[^alpha-on-demand]: Alpha implements **on-demand** commitments per [ADR-0018 §3](../../docs/adr/0018-fraud-detection-verification-and-reputation.md) — not every request. Nodes retain recent activations briefly; serving path stays uncommitted until audit selection.
+2. **Audit layer (~5% of requests, VRF/tracker-RNG selected, indistinguishable ex ante):** a reference executor teacher-forces the claimed tokens in one prefill and checks (a) per-position token plausibility under the reference distribution (exact match if seed-synced; logprob-rank tolerance otherwise) and (b) hop-boundary fingerprints within TOPLOC-style exponent/mantissa tolerances. New/low-reputation nodes get 20–30% audit rates, veterans 2–3%, floor ≥ 2%, budget-balanced to ≈5% overall.
+3. **Blame layer (on audit failure):** replay comparison across hop cut-points identifies the first divergent hop; that node eats the penalty (forfeit pending balance + strike, per the existing forfeiture design), and its audit rate snaps to maximum. Honest-noise false positives are handled by tolerance calibration against an honest-node baseline corpus (collect this first — run identical jobs across the current node fleet to measure the honest divergence envelope before setting thresholds).
+4. **Reputation layer:** reputation derives exclusively from audit outcomes + uptime/latency, never peer ratings (no collusion surface). It weights routing (earnings) and inversely weights audit probability. Slow build, instant loss, decay on inactivity, entry probation for Sybil/whitewash resistance.
+5. **Tripwire layer (all traffic, passive):** perplexity/repetition/truncation anomaly scoring on outputs; anomalies don't punish directly, they escalate the node's audit rate.
+
+This is, deliberately, the Prime Intellect / Hyperbolic pattern adapted to multi-hop pipelines with the tracker as referee — every component has a deployed or peer-reviewed precedent.
+
+## 9. Explicitly NOT feasible for alpha (roadmap-only)
+
+- **zkML proofs of LLM inference** — 3+ orders of magnitude too slow for multi-billion-parameter serving; provers won't run on 8 GB cards. Revisit if layerwise/GKR provers (NanoZK, zkGPT lineage) reach real-time on 7B+ models.
+- **GPU TEE / confidential-computing attestation on volunteer nodes** — hardware doesn't exist on consumer GPUs. Keep as an *attested datacenter tier* concept.
+- **Fully trustless interactive verification games** (Truebit/Verde with on-chain referees and bitwise-reproducible kernels) — pointless while a single trusted tracker exists; becomes the correct escalation path when trackers decentralize. Requires shipping a reproducible-operator runtime to nodes.
+- **Decentralized third-party verifier markets** (and their incentive pathologies: verifier's dilemma, forced-error jackpots, Truebit's 500–5000% verification tax) — single-tracker alpha sidesteps all of it; re-enters with multi-tracker.
+- **Peer-rating reputation (EigenTrust-style transitive trust)** — collusion/Sybil surface with no benefit while the tracker is the sole verifier.
+- **Commit-reveal timelock machinery for evaluator honesty** (Bittensor CRV3) — solves weight-copying among many validators; irrelevant until independent validators exist.
+- **PoW puzzles as a correctness mechanism** — category error (§4); acceptable only as optional registration-time hardware attestation.
+
+---
+
+## Sources
+
+**Papers / peer-reviewed:**
+- Truebit: [A scalable verification solution for blockchains](http://people.cs.uchicago.edu/~teutsch/papers/truebit.pdf) (Teutsch & Reitwießner)
+- Gensyn Verde: [arXiv:2502.19405](https://arxiv.org/html/2502.19405v1); [Gensyn blog](https://blog.gensyn.ai/verde-a-verification-system-for-machine-learning-over-untrusted-nodes/); [Gensyn docs](https://docs.gensyn.ai/core-components)
+- TOPLOC: [arXiv:2501.16007](https://arxiv.org/html/2501.16007v1) (ICML 2025); [GitHub](https://github.com/PrimeIntellect-ai/toploc)
+- INTELLECT-2: [arXiv:2505.07291](https://arxiv.org/html/2505.07291)
+- Proof of Sampling (Hyperbolic): [arXiv:2405.00295](https://arxiv.org/html/2405.00295); [spML blog](https://www.hyperbolic.ai/blog/spml-breakdown)
+- DiFR (Token/Activation): [arXiv:2511.20621](https://arxiv.org/pdf/2511.20621); [explainer](https://technicallyprivate.substack.com/p/token-difr-llm-inference-verification)
+- Logprob tracking: [arXiv:2512.03816](https://arxiv.org/html/2512.03816v1); Model-substitution auditing: [arXiv:2504.04715](https://arxiv.org/html/2504.04715v1)
+- VeriLLM: [arXiv:2509.24257](https://arxiv.org/html/2509.24257v3); Optimistic TEE-Rollups: [arXiv:2512.20176](https://doi.org/10.48550/arxiv.2512.20176)
+- zkGPT: [USENIX Security 2025](https://www.usenix.org/conference/usenixsecurity25/presentation/qu-zkgpt); NanoZK: [arXiv:2603.18046](https://arxiv.org/html/2603.18046v1); Modulus "Cost of Intelligence": [IACR 2026/1063](https://eprint.iacr.org/2026/1063)
+- Nondeterminism: [Thinking Machines blog](https://thinkingmachines.ai/blog/defeating-nondeterminism-in-llm-inference/); [arXiv:2506.09501](https://arxiv.org/html/2506.09501v2); [arXiv:2511.17826](https://arxiv.org/html/2511.17826v2); [arXiv:2511.00025](https://arxiv.org/html/2511.00025v1)
+- Layer pruning: [arXiv:2403.17887](https://arxiv.org/html/2403.17887v1) (Gromov et al., ICLR 2025); [ShortGPT, arXiv:2403.03853](https://arxiv.org/pdf/2403.03853) (ACL 2025); LayerDrop: [arXiv:1909.11556](https://arxiv.org/abs/1909.11556)
+- PoUW: [SoK, IACR 2025/1814](https://eprint.iacr.org/2025/1814.pdf); [arXiv:2209.03865](https://doi.org/10.48550/arxiv.2209.03865); [Wikipedia: Proof of work](https://en.wikipedia.org/wiki/Proof_of_work)
+- EigenTrust: [WWW'03](https://nlp.stanford.edu/pubs/eigentrust.pdf); [EigenTrust++](https://doi.org/10.4108/icst.collaboratecom.2012.250420); [P2P reputation attack survey](https://cnitarot.github.io/papers/p2p-reputation-survey.pdf)
+- Petals: [GitHub](http://github.com/bigscience-workshop/petals); [petals.dev](https://petals.dev/); [dev statements on incentives/correctness, HN](https://news.ycombinator.com/item?id=34215665)
+
+**Official docs / engineering blogs:**
+- NVIDIA CC: [H100 CC blog](https://developer.nvidia.com/blog/confidential-computing-on-h100-gpus-for-secure-and-trustworthy-ai/); [deployment guide (TDX/SNP)](https://docs.nvidia.com/cc-deployment-guide-tdx-snp.pdf); [CACM article](https://cacm.acm.org/practice/creating-the-first-confidential-gpus/); [Phala GPU-TEE on OpenRouter](https://phala.com/posts/GPU-TEEs-is-Alive-on-OpenRouter)
+- Bittensor: [weight copying](https://docs.learnbittensor.org/concepts/weight-copying-in-bittensor); [commit reveal](https://docs.learnbittensor.org/concepts/commit-reveal); [OTF blog](https://blog.bittensor.com/weight-copying-in-bittensor-422585ab8fa5)
+- io.net: [PoW docs](https://io.net/docs/guides/workers/proof-of-work); [Messari overview](https://messari.io/report/understanding-io-net-a-comprehensive-overview); [2026 risk analysis incl. Sybil attack history](https://cryptoaianalysis.com/io-net-io-analysis-2026/)
+- Ritual: [ritual.net blog](https://ritual.net/blog/celestia); [ChainLight security review of AI-chain projects (Ritual, Akash)](https://blog.chainlight.io/ecosystem-explorer-exploring-security-risks-in-ai-blockchain-projects-2c490a726d13)
+- Akash: [provider docs](https://akash.network/docs/providers/getting-started/should-i-run-a-provider/)
+- Landscape survey: [Equilibrium Labs — State of Verifiable Inference](https://equilibrium.co/writing/state-of-verifiable-inference)
+- Modulus Labs acquisition: [world.org announcement](https://world.org/blog/announcements/modulus-labs-joins-tfh-support-applied-research-world)
+
+---
+
+## Open-source reusability & build-vs-adopt
+
+**Added 2026-07-04.** Focused follow-up: which of the projects above ship code we can actually reuse, and is verified decentralized inference a "solved problem"? All repo facts below checked against the GitHub repos/APIs on 2026-07-04.
+
+### TOPLOC (Prime Intellect) — a real, adoptable library
+
+- **Repo & license:** [PrimeIntellect-ai/toploc](https://github.com/PrimeIntellect-ai/toploc), **MIT** (both the repo license and the `pyproject.toml` declaration). Published on PyPI as `pip install toploc`. Separate [toploc-experiments](https://github.com/PrimeIntellect-ai/toploc-experiments) repo holds the paper's vLLM-integrated experiment code.
+- **Maintenance:** actively maintained — created 2025-01-28, last push **2026-07-02** (two days before this writing), 56 stars / 12 forks / 12 open issues. Small single-purpose codebase (Python + a compiled extension; ships wheels, depends only on `torch`/`numpy`).
+- **What it actually is:** a *library*, not a framework. Two function families ([README](https://github.com/PrimeIntellect-ai/toploc)):
+  - `build_proofs_bytes/base64(activations, decode_batching_size, topk, skip_prefill)` — prover side: takes a list of activation tensors (prefill tensor + one last-hidden-state tensor per generated token, bf16 in the examples) and returns compact proofs (~10 bytes each; 258 bytes per 32 tokens per the paper).
+  - `verify_proofs_bytes/base64(recomputed_activations, proofs, ...)` — verifier side: returns per-chunk `VerificationResult(exp_intersections, mant_err_mean, mant_err_median)`; **the accept/reject thresholds are ours to set and calibrate** (the paper gives reference thresholds validated across GPU types).
+- **Assumptions:** model- and runtime-agnostic — it operates on tensors you extract yourself. It does *not* hook into vLLM/transformers for you; capturing the last hidden state per decode step in the node runtime, and recomputing activations via teacher-forced prefill on the validator, is our integration work. Detects precision changes by design, so **we must pin one canonical precision/quantization per served model** or honest quantized volunteers will fail verification.
+- **Integration estimate for our pipeline-parallel case:** modest. (1) Node runtime: capture final-hidden-state per token, call `build_proofs_*`, attach to response — days, not weeks. (2) Tracker/validator: teacher-forced prefill re-run + `verify_proofs_*` — days. (3) The genuinely new part is *per-hop* commitments: TOPLOC as published commits only the **final** hidden state (whole-pipeline check, catches that fraud happened); applying the same encoding to hop-boundary activations for per-node blame is our own straightforward extension since the functions are tensor-generic, but its thresholds across heterogeneous 8 GB cards must be calibrated by us — that empirical honest-noise calibration is the real work. (4) Threshold calibration corpus across the volunteer fleet — the long pole, but required for any tolerance-based scheme regardless of library.
+
+### Gensyn — papers and proprietary binaries, not a reusable verification library
+
+What is actually public in [github.com/gensyn-ai](https://github.com/gensyn-ai) (org listing checked 2026-07-04):
+
+- **[rl-swarm](https://github.com/gensyn-ai/rl-swarm)** — MIT, 1.7k stars: a framework for *RL training swarms*, plus [rl-swarm-contracts](https://github.com/gensyn-ai/rl-swarm-contracts) (coordination contracts). Not inference verification; not relevant to our fraud layer.
+- **Verde (dispute resolution): paper only.** No `verde` repository exists in the org. The bisection/arbitration protocol from [arXiv:2502.19405](https://arxiv.org/html/2502.19405v1) has no published implementation. If we want it, we implement it from the paper.
+- **RepOps / reproducible execution: shipping, but proprietary.** [repops-demo](https://github.com/gensyn-ai/repops-demo) is demo scripts with **no OSS license file** (only a `LICENSE-LLAMA` for the model weights) driving a prebuilt Docker image; supported targets include consumer RTX 3090/4070/4090 (CC 7.5–9, CUDA 12.6+). The successor [ree](https://github.com/gensyn-ai/ree) (Reproducible Execution Environment) is explicit in its README: the SDK wrapper is MIT, but **"the REE compiler binary and the REE reproducible-operators binary … are not licensed under the MIT License"** — they fall under a proprietary REE Binary License. REE does reproducible *LLM inference* with run/verify receipts, pipeline parallelism up to 72B (v0.2.0 notes), and needs Docker + NVIDIA driver ≥570. So bitwise cross-GPU determinism is real and demonstrably achievable on consumer GPUs — but as a closed-source appliance, not an embeddable library.
+- **"Judge"** (verifiable AI evaluator, [docs](https://docs.gensyn.ai/core-components)) — no public library repo found in the org.
+- **Assessment of the RepOps requirement:** deterministic cross-GPU execution means reimplementing/fixing the reduction order of every operator (matmul, attention, norms) for every hardware target — a compiler/kernel-engineering effort Gensyn keeps proprietary, and Thinking Machines' open batch-invariant kernels ([blog](https://thinkingmachines.ai/blog/defeating-nondeterminism-in-llm-inference/)) only address batch-invariance on one platform, not cross-GPU bitwise equality. **This is a large lift with no off-the-shelf OSS solution; it is exactly what TOPLOC-style tolerance matching lets us avoid.** Adopting REE would mean forcing volunteers into Gensyn's Docker appliance (proprietary binaries, driver floor, perf overhead) — a non-starter for our alpha; a possible future option for the *validator/referee* environment only.
+
+### Bittensor — an incentive market, not verification code (confirmed)
+
+- **Confirmed from primary sources:** the [whitepaper](https://bittensor.com/whitepaper) frames Bittensor as peers ranking peers ("intelligence measured by intelligence"), and the [Yuma Consensus docs](https://docs.learnbittensor.org/yuma-consensus) describe the on-chain mechanism precisely: each subnet validator submits a **weight vector ranking miners**; YC resolves the stake-weighted matrix into emissions, **clipping** any weight above the level supported by κ (default 0.5) of stake to punish out-of-consensus/collusive over-evaluation, and paying validators via EMA **bonds** that reward staying near consensus. There is **no cryptographic verification of any computation anywhere in the mechanism** — correctness of miner outputs is whatever each subnet's own validator code decides to score. The chain ([opentensor/subtensor](https://github.com/opentensor/subtensor), Rust, The Unlicense, actively developed) implements the consensus/emissions math, not inference checking.
+- **What subnets actually do:** subnet owners write off-chain validator logic (Python, typically on the MIT-licensed [bittensor SDK](https://github.com/opentensor/bittensor)) that queries miners with tasks and scores responses — reference-model comparison, heuristics, or LLM-judging, entirely subnet-specific. Quality of validation is therefore uneven by construction.
+- **Known weaknesses & mitigations (documented by Bittensor itself):** validator **weight-copying** (free-riding on the public weight matrix) — mitigated by Commit-Reveal v3 timelock-encrypted weights revealed epochs later ([weight copying](https://docs.learnbittensor.org/concepts/weight-copying-in-bittensor); [commit reveal](https://docs.learnbittensor.org/concepts/commit-reveal)); lazy/colluding validators — mitigated only economically via clipping and bond penalties; and the docs concede commit-reveal fails if miner rankings are too static.
+- **Reusable for us:** the *design patterns* — stake-weighted score aggregation with clipping, EMA-smoothed trust, commit-reveal for future multi-validator honesty — not code. Subtensor's Rust consensus math is chain-embedded and solves a multi-validator problem we don't have while the single tracker is the only scorer.
+
+### Other OSS in this niche
+
+- **EZKL** ([zkonduit/ezkl](https://github.com/zkonduit/ezkl)) — **real, mature library** (Rust with Python/JS bindings, **Apache-2.0** per its [npm package](https://registry.npmjs.org/ezkl) and README, ~1.2k stars, last push 2026-02). It proves ONNX-graph inference in ZK and genuinely works — for *small* models (MLPs, small CNNs/regressors; §1.3 overheads apply). Irrelevant to serving multi-billion-parameter LLMs, but adoptable later if we ever need to prove a tiny model (e.g., a routing/scoring model) on-chain.
+- **Petals** ([bigscience-workshop/petals](https://github.com/bigscience-workshop/petals)) — MIT, 10.3k stars, but **effectively dormant (last push Sep 2024)** and contains **zero trust machinery**: its own docs say malicious peers can alter outputs and recommend private swarms (§5). Its `hivemind` DHT/networking stack (MIT, also mirrored by Gensyn) is reusable *infrastructure*, not verification. Petals is validation of our architecture and a warning, not a component.
+- **Hyperbolic PoSP/spML** — **paper + marketing only**. The [HyperbolicLabs GitHub org](https://github.com/HyperbolicLabs) contains agent kits, MCP servers, and a k8s OS — no PoSP/spML implementation is published. Adapt the pattern from [arXiv:2405.00295](https://arxiv.org/html/2405.00295); there is nothing to adopt.
+- **Ritual Infernet** — the node ([ritual-net/infernet-node](https://github.com/ritual-net/infernet-node), Python, BSD-3-Clause-Clear per its community port; direct repo access was flaky at check time) plus [infernet-deploy](https://github.com/ritual-net/infernet-deploy)/[infernet-sdk](https://github.com/ritual-net/infernet-sdk) are open **coordination/oracle plumbing** (request routing, container orchestration, on-chain delivery). Proofs are a pluggable slot, not shipped verification logic, and ChainLight's review found no output aggregation, reputation, or penalties in the base system (§5). Nothing here advances our fraud layer.
+- **DiFR** — the Token/Activation-DiFR authors state they released an **open-source vLLM integration** ([arXiv:2511.20621](https://arxiv.org/pdf/2511.20621)); worth tracking as a second adoptable audit primitive alongside TOPLOC, especially the seed-synchronized exact-token variant.
+
+### Bottom line: is it solved?
+
+**The audit primitive is solved and adoptable; the system around it is not.** No OSS project ships an end-to-end "verified decentralized inference network in a box" — every network either built theirs in-house (Prime Intellect), kept the hard part proprietary (Gensyn REE binaries), or doesn't verify at all (Petals, Akash, base Infernet, Bittensor's chain). What *is* genuinely reusable is small, high-quality, and MIT-licensed: TOPLOC. Everything else we need is a pattern to adapt or thin logic to build on our tracker, which is appropriately bespoke (it's our economics).
+
+| Capability | Verdict | Component / reference | Rationale |
+|---|---|---|---|
+| **Detection / audit** (teacher-forced re-verification) | **ADOPT** | [`toploc`](https://github.com/PrimeIntellect-ai/toploc) (MIT, PyPI, maintained) — track [DiFR's vLLM integration](https://arxiv.org/pdf/2511.20621) as a complement | Proven encoding + verifier with cross-GPU tolerance semantics; our work is runtime hooks + threshold calibration, not algorithm development |
+| **Blame attribution / bisection** (per-hop) | **ADAPT + BUILD** | Verde's commit-then-recompute pattern ([arXiv:2502.19405](https://arxiv.org/html/2502.19405v1)); reuse TOPLOC's encoding on hop-boundary activations | No published Verde code; full bisection is overkill for a handful of hops — a single referee replay over committed hop boundaries suffices (§1.2) |
+| **Reputation / incentive** | **ADAPT + BUILD** | PoSP deterrence math ([arXiv:2405.00295](https://arxiv.org/html/2405.00295)); Yuma patterns (clipping, EMA trust, [commit-reveal](https://docs.learnbittensor.org/concepts/commit-reveal)) for the future multi-validator era; EigenTrust pitfalls list (§6) | No code to adopt (PoSP unpublished; Yuma is chain-embedded Rust for a different topology); our tracker-side logic is small and economics-specific |
+| **Cryptographic proof** (zkML / TEE / bitwise-reproducible execution) | **NEITHER (roadmap)** | EZKL (Apache-2.0) if a tiny provable model ever needs it; Gensyn REE as a proprietary-appliance option for a future referee tier; GPU TEE per §1.4 | All three are unusable on 8 GB volunteer cards today (§1.3–1.4); REE's reproducible operators are closed-source binaries |
+
+**Direct answer to the owner:** Gensyn and Bittensor are the right things to read but the wrong things to build on — Gensyn's verification core is a paper plus proprietary binaries aimed at training-grade trustlessness we don't need under a single trusted tracker, and Bittensor ships an incentive market that deliberately contains no computation verification at all. The one shelf-ready piece for our exact audit step is TOPLOC (MIT, pip-installable, updated this week), and the recommended alpha scheme in §8 remains: adopt TOPLOC for the audit primitive, adapt PoSP/Verde patterns for deterrence and blame, and build the thin tracker-side reputation/audit-rate logic ourselves.

.scratch/alpha-hardening/runbooks/01-ledger-backup.md

@@ -0,0 +1,88 @@
+Status: stub
+
+# Runbook: Ledger backup
+
+Covers backing up the tracker's authoritative money/trust state — the billing
+ledger, dashboard accounts DB, and node registry (strike/ban/reputation) — and
+how to pause hive gossip during the backup window so peers don't replicate
+against a half-copied file.
+
+## Trust assumptions (read first)
+
+Per [ADR-0016](../../../docs/adr/0016-alpha-scope-and-known-limitations.md), one
+operator-designated tracker holds the treasury keypair and is the source of
+truth for settlement; other hive members only replicate. Back up **that**
+tracker's databases — a follower's copies are eventually consistent, not
+authoritative. See [ADR-0015](../../../docs/adr/0015-usdt-custodial-settlement.md)
+for the settlement loop these tables feed.
+
+## Prerequisites
+
+- Shell access to the settlement-capable tracker host.
+- `sqlite3` CLI (or `.backup` support in the Python `sqlite3` module) available
+  for online, consistent snapshots.
+- Know the tracker's configured DB paths — defaults, unless overridden by CLI
+  flags:
+  - Billing ledger: `billing.sqlite` (`--billing-db`, `DEFAULT_BILLING_DB_PATH`
+    in `packages/tracker/meshnet_tracker/billing.py`)
+  - Dashboard accounts: `accounts.sqlite` (`--accounts-db`,
+    `DEFAULT_ACCOUNTS_DB_PATH` in `packages/tracker/meshnet_tracker/accounts.py`)
+  - Node registry (strike/ban/reputation event log,
+    `packages/contracts/meshnet_contracts/__init__.py::RegistryEventLog`): path
+    is whatever was passed as `registry_db` when the tracker's
+    `LocalSolanaContracts` was constructed. **As of this writing the tracker
+    CLI (`meshnet_tracker/cli.py`) does not expose a `--registry-db` flag or
+    wire a `contracts=` instance into `TrackerServer` by default** — confirm
+    with whoever deployed this tracker whether registry persistence is
+    actually enabled before assuming a file exists to back up. If it isn't
+    wired up yet, strike/ban/reputation state is RAM-only and this step is
+    moot until that gap closes (tracked loosely against issue 05).
+
+## Steps
+
+1. Identify the actual DB paths in use (check the tracker's start command /
+   systemd unit / process env for `--billing-db`, `--accounts-db`, and any
+   registry DB argument).
+2. **Pause hive gossip** on this tracker so peers don't pull a partial/locked
+   file mid-backup:
+   - If the tracker is the sole settlement node with no `--cluster-peers`,
+     gossip is already off — skip to step 3.
+   - Otherwise, stop replication by restarting the process without
+     `--cluster-peers` (or with an empty peer list) for the duration of the
+     backup, or take the backup during a maintenance window with peers
+     temporarily pointed away from this tracker at the load balancer/DNS
+     level. There is currently no live "pause gossip" admin endpoint — this is
+     a process-restart-level operation.
+   - Confirm no in-flight `/v1/registry/gossip`, `/v1/billing/gossip`, or
+     `/v1/accounts/gossip` traffic before proceeding (check access logs).
+3. Take an online, consistent copy of each SQLite file using the backup API
+   rather than `cp` (WAL-mode files can be mid-write):
+   ```
+   sqlite3 billing.sqlite ".backup '/backups/billing-$(date +%Y%m%dT%H%M%S).sqlite'"
+   sqlite3 accounts.sqlite ".backup '/backups/accounts-$(date +%Y%m%dT%H%M%S).sqlite'"
+   # registry DB, if configured:
+   sqlite3 registry.sqlite ".backup '/backups/registry-$(date +%Y%m%dT%H%M%S).sqlite'"
+   ```
+4. Verify each backup opens and has rows in its expected tables
+   (`billing_ledger`/event log tables, `accounts`, `registry_events`).
+5. Resume gossip (restore `--cluster-peers` / routing) once backups are
+   confirmed good.
+6. Ship backups off-host per your normal retention policy. Do not store them
+   alongside `.env.devnet` or keypair files (see secrets handling below).
+
+## Rollback
+
+- If a restore is needed, stop the tracker, replace the live `.sqlite` file(s)
+  with the chosen backup, and restart. Because billing/accounts/registry each
+  use append-only event logs, a stale restore under-counts recent activity
+  rather than corrupting state — reconcile any gap against node/operator
+  reports for the missing window before resuming payouts.
+- If gossip was paused via a peer-list restart, confirm peers re-sync
+  (`events_since` catch-up) before considering the rollback complete.
+
+## Secrets handling
+
+- Never commit `.env.devnet`, treasury keypair JSON files, `--hive-secret`, or
+  `--validator-service-token` values to a repo or ship them inside a DB backup
+  archive. Back these up separately, encrypted, per your existing secrets
+  process.

.scratch/alpha-hardening/runbooks/02-treasury-key-rotation.md

@@ -0,0 +1,112 @@
+Status: stub
+
+# Runbook: Treasury key rotation (devnet mock-USDT)
+
+Covers rotating the devnet treasury keypair and/or the mock-USDT mint without
+double-crediting client ledger balances or double-paying nodes.
+
+## Trust assumptions (read first)
+
+Per [ADR-0015](../../../docs/adr/0015-usdt-custodial-settlement.md), a single
+project-owned wallet custodies all funds; the treasury keypair is loaded only
+on the operator-designated settlement tracker (ADR-0016 §1). Rotating this key
+is a trusted-operator action — there is no on-chain multisig or trustless
+handoff in the alpha design. Devnet uses a self-created mock-USDT SPL mint
+(6 decimals); real USDT only exists on mainnet, so this procedure is
+devnet-only until a mainnet cutover ADR supersedes it.
+
+## Prerequisites
+
+- Access to `scripts/devnet_setup.py` and its dependencies (`solders`,
+  `meshnet_contracts.solana_adapter.SolanaCustodialTreasury`).
+- The current treasury keypair path (default
+  `~/.config/solana/meshnet-treasury.json`, or whatever `--treasury-keypair`
+  the running tracker uses) and current `MESHNET_USDT_MINT` /
+  `MESHNET_TREASURY_WALLET` values (see `.env.devnet`, never committed).
+- Ability to stop/restart the settlement-capable tracker.
+- Confirm the deposit watcher's dedupe state (transaction signatures already
+  credited) is durable — it must survive the rotation so replayed/rescanned
+  transfers under the *old* wallet don't get re-credited under the *new* one.
+
+## Two rotation scenarios
+
+### A. Rotate the treasury keypair only (same mint, same on-chain wallet funds move)
+
+The treasury wallet address changes because it's derived from the keypair, so
+this requires migrating funds, not just swapping a file.
+
+1. Generate a new keypair (do **not** reuse `_load_or_create_keypair` against
+   the old path — write to a new path so both keys exist during the
+   transition):
+   ```
+   python scripts/devnet_setup.py --keypair ~/.config/solana/meshnet-treasury-new.json \
+     --mint <EXISTING_MOCK_USDT_MINT> --env-out .env.devnet.new
+   ```
+   This creates the new treasury wallet + token account and reuses the
+   existing mint (no new token, so client balances denominated in that mint
+   are unaffected).
+2. Drain the old treasury token account to the new one via a single SPL
+   transfer sized to the *entire current balance* (record the exact amount
+   and the source tx signature before moving anything).
+3. **Freeze settlement during the drain**: stop the settlement-capable
+   tracker (or restart it with no `--treasury-keypair` so the settlement loop
+   is inert) before step 2, so no payout is in flight against the old wallet
+   while funds move.
+4. Update the tracker's `--treasury-keypair`, `--treasury-wallet`-derived
+   config (i.e. the new `.env.devnet`) and restart the tracker pointed at the
+   new keypair.
+5. Verify: `treasury.get_sol_balance()` / mock-USDT balance on the new wallet
+   matches the old wallet's pre-drain balance; old wallet balance is zero.
+6. Only after verification, revoke/delete the old keypair file.
+
+### B. Rotate the mock-USDT mint (e.g. compromised or mis-configured mint)
+
+This is a bigger change — it invalidates every client's existing off-chain
+ledger balance denomination reference and any node's pending on-chain payout
+expectations. Treat as a deliberate migration, not a routine rotation:
+
+1. Settle (pay out) all pending node balances against the *old* mint before
+   cutover — the pending-balance forfeiture/collateral model (ADR-0015)
+   assumes pending balances are payable in a known mint.
+2. Create the new mint and treasury token account:
+   ```
+   python scripts/devnet_setup.py --keypair <treasury-keypair> --env-out .env.devnet
+   ```
+   (omit `--mint` so a fresh mint is created).
+3. Update tracker config (`MESHNET_USDT_MINT`) and restart.
+4. Re-mint/airdrop mock USDT to active client wallets under the new mint as
+   needed (`--mint-to`), since off-chain ledger balances are *not*
+   automatically re-denominated — this is a devnet convenience step, not a
+   guarantee that would hold for real USDT.
+
+## Avoiding double-credit
+
+The deposit watcher (issue 32) dedupes by on-chain transaction signature. The
+signature space for the old and new treasury token accounts/mints is
+disjoint, so:
+
+- Do not replay old-wallet deposit history against the new wallet's watcher —
+  it has no record of those signatures and would (correctly) not credit them,
+  but any manual "catch-up crediting" script must not re-process transfers the
+  old watcher already credited. Cross-check the old ledger's credited-tx-sig
+  table before any manual reconciliation entry.
+- Keep the old watcher's dedupe DB/table around (don't drop it as part of
+  rotation) until you've confirmed no in-flight deposits to the old address
+  remain unconfirmed.
+
+## Rollback
+
+- Scenario A: if the new wallet fails verification, restart the tracker with
+  the old `--treasury-keypair` — no client-facing state changed since ledger
+  balances are keyed by API key, not treasury wallet address.
+- Scenario B: if re-minting under the new mint goes wrong, restart the
+  tracker against the old `MESHNET_USDT_MINT` config; nothing was destroyed on
+  the old mint.
+
+## Secrets handling
+
+- Never commit `.env.devnet`, `.env.devnet.new`, or any `*treasury*.json`
+  keypair file. `scripts/devnet_setup.py` writes keypairs with `0o600`
+  permissions — preserve that when copying.
+- Treat the treasury keypair as the single highest-value secret in this
+  system per ADR-0015/ADR-0016: anyone with it can drain custodial funds.

.scratch/alpha-hardening/runbooks/03-upgrade-path.md

@@ -0,0 +1,108 @@
+Status: stub
+
+# Runbook: Tracker upgrade path (rolling restart)
+
+Covers restarting/upgrading tracker processes in a hive without losing
+strike/ban/reputation state or interrupting settlement, per the ADR-0016 §4
+guarantee that reputation carries forward across restarts.
+
+## Trust assumptions (read first)
+
+Per [ADR-0016](../../../docs/adr/0016-alpha-scope-and-known-limitations.md),
+only one operator-designated tracker holds the treasury keypair and runs the
+settlement loop ([ADR-0015](../../../docs/adr/0015-usdt-custodial-settlement.md));
+other hive members replicate for routing only. Raft (`packages/tracker/meshnet_tracker/raft.py`)
+elects a leader for shard-assignment/registration commands — settlement
+leadership is a separate, operator-configured concept, not the Raft leader.
+Plan restarts so the settlement tracker's downtime window is minimized
+independent of routing-tracker restarts.
+
+## Known gap — read before relying on this runbook
+
+Strike/ban/reputation persistence itself was implemented in issue 05
+(`packages/contracts/meshnet_contracts/__init__.py::RegistryEventLog`,
+SQLite-backed, same pattern as billing/accounts). **As of this writing,
+`packages/tracker/meshnet_tracker/cli.py` does not expose a `--registry-db`
+flag, nor does it construct a `contracts=` instance to pass into
+`TrackerServer`.** Running the tracker via the stock CLI entry point leaves
+`server.contracts` as `None`, which means:
+
+- Ban checks (`_registration_ban_error`), reputation-weighted routing
+  (`_reputation_multiplier`), and the `/v1/registry/wallets` endpoint are
+  inert.
+- There is nothing to persist across restarts in that configuration — the
+  "survives restart" guarantee only holds for deployments that construct
+  `LocalSolanaContracts(registry_db=<path>)` and wire it into `TrackerServer(contracts=...)`
+  themselves (e.g. a custom entrypoint or embedding the server programmatically).
+
+Before following the restart steps below, confirm which mode this deployment
+runs in. If it's the stock CLI with no custom `contracts` wiring, strike/ban
+state is RAM-only regardless of this runbook, and a restart resets it — treat
+that as a pre-existing gap to flag to the owner, not something this runbook
+can work around.
+
+## Prerequisites
+
+- Confirm registry persistence is actually wired (see gap above) and note the
+  registry DB path in use.
+- Confirm billing (`--billing-db`) and accounts (`--accounts-db`) persistence
+  paths — these already default to `billing.sqlite` / `accounts.sqlite` and
+  persist regardless of the registry gap.
+- Know which tracker in the hive is currently the settlement leader (holds
+  `--treasury-keypair`) versus routing-only peers.
+- `--hive-secret` / `MESHNET_HIVE_SECRET` configured identically across all
+  hive members (ADR-0017) — a mismatched secret on restart fails gossip
+  closed, not open.
+- Take a [ledger backup](01-ledger-backup.md) before any upgrade that touches
+  schema or dependency versions.
+
+## Steps
+
+1. **Routing-only trackers first.** For each non-settlement tracker in the
+   hive:
+   a. Confirm it's not the current Raft leader (`GET /v1/raft/status`); if it
+      is, this restart forces a re-election — acceptable, but expect a brief
+      registration-proxy gap while a new leader is elected.
+   b. Stop the process, deploy the new code/config, restart with the same
+      `--billing-db` / `--accounts-db` / registry DB paths and the same
+      `--hive-secret` and `--cluster-peers`.
+   c. Check `/v1/raft/status` and `/v1/registry/wallets` (if registry is
+      wired) come back consistent with peers within one gossip interval.
+   d. Move to the next routing tracker only after this one rejoins cleanly.
+2. **Settlement tracker last**, and only during a low-settlement-activity
+   window if possible:
+   a. Confirm no payout is mid-flight (check tracker logs / pending balance
+      levels against `--settle-period` / `--payout-threshold`).
+   b. Stop the process. The treasury keypair file itself is untouched by the
+      restart — do not regenerate it (see
+      [treasury key rotation](02-treasury-key-rotation.md) for that separate
+      procedure).
+   c. Deploy new code/config, restart with identical `--treasury-keypair`,
+      `--solana-rpc-url`, `--usdt-mint`, `--settle-period`,
+      `--payout-threshold`, `--payout-dust-floor`, and DB paths.
+   d. Verify strike/ban/reputation state (if wired) matches pre-restart values
+      via `/v1/registry/wallets`, and that billing/accounts ledgers show the
+      same balances as immediately before shutdown.
+3. Confirm all hive members show each other as alive peers and gossip
+   (`/v1/registry/gossip`, `/v1/billing/gossip`, `/v1/accounts/gossip`) is
+   flowing without HMAC auth failures in logs (ADR-0017).
+
+## Rollback
+
+- Each tracker's on-disk SQLite files are untouched by a code-only upgrade;
+  rolling back means redeploying the previous binary/version against the same
+  DB paths. Because billing/accounts/registry are append-only event logs, a
+  version rollback does not lose data written by the newer version as long as
+  the schema didn't change — if the upgrade included a schema migration,
+  restore from the pre-upgrade [ledger backup](01-ledger-backup.md) instead.
+- If a settlement-tracker restart leaves it unable to reach the treasury RPC
+  endpoint, routing-only trackers continue serving traffic — settlement simply
+  pauses until the leader recovers; no funds are at risk since payouts require
+  the loaded keypair.
+
+## Secrets handling
+
+- Never commit `.env.devnet`, `--hive-secret` / `MESHNET_HIVE_SECRET`,
+  `--validator-service-token`, or the treasury keypair file as part of a
+  deploy/config change. Deploy scripts should read these from the existing
+  secrets store, not from a file checked into the repo.

.scratch/dashboard-test-runner/PRD.md

@@ -0,0 +1,15 @@
+# Dashboard Test Runner
+
+Status: active
+
+## Goal
+Provide an opt-in, admin-only tracker Dashboard Testing tab that dynamically discovers pytest tests, runs fixed collected targets safely in background, and reports live logs/status.
+
+## Safety
+- Disabled unless tracker starts with an explicit flag.
+- Admin-only API/UI.
+- No arbitrary command/argument execution.
+- One active run.
+- Real inference stays separately environment-gated and excluded from default suites.
+
+See `prd.json` for executable Ralph user stories and acceptance criteria.

.scratch/dashboard-test-runner/prd.json

@@ -0,0 +1,65 @@
+{
+  "name": "Tracker Dashboard Test Runner",
+  "description": "Add an admin-only Testing tab that dynamically discovers repository pytest tests, runs a selected safe test target in a background process, and shows live output/status in the tracker dashboard.",
+  "branchName": "ralph/dashboard-test-runner",
+  "userStories": [
+    {
+      "id": "US-001",
+      "title": "Implement secure tracker test-runner API",
+      "description": "As a tracker administrator, I want the tracker to discover and run repository tests through a controlled API so that dashboard actions cannot execute arbitrary shell commands.",
+      "acceptanceCriteria": [
+        "Add an explicit disabled-by-default TrackerServer/CLI test-runner flag; no test endpoint runs commands unless enabled.",
+        "Admin-only endpoints dynamically collect pytest node IDs and start one selected collected test or approved suite at a time without accepting arbitrary command arguments.",
+        "Run pytest in a background process without shell=True, retain bounded stdout/stderr logs, status, timestamps, exit code, and reject concurrent runs.",
+        "Add focused API tests for authorization, disabled state, collection, start, progress/completion, and concurrent-run rejection.",
+        "uv run pytest tests/test_dashboard.py tests/test_tracker_routing.py tests/test_dynamic_routing.py -q passes."
+      ],
+      "priority": 1,
+      "passes": true,
+      "notes": "Use repository root discovery independent of tracker current working directory. Real-inference tests must require an explicit enable flag or environment gate and must never be included in a default suite.",
+      "dependsOn": [],
+      "completionNotes": "Completed by agent"
+    },
+    {
+      "id": "US-002",
+      "title": "Add Testing dashboard tab with live test logs",
+      "description": "As a tracker administrator, I want a Testing tab that lists discovered tests and exposes run/status/log controls so that I can operate and inspect tests from the dashboard.",
+      "acceptanceCriteria": [
+        "Add an admin-only Testing navigation tab and panel; it is hidden for non-admin users.",
+        "Dynamically render tests/suites returned by the tracker API with a Run button for each allowed target.",
+        "Show current state, start/end time, elapsed time, exit code, success/failure, and an auto-refreshing bounded console/log view.",
+        "Disable run controls while a test run is active and display API errors clearly.",
+        "Add dashboard regression tests asserting the Testing tab, dynamic API calls, run controls, and log/status renderer exist.",
+        "uv run pytest tests/test_dashboard.py -q passes."
+      ],
+      "priority": 2,
+      "passes": true,
+      "notes": "Depends on US-001. Preserve existing dashboard tabs and admin authentication conventions.",
+      "dependsOn": [
+        "US-001"
+      ],
+      "completionNotes": "Completed by agent"
+    },
+    {
+      "id": "US-003",
+      "title": "Wire launch and document operator workflow",
+      "description": "As a local mesh operator, I want a launch configuration and documentation for the opt-in test runner so that I can enable it intentionally and understand real-inference safeguards.",
+      "acceptanceCriteria": [
+        "Add a distinct VS Code tracker launch configuration that enables the test runner and uses the project tracker runtime.",
+        "Document default safe suites versus the explicitly gated real-inference suite, including required environment variables and API-credit/hardware implications.",
+        "Validate launch.json and tracker CLI --help.",
+        "uv run pytest tests/test_dashboard.py tests/test_dynamic_routing.py -q passes."
+      ],
+      "priority": 3,
+      "passes": false,
+      "notes": "Do not reintroduce --enable-test-runner without implementing its CLI argument in US-001.",
+      "dependsOn": [
+        "US-001",
+        "US-002"
+      ]
+    }
+  ],
+  "metadata": {
+    "updatedAt": "2026-07-11T17:02:30.520Z"
+  }
+}

.scratch/dashboard-test-runner/ralph-iterations/4cd034a1_2026-07-11_15-23-25_US-001.log

@@ -0,0 +1,196 @@
+# Iteration 1 Log
+
+## Metadata
+
+- **Task ID**: US-001
+- **Task Title**: Implement secure tracker test-runner API
+- **Description**: As a tracker administrator, I want the tracker to discover and run repository tests through a controlled API so that dashboard actions cannot execute arbitrary shell commands.
+- **Status**: completed
+- **Task Completed**: No
+- **Promise Detected**: No
+- **Started At**: 2026-07-11T12:23:25.086Z
+- **Ended At**: 2026-07-11T12:49:05.992Z
+- **Duration**: 25m 40s
+- **Input Tokens**: 27303
+- **Output Tokens**: 60809
+- **Total Tokens**: 88112
+- **Agent**: claude
+- **Model**: claude-fable-5
+- **Sandbox Mode**: auto
+- **Sandbox Network**: Enabled
+--- RAW OUTPUT ---
+I'll start by reviewing the progress file and understanding the existing codebase structure.
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/.ralph-tui/progress.md
+[Bash] List repo root and scratch dir $ ls /run/media/popov/d/DEV/repos/d-popov.com/AI && ls /run/media/popov/d/DEV/repos/d-popov.com/AI/.sc...
+[Bash] Read PRD and list tests/packages $ ls /run/media/popov/d/DEV/repos/d-popov.com/AI/tests /run/media/popov/d/DEV/repos/d-popov.com/AI/pac...
+[Bash] Explore tracker package structure $ ls /run/media/popov/d/DEV/repos/d-popov.com/AI/.scratch 2>/dev/null
+[Bash] Inspect scratch dir for this feature $ find /run/media/popov/d/DEV/repos/d-popov.com/AI/.scratch/dashboard-test-runner -type f | head -20
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/.scratch/dashboard-test-runner/prd.json
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/.scratch/dashboard-test-runner/PRD.md
+Now let me study the tracker server, CLI, and auth patterns.
+[Bash] Line counts of key files $ wc -l /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py /run/me...
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/auth.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/cli.py
+[Bash] Search server.py for test-runner and admin handling $ grep -n "def __init__\|def _handle\|admin" packages/tracker/meshnet_tracker/server.py | head -80
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_dashboard.py
+[Bash] Check stop method, conftests, real-test gating $ sed -n '1,30p' conftest.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] Check account roles and session API $ grep -n "def register\|def create_session\|def session_account" packages/tracker/meshnet_tracker/acc...
+Let me check the HTTP server base class and the routing test files quickly.
+[Bash] Check server class bases and imports $ head -30 tests/test_tracker_routing.py
+[Write] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/test_runner.py """"Opt-in tracker test runner backing the dashboard Testing tab.
+
+Security posture (dashboard-test-runner US-001):
+
+- **Disabled by default** — the tracker only constructs a manager when started
+  wit... (11919 chars)"
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "from .gossip import NodeGossip
+from .logging_setup..." → "from .gossip import NodeGossip
+from .logging_setup..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        route_stats: "RouteStatsStore | None" = No..." → "        route_stats: "RouteStatsStore | None" = No..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        self.relay_status = dict(
+            rela..." → "        self.relay_status = dict(
+            rela..."
+Now the handler routes and endpoint implementations:
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        if self.path == "/v1/wallet/register":
+   ..." → "        if self.path == "/v1/wallet/register":
+   ..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        elif parsed.path == "/v1/registry/wallets"..." → "        elif parsed.path == "/v1/tests":
+         ..."
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "    def _handle_registry_wallets(self):
+        se..." → "    # ---- opt-in test runner (dashboard-test-runn..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        models_dir: str | Path | None = None,
+    ..." → "        models_dir: str | Path | None = None,
+    ..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        self._route_stats = RouteStatsStore(routin..." → "        self._route_stats = RouteStatsStore(routin..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "            route_stats=self._route_stats,
+       ..." → "            route_stats=self._route_stats,
+       ..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "        if self._server is None:
+            retur..." → "        if self._test_runner is not None:
+        ..."
+Now wire the CLI flag to the `TrackerServer` parameter explicitly (it currently only sets the env var):
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/cli.py edit: "    common.add_argument(
+        "--enable-test-ru..." → "    common.add_argument(
+        "--enable-test-ru..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/cli.py edit: "            models_dir=args.models_dir,
+          ..." → "            models_dir=args.models_dir,
+          ..."
+Before writing tests, check the pytest config — the class name `TestRunManager` could trigger collection warnings in the test module:
+[Bash] Check pytest config in pyproject $ grep -n -A15 "pytest" pyproject.toml | head -40
+[Write] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_tracker_test_runner.py """"dashboard-test-runner US-001: opt-in, admin-only tracker test-runner API.
+
+Runs against a tiny throwaway repo (tmp_path) so collection and runs stay
+fast and hermetic — the manager itself discovers... (8890 chars)"
+Now run the new test file:
+[Bash] Run new test-runner API tests $ uv run pytest tests/test_tracker_test_runner.py -q 2>&1 | tail -20
+All 14 new tests pass. Now the acceptance-criteria suite plus a CLI `--help` sanity check:
+[Bash] Run acceptance-criteria pytest suite $ uv run pytest tests/test_dashboard.py tests/test_tracker_routing.py tests/test_dynamic_routing.py -q...
+Four failures — let me check whether they're pre-existing on the base tree or caused by my change:
+[Bash] Show failure details $ uv run pytest tests/test_dashboard.py::test_dashboard_served_with_all_panels "tests/test_tracker_rou...
+[Bash] Stash changes, rerun failing tests on clean tree, restore $ git stash pop
+[Bash] Show assertion details for three failing tests $ uv run pytest "tests/test_tracker_routing.py::test_tracker_models_endpoint_lists_registered_hf_repo_...
+[Bash] Check root PRD for active stories $ [print(s['id'], s['title'], 'passes:', s.get('passes')) for s in d['userStories']]" 2>/dev/null || h...
+
+[Error: Exit code 1
+head: cannot open 'PRD.md' for reading: No such file or directory
+===
+head: cannot open 'prd.json' for reading: No such file or directory]
+[Bash] Read models alias test $ grep -n "test_tracker_models_endpoint_lists_registered_hf_repo_and_short_name_alias" -A 60 tests/tes...
+[Bash] Read the other two failing tests $ grep -n "test_shard_heal_cycle_surviving_node_covers_dead_peers_gap" -A 70 tests/test_tracker_routin...
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] Locate model load request function $ grep -n "def _request_model_load_locked" packages/tracker/meshnet_tracker/server.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] Find qwen preset in model presets $ python3 -c " import json d = json.load(open('packages/tracker/meshnet_tracker/model_presets.json')) ...
+[Bash] List preset keys and find matcher $ grep -n "_node_matches_preset" packages/tracker/meshnet_tracker/server.py | head -3
+[Bash] Read preset loading and matcher $ sed -n '110,235p' packages/tracker/meshnet_tracker/server.py
+[Bash] List actual model presets $ python3 -c " import json d = json.load(open('packages/tracker/meshnet_tracker/model_presets.json'))[...
+[Bash] Find LOAD_SHARD directive creation sites $ grep -n "LOAD_SHARD\|_load_shard_directive\|def _rebalance\|def _scale_demanded" packages/tracker/me...
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] Find directive-model assertions in tests $ grep -n "_emit_shard_change_directives\|_assign_redundant_managed_nodes" packages/tracker/meshnet_tr...
+[Bash] Identify test containing line 1579 $ grep -n "^def test" tests/test_tracker_routing.py | awk -F: '$1 < 1579' | tail -3
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] View model load handler head $ sed -n '4338,4344p' packages/tracker/meshnet_tracker/server.py
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "    def _handle_model_load_request(self):
+        ..." → "    def _handle_model_load_request(self):
+        ..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "    model_nodes = [
+        node for node in serve..." → "    model_nodes = [
+        node for node in serve..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "    for node in managed_nodes:
+        _emit_shard..." → "    for node in managed_nodes:
+        _emit_shard..."
+Now the `/v1/models` fix — stop suppressing the node-derived hf-repo entry when a preset shares that repo:
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "            seen_ids.add(name)
+            if hf_r..." → "            seen_ids.add(name)
+            # Note:..."
+And the favicon fix — the dashboard test requires the string "meshnet" in the SVG:
+[Bash] View favicon opening tag $ head -c 300 packages/tracker/meshnet_tracker/favicon.svg
+[Bash] Add meshnet title to favicon SVG $ python3 - <<'EOF' from pathlib import Path p = Path("packages/tracker/meshnet_tracker/favicon.svg") ...
+Now run the full acceptance-criteria suite:
+[Bash] Run acceptance-criteria pytest suite $ uv run pytest tests/test_dashboard.py tests/test_tracker_routing.py tests/test_dynamic_routing.py -q...
+[Bash] Show remaining failure detail $ uv run pytest tests/test_dynamic_routing.py::test_admin_model_load_request_queues_directive_on_joine...
+Auth passes now; the load returns 409 (no eligible node found). Let me debug `_memory_pool_map`/capacity for that registration:
+[Bash] Debug memory pool and node capacity for model load $ uv run python - <<'EOF' import json, urllib.request from meshnet_tracker.server import TrackerServer...
+[Bash] Find slot computation $ grep -n "memory_mb" packages/tracker/meshnet_tracker/server.py | head
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] Check test history and memory_mb usage $ grep -n '"memory_mb"\|memory_mb' packages/tracker/meshnet_tracker/server.py | head
+[Bash] Inspect commit that added the failing test $ git show bb561a9 -- tests/test_dynamic_routing.py | head -80
+[Bash] See server changes in that commit $ git show bb561a9 -- packages/tracker/meshnet_tracker/server.py | head -120
+[Bash] Find other tests using models/load $ grep -rn "spare_slots" tests/ | head
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py edit: "    required_start, required_end = _preset_layer_b..." → "    required_start, required_end = _preset_layer_b..."
+[Bash] Run acceptance-criteria pytest suite $ uv run pytest tests/test_dashboard.py tests/test_tracker_routing.py tests/test_dynamic_routing.py -q...
+[Bash] Run affected adjacent test files $ uv run pytest tests/test_tracker_test_runner.py tests/test_smoke.py tests/test_openai_gateway.py tes...
+[Bash] Check if those 3 failures are pre-existing on clean tree $ git stash pop >/dev/null && echo RESTORED
+Those 3 fail on the clean tree too — pre-existing and outside this story's scope. There was a 4th failure in my run; let me identify it:
+[Bash] Rerun node startup tests to list failures $ uv run pytest tests/test_node_startup.py -q 2>&1 | grep -E "FAILED|failed|passed" | tail -5
+[Bash] Verify 4th failure pre-exists on clean tree $ git stash pop >/dev/null && echo RESTORED
+[Bash] Run full suite minus real/pre-existing failures $ uv run pytest tests/ -q -x --ignore=tests/test_real_distributed_inference.py --ignore=tests/test_rea...
+While that runs, let me validate the CLI `--help` still works and check for lint tooling:
+[Bash] Validate CLI help and check lint config $ grep -rn "ruff\|flake8\|mypy" pyproject.toml packages/tracker/pyproject.toml 2>/dev/null | head -5
+[Monitor] $ wait
+
+[Error: <tool_use_error>InputValidationError: Monitor failed due to the following issues:
+The required parameter `description` is missing
+An unexpected parameter `task_id` was provided
+
+This tool's schema was not sent to the API — it was not in the discovered-tool set derived from message history. Without the schema in your prompt, typed parameters (arrays, numbers, booleans) get emitted as strings and the client-side parser rejects them. Load the tool first: call ToolSearch with query "select:Monitor", then retry this call. For reference, this tool's input schema is: {"$schema":"https://json-schema.org/draft/2020-12/schema","type":"object","properties":{"description":{"description":"Short human-readable description of what you are monitoring (shown in notifications).","type":"string"},"timeout_ms":{"description":"Kill the monitor after this deadline. Default 300000ms, max 3600000ms. Ignored when persistent is true.","default":300000,"type":"number","minimum":1000},"persistent":{"description":"Run for the lifetime of the session (no timeout). Use for session-length watches like PR monitoring or log tails. Stop with TaskStop.","default":false,"type":"boolean"},"command":{"description":"Shell command or script. Each stdout line is an event; exit ends the watch.","type":"string"},"ws":{"description":"WebSocket to open. Each text frame is an event; binary frames are reported as a placeholder line. Socket close ends the watch. Cannot be combined with command.","type":"object","properties":{"url":{"type":"string"},"protocols":{"type":"array","items":{"type":"string","pattern":"^[!#$%&'*+.^_`|~0-9A-Za-z-]+$"}}},"required":["url"],"additionalProperties":false}},"required":["description","timeout_ms","persistent"],"additionalProperties":false}</tool_use_error>]
+[Bash] Peek at background suite progress $ tail -3 /tmp/claude-1000/-run-media-popov-d-DEV-repos-d-popov-com-AI/bbf80269-c6cb-4dee-8129-806bdd1...
+[Bash] Check billing test on clean tree $ git stash pop >/dev/null && echo RESTORED
+[Bash] Full suite sweep without -x $ uv run pytest tests/ -q --ignore=tests/test_real_distributed_inference.py --ignore=tests/test_real_m...
+While the sweep runs, let me draft the progress log. I'll append once tests confirm:
+[Bash] Summarize working-tree changes $ git diff --stat
+[Bash] Show unexpected launch.json diff $ git diff .vscode/launch.json
+[Bash] Wait and check sweep progress $ tail -2 /tmp/claude-1000/-run-media-popov-d-DEV-repos-d-popov-com-AI/bbf80269-c6cb-4dee-8129-806bdd1...
+
+[Error: <tool_use_error>Blocked: sleep 120 followed by: tail -2 /tmp/claude-1000/-run-media-popov-d-DEV-repos-d-popov-com-AI/bbf80269-c6cb-4dee-8129-806bdd1818cb/tasks/bljh92kw0.output. To wait for a condition, use Monitor with an until-loop (e.g. `until <check>; do sleep 2; done`). To wait for a command you started, use run_in_background: true. Do not chain shorter sleeps to work around this block.</tool_use_error>]
+[ToolSearch] query: select:Monitor
+[Monitor] full pytest sweep result line $ grep -E "FAILED|[0-9]+ (passed|failed)" "$f" | tail -10
+[Bash] Review CLI diff while waiting $ git diff packages/tracker/meshnet_tracker/cli.py | head -40
+[Bash] Review server.py diff highlights $ git diff packages/tracker/meshnet_tracker/server.py | grep -E "^\+|^-" | grep -v "^\+\+\+\|^---" | h...
+[Bash] Server diff summary $ git diff packages/tracker/meshnet_tracker/server.py | grep -c "^+"
+The diff is as expected. Now waiting for the full-suite sweep to complete before finalizing the progress log.
+[Bash] Wait for sweep completion $ echo done
+[ToolSearch] query: select:TaskStop
+[TaskStop]
+Stopped the redundant monitor; the background waiter will notify when the sweep finishes.
+[Bash] Check sweep interim output $ tail -1 /tmp/claude-1000/-run-media-popov-d-DEV-repos-d-popov-com-AI/bbf80269-c6cb-4dee-8129-806bdd1...
+The sweep pipes through `tail`, so output arrives only at completion. Waiting for the notification.
+[Bash] Wait for sweep output and print it $ cat /tmp/claude-1000/-run-media-popov-d-DEV-repos-d-popov-com-AI/bbf80269-c6cb-4dee-8129-806bdd1818c...
+[TaskStop]
+Waiting on the sweep — the waiter will print the summary when pytest finishes.
+[Bash] No-op while awaiting background notification $ true
+[Bash] Confirm pytest sweep still running $ echo ---
+[Bash] Wait for pytest sweep to exit, then print summary $ cat /tmp/claude-1000/-run-media-popov-d-DEV-repos-d-popov-com-AI/bbf80269-c6cb-4dee-8129-806bdd1818c...
+[TaskStop]
+Waiting for the sweep's completion notification now.
+[Bash] Idle awaiting sweep notification $ true
+[Bash] Check sweep process state $ echo ---
+[Bash] Idle awaiting sweep completion notification $ true
+I'm waiting on the full-suite pytest sweep (background task `bl4jpqt9c`) before writing the progress log entry. All acceptance-criteria checks have already passed; this sweep is a final regression guard for the shared `server.py` changes.

.scratch/dashboard-test-runner/ralph-opus-iterations/bc37171f_2026-07-11_16-12-14_US-002.log

@@ -0,0 +1,104 @@
+# Iteration 1 Log
+
+## Metadata
+
+- **Task ID**: US-002
+- **Task Title**: Add Testing dashboard tab with live test logs
+- **Description**: As a tracker administrator, I want a Testing tab that lists discovered tests and exposes run/status/log controls so that I can operate and inspect tests from the dashboard.
+- **Status**: failed
+- **Task Completed**: No
+- **Promise Detected**: No
+- **Started At**: 2026-07-11T13:12:14.739Z
+- **Ended At**: 2026-07-11T13:17:21.820Z
+- **Duration**: 5m 7s
+- **Input Tokens**: 202
+- **Output Tokens**: 19077
+- **Total Tokens**: 19279
+- **Agent**: claude
+- **Model**: claude-opus-4-8
+- **Sandbox Mode**: auto
+- **Sandbox Network**: Enabled
+--- RAW OUTPUT ---
+I'll start by studying the context — the PRD, progress notes, and existing dashboard code.
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/.ralph-tui/progress.md
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/.scratch/dashboard-test-runner/prd.json
+US-001 is marked complete. Let me find the dashboard and the test-runner API it added.
+[Bash] $ git log --oneline -3 && echo "--- FILES ---" && grep -rl "test.runner\|test_runner\|testRunner" --in...
+[Bash] $ ls tests/test_dashboard.py && find . -name "*.py" -path "*tracker*" -not -path "*/node_modules/*" -n...
+Let me read the US-001 API surface that I need to consume.
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/test_runner.py
+[Bash] $ grep -n "test" packages/tracker/meshnet_tracker/server.py | grep -i "route\|def \|path\|/api" | head...
+Now the server endpoints and the dashboard structure.
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/server.py
+[Bash] $ echo "=== dashboard files ===" && find . -name "*.html" -not -path "*/node_modules/*" -not -path "*/...
+Now the dashboard itself — I need its tab structure and admin-gating conventions.
+[Bash] $ cd /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker echo "LINES: $(wc -l...
+Let me read the key regions: nav markup, tab-switching, admin mode, and the per-tab fetch dispatch.
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+Now the helper functions I'll reuse: `apiCall`, `renderIfChanged`, `renderConsole`, `table`.
+[Bash] $ cd /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker grep -n "^function a...
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+I have the full picture. Let me check the CSS classes and the tail of the existing test file for conventions.
+[Bash] $ cd /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker echo "=== console cs...
+Now I'll implement. First the nav tab and panels.
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "  <button id="tab-admin" style="display:none" oncl..." → "  <button id="tab-admin" style="display:none" oncl..."
+Now the Testing panels:
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "  <section data-tab="admin" class="wide"><h2>Conso..." → "  <section data-tab="admin" class="wide"><h2>Conso..."
+Now the CSS, alongside the existing console styles:
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "  .status-pending { color:var(--warn); }" → "  .testing-controls { display:flex; gap:8px; margi..."
+Now the JS module. I'll insert it after `renderConsole`, using event delegation (matching the chat-session pattern) rather than inline `onclick` with interpolated node IDs.
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "// ---- account panel (registration / login / bala..." → "// ---- testing tab (opt-in tracker test runner, d..."
+Now wire it into the tab machinery: `switchDashboardTab`, `setAdminMode`, `TAB_FETCHERS`, and the poll loop.
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "function switchDashboardTab(name) {
+  if (name ===..." → "function switchDashboardTab(name) {
+  if ((name ==..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "function setAdminMode(enabled) {
+  isAdmin = enabl..." → "function setAdminMode(enabled) {
+  isAdmin = enabl..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "const TAB_FETCHERS = {
+  overview: fetchOverviewTa..." → "const TAB_FETCHERS = {
+  overview: fetchOverviewTa..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "bindChatSessionList();
+bindChatModelSelect();
+init..." → "bindChatSessionList();
+bindChatModelSelect();
+init..."
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "setInterval(pollCallWallIfIdle, CALL_WALL_POLL_MS)..." → "setInterval(pollCallWallIfIdle, CALL_WALL_POLL_MS)..."
+One cleanup — `wasActive` is always true after the guard, so it's dead:
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/packages/tracker/meshnet_tracker/dashboard.html edit: "async function pollTestRunIfActive() {
+  if (dashb..." → "async function pollTestRunIfActive() {
+  if (dashb..."
+Now the regression tests. Let me check how existing tests assert on dashboard internals so I match the style:
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_dashboard.py
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_dashboard.py
+Now the regression tests. I'll add the new panels to the existing `PANELS` list and add a focused test.
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_dashboard.py edit: "    "Chat / inference",
+    "Console output",
+]" → "    "Chat / inference",
+    "Console output",
+    ..."
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_dashboard.py
+[Edit] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_dashboard.py edit: "        assert expired_event["fields"]["model_heal..." → "        assert expired_event["fields"]["model_heal..."
+Now run the required test suite:
+[Bash] $ cd /run/media/popov/d/DEV/repos/d-popov.com/AI && uv run pytest tests/test_dashboard.py -q 2>&1 | ta...
+All 15 pass. The dashboard has no build step, so a JS syntax error would silently break the entire page — let me verify the script parses.
+[Bash] $ python3 -c " import re,pathlib html = pathlib.Path('packages/tracker/meshnet_tracker/dashboard.html'...
+Syntax is clean. Now let me verify my payload-field assumptions against the real API end-to-end, rather than trusting the shapes I read.
+[Bash] $ grep -n "enable_test_runner\|admin\|token\|def test_start" tests/test_tracker_test_runner.py | head ...
+[Read] /run/media/popov/d/DEV/repos/d-popov.com/AI/tests/test_tracker_test_runner.py
+Now let me drive the real endpoints exactly as the dashboard does, and dump the payloads my renderers consume.
+[Bash] $ outcome =",           "success" if run["status"] == "passed" else "failure")      st, err = req("POS...
+Verified end-to-end against the live API: non-admin blocked (403), 484 tests + 3 suites collected dynamically, run accepted (202), concurrent run rejected (409), every field my renderers read is present, and errors surface with the server's own wording.
+
+Now the broader regression + lint check:
+[Bash] $ uv run pytest tests/test_dashboard.py tests/test_tracker_test_runner.py tests/test_tracker_routing.p...
+[Bash] $ uv run ruff check tests/test_dashboard.py packages/tracker/meshnet_tracker/ 2>&1 | tail -6
+You've hit your session limit · resets 8:20pm (Europe/Sofia)
+
+[Error: rate_limit]

.scratch/dashboard-test-runner/ralph-terra-iterations/1998cbcc_2026-07-11_20-01-02_US-002.log

@@ -0,0 +1,52 @@
+# Iteration 1 Log
+
+## Metadata
+
+- **Task ID**: US-002
+- **Task Title**: Add Testing dashboard tab with live test logs
+- **Description**: As a tracker administrator, I want a Testing tab that lists discovered tests and exposes run/status/log controls so that I can operate and inspect tests from the dashboard.
+- **Status**: completed
+- **Task Completed**: Yes
+- **Promise Detected**: Yes
+- **Started At**: 2026-07-11T17:01:02.422Z
+- **Ended At**: 2026-07-11T17:02:30.520Z
+- **Duration**: 1m 28s
+- **Input Tokens**: 553854
+- **Output Tokens**: 3872
+- **Total Tokens**: 557726
+- **Agent**: codex
+- **Model**: gpt-5.6-terra
+- **Sandbox Mode**: auto
+- **Sandbox Network**: Enabled
+--- RAW OUTPUT ---
+I’ll inspect the project context and the existing dashboard/test setup, then implement and verify US-002 without committing changes.
+[shell] $ /bin/bash -lc "sed -n '1,240p' .claude/memory/MEMORY.md && sed -n '1,260p' .ralph-tui/progress.md &&...
+I’m using the repo’s implementation workflow because this story is scoped from a PRD; I’ll follow its test-first seam where practical, but will leave the work uncommitted as requested.
+[shell] $ /bin/bash -lc "rg -n --glob '"'!*'"\\.lock' 'US-002|Testing tab|test logs|tests/suites' .scratch .ra...
+[shell] $ /bin/bash -lc "sed -n '1,220p' .scratch/dashboard-test-runner/PRD.md sed -n '1,460p' tests/test_dash...
+The dashboard implementation and its regression coverage are already present in the worktree. I’m validating the rendered tab and its integration points now; if the required test passes, I’ll record the completed story rather than duplicate it.
+The requested command was blocked only by uv’s default cache being read-only in this sandbox. I’ll rerun it with the repository-local cache, then run the configured static checks and append the required progress entry.
+[shell] $ /bin/bash -lc "UV_CACHE_DIR=.uv-cache uv run pytest tests/test_dashboard.py -q printf '\\n--- tool c...
+The test file cannot bind localhost in this environment, so all 15 tests fail before rendering the dashboard (`PermissionError: [Errno 1] Operation not permitted`). The implementation itself matches the server/API and UI acceptance checks; I’ll finish with non-network static validation and the required progress record.
+[shell] $ /bin/bash -lc "sed -n '1,180p' pyproject.toml rg -n 'testing tab|dashboard tabs|data-admin-only|dash...
+
+[Error: [Errno 2] No such file or directory: 'packages/tracker/meshnet_tracker/dashboard.py'error: Failed to spawn: `ruff`
+  Caused by: No such file or directory (os error 2)
+]
+[shell] $ /bin/bash -lc 'tail -80 .ralph-tui/progress.md UV_CACHE_DIR=.uv-cache uv run python -m py_compile pa...
+Static Python compilation and whitespace checks pass. Ruff is not installed in the current uv environment; I’ve recorded that alongside the environment-specific socket limitation. I’ll now do the implementation workflow’s final focused review of the uncommitted dashboard change.
+[shell] $ /bin/bash -lc "sed -n '1,320p' .agents/skills/review/SKILL.md"
+[shell] $ /bin/bash -lc "git diff --check && git status --short && tail -30 .ralph-tui/progress.md && rg -n 'T...
+[shell] $ /bin/bash -lc "rg -n -C 1 'socket-backed verification|PermissionError|UV_CACHE_DIR' /home/popov/.cod...
+US-002 is implemented and documented in `.ralph-tui/progress.md`; no commit created.
+
+Validation:
+- Python compilation and `git diff --check` pass.
+- `uv run pytest tests/test_dashboard.py -q` is blocked here: sandbox disallows localhost sockets (`PermissionError`), so TrackerServer cannot start.
+- Ruff is unavailable in the current uv environment.
+
+<promise>COMPLETE</promise>
+
+
+--- STDERR ---
+warning: `--full-auto` is deprecated; use `--sandbox workspace-write` instead.

.scratch/distributed-gguf-runtime/ADR-0020-distributed-gguf-runtime.md

@@ -0,0 +1,121 @@
+# ADR-0020: Lean Native Distributed GGUF Runtime
+
+Status: Accepted
+Date: 2026-07-13
+
+## Context
+
+The project currently uses Transformers/safetensors as its real model execution backend. This provides broad architecture coverage and a correctness reference, but reported and observed consumer CPU/GPU inference performance motivates evaluating llama.cpp/GGML and quantized GGUF.
+
+The product objective is not merely local GGUF serving. It is performant concurrent inference for top open models whose weights do not fit on one consumer node. The project already owns the Tracker, Inference Route, Route Session, Activation Seam, local Hot KV State, relay/direct transport, cancellation, telemetry, billing, and capability admission.
+
+Research audited llama.cpp RPC, GPUStack/llama-box, Nakshatra, prima.cpp, llama-gguf, LiGGUF, vLLM and its GGUF plugin, Petals, exo, and related projects. No repository provides the complete public-network contract. llama.cpp is the strongest GGUF execution substrate. vLLM has mature managed-cluster parallelism and scheduling concepts but its PP/TP/EP runtime assumes a static trusted distributed world and is unsuitable as the public Shard runtime.
+
+The project must remain lean and avoid combining several half-integrated inference control planes.
+
+## Decision
+
+### Primary native runtime
+
+Use llama.cpp/GGML through one standalone C++ Shard worker and a small exact-commit patch stack.
+
+The patch scope is limited to:
+
+- Range-aware GGUF tensor ownership/loading.
+- Architecture-defined intermediate boundary input/output.
+- Intermediate output before tail normalization/head.
+- Layer-filtered KV and external session-to-sequence mapping.
+
+Meshnet networking, routing, admission, billing, telemetry, and work evidence stay outside llama.cpp.
+
+Nakshatra, prima.cpp, llama-gguf, LiGGUF, and historical GPUStack are source/test donors only. Their repositories are not runtime dependencies.
+
+### Distributed parallelism
+
+The first public-network primitive is layer/pipeline parallelism through contiguous Shards in an Inference Route.
+
+Per-node continuous batching combines decode steps from compatible active Route Sessions. Multiple complete routes provide data parallelism.
+
+Tensor and expert parallel collectives may later operate inside one trusted composite node or managed cluster represented as one provider. They are not public WAN routing primitives.
+
+### Transport
+
+Use gRPC over HTTP/2 with Protocol Buffers for the native Python/C++ Shard data plane.
+
+- One long-lived bidirectional stream per Route Session Activation Seam.
+- Deadlines, cancellation, flow control, TLS/authentication hooks, structured status, and generated schemas.
+- Bounded chunks for prefill and a small decode fast path.
+- Existing relay infrastructure may carry the same versioned protobuf frames as opaque binary when direct connectivity is unavailable.
+- OpenAI client APIs remain HTTP/SSE; existing Tracker APIs remain unchanged.
+
+The boundary payload is a versioned named-tensor bundle because architecture boundaries may require more than one tensor.
+
+### vLLM
+
+Do not fork vLLM for public distributed Shards and do not transplant PagedAttention, Torch process groups, or the vLLM GGUF plugin into the llama.cpp worker.
+
+Allow unmodified vLLM as an optional whole-model backend or managed TP/PP/EP cluster represented as one logical provider.
+
+Adapt only small control-plane concepts:
+
+- Named intermediate bundles.
+- Continuous batching and request ownership.
+- Versioned cache-transfer compatibility fingerprints.
+- Explicit transfer failure/abort lifecycle.
+- Load telemetry and fair tie-breaking.
+
+### Benchmark gate
+
+GGUF performance is a hypothesis. Before expensive native work, compare the current Transformers/safetensors recipe with whole-model llama.cpp on controlled model, hardware, prompt, context, output, sampling, concurrency, memory, and quality lanes.
+
+Later distributed release gates use thresholds locked before implementation results are known. The native track stops if llama.cpp/GGUF offers neither a meaningful performance benefit nor a meaningful model-fit benefit at useful speed.
+
+### Concurrency
+
+A native worker must isolate `(Route Session ID, route epoch)` through a llama sequence or bounded context and must not serialize all generations behind one global serving sequence.
+
+The node admits sessions against weight/KV/scratch budgets, batches compatible decode steps, prevents prefill starvation, applies backpressure, and exposes queue/batch/KV telemetry.
+
+### Architecture certification
+
+Dense Llama-family is first. Qwen3/Qwen3-MoE is a separate explicit adapter. Every architecture/backend/recipe remains registered-but-dark until a real distributed forward, parity test, concurrency test, and capability admission pass.
+
+## Alternatives rejected
+
+### Fork vLLM for the public mesh
+
+Rejected because extracting its PP/TP/EP stages requires replacing static process groups, rank lifecycle, scheduler, request ownership, cache layout, failure behavior, and hardware assumptions. This would create a large difficult fork while discarding much of vLLM's core architecture.
+
+### llama.cpp RPC as the public protocol
+
+Rejected because it exposes coordinator-owned raw GGML devices, not independent Shards. Its trust, security, failure, cache, and per-node accounting model is unsuitable for arbitrary volunteer nodes.
+
+### Adopt Nakshatra or prima.cpp wholesale
+
+Rejected because their repositories, build reproducibility, session/concurrency semantics, architecture coverage, protocol identity, and control planes do not satisfy the project contract. Their partial-loading and boundary work remains valuable evidence.
+
+### Build a custom GGUF engine
+
+Rejected because llama.cpp already provides the parser, kernels, architecture graphs, KV, tokenizer, and heterogeneous backends. Reimplementing these would spread effort and increase correctness risk.
+
+### Invent a custom transport
+
+Rejected. gRPC/HTTP2 already provides mature streaming, flow control, deadlines, cancellation, TLS, and cross-language schema generation.
+
+## Consequences
+
+- The critical path contains Meshnet, one standalone worker, and one small pinned llama.cpp patch stack.
+- Transformers/safetensors remains the correctness reference and fallback for unsupported architectures.
+- Whole-model llama.cpp and vLLM managed clusters remain useful optional provider types.
+- The first milestone emphasizes controlled benchmark, parity, concurrent KV, and real two-machine evidence rather than a large-model demo.
+- Upstream collaboration with llama.cpp targets generic local hooks only; the project remains able to ship a narrow pinned fork if upstream acceptance takes time.
+- QUIC, public tensor parallelism, disaggregated prefill, speculative decode, route repair, and KV migration remain deferred until the core route passes release gates.
+
+## Verification gates
+
+1. Controlled safetensors-versus-GGUF performance contract.
+2. Two-process local range parity.
+3. Four-session concurrent KV isolation.
+4. Real two-machine execution using both Shards.
+5. End-to-end performance/fit advantage over the current distributed route.
+6. Separate Qwen3-family architecture certification.

.scratch/distributed-gguf-runtime/PRD.md

@@ -0,0 +1,252 @@
+# PRD: Performant Concurrent Distributed GGUF Runtime
+
+## Overview
+
+Build one lean native GGUF execution path that lets an Inference Route combine consumer machines to serve models larger than any one node can hold. Reuse the existing Meshnet control plane and llama.cpp/GGML execution engine. Adopt gRPC/HTTP2 and Protocol Buffers for the native Shard worker data plane rather than inventing a transport.
+
+The program is benchmark-gated. GGUF is not assumed faster merely because it is quantized or uses a different file format. The first story compares the current Transformers/safetensors backend against whole-model llama.cpp on controlled model/hardware/quality lanes and locks a performance contract. Native distributed work proceeds only when GGUF provides a meaningful speed or fit benefit.
+
+## Goals
+
+- Execute one GGUF model across independently addressable contiguous Shards.
+- Retain Hot KV State locally for each Shard and isolate concurrent Route Sessions.
+- Batch compatible decode steps across active sessions for aggregate throughput.
+- Use consumer CPU, AMD, NVIDIA, Vulkan, Metal, and mixed routes only where a real certified forward passes.
+- Beat the current distributed safetensors route under a controlled performance contract or enable a larger otherwise-unroutable model at useful measured speed.
+- Keep the critical path to Meshnet plus a small pinned llama.cpp fork and standalone C++ worker.
+- Produce narrow upstream collaboration material for llama.cpp without placing Meshnet networking or economics inside upstream.
+
+## Quality Gates
+
+Every story must:
+
+- Run its targeted `pytest` tests.
+- Run `python -m compileall packages tests` for Python changes.
+- Run `git diff --check`.
+- Keep default tests deterministic, model-download-free, API-credit-free, and GPU-free.
+- Preserve existing Transformers/safetensors behavior unless the story explicitly changes a versioned compatibility contract.
+
+Stories touching the native worker must also:
+
+- Build the pinned C++ target with CMake.
+- Run focused C++/protocol tests through CTest or the documented equivalent.
+- Verify the llama.cpp patch stack applies cleanly to the exact pinned commit.
+
+Real-model/hardware stories must:
+
+- Require `MESHNET_ENABLE_REAL_INFERENCE_TESTS=1`.
+- Use the machine-specific mounted-drive model path and the certified runtime environment; never place model artifacts under `/home`.
+- Record exact model revision, artifact hash, runtime recipe, hardware, driver/backend, commands, raw JSON metrics, and output-quality result.
+- Label synthetic tests as unit coverage rather than distributed acceptance.
+
+Before a story is marked complete, run the full deterministic `pytest -q` suite or record the exact pre-existing unrelated failure with a clean-tree reproduction.
+
+## User Stories
+
+### DGR-001: Lock the safetensors-versus-GGUF performance contract
+**Description:** As a runtime engineer, I need a controlled baseline so that GGUF work proceeds from measured speed, memory, and quality rather than reputation.
+
+**Acceptance Criteria:**
+- [ ] Benchmark the same model architecture/revision, machine, prompts, context lengths, output lengths, sampling policy, and concurrency across the current Transformers/safetensors recipe and whole-model llama.cpp recipes.
+- [ ] Separate correctness/quality lanes from quantized performance/fit lanes instead of claiming BF16 and Q4 are numerically equivalent.
+- [ ] Report TTFT, prefill tok/s, decode tok/s, p50/p95 latency, aggregate throughput, RSS, VRAM, artifact size, failures, and output drift in machine-readable JSON.
+- [ ] Add concurrency levels 1 and 4 where memory permits.
+- [ ] Write a versioned performance contract consumed by later release gates, including an explicit stop condition when llama.cpp/GGUF has no meaningful speed or fit benefit.
+
+### DGR-002: Adopt the versioned gRPC Shard protocol
+**Description:** As a node developer, I need a battle-proven streaming protocol so that Python and C++ Shards communicate without a custom socket protocol.
+
+**Acceptance Criteria:**
+- [ ] Add a Protocol Buffers schema for capability, health, session stream, release, and cancellation operations.
+- [ ] Define one long-lived bidirectional gRPC stream per Route Session Activation Seam with deadlines, cancellation, flow control, and structured errors.
+- [ ] Define bounded chunking for prefill and a small decode fast path.
+- [ ] Carry schema version, request/work ID, Route Session ID, route epoch, artifact/recipe fingerprint, Shard range/effective start, phase, position, idempotency step, cache expectation, compression, and checksum.
+- [ ] Define a versioned named-tensor bundle with per-tensor name, shape, dtype, byte order, and payload fragments.
+- [ ] Add generated-schema round-trip and compatibility tests in Python and C++.
+
+### DGR-003: Define exact Artifact and runtime recipe identity
+**Description:** As the Tracker, I need exact compatibility identity so that only numerically and operationally compatible Shards form an Inference Route.
+
+**Acceptance Criteria:**
+- [ ] Separate weight quantization, activation dtype, compute dtype, KV dtype/layout, tokenizer revision, architecture adapter, backend, and runtime version.
+- [ ] Bind derivative or split artifacts to an exact source Model Artifact hash and Shard range.
+- [ ] Produce a stable compatibility fingerprint used by capability admission and the gRPC handshake.
+- [ ] Fail closed on mismatched artifact, tokenizer, architecture, range, boundary schema, activation recipe, or cache layout.
+- [ ] Keep unsupported recipes registered-but-dark until a real distributed forward certifies them.
+
+### DGR-004: Create the reproducible pinned llama.cpp patch stack
+**Description:** As a maintainer, I need a small auditable fork boundary so that upstream updates do not turn the runtime into an unmaintainable stitched codebase.
+
+**Acceptance Criteria:**
+- [ ] Pin one exact llama.cpp commit through a reproducible source dependency mechanism.
+- [ ] Store a numbered minimal patch stack separately from Meshnet networking code.
+- [ ] Add a build script that applies/checks patches and builds the standalone worker without manual source copying.
+- [ ] Record upstream file/ABI assumptions and fail clearly when the pin changes.
+- [ ] Preserve upstream license and attribution notices.
+- [ ] Add a clean rebuild smoke test that does not download a model.
+
+### DGR-005: Implement dense-Llama range-aware GGUF ownership
+**Description:** As a node, I need to map only my assigned dense-Llama Shard so that aggregate consumer memory can hold a model larger than one node.
+
+**Acceptance Criteria:**
+- [ ] Register and allocate only `blk.N.*` tensors in the assigned range.
+- [ ] Load embeddings only for the head and final norm/LM head only for the tail, including tied embeddings.
+- [ ] Prefer range-aware mapping from one exact source GGUF; if derivative sub-GGUFs are used temporarily, verify source/slice hashes and avoid claiming final artifact semantics.
+- [ ] Report authoritative loaded range and endpoint ownership from the model, not operator CLI claims.
+- [ ] Demonstrate mapped/resident memory scales with owned tensors rather than full model size.
+
+### DGR-006: Implement architecture-defined boundary input/output
+**Description:** As a Shard, I need to consume and emit the correct transformer boundary state so that disjoint processes reproduce whole-model execution.
+
+**Acceptance Criteria:**
+- [ ] Head accepts token IDs and owns token embedding.
+- [ ] Middle/tail bypass token embedding and accept the named boundary bundle.
+- [ ] Non-tail emits the unnormalized architecture-defined residual/boundary before final norm/head and before tail-only row pruning.
+- [ ] Tail emits logits or token output through an explicit sampling contract.
+- [ ] Dense-Llama whole-model versus two-range prefill and greedy-decode parity passes the documented tolerance.
+- [ ] The adapter interface fails closed for uncertified architectures.
+
+### DGR-007: Add isolated concurrent local Hot KV State
+**Description:** As a client, I need concurrent Route Sessions to retain independent per-Shard cache so that one request cannot clear or corrupt another.
+
+**Acceptance Criteria:**
+- [ ] Map `(Route Session ID, route epoch)` to an isolated llama sequence or bounded context.
+- [ ] Allocate KV only for owned layers.
+- [ ] Support prefill append, decode append, truncate, release, TTL/LRU eviction, and explicit cache-miss response.
+- [ ] Reject stale epochs and incompatible cache recipes.
+- [ ] At least four concurrent sessions on a small model complete without token or KV cross-talk.
+- [ ] Cancellation/release of one session leaves other sessions intact and memory returns to the configured budget.
+
+### DGR-008: Build the standalone C++ gRPC Shard worker
+**Description:** As a node runtime, I need one supervised native process so that llama.cpp internals remain behind a stable project-owned protocol.
+
+**Acceptance Criteria:**
+- [ ] Worker exposes capability, health, session stream, release, cancellation, and metrics services from DGR-002.
+- [ ] Worker loads one exact Artifact/recipe/Shard identity and refuses mismatched requests.
+- [ ] Streaming path enforces bounded messages, flow control, deadlines, idempotency, and independent session cancellation.
+- [ ] Worker does not expose raw llama.cpp RPC or arbitrary GGML graph execution.
+- [ ] Graceful shutdown releases sessions; crash behavior is bounded and observable.
+- [ ] Python integration tests run against a fake model mode without model downloads.
+
+### DGR-009: Integrate the native worker with Meshnet
+**Description:** As the existing node service, I need a GGUF Shard backend adapter so that the Tracker, relay, billing, telemetry, and capability admission remain the sole control plane.
+
+**Acceptance Criteria:**
+- [ ] Implement the existing model-backend surface without changing Transformers behavior.
+- [ ] Registration carries exact validated GGUF recipe, Shard, backend and concurrency/KV capacity.
+- [ ] Tracker forms only complete compatible routes and keeps uncertified recipes dark.
+- [ ] Direct routes use gRPC streams; relayed routes carry the same versioned protobuf frames as opaque binary through the existing relay seam.
+- [ ] Existing request/work IDs, cancellation, Generation Telemetry, billing, and per-node attribution remain correlated.
+- [ ] No vLLM, Nakshatra, prima.cpp, or custom-engine control plane becomes a core dependency.
+
+### DGR-010: Pass local real-model two-process acceptance
+**Description:** As a release engineer, I need real local distributed parity before involving network variability.
+
+**Acceptance Criteria:**
+- [ ] Two local worker processes open disjoint dense-Llama ranges from the certified Artifact.
+- [ ] Prefill and at least 32 greedy decode tokens match whole-model llama.cpp within the certified tolerance.
+- [ ] Each worker retains only its own tensors and Hot KV State.
+- [ ] Four concurrent Route Sessions pass isolation and cleanup checks.
+- [ ] Report TTFT, prefill/decode throughput, seam bytes/latency, worker RSS/VRAM, KV memory, batch size, and queue time.
+- [ ] Killing one worker produces a bounded structured failure rather than a deadlock.
+
+### DGR-011: Pass a real heterogeneous two-machine route
+**Description:** As a consumer-hardware operator, I need two physical machines to execute one GGUF model so that the distributed claim is real.
+
+**Acceptance Criteria:**
+- [ ] Tracker selects two physical nodes with disjoint Shards and one exact certified recipe/compatibility class.
+- [ ] Actual CPU/GPU execution occurs on both nodes; synthetic workers do not satisfy acceptance.
+- [ ] Prefill/decode, concurrent-session isolation, telemetry, cancellation, and cleanup pass over the real transport/relay path.
+- [ ] Exact hardware, network, backend, model hash, route, commands, and raw metrics are recorded.
+- [ ] A model or recipe larger than one participating node's admitted memory is exercised when available.
+- [ ] Output drift is measured and incompatible mixed backends fail closed.
+
+### DGR-012: Implement continuous batching and bounded admission
+**Description:** As a node operator, I need active sessions batched safely so that concurrency increases aggregate throughput rather than serializing every request.
+
+**Acceptance Criteria:**
+- [ ] Node scheduler admits sessions against weight, KV, scratch, and queue budgets.
+- [ ] Compatible decode steps from multiple sessions form llama.cpp batches while preserving per-session positions and outputs.
+- [ ] Prefill does not starve decode; scheduling policy and bounds are explicit.
+- [ ] Backpressure prevents unbounded queued activations or KV growth.
+- [ ] Capability telemetry reports active sessions, queue depth, batch occupancy, KV pressure, prefill/decode rates, and rejected admissions.
+- [ ] Concurrency 1/2/4/8 benchmark identifies saturation and shows no cross-session corruption.
+
+### DGR-013: Harden failure, cancellation, and restart semantics
+**Description:** As a client, I need failures to be bounded and explicit so that distributed speed does not come with hanging or corrupted generations.
+
+**Acceptance Criteria:**
+- [ ] Deadlines and heartbeat/health loss terminate blocked stream operations.
+- [ ] Cancellation propagates across every Shard and releases local KV and queued buffers.
+- [ ] Duplicate steps are idempotent; uncertain mutations are never replayed silently.
+- [ ] Alpha failover restarts from token zero on a newly compatible route rather than importing unverified KV.
+- [ ] Worker death, stream reset, malformed bundle, stale epoch, and cache miss tests pass.
+- [ ] Billing/work records distinguish completed, cancelled, failed, and unverified work.
+
+### DGR-014: Enforce the GGUF-versus-safetensors release gate
+**Description:** As the product owner, I need an end-to-end comparison so that the native runtime ships only if it advances model access or performance.
+
+**Acceptance Criteria:**
+- [ ] Run current distributed safetensors and distributed GGUF routes on the same certified model/hardware/network scenario where technically comparable.
+- [ ] Report quality, TTFT, prefill/decode throughput, aggregate concurrency throughput, p95 latency, seam cost, memory, KV pressure, failures, and cleanup.
+- [ ] Evaluate against the DGR-001 performance contract without changing thresholds after seeing results.
+- [ ] Ship recommendation is one of: promote GGUF, optimize a measured bottleneck with a new bounded task, or stop the native track.
+- [ ] Results clearly separate quantization gains from transport/runtime gains.
+
+### DGR-015: Add and certify a Qwen3/Qwen3-MoE adapter
+**Description:** As a client seeking top models, I need a separately certified MoE-capable architecture after the dense runtime proves stable.
+
+**Acceptance Criteria:**
+- [ ] Implement explicit tensor ownership, router/top-k, expert/shared-expert, Q/K normalization, boundary bundle, and cache semantics for the selected Qwen3 family recipe.
+- [ ] Do not reuse the dense-Llama adapter through unchecked name substitutions.
+- [ ] Whole-model versus distributed prefill/decode parity passes the architecture-specific tolerance.
+- [ ] Expert memory ownership and communication are measured.
+- [ ] Real consumer-hardware acceptance and capability admission pass before the recipe becomes routable.
+
+### DGR-016: Produce the upstream llama.cpp collaboration package
+**Description:** As a maintainer, I need narrow upstreamable proposals so that our patch burden can shrink without asking llama.cpp to own Meshnet networking.
+
+**Acceptance Criteria:**
+- [ ] Separate generic llama.cpp hooks from Meshnet protocol/control-plane code.
+- [ ] Prepare minimal reproducible examples and tests for range-aware loading, boundary input/output, and layer-filtered KV.
+- [ ] Compare the proposal with Nakshatra and prima.cpp evidence and explain why the API is generally useful.
+- [ ] Preserve one scoped commit/patch per concern against the exact upstream pin.
+- [ ] Produce an outreach document suitable for Georgi/llama.cpp maintainers; actual sending remains a human action.
+
+## Functional Requirements
+
+1. The public distributed primitive is an ordered Inference Route of contiguous Shards.
+2. The native runtime uses llama.cpp/GGML; vLLM remains optional as a complete managed provider.
+3. Native worker communication uses gRPC/HTTP2 and Protocol Buffers with one stable stream per Route Session Activation Seam.
+4. Artifact identity, runtime recipe, boundary schema, activation dtype and cache layout must match exactly before routing.
+5. Hot KV State remains local to the node serving the Shard.
+6. Multiple Route Sessions must execute concurrently without shared-cache corruption.
+7. Nodes batch compatible active decode steps and enforce bounded admission/backpressure.
+8. Unsupported architectures and hardware recipes remain non-routable until real certification passes.
+9. Default tests never download models or require GPUs; real tests are explicit and preserve artifacts off `/home`.
+10. The release decision is based on measured performance, fit, quality, concurrency, and reliability relative to the safetensors baseline.
+
+## Non-Goals
+
+- Forking vLLM or importing its PagedAttention/Torch distributed runtime.
+- Adopting Nakshatra, prima.cpp, llama-gguf, LiGGUF, or GPUStack as the control plane.
+- Public WAN tensor/expert parallel collectives.
+- QUIC, WebRTC, or a custom socket protocol.
+- Automatic KV migration or mid-generation route repair in the first release.
+- Speculative decoding or disaggregated prefill before the core release gate.
+- Supporting every GGUF architecture before dense Llama and Qwen3-family certification.
+- A marketing-scale model demo that bypasses parity, concurrency, admission, or performance gates.
+
+## Success Metrics
+
+- A real model larger than one admitted node can execute across consumer machines when suitable hardware/artifacts are available.
+- Four or more concurrent sessions complete without cross-talk; hardware-specific saturation is measured.
+- Distributed GGUF passes the locked performance/fit contract against the existing safetensors route.
+- Worker and Tracker recover all resources after completion, cancellation, malformed input, and node failure.
+- The critical runtime remains Meshnet plus one standalone worker and a small auditable llama.cpp patch stack.
+
+## Open Questions
+
+- Exact benchmark model and quantization lanes are selected by DGR-001 from currently supported, legally redistributable artifacts.
+- Final hardware-specific concurrency and useful-speed thresholds are locked by measured baselines rather than guessed globally.
+- Upstream llama.cpp acceptance is desirable but not a prerequisite for the first narrow pinned fork.

.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md

@@ -0,0 +1,309 @@
+# Ralph execution context: Performant Concurrent Distributed GGUF Runtime
+
+Status: authoritative context for every fresh Ralph iteration
+Last updated: 2026-07-13
+
+## Mandatory startup sequence
+
+Before changing code, every Ralph agent must:
+
+1. Read this file completely.
+2. Read the selected issue under `.scratch/distributed-gguf-runtime/issues/`.
+3. Read `.scratch/distributed-gguf-runtime/ADR-0020-distributed-gguf-runtime.md` and the relevant part of `architecture.md`.
+4. Read `.claude/memory/MEMORY.md` and root `CONTEXT.md` for current project vocabulary and constraints.
+5. Inspect the current implementation and tests; do not assume historical scratch text describes live code.
+6. Read the evidence/handoff directories for every declared dependency.
+7. Inspect `git status` and preserve all pre-existing working-tree changes.
+
+A fresh Ralph iteration has no conversational memory. These files are the context contract.
+
+## Story sizing and interruption rule
+
+Each story is intended to fit one focused Ralph context. Before implementation, estimate whether every acceptance criterion can be completed and verified in the current iteration.
+
+If the story is too large, an external dependency is unavailable, or the context/provider limit prevents completion:
+
+- Do not weaken criteria.
+- Do not mark the issue done or set `passes: true`.
+- Avoid leaving an unverified cross-cutting partial implementation when a smaller safe spike is possible.
+- Write `evidence/<TASK-ID>/DECOMPOSITION.md` or `BLOCKED.md` with the exact blocker, current verified state, proposed child stories, dependency graph and rollback/continuation instructions.
+- Stop for supervised review.
+
+If interrupted after code changes, record every changed file, command result and unresolved invariant so the next fresh loop can verify rather than guess.
+
+## Product objective
+
+Build performant, concurrent distributed inference that combines consumer machines to serve top open models that exceed one node's RAM/VRAM.
+
+A distributed demo is not success. The product must provide:
+
+- Useful measured prefill and decode speed.
+- Multiple concurrent Route Sessions.
+- No KV/token cross-talk.
+- Bounded memory, queues, cancellation and failures.
+- Real execution on every participating node.
+- A model-fit or performance advantage over the current Transformers/safetensors route.
+
+## Critical-path architecture
+
+```text
+Existing Meshnet control plane
+        |
+Versioned Protobuf over gRPC/HTTP2
+        |
+Project-owned standalone C++ Shard worker
+        |
+Small exact-commit llama.cpp patch stack
+```
+
+Meshnet remains the only control plane and owns:
+
+- Tracker registration, Coverage Map, route selection and route epochs.
+- Route Sessions and Activation Seams.
+- Direct/relay routing.
+- Capability admission.
+- Cancellation, Generation Telemetry and backpressure.
+- Billing, validation and per-node work attribution.
+
+Do not introduce another scheduler/control plane from vLLM, Nakshatra, prima.cpp, llama-gguf, GPUStack or another project.
+
+## Runtime decisions that are not open
+
+1. Public-network Shards are contiguous transformer layer ranges.
+2. llama.cpp/GGML is the native GGUF execution substrate.
+3. The project owns a small standalone worker and a narrow pinned llama.cpp patch stack.
+4. The native Shard protocol is Protocol Buffers over gRPC/HTTP2.
+5. One long-lived bidirectional stream serves one Route Session Activation Seam.
+6. The public activation boundary is a versioned named-tensor bundle.
+7. Hot KV State remains local to the node serving the Shard.
+8. `(Route Session ID, route epoch)` maps to an isolated llama sequence or bounded context.
+9. Concurrency uses continuous batching of compatible active sessions inside each node.
+10. Transformers/safetensors remains the correctness and performance baseline.
+11. vLLM may be an optional complete managed provider and concept donor; it is not forked into public Shards.
+12. Tensor/expert collectives are deferred to a trusted composite provider, not public WAN routes.
+13. Unsupported architectures/backends remain registered-but-dark until real certification passes.
+14. Alpha failure retries from token zero; unverified KV is never migrated silently.
+15. Model artifacts must remain on mounted-drive storage and never under `/home`.
+
+Changing one of these requires an explicit ADR update and human review, not an incidental story implementation.
+
+## Performance discipline
+
+GGUF performance is a hypothesis. Never write “GGUF is faster” without measurements.
+
+DGR-001 locks controlled benchmark lanes and thresholds. DGR-014 enforces the final distributed comparison.
+
+Always distinguish:
+
+- Weight quantization from activation/compute/KV dtype.
+- Runtime/kernel gains from quantization/model-fit gains.
+- Single-request latency from aggregate concurrency throughput.
+- Synthetic unit coverage from real distributed acceptance.
+
+Required metrics where applicable:
+
+```text
+TTFT
+prefill tokens/sec
+decode tokens/sec
+aggregate throughput
+p50/p95 latency
+seam bytes and latency
+queue and batch occupancy
+RSS and VRAM
+KV pressure
+output-quality drift
+failures and cleanup
+```
+
+Do not weaken or move performance thresholds after seeing implementation results.
+
+## Transport discipline
+
+Do not invent a raw TCP protocol, new WebSocket protocol, QUIC layer or bespoke binary control format.
+
+The `.proto` schema is the semantic contract. Direct transport uses gRPC. Existing relay infrastructure may carry the same serialized protobuf frames as opaque binary.
+
+Protocol requirements:
+
+- Schema/version negotiation.
+- Request/work ID.
+- Route Session ID and route epoch.
+- Exact Model Artifact/runtime recipe fingerprint.
+- Shard range and effective overlap-safe start.
+- Prefill/decode/release/cancel phases.
+- Position/token range and idempotency step.
+- Named tensors with shape, dtype, byte order and bounded fragments.
+- Compression/checksum.
+- Cache expectation/result.
+- Deadlines, cancellation, flow control and structured status.
+
+Avoid per-token channel creation and unbounded unary payloads. Generated code and build tooling must be reproducible; do not require manual copying.
+
+## Native runtime discipline
+
+Reuse llama.cpp for GGUF, mmap, kernels, architecture graphs, tokenizer, KV, sequences and heterogeneous backends.
+
+The project patch stack is limited to:
+
+- Range-aware tensor registration/loading.
+- Endpoint-specific embedding/final head ownership.
+- Architecture-defined intermediate input/output.
+- Intermediate output before final norm/head.
+- Layer-filtered KV and session mapping.
+
+Do not place Meshnet routing, transport, billing or authentication inside llama.cpp. Keep patches numbered, scoped, pinned and upstreamable.
+
+Dense Llama-family is first. Qwen3/Qwen3-MoE is a separate adapter after the dense release gate. Do not generalize through unchecked tensor-name substitutions.
+
+## Existing code seams to inspect first
+
+- `packages/node/meshnet_node/model_backend.py` — backend abstraction.
+- `packages/node/meshnet_node/torch_server.py` — reference ranged execution and session behavior.
+- `packages/node/meshnet_node/activation_compression.py` — current activation framing/compression.
+- `packages/node/meshnet_node/route_session_benchmark.py` — existing benchmark infrastructure.
+- `packages/tracker/meshnet_tracker/server.py` — registration, route and proxy behavior.
+- `packages/tracker/meshnet_tracker/capability.py` — fail-closed capability admission.
+- `tests/test_real_model_backend.py` — real backend coverage.
+- `tests/test_tracker_routing.py` — route/session behavior.
+- `tests/test_tracker_capability_admission.py` — recipe admission.
+- `tests/test_route_session_benchmark.py` and `tests/test_manual_route_benchmark.py` — benchmark patterns.
+- `docs/adr/0008-binary-activation-wire-format.md` — existing wire compatibility.
+- `docs/adr/0012-start-layer-overlapping-shards.md` — effective start semantics.
+- `docs/adr/0022-sharded-per-node-kv-cache.md` — Hot KV State contract.
+- `docs/adr/0023-model-agnostic-node-capability-admission.md` — certification/admission.
+
+Do not edit generated `build/`, `__pycache__`, egg-info, Ralph logs or unrelated scratch features.
+
+## Planned source layout
+
+Use these paths unless current code inspection proves a better project-consistent location. If changed, document the reason in task evidence.
+
+```text
+packages/node/native/
+  proto/shard_runtime.proto
+  cmake/
+  llama/
+    UPSTREAM_COMMIT
+    patches/
+  gguf_worker/
+  tests/
+
+packages/node/meshnet_node/
+  native_protocol/
+  gguf_backend.py
+  runtime_recipe.py
+
+.scratch/distributed-gguf-runtime/evidence/<TASK-ID>/
+  README.md
+  commands.txt
+  results.json or other machine-readable evidence
+```
+
+Generated protobuf/C++ build outputs belong in build directories unless packaging explicitly requires checked-in generated Python modules. The story must document the generation command and version.
+
+## Story output map
+
+| Story | Required durable outputs |
+|---|---|
+| DGR-001 | benchmark harness/tests; `evidence/DGR-001/performance-contract.json`; raw/summary benchmark evidence |
+| DGR-002 | `packages/node/native/proto/shard_runtime.proto`; reproducible Python/C++ generation/build wiring; protocol round-trip/compatibility tests; `evidence/DGR-002/` |
+| DGR-003 | exact runtime-recipe/fingerprint implementation and admission tests; `evidence/DGR-003/` |
+| DGR-004 | exact upstream pin, numbered patch series, reproducible fetch/apply/build smoke; `evidence/DGR-004/` |
+| DGR-005 | dense-Llama range ownership loader and memory evidence; `evidence/DGR-005/` |
+| DGR-006 | architecture boundary adapter/parity tests and results; `evidence/DGR-006/` |
+| DGR-007 | concurrent session/KV manager, isolation/cleanup tests; `evidence/DGR-007/` |
+| DGR-008 | standalone C++ gRPC worker, fake-model integration tests, lifecycle evidence; `evidence/DGR-008/` |
+| DGR-009 | Meshnet backend/registration/relay integration and tests; `evidence/DGR-009/` |
+| DGR-010 | real local two-process commands, raw metrics and parity report; `evidence/DGR-010/` |
+| DGR-011 | two-machine configuration, commands, hardware/network manifest and raw results; `evidence/DGR-011/` |
+| DGR-012 | continuous scheduler/admission implementation and 1/2/4/8 concurrency report; `evidence/DGR-012/` |
+| DGR-013 | failure/cancel/restart test matrix and resource-cleanup evidence; `evidence/DGR-013/` |
+| DGR-014 | immutable final comparison against DGR-001 thresholds and ship/stop recommendation; `evidence/DGR-014/` |
+| DGR-015 | Qwen3-family adapter, architecture-specific parity/admission/performance evidence; `evidence/DGR-015/` |
+| DGR-016 | narrow upstream patches/tests, design note and human-ready outreach package; `evidence/DGR-016/` |
+
+## Dependency handoff rule
+
+For every dependency listed by Ralph:
+
+1. Confirm its `passes` state in `prd.json`.
+2. Read `.scratch/distributed-gguf-runtime/evidence/<DEPENDENCY-ID>/README.md`.
+3. Verify referenced source paths and commands still exist.
+4. Do not repeat completed work unless verification exposes a concrete defect.
+5. If dependency evidence is missing or contradictory, stop and repair the dependency instead of guessing.
+
+## Testing and hardware rules
+
+Default tests must be deterministic, GPU-free, model-download-free and API-credit-free.
+
+Real model tests require:
+
+```text
+MESHNET_ENABLE_REAL_INFERENCE_TESTS=1
+```
+
+On this machine:
+
+- Use `.venv-rocm` for real Radeon 8060S ROCm execution.
+- The default Python 3.14 `.venv` is unsuitable for real ROCm inference.
+- Resolve model storage through the machine-specific `.env.<hostname>` configuration.
+- Never download model artifacts under `/home`.
+- Real acceptance must exercise actual Tracker-routed CPU/GPU computation; synthetic workers are only unit tests.
+
+Record exact:
+
+- Model/revision and Artifact hash.
+- Quantization and runtime recipe.
+- Host/hardware/backend/driver.
+- Commands and environment names without secrets.
+- Raw output and metrics.
+- Whether the evidence is synthetic, local-real, or multi-machine-real.
+
+## Worktree and commit discipline
+
+This repository may contain pre-existing changes from research or another feature.
+
+- Inspect `git status` before editing.
+- Never reset, checkout over, stash, delete or reformat unrelated changes.
+- Stage only files belonging to the selected story.
+- Exclude `.ralph-tui`, iteration logs, caches, generated builds, FUSE artifacts and unrelated scratch work.
+- Keep one scoped commit per completed story when the supervising loop requests commits.
+- Do not modify `passes` for another story.
+
+## Mandatory finish/handoff sequence
+
+Before emitting `<promise>COMPLETE</promise>`:
+
+1. Verify every acceptance criterion with real command output or file evidence.
+2. Run story-specific gates and repository quality gates.
+3. Write `.scratch/distributed-gguf-runtime/evidence/<TASK-ID>/README.md` containing:
+   - Summary of changes.
+   - Exact files changed.
+   - Commands run and their real results.
+   - Performance/correctness evidence.
+   - Known limitations and deferred work.
+   - Compatibility or migration notes.
+   - Clear handoff for dependent stories.
+4. Save machine-readable evidence beside it when the story produces metrics or schemas.
+5. Update the source issue status to `done` only after all gates pass.
+6. Preserve failures honestly. Never fabricate model, benchmark, test or hardware output.
+
+## Authoritative references
+
+Active decisions:
+
+- `.scratch/distributed-gguf-runtime/README.md`
+- `.scratch/distributed-gguf-runtime/implementation-strategy.md`
+- `.scratch/distributed-gguf-runtime/architecture.md`
+- `.scratch/distributed-gguf-runtime/ADR-0020-distributed-gguf-runtime.md`
+- `.scratch/distributed-gguf-runtime/PRD.md`
+- `.scratch/distributed-gguf-runtime/prd.json`
+
+Source research:
+
+- `docs/research/distributed-gguf-landscape.md`
+- `docs/research/distributed-gguf-github-followup.md`
+- `docs/research/vllm-distributed-gguf-assessment.md`
+
+If historical notes conflict with these files, the active decisions above win.

.scratch/distributed-gguf-runtime/README.md

@@ -0,0 +1,46 @@
+# Performant concurrent distributed GGUF runtime
+
+Status: active benchmark-gated implementation program.
+
+## Objective
+
+Serve top open models across consumer machines with useful performance and concurrent Route Sessions while keeping the runtime lean.
+
+## Critical path
+
+```text
+Meshnet control plane
+  -> versioned gRPC/Protobuf Shard protocol
+  -> project-owned standalone C++ worker
+  -> small pinned llama.cpp patch stack
+```
+
+Transformers/safetensors remains the correctness baseline. vLLM remains an optional complete managed provider and a design donor; it is not forked into the public mesh.
+
+## Planning artifacts
+
+- **[Mandatory Ralph context](RALPH-CONTEXT.md)** — read first in every fresh iteration
+- [Task evidence contract](evidence/README.md)
+- [Implementation strategy](implementation-strategy.md)
+- [Current architecture](architecture.md)
+- [PRD](PRD.md)
+- [Ralph backlog](prd.json)
+- [ADR-0020](ADR-0020-distributed-gguf-runtime.md)
+- [Milestones](milestones.md)
+- [Issues](issues/)
+- [Distributed GGUF research](../../docs/research/distributed-gguf-landscape.md)
+- [GitHub follow-up](../../docs/research/distributed-gguf-github-followup.md)
+- [vLLM assessment](../../docs/research/vllm-distributed-gguf-assessment.md)
+
+## Ralph execution
+
+Use supervised one-story iterations for this high-risk runtime:
+
+```bash
+ralph-tui run \
+  --prd .scratch/distributed-gguf-runtime/prd.json \
+  --agent claude --model opus \
+  --iterations 1 --no-tui --no-setup --verify
+```
+
+Inspect the diff, run the story gates, and commit one verified story before the next iteration. Real-model stories require the explicit environment gate and mounted-drive model storage.

.scratch/distributed-gguf-runtime/architecture.md

@@ -0,0 +1,259 @@
+# Performant Concurrent Distributed GGUF Architecture
+
+Status: current target architecture
+Last updated: 2026-07-13
+
+## Product invariant
+
+The system exists to serve high-quality models that exceed one consumer node's memory while retaining useful interactive speed and aggregate concurrency. A feature that only produces a distributed demo but is slower, globally serialized, or impossible to operate on consumer hardware is not complete.
+
+## Existing control plane
+
+Meshnet remains the only public control plane:
+
+- Tracker registration, Coverage Map, route scoring and assignment.
+- Contiguous Shards and overlap-safe effective starts.
+- Stable Route Sessions and route epochs.
+- Local per-Shard Hot KV State in the reference backend.
+- Direct/relay transport, cancellation and backpressure.
+- Generation Telemetry, billing, validation and per-node attribution.
+- Model-agnostic capability admission.
+
+No external engine replaces these responsibilities.
+
+## Runtime topology
+
+```text
+OpenAI-compatible client
+        |
+Gateway / Tracker Node
+        |
+ordered Inference Route
+        |
+        +-- head Shard: tokenizer/embedding + early layers
+        |       local weights and Hot KV State
+        |
+        +-- middle Shard(s): architecture boundary + owned layers
+        |       local weights and Hot KV State
+        |
+        +-- tail Shard: final layers + norm/head/sampling
+                local weights and Hot KV State
+```
+
+Weights never move in the per-request hot path. Every node opens and verifies its local Model Artifact before becoming routable.
+
+## Primary execution substrate
+
+```text
+project-owned C++ Shard worker
+        |
+small exact-commit llama.cpp patch stack
+        |
+GGUF mmap, quantized kernels, architecture graphs,
+KV/sequence operations, CPU/CUDA/HIP/Vulkan/Metal backends
+```
+
+The patch stack adds only the missing local execution seam:
+
+1. Range-aware tensor registration/loading.
+2. Endpoint-specific embedding and final head ownership.
+3. Architecture-defined intermediate input.
+4. Architecture-defined pre-tail boundary output.
+5. Layer-filtered KV and external session mapping.
+
+The worker owns protocol translation and process lifecycle. llama.cpp never receives Tracker, relay, billing or volunteer-network code.
+
+## Shard data plane
+
+Use Protocol Buffers and gRPC over HTTP/2.
+
+### Service shape
+
+- Unary capability and health.
+- Bidirectional Route Session stream.
+- Explicit release and cancellation.
+- Metrics suitable for capability admission and route scoring.
+
+### Session stream
+
+One long-lived stream represents one Route Session Activation Seam. It amortizes connection setup and inherits HTTP/2 flow control. Every message carries enough identity to reject stale or incompatible work.
+
+```text
+schema version
+request/work id
+Route Session id
+route epoch
+Model Artifact hash
+runtime recipe fingerprint
+Shard begin/end and effective start
+prefill/decode/release/cancel phase
+position and token range
+idempotency step id
+cache expectation/result
+named tensor bundle
+compression/checksum
+```
+
+Prefill tensors are split into bounded ordered frames. Decode messages carry one-step architecture boundary bundles and remain small.
+
+Direct nodes use gRPC. Nodes requiring the existing relay carry the same protobuf frames as opaque binary through the relay session. This preserves one semantic protocol instead of maintaining separate direct and relay payload contracts.
+
+## Architecture boundary
+
+The public boundary is a versioned named-tensor bundle:
+
+```text
+bundle schema/version
+architecture adapter and boundary point
+named tensors
+per-tensor shape, dtype and byte order
+payload fragments
+compression/checksum
+```
+
+Dense Llama may use one residual tensor. Other adapters may require more. vLLM's Llama and Qwen3-MoE PP paths demonstrate a boundary with both `hidden_states` and `residual`; therefore the generic protocol must not assume one anonymous tensor.
+
+Only the head owns token embedding. Only the tail owns final normalization, LM head and sampling. Middle Shards exchange the architecture-defined pre-tail boundary, not final normalized embeddings.
+
+## Hot KV State and concurrency
+
+```text
+(Route Session id, route epoch)
+       -> local llama sequence or bounded context
+       -> KV for owned layers only
+       -> lease, memory accounting and lifecycle
+```
+
+Required operations:
+
+- Prefill append.
+- Decode append.
+- Truncate after rejected speculative positions if later enabled.
+- Explicit release.
+- TTL/LRU eviction.
+- Cache-miss response.
+- Stale-epoch rejection.
+
+A node must not clear global KV on a new stream or serialize all requests behind one logical serving sequence.
+
+## Continuous batching
+
+Autoregressive dependencies remain sequential inside one Route Session. Aggregate throughput comes from batching compatible decode steps across active sessions:
+
+```text
+time 0: session A token 1 + session B token 8 + session C token 3
+          -> one llama batch for this Shard
+
+time 1: next ready positions from active sessions
+          -> next llama batch
+```
+
+The node scheduler:
+
+- Admits work against weight, KV, scratch and queue budgets.
+- Keeps per-session token positions and outputs separate.
+- Prevents long prefill from starving decode.
+- Applies bounded backpressure.
+- Reports active sessions, queue depth, batch occupancy, KV pressure and throughput.
+
+The initial deterministic gate is four concurrent sessions on a small model without cross-talk. Hardware-specific limits are measured and advertised through capability admission.
+
+## Parallelism boundaries
+
+| Mechanism | First-runtime use |
+|---|---|
+| Layer/pipeline parallelism | Public Inference Route across contiguous Shards |
+| Continuous batching | Inside every node across active Route Sessions |
+| Data parallelism | Multiple complete routes for independent requests |
+| Tensor parallelism | Deferred to a trusted composite node/managed cluster |
+| Expert parallelism | Deferred to a trusted composite node/managed cluster |
+| Disaggregated prefill | Deferred until core route performance passes |
+| Speculative decoding | Deferred optimization |
+
+Public WAN tensor/expert collectives are rejected for the first runtime because their per-layer communication and static rank assumptions conflict with heterogeneous volunteer nodes.
+
+## Optional providers
+
+### Transformers/safetensors
+
+Remains:
+
+- Correctness/reference backend.
+- Fallback for unsupported architectures.
+- Baseline for performance and output quality.
+
+### vLLM
+
+May run unmodified as a complete model or managed TP/PP/EP cluster represented as one logical provider. Its internal ranks are not independently routed or rewarded.
+
+Borrow only concepts such as named bundles, continuous batching, typed compatibility fingerprints, explicit transfer lifecycle and load telemetry.
+
+### Whole-model llama.cpp
+
+Provides a local proxy backend, correctness oracle and performance baseline. It is not the native distributed milestone.
+
+## Artifact and recipe compatibility
+
+A routable recipe identifies separately:
+
+- Source Model Artifact hash and optional derivative/slice hash.
+- Architecture and adapter version.
+- Tokenizer revision and vocabulary.
+- Weight quantization.
+- Activation interchange dtype/schema.
+- Backend compute dtype and backend implementation.
+- KV dtype/layout.
+- RoPE/context parameters.
+- llama.cpp commit and project patch version.
+- Shard range and endpoint ownership.
+
+Compatibility fails closed. Similar quantization labels or model names are not enough.
+
+## Admission and failure
+
+A recipe becomes routable only after a real local and distributed forward passes. Synthetic tests remain unit coverage.
+
+Alpha failure behavior:
+
+- Deadline or node loss cancels the Route Session.
+- Every node releases KV and queued buffers.
+- Uncertain mutations are not replayed silently.
+- Retry starts from token zero on a newly compatible route.
+- No cross-node KV import is trusted until a later signed/compatible snapshot protocol exists.
+
+## Performance release contract
+
+Before native development proceeds, compare the current Transformers/safetensors backend with whole-model llama.cpp under controlled model/hardware/quality lanes.
+
+Final release compares distributed GGUF with distributed safetensors using thresholds locked before seeing final results.
+
+Required measurements:
+
+- TTFT.
+- Prefill and decode tokens/sec.
+- Aggregate concurrency throughput.
+- p50/p95 latency.
+- Seam bytes and latency.
+- Queue/batch occupancy.
+- RSS, VRAM and KV pressure.
+- Output-quality drift.
+- Cancellation/failure cleanup.
+
+The GGUF path ships only if it is faster at acceptable quality or enables a larger otherwise-unroutable model at useful measured speed.
+
+## Implementation sequence
+
+1. Lock benchmark/performance contract.
+2. Define gRPC/protobuf and exact recipe identity.
+3. Pin llama.cpp and create the minimal patch stack.
+4. Implement dense-Llama range loading and boundary parity.
+5. Implement concurrent local KV.
+6. Build and integrate the standalone worker.
+7. Pass local two-process real-model acceptance.
+8. Pass real heterogeneous two-machine acceptance.
+9. Add continuous batching and failure hardening.
+10. Enforce the GGUF-versus-safetensors release gate.
+11. Add Qwen3/Qwen3-MoE as a separately certified adapter.
+12. Prepare narrow upstream collaboration patches/tests.
+
+See [the Ralph backlog](prd.json) and [implementation strategy](implementation-strategy.md).

.scratch/distributed-gguf-runtime/decision-framework.md

@@ -0,0 +1,270 @@
+# Distributed GGUF Decision Framework
+
+> **Superseded for active implementation decisions.** The grill was resolved on 2026-07-13. Use [implementation-strategy.md](implementation-strategy.md), [architecture.md](architecture.md), [ADR-0020](ADR-0020-distributed-gguf-runtime.md), and [prd.json](prd.json). This file remains as historical decision rationale.
+
+This framework is for grilling open decisions. It keeps decisions tied to project vocabulary and implementation gates instead of vague "distributed inference" language.
+
+## Core Vocabulary
+
+Use the existing domain terms this way:
+
+- **Shard**: contiguous transformer layer range. This is the compute, routing, cache, and reward unit.
+- **Shard Swarm**: storage/download group for artifacts needed by a shard.
+- **Inference Route**: ordered node sequence that covers all layers for one request.
+- **Route Session**: one active request bound to one inference route and stable session id.
+- **Hot KV State**: live per-shard cache held by the route node during a route session.
+- **Prefix Snapshot**: persisted route-session state used for reuse or failover, not the hot decode path.
+- **Artifact Manifest**: canonical mapping from model artifacts to semantic model parts and runtime support.
+- **Generation Telemetry**: realtime progress for a route session, including phase and tokens/sec, independent of whether token deltas are streamed.
+
+## The Five Planes
+
+### 1. Control Plane
+
+Owner: Tracker.
+
+Responsibilities:
+
+- node registry
+- coverage map
+- route selection
+- rebalance directives
+- route-session creation
+- health and telemetry
+- client-visible Generation Telemetry
+- billing/audit records
+
+Must not do:
+
+- serve hot KV during every token
+- become the only place model artifacts can be fetched
+
+### 2. Artifact Plane
+
+Owner: Shard Swarms, local node storage, optional CDN/bootstrap mirrors.
+
+Responsibilities:
+
+- GGUF/safetensors/tokenizer download
+- content-addressed verification
+- local artifact inventory
+- artifact-to-layer mapping
+- cache eviction
+
+Must not do:
+
+- define execution order by file split alone
+- imply that a downloaded file chunk equals a Shard
+
+### 3. Execution Plane
+
+Owner: active Inference Route.
+
+Responsibilities:
+
+- chunked prefill
+- one-step decode
+- hidden-state transfer across activation seams
+- start-layer handling for overlapping shards
+- backpressure
+
+Must not do:
+
+- resend full context activations during decode
+- require cross-node tensor parallel all-reduce for public v1
+
+### 4. Session State Plane
+
+Owner: route nodes for hot KV; cache servers only for snapshots.
+
+Responsibilities:
+
+- per-shard local KV ownership
+- cache allocation and eviction
+- cache ABI compatibility
+- session close/release
+- optional prefix snapshots
+
+Must not do:
+
+- centralize hot KV in a remote service
+- let a replacement node continue from incompatible state
+
+### 5. Economics And Trust Plane
+
+Owner: tracker plus settlement/validation components.
+
+Responsibilities:
+
+- distinguish storage/seeding work from inference work
+- account for prefill and decode separately
+- record route participation
+- sample validation events
+- slash proven fraud
+
+Must not do:
+
+- pay a node for merely holding files as if it generated tokens
+- hide public-swarm privacy limits from clients
+
+## Hard Invariants
+
+These are the framework rules unless we deliberately write a new ADR:
+
+1. Public-network Shards are contiguous layer ranges.
+2. Hot KV State is local to the node serving that Shard in that Route Session.
+3. Artifact distribution and route execution are separate systems.
+4. Decode seam payload must be `O(hidden_size)`.
+5. Prefill may be `O(sequence_length * hidden_size)`, but only in bounded chunks.
+6. The tracker chooses routes; nodes do not negotiate route topology peer-to-peer.
+7. Model/backend-specific cache internals stay behind backend capability reports.
+8. PyTorch remains the correctness/reference backend while llama.cpp/GGUF becomes the performance backend.
+9. Streaming responses are preferred when feasible; Generation Telemetry is always required.
+
+## Resolved Gates
+
+### Gate 1: Public Shard Semantics
+
+Decision: public-network Shards are contiguous transformer layer ranges. Tensor-parallel or ring-style execution is allowed only inside one trusted node, one colocated pod, or a future composite node abstraction.
+
+Rationale:
+
+- Layer ranges match the existing `Shard`, `Coverage Map`, `Inference Route`, billing, and fraud vocabulary.
+- Public volunteer nodes should not require cross-node all-reduce or tight per-layer synchronization in v1.
+- Existing projects such as prima.cpp and Distributed Llama can still inform local-cluster/backend execution without becoming the public routing primitive.
+
+Consequences:
+
+- Artifact Manifests must map files/tensors to semantic layer ranges.
+- Route selection remains ordered layer coverage.
+- Rewards can be attributed to layer-range work.
+- Hot KV State is naturally owned by the node serving that layer range for the Route Session.
+
+### Gate 2: Hot KV Strategy
+
+Decision: v1 rejects centralized hot KV. Hot KV State is local to the node serving the relevant Shard in the active Route Session. Cache servers may store Prefix Snapshots for reuse, retry, or failover, but they are not in the per-token decode path.
+
+Rationale:
+
+- Decode is the tight loop; adding remote cache I/O there makes latency and bandwidth worse at the worst point.
+- Local KV naturally follows layer-range Shard ownership.
+- Centralized hot KV increases privacy exposure and creates consistency problems.
+- Prefix Snapshots preserve the useful part of central storage without making it mandatory for every generated token.
+
+Consequences:
+
+- Route Session must be sticky.
+- Failover is limited in alpha unless a compatible Prefix Snapshot exists.
+- Cache servers are optimization infrastructure, not required runtime infrastructure.
+- Route repair requires compatible model revision, layer range, backend cache ABI, and snapshot position.
+
+### Gate 3: First Runtime Proof
+
+Decision: prove distributed Route Session and Hot KV State semantics in the existing PyTorch route before modifying llama.cpp/GGUF.
+
+Rationale:
+
+- PyTorch exposes model internals and cache objects more directly, so it is the fastest way to validate the distributed protocol.
+- The current distributed PyTorch route already has the right high-level shape but disables cache and recomputes full prompts.
+- Fixing that path gives us a reference implementation for correctness tests, telemetry, session lifecycle, and wire protocol behavior.
+- llama.cpp/GGUF should receive a clear target ABI rather than becoming both the protocol experiment and the performance backend at once.
+
+Consequences:
+
+- Issue 02 precedes issue 05.
+- llama.cpp collaboration has a concrete target ABI.
+- The PyTorch route remains the architecture-coverage/reference backend even after GGUF becomes the preferred performance path.
+- The first success metric is eliminating full-prompt recompute in distributed decode.
+
+### Gate 3A: Client Feedback During Latency
+
+Decision: streaming responses are preferred when feasible, and realtime Generation Telemetry is required regardless of streaming support.
+
+Rationale:
+
+- The product optimizes for access to large capable models, so some latency is acceptable.
+- Users still need confidence that the route is alive and roughly how fast it is generating.
+- Streaming token deltas give the best user experience when the backend exposes them cleanly.
+- Tokens/sec remains useful during prefill, queueing, and any backend that cannot stream token deltas.
+
+Consequences:
+
+- The gateway should stream token deltas through an OpenAI-compatible response when possible.
+- The gateway must expose progress through SSE, WebSocket, or polling.
+- The final answer can be delivered after completion only as a fallback.
+- Telemetry must include route phase, generated token count, and rolling tokens/sec.
+- Non-streaming clients still need realtime telemetry.
+
+### Gate 4: llama.cpp Collaboration Shape
+
+Decision: target upstreamable `libllama`/ggml hooks instead of planning around a permanent fork.
+
+Rationale:
+
+- llama.cpp changes quickly across model support, quantization, kernels, and hardware backends.
+- A permanent fork would become expensive to maintain and would lag upstream improvements.
+- A short-lived prototype branch is acceptable if it proves the API and makes upstream collaboration concrete.
+- Keeping tracker/routing logic outside llama.cpp makes the upstream ask smaller and cleaner.
+
+Consequences:
+
+- Need a minimal reproducible localhost demo before asking upstream to carry the design.
+- Need to separate "what llama.cpp should expose" from "what our tracker does".
+- Desired upstream surface is layer-range execution, hidden-state boundary I/O, partial loading/introspection, and per-session KV ownership.
+- If upstream rejects the shape, we revisit whether to carry a narrow adapter fork or keep GGUF distributed execution as experimental.
+
+### Gate 5: First Model Target
+
+Decision: use a two-tier model target. Use a small, boring, llama.cpp-supported GGUF model for the first protocol smoke test. Use `deepseek-ai/DeepSeek-V4-Flash` as the first serious large-model target. Keep GLM-5.2 and Ornith as later support audits.
+
+Rationale:
+
+- The first protocol proof should isolate route/session/KV bugs from model-architecture bugs.
+- DeepSeek-V4-Flash is a strong first serious target because it is much smaller than 1.6T-class models while still being large enough to validate the product thesis.
+- DeepSeek-V4-Flash still has architecture-specific risks, so it should not be the first smoke test.
+- GLM-5.2 and Ornith remain valuable targets, but they add DSA/MLA/hybrid attention uncertainty.
+
+Consequences:
+
+- 128K cache accounting can be modeled now.
+- The first "real" target-model audit is DeepSeek-V4-Flash support in PyTorch, vLLM/SGLang, and any available GGUF/llama.cpp quantization path.
+- Production support waits for backend capability reports and exact cache ABI support.
+
+### Gate 6: Failure Semantics
+
+Decision: alpha fails Route Sessions on route-node loss instead of attempting automatic route repair.
+
+Rationale:
+
+- Route repair requires compatible Prefix Snapshots, cache ABI checks, replacement-node selection, billing correction, and client stream/error recovery.
+- Local Hot KV State means a replacement node cannot continue unless it has compatible state at the same position.
+- Fail-fast keeps the first implementation correct while the session/KV protocol is still being proven.
+
+Consequences:
+
+- Better observability and explicit errors are required.
+- Snapshotting becomes a later feature, not a blocker for first inference.
+- Generation Telemetry must report the last known phase and failure reason.
+- Client or gateway retry starts a new Route Session from scratch.
+
+### Gate 7: Transport
+
+Decision: keep binary HTTP for v1 activation transfer instead of jumping immediately to QUIC, WebRTC, or a custom transport.
+
+Rationale:
+
+- ADR-0008 already defines binary activation bodies with HTTP headers.
+- HTTP keeps the first implementation debuggable with the existing server stack and tooling.
+- The core risk is route/session/KV correctness, not transport optimization.
+- QUIC/WebRTC can be introduced later behind the same activation protocol once semantics are proven.
+
+Consequences:
+
+- Focus benchmark work on payload shape, chunking, and cache behavior first.
+- QUIC/WebRTC can be introduced as an optimization behind the same activation protocol.
+- v1 implementation can reuse the current HTTP routing, relay, and observability infrastructure.
+- Transport abstraction should be kept narrow enough that HTTP can be replaced later without changing backend cache semantics.
+
+## Grilling Progress
+
+Gates 1, 2, 3, 3A, 4, 5, 6, and 7 are resolved. The remaining work is to convert the resolved framework into implementation-ready issue briefs and prototype milestones.

.scratch/distributed-gguf-runtime/evidence/README.md

@@ -0,0 +1,15 @@
+# Ralph task evidence
+
+Each completed story creates `evidence/<TASK-ID>/README.md`. Fresh dependent iterations must read it before coding.
+
+Required README sections:
+
+1. Summary and acceptance decision.
+2. Exact files changed.
+3. Commands run and real exit/results.
+4. Correctness, performance and hardware evidence classification.
+5. Known limitations and deferred work.
+6. Compatibility/migration notes.
+7. Explicit handoff for each dependent story.
+
+Store raw machine-readable metrics, manifests and protocol artifacts beside the README. Never store secrets, model weights, build outputs or Ralph iteration logs here.

.scratch/distributed-gguf-runtime/implementation-strategy.md

@@ -0,0 +1,241 @@
+# Focused implementation strategy: performant concurrent distributed inference
+
+Status: Accepted planning direction
+Last updated: 2026-07-13
+
+## Product objective
+
+Enable clients to run top open models that do not fit on one consumer machine by combining independently owned model Shards into performant, concurrent Inference Routes.
+
+The project is not trying to reproduce every vLLM feature or support every inference engine. It is optimizing for:
+
+1. Models larger than one node's RAM/VRAM.
+2. Useful interactive decode speed on consumer CPU, AMD, NVIDIA, Vulkan, and mixed routes where certified.
+3. Multiple concurrent Route Sessions without cache corruption or global serialization.
+4. A lean runtime with one control plane and one primary GGUF engine.
+5. Measured improvement over the existing Transformers/safetensors implementation.
+
+## Current reality
+
+The existing project already owns the differentiating distributed control plane:
+
+- Tracker-selected contiguous Shards.
+- Stable Route Sessions.
+- Local per-Shard Hot KV State in the Transformers reference backend.
+- Binary Activation Seams.
+- Relay/direct routing, cancellation, telemetry, billing, and capability admission.
+- Persistent relay and direct transport optimizations.
+
+The missing production path is a native GGUF execution worker that can load and execute only an assigned layer range while retaining local Hot KV State for concurrent Route Sessions.
+
+Whole-model llama.cpp, vLLM, and existing Transformers serving remain baselines or optional route kinds. They are not substitutes for native distributed Shards.
+
+## Performance hypothesis—not an assumption
+
+GGUF itself is a format. Performance comes from llama.cpp/GGML's quantized kernels, memory layout, mmap, backend scheduling, and reduced working set.
+
+Quantized GGUF may be faster or may merely fit a larger model. Comparisons against safetensors must report both speed and quality because BF16 safetensors and Q4/Q8 GGUF are not numerically equivalent.
+
+Before expensive native work, establish controlled lanes:
+
+- Same model architecture and upstream revision.
+- Same machine, prompt set, context, output length, sampling policy, and concurrency.
+- Transformers/safetensors BF16 or the current production recipe.
+- llama.cpp GGUF F16/BF16 or Q8 correctness lane where available.
+- Q4_K_M or selected production quantization performance/fit lane.
+- TTFT, prefill tok/s, decode tok/s, p50/p95 latency, RSS, VRAM, artifact size, energy where available, and output-quality drift.
+
+The program proceeds only if llama.cpp/GGUF provides at least one meaningful advantage recorded in a machine-readable performance contract:
+
+- Better decode or aggregate throughput at acceptable quality; or
+- Materially lower memory that makes the target model routable while preserving useful throughput.
+
+## Parallelism we will use
+
+### Public Inference Route: layer/pipeline parallelism
+
+Each node independently executes one contiguous Shard. Activations cross seams; weights and Hot KV State remain local.
+
+This is the only public cross-machine model-parallel primitive in the first runtime.
+
+### Per-node continuous batching
+
+Autoregressive tokens remain sequential within one generation. Throughput comes from batching decode steps from multiple active Route Sessions inside each node using llama.cpp batches and sequence IDs or bounded context pools.
+
+This is essential. A worker that globally serializes sessions is not production-ready.
+
+### Multiple complete routes: data parallelism
+
+The Tracker may select multiple complete routes for independent requests. This increases network throughput and availability without requiring collectives between routes.
+
+### Trusted composite node: optional tensor/expert parallelism
+
+Tensor parallelism and expert parallelism require frequent collectives and tight compatibility. They may be used later inside one operator-controlled composite node or managed cluster exposed as one logical provider. They are not public WAN routing primitives.
+
+### Deferred mechanisms
+
+- Disaggregated prefill and KV transfer.
+- Speculative decoding.
+- Cross-route prefix snapshots.
+- Route repair with KV migration.
+- Public tensor/expert parallel collectives.
+
+They remain out of the critical path until the native layer route passes performance and concurrency gates.
+
+## Reuse decisions
+
+### llama.cpp/GGML: primary runtime substrate
+
+Reuse:
+
+- GGUF parsing and mmap.
+- Quantized kernels.
+- CPU, CUDA, HIP/ROCm, Vulkan, Metal, and other supported backends.
+- Tokenizer and model architecture implementations.
+- KV and sequence operations.
+- Backend scheduler and graph execution.
+
+Maintain a small exact-commit fork only for the missing local seam:
+
+- Range-aware tensor ownership/loading.
+- Architecture-defined boundary input/output.
+- Intermediate boundary output without tail normalization.
+- Layer-filtered KV and sequence mapping.
+
+Keep networking, Tracker logic, billing, and public protocol outside llama.cpp. Upstream generic hooks where possible.
+
+### vLLM: concepts and optional managed backend
+
+Use unmodified vLLM only as:
+
+- A whole-model node backend.
+- A managed TP/PP/EP cluster represented as one logical provider.
+- A performance/correctness baseline.
+
+Adapt concepts, not runtime code:
+
+- Named intermediate tensor bundles.
+- Continuous batching and request-owner maps.
+- Versioned KV-transfer compatibility fingerprints.
+- Explicit send/receive/abort/failure lifecycle.
+- Load telemetry and unbiased route selection.
+
+Do not fork vLLM for public Shards and do not transplant PagedAttention, Torch process groups, or GGUF-plugin kernels into the llama.cpp worker.
+
+### Nakshatra, prima.cpp, llama-gguf, LiGGUF, GPUStack
+
+Use as source and test donors only:
+
+- Nakshatra: partial-GGUF patches, daemon concepts, replay cases.
+- prima.cpp: selected tensor ownership and local-layer KV evidence.
+- llama-gguf: small protocol and integration-test patterns.
+- LiGGUF: Q8 activation transport and tensor-reduction reference.
+- historical GPUStack: resource preflight and role-oriented placement.
+
+Do not adopt or fork their repositories wholesale.
+
+## Battle-proven transport decision
+
+Use gRPC over HTTP/2 with Protocol Buffers for the native C++ Shard worker protocol.
+
+Why:
+
+- Mature Python and C++ implementations.
+- Bidirectional streaming.
+- HTTP/2 flow control and connection reuse.
+- Deadlines, cancellation, status codes, TLS, authentication interceptors, and generated schemas.
+- Avoids inventing a socket protocol.
+
+Scope boundary:
+
+- OpenAI-compatible client/Gateway APIs remain HTTP/SSE.
+- Tracker/control APIs remain existing project interfaces.
+- One long-lived bidirectional gRPC stream serves one Route Session Activation Seam.
+- Existing relay/WebSocket infrastructure may carry the same versioned protobuf frames as opaque binary when direct gRPC reachability is unavailable.
+- Large prefill tensors are chunked into bounded frames; decode bundles stay small.
+- No QUIC/WebRTC/custom transport in this milestone.
+
+The public boundary uses a versioned named-tensor bundle rather than one anonymous tensor because architecture boundaries can require more than `hidden_states`.
+
+Minimum identity:
+
+```text
+schema version
+request/work id
+Route Session id and route epoch
+Model Artifact and runtime recipe fingerprint
+Shard range and effective start
+phase: prefill/decode/release/cancel
+position/token range
+named tensors with shape/dtype/byte order
+compression and checksum
+idempotency step id
+cache expectation/result
+```
+
+## Concurrency model
+
+A native worker must not use one global serving sequence or one lock around all model execution.
+
+Required ownership:
+
+```text
+(Route Session id, route epoch)
+    -> local sequence/context
+    -> Shard-local Hot KV State
+    -> bounded lease and memory accounting
+```
+
+The node scheduler:
+
+- Admits sessions against model memory and KV budget.
+- Forms compatible decode batches from active sessions.
+- Preserves per-session position and route order.
+- Applies bounded queues and backpressure.
+- Cancels/releases independently.
+- Reports queue, batch, KV, prefill, decode, and seam telemetry.
+
+Initial deterministic gate: at least four concurrent sessions on a small certified model with no token/KV cross-talk. Final concurrency targets are hardware/recipe-specific and recorded by capability admission rather than hardcoded globally.
+
+## Stage gates
+
+### Gate A: performance hypothesis
+
+Controlled safetensors-versus-GGUF benchmark produces a signed/reproducible report and locks thresholds. Stop native work if there is no meaningful speed or fit benefit.
+
+### Gate B: local range parity
+
+Two local processes own disjoint GGUF ranges and match whole-model llama.cpp within the certified numerical tolerance for prefill and greedy decode.
+
+### Gate C: concurrent KV
+
+Multiple Route Sessions prefill/decode concurrently with isolated local KV, bounded memory, cancellation, and release.
+
+### Gate D: real distributed route
+
+Two physical machines execute one model that uses both Shards. Synthetic activation tests do not satisfy this gate.
+
+### Gate E: consumer-hardware performance
+
+On certified consumer hardware, the GGUF route beats the current distributed safetensors route under the locked performance contract or enables a larger otherwise-unroutable model at useful measured speed.
+
+### Gate F: architecture expansion
+
+Only after dense Llama-family gates pass, add an explicit Qwen3/Qwen3-MoE adapter and certify it independently.
+
+## Scope discipline
+
+The following do not block the first production candidate:
+
+- New cryptocurrency/economics work.
+- New artifact P2P protocol.
+- QUIC or WebRTC.
+- vLLM fork.
+- Whole-repository Nakshatra/prima adoption.
+- Every GGUF architecture.
+- Automatic route repair.
+- Prefix snapshot migration.
+- Speculative decoding.
+- A large-model marketing demo before small-model parity and concurrency pass.
+
+Every optimization must preserve output contract, session isolation, cancellation, resource cleanup, capability admission, and per-node attribution.

.scratch/distributed-gguf-runtime/issues/01-lock-the-safetensors-versus-gguf-performance-contract.md

@@ -0,0 +1,59 @@
+# 01 — Lock the safetensors-versus-GGUF performance contract
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-001` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a runtime engineer, I need a controlled baseline so that GGUF work proceeds from measured speed, memory, and quality rather than reputation.
+
+## Expected durable outputs
+
+- Benchmark harness and deterministic tests
+- evidence/DGR-001/performance-contract.json
+- Raw and summarized safetensors/GGUF benchmark evidence
+
+## Acceptance criteria
+
+- [ ] Benchmark the same model architecture/revision, machine, prompts, context lengths, output lengths, sampling policy, and concurrency across the current Transformers/safetensors recipe and whole-model llama.cpp recipes.
+- [ ] Separate correctness/quality lanes from quantized performance/fit lanes instead of claiming BF16 and Q4 are numerically equivalent.
+- [ ] Report TTFT, prefill tok/s, decode tok/s, p50/p95 latency, aggregate throughput, RSS, VRAM, artifact size, failures, and output drift in machine-readable JSON.
+- [ ] Add concurrency levels 1 and 4 where memory permits.
+- [ ] Write a versioned performance contract consumed by later release gates, including an explicit stop condition when llama.cpp/GGUF has no meaningful speed or fit benefit.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence
+- [ ] Model artifacts remain on the configured mounted-drive storage and never under /home
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-001/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- None. This story may start immediately.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/02-adopt-the-versioned-grpc-shard-protocol.md

@@ -0,0 +1,59 @@
+# 02 — Adopt the versioned gRPC Shard protocol
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-002` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a node developer, I need a battle-proven streaming protocol so that Python and C++ Shards communicate without a custom socket protocol.
+
+## Expected durable outputs
+
+- packages/node/native/proto/shard_runtime.proto
+- Reproducible Python/C++ schema generation and build wiring
+- Protocol round-trip and compatibility tests
+- evidence/DGR-002/README.md
+
+## Acceptance criteria
+
+- [ ] Add a Protocol Buffers schema for capability, health, session stream, release, and cancellation operations.
+- [ ] Define one long-lived bidirectional gRPC stream per Route Session Activation Seam with deadlines, cancellation, flow control, and structured errors.
+- [ ] Define bounded chunking for prefill and a small decode fast path.
+- [ ] Carry schema version, request/work ID, Route Session ID, route epoch, artifact/recipe fingerprint, Shard range/effective start, phase, position, idempotency step, cache expectation, compression, and checksum.
+- [ ] Define a versioned named-tensor bundle with per-tensor name, shape, dtype, byte order, and payload fragments.
+- [ ] Add generated-schema round-trip and compatibility tests in Python and C++.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-002/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- None. This story may start immediately.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/03-define-exact-artifact-and-runtime-recipe-identity.md

@@ -0,0 +1,57 @@
+# 03 — Define exact Artifact and runtime recipe identity
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-003` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As the Tracker, I need exact compatibility identity so that only numerically and operationally compatible Shards form an Inference Route.
+
+## Expected durable outputs
+
+- Exact runtime recipe/fingerprint implementation
+- Tracker/node fail-closed admission tests
+- evidence/DGR-003/README.md
+
+## Acceptance criteria
+
+- [ ] Separate weight quantization, activation dtype, compute dtype, KV dtype/layout, tokenizer revision, architecture adapter, backend, and runtime version.
+- [ ] Bind derivative or split artifacts to an exact source Model Artifact hash and Shard range.
+- [ ] Produce a stable compatibility fingerprint used by capability admission and the gRPC handshake.
+- [ ] Fail closed on mismatched artifact, tokenizer, architecture, range, boundary schema, activation recipe, or cache layout.
+- [ ] Keep unsupported recipes registered-but-dark until a real distributed forward certifies them.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-003/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-002` must have `passes: true`; read `../evidence/DGR-002/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/04-create-the-reproducible-pinned-llama-cpp-patch-stack.md

@@ -0,0 +1,61 @@
+# 04 — Create the reproducible pinned llama.cpp patch stack
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-004` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a maintainer, I need a small auditable fork boundary so that upstream updates do not turn the runtime into an unmaintainable stitched codebase.
+
+## Expected durable outputs
+
+- Exact llama.cpp upstream pin
+- Numbered minimal patch stack
+- Reproducible fetch/apply/build smoke
+- evidence/DGR-004/README.md
+
+## Acceptance criteria
+
+- [ ] Pin one exact llama.cpp commit through a reproducible source dependency mechanism.
+- [ ] Store a numbered minimal patch stack separately from Meshnet networking code.
+- [ ] Add a build script that applies/checks patches and builds the standalone worker without manual source copying.
+- [ ] Record upstream file/ABI assumptions and fail clearly when the pin changes.
+- [ ] Preserve upstream license and attribution notices.
+- [ ] Add a clean rebuild smoke test that does not download a model.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-004/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-001` must have `passes: true`; read `../evidence/DGR-001/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/05-implement-dense-llama-range-aware-gguf-ownership.md

@@ -0,0 +1,61 @@
+# 05 — Implement dense-Llama range-aware GGUF ownership
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-005` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a node, I need to map only my assigned dense-Llama Shard so that aggregate consumer memory can hold a model larger than one node.
+
+## Expected durable outputs
+
+- Dense-Llama range-aware ownership implementation
+- Authoritative loaded-range introspection
+- Mapped/resident memory evidence
+- evidence/DGR-005/README.md
+
+## Acceptance criteria
+
+- [ ] Register and allocate only `blk.N.*` tensors in the assigned range.
+- [ ] Load embeddings only for the head and final norm/LM head only for the tail, including tied embeddings.
+- [ ] Prefer range-aware mapping from one exact source GGUF; if derivative sub-GGUFs are used temporarily, verify source/slice hashes and avoid claiming final artifact semantics.
+- [ ] Report authoritative loaded range and endpoint ownership from the model, not operator CLI claims.
+- [ ] Demonstrate mapped/resident memory scales with owned tensors rather than full model size.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-005/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-003` must have `passes: true`; read `../evidence/DGR-003/README.md` and verify its referenced files/commands.
+- `DGR-004` must have `passes: true`; read `../evidence/DGR-004/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/06-implement-architecture-defined-boundary-input-output.md

@@ -0,0 +1,61 @@
+# 06 — Implement architecture-defined boundary input/output
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-006` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a Shard, I need to consume and emit the correct transformer boundary state so that disjoint processes reproduce whole-model execution.
+
+## Expected durable outputs
+
+- Architecture boundary adapter
+- Whole-model/two-range parity tests and results
+- evidence/DGR-006/README.md
+
+## Acceptance criteria
+
+- [ ] Head accepts token IDs and owns token embedding.
+- [ ] Middle/tail bypass token embedding and accept the named boundary bundle.
+- [ ] Non-tail emits the unnormalized architecture-defined residual/boundary before final norm/head and before tail-only row pruning.
+- [ ] Tail emits logits or token output through an explicit sampling contract.
+- [ ] Dense-Llama whole-model versus two-range prefill and greedy-decode parity passes the documented tolerance.
+- [ ] The adapter interface fails closed for uncertified architectures.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-006/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-002` must have `passes: true`; read `../evidence/DGR-002/README.md` and verify its referenced files/commands.
+- `DGR-005` must have `passes: true`; read `../evidence/DGR-005/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/07-add-isolated-concurrent-local-hot-kv-state.md

@@ -0,0 +1,60 @@
+# 07 — Add isolated concurrent local Hot KV State
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-007` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a client, I need concurrent Route Sessions to retain independent per-Shard cache so that one request cannot clear or corrupt another.
+
+## Expected durable outputs
+
+- Concurrent local KV/session manager
+- Isolation, eviction, cancellation and cleanup tests
+- evidence/DGR-007/README.md
+
+## Acceptance criteria
+
+- [ ] Map `(Route Session ID, route epoch)` to an isolated llama sequence or bounded context.
+- [ ] Allocate KV only for owned layers.
+- [ ] Support prefill append, decode append, truncate, release, TTL/LRU eviction, and explicit cache-miss response.
+- [ ] Reject stale epochs and incompatible cache recipes.
+- [ ] At least four concurrent sessions on a small model complete without token or KV cross-talk.
+- [ ] Cancellation/release of one session leaves other sessions intact and memory returns to the configured budget.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-007/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-006` must have `passes: true`; read `../evidence/DGR-006/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/08-build-the-standalone-c-grpc-shard-worker.md

@@ -0,0 +1,65 @@
+# 08 — Build the standalone C++ gRPC Shard worker
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-008` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a node runtime, I need one supervised native process so that llama.cpp internals remain behind a stable project-owned protocol.
+
+## Expected durable outputs
+
+- Standalone C++ gRPC worker
+- Fake-model Python/C++ integration tests
+- Lifecycle and bounded-failure evidence
+- evidence/DGR-008/README.md
+
+## Acceptance criteria
+
+- [ ] Worker exposes capability, health, session stream, release, cancellation, and metrics services from DGR-002.
+- [ ] Worker loads one exact Artifact/recipe/Shard identity and refuses mismatched requests.
+- [ ] Streaming path enforces bounded messages, flow control, deadlines, idempotency, and independent session cancellation.
+- [ ] Worker does not expose raw llama.cpp RPC or arbitrary GGML graph execution.
+- [ ] Graceful shutdown releases sessions; crash behavior is bounded and observable.
+- [ ] Python integration tests run against a fake model mode without model downloads.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-008/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-002` must have `passes: true`; read `../evidence/DGR-002/README.md` and verify its referenced files/commands.
+- `DGR-003` must have `passes: true`; read `../evidence/DGR-003/README.md` and verify its referenced files/commands.
+- `DGR-004` must have `passes: true`; read `../evidence/DGR-004/README.md` and verify its referenced files/commands.
+- `DGR-006` must have `passes: true`; read `../evidence/DGR-006/README.md` and verify its referenced files/commands.
+- `DGR-007` must have `passes: true`; read `../evidence/DGR-007/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/09-integrate-the-native-worker-with-meshnet.md

@@ -0,0 +1,61 @@
+# 09 — Integrate the native worker with Meshnet
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-009` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As the existing node service, I need a GGUF Shard backend adapter so that the Tracker, relay, billing, telemetry, and capability admission remain the sole control plane.
+
+## Expected durable outputs
+
+- Meshnet GGUF backend adapter
+- Registration, routing, relay, telemetry and billing tests
+- evidence/DGR-009/README.md
+
+## Acceptance criteria
+
+- [ ] Implement the existing model-backend surface without changing Transformers behavior.
+- [ ] Registration carries exact validated GGUF recipe, Shard, backend and concurrency/KV capacity.
+- [ ] Tracker forms only complete compatible routes and keeps uncertified recipes dark.
+- [ ] Direct routes use gRPC streams; relayed routes carry the same versioned protobuf frames as opaque binary through the existing relay seam.
+- [ ] Existing request/work IDs, cancellation, Generation Telemetry, billing, and per-node attribution remain correlated.
+- [ ] No vLLM, Nakshatra, prima.cpp, or custom-engine control plane becomes a core dependency.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-009/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-003` must have `passes: true`; read `../evidence/DGR-003/README.md` and verify its referenced files/commands.
+- `DGR-008` must have `passes: true`; read `../evidence/DGR-008/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/10-pass-local-real-model-two-process-acceptance.md

@@ -0,0 +1,62 @@
+# 10 — Pass local real-model two-process acceptance
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-010` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a release engineer, I need real local distributed parity before involving network variability.
+
+## Expected durable outputs
+
+- Real local two-process commands and configuration
+- Raw parity, memory and performance results
+- evidence/DGR-010/README.md
+
+## Acceptance criteria
+
+- [ ] Two local worker processes open disjoint dense-Llama ranges from the certified Artifact.
+- [ ] Prefill and at least 32 greedy decode tokens match whole-model llama.cpp within the certified tolerance.
+- [ ] Each worker retains only its own tensors and Hot KV State.
+- [ ] Four concurrent Route Sessions pass isolation and cleanup checks.
+- [ ] Report TTFT, prefill/decode throughput, seam bytes/latency, worker RSS/VRAM, KV memory, batch size, and queue time.
+- [ ] Killing one worker produces a bounded structured failure rather than a deadlock.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence
+- [ ] Model artifacts remain on the configured mounted-drive storage and never under /home
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-010/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-009` must have `passes: true`; read `../evidence/DGR-009/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/11-pass-a-real-heterogeneous-two-machine-route.md

@@ -0,0 +1,62 @@
+# 11 — Pass a real heterogeneous two-machine route
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-011` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a consumer-hardware operator, I need two physical machines to execute one GGUF model so that the distributed claim is real.
+
+## Expected durable outputs
+
+- Two-machine hardware/network/runtime manifest
+- Raw real-route metrics and output evidence
+- evidence/DGR-011/README.md
+
+## Acceptance criteria
+
+- [ ] Tracker selects two physical nodes with disjoint Shards and one exact certified recipe/compatibility class.
+- [ ] Actual CPU/GPU execution occurs on both nodes; synthetic workers do not satisfy acceptance.
+- [ ] Prefill/decode, concurrent-session isolation, telemetry, cancellation, and cleanup pass over the real transport/relay path.
+- [ ] Exact hardware, network, backend, model hash, route, commands, and raw metrics are recorded.
+- [ ] A model or recipe larger than one participating node's admitted memory is exercised when available.
+- [ ] Output drift is measured and incompatible mixed backends fail closed.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence
+- [ ] Model artifacts remain on the configured mounted-drive storage and never under /home
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-011/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-010` must have `passes: true`; read `../evidence/DGR-010/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/12-implement-continuous-batching-and-bounded-admission.md

@@ -0,0 +1,63 @@
+# 12 — Implement continuous batching and bounded admission
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-012` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a node operator, I need active sessions batched safely so that concurrency increases aggregate throughput rather than serializing every request.
+
+## Expected durable outputs
+
+- Continuous batching/admission scheduler
+- Concurrency 1/2/4/8 report
+- Queue, batch and KV-pressure evidence
+- evidence/DGR-012/README.md
+
+## Acceptance criteria
+
+- [ ] Node scheduler admits sessions against weight, KV, scratch, and queue budgets.
+- [ ] Compatible decode steps from multiple sessions form llama.cpp batches while preserving per-session positions and outputs.
+- [ ] Prefill does not starve decode; scheduling policy and bounds are explicit.
+- [ ] Backpressure prevents unbounded queued activations or KV growth.
+- [ ] Capability telemetry reports active sessions, queue depth, batch occupancy, KV pressure, prefill/decode rates, and rejected admissions.
+- [ ] Concurrency 1/2/4/8 benchmark identifies saturation and shows no cross-session corruption.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-012/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-007` must have `passes: true`; read `../evidence/DGR-007/README.md` and verify its referenced files/commands.
+- `DGR-009` must have `passes: true`; read `../evidence/DGR-009/README.md` and verify its referenced files/commands.
+- `DGR-010` must have `passes: true`; read `../evidence/DGR-010/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/13-harden-failure-cancellation-and-restart-semantics.md

@@ -0,0 +1,62 @@
+# 13 — Harden failure, cancellation, and restart semantics
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-013` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a client, I need failures to be bounded and explicit so that distributed speed does not come with hanging or corrupted generations.
+
+## Expected durable outputs
+
+- Failure/cancel/restart test matrix
+- Resource cleanup and billing-state evidence
+- evidence/DGR-013/README.md
+
+## Acceptance criteria
+
+- [ ] Deadlines and heartbeat/health loss terminate blocked stream operations.
+- [ ] Cancellation propagates across every Shard and releases local KV and queued buffers.
+- [ ] Duplicate steps are idempotent; uncertain mutations are never replayed silently.
+- [ ] Alpha failover restarts from token zero on a newly compatible route rather than importing unverified KV.
+- [ ] Worker death, stream reset, malformed bundle, stale epoch, and cache miss tests pass.
+- [ ] Billing/work records distinguish completed, cancelled, failed, and unverified work.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-013/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-008` must have `passes: true`; read `../evidence/DGR-008/README.md` and verify its referenced files/commands.
+- `DGR-009` must have `passes: true`; read `../evidence/DGR-009/README.md` and verify its referenced files/commands.
+- `DGR-012` must have `passes: true`; read `../evidence/DGR-012/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/14-enforce-the-gguf-versus-safetensors-release-gate.md

@@ -0,0 +1,65 @@
+# 14 — Enforce the GGUF-versus-safetensors release gate
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-014` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As the product owner, I need an end-to-end comparison so that the native runtime ships only if it advances model access or performance.
+
+## Expected durable outputs
+
+- Immutable comparison against DGR-001 thresholds
+- Machine-readable final report
+- Ship/optimize/stop recommendation
+- evidence/DGR-014/README.md
+
+## Acceptance criteria
+
+- [ ] Run current distributed safetensors and distributed GGUF routes on the same certified model/hardware/network scenario where technically comparable.
+- [ ] Report quality, TTFT, prefill/decode throughput, aggregate concurrency throughput, p95 latency, seam cost, memory, KV pressure, failures, and cleanup.
+- [ ] Evaluate against the DGR-001 performance contract without changing thresholds after seeing results.
+- [ ] Ship recommendation is one of: promote GGUF, optimize a measured bottleneck with a new bounded task, or stop the native track.
+- [ ] Results clearly separate quantization gains from transport/runtime gains.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence
+- [ ] Model artifacts remain on the configured mounted-drive storage and never under /home
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-014/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-001` must have `passes: true`; read `../evidence/DGR-001/README.md` and verify its referenced files/commands.
+- `DGR-011` must have `passes: true`; read `../evidence/DGR-011/README.md` and verify its referenced files/commands.
+- `DGR-012` must have `passes: true`; read `../evidence/DGR-012/README.md` and verify its referenced files/commands.
+- `DGR-013` must have `passes: true`; read `../evidence/DGR-013/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/15-add-and-certify-a-qwen3-qwen3-moe-adapter.md

@@ -0,0 +1,61 @@
+# 15 — Add and certify a Qwen3/Qwen3-MoE adapter
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-015` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a client seeking top models, I need a separately certified MoE-capable architecture after the dense runtime proves stable.
+
+## Expected durable outputs
+
+- Qwen3-family architecture adapter
+- Architecture-specific parity/admission/performance results
+- evidence/DGR-015/README.md
+
+## Acceptance criteria
+
+- [ ] Implement explicit tensor ownership, router/top-k, expert/shared-expert, Q/K normalization, boundary bundle, and cache semantics for the selected Qwen3 family recipe.
+- [ ] Do not reuse the dense-Llama adapter through unchecked name substitutions.
+- [ ] Whole-model versus distributed prefill/decode parity passes the architecture-specific tolerance.
+- [ ] Expert memory ownership and communication are measured.
+- [ ] Real consumer-hardware acceptance and capability admission pass before the recipe becomes routable.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence
+- [ ] Model artifacts remain on the configured mounted-drive storage and never under /home
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-015/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-014` must have `passes: true`; read `../evidence/DGR-014/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/issues/16-produce-the-upstream-llama-cpp-collaboration-package.md

@@ -0,0 +1,60 @@
+# 16 — Produce the upstream llama.cpp collaboration package
+
+Status: ready-for-agent
+
+## Mandatory fresh-session context
+
+- Read [RALPH-CONTEXT.md](../RALPH-CONTEXT.md) completely before changing code.
+- This issue is `DGR-016` in [prd.json](../prd.json).
+- Read the evidence README for every dependency listed below.
+- Inspect current code and `git status`; historical text and previous agent claims are not evidence.
+
+## Description
+
+As a maintainer, I need narrow upstreamable proposals so that our patch burden can shrink without asking llama.cpp to own Meshnet networking.
+
+## Expected durable outputs
+
+- Narrow upstream patches/tests
+- Generic API design note
+- Human-ready llama.cpp outreach package
+- evidence/DGR-016/README.md
+
+## Acceptance criteria
+
+- [ ] Separate generic llama.cpp hooks from Meshnet protocol/control-plane code.
+- [ ] Prepare minimal reproducible examples and tests for range-aware loading, boundary input/output, and layer-filtered KV.
+- [ ] Compare the proposal with Nakshatra and prima.cpp evidence and explain why the API is generally useful.
+- [ ] Preserve one scoped commit/patch per concern against the exact upstream pin.
+- [ ] Produce an outreach document suitable for Georgi/llama.cpp maintainers; actual sending remains a human action.
+- [ ] Targeted pytest tests pass
+- [ ] python -m compileall packages tests passes for Python changes
+- [ ] git diff --check passes
+- [ ] Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free
+- [ ] Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction
+- [ ] Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched
+- [ ] llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched
+- [ ] Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code
+- [ ] Read and verify every dependency evidence README before relying on dependency behavior
+- [ ] Preserve all pre-existing working-tree changes and stage only files belonging to this story
+- [ ] Write .scratch/distributed-gguf-runtime/evidence/DGR-016/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff
+- [ ] Update only this story issue to Status: done after every acceptance criterion and quality gate passes
+
+## Dependency handoff
+
+- `DGR-010` must have `passes: true`; read `../evidence/DGR-010/README.md` and verify its referenced files/commands.
+
+## Finish contract
+
+- Create the task evidence directory and durable handoff required above.
+- Preserve real failures and blockers; never fabricate benchmark, model, test or hardware output.
+- Change this issue to `Status: done` only after all criteria pass.
+- Emit `<promise>COMPLETE</promise>` only after the evidence handoff exists.
+
+## References
+
+- [Ralph execution context](../RALPH-CONTEXT.md)
+- [PRD](../PRD.md)
+- [Implementation strategy](../implementation-strategy.md)
+- [Current architecture](../architecture.md)
+- [Architecture decision](../ADR-0020-distributed-gguf-runtime.md)

.scratch/distributed-gguf-runtime/milestones.md

@@ -0,0 +1,35 @@
+# Distributed GGUF runtime milestones
+
+## Gate A — measured runtime value
+
+- DGR-001 locks the safetensors-versus-GGUF performance/fit/quality contract.
+- DGR-002 can proceed independently and defines the battle-proven backend-neutral wire protocol.
+- DGR-003 builds exact recipe identity on DGR-002.
+- Expensive native llama.cpp work remains gated by DGR-001.
+
+## Gate B — minimal native execution seam
+
+- DGR-004 creates the reproducible pinned fork boundary.
+- DGR-005 implements dense-Llama range ownership.
+- DGR-006 proves architecture-defined boundary parity.
+
+## Gate C — concurrent production worker
+
+- DGR-007 isolates concurrent Hot KV State.
+- DGR-008 exposes the native worker over gRPC.
+- DGR-009 integrates the worker without replacing Meshnet's control plane.
+- DGR-010 passes local real-model two-process acceptance.
+
+## Gate D — real consumer-hardware route
+
+- DGR-011 passes two-physical-machine execution.
+- DGR-012 adds continuous batching and bounded admission.
+- DGR-013 hardens failure and cancellation.
+
+## Gate E — product release decision
+
+- DGR-014 compares distributed GGUF against the current distributed safetensors route under locked thresholds.
+- DGR-015 adds Qwen3/Qwen3-MoE only after the dense runtime passes.
+- DGR-016 prepares narrow upstream llama.cpp collaboration material.
+
+No later gate may be claimed from synthetic workers or documentation-only evidence.

.scratch/distributed-gguf-runtime/prd.json

@@ -0,0 +1,511 @@
+{
+  "name": "Performant Concurrent Distributed GGUF Runtime",
+  "branchName": "ralph/performant-concurrent-distributed-gguf",
+  "description": "Benchmark-gated native llama.cpp/GGUF Shards with gRPC streaming, concurrent local KV, continuous batching, real heterogeneous acceptance, and a measured release gate against Transformers/safetensors.",
+  "userStories": [
+    {
+      "id": "DGR-001",
+      "title": "Lock the safetensors-versus-GGUF performance contract",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/01-lock-the-safetensors-versus-gguf-performance-contract.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a runtime engineer, I need a controlled baseline so that GGUF work proceeds from measured speed, memory, and quality rather than reputation.",
+      "acceptanceCriteria": [
+        "Benchmark the same model architecture/revision, machine, prompts, context lengths, output lengths, sampling policy, and concurrency across the current Transformers/safetensors recipe and whole-model llama.cpp recipes.",
+        "Separate correctness/quality lanes from quantized performance/fit lanes instead of claiming BF16 and Q4 are numerically equivalent.",
+        "Report TTFT, prefill tok/s, decode tok/s, p50/p95 latency, aggregate throughput, RSS, VRAM, artifact size, failures, and output drift in machine-readable JSON.",
+        "Add concurrency levels 1 and 4 where memory permits.",
+        "Write a versioned performance contract consumed by later release gates, including an explicit stop condition when llama.cpp/GGUF has no meaningful speed or fit benefit.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence",
+        "Model artifacts remain on the configured mounted-drive storage and never under /home",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-001/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 2,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/01-lock-the-safetensors-versus-gguf-performance-contract.md",
+      "dependsOn": []
+    },
+    {
+      "id": "DGR-002",
+      "title": "Adopt the versioned gRPC Shard protocol",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/02-adopt-the-versioned-grpc-shard-protocol.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a node developer, I need a battle-proven streaming protocol so that Python and C++ Shards communicate without a custom socket protocol.",
+      "acceptanceCriteria": [
+        "Add a Protocol Buffers schema for capability, health, session stream, release, and cancellation operations.",
+        "Define one long-lived bidirectional gRPC stream per Route Session Activation Seam with deadlines, cancellation, flow control, and structured errors.",
+        "Define bounded chunking for prefill and a small decode fast path.",
+        "Carry schema version, request/work ID, Route Session ID, route epoch, artifact/recipe fingerprint, Shard range/effective start, phase, position, idempotency step, cache expectation, compression, and checksum.",
+        "Define a versioned named-tensor bundle with per-tensor name, shape, dtype, byte order, and payload fragments.",
+        "Add generated-schema round-trip and compatibility tests in Python and C++.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-002/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 1,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/02-adopt-the-versioned-grpc-shard-protocol.md",
+      "dependsOn": []
+    },
+    {
+      "id": "DGR-003",
+      "title": "Define exact Artifact and runtime recipe identity",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/03-define-exact-artifact-and-runtime-recipe-identity.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs the Tracker, I need exact compatibility identity so that only numerically and operationally compatible Shards form an Inference Route.",
+      "acceptanceCriteria": [
+        "Separate weight quantization, activation dtype, compute dtype, KV dtype/layout, tokenizer revision, architecture adapter, backend, and runtime version.",
+        "Bind derivative or split artifacts to an exact source Model Artifact hash and Shard range.",
+        "Produce a stable compatibility fingerprint used by capability admission and the gRPC handshake.",
+        "Fail closed on mismatched artifact, tokenizer, architecture, range, boundary schema, activation recipe, or cache layout.",
+        "Keep unsupported recipes registered-but-dark until a real distributed forward certifies them.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-003/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 3,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/03-define-exact-artifact-and-runtime-recipe-identity.md",
+      "dependsOn": [
+        "DGR-002"
+      ]
+    },
+    {
+      "id": "DGR-004",
+      "title": "Create the reproducible pinned llama.cpp patch stack",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/04-create-the-reproducible-pinned-llama-cpp-patch-stack.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a maintainer, I need a small auditable fork boundary so that upstream updates do not turn the runtime into an unmaintainable stitched codebase.",
+      "acceptanceCriteria": [
+        "Pin one exact llama.cpp commit through a reproducible source dependency mechanism.",
+        "Store a numbered minimal patch stack separately from Meshnet networking code.",
+        "Add a build script that applies/checks patches and builds the standalone worker without manual source copying.",
+        "Record upstream file/ABI assumptions and fail clearly when the pin changes.",
+        "Preserve upstream license and attribution notices.",
+        "Add a clean rebuild smoke test that does not download a model.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-004/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 4,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/04-create-the-reproducible-pinned-llama-cpp-patch-stack.md",
+      "dependsOn": [
+        "DGR-001"
+      ]
+    },
+    {
+      "id": "DGR-005",
+      "title": "Implement dense-Llama range-aware GGUF ownership",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/05-implement-dense-llama-range-aware-gguf-ownership.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a node, I need to map only my assigned dense-Llama Shard so that aggregate consumer memory can hold a model larger than one node.",
+      "acceptanceCriteria": [
+        "Register and allocate only `blk.N.*` tensors in the assigned range.",
+        "Load embeddings only for the head and final norm/LM head only for the tail, including tied embeddings.",
+        "Prefer range-aware mapping from one exact source GGUF; if derivative sub-GGUFs are used temporarily, verify source/slice hashes and avoid claiming final artifact semantics.",
+        "Report authoritative loaded range and endpoint ownership from the model, not operator CLI claims.",
+        "Demonstrate mapped/resident memory scales with owned tensors rather than full model size.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-005/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 5,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/05-implement-dense-llama-range-aware-gguf-ownership.md",
+      "dependsOn": [
+        "DGR-003",
+        "DGR-004"
+      ]
+    },
+    {
+      "id": "DGR-006",
+      "title": "Implement architecture-defined boundary input/output",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/06-implement-architecture-defined-boundary-input-output.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a Shard, I need to consume and emit the correct transformer boundary state so that disjoint processes reproduce whole-model execution.",
+      "acceptanceCriteria": [
+        "Head accepts token IDs and owns token embedding.",
+        "Middle/tail bypass token embedding and accept the named boundary bundle.",
+        "Non-tail emits the unnormalized architecture-defined residual/boundary before final norm/head and before tail-only row pruning.",
+        "Tail emits logits or token output through an explicit sampling contract.",
+        "Dense-Llama whole-model versus two-range prefill and greedy-decode parity passes the documented tolerance.",
+        "The adapter interface fails closed for uncertified architectures.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-006/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 6,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/06-implement-architecture-defined-boundary-input-output.md",
+      "dependsOn": [
+        "DGR-002",
+        "DGR-005"
+      ]
+    },
+    {
+      "id": "DGR-007",
+      "title": "Add isolated concurrent local Hot KV State",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/07-add-isolated-concurrent-local-hot-kv-state.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a client, I need concurrent Route Sessions to retain independent per-Shard cache so that one request cannot clear or corrupt another.",
+      "acceptanceCriteria": [
+        "Map `(Route Session ID, route epoch)` to an isolated llama sequence or bounded context.",
+        "Allocate KV only for owned layers.",
+        "Support prefill append, decode append, truncate, release, TTL/LRU eviction, and explicit cache-miss response.",
+        "Reject stale epochs and incompatible cache recipes.",
+        "At least four concurrent sessions on a small model complete without token or KV cross-talk.",
+        "Cancellation/release of one session leaves other sessions intact and memory returns to the configured budget.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-007/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 7,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/07-add-isolated-concurrent-local-hot-kv-state.md",
+      "dependsOn": [
+        "DGR-006"
+      ]
+    },
+    {
+      "id": "DGR-008",
+      "title": "Build the standalone C++ gRPC Shard worker",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/08-build-the-standalone-c-grpc-shard-worker.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a node runtime, I need one supervised native process so that llama.cpp internals remain behind a stable project-owned protocol.",
+      "acceptanceCriteria": [
+        "Worker exposes capability, health, session stream, release, cancellation, and metrics services from DGR-002.",
+        "Worker loads one exact Artifact/recipe/Shard identity and refuses mismatched requests.",
+        "Streaming path enforces bounded messages, flow control, deadlines, idempotency, and independent session cancellation.",
+        "Worker does not expose raw llama.cpp RPC or arbitrary GGML graph execution.",
+        "Graceful shutdown releases sessions; crash behavior is bounded and observable.",
+        "Python integration tests run against a fake model mode without model downloads.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-008/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 8,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/08-build-the-standalone-c-grpc-shard-worker.md",
+      "dependsOn": [
+        "DGR-002",
+        "DGR-003",
+        "DGR-004",
+        "DGR-006",
+        "DGR-007"
+      ]
+    },
+    {
+      "id": "DGR-009",
+      "title": "Integrate the native worker with Meshnet",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/09-integrate-the-native-worker-with-meshnet.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs the existing node service, I need a GGUF Shard backend adapter so that the Tracker, relay, billing, telemetry, and capability admission remain the sole control plane.",
+      "acceptanceCriteria": [
+        "Implement the existing model-backend surface without changing Transformers behavior.",
+        "Registration carries exact validated GGUF recipe, Shard, backend and concurrency/KV capacity.",
+        "Tracker forms only complete compatible routes and keeps uncertified recipes dark.",
+        "Direct routes use gRPC streams; relayed routes carry the same versioned protobuf frames as opaque binary through the existing relay seam.",
+        "Existing request/work IDs, cancellation, Generation Telemetry, billing, and per-node attribution remain correlated.",
+        "No vLLM, Nakshatra, prima.cpp, or custom-engine control plane becomes a core dependency.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-009/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 9,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/09-integrate-the-native-worker-with-meshnet.md",
+      "dependsOn": [
+        "DGR-003",
+        "DGR-008"
+      ]
+    },
+    {
+      "id": "DGR-010",
+      "title": "Pass local real-model two-process acceptance",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/10-pass-local-real-model-two-process-acceptance.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a release engineer, I need real local distributed parity before involving network variability.",
+      "acceptanceCriteria": [
+        "Two local worker processes open disjoint dense-Llama ranges from the certified Artifact.",
+        "Prefill and at least 32 greedy decode tokens match whole-model llama.cpp within the certified tolerance.",
+        "Each worker retains only its own tensors and Hot KV State.",
+        "Four concurrent Route Sessions pass isolation and cleanup checks.",
+        "Report TTFT, prefill/decode throughput, seam bytes/latency, worker RSS/VRAM, KV memory, batch size, and queue time.",
+        "Killing one worker produces a bounded structured failure rather than a deadlock.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence",
+        "Model artifacts remain on the configured mounted-drive storage and never under /home",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-010/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 10,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/10-pass-local-real-model-two-process-acceptance.md",
+      "dependsOn": [
+        "DGR-009"
+      ]
+    },
+    {
+      "id": "DGR-011",
+      "title": "Pass a real heterogeneous two-machine route",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/11-pass-a-real-heterogeneous-two-machine-route.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a consumer-hardware operator, I need two physical machines to execute one GGUF model so that the distributed claim is real.",
+      "acceptanceCriteria": [
+        "Tracker selects two physical nodes with disjoint Shards and one exact certified recipe/compatibility class.",
+        "Actual CPU/GPU execution occurs on both nodes; synthetic workers do not satisfy acceptance.",
+        "Prefill/decode, concurrent-session isolation, telemetry, cancellation, and cleanup pass over the real transport/relay path.",
+        "Exact hardware, network, backend, model hash, route, commands, and raw metrics are recorded.",
+        "A model or recipe larger than one participating node's admitted memory is exercised when available.",
+        "Output drift is measured and incompatible mixed backends fail closed.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence",
+        "Model artifacts remain on the configured mounted-drive storage and never under /home",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-011/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 11,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/11-pass-a-real-heterogeneous-two-machine-route.md",
+      "dependsOn": [
+        "DGR-010"
+      ]
+    },
+    {
+      "id": "DGR-012",
+      "title": "Implement continuous batching and bounded admission",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/12-implement-continuous-batching-and-bounded-admission.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a node operator, I need active sessions batched safely so that concurrency increases aggregate throughput rather than serializing every request.",
+      "acceptanceCriteria": [
+        "Node scheduler admits sessions against weight, KV, scratch, and queue budgets.",
+        "Compatible decode steps from multiple sessions form llama.cpp batches while preserving per-session positions and outputs.",
+        "Prefill does not starve decode; scheduling policy and bounds are explicit.",
+        "Backpressure prevents unbounded queued activations or KV growth.",
+        "Capability telemetry reports active sessions, queue depth, batch occupancy, KV pressure, prefill/decode rates, and rejected admissions.",
+        "Concurrency 1/2/4/8 benchmark identifies saturation and shows no cross-session corruption.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-012/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 12,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/12-implement-continuous-batching-and-bounded-admission.md",
+      "dependsOn": [
+        "DGR-007",
+        "DGR-009",
+        "DGR-010"
+      ]
+    },
+    {
+      "id": "DGR-013",
+      "title": "Harden failure, cancellation, and restart semantics",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/13-harden-failure-cancellation-and-restart-semantics.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a client, I need failures to be bounded and explicit so that distributed speed does not come with hanging or corrupted generations.",
+      "acceptanceCriteria": [
+        "Deadlines and heartbeat/health loss terminate blocked stream operations.",
+        "Cancellation propagates across every Shard and releases local KV and queued buffers.",
+        "Duplicate steps are idempotent; uncertain mutations are never replayed silently.",
+        "Alpha failover restarts from token zero on a newly compatible route rather than importing unverified KV.",
+        "Worker death, stream reset, malformed bundle, stale epoch, and cache miss tests pass.",
+        "Billing/work records distinguish completed, cancelled, failed, and unverified work.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-013/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 13,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/13-harden-failure-cancellation-and-restart-semantics.md",
+      "dependsOn": [
+        "DGR-008",
+        "DGR-009",
+        "DGR-012"
+      ]
+    },
+    {
+      "id": "DGR-014",
+      "title": "Enforce the GGUF-versus-safetensors release gate",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/14-enforce-the-gguf-versus-safetensors-release-gate.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs the product owner, I need an end-to-end comparison so that the native runtime ships only if it advances model access or performance.",
+      "acceptanceCriteria": [
+        "Run current distributed safetensors and distributed GGUF routes on the same certified model/hardware/network scenario where technically comparable.",
+        "Report quality, TTFT, prefill/decode throughput, aggregate concurrency throughput, p95 latency, seam cost, memory, KV pressure, failures, and cleanup.",
+        "Evaluate against the DGR-001 performance contract without changing thresholds after seeing results.",
+        "Ship recommendation is one of: promote GGUF, optimize a measured bottleneck with a new bounded task, or stop the native track.",
+        "Results clearly separate quantization gains from transport/runtime gains.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence",
+        "Model artifacts remain on the configured mounted-drive storage and never under /home",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-014/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 14,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/14-enforce-the-gguf-versus-safetensors-release-gate.md",
+      "dependsOn": [
+        "DGR-001",
+        "DGR-011",
+        "DGR-012",
+        "DGR-013"
+      ]
+    },
+    {
+      "id": "DGR-015",
+      "title": "Add and certify a Qwen3/Qwen3-MoE adapter",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/15-add-and-certify-a-qwen3-qwen3-moe-adapter.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a client seeking top models, I need a separately certified MoE-capable architecture after the dense runtime proves stable.",
+      "acceptanceCriteria": [
+        "Implement explicit tensor ownership, router/top-k, expert/shared-expert, Q/K normalization, boundary bundle, and cache semantics for the selected Qwen3 family recipe.",
+        "Do not reuse the dense-Llama adapter through unchecked name substitutions.",
+        "Whole-model versus distributed prefill/decode parity passes the architecture-specific tolerance.",
+        "Expert memory ownership and communication are measured.",
+        "Real consumer-hardware acceptance and capability admission pass before the recipe becomes routable.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Real-model execution is opt-in through MESHNET_ENABLE_REAL_INFERENCE_TESTS=1 and records exact artifact/runtime/hardware evidence",
+        "Model artifacts remain on the configured mounted-drive storage and never under /home",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-015/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 15,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/15-add-and-certify-a-qwen3-qwen3-moe-adapter.md",
+      "dependsOn": [
+        "DGR-014"
+      ]
+    },
+    {
+      "id": "DGR-016",
+      "title": "Produce the upstream llama.cpp collaboration package",
+      "description": "MANDATORY FRESH-SESSION CONTEXT: Read `.scratch/distributed-gguf-runtime/RALPH-CONTEXT.md` and `.scratch/distributed-gguf-runtime/issues/16-produce-the-upstream-llama-cpp-collaboration-package.md` completely before coding. Read the evidence handoff for every dependency. The global goal is performant concurrent inference for models larger than one consumer node, using Meshnet as the sole control plane, gRPC/Protobuf as the Shard protocol, and a small pinned llama.cpp worker\u2014not a stitched collection of runtimes.\n\nAs a maintainer, I need narrow upstreamable proposals so that our patch burden can shrink without asking llama.cpp to own Meshnet networking.",
+      "acceptanceCriteria": [
+        "Separate generic llama.cpp hooks from Meshnet protocol/control-plane code.",
+        "Prepare minimal reproducible examples and tests for range-aware loading, boundary input/output, and layer-filtered KV.",
+        "Compare the proposal with Nakshatra and prima.cpp evidence and explain why the API is generally useful.",
+        "Preserve one scoped commit/patch per concern against the exact upstream pin.",
+        "Produce an outreach document suitable for Georgi/llama.cpp maintainers; actual sending remains a human action.",
+        "Targeted pytest tests pass",
+        "python -m compileall packages tests passes for Python changes",
+        "git diff --check passes",
+        "Default tests remain deterministic, model-download-free, API-credit-free, and GPU-free",
+        "Full deterministic pytest -q passes, or the exact pre-existing unrelated failure is recorded with a clean-tree reproduction",
+        "Pinned native C++ target builds and focused CTest/protocol tests pass where native code is touched",
+        "llama.cpp patch stack applies cleanly to the exact pinned commit where patch code is touched",
+        "Read .scratch/distributed-gguf-runtime/RALPH-CONTEXT.md and this story issue completely before changing code",
+        "Read and verify every dependency evidence README before relying on dependency behavior",
+        "Preserve all pre-existing working-tree changes and stage only files belonging to this story",
+        "Write .scratch/distributed-gguf-runtime/evidence/DGR-016/README.md with files changed, exact commands and real results, limitations, compatibility notes, and dependent-story handoff",
+        "Update only this story issue to Status: done after every acceptance criterion and quality gate passes"
+      ],
+      "priority": 16,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-gguf-runtime/issues/16-produce-the-upstream-llama-cpp-collaboration-package.md",
+      "dependsOn": [
+        "DGR-010"
+      ]
+    }
+  ]
+}

.scratch/distributed-gguf-runtime/research-prior-art.md

@@ -0,0 +1,233 @@
+# Prior Art: Distributed Large-Model Inference
+
+> **Superseded as the current source audit.** Use [`docs/research/distributed-gguf-landscape.md`](../../docs/research/distributed-gguf-landscape.md), [`distributed-gguf-github-followup.md`](../../docs/research/distributed-gguf-github-followup.md), and [`vllm-distributed-gguf-assessment.md`](../../docs/research/vllm-distributed-gguf-assessment.md). This file remains as early historical research.
+
+This note captures what existing projects appear to solve and what remains specific to this platform.
+
+## Petals
+
+Source: <https://github.com/bigscience-workshop/petals>
+
+Petals is the closest conceptual match for public volunteer inference. Its README describes running large models "BitTorrent-style", where a user loads a model through a `transformers`-like API and connects to a distributed network that hosts model layers. It explicitly supports seeing hidden states and using PyTorch/Transformers flexibility. The public README also notes privacy limitations: data is processed by other people in the public swarm, and sensitive use should run in a private swarm.
+
+What it solves:
+
+- public swarm of layer-serving peers
+- hidden-state exposure
+- route-like execution over model blocks
+- private swarm option
+- PyTorch/Transformers integration
+
+What it does not directly solve for us:
+
+- GGUF/llama.cpp artifact path
+- torrent artifact storage tied to node rewards
+- our billing/fraud/reputation model
+- our OpenAI-compatible tracker/node route model
+- a production path for GLM-5.2/DSA GGUF
+
+Design import:
+
+- Keep a PyTorch route as a reference implementation and validation harness.
+- Preserve hidden-state seam semantics.
+- Treat privacy as an explicit swarm property.
+
+## exo
+
+Source: <https://github.com/exo-explore/exo>
+
+exo connects local devices into an AI cluster. Its README emphasizes automatic device discovery, topology-aware model splitting, tensor parallelism, MLX support, RDMA over Thunderbolt, and multiple API compatibilities. It is strongest for colocated owned devices, especially Apple Silicon / MLX clusters.
+
+What it solves:
+
+- automatic local cluster discovery
+- topology-aware splitting
+- tensor parallelism
+- OpenAI/Ollama/Claude API compatibility
+- model placement previews
+- cluster dashboard
+
+What it does not directly solve for us:
+
+- untrusted internet volunteer network
+- reward, fraud, and reputation
+- torrent artifact distribution
+- Linux GPU maturity is stated as still under development in the README
+- GGUF/llama.cpp route protocol
+
+Design import:
+
+- Add placement previews before committing a route.
+- Model prefill/decode separately in benchmarks.
+- Use topology-aware routing, not just layer coverage.
+
+## Distributed Llama / dllama
+
+Source: <https://github.com/b4rtaz/distributed-llama>
+
+Distributed Llama connects home devices into a cluster for CPU/GPU inference. Its README describes tensor parallelism, Ethernet synchronization, Linux/macOS/Windows support, ARM and x86 AVX2 optimization, and a root/worker architecture. The root node loads the model and forwards weights/state to workers. Known limitations include only `2^n` nodes and a maximum node count equal to the model's number of KV heads.
+
+What it solves:
+
+- practical cross-platform home-device cluster
+- tensor-parallel synchronization
+- root/worker process model
+- custom model format and conversion path
+
+What it does not directly solve for us:
+
+- arbitrary volunteer joins/leaves
+- independent shard ownership from local/torrent disk
+- layer-range routing with tracker-managed marketplace
+- public network fraud/billing
+- GGUF as the native published artifact
+
+Design import:
+
+- KV-head constraints matter for tensor-parallel designs.
+- A root node that distributes weights is unacceptable for our torrent-first marketplace; nodes must independently acquire artifacts.
+
+## prima.cpp
+
+Sources:
+
+- <https://github.com/Lizonghang/prima.cpp>
+- <https://arxiv.org/abs/2504.08791>
+
+prima.cpp is a distributed llama.cpp implementation for low-resource home clusters. The README highlights mmap-based low memory pressure, piped-ring parallelism with prefetching, heterogeneity-aware workload distribution, automatic weak-device removal, GGUF quantization support, speculative decoding, dynamic batching, and support for Llama/Qwen/DeepSeek-class models. Its commands require each rank to point at the same GGUF file, and the README shows ring communication across ranks.
+
+What it solves:
+
+- llama.cpp-derived GGUF distributed execution
+- heterogeneous device scheduling
+- low memory pressure via mmap/page cache behavior
+- disk prefetch as a first-class performance dimension
+- ring communication for home clusters
+- GGUF quantization support
+
+What it does not directly solve for us:
+
+- public volunteer marketplace
+- torrent artifact discovery and seeding economics
+- tracker-injected route over internet/NAT/relay
+- per-node independent shard selection and rewards
+- GLM-5.2 support is not established from the README
+
+Design import:
+
+- Study mmap and prefetching before inventing partial GGUF loading.
+- Include disk speed and memory pressure in routing.
+- Heterogeneity-aware scheduling is mandatory.
+- Weak nodes should be excluded from a route if they slow the whole decode path.
+
+## llama.cpp / GGUF
+
+Sources:
+
+- <https://github.com/ggml-org/llama.cpp>
+- <https://raw.githubusercontent.com/ggml-org/llama.cpp/master/tools/gguf-split/README.md>
+- <https://raw.githubusercontent.com/ggml-org/llama.cpp/master/ggml/CMakeLists.txt>
+
+llama.cpp is the performance runtime we want for GGUF. It supports local GGUF loading, many CPU/GPU backends, OpenAI-compatible serving, quantization, and `gguf-split` can split or merge GGUF files by max size or tensor count. The ggml build options include many hardware backends and RPC support.
+
+What it solves:
+
+- mature CPU/GPU local inference
+- GGUF ecosystem
+- quantized weights
+- local OpenAI-compatible server
+- split/merge tooling for artifact distribution
+
+What it does not solve by itself:
+
+- torrent distribution and reward model
+- per-session distributed route over arbitrary nodes
+- public-node trust/fraud model
+- stable API for arbitrary layer-boundary hidden-state I/O, if not already exposed
+
+Design import:
+
+- Use llama.cpp locally before attempting distributed GGUF.
+- Collaborate upstream on layer-range execution and KV ownership APIs.
+- Keep GGUF split for artifacts, not as the only execution-shard definition.
+
+## GLM-5.2
+
+Sources:
+
+- <https://huggingface.co/zai-org/GLM-5.2>
+- <https://huggingface.co/zai-org/GLM-5.2/blob/main/config.json>
+
+GLM-5.2 is MIT licensed, 753B parameters, and advertises a 1M-token context. The config uses `glm_moe_dsa`, 78 layers, `hidden_size=6144`, `kv_lora_rank=512`, `qk_head_dim=256`, `qk_nope_head_dim=192`, `qk_rope_head_dim=64`, `v_head_dim=256`, and `max_position_embeddings=1048576`. The model card states IndexShare reduces per-token FLOPs at 1M context.
+
+Design import:
+
+- DSA/MLA-style compressed KV makes 128K feasible.
+- Tracker should not need to understand DSA internals; backend should expose cache budget and compatibility metadata.
+- GLM-5.2 is a later target after generic distributed KV works.
+
+## DeepSeek-V4-Flash
+
+Sources:
+
+- <https://huggingface.co/deepseek-ai/DeepSeek-V4-Flash>
+- <https://huggingface.co/deepseek-ai/DeepSeek-V4-Flash/blob/main/config.json>
+
+DeepSeek-V4-Flash is MIT licensed and published as `deepseek-ai/DeepSeek-V4-Flash` on Hugging Face. The model card describes DeepSeek-V4-Flash as a 284B-parameter MoE model with 13B activated parameters and a 1M-token context. Hugging Face tags it as `deepseek_v4`, Transformers, Safetensors, and FP8. The repository lists 46 safetensor shards and around 160 GB total size.
+
+Config highlights:
+
+- `model_type=deepseek_v4`
+- `hidden_size=4096`
+- `num_hidden_layers=43`
+- `num_attention_heads=64`
+- `num_key_value_heads=1`
+- `n_routed_experts=256`
+- `num_experts_per_tok=6`
+- `q_lora_rank=1024`
+- `o_lora_rank=1024`
+- `qk_rope_head_dim=64`
+- `sliding_window=128`
+- `max_position_embeddings=1048576`
+- `expert_dtype=fp4`
+- FP8 quantization metadata
+
+Design import:
+
+- Good first serious large-model target after the protocol smoke test because it is much smaller than 1.6T-class models while still validating MoE, compressed attention/cache behavior, and large-context routing.
+- Not the first protocol smoke model. Use a smaller, boring, llama.cpp-supported GGUF model first so route/session/KV bugs are isolated from DeepSeek-specific architecture support.
+- The support audit must verify the available local runtime path: PyTorch/Transformers, vLLM/SGLang, and any GGUF/llama.cpp quantization route.
+
+## Ornith-1.0-397B
+
+Sources:
+
+- <https://huggingface.co/deepreinforce-ai/Ornith-1.0-397B>
+- <https://huggingface.co/inferencerlabs/Ornith-1.0-397B-MLX-Q9>
+
+Ornith-1.0-397B is MIT licensed, Qwen3.5-MoE based, with 397B MoE scale. Its base config shows 60 layers and a hybrid pattern where full attention appears every fourth layer, with other layers using linear attention. The MLX Q9 quantized variant is around 447 GB and reports high-quality Q9 behavior in its model card.
+
+Design import:
+
+- Hybrid attention can make large models more tractable than dense full-attention assumptions.
+- Model-specific cache accounting is required; "params" alone is not enough to route.
+
+## Synthesis
+
+The prior art strongly supports the direction, but no project exactly matches the target product:
+
+- Petals proves volunteer layer-serving is useful.
+- exo proves UX/topology-aware local clusters matter.
+- Distributed Llama proves CPU home clusters can cooperate but also shows root/worker constraints.
+- prima.cpp proves llama.cpp/GGUF distribution across low-resource devices is plausible and that disk/mmap scheduling matters.
+- llama.cpp/GGUF is the ecosystem to collaborate with for runtime performance.
+- DeepSeek-V4-Flash is a plausible first serious large-model target after a small protocol smoke model.
+
+The platform-specific work remains:
+
+- torrent/content-addressed model artifact marketplace
+- tracker-owned route selection and billing
+- per-shard local KV sessions
+- relay/NAT support
+- fraud/reputation/audit
+- OpenAI-compatible public gateway

.scratch/distributed-gguf-runtime/technical-challenges.md

@@ -0,0 +1,414 @@
+# Distributed GGUF Technical Challenge Register
+
+> **Historical challenge register.** Route Session, binary activation, local Hot KV State, and transport performance work have advanced since this file was written. Current implementation gates live in [PRD.md](PRD.md), [implementation-strategy.md](implementation-strategy.md), [architecture.md](architecture.md), and [prd.json](prd.json). Preserve this file for detailed risk context; do not treat its “current constraint” section as live system state.
+
+This document focuses on the engineering problems that decide whether the distributed GGUF path is viable. The important distinction is:
+
+- **Model artifacts move like torrents.**
+- **Inference state moves like a pipeline.**
+- **Hot KV state does not move unless we are explicitly checkpointing or repairing a route.**
+
+## Current Constraint
+
+The existing full local PyTorch path lets Transformers own generation and local KV cache.
+
+The existing distributed PyTorch path does not. It manually calls shard layers with cache disabled and recomputes the whole growing prompt for every generated token. It passes hidden activations across shard boundaries, not KV cache, but those activations currently include the full sequence on every decode step.
+
+For a 128K context and `hidden_size=6144`, one bfloat16 activation crossing one shard boundary is roughly:
+
+```text
+131072 tokens * 6144 hidden * 2 bytes = 1.5 GiB
+```
+
+That is acceptable once during chunked prefill only if chunked and streamed. It is not acceptable once per generated token.
+
+## Challenge 1: Decode Must Be O(1) Per Token Across Each Seam
+
+Problem:
+
+During decode, sending `[batch, sequence, hidden]` over the network scales with context length. At 128K, the network dominates everything.
+
+Solution:
+
+Split execution into explicit **prefill** and **decode-step** phases.
+
+- Prefill accepts prompt chunks and builds local cache on every shard.
+- Decode-step accepts exactly one new token or one-step activation.
+- Every shard reads its own hot KV state, appends one position, and forwards a one-step activation.
+
+Acceptance test:
+
+- A two-node route prefills a 4K prompt once.
+- The next 100 generated tokens do not resend a 4K activation.
+- Decode seam payload is proportional to `hidden_size`, not `context_length * hidden_size`.
+
+## Challenge 2: Stable Route Session State
+
+Problem:
+
+KV cache only works if every hop agrees that multiple calls belong to the same route session. A fresh request id per hop or per token destroys cache locality.
+
+Solution:
+
+Introduce a route-session lifecycle.
+
+```text
+create route session
+  -> tracker pins inference route
+  -> head node assigns session_id and route_id
+  -> every hop allocates local cache for its layer range
+  -> prefill chunks append cache
+  -> decode steps append cache
+  -> close session releases cache
+```
+
+Minimum state key:
+
+```text
+session_id
+route_id
+model_preset
+model_revision
+backend_id
+cache_abi
+layer_start
+layer_end
+position
+```
+
+Acceptance test:
+
+- A node can report active sessions and cache bytes by session.
+- Closing a session frees the per-shard cache.
+- Replaying a decode-step with the wrong route/session fails before model execution.
+
+## Challenge 3: KV Cache Ownership
+
+Problem:
+
+A centralized KV cache sounds attractive for failover, but it puts remote storage in the tightest loop of generation. It also creates privacy and consistency problems.
+
+Solution:
+
+Hot KV state is owned by the node that owns the shard for that route session.
+
+```text
+Node A: layers 0..15 hot KV for session S
+Node B: layers 16..31 hot KV for session S
+Node C: layers 32..77 hot KV for session S
+```
+
+The tracker may know where active KV lives, but it does not serve it during decode.
+
+Cache servers may store:
+
+- prefix snapshots
+- failover checkpoints
+- audit samples
+- cold reusable context blocks
+
+They must not be required for every generated token.
+
+Acceptance test:
+
+- Killing a cache server does not affect an active decode route.
+- Killing a route node fails the route in alpha unless a compatible snapshot exists.
+
+## Challenge 4: Prefill Is Still Large
+
+Problem:
+
+Even with correct decode, prefill can move a lot of data. A 128K prompt cannot be sent as one activation blob through many shard boundaries.
+
+Solution:
+
+Use the existing binary activation direction from ADR-0008:
+
+- bfloat16 activation body
+- shape/dtype/session metadata in headers
+- zstd level 1 optional compression
+- chunked prefill
+- backpressure between hops
+
+For large contexts, prefill should stream in chunks such as 128, 256, or 512 tokens. The right chunk size is a benchmark output, not a constant baked into the domain model.
+
+Acceptance test:
+
+- Peak per-hop prefill memory is bounded by chunk size.
+- A slow downstream node applies backpressure instead of letting upstream buffer the whole prompt.
+
+## Challenge 5: GGUF Artifact Splits Are Not Execution Shards
+
+Problem:
+
+GGUF split files can divide model data by size or tensor count. That is useful for storage and transfer, but it is not the same as a network Shard. A Shard in this project is a contiguous layer range with reward, route, and cache meaning.
+
+Solution:
+
+Define an artifact manifest that maps storage chunks to semantic model parts.
+
+Required concepts:
+
+```text
+artifact_id
+model_preset
+upstream_repo
+upstream_revision
+license
+runtime_backend
+quantization
+context_cap
+file_hashes
+piece_hashes
+tensor_to_layer_map
+layer_to_artifact_map
+tokenizer_artifacts
+cache_descriptor
+```
+
+The Shard Swarm seeds artifacts. The Inference Route executes shards.
+
+Acceptance test:
+
+- Given `layers 16..31`, a node can compute the exact artifact pieces it must download and verify.
+- Given a local artifact directory, the node can prove which layer ranges it can serve.
+
+## Challenge 6: llama.cpp Is Optimized For Whole-Graph Execution
+
+Problem:
+
+`llama-server` is excellent for local inference, but a distributed route needs lower-level capabilities:
+
+- load selected layers/tensors or mmap them without full materialization
+- accept hidden states from a previous shard
+- execute only a layer range
+- emit hidden states at a boundary
+- own KV/state for only that layer range
+- report cache layout and memory requirements
+
+Those are not the normal public serving abstractions.
+
+Solution:
+
+Stage the llama.cpp path instead of jumping directly to internet-scale distributed GGUF.
+
+1. Use llama.cpp as a full local GGUF backend for immediate CPU performance.
+2. Build a localhost layer-boundary prototype on a simple supported GGUF model.
+3. Identify the minimal `libllama`/ggml hooks needed for layer-range execution.
+4. Collaborate upstream on a stable extension rather than carrying a long-lived fork.
+
+Acceptance test:
+
+- Process A runs layers `0..k`, exports hidden states.
+- Process B imports those hidden states, runs `k+1..n`, and produces logits close to full single-process execution.
+- Both processes maintain only their own cache state.
+
+## Challenge 7: Model Architectures Are Not Uniform
+
+Problem:
+
+Dense Llama-style attention, MoE, MLA/DSA, and hybrid linear/full attention do not have the same cache shape, routing cost, or layer cost.
+
+GLM-5.2 uses compressed DSA/MLA-style state. Ornith uses a hybrid attention pattern. Parameter count alone is a poor routing metric.
+
+Solution:
+
+Keep model-specific cache internals inside the backend. The tracker should route based on backend-advertised capabilities and measured telemetry, not on hardcoded tensor formulas.
+
+Backend capability report:
+
+```text
+model_arch
+supported_runtime
+supports_prefill
+supports_decode_step
+supports_layer_range
+supports_partial_artifacts
+cache_abi
+cache_bytes_per_token_estimate
+prefill_tokens_per_second
+decode_tokens_per_second
+active_memory_floor
+```
+
+Acceptance test:
+
+- The tracker can reject a route because one node lacks the required cache ABI.
+- A model support audit can say "artifact available, local full inference works, distributed layer-boundary unsupported" without ambiguity.
+
+## Challenge 8: Tensor Parallelism Is Not The Same Product
+
+Problem:
+
+Projects like Distributed Llama and prima.cpp lean toward local-cluster tensor/ring parallelism. That can work on a trusted LAN, but it usually requires tight synchronization every layer. On a public internet volunteer route, that becomes fragile and hard to reward.
+
+Solution:
+
+For the public network, make a Shard a contiguous layer range. Tensor parallelism can exist inside one node, one trusted colocated pod, or one future "composite node", but not as the first public routing primitive.
+
+Acceptance test:
+
+- A public route can be represented as ordered layer coverage.
+- Billing can attribute work to layer ranges.
+- No cross-node all-reduce is required on every layer for v1.
+
+## Challenge 9: Heterogeneity And Stragglers
+
+Problem:
+
+A route is only as fast as its slowest hop during decode. A weak node holding a bottleneck shard can make a 1.6T model technically available but unusable.
+
+Solution:
+
+Route selection must use measured telemetry, not static declarations.
+
+Metrics:
+
+- prefill throughput
+- decode throughput
+- queue depth
+- disk read rate
+- memory pressure
+- network latency to neighbors
+- route failure rate
+- cache warmth
+
+The tracker should prefer complete routes that avoid weak nodes, and the rebalancer should increase redundancy for bottleneck layer ranges.
+
+Acceptance test:
+
+- A slow node is removed from a candidate route even if it has the needed layer range.
+- The coverage map can show "covered but under-provisioned" separately from "coverage gap".
+
+## Challenge 10: Reliability And Failover
+
+Problem:
+
+If hot KV is local, route repair is not free. A replacement node cannot continue decoding unless it has compatible cache state.
+
+Solution:
+
+Alpha behavior should be simple:
+
+- route failure during prefill: fail and retry from scratch
+- route failure during decode: fail unless compatible snapshot exists
+- tracker restart: active sessions may be lost
+- node restart: local hot KV is lost
+- client-visible telemetry reports the last known phase and failure reason
+
+Later behavior:
+
+- periodic prefix snapshots
+- snapshot generation ids
+- cache ABI compatibility checks
+- route repair only when the replacement node has the same model revision, layer range, backend cache ABI, and snapshot position
+
+Acceptance test:
+
+- Failures produce explicit route-session errors.
+- No node silently continues from missing or incompatible cache state.
+
+## Challenge 11: Privacy, Fraud, And Audit
+
+Problem:
+
+Hidden activations and KV state can leak information. Public volunteer inference is not private by default. Also, a node can return bad activations while still appearing available.
+
+Solution:
+
+Separate product modes:
+
+- public swarm: low privacy, broad access, audited
+- private swarm: trusted nodes, stronger privacy expectation
+- paid trusted route: selected nodes with stronger guarantees
+
+Use existing validation-event and slash-proof concepts for audit, but adapt them to distributed routes:
+
+- record model preset, route, node wallets, prompt metadata, output, and sampling seed
+- sample full-route replays where feasible
+- compare output/logits within model-specific tolerance
+
+Acceptance test:
+
+- A client can choose public or private route policy.
+- A validation event contains enough information to reproduce route membership and observed output.
+
+## Challenge 12: Economics Must Not Reward The Wrong Bottleneck
+
+Problem:
+
+Layer count, parameter count, active MoE experts, cache memory, disk serving, and network transfer are different costs. A naive equal split across nodes will be wrong.
+
+Solution:
+
+Start with simple compute accounting:
+
+```text
+node_reward_weight =
+  owned_layer_work
+  * prefill_tokens
+  + owned_layer_work
+  * decode_tokens
+```
+
+Then refine with:
+
+- measured throughput
+- active MoE cost
+- storage/seeding contribution
+- cache memory reservation
+- reliability
+
+Keep artifact seeding rewards separate from inference rewards until fraud and metering are clear.
+
+Acceptance test:
+
+- A node that only seeds artifacts is not paid as if it executed inference.
+- A node that executes a heavier shard can earn more than a node executing a light shard.
+
+## Challenge 13: Long Requests Need Streaming Or Realtime Feedback
+
+Problem:
+
+Large distributed routes may spend meaningful time in artifact loading, prefill, queueing, or slow decode. The product can tolerate latency, but users should not wait blindly.
+
+Solution:
+
+Streaming token deltas is preferred when the backend and client transport support it. Generation Telemetry is required regardless of whether token deltas are streamed.
+
+Minimum telemetry:
+
+```text
+session_id
+route_id
+model_preset
+phase = queued | loading | prefill | decode | finalizing | failed
+prefill_tokens_done
+prefill_tokens_total
+generated_tokens
+rolling_tokens_per_second
+average_tokens_per_second
+active_route_nodes
+failure_reason
+```
+
+The gateway may expose token deltas and telemetry through Server-Sent Events or WebSocket. Simple clients may use a polling endpoint for telemetry and receive the final answer only when complete.
+
+Acceptance test:
+
+- A client can show live progress before the first output token is available.
+- During decode, the user sees streamed token deltas when supported.
+- During decode, the user sees rolling tokens/sec even if output text is not streamed.
+- A failed route returns a final error and the last known phase/reason.
+
+## Engineering Order
+
+1. Fix distributed PyTorch cache semantics first. This proves the route-session model without llama.cpp internals.
+2. Add local full-model llama.cpp/GGUF serving for immediate CPU improvement.
+3. Add Generation Telemetry for route sessions so long requests are observable.
+4. Preserve binary HTTP activation transfer while splitting prefill/decode and measuring payload sizes.
+5. Add artifact manifest and Shard Swarm metadata.
+6. Prototype llama.cpp layer-boundary execution locally.
+7. Network the GGUF route only after the cache/session protocol works.
+8. Audit DeepSeek-V4-Flash as the first serious large-model target.
+9. Audit GLM-5.2 and Ornith support after simpler GGUF models pass the route test.

.scratch/distributed-inference-network/prd.json

@@ -1,399 +0,0 @@
-{
-  "name": "Distributed Inference Network",
-  "description": "Build a distributed inference network with node, gateway, tracker, SDK, contracts, and P2P shard distribution components from the grill session PRD.",
-  "branchName": "ralph/distributed-inference-network",
-  "userStories": [
-    {
-      "id": "US-001",
-      "title": "01 \u2014 Monorepo scaffold + single-node smoke test",
-      "description": "Stand up the monorepo package layout and prove that a client HTTP request can travel end-to-end through the stack \u2014 gateway \u2192 one node serving all layers \u2192 valid response \u2014 before any real model or distributed logic is wired in. The six top-level packages should exist with minimal stubs: - `packages/node` \u2014 node client CLI (`meshnet-node`) - `packages/gateway` \u2014 HTTP gateway + route orchestration - `packages/tracker` \u2014 node registry and route selection - `packages/sdk` \u2014 `meshnet` Python SDK - `packages/contracts` \u2014 Solana smart contract wrappers - `packages/p2p` \u2014 gossip and shard swarm The smoke test uses a tiny in-process stub model (not a real LLM) so the test is fast and has no external dependencies. The node runs in the same process as the test. The gateway is a real HTTP server. The client sends a real `POST /v1/chat/completions` request and receives a valid OpenAI-format response.",
-      "acceptanceCriteria": [
-        "`pip install -e packages/node packages/gateway packages/tracker` works from repo root",
-        "`meshnet-node`, `meshnet-gateway`, and `meshnet-tracker` CLI entry points exist",
-        "A single integration test starts a gateway and one stub node in-process, sends a `POST /v1/chat/completions` request, and asserts a valid OpenAI-format response is returned",
-        "The test passes with `pytest` from repo root with no external services running",
-        "All six package directories exist with `pyproject.toml` and an importable top-level module",
-        "Follow TDD where code is added: add/adjust an observable behavior test before implementation when practical",
-        "Run the task-specific tests and ensure they pass",
-        "Run `python -m pytest` from repo root and ensure it passes, or document why no test suite exists yet",
-        "Keep the implementation scoped to this story; do not implement downstream stories early",
-        "Commit only this story's code changes with a focused conventional commit message"
-      ],
-      "priority": 1,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/01-monorepo-scaffold.md",
-      "dependsOn": [],
-      "completionNotes": "Completed by Ralph iteration 7b260695; verified by pytest and editable package installs.",
-      "status": "done"
-    },
-    {
-      "id": "US-002",
-      "title": "02 \u2014 Two-node shard pipeline",
-      "description": "Extend the single-node smoke test so that inference is routed through exactly two nodes, each serving half of a stub model's layers. Activation tensors must travel from the gateway to node A, then from node A to node B, and the final output returns to the gateway. This proves the distributed shard pipeline works end-to-end before real models or a real tracker are introduced. The two nodes run in the same process as the test (no real network required). The gateway hardcodes the two-node route for now \u2014 dynamic route selection comes in issue 03. The activation tensor protocol (shape, dtype, serialisation format) must be established here, as all later issues depend on it. Use the domain vocabulary from `CONTEXT.md`: the ordered list of nodes is an **inference route**; each node's layer range is a **shard**; the tensors passed between nodes are activations (not \"data\" or \"chunks\").",
-      "acceptanceCriteria": [
-        "The integration test spins up two stub nodes, each configured with a non-overlapping shard range",
-        "A `POST /v1/chat/completions` request results in activation tensors flowing node-A \u2192 node-B (verifiable via test assertions or logs)",
-        "The gateway assembles the final response correctly from node-B's output",
-        "The test passes with no external services running",
-        "The activation tensor serialisation format is documented in a short inline comment (shape, dtype, wire format) \u2014 this becomes the contract all future nodes implement",
-        "Follow TDD where code is added: add/adjust an observable behavior test before implementation when practical",
-        "Run the task-specific tests and ensure they pass",
-        "Run `python -m pytest` from repo root and ensure it passes, or document why no test suite exists yet",
-        "Keep the implementation scoped to this story; do not implement downstream stories early",
-        "Commit only this story's code changes with a focused conventional commit message"
-      ],
-      "priority": 2,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/02-two-node-shard-pipeline.md",
-      "dependsOn": [
-        "US-001"
-      ],
-      "completionNotes": "Completed by Ralph iteration 126384e5; verified by pytest two-node pipeline.",
-      "status": "to-revise",
-      "status_reason": "Base64 JSON wire format established here was replaced by binary HTTP protocol in US-011. tests/test_two_node_pipeline.py needs verification it exercises the new binary format end-to-end."
-    },
-    {
-      "id": "US-003",
-      "title": "03 \u2014 Tracker: node registration + route selection",
-      "description": "Replace the hardcoded two-node route from issue 02 with a real tracker. Nodes register themselves with the tracker on startup (endpoint, shard range, hardware profile, node score). The gateway queries the tracker for an inference route for a given model preset instead of using a static list. The tracker returns an ordered list of node endpoints whose shards collectively cover all layers. The tracker runs as a lightweight HTTP service. Node score is initially a simple placeholder (e.g. fixed value or random) \u2014 real throughput/latency scoring comes later. The tracker must correctly reject route requests when no registered nodes cover a required shard range and return an appropriate error. This issue establishes the tracker's registration and routing API contract, which issues 04 (node startup) and 05 (OpenAI gateway) both depend on.",
-      "acceptanceCriteria": [
-        "A node can register with the tracker via HTTP, providing its endpoint, shard range, and a hardware profile",
-        "The gateway queries the tracker with a model preset name and receives an ordered list of node endpoints forming a complete inference route",
-        "The end-to-end integration test from issue 02 still passes with the tracker now in the loop (no hardcoded routes)",
-        "The tracker returns a clear error response when no route is available for a requested model preset",
-        "Nodes that fail to heartbeat within a configurable window are removed from the registry",
-        "The tracker's registration and route-selection HTTP API is defined (paths, request/response shapes) in the tracker package",
-        "Follow TDD where code is added: add/adjust an observable behavior test before implementation when practical",
-        "Run the task-specific tests and ensure they pass",
-        "Run `python -m pytest` from repo root and ensure it passes, or document why no test suite exists yet",
-        "Keep the implementation scoped to this story; do not implement downstream stories early",
-        "Commit only this story's code changes with a focused conventional commit message"
-      ],
-      "priority": 3,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/03-tracker-registration-and-routing.md",
-      "dependsOn": [
-        "US-002"
-      ],
-      "completionNotes": "Completed by Ralph iteration 79796dd2; verified by pytest, compileall, editable installs, CLI help, and spec/code reviews.",
-      "status": "done"
-    },
-    {
-      "id": "US-004",
-      "title": "04 \u2014 Node client startup flow (`meshnet-node start`)",
-      "description": "Make `meshnet-node start` self-configuring from scratch on a machine with a CUDA-capable GPU (or CPU fallback). The full startup sequence must complete without any manual configuration: 1. Detect GPU model and available VRAM 2. Load an existing Solana wallet from disk, or generate and save a new one 3. Query the tracker for the optimal shard assignment given the hardware profile 4. Download the assigned shard from HuggingFace (`huggingface_hub`) 5. Register with the tracker (wallet address, endpoint, shard range, hardware profile) 6. Begin accepting inference connections The node prints a short status summary on startup: wallet address, assigned shard, model preset, and download progress. No interactive prompts \u2014 the entire flow is non-interactive. This is the primary viral growth vector. Every second of friction in this flow costs node operators. The startup sequence must work on Linux with CUDA, and degrade gracefully to CPU on machines without a GPU.",
-      "acceptanceCriteria": [
-        "`meshnet-node start --tracker http://localhost:8080` completes startup without prompts on a machine with a CUDA GPU",
-        "A Solana wallet keypair is generated and saved to `~/.config/meshnet/wallet.json` if none exists",
-        "The assigned shard is downloaded from HuggingFace and cached to `~/.cache/meshnet/shards/`",
-        "The node registers with the tracker and appears in the tracker's node registry",
-        "The node accepts a live inference connection and processes activation tensors correctly after startup",
-        "On a CPU-only machine, the node starts with a warning and serves a CPU-appropriate shard",
-        "An integration test covers the full startup sequence against a local tracker stub",
-        "Follow TDD where code is added: add/adjust an observable behavior test before implementation when practical",
-        "Run the task-specific tests and ensure they pass",
-        "Run `python -m pytest` from repo root and ensure it passes, or document why no test suite exists yet",
-        "Keep the implementation scoped to this story; do not implement downstream stories early",
-        "Commit only this story's code changes with a focused conventional commit message"
-      ],
-      "priority": 4,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/04-node-client-startup.md",
-      "dependsOn": [
-        "US-003"
-      ],
-      "completionNotes": "Completed by Ralph iteration 86510a10; verified by pytest, compileall, editable installs, CLI help, and final review.",
-      "status": "done"
-    },
-    {
-      "id": "US-005",
-      "title": "05 \u2014 OpenAI-compatible gateway",
-      "description": "Expose a production-shape HTTP API from the gateway so that any client using the OpenAI Python SDK (or any OpenAI-compatible tool) works by changing only the `base_url`. The gateway translates OpenAI-format requests into inference route execution and streams responses back in OpenAI-format. Endpoints to implement: - `POST /v1/chat/completions` \u2014 streaming (`text/event-stream`) and non-streaming - `GET /v1/models` \u2014 returns the list of model presets currently routable on the network - `GET /v1/health` \u2014 liveness check The gateway selects an inference route from the tracker, executes the shard pipeline, and assembles the streamed response. If the tracker returns no route for the requested model, the gateway responds with a standard OpenAI-format error (`model_not_available`). Authentication (API key \u2192 SOL/USDC balance) is a stub in this issue \u2014 return 200 for any non-empty `Authorization` header. Real payment gating comes in issue 06.",
-      "acceptanceCriteria": [
-        "`openai.OpenAI(base_url=\"http://localhost:8080/v1\", api_key=\"test\").chat.completions.create(model=\"stub-model\", messages=[...])` returns a valid response",
-        "Streaming works: `stream=True` returns `text/event-stream` chunks in OpenAI SSE format",
-        "`GET /v1/models` returns a JSON array of available model preset names",
-        "A request for an unavailable model returns an OpenAI-format error response with HTTP 503",
-        "LangChain `ChatOpenAI(base_url=..., api_key=...)` works against the gateway",
-        "An integration test covers streaming and non-streaming paths end-to-end through a real tracker and two stub nodes",
-        "Follow TDD where code is added: add/adjust an observable behavior test before implementation when practical",
-        "Run the task-specific tests and ensure they pass",
-        "Run `python -m pytest` from repo root and ensure it passes, or document why no test suite exists yet",
-        "Keep the implementation scoped to this story; do not implement downstream stories early",
-        "Commit only this story's code changes with a focused conventional commit message"
-      ],
-      "priority": 5,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/05-openai-compatible-gateway.md",
-      "dependsOn": [
-        "US-003"
-      ],
-      "completionNotes": "Completed by agent",
-      "status": "to-revise",
-      "status_reason": "Gateway is currently the pipeline orchestrator. US-014 moves orchestration to tracker-nodes; gateway becomes a thin load-balancer proxy. Implementation will be superseded \u2014 defer rework until US-014 lands."
-    },
-    {
-      "id": "US-006",
-      "title": "06 \u2014 Solana stake + settlement contracts",
-      "description": "Deploy and integrate the Solana smart contracts that make node staking, client payment, and token reward settlement trustless. All development and testing targets **Solana testnet** \u2014 never devnet or mainnet during development, to avoid real costs.",
-      "acceptanceCriteria": [
-        "All contracts deploy successfully to Solana testnet",
-        "A node can submit a stake transaction and have its balance reflected in the registry contract",
-        "A client can fund an API key account with testnet SOL",
-        "After a completed inference session, compute attribution is recorded on-chain with correct node/layer attribution",
-        "The epoch settlement transaction correctly distributes token rewards to node operators and deducts client balances",
-        "The gateway refuses to route to a node whose stake balance is below the minimum threshold",
-        "All contract interactions in tests run against a local Solana test validator (via `solana-test-validator`) \u2014 no live testnet required for CI",
-        "A `.env.testnet` config points to Solana testnet RPC for manual end-to-end testing",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 6,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/06-solana-stake-and-settlement.md",
-      "dependsOn": [
-        "US-003"
-      ],
-      "completionNotes": "Completed by fresh Ralph/Codex session c257ffde with controller patches for clarified economics; verified by pytest, compileall, and diff check.",
-      "status": "done"
-    },
-    {
-      "id": "US-007",
-      "title": "07 \u2014 Fraud detection: validator + on-chain slash",
-      "description": "Implement the optimistic fraud detection loop. After each inference request completes, the validator process independently decides whether to re-run the request on a reference node (~5% sample rate).",
-      "acceptanceCriteria": [
-        "The validator process samples ~5% of completed inference requests (configurable)",
-        "A node returning a deliberately wrong output is detected and slashed within one validation cycle",
-        "The on-chain stake balance of the slashed node decreases by the correct slash amount",
-        "The strike count for the slashed node increments on-chain",
-        "A node that reaches the strike threshold is excluded from route selection on the next gateway request",
-        "A slashed node logs a clear warning to stdout",
-        "An integration test: run a deliberately-bad node, send 20 requests, assert at least one slash transaction is submitted and the node is eventually excluded from routes",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 7,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/07-fraud-detection-slash.md",
-      "dependsOn": [
-        "US-005",
-        "US-006"
-      ],
-      "completionNotes": "Completed by fresh Ralph/Codex session 04475912 with controller fix for duplicate slash suppression; verified by pytest, compileall, and diff check.",
-      "status": "done"
-    },
-    {
-      "id": "US-008",
-      "title": "08 \u2014 Node probationary period + ban enforcement",
-      "description": "Implement the two anti-sybil mechanisms that make re-entering the network after a ban economically costly.",
-      "acceptanceCriteria": [
-        "A node with a new wallet receives no token rewards for its first N jobs (verified via settlement contract state)",
-        "The node client prints remaining probationary jobs on startup",
-        "After N jobs, the next epoch settlement correctly credits the node with token rewards",
-        "A wallet with strike count at the threshold is marked banned in the registry contract",
-        "The tracker excludes banned wallets from route selection",
-        "A banned wallet that attempts to register with the tracker is rejected",
-        "An integration test covers: new wallet \u2192 N jobs \u2192 earning begins; and: strike threshold reached \u2192 banned \u2192 excluded from routes",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 8,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/08-probationary-period-and-bans.md",
-      "dependsOn": [
-        "US-007"
-      ],
-      "completionNotes": "Completed by fresh Ralph/Codex session db3f5c10 with controller test fix for banned registration semantics; verified by pytest, compileall, and diff check.",
-      "status": "done"
-    },
-    {
-      "id": "US-009",
-      "title": "09 \u2014 P2P shard swarm",
-      "description": "Once a node has downloaded a shard, it seeds that shard to other nodes that are assigned the same shard.",
-      "acceptanceCriteria": [
-        "A node that has downloaded a shard is listed as a peer for that shard in the tracker",
-        "A second node assigned the same shard downloads it from the first node (peer) rather than HuggingFace",
-        "If no peers are available, the node falls back to HuggingFace without error",
-        "The node client logs whether the shard was downloaded from a peer or HuggingFace",
-        "Shard chunks are verified against a checksum before being marked complete",
-        "An integration test: node A downloads shard from HuggingFace stub; node B with same assignment downloads from node A",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 9,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/09-p2p-shard-swarm.md",
-      "dependsOn": [
-        "US-004"
-      ],
-      "completionNotes": "Completed by fresh Ralph/Codex session 243fae88 with controller fix for streaming tar archives; verified by pytest, compileall, and diff check.",
-      "status": "done"
-    },
-    {
-      "id": "US-010",
-      "title": "10 \u2014 `meshnet` Python SDK",
-      "description": "A Python SDK (`packages/sdk`) that wraps the OpenAI-compatible gateway and exposes network-specific controls.",
-      "acceptanceCriteria": [
-        "`pip install meshnet` installs the SDK",
-        "`Client.chat.completions.create(...)` works identically to the OpenAI SDK",
-        "`client.wallet.balance()` returns the current SOL/USDC balance for the API key",
-        "`client.wallet.top_up()` returns a valid Solana payment address",
-        "`client.models.available()` returns model presets with shard coverage percentage",
-        "`client.estimate_cost(model, tokens)` returns a cost estimate in SOL",
-        "`client.request(redundancy=2)` sends to two independent inference routes and returns majority response",
-        "The SDK is typed (py.typed, full type stubs)",
-        "An integration test covers each SDK method against a local gateway + tracker + stub nodes",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 10,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/10-meshnet-sdk.md",
-      "dependsOn": [
-        "US-005",
-        "US-006"
-      ],
-      "completionNotes": "Completed by fresh Ralph/Codex session ef4eea0e; verified by pytest, compileall, editable SDK install, and diff check.",
-      "status": "done"
-    },
-    {
-      "id": "US-011",
-      "title": "11 \u2014 Binary activation wire format",
-      "description": "Replace the base64 JSON activation payload with raw binary HTTP bodies, zstd compression, and chunked prefill (128 tokens/chunk). All nodes and the gateway must be migrated. Stub nodes continue to emit zeroed tensors, just in binary. This is a protocol prerequisite for US-012 (real model backend).",
-      "acceptanceCriteria": [
-        "Node /forward endpoint reads shape/dtype/session/chunk from HTTP headers; body is raw binary (optionally zstd-compressed)",
-        "Node /forward response is raw binary with the same header set",
-        "Gateway splits prompts > MESHNET_CHUNK_TOKENS (default 128) into sequential chunks sent through the pipeline",
-        "Integration test: 512-token stub activation (4 chunks) through a two-node pipeline returns 4 valid binary chunk responses",
-        "zstd Python package added as a dependency to packages/node and packages/gateway",
-        "_make_stub_activations replaced with _make_stub_binary_activation(shape, dtype) -> bytes",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 11,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/11-binary-wire-format.md",
-      "dependsOn": [
-        "US-002"
-      ],
-      "completionNotes": "Completed by fresh Ralph/Codex session 3f3bed75; verified by pytest, compileall, and diff check.",
-      "status": "done"
-    },
-    {
-      "id": "US-012",
-      "title": "12 \u2014 Real PyTorch model backend",
-      "description": "Replace stub node inference with actual transformers layer execution. Node loads HuggingFace SafeTensors model shard (model.model.layers[start:end]), runs real forward passes in bfloat16, handles head (embed_tokens) and tail (lm_head) responsibilities, and supports bitsandbytes NF4/INT8/bfloat16 quantization via --quantization flag. Test model: openai-community/gpt2.",
-      "acceptanceCriteria": [
-        "meshnet-node start --model-id openai-community/gpt2 --shard-start 0 --shard-end 6 loads the shard without error",
-        "Head node (shard_start==0) loads tokenizer and embed_tokens",
-        "Tail node (shard_end==total_layers) loads model.norm and lm_head",
-        "Two-node GPT-2 integration test returns deterministic coherent text completion",
-        "--quantization [bfloat16|int8|nf4] flag supported; bfloat16 default",
-        "Node with insufficient VRAM prints clear error and exits",
-        "transformers, bitsandbytes, safetensors, accelerate added as node dependencies",
-        "Integration tests marked @pytest.mark.integration, skipped in CI without GPU",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 12,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/12-real-pytorch-model-backend.md",
-      "dependsOn": [
-        "US-011"
-      ],
-      "completionNotes": "Completed by agent",
-      "status": "done"
-    },
-    {
-      "id": "US-013",
-      "title": "13 \u2014 Coverage-first tracker shard assignment",
-      "description": "Upgrade tracker route selection to coverage-first, speed-weighted bin-packing. Tracker maintains a live coverage map per model, issues LOAD_SHARD/DROP_SHARD rebalance directives when coverage drops, and assigns shard ranges using declared VRAM, quantization, and benchmark throughput. A model is only routable when all layer ranges have node_count >= 1.",
-      "acceptanceCriteria": [
-        "Node registration accepts vram_bytes, ram_bytes, quantizations[], benchmark_tokens_per_sec",
-        "GET /v1/coverage/<model_preset> returns list of {start_layer, end_layer, node_count}",
-        "Model is unroutable when any layer range has node_count=0",
-        "New node gets assigned to highest-priority uncovered range first",
-        "Node disconnection triggers LOAD_SHARD directive to idle node within 30 seconds",
-        "Shard assignment respects VRAM: assigned_layers <= floor((vram_bytes * 0.8) / bytes_per_layer_at_quant)",
-        "Faster node receives wider shard range when both can cover the same gap",
-        "Integration test: three nodes with different VRAM show widest range on largest-VRAM node with 100% coverage",
-        "Integration test: kill middle-range node \u2192 tracker issues LOAD_SHARD \u2192 coverage recovers",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 13,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/13-coverage-first-shard-assignment.md",
-      "dependsOn": [
-        "US-003",
-        "US-012"
-      ],
-      "completionNotes": "Completed by agent",
-      "status": "done"
-    },
-    {
-      "id": "US-014",
-      "title": "14 \u2014 Tracker-as-first-layer-node (inference entry point)",
-      "description": "Merge inference orchestration into tracker nodes that serve the first-layer shard. A tracker node exposes /v1/chat/completions directly: tokenizes input, runs embed_tokens + layers[0..k], selects onward route from coverage map, forwards binary activations, receives tail output, and streams tokens back. The standalone gateway becomes a thin load-balancer routing to tracker nodes.",
-      "acceptanceCriteria": [
-        "Node with shard_start==0 (or --tracker-mode flag) exposes /v1/chat/completions alongside /forward",
-        "Tracker-node /v1/chat/completions: tokenize \u2192 embed \u2192 own layers \u2192 route selection \u2192 forward binary \u2192 receive tail \u2192 stream SSE",
-        "Two tracker nodes for same model each handle requests independently",
-        "Gateway proxies /v1/chat/completions to tracker nodes (round-robin), discovered via GET /v1/tracker-nodes/<model_preset>",
-        "Integration test: two tracker nodes + two mid-shard nodes for GPT-2; 10 requests via gateway; both tracker nodes receive load; all responses valid",
-        "Existing US-005 OpenAI-compatible tests still pass",
-        "python -m pytest passes from repo root",
-        "Commit only this story's changes"
-      ],
-      "priority": 14,
-      "passes": true,
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/14-tracker-as-node.md",
-      "dependsOn": [
-        "US-012",
-        "US-013"
-      ],
-      "status": "done",
-      "completionNotes": "Implemented: (1) Tracker GET /v1/tracker-nodes/<model> endpoint returning nodes registered with tracker_mode=true at shard_start==0. (2) StubNodeServer and TorchNodeServer now accept tracker_mode/tracker_url params; when tracker_mode=True, /v1/chat/completions is served alongside /forward. (3) TorchNodeServer auto-detects tracker mode when shard_start==0. (4) Gateway _handle_chat_completions checks for tracker-nodes first via _get_tracker_nodes(), proxies round-robin if found, falls back to existing direct pipeline if none (backward compat). (5) CLI --tracker-mode and --tracker-url flags added. (6) Integration test: 2 tracker-nodes + 2 mid-shard nodes for gpt2; 10 requests; round-robin verified (5/5 split); all responses valid OpenAI format. All 78 tests pass."
-    },
-    {
-      "id": "US-015",
-      "title": "15 \u2014 Ralph: agent-agnostic runner + status-field-aware dashboard",
-      "description": "Two improvements to the Ralph workflow tooling. (1) Status-field awareness: replace all passes:true/false reads in ralph_progress.py with the rich status field. Surface to-revise and needs-review stories as an attention list in the dashboard; auto command skips them by default. (2) Agent agnosticism: make the agent selectable per session \u2014 codex (existing), claude (Claude Code CLI), openrouter (unified API for GPT-4/Mistral/Llama/DeepSeek via OPENROUTER_API_KEY + --model), or custom (--agent-cmd path to any script). Persist agent choice to .ralph-tui/agent-config.json. When ralph-tui does not natively support a requested agent, ralph_progress.py falls back to a thin adapter that calls the agent API directly with the task prompt. (3) Worktree parallelism: ralph_progress.py auto --parallel [N] creates one git worktree per ready task (git worktree add ../AI-worktree-<id> -b feat/<id>), runs up to N agent sessions concurrently, and merges each branch back to master after the agent exits 0 and tests pass. Non-blocking stories that share no file overlap can safely run in parallel. ralph_progress.py list-parallel shows which open stories have no overlapping dependsOn chains and are safe to run concurrently.",
-      "acceptanceCriteria": [
-        "All story.get('passes') reads in ralph_progress.py replaced with _is_done() helper that reads status field with passes fallback",
-        "_story_sets() returns six buckets: done, attention (to-revise/needs-review), active (in-progress), in-design, ready, blocked",
-        "Dashboard shows \u26a0 Attention required section listing to-revise/needs-review stories with status_reason",
-        "auto command skips to-revise and needs-review stories; --include-revise flag overrides",
-        "_review_report includes Attention Required section with status_reason for all affected stories",
-        "ralph_progress.py set-agent --agent <name> [--model <model>] writes .ralph-tui/agent-config.json",
-        "--agent codex|claude|openrouter|custom accepted by run-next, auto, review subcommands",
-        "run-next --agent custom --agent-cmd ./my-agent.sh runs a task via custom script (prompt file as $1)",
-        "Saved agent config is loaded as default when --agent is not passed on the CLI",
-        "python -m pytest passes from repo root",
-        "ralph_progress.py auto --parallel 2 starts two worktrees concurrently for the two highest-priority ready tasks",
-        "Each worktree is created at ../AI-worktree-<story-id> on branch feat/<story-id>",
-        "After agent exits 0 and pytest passes in the worktree, the branch is merged to master and the worktree removed",
-        "ralph_progress.py list-parallel prints the set of open stories with no shared dependency chain (safe to parallelize)",
-        "If a worktree merge fails (conflict), the worktree is preserved for manual resolution and reported clearly"
-      ],
-      "priority": 15,
-      "passes": true,
-      "status": "done",
-      "notes": "Source issue: .scratch/distributed-inference-network/issues/15-ralph-agent-agnostic-status-aware.md",
-      "dependsOn": [],
-      "completionNotes": "Implemented by agent: status-aware helpers (_is_done, _needs_attention, _is_active, _is_in_design), 6-bucket _story_sets, attention dashboard section, _review_report Attention Required block, auto --include-revise, set-agent subcommand with persistent agent-config.json, _run_openrouter stub, custom agent support, list-parallel subcommand, and auto --parallel N worktree orchestration. All 65 tests pass."
-    }
-  ],
-  "metadata": {
-    "updatedAt": "2026-06-29T13:30:00.000Z",
-    "statusVocabulary": {
-      "open": "Not started",
-      "in-design": "Decisions pending before implementation can begin",
-      "in-progress": "Agent actively working on it",
-      "needs-review": "Implemented, awaiting human review or verification",
-      "to-revise": "Previously done, needs rework due to design or architecture changes",
-      "done": "Implemented, tested, and verified",
-      "blocked": "Waiting on unresolved external dependency"
-    }
-  }
-}

.scratch/distributed-inference-performance/PRD.md

@@ -0,0 +1,40 @@
+# PRD: Distributed inference performance
+
+## Problem
+
+Distributed decode already avoids full-prompt recomputation when the local KV
+path is active, but each Activation Seam can still pay transport and data-plane
+overhead for every generated token. Relay logs show a new `request_id` per
+token; that is correct correlation, but the old relay implementation also
+opened a new WebSocket per token. Direct hops and relay bridge forwarding use
+fresh HTTP requests as well. Without timing and byte measurements, compression,
+copy, and buffering choices cannot be ranked safely.
+
+## Outcome
+
+For a cached Route Session, connection setup is amortized across the session,
+decode payloads remain one-step activations, progress reporting is bounded, and
+the benchmark can attribute latency to model execution, serialization, relay,
+HTTP, queueing, and backpressure. Optimizations must preserve output tokens,
+KV semantics, failure behavior, and compatibility with legacy one-shot peers.
+
+## Non-goals
+
+- No speculative decoding or multi-token model execution in this feature.
+- No QUIC/WebRTC/custom transport rewrite.
+- No centralized Hot KV State.
+- No silent reuse of a `request_id`; each activation remains independently
+  traceable.
+
+## Acceptance criteria
+
+- A reproducible local two-node and relay benchmark reports per-token and
+  per-seam timing plus bytes.
+- Cached decode does not perform a new TCP/WebSocket connection per token.
+- Direct and relay-to-local HTTP paths reuse connections safely or document why
+  a path cannot do so.
+- Compression and copy decisions are based on recorded traces, not guesses.
+- Slow prefill consumers apply bounded backpressure rather than unbounded body
+  buffering.
+- A benchmark regression threshold catches a meaningful transport slowdown.
+

.scratch/distributed-inference-performance/README.md

@@ -0,0 +1,37 @@
+# Distributed inference performance
+
+Status: draft scratch package.
+
+This feature measures and reduces avoidable overhead around the existing
+Route Session, prefill/decode, local Hot KV State, and binary activation path.
+It does not replace the distributed GGUF runtime plan. The goal is to make
+transport and data movement cheap enough that model execution, rather than
+connection setup, logging, or serialization, dominates token latency.
+
+## Scope
+
+- Baseline per-token compute, seam, connection, serialization, and queue time.
+- Keep one connection alive for a Route Session wherever protocol semantics allow.
+- Add bounded, actionable Generation Telemetry for each Activation Seam.
+- Tune compression and buffer conversion from measured activation traces.
+- Add bounded prefill backpressure and an end-to-end benchmark gate.
+
+## Existing decisions preserved
+
+- `X-Meshnet-Session` is stable for one Route Session.
+- `request_id` remains unique per activation request for correlation.
+- Hot KV State remains local to each Shard node.
+- v1 activation transfer remains binary HTTP-shaped traffic.
+- Streaming output remains preferred and telemetry remains mandatory.
+
+## Task order
+
+1. 01 — baseline and profiling harness
+2. 02 — persistent relay compatibility hardening
+3. 03 — direct and bridge HTTP keep-alive
+4. 04 — seam telemetry and bounded progress reporting
+5. 05 — adaptive activation compression
+6. 06 — activation framing and copy reduction
+7. 07 — prefill chunk backpressure
+8. 08 — end-to-end performance gate
+

.scratch/distributed-inference-performance/issues/01-baseline-profiling-harness.md

@@ -0,0 +1,27 @@
+Status: ready-for-agent
+
+# 01 — Baseline and profiling harness
+
+## What to build
+
+Create a deterministic stub-backed benchmark for a Route Session that measures
+prefill and cached decode across direct and relay paths. Attribute time to model
+execution, activation encoding/decoding, compression, connection setup, relay
+queueing, local HTTP forwarding, and end-to-end seam latency. Record payload
+sizes and connection counts without requiring a real model or external host.
+
+## Acceptance criteria
+
+- [ ] The harness runs a fixed prompt and fixed generated-token count through a
+  two-node route in direct and relay modes.
+- [ ] It reports p50/p95 per-token latency, per-hop latency, payload bytes,
+  compression ratio, connection attempts, and queue wait.
+- [ ] It distinguishes prefill from decode and cached from stateless mode.
+- [ ] It emits machine-readable JSON suitable for CI artifacts and a concise
+  human-readable summary.
+- [ ] A test fixture can assert connection attempts and output token identity.
+
+## Blocked by
+
+None - can start immediately.
+

.scratch/distributed-inference-performance/issues/02-relay-session-compatibility.md

@@ -0,0 +1,29 @@
+Status: ready-for-agent
+
+# 02 — Persistent relay compatibility hardening
+
+## What to build
+
+Harden the persistent `/rpc/<peer>` connection used by one Route Session.
+Preserve unique request correlation while allowing sequential binary and JSON
+requests on one socket. Handle peer disconnects, requester cancellation,
+legacy one-request relays, timeout cleanup, and generation-end close without
+leaking pending RPC entries or accidentally replaying a model mutation.
+
+## Acceptance criteria
+
+- [ ] A cached decode session uses one requester connection per relay Activation
+  Seam and sends one unique request id per activation.
+- [ ] Legacy relays that close after one response fail over clearly without
+  corrupting the Route Session or replaying an uncertain request.
+- [ ] Relay and bridge cleanup removes pending request state on normal close,
+  cancellation, timeout, and peer disconnect.
+- [ ] Concurrent Route Sessions do not share a non-thread-safe socket; responses
+  remain matched by request id.
+- [ ] Tests cover two sequential binary requests, JSON compatibility, close,
+  timeout, disconnect, cancellation, and no leaked pending entries.
+
+## Blocked by
+
+- 01 — Baseline and profiling harness.
+

.scratch/distributed-inference-performance/issues/03-http-keepalive.md

@@ -0,0 +1,28 @@
+Status: ready-for-agent
+
+# 03 — Direct and bridge HTTP keep-alive
+
+## What to build
+
+Amortize TCP connection setup for direct node hops and for the relay bridge's
+local request into the shard server. Use bounded per-session or per-worker
+connection ownership, explicit response lengths, and safe invalidation on
+errors. Do not share a connection across concurrent requests unless the client
+supports serialization.
+
+## Acceptance criteria
+
+- [ ] Direct cached decode reuses a connection to each downstream HTTP node.
+- [ ] Relay bridge forwarding reuses loopback HTTP connections without blocking
+  unrelated worker requests.
+- [ ] HTTP/1.1 framing is correct for success, error, empty, streamed, and
+  cancellation responses; no request hangs waiting for EOF.
+- [ ] Broken or stale connections are discarded and the current request follows
+  the existing safe failure/fallback policy.
+- [ ] Benchmark 01 shows connection attempts are independent of generated token
+  count for a healthy session.
+
+## Blocked by
+
+- 01 — Baseline and profiling harness.
+

.scratch/distributed-inference-performance/issues/04-seam-telemetry.md

@@ -0,0 +1,28 @@
+Status: ready-for-agent
+
+# 04 — Activation Seam telemetry and bounded progress reporting
+
+## What to build
+
+Expose structured timing and byte counters for each Activation Seam while
+keeping per-token progress overhead bounded. Report route/session, phase,
+hop/node, queue wait, model time, encode/decode time, compression time, wire
+bytes, response bytes, and connection reuse. Aggregate high-cardinality events
+instead of flushing a log line for every token.
+
+## Acceptance criteria
+
+- [ ] Generation Telemetry includes prefill/decode seam latency and rolling
+  tokens/sec without changing token output or cache behavior.
+- [ ] Every request can be correlated by stable Route Session plus unique
+  activation request id.
+- [ ] Counters are sampled or aggregated so telemetry work is bounded and does
+  not perform network I/O in the model hot loop.
+- [ ] Logs summarize decode progress by session and retain actionable failure
+  context.
+- [ ] Tests verify counters, aggregation cadence, and cleanup at session close.
+
+## Blocked by
+
+- 01 — Baseline and profiling harness.
+

.scratch/distributed-inference-performance/issues/05-adaptive-compression.md

@@ -0,0 +1,26 @@
+Status: ready-for-agent
+
+# 05 — Trace-driven activation compression
+
+## What to build
+
+Make zstd decisions from activation size, measured compression ratio, CPU cost,
+and route conditions. Keep small decode payloads on the fast path, avoid
+compressing data that does not shrink, and expose enough counters to compare
+wire savings against compression latency on LAN and relay routes.
+
+## Acceptance criteria
+
+- [ ] A compression policy is explicit and configurable for LAN, relay, and
+  benchmark environments.
+- [ ] Bodies that do not meet the configured savings threshold are sent raw.
+- [ ] Compression and decompression time plus input/output bytes are reported.
+- [ ] Prefill and decode policies can differ; decode latency is not regressed by
+  compressing small one-step activations.
+- [ ] Tests cover incompressible, compressible, threshold, malformed, and
+  legacy-uncompressed bodies.
+
+## Blocked by
+
+- 01 — Baseline and profiling harness.
+

.scratch/distributed-inference-performance/issues/06-activation-framing-copies.md

@@ -0,0 +1,27 @@
+Status: ready-for-agent
+
+# 06 — Activation framing and copy reduction
+
+## What to build
+
+Profile and reduce avoidable allocations while activation data crosses a seam:
+binary frame assembly, header JSON, base64 metadata, CPU/GPU conversion, and
+response decompression. Preserve the current binary wire contract and use
+zero-copy or pooled buffers only where ownership and lifetime are explicit.
+
+## Acceptance criteria
+
+- [ ] The benchmark identifies copy/allocation cost separately from model and
+  network time.
+- [ ] Decode hidden-state conversion has no unnecessary float32 round trip.
+- [ ] Binary framing avoids base64 for activation bodies and does not retain
+  buffers after a request completes.
+- [ ] Position/attention metadata is validated and encoded efficiently without
+  changing semantic headers or cache positions.
+- [ ] A focused test proves byte-for-byte wire compatibility and stable output
+  tokens before and after the optimization.
+
+## Blocked by
+
+- 01 — Baseline and profiling harness.
+

.scratch/distributed-inference-performance/issues/07-prefill-backpressure.md

@@ -0,0 +1,27 @@
+Status: ready-for-agent
+
+# 07 — Bounded prefill chunk backpressure
+
+## What to build
+
+Make large prefill transfer bounded across every Activation Seam. Chunk prompt
+activations, limit in-flight chunks, and propagate downstream congestion so a
+slow Shard node cannot cause the head or relay bridge to buffer the entire
+context in memory. Keep decode-step traffic sequential and low-latency.
+
+## Acceptance criteria
+
+- [ ] Configurable prefill chunk size and in-flight limit exist with safe
+  defaults.
+- [ ] Peak per-hop buffered bytes are bounded by the configured limits.
+- [ ] A slow downstream stub applies backpressure and does not lose or reorder
+  chunks within a Route Session.
+- [ ] Cancellation and route failure release queued chunks and local buffers.
+- [ ] Tests cover small prompts, multi-chunk prompts, slow consumers, retry/fail
+  closeout, and legacy single-chunk peers.
+
+## Blocked by
+
+- 01 — Baseline and profiling harness.
+- 04 — Activation Seam telemetry and bounded progress reporting.
+

.scratch/distributed-inference-performance/issues/08-end-to-end-performance-gate.md

@@ -0,0 +1,33 @@
+Status: ready-for-agent
+
+# 08 — End-to-end distributed performance gate
+
+## What to build
+
+Turn the benchmark and optimizations into a repeatable performance gate for a
+small two-node route and a relay route. Compare stateless legacy mode, cached
+decode, direct HTTP, and persistent relay. Fail only on stable regressions and
+publish the measurements needed to decide whether further work belongs in
+transport, serialization, queueing, or model execution.
+
+## Acceptance criteria
+
+- [ ] CI/local benchmark runs a deterministic fixed-token scenario without a
+  real model or external network.
+- [ ] The report compares tokens/sec, p50/p95 token latency, seam latency,
+  bytes/token, connection count, compression CPU, and peak buffered bytes.
+- [ ] Thresholds are documented and tolerant of normal host variance while
+  catching a meaningful regression.
+- [ ] A real-model opt-in command records the same metrics for LAN validation.
+- [ ] The gate verifies output token identity, Route Session stability, and
+  cleanup of sessions, sockets, queues, and telemetry state.
+
+## Blocked by
+
+- 02 — Persistent relay compatibility hardening.
+- 03 — Direct and bridge HTTP keep-alive.
+- 04 — Activation Seam telemetry and bounded progress reporting.
+- 05 — Trace-driven activation compression.
+- 06 — Activation framing and copy reduction.
+- 07 — Bounded prefill chunk backpressure.
+

.scratch/distributed-inference-performance/prd.json

@@ -0,0 +1,135 @@
+{
+  "name": "Distributed inference performance",
+  "description": "Measure and reduce avoidable transport, HTTP, telemetry, compression, buffering, and copy overhead around Route Session cached decode.",
+  "branchName": "ralph/distributed-inference-performance",
+  "userStories": [
+    {
+      "id": "DIP-001",
+      "title": "01 — Baseline and profiling harness",
+      "description": "Create a deterministic stub-backed direct and relay Route Session benchmark that reports per-token and per-seam timing, bytes, compression, queueing, and connection counts.",
+      "acceptanceCriteria": [
+        "Fixed prompt/token scenario runs in direct and relay modes",
+        "Reports p50/p95 latency, payload bytes, compression ratio, connections, and queue wait",
+        "Distinguishes prefill/decode and cached/stateless modes",
+        "Produces machine-readable JSON and human-readable summary",
+        "Can assert connection count and output token identity"
+      ],
+      "priority": 1,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/01-baseline-profiling-harness.md",
+      "dependsOn": []
+    },
+    {
+      "id": "DIP-002",
+      "title": "02 — Persistent relay compatibility hardening",
+      "description": "Harden one persistent relay RPC connection per Route Session seam while preserving unique request IDs, legacy compatibility, cleanup, cancellation, and safe failure behavior.",
+      "acceptanceCriteria": [
+        "One healthy relay connection serves sequential cached decode requests",
+        "Legacy one-request relays fail over without replaying uncertain mutations",
+        "Pending RPC state is cleaned on close, cancellation, timeout, and disconnect",
+        "Concurrent sessions do not share an unsafe socket",
+        "Tests cover binary, JSON, timeout, disconnect, cancellation, and cleanup"
+      ],
+      "priority": 2,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/02-relay-session-compatibility.md",
+      "dependsOn": ["DIP-001"]
+    },
+    {
+      "id": "DIP-003",
+      "title": "03 — Direct and bridge HTTP keep-alive",
+      "description": "Amortize TCP setup for direct node hops and relay bridge loopback forwarding with bounded connection ownership and correct HTTP framing.",
+      "acceptanceCriteria": [
+        "Direct cached decode reuses downstream HTTP connections",
+        "Bridge loopback forwarding reuses connections without blocking unrelated workers",
+        "HTTP/1.1 framing works for success, error, empty, stream, and cancellation",
+        "Stale connections are invalidated under the existing fallback policy",
+        "Benchmark shows healthy-session connection count independent of token count"
+      ],
+      "priority": 3,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/03-http-keepalive.md",
+      "dependsOn": ["DIP-001"]
+    },
+    {
+      "id": "DIP-004",
+      "title": "04 — Activation Seam telemetry and bounded progress reporting",
+      "description": "Expose per-seam timing and byte counters while aggregating progress work so telemetry does not become per-token hot-loop overhead.",
+      "acceptanceCriteria": [
+        "Telemetry includes seam latency and rolling tokens/sec",
+        "Stable session and unique activation IDs remain correlated",
+        "Counters are sampled or aggregated without network I/O in model execution",
+        "Decode logs summarize by session with actionable failures",
+        "Tests verify cadence and cleanup"
+      ],
+      "priority": 4,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/04-seam-telemetry.md",
+      "dependsOn": ["DIP-001"]
+    },
+    {
+      "id": "DIP-005",
+      "title": "05 — Trace-driven activation compression",
+      "description": "Choose zstd based on measured savings and CPU cost, preserving a raw fast path for small or incompressible decode activations.",
+      "acceptanceCriteria": [
+        "Compression policy is explicit and configurable per route condition",
+        "Bodies below savings threshold are sent raw",
+        "Compression timing and byte counters are reported",
+        "Prefill and decode can use different policies",
+        "Tests cover compressible, incompressible, threshold, malformed, and legacy bodies"
+      ],
+      "priority": 5,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/05-adaptive-compression.md",
+      "dependsOn": ["DIP-001"]
+    },
+    {
+      "id": "DIP-006",
+      "title": "06 — Activation framing and copy reduction",
+      "description": "Measure and reduce avoidable binary framing, metadata, CPU/GPU conversion, and decompression allocations without changing the wire contract.",
+      "acceptanceCriteria": [
+        "Benchmark attributes copy/allocation cost separately",
+        "Decode hidden state avoids unnecessary float32 conversion",
+        "Activation bodies remain binary and buffers have explicit ownership",
+        "Metadata encoding remains semantically compatible",
+        "Wire and token-output regression tests pass"
+      ],
+      "priority": 6,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/06-activation-framing-copies.md",
+      "dependsOn": ["DIP-001"]
+    },
+    {
+      "id": "DIP-007",
+      "title": "07 — Bounded prefill chunk backpressure",
+      "description": "Bound large prefill transfer with configurable chunking and in-flight limits, propagating downstream congestion without reordering or unbounded buffering.",
+      "acceptanceCriteria": [
+        "Chunk size and in-flight limit have safe defaults",
+        "Peak buffered bytes stay within configured bounds",
+        "Slow consumers apply backpressure and preserve order",
+        "Cancellation and route failure release queued buffers",
+        "Tests cover chunking, slow consumers, failure, and legacy peers"
+      ],
+      "priority": 7,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/07-prefill-backpressure.md",
+      "dependsOn": ["DIP-001", "DIP-004"]
+    },
+    {
+      "id": "DIP-008",
+      "title": "08 — End-to-end distributed performance gate",
+      "description": "Make direct, persistent-relay, cached, and stateless benchmark comparisons repeatable and fail on meaningful transport regressions while verifying output and cleanup.",
+      "acceptanceCriteria": [
+        "Deterministic stub benchmark runs locally and in CI",
+        "Report compares throughput, latency, bytes, connections, compression CPU, and buffers",
+        "Regression thresholds tolerate host variance and catch meaningful slowdowns",
+        "Opt-in real-model LAN command emits the same metrics",
+        "Gate verifies token identity, session stability, and resource cleanup"
+      ],
+      "priority": 8,
+      "passes": false,
+      "notes": "Source issue: .scratch/distributed-inference-performance/issues/08-end-to-end-performance-gate.md",
+      "dependsOn": ["DIP-002", "DIP-003", "DIP-004", "DIP-005", "DIP-006", "DIP-007"]
+    }
+  ]
+}

.scratch/node-capability-admission/PRD.md

@@ -0,0 +1,84 @@
+# PRD: Model-agnostic Node capability admission
+
+## Overview
+
+Make a Node demonstrate that it can execute the selected Model Artifact and assigned Shard before the Tracker exposes it in an Inference Route. The current flow registers a Node after a hardware inventory and synthetic Torch benchmark, but before any real model forward; optional backend/JIT failures can therefore occur on paid traffic.
+
+The solution is generic by design. It must not hardcode Qwen3.6, FLA, Triton, CUDA, ROCm, or any other model/backend name into the capability contract. Qwen3.6 may be used only by opt-in development integration tests.
+
+## Goals
+
+- Provide `meshnet-node doctor` to emit a machine-readable and human-readable capability report for the selected model/shard.
+- Require a successful real forward on the selected execution path before a Node becomes routable.
+- Track named recipes as data, allowing more than one validated implementation for one Model Preset.
+- Let the Tracker schedule only a Node/model/shard/recipe combination that the Node validated locally.
+- Preserve current generic Hugging Face model support and backward-compatible protocol behavior where possible.
+
+## Quality gates
+
+Every user story:
+
+- Runs its targeted `pytest` tests.
+- Runs full `pytest` before completion, or records the exact unrelated failure.
+- Keeps default tests deterministic, model-download-free, and GPU-free.
+
+Release/hardware CI:
+
+- Runs an `integration`-marked real-model doctor smoke test per certified hardware lane.
+- Passes the model ID, source, and expected backend through environment/configuration; no test has a Qwen-specific default.
+
+## User stories
+
+### NCA-001: Generic capability and recipe report
+
+As a Node operator, I need a model-agnostic capability report so that readiness is based on the executable model/shard/backend combination, not a generic GPU claim.
+
+### NCA-002: Doctor selected model/shard
+
+As a Node operator, I need `meshnet-node doctor` to validate the selected model/shard with a real forward before I join the network.
+
+### NCA-003: Fail-closed startup admission
+
+As a Node operator, I need startup to remain non-routable when the selected recipe fails so that a Node never accepts paid work it cannot execute.
+
+### NCA-004: Tracker validated-recipe routing gate
+
+As a client, I need the Tracker to select only validated Node capabilities so that an Inference Route does not include a Node that merely claims compatibility.
+
+### NCA-005: Model-agnostic operations and certified-lane verification
+
+As an operator and release engineer, I need clear doctor output and opt-in hardware-lane test instructions so that failures are actionable without exposing Python/JIT internals to ordinary users.
+
+## Functional requirements
+
+1. The local capability report identifies the Model Artifact by generic model ID/revision/config fingerprint, shard range, selected recipe ID/version, device/backend identity, success/failure status, diagnostics, and measured validation duration.
+2. A recipe is data, not a model-specific code branch. A model may offer multiple recipes; a recipe is valid only after its own real forward succeeds.
+3. `doctor` defaults to the selected model/shard and does not search/download/test unrelated models. `--all-recipes` is explicit.
+4. Startup must execute or consume a fresh matching validation before ready registration. A failed selected recipe exits non-zero before routable registration.
+5. The Tracker records validated capabilities and excludes invalid, absent, stale, model-mismatched, shard-mismatched, or catalogue-version-incompatible capabilities from route selection.
+6. The tracker protocol remains tolerant of old Nodes only during a documented compatibility window; old registrations are not eligible for routes requiring admission proof.
+7. The Node reports a versioned local recipe-manifest version. P0 has no remote executable recipe download, dependency installer, self-updater, driver installer, or GUI.
+
+## Non-goals
+
+- A signed Node auto-updater or dynamic executable recipe delivery.
+- Automatic installation of OS packages, compilers, drivers, or Python dependencies.
+- A native NiceHash-style desktop manager.
+- Supporting or certifying a particular model, GPU vendor, OS, or optional-kernel library.
+- Replacing the existing Model Artifact/assignment protocol.
+
+## Architecture
+
+Add a small generic capability domain object in the node package. `doctor` loads the requested generic model path through the same backend startup uses, executes a bounded real forward at the assigned Shard, and emits the report. Startup gates routable registration on the successful report. Registration carries validated capabilities; the tracker persists/exposes them and filters route candidates at the model/shard/recipe seam.
+
+The future signed-update contract is represented only by a local manifest version and generic schema in P0. A future Tracker Model Artifact Manifest may be signed data, but Node executable behavior remains supplied by signed Node releases.
+
+## Success measures
+
+- A backend failure that formerly appeared on the first `/forward` is caught by `doctor` and prevents ready registration.
+- A Tracker route never includes an unvalidated capability in deterministic tests.
+- The same implementation works for arbitrary test model identifiers supplied by fixtures/configuration, with no Qwen-specific branch.
+
+## Open follow-up
+
+Specify and build the signed Node release/update channel as a separate product feature after the capability contract has proved stable.

.scratch/node-capability-admission/README.md

@@ -0,0 +1,31 @@
+# Node capability admission — planning index
+
+**Status:** ready for supervised Ralph execution.
+
+This P0 makes a Node prove it can serve its selected Model Artifact and Shard before the Tracker treats it as routable. It is deliberately model-agnostic: Qwen3.6 is only a development integration fixture, never a hardcoded runtime target.
+
+## Locked decisions
+
+- A Node explicitly asked to serve a Model Preset fails closed when no validated recipe can execute it; it must not register as ready or accept paid inference.
+- Default validation covers the selected model/shard only. `meshnet-node doctor --all-recipes` is reserved for support and CI.
+- A Model Preset may have multiple named recipes. Each independently proves a real forward; the Tracker schedules only validated recipes while considering measured performance.
+- Compatibility schemas are generic. A future Tracker may publish signed, data-only Model Artifact Manifests, but executable recipes arrive only through signed Node releases.
+- P0 ships a local versioned recipe manifest and reports its version. It does **not** build a self-updater, download executable recipes, or install system dependencies.
+- Every story requires `pytest`; release CI additionally runs an `integration`-marked real-model doctor smoke test on each certified hardware lane.
+
+## Ralph order
+
+1. `NCA-001` generic capability/report contract
+2. `NCA-002` generic doctor command and real-forward validation
+3. `NCA-003` startup admission lifecycle and fail-closed behavior
+4. `NCA-004` tracker registration/routing enforcement
+5. `NCA-005` operator documentation and hardware-lane integration contract
+
+Run serially. Stories 3 and 4 both change registration/startup behavior and must not be executed in parallel.
+
+## Quality gates
+
+- Targeted `pytest` tests named by the issue.
+- Full `pytest` before marking a story done, or record the unrelated blocker.
+- No default test downloads a model or requires a GPU.
+- `pytest -m integration` / the real-model doctor test remains explicit and environment-gated.

.scratch/node-capability-admission/issues/01-generic-capability-report.md

@@ -0,0 +1,34 @@
+Status: ready-for-agent
+
+# 01 — Generic capability and recipe report
+
+## What to build
+
+Create a model-agnostic node capability domain object and local versioned recipe-manifest reader. It must represent a selected Model Artifact identity/revision/config fingerprint, Shard range, named recipe ID/version, device/backend identity, validation timestamp/duration, success/failure state, and sanitized diagnostics.
+
+Do not add Qwen-, FLA-, Triton-, CUDA-, ROCm-, or vendor-specific branches. A recipe is generic data; specific runtime behavior remains in the existing backend.
+
+**Code refs:**
+
+- `packages/node/meshnet_node/model_catalog.py` — existing generic HF config/model metadata helpers
+- `packages/node/meshnet_node/hardware.py` — device identity/executability inventory
+- `packages/node/meshnet_node/model_backend.py` — model/shard loading path
+- `packages/node/pyproject.toml` — package data declarations
+
+## Test-first
+
+1. Write a unit test building reports for two arbitrary fixture model IDs and asserting no model-specific normalization/branch is required.
+2. Write a manifest-version validation test: valid local manifest loads; malformed/unknown schema produces actionable non-secret diagnostics.
+3. Implement the smallest schema, serialization, and local manifest reader needed by later stories.
+
+## Acceptance criteria
+
+- [ ] Capability report has a stable JSON-serializable schema with model identity/fingerprint, shard range, recipe ID/version, backend/device identity, status, timing, and sanitized diagnostic fields
+- [ ] Generic arbitrary model IDs are preserved; no Qwen or optional-kernel name is a product default or code-path discriminator
+- [ ] Local recipe manifest has an explicit schema/catalogue version
+- [ ] Malformed manifest/report input fails locally with actionable diagnostics and never leaks environment secrets
+- [ ] Unit tests cover serialization, schema validation, and model-agnostic behavior
+
+## Blocked by
+
+None.