@noetic-tools/context 1.0.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for describing the origin of the Work and
+      reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Support. While redistributing the Work or
+      Derivative Works thereof, You may choose to offer, and charge a
+      fee for, acceptance of support, warranty, indemnity, or other
+      liability obligations and/or rights consistent with this License.
+      However, in accepting such obligations, You may act only on Your
+      own behalf and on Your sole responsibility, not on behalf of any
+      other Contributor, and only if You agree to indemnify, defend,
+      and hold each Contributor harmless for any liability incurred by,
+      or claims asserted against, such Contributor by reason of your
+      accepting any such warranty or support.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Matt Apperson
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied. See the License for the specific language governing
+   permissions and limitations under the License.

package/README.md

@@ -0,0 +1,28 @@
+# @noetic-tools/context
+
+The context layer system for Noetic agents.
+
+A *context layer* is a composable unit that shapes what an agent sees in its
+context window — capping history, summarising old turns, tracking a plan,
+exposing tool results, redacting items, and steering tool calls. This package
+provides:
+
+- The **`ContextLayer` contract** — the interface every layer implements.
+- The **lifecycle, budget, and projection machinery** that converges layer
+  outputs into the assembled LLM context (`assembleView`, `allocateBudgets`,
+  layer state stores, scoping).
+- The **built-in layers**: working memory, history window, observational
+  context, plan, temporal, steering, file reference, static content, durable
+  task state, and the tool context layer.
+
+It depends only on [`@noetic-tools/types`](https://www.npmjs.com/package/@noetic-tools/types).
+[`@noetic-tools/core`](https://www.npmjs.com/package/@noetic-tools/core) builds
+on it and re-exports its public surface, so application code typically imports
+context layers from `@noetic-tools/core`.
+
+> Formerly published as `@noetic-tools/memory`. That package still resolves — it
+> re-exports everything here — but is deprecated and will stop being updated.
+
+## License
+
+Apache-2.0

package/dist/context/budget.d.ts

@@ -0,0 +1,39 @@
+import type { Context, ContextLayer, ProjectionPolicy } from '@noetic-tools/types';
+export interface BudgetAllocation {
+    layerId: string;
+    allocated: number;
+}
+/**
+ * Fallback projection policy when neither a step nor the harness configures one.
+ * The token budget is a conservative default; configure `harness.projection` or
+ * `step.projection` to match the target model's real context length.
+ */
+export declare const DEFAULT_PROJECTION: ProjectionPolicy;
+interface AllocateBudgetsOpts {
+    layers: ContextLayer[];
+    totalBudget: number;
+    systemPromptTokens: number;
+    responseReserve: number;
+}
+/**
+ * Split the recall budget across layers: minimums first, then 60% of the
+ * remainder as a proportional pool (by headroom `max − min`; `'auto'` and
+ * omitted budgets have infinite headroom and split the pool after finite
+ * layers take their share), 40% reserved for history. The pool is conserved —
+ * finite shares plus the infinite layers' split always sum to the pool.
+ *
+ * Input contract: `totalBudget` / `systemPromptTokens` / `responseReserve`
+ * MUST NOT be NaN (throws `NoeticConfigError` code `INVALID_BUDGET_INPUT`).
+ * `Infinity` is allowed (= uncapped) and fractional values are accepted.
+ */
+export declare function allocateBudgets({ layers, totalBudget, systemPromptTokens, responseReserve, }: AllocateBudgetsOpts): {
+    allocations: BudgetAllocation[];
+    historyBudget: number;
+};
+export interface BudgetLimits {
+    maxCost?: number;
+    maxSteps?: number;
+    maxDuration?: number;
+}
+export declare function checkBudget(ctx: Context, limits: BudgetLimits): void;
+export {};

package/dist/context/budget.js

@@ -0,0 +1,183 @@
+import { NoeticConfigError, NoeticErrorImpl } from '@noetic-tools/types';
+/**
+ * Fallback projection policy when neither a step nor the harness configures one.
+ * The token budget is a conservative default; configure `harness.projection` or
+ * `step.projection` to match the target model's real context length.
+ */
+export const DEFAULT_PROJECTION = {
+    tokenBudget: 128e3,
+    responseReserve: 4e3,
+    overflow: 'sliding_window',
+};
+function extractMin(config) {
+    if (config && typeof config === 'object' && 'min' in config) {
+        return config.min;
+    }
+    return 0;
+}
+function extractMax(config) {
+    // 'auto' AND omitted budgets have infinite headroom (spec 11): a layer that
+    // declares no budget splits the proportional pool with the 'auto' layers
+    // rather than being starved at 0.
+    if (config === 'auto' || config === undefined) {
+        return Number.POSITIVE_INFINITY;
+    }
+    if (typeof config === 'number') {
+        return config;
+    }
+    if (typeof config === 'object' && 'min' in config) {
+        return config.max;
+    }
+    return 0;
+}
+/**
+ * Single-priced finite shares: each finite layer's share is computed ONCE and
+ * that same value is subtracted from the pool before infinite-headroom layers
+ * split the remainder — so the pool is conserved (Σ shares === layerPool when
+ * any infinite layer exists). With no infinite layers, finite layers split the
+ * whole pool proportionally; with a mix, finite layers share half the pool,
+ * clamped to their headroom.
+ */
+function computeFiniteShares(headrooms, layerPool) {
+    const infiniteCount = headrooms.filter((h) => !Number.isFinite(h)).length;
+    const finiteTotal = headrooms.reduce((sum, h) => (Number.isFinite(h) ? sum + h : sum), 0);
+    const finitePool = infiniteCount === 0 ? layerPool : layerPool * 0.5;
+    return headrooms.map((h) => {
+        if (!Number.isFinite(h) || finiteTotal === 0) {
+            return 0;
+        }
+        const proportional = (h / finiteTotal) * finitePool;
+        return infiniteCount === 0 ? proportional : Math.min(h, proportional);
+    });
+}
+const BUDGET_INPUT_FIELDS = [
+    'totalBudget',
+    'systemPromptTokens',
+    'responseReserve',
+];
+/**
+ * NaN in any budget input silently poisons every allocation downstream
+ * (NaN fails the `available <= 0` guard, then every arithmetic op yields
+ * NaN). Reject it loudly at the boundary. `Infinity` stays allowed — it is a
+ * coherent "uncapped" budget — and fractional values are fine (allocations
+ * floor where it matters).
+ */
+function assertBudgetInputs(opts) {
+    for (const field of BUDGET_INPUT_FIELDS) {
+        if (Number.isNaN(opts[field])) {
+            throw new NoeticConfigError({
+                code: 'INVALID_BUDGET_INPUT',
+                message: `allocateBudgets: ${field} is NaN.`,
+                hint: 'Pass a real number (Infinity is allowed for an uncapped budget).',
+            });
+        }
+    }
+}
+/**
+ * Split the recall budget across layers: minimums first, then 60% of the
+ * remainder as a proportional pool (by headroom `max − min`; `'auto'` and
+ * omitted budgets have infinite headroom and split the pool after finite
+ * layers take their share), 40% reserved for history. The pool is conserved —
+ * finite shares plus the infinite layers' split always sum to the pool.
+ *
+ * Input contract: `totalBudget` / `systemPromptTokens` / `responseReserve`
+ * MUST NOT be NaN (throws `NoeticConfigError` code `INVALID_BUDGET_INPUT`).
+ * `Infinity` is allowed (= uncapped) and fractional values are accepted.
+ */
+export function allocateBudgets({ layers, totalBudget, systemPromptTokens, responseReserve, }) {
+    assertBudgetInputs({
+        layers,
+        totalBudget,
+        systemPromptTokens,
+        responseReserve,
+    });
+    const available = totalBudget - responseReserve - systemPromptTokens;
+    if (available <= 0) {
+        return {
+            allocations: layers.map((l) => ({
+                layerId: l.id,
+                allocated: 0,
+            })),
+            historyBudget: 0,
+        };
+    }
+    // Phase 1: satisfy minimums
+    let remaining = available;
+    const allocations = [];
+    for (const layer of layers) {
+        const min = extractMin(layer.budget);
+        allocations.push({
+            layerId: layer.id,
+            allocated: min,
+        });
+        remaining -= min;
+    }
+    // Declared minimums overcommit the available budget: scale them down
+    // proportionally so the total fits `available` (never negative, never over).
+    // Nothing is left for the proportional pool or history.
+    if (remaining < 0) {
+        const totalMin = available - remaining;
+        const scale = totalMin > 0 ? available / totalMin : 0;
+        for (const alloc of allocations) {
+            alloc.allocated = Math.floor(alloc.allocated * scale);
+        }
+        return {
+            allocations,
+            historyBudget: 0,
+        };
+    }
+    // Phase 2: distribute 60% of remaining to layers proportionally, 40% to history
+    const layerPool = remaining * 0.6;
+    const historyBudget = remaining * 0.4;
+    // Compute headroom per layer (how much above the minimum each layer can absorb)
+    let totalMax = 0;
+    const headrooms = [];
+    for (let i = 0; i < layers.length; i++) {
+        const max = extractMax(layers[i].budget);
+        const headroom = Math.max(0, max - allocations[i].allocated);
+        headrooms.push(headroom);
+        totalMax += headroom;
+    }
+    if (totalMax > 0) {
+        const infiniteCount = headrooms.filter((h) => !Number.isFinite(h)).length;
+        const finiteShares = computeFiniteShares(headrooms, layerPool);
+        const finiteUsed = finiteShares.reduce((sum, s) => sum + s, 0);
+        // Infinite-headroom layers split exactly what the finite shares left over,
+        // so no part of the pool is silently lost.
+        const infiniteShare = infiniteCount > 0 ? (layerPool - finiteUsed) / infiniteCount : 0;
+        for (let i = 0; i < headrooms.length; i++) {
+            const share = Number.isFinite(headrooms[i]) ? finiteShares[i] : infiniteShare;
+            allocations[i].allocated += Math.min(share, headrooms[i]);
+        }
+    }
+    return {
+        allocations,
+        historyBudget: Math.max(0, historyBudget),
+    };
+}
+export function checkBudget(ctx, limits) {
+    if (limits.maxCost !== undefined && ctx.cost > limits.maxCost) {
+        throw new NoeticErrorImpl({
+            kind: 'budget_exceeded',
+            field: 'cost',
+            limit: limits.maxCost,
+            actual: ctx.cost,
+        });
+    }
+    if (limits.maxSteps !== undefined && ctx.stepCount > limits.maxSteps) {
+        throw new NoeticErrorImpl({
+            kind: 'budget_exceeded',
+            field: 'steps',
+            limit: limits.maxSteps,
+            actual: ctx.stepCount,
+        });
+    }
+    if (limits.maxDuration !== undefined && ctx.elapsed > limits.maxDuration) {
+        throw new NoeticErrorImpl({
+            kind: 'budget_exceeded',
+            field: 'duration',
+            limit: limits.maxDuration,
+            actual: ctx.elapsed,
+        });
+    }
+}

package/dist/context/exec-context-factory.d.ts

@@ -0,0 +1,24 @@
+import type { Context, ExecutionContext } from '@noetic-tools/types';
+/**
+ * Optional overrides for `contextToExecCtx`. Used by `executeSpawn` to build
+ * parent and child execution contexts that reuse the same tokenize / trace /
+ * layer-state wiring as the main path, but with spawn-specific identity
+ * (`executionId`, `depth`, `stepNumber`, and the scope used for layer-state
+ * reads).
+ */
+export interface ExecCtxOverrides {
+    callModel?: ExecutionContext['callModel'];
+    executionId?: string;
+    depth?: number;
+    stepNumber?: number;
+    tokenUsage?: ExecutionContext['tokenUsage'];
+    cost?: number;
+    /** Execution id to scope `readLayerState` to (defaults to `ctx.id`). */
+    readLayerStateId?: string;
+}
+/**
+ * Maps a full `Context` to the lightweight `ExecutionContext` consumed by context layer hooks.
+ * Centralised here so the mapping stays consistent across agent-harness, layer-api, and the
+ * spawn interpreter.
+ */
+export declare function contextToExecCtx(ctx: Context, overrides?: ExecCtxOverrides): ExecutionContext;

package/dist/context/exec-context-factory.js

@@ -0,0 +1,30 @@
+import { estimateTokens } from '@noetic-tools/types';
+/**
+ * Maps a full `Context` to the lightweight `ExecutionContext` consumed by context layer hooks.
+ * Centralised here so the mapping stays consistent across agent-harness, layer-api, and the
+ * spawn interpreter.
+ */
+export function contextToExecCtx(ctx, overrides) {
+    const readLayerStateId = overrides?.readLayerStateId ?? ctx.id;
+    return {
+        executionId: overrides?.executionId ?? ctx.id,
+        threadId: ctx.threadId,
+        resourceId: ctx.resourceId,
+        depth: overrides?.depth ?? ctx.depth,
+        stepNumber: overrides?.stepNumber ?? ctx.stepCount,
+        tokenUsage: overrides?.tokenUsage ?? {
+            input: ctx.tokens.input,
+            output: ctx.tokens.output,
+        },
+        cost: overrides?.cost ?? ctx.cost,
+        fs: ctx.harness.fs,
+        shell: ctx.harness.shell,
+        callModel: overrides?.callModel,
+        tokenize: estimateTokens,
+        trace: {
+            setAttribute: (key, value) => ctx.span.setAttribute(key, value),
+            addEvent: (name, attributes) => ctx.span.addEvent(name, attributes),
+        },
+        readLayerState: (layerId) => ctx.harness.getLayerState(readLayerStateId, layerId),
+    };
+}

package/dist/context/function-call-utils.d.ts

@@ -0,0 +1,6 @@
+import type { Item } from '@noetic-tools/types';
+/**
+ * Finds the first function_call item matching `name`, parses its JSON arguments,
+ * and returns the result as a record. Returns null if no match or invalid data.
+ */
+export declare function findFunctionCall(items: ReadonlyArray<Item>, name: string): Record<string, unknown> | null;

package/dist/context/function-call-utils.js

@@ -0,0 +1,27 @@
+import { frameworkCast } from '@noetic-tools/types';
+function isFunctionCall(item) {
+    return item.type === 'function_call' && 'callId' in item && 'name' in item;
+}
+/**
+ * Finds the first function_call item matching `name`, parses its JSON arguments,
+ * and returns the result as a record. Returns null if no match or invalid data.
+ */
+export function findFunctionCall(items, name) {
+    for (const item of items) {
+        if (!isFunctionCall(item)) {
+            continue;
+        }
+        if (item.name !== name) {
+            continue;
+        }
+        try {
+            const raw = JSON.parse(item.arguments);
+            if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {
+                continue;
+            }
+            return frameworkCast(raw);
+        }
+        catch { }
+    }
+    return null;
+}

package/dist/context/layer-api.d.ts

@@ -0,0 +1,11 @@
+import type { AgentHarnessContract, Context, ContextData, ContextLayer, Tool } from '@noetic-tools/types';
+/**
+ * Build the `ctx.context` object — a readonly map of layer ID → resolved handle.
+ * Handles use getters for data (live reads) and closures for functions (lazy state).
+ */
+export declare function buildContextData(layers: ReadonlyArray<ContextLayer>, ctx: Context): ContextData;
+/**
+ * Collect all `provides` function declarations from active layers and convert them to Tools.
+ * Tool names are namespaced as `layerId/functionName`.
+ */
+export declare function resolveLayerTools(layers: ReadonlyArray<ContextLayer>, harness: AgentHarnessContract, ctx: Context): Tool[];

package/dist/context/layer-api.js

@@ -0,0 +1,91 @@
+import { frameworkCast } from '@noetic-tools/types';
+import { contextToExecCtx } from './exec-context-factory.js';
+function executeLayerFn(params) {
+    const { fn, args, layerId, harness, ctx } = params;
+    const validated = fn.input.parse(args);
+    const state = harness.getLayerState(ctx.id, layerId);
+    const execCtx = contextToExecCtx(ctx);
+    return fn.execute(validated, state, execCtx).then((outcome) => {
+        if (outcome.state !== undefined) {
+            harness.setLayerState(ctx.id, layerId, outcome.state);
+        }
+        return outcome.result;
+    });
+}
+function buildLayerHandle(layer, ctx) {
+    const provides = layer.provides;
+    if (!provides) {
+        return {};
+    }
+    const handle = {};
+    const harness = ctx.harness;
+    const layerId = layer.id;
+    for (const [name, decl] of Object.entries(provides)) {
+        if (decl.kind === 'data') {
+            Object.defineProperty(handle, name, {
+                get() {
+                    const state = harness.getLayerState(ctx.id, layerId);
+                    return decl.read(state);
+                },
+                enumerable: true,
+            });
+            continue;
+        }
+        handle[name] = (args) => executeLayerFn({
+            fn: decl,
+            args,
+            layerId,
+            harness,
+            ctx,
+        });
+    }
+    return handle;
+}
+//#endregion
+//#region Context Data
+/**
+ * Build the `ctx.context` object — a readonly map of layer ID → resolved handle.
+ * Handles use getters for data (live reads) and closures for functions (lazy state).
+ */
+export function buildContextData(layers, ctx) {
+    const data = {};
+    for (const layer of layers) {
+        data[layer.id] = buildLayerHandle(layer, ctx);
+    }
+    return frameworkCast(data);
+}
+//#endregion
+//#region Layer Tools Resolution
+/**
+ * Collect all `provides` function declarations from active layers and convert them to Tools.
+ * Tool names are namespaced as `layerId/functionName`.
+ */
+export function resolveLayerTools(layers, harness, ctx) {
+    const tools = [];
+    for (const layer of layers) {
+        if (!layer.provides) {
+            continue;
+        }
+        for (const [name, decl] of Object.entries(layer.provides)) {
+            if (decl.kind !== 'function') {
+                continue;
+            }
+            const layerId = layer.id;
+            tools.push({
+                name: `${layerId}/${name}`,
+                description: decl.description,
+                input: decl.input,
+                output: decl.output,
+                execute: (args, _toolCtx) => executeLayerFn({
+                    fn: decl,
+                    args,
+                    layerId,
+                    harness,
+                    ctx,
+                }),
+            });
+        }
+    }
+    return tools;
+}
+//#endregion