@loomwork/replay-vm 0.0.0-stage → 0.1.1

package/LICENSE

@@ -0,0 +1,202 @@
+                                 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 reasonable and customary use in 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 Additional Liability. 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 additional liability.
+
+   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 [yyyy] [name of copyright owner]
+
+   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/NOTICE

@@ -0,0 +1,8 @@
+Loom
+Copyright 2026 Sushil Chhetri
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this project except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0

package/README.md

@@ -1,3 +1,71 @@
-# Temporary Holding Version
+# @loomwork/replay-vm — the fold from events to state
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+Loom keeps an execution as an append-only list of events and derives its state by folding them. This
+package is that fold, and nothing else: `foldEvents(events, initial?)` is a synchronous, in-memory reduce
+that applies one handler per known event type and returns an `ExecutionState`. It does no I/O, runs no flow
+code and calls no effects. "Replay" happens elsewhere: `@loomwork/workflow-runtime` re-runs your flow function
+against the folded state and, through `ReplayVM`, answers `hasCompleted(stepId)` and `getOutput(stepId)`
+from the record so a completed step is served rather than executed again. You import this directly to
+reconstruct state from a log you already hold (tools, analytics, tests) or to read the event-schema version.
+The runtime rebuilds state through this fold on resume, so a change to it changes how an existing log is read.
+
+```ts
+import { EVENT_SCHEMA_VERSION, ReplayVM, foldEvents, knownEventTypes } from "@loomwork/replay-vm";
+import { app, helloFlow } from "./config"; // your defineConfig result and a registered flow
+
+const handle = await app.runtime.start(helloFlow, { name: "Ada" });
+await handle.waitForCompletion();
+
+// The log is the source of truth; the state is a fold of it.
+const events = await app.stores.eventStore.read(handle.executionId);
+const state = foldEvents(events); // pure and synchronous: no I/O, no flow code, no effects
+console.log(state.status, state.sequence, state.variables._output); // "completed" 3 { message: "Hello, Ada!" }
+
+// Or fold incrementally, and ask about individual steps.
+const vm = new ReplayVM(events.slice(0, -1));
+vm.applyEvent(events[events.length - 1]!);
+console.log(vm.hasCompleted("greet"), vm.getOutput("greet"), vm.getState().status);
+
+console.log(EVENT_SCHEMA_VERSION, knownEventTypes().length);
+```
+
+## Surface
+
+- **`foldEvents(events, initial?)`.** Starts from a default `pending` state, or from `initial` such as a
+  snapshot's state, applies events in order, and sets `sequence` to the last event's.
+  `normalizeSnapshotState(state)` reads an older snapshot as the current fold would have written it.
+- **`ReplayVM`.** `new ReplayVM(events, initial?)`, `applyEvent`, `getState()`, `peekState()`,
+  `hasCompleted`, `hasFailed`, `getOutput`, `getTypedFailure`, `hasDecision`, `getDecision`,
+  `flowEmitCount`, `recordedFrames`, `expectedReplayFrames`.
+- **Event-schema ABI.** `EVENT_SCHEMA_VERSION` (currently 1.26.0) and `knownEventTypes()`, the sorted set
+  the fold handles. A governance test pins the set; the event schema is versioned and additive.
+- **Fold limits and constants.** `INBOX_DEDUPE_CAP`, `QUARANTINE_FOLD_CAP`, the custom-dimension limits,
+  `KERNEL_STAMPED_EVENT_TYPES`, `FAILED_WHILE_PARKED`, `FLOW_DIVERGED_GATE`.
+
+## Behaviour that surprises people
+
+- **An unknown event type is a no-op, but `sequence` still advances.** Application events with no handler
+  fold as nothing, which is also why an old log keeps folding under a newer schema.
+- **Some kinds fold only when the kernel wrote them.** `EXECUTION_CONTINUED`, `MESSAGE_CONSUMED`,
+  `PARALLEL_COMPLETED`, `INBOX_QUARANTINED` and `INBOX_RELEASED` take effect only with
+  `metadata.kernel === true`, so an application event that borrows one of those names cannot change state.
+- **A snapshot is a stored fold, and folds can change.** From schema 1.26.0 settled frames no longer carry
+  `input`, and from 1.21.0 a failed step no longer marks the whole execution failed. Run an older
+  snapshot's state through `normalizeSnapshotState` before treating `fold(snapshot, tail)` as equal to
+  `fold(events)`.
+- **`getState()` and `peekState()` differ.** `getState()` returns a state that later `applyEvent` calls will
+  never write to, at the cost of one container copy on the next commit. `peekState()` is a borrowed live
+  view: read it and drop it before the next `applyEvent`.
+- **`foldEvents` shares structure.** The result reuses unchanged parts of `initial`, so treat both as
+  immutable (ADR 0015).
+
+## Install
+
+Unpublished for now: inside this repo use `workspace:*`; from a sibling checkout use a `link:` override (see [AGENTS.md](../../AGENTS.md)).
+
+## See also
+
+- API reference: section "`@loomwork/replay-vm` — deterministic replay" in [docs/api-reference.org](../../docs/api-reference.org).
+- Guides: [event schema reference](../../docs/loom-2.0/10-event-schema-reference.md), [architecture, core runtime](../../docs/architecture.md), [determinism rules](../../docs/user-guide.md#14-determinism-rules--pitfalls).
+- ADRs: [0015 DSA performance optimizations](../../docs/adr/0015-dsa-performance-optimizations.md) (structural sharing), [0105 a caught step failure is not the execution's](../../docs/adr/0105-a-caught-step-failure-is-not-the-executions.md), [0138 compaction archives](../../docs/adr/0138-compaction-archives-what-it-removes.md).
+- Source: `packages/replay-vm/src`. Reading a log at a point in time: [`@loomwork/replay-inspector`](../replay-inspector/README.md).

package/dist/ReplayVM.d.ts

@@ -0,0 +1,59 @@
+import type { EventEnvelope, ExecutionState } from "@loomwork/core";
+export declare class ReplayVM {
+    private state;
+    private owned;
+    private postMigration;
+    constructor(events: EventEnvelope[], initial?: Partial<ExecutionState>);
+    private track;
+    /**
+     * ADR 0113 D3 — every recorded frame in the LOG's first-start order (by `firstSeq`, never by object
+     * key order, which floats integer-like ids to the front). A frame folded before `firstSeq` existed
+     * (an old snapshot) has none: those come first, in key order.
+     */
+    recordedFrames(): Array<{
+        id: string;
+        completed: boolean;
+        seq?: number;
+        scope?: string;
+    }>;
+    /** ADR 0113 D3 — what a decision record says about the steps its decider ran. */
+    getDecisionInner(decisionId: string): {
+        steps: readonly string[];
+        overflow?: {
+            from: number;
+            to: number;
+        };
+    } | undefined;
+    /**
+     * ADR 0113 D3 — the ids of the COMPLETED frames a re-run of this execution is expected to
+     * visit: every completed frame, except those recorded before the execution's last
+     * `EXECUTION_MIGRATED` (a migration changes the frame set on purpose). A fresh array.
+     */
+    expectedReplayFrames(): string[];
+    hasCompleted(stepId: string): boolean;
+    hasFailed(stepId: string): boolean;
+    getTypedFailure(stepId: string): {
+        channel: string;
+        payload: unknown;
+        error?: unknown;
+    } | undefined;
+    getOutput(stepId: string): unknown;
+    hasDecision(decisionId: string): boolean;
+    getDecision(decisionId: string): unknown;
+    flowEmitCount(digest: string): number;
+    /**
+     * The folded state, for a caller that may KEEP it (a snapshot save, a returned handle, a
+     * test). It is stable: later `applyEvent`s never write to it, at the price of one container
+     * copy on the next commit (ownership is dropped). Callers that only read and drop the value
+     * within the same synchronous turn should use {@link peekState}.
+     */
+    getState(): ExecutionState;
+    /**
+     * A BORROWED view of the live state: read it and let go before the next `applyEvent`. It
+     * does not retire fold ownership, so the commit path stays O(1) per event. Do not retain it,
+     * hand it to a caller, or mutate it.
+     */
+    peekState(): ExecutionState;
+    applyEvent(event: EventEnvelope): void;
+}
+//# sourceMappingURL=ReplayVM.d.ts.map

package/dist/ReplayVM.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReplayVM.d.ts","sourceRoot":"","sources":["../src/ReplayVM.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAIpE,qBAAa,QAAQ;IACnB,OAAO,CAAC,KAAK,CAAiB;IAI9B,OAAO,CAAC,KAAK,CAAyB;IAOtC,OAAO,CAAC,aAAa,CAA0B;gBAEnC,MAAM,EAAE,aAAa,EAAE,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC;IAStE,OAAO,CAAC,KAAK;IASb;;;;OAIG;IACH,cAAc,IAAI,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,OAAO,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;IAgBzF,iFAAiF;IACjF,gBAAgB,CACd,UAAU,EAAE,MAAM,GACjB;QAAE,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,GAAG,SAAS;IAyBpF;;;;OAIG;IACH,oBAAoB,IAAI,MAAM,EAAE;IAWhC,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIrC,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAQlC,eAAe,CACb,MAAM,EAAE,MAAM,GACb;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,SAAS;IAUrE,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAOlC,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAKxC,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAaxC,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIrC;;;;;OAKG;IACH,QAAQ,IAAI,cAAc;IAK1B;;;;OAIG;IACH,SAAS,IAAI,cAAc;IAI3B,UAAU,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;CAIvC"}

package/dist/ReplayVM.js

@@ -0,0 +1,160 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ReplayVM = void 0;
+const eventHandlers_1 = require("./eventHandlers");
+const foldEvents_1 = require("./foldEvents");
+class ReplayVM {
+    state;
+    // R1a — the containers (frames, decision map, audit lists, emit trie) THIS VM created and
+    // may therefore write in place on the next commit. Dropped whenever the state escapes
+    // (`getState`), so a state a caller holds is never mutated afterwards.
+    owned = new WeakSet();
+    // ADR 0113 D3 — the step ids that completed AFTER the execution's last `EXECUTION_MIGRATED`
+    // (the replay-divergence detector's baseline resets there: a migration deliberately changes the
+    // frame set). `undefined` until a migration is known: then every completed frame is baseline.
+    // Allocated only for an execution that has been migrated, so the common path pays one string
+    // compare per applied event.
+    postMigration;
+    constructor(events, initial) {
+        this.state = (0, foldEvents_1.foldEvents)(events, initial, this.owned);
+        // A snapshot taken after a migration carries `_migrations`, but not WHEN: everything the
+        // snapshot already holds is exempt, so only the tail's completions count.
+        const migrated = initial?.variables?._migrations;
+        if (Array.isArray(migrated) && migrated.length > 0)
+            this.postMigration = new Set();
+        for (const e of events)
+            this.track(e);
+    }
+    track(event) {
+        if (event.eventType === "EXECUTION_MIGRATED") {
+            this.postMigration = new Set();
+        }
+        else if (this.postMigration !== undefined && event.eventType === "STEP_COMPLETED") {
+            const id = event.payload?.stepId;
+            if (typeof id === "string")
+                this.postMigration.add(id);
+        }
+    }
+    /**
+     * ADR 0113 D3 — every recorded frame in the LOG's first-start order (by `firstSeq`, never by object
+     * key order, which floats integer-like ids to the front). A frame folded before `firstSeq` existed
+     * (an old snapshot) has none: those come first, in key order.
+     */
+    recordedFrames() {
+        const frames = this.state.frames;
+        const out = Object.keys(frames).map((id, keyIndex) => {
+            const f = frames[id];
+            return {
+                id,
+                keyIndex,
+                completed: f.status === "completed",
+                ...(f.firstSeq !== undefined && { seq: f.firstSeq }),
+                ...(f.scope !== undefined && { scope: f.scope }),
+            };
+        });
+        out.sort((a, b) => (a.seq ?? -1) - (b.seq ?? -1) || a.keyIndex - b.keyIndex);
+        return out.map(({ keyIndex: _k, ...rest }) => rest);
+    }
+    /** ADR 0113 D3 — what a decision record says about the steps its decider ran. */
+    getDecisionInner(decisionId) {
+        const decisions = this.state.variables._decisions;
+        if (decisions === undefined || !Object.hasOwn(decisions, decisionId))
+            return undefined;
+        const rec = decisions[decisionId];
+        if (rec === undefined || !Array.isArray(rec.innerSteps))
+            return undefined;
+        return {
+            steps: rec.innerSteps,
+            ...(rec.innerStepsOverflow === true &&
+                rec.innerFrom !== undefined &&
+                rec.recordedAtSeq !== undefined && {
+                overflow: { from: rec.innerFrom, to: rec.recordedAtSeq },
+            }),
+        };
+    }
+    /**
+     * ADR 0113 D3 — the ids of the COMPLETED frames a re-run of this execution is expected to
+     * visit: every completed frame, except those recorded before the execution's last
+     * `EXECUTION_MIGRATED` (a migration changes the frame set on purpose). A fresh array.
+     */
+    expectedReplayFrames() {
+        const frames = this.state.frames;
+        const out = [];
+        for (const id of Object.keys(frames)) {
+            if (frames[id]?.status !== "completed")
+                continue;
+            if (this.postMigration !== undefined && !this.postMigration.has(id))
+                continue;
+            out.push(id);
+        }
+        return out;
+    }
+    hasCompleted(stepId) {
+        return this.state.frames[stepId]?.status === "completed";
+    }
+    hasFailed(stepId) {
+        return this.state.frames[stepId]?.status === "failed";
+    }
+    // DE-4 (ADR 0060) — the typed-failure twin of hasCompleted/getOutput. Defined
+    // only when the step's frame failed ON A DECLARED CHANNEL (a 1.17.0 typed
+    // STEP_FAILED); untyped failures return undefined and keep the legacy
+    // re-execute-on-replay semantics.
+    getTypedFailure(stepId) {
+        const frame = this.state.frames[stepId];
+        if (frame?.status !== "failed" || frame.errorChannel === undefined)
+            return undefined;
+        return {
+            channel: frame.errorChannel,
+            payload: frame.errorPayload,
+            ...(frame.error !== undefined && { error: frame.error }),
+        };
+    }
+    getOutput(stepId) {
+        return this.state.frames[stepId]?.output;
+    }
+    // Loom 2.0 (P9) — decision short-circuit, the twin of hasCompleted/getOutput.
+    // On replay, a decisionId already present in the log is served from state so the
+    // optimizer/router is never re-consulted.
+    hasDecision(decisionId) {
+        const decisions = this.state.variables._decisions;
+        return decisions !== undefined && Object.hasOwn(decisions, decisionId);
+    }
+    getDecision(decisionId) {
+        const decisions = this.state.variables._decisions;
+        // Own-key check (matches hasDecision) so a `__proto__`/inherited name can never read
+        // through the prototype chain.
+        if (decisions === undefined || !Object.hasOwn(decisions, decisionId))
+            return undefined;
+        return decisions[decisionId]?.choice;
+    }
+    // ADR 0102 — how many stamped flow-level emits with this content digest the log holds
+    // (the `_flowEmits` fold). A re-run serves its n-th emit of a digest from the log while
+    // n < this count.
+    flowEmitCount(digest) {
+        return (0, eventHandlers_1.flowEmitCount)(this.state.variables, digest);
+    }
+    /**
+     * The folded state, for a caller that may KEEP it (a snapshot save, a returned handle, a
+     * test). It is stable: later `applyEvent`s never write to it, at the price of one container
+     * copy on the next commit (ownership is dropped). Callers that only read and drop the value
+     * within the same synchronous turn should use {@link peekState}.
+     */
+    getState() {
+        this.owned = new WeakSet();
+        return this.state;
+    }
+    /**
+     * A BORROWED view of the live state: read it and let go before the next `applyEvent`. It
+     * does not retire fold ownership, so the commit path stays O(1) per event. Do not retain it,
+     * hand it to a caller, or mutate it.
+     */
+    peekState() {
+        return this.state;
+    }
+    applyEvent(event) {
+        this.state = (0, foldEvents_1.foldEvents)([event], this.state, this.owned);
+        this.track(event);
+    }
+}
+exports.ReplayVM = ReplayVM;
+//# sourceMappingURL=ReplayVM.js.map

package/dist/ReplayVM.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReplayVM.js","sourceRoot":"","sources":["../src/ReplayVM.ts"],"names":[],"mappings":";;;AACA,mDAAgD;AAChD,6CAA0C;AAE1C,MAAa,QAAQ;IACX,KAAK,CAAiB;IAC9B,0FAA0F;IAC1F,sFAAsF;IACtF,uEAAuE;IAC/D,KAAK,GAAG,IAAI,OAAO,EAAU,CAAC;IAEtC,4FAA4F;IAC5F,gGAAgG;IAChG,8FAA8F;IAC9F,6FAA6F;IAC7F,6BAA6B;IACrB,aAAa,CAA0B;IAE/C,YAAY,MAAuB,EAAE,OAAiC;QACpE,IAAI,CAAC,KAAK,GAAG,IAAA,uBAAU,EAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACrD,yFAAyF;QACzF,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,OAAO,EAAE,SAAS,EAAE,WAAW,CAAC;QACjD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QACnF,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAEO,KAAK,CAAC,KAAoB;QAChC,IAAI,KAAK,CAAC,SAAS,KAAK,oBAAoB,EAAE,CAAC;YAC7C,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QACjC,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,KAAK,CAAC,SAAS,KAAK,gBAAgB,EAAE,CAAC;YACpF,MAAM,EAAE,GAAI,KAAK,CAAC,OAAuC,EAAE,MAAM,CAAC;YAClE,IAAI,OAAO,EAAE,KAAK,QAAQ;gBAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,cAAc;QACZ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE;YACnD,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAyC,CAAC;YAC7D,OAAO;gBACL,EAAE;gBACF,QAAQ;gBACR,SAAS,EAAE,CAAC,CAAC,MAAM,KAAK,WAAW;gBACnC,GAAG,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACpD,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;aACjD,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAC7E,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAED,iFAAiF;IACjF,gBAAgB,CACd,UAAkB;QAElB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAU1B,CAAC;QACd,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC;YAAE,OAAO,SAAS,CAAC;QACvF,MAAM,GAAG,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;QAClC,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1E,OAAO;YACL,KAAK,EAAE,GAAG,CAAC,UAAsB;YACjC,GAAG,CAAC,GAAG,CAAC,kBAAkB,KAAK,IAAI;gBACjC,GAAG,CAAC,SAAS,KAAK,SAAS;gBAC3B,GAAG,CAAC,aAAa,KAAK,SAAS,IAAI;gBACjC,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,SAAS,EAAE,EAAE,EAAE,GAAG,CAAC,aAAa,EAAE;aACzD,CAAC;SACL,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,oBAAoB;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACjC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,IAAI,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,KAAK,WAAW;gBAAE,SAAS;YACjD,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC9E,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,YAAY,CAAC,MAAc;QACzB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,KAAK,WAAW,CAAC;IAC3D,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,KAAK,QAAQ,CAAC;IACxD,CAAC;IAED,8EAA8E;IAC9E,0EAA0E;IAC1E,sEAAsE;IACtE,kCAAkC;IAClC,eAAe,CACb,MAAc;QAEd,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,KAAK,EAAE,MAAM,KAAK,QAAQ,IAAI,KAAK,CAAC,YAAY,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACrF,OAAO;YACL,OAAO,EAAE,KAAK,CAAC,YAAY;YAC3B,OAAO,EAAE,KAAK,CAAC,YAAY;YAC3B,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;SACzD,CAAC;IACJ,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAC3C,CAAC;IAED,8EAA8E;IAC9E,iFAAiF;IACjF,0CAA0C;IAC1C,WAAW,CAAC,UAAkB;QAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAAiD,CAAC;QACzF,OAAO,SAAS,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IACzE,CAAC;IAED,WAAW,CAAC,UAAkB;QAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,UAE1B,CAAC;QACd,qFAAqF;QACrF,+BAA+B;QAC/B,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC;YAAE,OAAO,SAAS,CAAC;QACvF,OAAO,SAAS,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IACvC,CAAC;IAED,sFAAsF;IACtF,wFAAwF;IACxF,kBAAkB;IAClB,aAAa,CAAC,MAAc;QAC1B,OAAO,IAAA,6BAAa,EAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACH,QAAQ;QACN,IAAI,CAAC,KAAK,GAAG,IAAI,OAAO,EAAU,CAAC;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,UAAU,CAAC,KAAoB;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAA,uBAAU,EAAC,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;CACF;AA9KD,4BA8KC"}

package/dist/eventHandlers.d.ts

@@ -0,0 +1,65 @@
+import type { EventEnvelope } from "@loomwork/core";
+import type { ExecutionState } from "@loomwork/core";
+type Handler = (state: ExecutionState, event: EventEnvelope) => ExecutionState;
+export declare function resetFoldOwnership(): void;
+/**
+ * R1a — install the ownership set a fold pass writes against. A one-shot fold (`foldEvents`
+ * with no set) starts empty every call. A LIVE fold (`ReplayVM.applyEvent`) hands in the set
+ * its VM keeps between commits, so containers the VM itself created stay writable in place
+ * across commits (O(1) per event) instead of being re-copied by every single-event fold
+ * (O(size) per event — quadratic over a run). The VM must drop the set the moment it lets a
+ * state escape to a caller (`ReplayVM.getState`), so an escaped state is never written to.
+ * Folding is synchronous and non-reentrant, so swapping the module-level reference is safe.
+ */
+export declare function useFoldOwnership(owned: WeakSet<object>): void;
+export declare const FLOW_EMIT_DIGEST: RegExp;
+export type FlowEmitLeaf = Record<string, number>;
+/** A 16-slot inner node of the `_flowEmits` trie; the third level holds leaves. */
+export type FlowEmitCounts = Array<FlowEmitCounts | FlowEmitLeaf | null>;
+export declare function countFlowEmit(variables: Record<string, unknown>, digest: string): Record<string, unknown>;
+/** How many stamped flow-level emits with this digest the folded log holds. */
+export declare function flowEmitCount(variables: Record<string, unknown>, digest: string): number;
+/**
+ * ADR 0113 (R7 fix round 1) — the reserved gate a REFUSED re-run parks on. Like the in-doubt gate it
+ * is answered by the kernel's own status-only `null` resume (a re-drive after the code is fixed):
+ * the answer must NOT enter `_resumePayloads`, or the body's next gate would take it as its approval.
+ */
+export declare const FLOW_DIVERGED_GATE = "__loom_diverged__";
+/**
+ * 1.21.0 (ADR 0105) — reserved fold key: `true` while the execution is PARKED and a
+ * `STEP_FAILED` has landed since it parked (a parallel sibling failing after the flow reached
+ * its gate). Set only by that event in that state; removed by whatever ends the park — the next
+ * `EXECUTION_SUSPENDED` or `EXECUTION_RESUMED`, or a terminal `EXECUTION_COMPLETED` /
+ * `_FAILED` / `_CANCELLED`; absent otherwise, so a log without such a failure never gains it.
+ *
+ * It exists to keep one rule the 1.20.0 fold had implicitly. 1.20.0 folded that failure to
+ * "failed", so a following `null` resume was status-only (it answered no gate, and a 1.20.0
+ * `resumeAs` wrote exactly that). Since 1.21.0 the execution stays `suspended`; without this
+ * key the same `null` would become the gate's answer, and a replay's outcome would depend on
+ * whether it was seeded from a 1.20.0 snapshot — breaking snapshot + tail ≡ full log. So a
+ * `null` resume in this position stays status-only (fail-closed: the gate re-parks rather than
+ * passing without an approval). The cost: a caller's explicit `null` answer to such a gate is
+ * not recorded as its answer; the gate re-parks and takes the next non-null one.
+ */
+export declare const FAILED_WHILE_PARKED = "_failedWhileParked";
+/** Kinds whose fold requires the kernel stamp, and which the journal stamps when it writes one. */
+export declare const KERNEL_STAMPED_EVENT_TYPES: ReadonlySet<string>;
+/** Every inbox dedupe window the fold keeps is capped here; the runtime may apply a smaller one. */
+export declare const INBOX_DEDUPE_CAP = 1024;
+/**
+ * 1.25.0 (ADR 0130 residuals D9) — the fold keeps at most this many quarantined entries in total
+ * (`_quarantined`, across topics). A fold cannot read a runtime setting (the lesson of ADR 0110 D6),
+ * so the ceiling is a fold constant; the runtime's own `quarantineMax` (default 256) may be raised
+ * to it, never above. A fact that would exceed it is ignored.
+ */
+export declare const QUARANTINE_FOLD_CAP = 1024;
+/** ADR 0115 D2 — custom metering dimension names, count and per-value ceiling. */
+export declare const CUSTOM_DIMENSION_PATTERN: RegExp;
+export declare const CUSTOM_DIMENSION_MAX = 32;
+export declare const CUSTOM_DIMENSION_CEILING = 1000000000000000;
+export declare const BUILTIN_DIMENSION_NAMES: ReadonlySet<string>;
+export declare function getHandler(eventType: string): Handler | undefined;
+export declare const EVENT_SCHEMA_VERSION = "1.26.0";
+export declare function knownEventTypes(): string[];
+export {};
+//# sourceMappingURL=eventHandlers.d.ts.map

package/dist/eventHandlers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eventHandlers.d.ts","sourceRoot":"","sources":["../src/eventHandlers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,KAAK,EAAkB,cAAc,EAAe,MAAM,gBAAgB,CAAC;AAElF,KAAK,OAAO,GAAG,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,KAAK,cAAc,CAAC;AAsD/E,wBAAgB,kBAAkB,IAAI,IAAI,CAEzC;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAE7D;AA4BD,eAAO,MAAM,gBAAgB,QAAmB,CAAC;AACjD,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAClD,mFAAmF;AACnF,MAAM,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,GAAG,YAAY,GAAG,IAAI,CAAC,CAAC;AAiBzE,wBAAgB,aAAa,CAC3B,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAClC,MAAM,EAAE,MAAM,GACb,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAgBzB;AAED,+EAA+E;AAC/E,wBAAgB,aAAa,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CASxF;AAaD;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,sBAAsB,CAAC;AAEtD;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,mBAAmB,uBAAuB,CAAC;AAiCxD,mGAAmG;AACnG,eAAO,MAAM,0BAA0B,EAAE,WAAW,CAAC,MAAM,CAOzD,CAAC;AAUH,oGAAoG;AACpG,eAAO,MAAM,gBAAgB,OAAO,CAAC;AACrC;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,OAAO,CAAC;AACxC,kFAAkF;AAClF,eAAO,MAAM,wBAAwB,QAA6B,CAAC;AACnE,eAAO,MAAM,oBAAoB,KAAK,CAAC;AACvC,eAAO,MAAM,wBAAwB,mBAAO,CAAC;AAkE7C,eAAO,MAAM,uBAAuB,EAAE,WAAW,CAAC,MAAM,CAOtD,CAAC;AA6xCH,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,CAQjE;AAmHD,eAAO,MAAM,oBAAoB,WAAW,CAAC;AAE7C,wBAAgB,eAAe,IAAI,MAAM,EAAE,CAE1C"}