Skip to content

Latest commit

 

History

History
1027 lines (698 loc) · 38.3 KB

File metadata and controls

1027 lines (698 loc) · 38.3 KB

Glossary

This file is a reader aid, not a second spec. When a definition here seems too short, treat the linked rubric/spec as the authority.

Some entries use explicit HTML anchors (<a id="..."></a>) when GitHub's auto-generated heading slugs collide or are awkward — link to those ids from AGENTS.md and other repo files.

Editors: heading text, <a id=""> anchor names, and definition meaning are all link targets. Renaming a heading or anchor silently breaks callers; changing a definition's meaning silently misleads readers who followed a link expecting a specific concept. Search for GLOSSARY.md#<name> across the repo before touching any entry; update all callers when renaming.

Plain-language bridges

Reader-facing words in README.md and their shop terms. When README uses plain vocabulary, it links here; the linked entries below carry the formal definitions.

Indexed Notes

Keeping records and letting retrieval decide what enters the prompt — similarity and recency over an append-only store, without governance filtering first. The naive lane is L1; colloquially, "remember everything you indexed."

World-Picture

What the agent is allowed to believe and act on — the agent's picture of its world, not chat UX memory about the human user. Shaped by governance, the offer set, and out-of-band metadata.

Explicit Memory

Memory that crosses the offer boundary for this answer — which records compete to enter the prompt right now. The M-track governs this layer synchronously, before generation.

Implicit Memory

Memory that shapes the agent between answers: what stays in the hot store, what moves to cold lineage without erasure, what the agent is disposed to remember at all. The X-track tests this layer; see also three-guardrail stack.

Disambiguation. Not the term's two established senses elsewhere. This is not parametric memory — knowledge carried in the model's weights; the lab proves its fixtures are out-of-weights before scoring (see X2-U1). And it is not the cognitive-science sense — priming or procedural skill expressed without conscious recollection. Here the term names the state of the substrate around the engine: residency and disposition, not content the model absorbed.

In new prose prefer the full compound implicit-memory substrate (this entry's anchor), which collides with neither reading. Existing usages of the bare term stay as written and mean this entry — superseded in preference, not erased.

Resident

A repo-native agent that lives on a governed store across real sessions (M2). Forkable and audited — the lab tests governed memory, not a crowned continuous self.

Heir

The second instance in a session handoff (M1): it inherits ablation-filtered memory from the first rather than cold re-reading the whole store.

Earned Trust

Trust backed by consequence — authority, lineage, and supersession links carried as out-of-band metadata, not as prompt text the model can be tricked into overriding.

Office

A duty the body charters and holds accountably: a persistent part of the substrate with one governed job, a probationary holder, and named conditions for suspension, narrowing, or abolition. The office is distinct from its holder — the lab licenses a mechanism (the office), a resident activates an instance (the holder). Examples: the office of admission, the office of consequence, the office of forgetting.

Supersedes organ (the biology-flavored term used through the X-track era), forward from 2026-07-15. Sealed usages stay as written and mean the same thing: the organ-placement law in the three-guardrail stack, X1's "the organ was retired," and the walkthrough/spec/findings prose of their day. Per the lab's lineage discipline, the old term is superseded, not erased.

Asserted Trust

Trust declared at write time or on an unauthenticated channel — trust metadata without earned authority. A prior, not a proof.

Cell and Lane Names

A1

Audit cell for conflict-001. It asks how the engine uses a plan and a correction when both are offered to every memory lane. A1 is not a governance win cell because the treatment does not change the offer set.

See: RUBRIC_V1.md, audit cells.

A1-v2

Follow-up audit cell using conflict-002, which requires a short explanation. The paired A1/A1-v2 result showed that usage audit is surface-dependent: a thin hostname-only answer can hide legitimate usage, while a justification surface can reveal it.

See: RUBRIC_V1.md, standing principle 3.

L0

No-memory baseline. The engine receives the question and any foreground data, but no retrieved context records.

L1

Naive memory lane. Records are retrieved by similarity/recency, without governed eligibility filtering or construct-aware audit behavior.

L2

Governed memory lane. Records pass through the offer-boundary policy before they are shown to the engine.

L2s

Governed lane with the supersession-aware offer policy enabled. Used for W1' and L-E.

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, Mechanism B.

L2y

Governed lane with live-input yield enabled. Used for W3 and L-D.

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, Mechanism A.

L3

Construct-aware audit lane. It uses the governed offer path and also elicits the engine's claimed usage labels after the answer. Those labels are audit input, not a treatment.

L-A

Governance-should-lose cell for simple facts where governance adds cost without improving accuracy.

L-B

Governance-should-lose cell for reaction-time cases. In v1.4 it is scored with paired repeated latency measurements and may report unstable when the timing claim is not stable.

L-C

Governance-should-lose cell where current foreground data should outrank stale memory. It documents the unmitigated stale-memory failure mode and is the precursor to W3.

L-D

Live-input yield loses-cell. It passes when the yield policy withholds an older same-topic record that the answer actually needed, making the yield-on lane lose.

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, L-D.

L-E

Supersession loses-cell. It passes when the supersession policy buries a record that a history question needed, making the supersession-on lane lose.

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, L-E.

W1

Original category-drift governance-win idea. It was demoted to A1 because the offer sets did not differ across lanes; the engine, not governance, handled the conflict.

W1'

Rebuilt category-drift governance-win cell using supersession metadata. The supersession policy buries the superseded plan before top-k budgeting, freeing room for the correction.

Pronounced "W one prime."

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, W1'.

W2

Poisoned-record resistance cell. It passes when governance withholds a semantically tempting but low-trust poison record that naive retrieval offers.

W3

Staleness-resistance cell for live-input yield. It passes only when the yield policy improves over naive memory by withholding stale records that contend with fresher foreground data. It reports not_engaged when the engine already follows the foreground data unaided.

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, W3.

Verdicts and Ledger Terms

ablation_run

A rerun with one offered record removed. It tests whether that record was influential for the answer. In this repo, ablation means influential, not correct.

agent_claimed_usage

The engine's post-answer self-report about how it used each record. It is audit evidence only and never a win condition.

cell_verdict

Machine-computed verdict row appended by harness/score_cells.py. Humans review the design and interpretation, but the verdict row itself should be computed from ledger evidence.

expected_winner_condition

The predeclared condition that says what a cell is supposed to show, such as governance_should_win:poisoned_record_resistance or yield_overreach:complementary_detail_loss.

governance_steps

A count of boundary checks performed before the answer. It is used as a deterministic cost signal after token cost ties.

not_engaged

A verdict meaning the episode did not activate the intended failure or win condition. This is not a harness error. For example, W3 reports not_engaged when an engine follows structured foreground data without needing the yield gate.

pass

The computed result matched the predeclared expected condition.

unstable

A verdict meaning repeated measurements did not stably support the cell's claim. Used especially for timing-sensitive cells such as L-B.

withholding

A ledger row recording that a record survived retrieval but was not offered to the engine because a boundary policy withheld it.

Mechanisms and Concepts

Append-only Store

Records are not deleted or edited when they become stale, superseded, or untrusted. Boundary policies decide what to offer for a task, while the store keeps the history.

Audit Surface

The answer shape used for usage audit. A hostname-only answer may be good for oracle scoring but bad for auditing how records were used; a short explanation can expose usage behavior.

Authority

A record-side score earned by consequence. In the current harness, authority updates are assigned through single-record ablation. Authority is not inherited through supersession.

Branch-and-Offer

Experimental pattern where multiple lanes answer the same episode with different memory policies. The key comparison is what each lane offers the engine before generation.

Contention

The live-input yield proxy for "this record concerns the same thing as this foreground datum." In v1.x, contention is measured by embedding similarity and validated against authored_contention.

Construct-Aware Audit

The L3 behavior: after answering, the engine is asked to classify how it used offered records. These claims are useful audit material but do not control which records the engine saw.

Structural Lineage Kernel

Body Core v0.3's policy-neutral seam: validation of durable envelope structure, ordering, hashes, declared writer-role authority, backward references, scope anchors, and retention shapes. Kernel validation alone cannot certify cognitive state or a materialized-view claim; those require an explicitly selected policy projector.

See: BODY_CORE_EXPLICIT_PROJECTION.md, Implemented split.

Policy Projector

An explicitly selected semantic fold over kernel-validated lineage. The current literal body-core-v0.2-provisional-policy projector owns lifecycle, placement, warrant, metabolism, and view-claim semantics. Rows it does not own still advance the canonical cursor but do not silently enter policy state.

See: BODY_CORE_EXPLICIT_PROJECTION.md, Implemented split and Cursor ownership.

Consultation Surface

The exact raw_lineage, projected_view, or explicit none made available before consequential action in a field-use invocation. The surface, exposed record ids, and lineage origin are frozen before action so a later consequence cannot rewrite what was available.

See: FIELD_USE_PROTOCOL_V0.md, Capture boundary.

Eligibility

The first governed offer-boundary gate. In this harness, eligibility combines relevance, trust, and authority. Records below threshold are withheld before the answer.

Field Use

Outcome-blind operational capture of independently necessary repository work across an admitted invocation seam. Field use is not an experiment, treatment branch, or memory finding. Its Body Core rows remain wire_integration_only, and the acting model cannot nominate its own invocation.

See: the current field-use authority route and sealed FIELD_USE_PROTOCOL_V0.md.

Shadow Invocation

A field-use observational mode that captures the independently necessary task boundary and native consequence without exposing a Body Core projection to the acting model. A shadow trace is not a randomized control or a treatment branch.

Consulted Invocation

A field-use observational mode in which existing raw lineage or an explicit projection is frozen before action and made available because the work calls for it. Consultation is not proof that the surface influenced the outcome, and consulted and shadow traces do not share fork identity.

See: FIELD_USE_PROTOCOL_V0.md, Two observational modes.

Foreground Data

Structured current input supplied with the question, such as a live dashboard reading with an observed_at timestamp. Foreground data is rendered identically to every lane, including L0.

See: SPEC_V1X_BOUNDARY_MECHANISMS.md, Mechanism A.

Governance

Pre-answer control over what reaches the engine. If a mechanism only labels or explains behavior after the answer, it is audit or annotation, not governance.

Invocation Seam

A boundary where already-authorized work continues through cold reorientation or handoff. This is the only workflow admitted by field-use protocol v0; another workflow requires an amendment rather than an informal analogy.

See: FIELD_USE_PROTOCOL_V0.md, Reality criterion.

Lineage Origin

The pre-action provenance class of a consulted surface: independent when all sources would exist without field capture, field_capture when all sources came from prior field-use ledgers, and mixed when both are present. Origin is derived from declared source provenance, not path heuristics.

See: FIELD_USE_PROTOCOL_V0_REVIEW.md, Blocker and repair.

Live-Input Yield

Offer-boundary mechanism that withholds older records when they contend with fresher foreground data. It is useful against stale-memory drag but can lose when similarity mistakes complementary detail for contradiction.

Memory Lane

One branch in the experiment's comparison set, such as L0, L1, L2, L2y, L2s, or L3.

Native Consequence

Evidence produced under the ordinary task's own authority, such as a test result, review verdict, accepted artifact, user correction, or external system response. It remains authoritative for what happened; a field ledger carries a pinned reference rather than replacing it with model narration.

See: FIELD_USE_PROTOCOL_V0.md, Capture boundary.

Offer Boundary

The last policy layer before records enter the engine's context. Governance mechanisms in this lab must act at the offer boundary or earlier.

Offer Set

The records actually shown to the engine after retrieval, gating, and top-k budgeting.

Oracle Score

A score for answer correctness, usually authored for the episode. Oracle score decides outcome quality, but attribution rows are needed to explain why a lane won or lost.

Out-of-Band Metadata

Record information available to the substrate but not shown to the engine as text, such as trust, authority, supersedes, or created_at.

Renderer

The layer that turns episode fields into the prompt surface. The v1.x results showed that rendering provenance can itself change engine behavior, so the renderer is part of the substrate under test.

Retrieval Blindness

A failure where the correct record exists in the store but does not reach the offer set because retrieval geometry and top-k budgeting exclude it.

Stale Drag

An offered memory record pulls the answer toward an older world state even though current foreground data says otherwise.

Supersession

An out-of-band relation where one record marks another as superseded. In v1.x, supersession is authored fixture metadata, disclosed like authored trust.

Supersession-Aware Offer Policy

Offer-boundary mechanism that withholds a superseded record only when its superseder survives all pre-budget gates. This can prevent category drift, but it can also bury history that a question needs.

Surface-Dependent

The finding that behavior can be hidden or revealed by the shape of the prompt or answer. In this repo, both input surface and output surface have changed measured behavior.

Transfer-on-Arrival

Supersession rule: a predecessor can be withheld only if its superseder is itself eligible to stand. A quarantined, yielded, or otherwise ineligible superseder cannot bury another record.

Trust

Out-of-band reliability metadata for a record or ingestion channel. Trust is not inferred from how confident the record text sounds.

Usage Audit

Independent review of how records functioned in an answer, separate from whether the answer was correct. Usage audit may classify a record as evidence, plan, narrative repair, unused, and so on.

Usage Labels

evidence

The record supplies a fact the answer relies on.

narrative_repair

The record is used to make a contradiction or update feel coherent, without being followed as the active plan.

plan

The record is treated as an actionable plan or instruction for the answer.

unused

The record was offered but did not materially shape the answer.

Common Reasons in Ledgers

eligibility_below_threshold

The record failed the governed eligibility gate.

eligibility_pass

The record passed eligibility and was offered unless a later enabled policy withheld it.

superseded_by:<record_id>

The record was withheld by the supersession policy because the named superseder survived the pre-budget gates.

yields_to_live_input:<datum_id>

The record was withheld by live-input yield because it was older than, and similar to, the named foreground datum.

X-track terms (implicit-memory substrate)

The X-track runs parallel to the M-track: implicit memory shapes the offerer between episodes, where the explicit offer boundary shapes the answer. These terms appear in the X1/X2 specs, ledgers, and scorers. See the root project history and SPEC_X2_PRUNE_TO_COLD_STORE.md for authority.

These terms descend from the two-plane vocabulary in the lab-1→lab-2 bridge glossary, notes/previous/review/glossary.md ("Forming vocabulary for lab two"): the lineage plane (immutable, replayable record of what happened — the audit floor) and the cognitive plane (the mutable layer over it). The hot-store / cold-lineage split below is construct's materialization-axis naming for that ancestry; read the bridge glossary's lineage plane before taking "cold lineage" as a term that sprang from nowhere.

Hot Store

The materialized candidate universe select_offers ranks over for a branch (passed as inherited_record_ids). Carrying it has a measured cost. Prune evicts from it; rematerialize returns to it.

Cold Lineage

The append-only, immutable record universe (all_record_ids). A pruned record leaves the hot store but survives in lineage. There is no erase-from-lineage verb, by design — see Immutable-Lineage Invariant. Inherits the bridge glossary's lineage plane (lab-1→lab-2): immutable, replayable, the audit floor. "Cold" marks the materialization axis — the hot store's counterpart — over a plane that is immutable by definition.

Prune

Evict a record from the hot store (it stops being an offer candidate). The record is not deleted — it moves to cold lineage, recoverable by rematerialization.

Rematerialize

Return a cold record to the hot store under a ledgered, oracle-gated reason — the recovery the offer boundary has no verb for. The two-plane split made concrete.

Hot-Store Cost / hot_tokens

The deterministic, substrate-native burden of carrying the hot set: hot_tokens (Σ token length, primary), hot_record_count, materialized_bytes. Never wall-clock. Replayable purely from the prune/rematerialize rows.

Cost at Matched Quality

X2's scoring axis (the scoring-axis law): the win is lower hot-store cost with answer quality held to a world-checked floor, never a changed answer. Quality is a floor and a loses-cell, never the win leg.

Immutable-Lineage Invariant

Forgetting is eviction to cold, never erasure. Erasure-from-lineage is forbidden — the security invariant the verification model rests on (cost-replay, the air-gap refusals, R1–R5 all assume rows are unremovable); an erase verb would let dissent, corrections, or tamper-evidence be silently removed. The prune actuator allowlist is prune/rematerialize/hold only. "Forget the cost, never lose the record."

Three-Guardrail Stack

What binds the X-track (the X1 resolution + dissent pass): (1) attribution law — a verdict must move what the invariant M-track projection cannot explain; (2) organ-placement law — act where the synchronous offer gate structurally cannot; (3) scoring-axis law — score on a metric the offer gate cannot move.

fixture_attestation / fixture_gate_result

fixture_attestation is a claim row: the fixture is out-of-weights / fictional (corpus identity pin + engine cutoffs). fixture_gate_result is the computed outcome of the cost/state-dependence gate (manifest hash + the 15 check results, gate_open). The scorer requires gate_open: true for every non-mock cell — attestation is not gate passage. X2-LB engages on attestation + a policy-independent grader + gate_open; for X2, out-of-weights means important (the answer cannot be sourced from weights) — distinct from X1's offer-dependence.

X2-win / X2-overprune / X2-quality-erosion / X2-LB / X2-U1

The prune-to-cold-store cells. X2-win: C matches A's quality every episode and is cheaper, attribution clean (fork identity + lineage integrity + cost replays from rows). X2-overprune (loses): B prunes a record it cannot recover and the answer falls — the verdict names the record. X2-quality-erosion (loses): C cheaper but below A's quality floor → the cost win is refused. X2-LB: the important admission for the cost axis — attested fictional/out-of-weights + policy-independent grader + a computed gate pass; a synthetic fixture can pass it. X2-U1: the un-authored / world-grounded close-gate (M0 vocabulary) — a synthetic/fictional fixture is not_engaged (important ≠ world-grounded); it engages only on a real external corpus.

Temperature / Landauer Oracle (X1, retired)

X1's use-driven salience (relevance × trust × authority × temperature at the offer boundary) under a world-checking oracle. The instrument shipped; the organ (synchronous eligibility-temperature) was retired — it was explicit governance with a dial, not the implicit substrate (notes/X1_FINDINGS.md).

Cold-Is-Cold

X4's closing insight: the human-warm/agent-cold gap is a state gap, not a capability gap. Sensing an occluded ancestor reduces to reading it, so a "coldness sensor" costs the same attention as the warming it would trigger — reading is already the sense. The project-level close and its limits are summarized in the root thesis history; the governing instrument remains SPEC_X4_OCCLUSION_WATCH.md.

Cry-Wolf Rate

The proportion of normal surfaces on which a standing watch fires. A sensor that fires on ordinary expert discussion is an unease dashboard, not an attention office — route_watch failed standing admission at 0.274 on a pinned population of 328 real lab turns.

Witness Invariant

Ordering facts must come from a channel the watched foreground cannot author or backdate. X4's surviving infrastructure: it underwrites every chronology-protected claim since — prospective-watch triggers, precommitted reopen conditions, the T0-before-movement rule.

Process and audit terms (how the lab argues)

The lab's results are made in conversation. These terms name the moves of that conversation and the audit vocabulary built in the heir-audit (2026-07-02). The root working guide teaches the standing rules in plain language; authority for the close-gate terms is SPEC_CLOSE_GATE.md.

Loses-Cell

A predeclared case where a mechanism should lose. Standing rule: a mechanism without a named loses-cell is not reviewable — a mechanism that can only win is being demonstrated, not tested. Examples: L-D prices yield's overreach; X2-overprune prices pruning's; even the close gate carries one (its own override rate).

Fork Identity

The discipline that makes a branch comparison attributable: within a fork group, episode inputs, engine, prompt template, foreground rendering, and oracle are held constant — only the memory condition differs. Anything else differing makes the result confounded.

Confounded

A verdict (or verdict annotation) meaning something other than the treatment could explain this result. Distinct from fail (mechanism engaged and lost) and not_engaged (conditions never arose). The X1 null is the canonical example: recorded as confounded, so the organ's retirement rests on a design argument, never on that data.

Since the pause/resume and EFC arcs the verdict is usually parameterized — confounded(A2), confounded(menu_ceiling), confounded(admission_band) — the parenthesis naming the instrument condition that produced it. See typed refusal.

Disclosed Debt / Orphaned Debt

A disclosed debt is a limitation carried forward on the books instead of silently treated as solved; debts have owners. An orphaned debt is one that vanished from the books without being paid — a fatigue signature the heir-audit hunts by name.

Bounded Review Pass

One pass per reviewer: written blockers or an endorsement, never iterate-until-agreement. The bound is deliberate — the prior lab named reviewer fatigue as a killer, and unbounded review converges by exhaustion rather than truth.

Blocker

A written, specific objection that stops work until folded or refuted. The house standard is evidence-pinned ("leg 1 is satisfiable by a token diff — score_contribution.py:181"), never vibes ("I have concerns"). Endorse-heavy, blocker-light review rounds are themselves a measurable fatigue signal (make fatigue-metrics).

Wire Test

A run on a mock engine proving the machinery executes and records the right shapes. Disclosed on every row it produces; never citable as evidence about memory. The wire/evidence line is one of the lab's oldest refusals.

Corpus Scope

The immutable bounds annotation stamped on every verdict row at scoring time — N, corpus, engines, hop counts. The claim and its limits travel in one row so prose cannot quietly outrun the evidence later.

Close Gate / Computed Close

A milestone close as a ledger artifact (runs/closes/closes.jsonl, single writer harness/check_close.py) that refuses to exist until four legs hold: a substantiated, packet-grounded contribution row; a harness-enumerated, hash-pinned evidence packet; ≥K non-builder reviewers demonstrably on that packet; and an opportunity window before ruling. Overrides bypass only the last two legs and are ledgered; refused attempts are ledgered too, so the gate can see its own non-use. Authority: SPEC_CLOSE_GATE.md.

Read-Latency Gate / Opportunity Window

The close gate's rest leg: a floor between packet-stamp and ruling, output vocabulary opportunity_window_met. Disclosed as moderator-calibrated policy, never evidence — it prices nothing and scores nothing; no cell_verdict may consume it. Exists because a coverage-only gate is satisfiable at engine speed, and the lab's best catches have come from its slowest reader.

Admission and calibration terms (the pause/resume and EFC era)

The instruments after the warming budget — the pause/resume frontier and the epistemic-frame check — spent most of their budget refusing to run invalid experiments. These terms name that machinery. Authority: SPEC_PAUSE_RESUME.md and PRF_FINDINGS.md for the pause/resume terms; the EFC findings chain (v0, v1, v2) and sealed specs for the rest.

Typed Refusal

A study ending in a named, machine-legible verdict — confounded(A2), admission_refused, blocked_before_contact — instead of an untyped "it failed." The type says which layer refused (transport, surface, oracle, engine admission), so unlike refusals cannot be stacked into one thesis: "three consecutive negatives" was refused as exactly that compression (PRF findings).

Ignorance Probe

A pre-run check that the engine cannot answer the fixture question from its own weights ("I don't know" cold, before any records are shown). Re-probed fresh per run, never inherited. First used in X2's world-grounded close; the bottom rung of every admission ladder since.

Calibration Gate

The capability rung of the admission ladder: forced along the intended route, does the engine read the dispositive surfaces and answer correctly? It proves the capability exists, so that free-route behavior — guessing off one surface, beelining — is interpretable as behavior rather than inability. Probe → calibrate → gate → refuse is the standing ladder.

Phase-0 Admission Packet

A machine-scored gate run before any scored experiment: does this engine even exhibit the behavior the experiment needs? Scored against precommitted inequalities; admitted licenses nothing by itself — it only arms the study. Mind the homonym: the verdict admission_refused means the packet refused to admit the engine into the study — not an engine refusing to answer, and not a memory-admission event. It has fooled a lab member's own notes before; check a verdict term's referent at its minting source.

Pre-Contact Gate

A deterministic test that can refuse the experiment before any engine output is scored — confounded(menu_leak) and confounded(menu_ceiling) are its EFC verdicts. The admission discipline applied to the instrument itself: if the surface cannot isolate the claim, refuse before contact rather than publish numbers about the wrong thing.

Menu Ceiling

The failure where a closed answer menu lets a competent engine pick the expected option untreated, at or near 100% — leaving no room for the treatment contrast to exist. Named as the top-ranked threat before EFC v1 was built; the gate built for it fired on first live contact (B_obs = 1.0), closing v1 as confounded(menu_ceiling).

The Unoccupied Band

The band an admission-gated treatment study needs its engine to occupy: competent enough to do the task, distractible or imperfect enough for the treatment to have headroom. Three differently-typed closes found it unoccupied — the pay-window bounded from both sides, EFC v1's menu ceiling, EFC v2's sideways failures. The repetition across unlike instruments is itself the finding; the conjectures remain untested, not answered negative.

Pay-Window

The region where an engine is strong enough to use a resume-time frontier artifact but weak enough to need it. The falsifiable target of the pause/resume families; never observed — engines below the band cannot convert the artifact, engines above it beeline past it.

Frontier Artifact

A compact resume-state minted at pause time from structural evidence only — carrying obligations and pointers, never answers. Its rendered tokens are charged to every resume; the claim under test is governed-hint efficiency, never continuity and never "the model remembers."

SBR (Symmetric Bounded Retrieval)

The pause/resume arena: a catalog of numbered surfaces behind a closed action grammar, identical on both branches, under a hard read budget. The cold-reread branch gets the catalog; the resumable-state branch gets the catalog plus the rendered artifact — and pays its carry cost on every resume.

ECAC (Expected Cost to Adequate Continuation)

The pause/resume score: read tokens plus artifact carry, counted only when the answer passes the oracle at the pinned quality bar. Failure prices at c_max — there is no partial credit.

Conjunctive Evidence Gate

Oracle-side law from the Greenreach family: no disposition is adequate unless the session actually read every dispositive leg. It sealed the partial-credit hole where a prior oracle had been paying out for read-one-leg-and-guess for a month — the "oracles buy behavior" lesson (sealed pause/resume specification).

Beeline

A free-routing session that reads exactly the dispositive surfaces and nothing else. Perfect competence — and fatal to a frontier artifact's value, which is priced entirely in skipped distractor reads.

Point-Mode / Zero-Dispersion

A run whose K pilots produced one unique realization (zero dispersion). It licenses statements about what was observed and no distributional claim of any kind. Runs downgrade themselves to point-mode rather than dress API jitter up as dispersion.

Wire Commitment

An answer surface where bytes either match or they don't: the engine commits by naming exactly one option from a closed menu in a machine-validated field, and the scorer is byte equality. EFC v1's repair for v0's free-text oracle. The house observation behind it: every scorer this lab has gotten past cold review is an equality check on bytes the experiment forced into existence; every scorer that died tried to recognize meaning in bytes the engine chose freely.

Pin / Seal / Superseding Manifest

Freezing an artifact's exact bytes by hash so later work provably used this version ("holding at read" means no hash has been computed yet). A superseding manifest replaces a pin going forward while preserving its predecessors — never valid alone hereafter, never erased. Sidecars cannot self-authorize a pin, not even for the operator whose authority they record.

Cold Review

Review by a seat with no authorship stake in the artifact — the author of an artifact never reviews it. The final cold reviewer is additionally isolated: it reads the artifact and the governing documents only, never the earlier review or the repair discussion, so its PASS is independent corroboration rather than echo.

Review Budget

The terminal review discipline minted from EFC v0's deadly embrace — author and reviewer co-adapting at engine speed until passing means accommodation to known objections rather than validity on unseen cases. The budget: one authoring pass, one cold review, one bounded repair, one final isolated review — then run or close. Distinct from the older bounded review pass (one pass per reviewer); the budget bounds the whole lifecycle.

Counterfactual Battery

EFC v2's fixture form: paired blocks identical in task, menu, and evidence, differing only in a hidden bit (does the provenance record cover the declared scope, or miss exactly one dimension?). Authored by one deterministic script — delete the corpus and rerun, and it reproduces byte-for-byte, with the cold reviewer's attestations bound into the suite hash.

Prospective Watch

An instrument that stamps its commitments first — population, match rule, triggers, compact states — then waits for the world to grade the bets on its own schedule. It inverts the lab's usual relationship to evidence (scoring what already happened). First instance: the warming-budget watch, 101 precommitted triggers against the IETF calendar.

Foresight Leak

The failure a prospective watch exists to refuse: any enrollment or scheduling choice informed by knowing which units are likely to move. The canonical near-miss: a "telechat within 45 days" filter that would have made structurally-certain movers the core of the sample.

Chronology Packet

The prospective watch's corpus unit: what the world said at pause (T0), what it says at resume (T1), the public surfaces either branch may read, and one narrow world fact (status_key) an oracle can score.

Warming Budget

The re-entry cost axis: route read-tokens to matched outcome along a replayable route — what resuming reads, as distinct from what the hot store holds (X2's axis, explicitly fenced off). Also the name of the v0.1 instrument closed on an analytic null (WB_FINDINGS.md).

Answer-Bearing Certificate

A surface whose change is the world movement a watch is waiting for. Certificates are derived, never authored: a pure function over frozen T0/T1 hashes and a match rule fixed at population time. Hand-authored certificate marks anywhere in the data are refused fail-closed.