pi-fabric 0.125.1 → 0.125.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -0
- package/dist/agents.js +3 -3
- package/dist/chunks/{chunk-M4QX7OND.js → chunk-2N2NS4ZR.js} +4 -4
- package/dist/chunks/{chunk-PI5HYN6C.js → chunk-3KRAD6BR.js} +2 -2
- package/dist/chunks/{chunk-BPAACXYZ.js → chunk-3NU3Z43H.js} +3 -3
- package/dist/chunks/{chunk-ZUWFYDYF.js → chunk-4QTGATQD.js} +2 -2
- package/dist/chunks/{chunk-K7PQSM7Z.js → chunk-4Y2LMAF2.js} +2 -2
- package/dist/chunks/{chunk-UGISETNM.js → chunk-4ZUMD27O.js} +1 -1
- package/dist/chunks/{chunk-UGISETNM.js.map → chunk-4ZUMD27O.js.map} +1 -1
- package/dist/chunks/{chunk-BQV7UI7B.js → chunk-7C6QZCUR.js} +5 -5
- package/dist/chunks/{chunk-STF6ZFSQ.js → chunk-7WEXQQEQ.js} +2 -2
- package/dist/chunks/{chunk-BBJ4ANUN.js → chunk-B43JHNA4.js} +4 -4
- package/dist/chunks/{chunk-PK6ZB2YW.js → chunk-BAYAQYAL.js} +2 -2
- package/dist/chunks/{chunk-OZE4GDBJ.js → chunk-BOTUL4UK.js} +3 -3
- package/dist/chunks/{chunk-WIS6TT6Y.js → chunk-BRNNBKIN.js} +2 -2
- package/dist/chunks/{chunk-72SSO3R2.js → chunk-CC6NHCCE.js} +3 -3
- package/dist/chunks/{chunk-HKQUC5EK.js → chunk-CQD5W3DV.js} +3 -3
- package/dist/chunks/{chunk-RYR555GF.js → chunk-DXVMGTC7.js} +2 -2
- package/dist/chunks/{chunk-7P4QXQK2.js → chunk-IWK5QA3D.js} +2 -2
- package/dist/chunks/{chunk-IOLXIF76.js → chunk-IXKXKK26.js} +2 -2
- package/dist/chunks/{chunk-EQHAEYW5.js → chunk-KIOAZ4AA.js} +2 -2
- package/dist/chunks/{chunk-QHBH3XQ4.js → chunk-KNV6LT4Y.js} +2 -2
- package/dist/chunks/{chunk-C3FFCLYG.js → chunk-KWESYT2E.js} +3 -3
- package/dist/chunks/{chunk-STPXP6PN.js → chunk-MK4TBJ6O.js} +2 -2
- package/dist/chunks/{chunk-GJ5BSGIX.js → chunk-OJ4LIEDL.js} +6 -6
- package/dist/chunks/{chunk-GJ5BSGIX.js.map → chunk-OJ4LIEDL.js.map} +1 -1
- package/dist/chunks/{chunk-4DJPPVM6.js → chunk-RDGAQ5VZ.js} +6 -6
- package/dist/chunks/{chunk-6PYEL4QS.js → chunk-RX74PKZS.js} +4 -4
- package/dist/chunks/{chunk-YJS5AZEU.js → chunk-RXFUXMXS.js} +2 -2
- package/dist/chunks/{chunk-2WT5GNUP.js → chunk-SCOJ4BWV.js} +1 -1
- package/dist/chunks/{chunk-2WT5GNUP.js.map → chunk-SCOJ4BWV.js.map} +1 -1
- package/dist/chunks/{chunk-A3YWHPN6.js → chunk-SMN3KEIT.js} +2 -2
- package/dist/chunks/{chunk-5OPYNHI6.js → chunk-VWYSKQ6F.js} +2 -2
- package/dist/chunks/{chunk-7OQGN47K.js → chunk-Y2GC7YXJ.js} +4 -4
- package/dist/cli/decisions.js +1 -1
- package/dist/cli/mesh.js +2 -2
- package/dist/compaction/hook.js +6 -6
- package/dist/compaction/owner.js +7 -7
- package/dist/core/action-registry.js +7 -7
- package/dist/core/provider-operations.js.map +1 -1
- package/dist/entropy/index.js +9 -9
- package/dist/extension-bootstrap.js +6 -6
- package/dist/fabric-runtime-state.js +24 -24
- package/dist/index.js +12 -12
- package/dist/jev/observation.js +5 -5
- package/dist/jev.js +8 -8
- package/dist/memory/digest.js +2 -2
- package/dist/memory/discovery.js +6 -6
- package/dist/memory/file-worker.js +9 -9
- package/dist/memory/normalize.js +5 -5
- package/dist/memory/search.js +7 -7
- package/dist/memory/worker-provider.js +10 -10
- package/dist/memory.js +10 -10
- package/dist/providers/jev-provider.js +8 -8
- package/dist/providers/memory-provider.js +9 -9
- package/dist/residency/host.js +9 -9
- package/dist/residency/pi-entry.js +9 -9
- package/dist/verified/generated/authority.d.ts +1 -1
- package/dist/verified/generated/authority.js +1 -1
- package/dist/verified/generated/compaction.d.ts +1 -1
- package/dist/verified/generated/compaction.js +1 -1
- package/dist/verified/generated/lifecycle.d.ts +1 -1
- package/dist/verified/generated/lifecycle.js +1 -1
- package/dist/verified/generated/manifest.json +17 -17
- package/dist/verified/generated/policy.d.ts +1 -1
- package/dist/verified/generated/policy.js +1 -1
- package/dist/verified/generated/provider.d.ts +1 -1
- package/dist/verified/generated/provider.js +1 -1
- package/dist/verified/generated/resources.d.ts +1 -1
- package/dist/verified/generated/resources.js +1 -1
- package/dist/verified/generated/storage.d.ts +1 -1
- package/dist/verified/generated/storage.js +1 -1
- package/docs/verified-kernels.md +9 -4
- package/package.json +2 -2
- package/proofs/kernel.ts +10 -4
- package/scripts/verified-kernels.ts +2 -1
- /package/dist/chunks/{chunk-M4QX7OND.js.map → chunk-2N2NS4ZR.js.map} +0 -0
- /package/dist/chunks/{chunk-PI5HYN6C.js.map → chunk-3KRAD6BR.js.map} +0 -0
- /package/dist/chunks/{chunk-BPAACXYZ.js.map → chunk-3NU3Z43H.js.map} +0 -0
- /package/dist/chunks/{chunk-ZUWFYDYF.js.map → chunk-4QTGATQD.js.map} +0 -0
- /package/dist/chunks/{chunk-K7PQSM7Z.js.map → chunk-4Y2LMAF2.js.map} +0 -0
- /package/dist/chunks/{chunk-BQV7UI7B.js.map → chunk-7C6QZCUR.js.map} +0 -0
- /package/dist/chunks/{chunk-STF6ZFSQ.js.map → chunk-7WEXQQEQ.js.map} +0 -0
- /package/dist/chunks/{chunk-BBJ4ANUN.js.map → chunk-B43JHNA4.js.map} +0 -0
- /package/dist/chunks/{chunk-PK6ZB2YW.js.map → chunk-BAYAQYAL.js.map} +0 -0
- /package/dist/chunks/{chunk-OZE4GDBJ.js.map → chunk-BOTUL4UK.js.map} +0 -0
- /package/dist/chunks/{chunk-WIS6TT6Y.js.map → chunk-BRNNBKIN.js.map} +0 -0
- /package/dist/chunks/{chunk-72SSO3R2.js.map → chunk-CC6NHCCE.js.map} +0 -0
- /package/dist/chunks/{chunk-HKQUC5EK.js.map → chunk-CQD5W3DV.js.map} +0 -0
- /package/dist/chunks/{chunk-RYR555GF.js.map → chunk-DXVMGTC7.js.map} +0 -0
- /package/dist/chunks/{chunk-7P4QXQK2.js.map → chunk-IWK5QA3D.js.map} +0 -0
- /package/dist/chunks/{chunk-IOLXIF76.js.map → chunk-IXKXKK26.js.map} +0 -0
- /package/dist/chunks/{chunk-EQHAEYW5.js.map → chunk-KIOAZ4AA.js.map} +0 -0
- /package/dist/chunks/{chunk-QHBH3XQ4.js.map → chunk-KNV6LT4Y.js.map} +0 -0
- /package/dist/chunks/{chunk-C3FFCLYG.js.map → chunk-KWESYT2E.js.map} +0 -0
- /package/dist/chunks/{chunk-STPXP6PN.js.map → chunk-MK4TBJ6O.js.map} +0 -0
- /package/dist/chunks/{chunk-4DJPPVM6.js.map → chunk-RDGAQ5VZ.js.map} +0 -0
- /package/dist/chunks/{chunk-6PYEL4QS.js.map → chunk-RX74PKZS.js.map} +0 -0
- /package/dist/chunks/{chunk-YJS5AZEU.js.map → chunk-RXFUXMXS.js.map} +0 -0
- /package/dist/chunks/{chunk-A3YWHPN6.js.map → chunk-SMN3KEIT.js.map} +0 -0
- /package/dist/chunks/{chunk-5OPYNHI6.js.map → chunk-VWYSKQ6F.js.map} +0 -0
- /package/dist/chunks/{chunk-7OQGN47K.js.map → chunk-Y2GC7YXJ.js.map} +0 -0
package/README.md
CHANGED
|
@@ -78,6 +78,8 @@ Pi's native MCP can optionally supply selected servers beneath the same Fabric A
|
|
|
78
78
|
|
|
79
79
|
Requires Node.js 24+ and Pi 1.0.0+. Monty's optional native package installs on supported platforms; only the explicit CPython escape hatch requires CPython 3.10+. Fabric warns when a detectable host is older than the required native loadout and nested-execution contracts.
|
|
80
80
|
|
|
81
|
+
**0.125.2: arbitrary-state policy proofs.** The dev-only gdp-wired prover is pinned to 0.30.1. Policy proof runs use `{from: 'any'}` and accept only `proven && checked && !assumes`, with counterexample-backed refusals for all 50 broken variants. Generated kernel bodies are unchanged, and default certificates need no environment override. Windows offline continuation tests use a platform-sized cold-start budget.
|
|
82
|
+
|
|
81
83
|
**0.103.1: Pi 1.0 compatibility.** Full-code and Schema enforce loadouts own declarations through native `prepareLoadout`, including built-in codemode, tool search, MCP, late activation, and reload. Captured dispatch and core overrides retain native middleware; capture patches restore on the final shutdown lease without recursive wrapping. Run `bun run test:pi1` for public-contract, compiled SDK, and bundled-CLI regressions. Optional/audit mode retains the host loadout.
|
|
82
84
|
|
|
83
85
|
**0.103.0: daemon primitives.** Headless, restart-safe sessions get small composable building blocks: a [runner contract](docs/agents.md#custom-runners) with hosted runs that persist a locator before start and never relaunch (`pi-fabric/runners`); durable [decisions](docs/decisions.md) with escalation chains, headless approvals, and routed child dialogs; mesh timers, scoped external grants, and the `pi-fabric` CLI; [saved programs](docs/programs.md) with host-invoked runs; host-issued principal and scope (`pi-fabric/scope`) that children only narrow; write confinement, context-inheriting spawn, and worktree results; provider participants, a foreground-tool policy, compaction pressure and carry-forward focus, [thinking control](docs/thinking.md), heartbeat liveness across PID namespaces, and incarnation-fenced control commands. New behavior is opt-in or additive. A configured `agents.runner` id that no extension registers is kept and warned about once per session, without falling back to `pi`.
|
package/dist/agents.js
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import {
|
|
2
2
|
AGENTS_ACTION_DESCRIPTORS,
|
|
3
3
|
normalizeAgentRunRequest
|
|
4
|
-
} from "./chunks/chunk-
|
|
4
|
+
} from "./chunks/chunk-SMN3KEIT.js";
|
|
5
5
|
import {
|
|
6
6
|
AgentAdmission,
|
|
7
7
|
assertAgentTask,
|
|
@@ -14,7 +14,7 @@ import {
|
|
|
14
14
|
import {
|
|
15
15
|
validateAgentResult
|
|
16
16
|
} from "./chunks/chunk-GJVKEHDL.js";
|
|
17
|
-
import "./chunks/chunk-
|
|
17
|
+
import "./chunks/chunk-MK4TBJ6O.js";
|
|
18
18
|
import "./chunks/chunk-IIPKG52D.js";
|
|
19
19
|
import "./chunks/chunk-ZLNJDTCN.js";
|
|
20
20
|
import "./chunks/chunk-V73NIH6B.js";
|
|
@@ -22,7 +22,7 @@ import {
|
|
|
22
22
|
actionArgNormalizer
|
|
23
23
|
} from "./chunks/chunk-NQOEHX62.js";
|
|
24
24
|
import "./chunks/chunk-6QVQXGMR.js";
|
|
25
|
-
import "./chunks/chunk-
|
|
25
|
+
import "./chunks/chunk-SCOJ4BWV.js";
|
|
26
26
|
|
|
27
27
|
// src/agents/service-schema.ts
|
|
28
28
|
import { Value } from "typebox/value";
|
|
@@ -5,7 +5,7 @@ import {
|
|
|
5
5
|
import {
|
|
6
6
|
checkObserve,
|
|
7
7
|
jevObserveSchema
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-4Y2LMAF2.js";
|
|
9
9
|
import {
|
|
10
10
|
JevBilledError,
|
|
11
11
|
checkSchema,
|
|
@@ -15,7 +15,7 @@ import {
|
|
|
15
15
|
} from "./chunk-FSYAGCGA.js";
|
|
16
16
|
import {
|
|
17
17
|
validationMessage
|
|
18
|
-
} from "./chunk-
|
|
18
|
+
} from "./chunk-RXFUXMXS.js";
|
|
19
19
|
import {
|
|
20
20
|
runAbortable
|
|
21
21
|
} from "./chunk-7TB7NXSL.js";
|
|
@@ -23,7 +23,7 @@ import {
|
|
|
23
23
|
ApprovalController,
|
|
24
24
|
FabricAutoApprovalClassifier,
|
|
25
25
|
FabricSessionApprovals
|
|
26
|
-
} from "./chunk-
|
|
26
|
+
} from "./chunk-IWK5QA3D.js";
|
|
27
27
|
import {
|
|
28
28
|
DECISION_APIS,
|
|
29
29
|
DECISION_MAX_BYTES
|
|
@@ -854,4 +854,4 @@ export {
|
|
|
854
854
|
JEV_ACTION_DESCRIPTORS,
|
|
855
855
|
JevProvider
|
|
856
856
|
};
|
|
857
|
-
//# sourceMappingURL=chunk-
|
|
857
|
+
//# sourceMappingURL=chunk-2N2NS4ZR.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
readSessionHeader
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-CQD5W3DV.js";
|
|
4
4
|
|
|
5
5
|
// src/memory/discovery.ts
|
|
6
6
|
import fs from "node:fs";
|
|
@@ -109,4 +109,4 @@ export {
|
|
|
109
109
|
resolveSessionTarget,
|
|
110
110
|
resolveScope
|
|
111
111
|
};
|
|
112
|
-
//# sourceMappingURL=chunk-
|
|
112
|
+
//# sourceMappingURL=chunk-3KRAD6BR.js.map
|
|
@@ -2,10 +2,10 @@ import {
|
|
|
2
2
|
MEMORY_SOURCE_INTERFACE_VERSION,
|
|
3
3
|
createMemorySourceRegistry,
|
|
4
4
|
defineMemorySource
|
|
5
|
-
} from "./chunk-
|
|
5
|
+
} from "./chunk-RDGAQ5VZ.js";
|
|
6
6
|
import {
|
|
7
7
|
readSessionHeader
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-CQD5W3DV.js";
|
|
9
9
|
|
|
10
10
|
// src/memory/fs-source.ts
|
|
11
11
|
import crypto from "node:crypto";
|
|
@@ -159,4 +159,4 @@ export {
|
|
|
159
159
|
createFileSystemMemorySource,
|
|
160
160
|
createConfiguredMemorySourceRegistry
|
|
161
161
|
};
|
|
162
|
-
//# sourceMappingURL=chunk-
|
|
162
|
+
//# sourceMappingURL=chunk-3NU3Z43H.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
isNormalFormWitness
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-DXVMGTC7.js";
|
|
4
4
|
|
|
5
5
|
// src/audit/trace-schema.ts
|
|
6
6
|
var FABRIC_EXECUTION_TRACE_KIND = "pi-fabric.execution";
|
|
@@ -81,4 +81,4 @@ export {
|
|
|
81
81
|
isFabricExecutionTraceV1,
|
|
82
82
|
readFabricExecutionTraceV1
|
|
83
83
|
};
|
|
84
|
-
//# sourceMappingURL=chunk-
|
|
84
|
+
//# sourceMappingURL=chunk-4QTGATQD.js.map
|
|
@@ -6,7 +6,7 @@ import {
|
|
|
6
6
|
} from "./chunk-FSYAGCGA.js";
|
|
7
7
|
import {
|
|
8
8
|
validationMessage
|
|
9
|
-
} from "./chunk-
|
|
9
|
+
} from "./chunk-RXFUXMXS.js";
|
|
10
10
|
|
|
11
11
|
// src/jev/observation.ts
|
|
12
12
|
import { randomUUID } from "node:crypto";
|
|
@@ -283,4 +283,4 @@ export {
|
|
|
283
283
|
JevObservationHost,
|
|
284
284
|
JevSubscription
|
|
285
285
|
};
|
|
286
|
-
//# sourceMappingURL=chunk-
|
|
286
|
+
//# sourceMappingURL=chunk-4Y2LMAF2.js.map
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../src/mesh/store.ts", "../../src/verified/generated/storage.js", "../../src/verified/storage.ts"],
|
|
4
|
-
"sourcesContent": ["import { randomUUID } from \"node:crypto\";\nimport fs from \"node:fs\";\nimport path from \"node:path\";\nimport {\n writeFileAtomic,\n encodeOwnerIdentityLine,\n lockOwnerLiveness,\n lockOwnerProvablyDead,\n reapLockByRenameClaim,\n SHORT_LOCK_MAX_HOLD_MS,\n} from \"../core/atomic-write.js\";\nimport { readJsonlPage } from \"../log-tail.js\";\nimport { captureStoragePut, captureStorageDelete, storageRevision } from \"../verified/storage.js\";\nimport type { FabricMessageSender } from \"../protocol.js\";\nimport { processSender } from \"../scope.js\";\n\nexport interface MeshIdentity {\n id: string;\n name: string;\n kind: \"main\" | \"actor\" | \"agent\";\n sessionId?: string;\n}\n\nexport interface MeshEvent {\n id: string;\n sequence: number;\n topic: string;\n kind: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n createdAt: number;\n /** Set on events appended through a scoped external grant (`pi-fabric mesh post`). */\n origin?: \"external\";\n untrusted?: true;\n grantId?: string;\n /** Set on events released from a pending schedule; the event id is the schedule id. */\n scheduled?: { dueAt: number; key?: string };\n /** Host-stamped authority of the publishing process; absent from older builds and grant posts. */\n sender?: FabricMessageSender;\n}\n\n/** Host-internal append request used inside {@link MeshStore.transact}. */\nexport interface MeshAppendInput {\n id?: string;\n topic: string;\n kind?: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n origin?: \"external\";\n untrusted?: true;\n grantId?: string;\n scheduled?: { dueAt: number; key?: string };\n sender?: FabricMessageSender;\n /** A tighter per-event byte ceiling than the store's own. */\n maxEventBytes?: number;\n}\n\n/** A pending scheduled event; released into its topic log once due. */\nexport interface MeshSchedule {\n id: string;\n key?: string;\n topic: string;\n kind: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n dueAt: number;\n createdAt: number;\n /** Stamped when scheduled; carried onto the released event. */\n sender?: FabricMessageSender;\n}\n\ninterface MeshScheduleFile {\n format: 1;\n schedules: MeshSchedule[];\n}\n\nexport interface MeshTailResult {\n events: MeshEvent[];\n nextOffset: number;\n}\n\nexport interface MeshStateEntry {\n key: string;\n value: unknown;\n version: number;\n updatedAt: number;\n updatedBy: MeshIdentity;\n}\n\ninterface MeshStateFile {\n format: 1 | 2;\n revisionFormat?: 2;\n entries: Record<string, MeshStateEntry>;\n versions?: Record<string, number>;\n tombstoneOrder?: string[];\n /** Persisted allocation clock; never evicted with per-key tombstones. */\n highWater?: number;\n}\n\nexport interface MeshStoreOptions {\n maxEventLogBytes?: number;\n retainedEventLogBytes?: number;\n maxStateBytes?: number;\n maxStateTombstones?: number;\n lockTimeoutMs?: number;\n staleLockMs?: number;\n}\n\nconst TOPIC_PATTERN = /^[a-zA-Z0-9][a-zA-Z0-9._:/-]{0,127}$/;\nconst KEY_PATTERN = /^[a-zA-Z0-9][a-zA-Z0-9._:/-]{0,255}$/;\n\nexport const validateMeshTopic = (topic: string): void => {\n if (!TOPIC_PATTERN.test(topic)) throw new Error(`Invalid Fabric mesh topic: ${topic}`);\n};\nconst LOCK_TIMEOUT_MS = 10_000;\nconst STALE_LOCK_MS = 30_000;\nconst DEFAULT_MAX_EVENT_LOG_BYTES = 64 * 1024 * 1024;\nconst DEFAULT_RETAINED_EVENT_LOG_BYTES = 16 * 1024 * 1024;\nconst DEFAULT_MAX_STATE_BYTES = 32 * 1024 * 1024;\nconst DEFAULT_MAX_STATE_TOMBSTONES = 10_000;\nconst EVENT_READ_PAGE_BYTES = 4 * 1024 * 1024;\nconst EVENT_READ_CHUNK_BYTES = 64 * 1024;\nconst CURSOR_OFFSET_BASE = 2 ** 32;\nexport const MESH_MAX_PENDING_SCHEDULES = 1_000;\nexport const MESH_MAX_SCHEDULE_AHEAD_MS = 366 * 24 * 60 * 60 * 1_000;\nconst MAX_SCHEDULE_FILE_BYTES = 16 * 1024 * 1024;\nconst SCHEDULE_KEY_PATTERN = /^[a-zA-Z0-9][a-zA-Z0-9._:/-]{0,127}$/;\n\nconst delay = (milliseconds: number): Promise<void> =>\n new Promise((resolve) => setTimeout(resolve, milliseconds));\n\nconst errorCode = (error: unknown): string | undefined =>\n error instanceof Error && \"code\" in error && typeof error.code === \"string\"\n ? error.code\n : undefined;\n\nconst processAlive = (pid: number): boolean => {\n if (!Number.isSafeInteger(pid) || pid <= 0) return false;\n try {\n process.kill(pid, 0);\n return true;\n } catch {\n return false;\n }\n};\n\nconst jsonClone = <T>(value: T): T => {\n const serialized = JSON.stringify(value);\n if (serialized === undefined) throw new Error(\"Mesh values must be JSON-serializable\");\n return JSON.parse(serialized) as T;\n};\n\nconst isMeshStateFile = (value: unknown): value is MeshStateFile => {\n if (\n typeof value !== \"object\" ||\n value === null ||\n Array.isArray(value) ||\n ![1, 2].includes((value as { format?: unknown }).format as number)\n ) {\n return false;\n }\n const entries = (value as { entries?: unknown }).entries;\n return typeof entries === \"object\" && entries !== null && !Array.isArray(entries);\n};\n\nconst recoverConcatenatedState = (serialized: string): MeshStateFile | undefined => {\n const snapshots: MeshStateFile[] = [];\n let documents = 0;\n let start = -1;\n let depth = 0;\n let inString = false;\n let escaped = false;\n\n for (let index = 0; index < serialized.length; index += 1) {\n const character = serialized[index]!;\n if (start < 0) {\n if (/\\s/.test(character)) continue;\n if (character !== \"{\") return undefined;\n start = index;\n depth = 1;\n continue;\n }\n if (inString) {\n if (escaped) escaped = false;\n else if (character === \"\\\\\") escaped = true;\n else if (character === '\"') inString = false;\n continue;\n }\n if (character === '\"') inString = true;\n else if (character === \"{\") depth += 1;\n else if (character === \"}\") {\n depth -= 1;\n if (depth !== 0) continue;\n try {\n const parsed: unknown = JSON.parse(serialized.slice(start, index + 1));\n documents += 1;\n if (isMeshStateFile(parsed)) snapshots.push(parsed);\n } catch {\n return undefined;\n }\n start = -1;\n }\n }\n\n return start < 0 && documents > 1 ? snapshots.at(-1) : undefined;\n};\n\nconst compareSchedules = (left: MeshSchedule, right: MeshSchedule): number =>\n left.dueAt - right.dueAt || left.createdAt - right.createdAt || left.id.localeCompare(right.id);\n\nconst isMeshSchedule = (value: unknown): value is MeshSchedule => {\n if (typeof value !== \"object\" || value === null || Array.isArray(value)) return false;\n const entry = value as Partial<MeshSchedule>;\n return typeof entry.id === \"string\" && typeof entry.topic === \"string\" &&\n typeof entry.kind === \"string\" && typeof entry.from === \"object\" && entry.from !== null &&\n Number.isSafeInteger(entry.dueAt) && Number.isSafeInteger(entry.createdAt) &&\n (entry.key === undefined || typeof entry.key === \"string\");\n};\n\nconst emptyState = (): MeshStateFile => ({ format: 1, revisionFormat: 2, entries: {}, highWater: 0 });\n\nconst readState = (filePath: string, maxBytes: number, recoverDamage = true): MeshStateFile => {\n let serialized: string;\n try {\n const stat = fs.statSync(filePath);\n if (stat.size > maxBytes) throw new Error(`state exceeds ${maxBytes} bytes`);\n if (stat.size === 0 && recoverDamage) return emptyState();\n serialized = fs.readFileSync(filePath, \"utf8\");\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return emptyState();\n const message = error instanceof Error ? error.message : String(error);\n throw new Error(`Failed to read Fabric mesh state: ${message}`);\n }\n if (!serialized.trim() && recoverDamage) return emptyState();\n try {\n const parsed: unknown = JSON.parse(serialized);\n if (isMeshStateFile(parsed)) return parsed;\n throw new Error(\"invalid state format\");\n } catch (error) {\n // Failed parsing must not silently erase the allocation clock. Read-only\n // startup can tolerate damage, but mutations require a repaired snapshot.\n const recovered = recoverConcatenatedState(serialized);\n if (recovered) return recovered;\n if (!recoverDamage) throw new Error(\"Failed to read Fabric mesh state: invalid state format\");\n // Preserve the original bytes at this path as a barrier to clock reset.\n return emptyState();\n }\n};\n\nconst atomicWrite = (filePath: string, value: unknown, maxBytes = Number.POSITIVE_INFINITY): void => {\n const serialized = JSON.stringify(value, null, 2);\n if (Buffer.byteLength(serialized, \"utf8\") > maxBytes) {\n throw new Error(`Fabric mesh state exceeds ${maxBytes} bytes`);\n }\n writeFileAtomic(filePath, serialized);\n};\n\n// Host invariant for the proved reducer: the persisted clock covers every\n// issued token. Legacy files can seed only from retained entries/tombstones;\n// tokens already evicted before this migration cannot be reconstructed.\nconst stateSlot = (state: MeshStateFile, key: string): {\n present: boolean; version: number; highWater: number;\n} => {\n if (state.versions !== undefined &&\n (typeof state.versions !== \"object\" || state.versions === null || Array.isArray(state.versions))) {\n throw new Error(\"Invalid Fabric mesh revision table\");\n }\n let retainedMaximum = 0;\n for (const revision of Object.values(state.versions ?? {})) {\n retainedMaximum = Math.max(retainedMaximum, storageRevision(revision));\n }\n for (const [entryKey, entry] of Object.entries(state.entries)) {\n if (typeof entry !== \"object\" || entry === null || entry.key !== entryKey) {\n throw new Error(\"Invalid Fabric mesh state entry\");\n }\n const version = storageRevision(entry.version);\n const retained = state.versions !== undefined && Object.hasOwn(state.versions, entryKey)\n ? state.versions[entryKey] : undefined;\n if (version === 0 || (retained !== undefined && retained !== version)) {\n throw new Error(\"Inconsistent Fabric mesh revision\");\n }\n retainedMaximum = Math.max(retainedMaximum, version);\n }\n // New snapshots require their clock: losing it must not look like legacy\n // migration and silently reissue revisions from an evicted history.\n if (Object.hasOwn(state, \"revisionFormat\") && state.revisionFormat !== 2) {\n throw new Error(\"Unsupported Fabric mesh revision protocol\");\n }\n if ((state.format === 2 || state.revisionFormat === 2) && !Object.hasOwn(state, \"highWater\")) {\n throw new Error(\"Missing Fabric mesh high-water revision\");\n }\n const highWater = Object.hasOwn(state, \"highWater\")\n ? storageRevision(state.highWater) : retainedMaximum;\n if (highWater < retainedMaximum) throw new Error(\"Inconsistent Fabric mesh high-water revision\");\n const present = Object.hasOwn(state.entries, key);\n const version = present ? state.entries[key]!.version\n : state.versions !== undefined && Object.hasOwn(state.versions, key) ? state.versions[key]! : 0;\n return { present, version, highWater };\n};\n\nconst compactStateTombstones = (state: MeshStateFile, maxTombstones: number): void => {\n state.versions ??= {};\n const orderedKeys: string[] = [];\n const seen = new Set<string>();\n for (const key of state.tombstoneOrder ?? []) {\n if (Object.hasOwn(state.entries, key) || !Object.hasOwn(state.versions, key) || seen.has(key)) continue;\n seen.add(key);\n orderedKeys.push(key);\n }\n for (const key of Object.keys(state.versions)) {\n if (Object.hasOwn(state.entries, key) || seen.has(key)) continue;\n seen.add(key);\n orderedKeys.push(key);\n }\n const retainedKeys = orderedKeys.slice(-maxTombstones);\n const retained = new Set(retainedKeys);\n for (const key of Object.keys(state.versions)) {\n if (!Object.hasOwn(state.entries, key) && !retained.has(key)) delete state.versions[key];\n }\n state.tombstoneOrder = retainedKeys;\n};\n\nexport class MeshStore {\n readonly #eventsPath: string;\n readonly #statePath: string;\n readonly #counterPath: string;\n readonly #generationPath: string;\n readonly #lockPath: string;\n readonly #maxEventLogBytes: number;\n readonly #retainedEventLogBytes: number;\n readonly #maxStateBytes: number;\n readonly #maxStateTombstones: number;\n readonly #lockTimeoutMs: number;\n readonly #staleLockMs: number;\n #stateCache:\n | { device: number; inode: number; size: number; modifiedAt: number; state: MeshStateFile }\n | undefined;\n readonly #schedulesPath: string;\n #scheduleCache:\n | { inode: number; size: number; modifiedAt: number; file: MeshScheduleFile; error?: string }\n | undefined;\n\n constructor(\n readonly root: string,\n readonly maxEventBytes: number,\n readonly maxReadEvents: number,\n options: MeshStoreOptions = {},\n ) {\n this.#eventsPath = path.join(root, \"events.jsonl\");\n this.#statePath = path.join(root, \"state.json\");\n this.#counterPath = path.join(root, \"sequence\");\n this.#generationPath = path.join(root, \"generation\");\n this.#lockPath = path.join(root, \".lock\");\n // Pending schedules live beside state.json, outside the verified storage\n // revision table: they are serialized by this lock, not by key CAS.\n this.#schedulesPath = path.join(root, \"schedules.json\");\n this.#maxEventLogBytes = Math.min(\n CURSOR_OFFSET_BASE - 1,\n Math.max(maxEventBytes + 2, Math.floor(options.maxEventLogBytes ?? DEFAULT_MAX_EVENT_LOG_BYTES)),\n );\n this.#retainedEventLogBytes = Math.min(\n this.#maxEventLogBytes - 1,\n Math.max(\n maxEventBytes + 1,\n Math.floor(options.retainedEventLogBytes ?? DEFAULT_RETAINED_EVENT_LOG_BYTES),\n ),\n );\n this.#maxStateBytes = Math.max(\n maxEventBytes * 2,\n Math.floor(options.maxStateBytes ?? DEFAULT_MAX_STATE_BYTES),\n );\n this.#maxStateTombstones = Math.max(\n 1,\n Math.floor(options.maxStateTombstones ?? DEFAULT_MAX_STATE_TOMBSTONES),\n );\n this.#lockTimeoutMs = Math.max(100, Math.floor(options.lockTimeoutMs ?? LOCK_TIMEOUT_MS));\n this.#staleLockMs = Math.max(100, Math.floor(options.staleLockMs ?? STALE_LOCK_MS));\n fs.mkdirSync(root, { recursive: true, mode: 0o700 });\n }\n\n async publish(input: {\n topic: string;\n kind?: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n /** Host-only: publish on behalf of another authority (an actor's scope). */\n sender?: FabricMessageSender;\n }): Promise<MeshEvent> {\n this.#validateTopic(input.topic);\n if (input.to !== undefined && !input.to.trim()) throw new Error(\"Mesh recipient is empty\");\n const eventData = input.data === undefined ? undefined : jsonClone(input.data);\n const sender = input.sender ?? processSender();\n return this.#withLock(() => {\n // Any write that already holds the lock also releases due schedules first,\n // so the log keeps due-time order relative to this event. Damaged\n // schedule state must not block ordinary publishing.\n try { this.#releaseDueLocked(Date.now()); } catch { /* schedule mutations report it */ }\n return this.#appendLocked({ ...input, ...(eventData !== undefined ? { data: eventData } : {}), sender });\n });\n }\n\n /**\n * Host-internal: runs `operation` under the mesh lock with an append\n * capability, for side stores (grants) that must commit with an event.\n */\n async transact<T>(operation: (append: (input: MeshAppendInput) => MeshEvent) => T): Promise<T> {\n return this.#withLock(() => {\n try { this.#releaseDueLocked(Date.now()); } catch { /* schedule mutations report it */ }\n return operation((input) => {\n this.#validateTopic(input.topic);\n return this.#appendLocked(input);\n });\n });\n }\n\n #appendLocked(input: MeshAppendInput): MeshEvent {\n this.#repairEventLog();\n const sequence = Math.max(this.#readSequence(), this.#readLastEventSequence()) + 1;\n const event: MeshEvent = {\n id: input.id ?? randomUUID(),\n sequence,\n topic: input.topic,\n kind: input.kind?.trim() || \"message\",\n from: jsonClone(input.from),\n ...(input.to ? { to: input.to } : {}),\n ...(input.text !== undefined ? { text: input.text } : {}),\n ...(input.data !== undefined ? { data: jsonClone(input.data) } : {}),\n createdAt: Date.now(),\n ...(input.origin ? { origin: input.origin } : {}),\n ...(input.untrusted ? { untrusted: true as const } : {}),\n ...(input.grantId ? { grantId: input.grantId } : {}),\n ...(input.scheduled ? { scheduled: { ...input.scheduled } } : {}),\n ...(input.sender ? { sender: jsonClone(input.sender) } : {}),\n };\n const line = JSON.stringify(event);\n const limit = Math.min(this.maxEventBytes, input.maxEventBytes ?? this.maxEventBytes);\n if (Buffer.byteLength(line, \"utf8\") > limit) {\n throw new Error(`Mesh event exceeds ${limit} bytes`);\n }\n fs.appendFileSync(this.#eventsPath, `${line}\\n`, { encoding: \"utf8\", mode: 0o600 });\n atomicWrite(this.#counterPath, sequence);\n this.#compactEventLog();\n return event;\n }\n\n /**\n * Stores a pending event released into `topic` once `dueAt` passes. A `key`\n * replaces any pending schedule with that key in the same locked write, so\n * concurrent publishers never leave two schedules for one key.\n */\n async schedule(input: {\n topic: string;\n kind?: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n dueAt: number;\n key?: string;\n }, now = Date.now()): Promise<MeshSchedule> {\n this.#validateTopic(input.topic);\n if (input.to !== undefined && !input.to.trim()) throw new Error(\"Mesh recipient is empty\");\n if (input.key !== undefined && !SCHEDULE_KEY_PATTERN.test(input.key)) {\n throw new Error(`Invalid Fabric mesh schedule key: ${input.key}`);\n }\n if (!Number.isSafeInteger(input.dueAt) || input.dueAt < 0) {\n throw new Error(\"Mesh schedule due time must be a nonnegative epoch millisecond integer\");\n }\n if (input.dueAt > now + MESH_MAX_SCHEDULE_AHEAD_MS) {\n throw new Error(\"Mesh schedules may be at most 366 days ahead\");\n }\n const schedule: MeshSchedule = {\n id: randomUUID(),\n ...(input.key !== undefined ? { key: input.key } : {}),\n topic: input.topic,\n kind: input.kind?.trim() || \"message\",\n from: jsonClone(input.from),\n ...(input.to ? { to: input.to } : {}),\n ...(input.text !== undefined ? { text: input.text } : {}),\n ...(input.data !== undefined ? { data: jsonClone(input.data) } : {}),\n dueAt: input.dueAt,\n createdAt: now,\n sender: processSender(),\n };\n // Reject at schedule time what release could never append.\n const released: MeshEvent = {\n id: schedule.id, sequence: Number.MAX_SAFE_INTEGER, topic: schedule.topic, kind: schedule.kind,\n from: schedule.from, ...(schedule.to ? { to: schedule.to } : {}),\n ...(schedule.text !== undefined ? { text: schedule.text } : {}),\n ...(schedule.data !== undefined ? { data: schedule.data } : {}),\n createdAt: Number.MAX_SAFE_INTEGER,\n scheduled: { dueAt: schedule.dueAt, ...(schedule.key !== undefined ? { key: schedule.key } : {}) },\n ...(schedule.sender ? { sender: schedule.sender } : {}),\n };\n if (Buffer.byteLength(JSON.stringify(released), \"utf8\") > this.maxEventBytes) {\n throw new Error(`Mesh event exceeds ${this.maxEventBytes} bytes`);\n }\n return this.#withLock(() => {\n const file = this.#readSchedules(false);\n const pending = file.schedules.filter((entry) => input.key === undefined || entry.key !== input.key);\n if (pending.length >= MESH_MAX_PENDING_SCHEDULES) {\n throw new Error(`At most ${MESH_MAX_PENDING_SCHEDULES} mesh schedules may be pending`);\n }\n pending.push(schedule);\n this.#writeSchedules(pending);\n this.#releaseDueLocked(now);\n return jsonClone(schedule);\n });\n }\n\n /** Removes the pending schedule with `key`, if any. */\n async unschedule(key: string): Promise<{ removed: boolean }> {\n if (!SCHEDULE_KEY_PATTERN.test(key)) throw new Error(`Invalid Fabric mesh schedule key: ${key}`);\n return this.#withLock(() => {\n const file = this.#readSchedules(false);\n const pending = file.schedules.filter((entry) => entry.key !== key);\n if (pending.length === file.schedules.length) return { removed: false };\n this.#writeSchedules(pending);\n return { removed: true };\n });\n }\n\n /** Pending schedules by due time; a due one stays listed until a releaser appends it. */\n scheduled(input: { topic?: string; limit?: number } = {}): MeshSchedule[] {\n if (input.topic !== undefined) this.#validateTopic(input.topic);\n const limit = Math.max(1, Math.min(Math.floor(input.limit ?? 100), MESH_MAX_PENDING_SCHEDULES));\n return this.#readSchedules(true).schedules\n .filter((entry) => input.topic === undefined || entry.topic === input.topic)\n .sort(compareSchedules)\n .slice(0, limit)\n .map((entry) => jsonClone(entry));\n }\n\n /** Earliest pending due time, read without the lock (one stat when unchanged). */\n nextScheduleDueAt(): number | undefined {\n let next: number | undefined;\n for (const entry of this.#readSchedules(true).schedules) {\n if (next === undefined || entry.dueAt < next) next = entry.dueAt;\n }\n return next;\n }\n\n /**\n * Appends every due schedule to its topic and removes it, under the mesh\n * lock, so concurrent releasers (monitors, resident hosts, CLI posts) append\n * each schedule once. The lock is taken only when something is due.\n */\n async releaseDueSchedules(now = Date.now()): Promise<MeshEvent[]> {\n const next = this.nextScheduleDueAt();\n if (next === undefined || next > now) return [];\n return this.#withLock(() => this.#releaseDueLocked(now));\n }\n\n #releaseDueLocked(now: number): MeshEvent[] {\n if (!fs.existsSync(this.#schedulesPath)) return [];\n const file = this.#readSchedules(false);\n const due = file.schedules.filter((entry) => entry.dueAt <= now).sort(compareSchedules);\n if (due.length === 0) return [];\n const released: MeshEvent[] = [];\n const releasedIds = new Set<string>();\n try {\n // Events first, then the shrunken schedule file: a crash in between\n // re-releases with the same event id (at-least-once, dedupe by id).\n for (const entry of due) {\n released.push(this.#appendLocked({\n id: entry.id,\n topic: entry.topic,\n kind: entry.kind,\n from: entry.from,\n ...(entry.to ? { to: entry.to } : {}),\n ...(entry.text !== undefined ? { text: entry.text } : {}),\n ...(entry.data !== undefined ? { data: entry.data } : {}),\n scheduled: { dueAt: entry.dueAt, ...(entry.key !== undefined ? { key: entry.key } : {}) },\n // Older schedules stay unstamped: the releasing host never lends its own authority.\n ...(entry.sender ? { sender: entry.sender } : {}),\n }));\n releasedIds.add(entry.id);\n }\n } finally {\n if (releasedIds.size > 0) {\n this.#writeSchedules(file.schedules.filter((entry) => !releasedIds.has(entry.id)));\n }\n }\n return released;\n }\n\n #readSchedules(lenient: boolean): MeshScheduleFile {\n let stat: fs.Stats;\n try {\n stat = fs.statSync(this.#schedulesPath);\n } catch (error) {\n this.#scheduleCache = undefined;\n if (errorCode(error) === \"ENOENT\") return { format: 1, schedules: [] };\n throw error;\n }\n // Locked mutations always re-read; the stat-keyed cache serves only lockless reads.\n const cached = lenient ? this.#scheduleCache : undefined;\n if (cached && cached.inode === stat.ino && cached.size === stat.size && cached.modifiedAt === stat.mtimeMs) {\n return cached.error === undefined ? cached.file : { format: 1, schedules: [] };\n }\n let file: MeshScheduleFile = { format: 1, schedules: [] };\n let damage: string | undefined;\n try {\n if (stat.size > MAX_SCHEDULE_FILE_BYTES) throw new Error(`exceeds ${MAX_SCHEDULE_FILE_BYTES} bytes`);\n const parsed = JSON.parse(fs.readFileSync(this.#schedulesPath, \"utf8\")) as Partial<MeshScheduleFile>;\n if (parsed?.format !== 1 || !Array.isArray(parsed.schedules) || !parsed.schedules.every(isMeshSchedule)) {\n throw new Error(\"invalid format\");\n }\n file = { format: 1, schedules: parsed.schedules };\n } catch (error) {\n damage = error instanceof Error ? error.message : String(error);\n }\n this.#scheduleCache = {\n inode: stat.ino, size: stat.size, modifiedAt: stat.mtimeMs, file, ...(damage !== undefined ? { error: damage } : {}),\n };\n if (damage === undefined) return file;\n // Reads tolerate damage; mutations refuse to overwrite it silently.\n if (lenient) return { format: 1, schedules: [] };\n throw new Error(`Failed to read Fabric mesh schedules: ${damage}`);\n }\n\n #writeSchedules(schedules: MeshSchedule[]): void {\n if (schedules.length === 0) {\n fs.rmSync(this.#schedulesPath, { force: true });\n this.#scheduleCache = undefined;\n return;\n }\n atomicWrite(this.#schedulesPath, { format: 1, schedules }, MAX_SCHEDULE_FILE_BYTES);\n this.#scheduleCache = undefined;\n }\n\n read(\n input: {\n after?: number;\n topic?: string;\n to?: string;\n limit?: number;\n } = {},\n ): MeshEvent[] {\n if (input.topic !== undefined) this.#validateTopic(input.topic);\n const limit = Math.max(1, Math.min(Math.floor(input.limit ?? 100), this.maxReadEvents));\n const events =\n input.after === undefined\n ? this.#readRecentEvents(input, limit)\n : this.#readEventsAfter(Math.max(0, Math.floor(input.after)), input, limit);\n return events.map((event) => jsonClone(event));\n }\n\n latestSequence(): number {\n return Math.max(this.#readSequence(), this.#readLastEventSequence());\n }\n\n latestOffset(): number {\n const generation = this.#readGeneration();\n let descriptor: number | undefined;\n let completeOffset = 0;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n if (size > 0) {\n const lastByte = Buffer.allocUnsafe(1);\n fs.readSync(descriptor, lastByte, 0, 1, size - 1);\n if (lastByte[0] === 0x0a) {\n completeOffset = size;\n } else {\n const readBytes = Math.min(size, this.maxEventBytes + 1);\n const tail = Buffer.allocUnsafe(readBytes);\n fs.readSync(descriptor, tail, 0, readBytes, size - readBytes);\n const newline = tail.lastIndexOf(0x0a);\n completeOffset = newline >= 0 ? size - readBytes + newline + 1 : 0;\n }\n }\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n return this.#encodeCursor(generation, completeOffset);\n }\n\n tail(cursor: number, limit = 100): MeshTailResult {\n const boundedLimit = Math.max(1, Math.min(Math.floor(limit), this.maxReadEvents));\n const generation = this.#readGeneration();\n const decoded = this.#decodeCursor(cursor);\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n let position = decoded.generation === generation ? Math.min(decoded.offset, size) : 0;\n if (position > 0) {\n const previousByte = Buffer.allocUnsafe(1);\n fs.readSync(descriptor, previousByte, 0, 1, position - 1);\n if (previousByte[0] !== 0x0a) position = 0;\n }\n if (position >= size) {\n return { events: [], nextOffset: this.#encodeCursor(generation, position) };\n }\n const chunkBytes = Math.min(\n size - position,\n Math.max(this.maxEventBytes + 1, EVENT_READ_PAGE_BYTES),\n );\n const buffer = Buffer.allocUnsafe(chunkBytes);\n const bytesRead = fs.readSync(descriptor, buffer, 0, chunkBytes, position);\n const events: MeshEvent[] = [];\n let lineStart = 0;\n let consumed = 0;\n for (let index = 0; index < bytesRead; index++) {\n if (buffer[index] !== 0x0a) continue;\n const line = buffer.subarray(lineStart, index).toString(\"utf8\").trim();\n lineStart = index + 1;\n consumed = lineStart;\n if (line) {\n try {\n const event = JSON.parse(line) as MeshEvent;\n if (typeof event.sequence === \"number\") events.push(event);\n } catch { /* skip malformed mesh log line */ }\n }\n if (events.length >= boundedLimit) break;\n }\n return {\n events: events.map((event) => jsonClone(event)),\n nextOffset: this.#encodeCursor(generation, position + consumed),\n };\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") {\n return { events: [], nextOffset: this.#encodeCursor(generation, 0) };\n }\n throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #readRecentEvents(\n input: { topic?: string; to?: string },\n limit: number,\n ): MeshEvent[] {\n let events: MeshEvent[] = [];\n let before: number | undefined;\n while (events.length < limit) {\n const page = readJsonlPage(\n this.#eventsPath,\n this.maxReadEvents,\n before,\n Math.max(this.maxEventBytes + 1, EVENT_READ_PAGE_BYTES),\n );\n const pageEvents: MeshEvent[] = [];\n for (const line of page.lines) {\n const parsed = line.parsed;\n if (typeof parsed !== \"object\" || parsed === null || Array.isArray(parsed)) continue;\n const event = parsed as MeshEvent;\n if (typeof event.sequence !== \"number\" || !this.#eventMatches(event, input)) continue;\n pageEvents.push(event);\n }\n events = [...pageEvents, ...events].slice(-limit);\n if (!page.hasMore || page.before === undefined || page.before === before) break;\n before = page.before;\n }\n return events;\n }\n\n #readEventsAfter(\n after: number,\n input: { topic?: string; to?: string },\n limit: number,\n ): MeshEvent[] {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n const events: MeshEvent[] = [];\n let position = 0;\n let lineChunks: Buffer[] = [];\n let lineBytes = 0;\n let skippingOversizedLine = false;\n let reachedLimit = false;\n\n const emitLine = (): void => {\n if (!skippingOversizedLine && lineBytes > 0) {\n const decoded = Buffer.concat(lineChunks, lineBytes).toString(\"utf8\");\n const line = decoded.endsWith(String.fromCharCode(13)) ? decoded.slice(0, -1) : decoded;\n try {\n const event = JSON.parse(line) as MeshEvent;\n if (\n typeof event.sequence === \"number\" &&\n event.sequence > after &&\n this.#eventMatches(event, input)\n ) {\n events.push(event);\n reachedLimit = events.length >= limit;\n }\n } catch { /* skip malformed mesh log line */ }\n }\n lineChunks = [];\n lineBytes = 0;\n skippingOversizedLine = false;\n };\n\n while (position < size && !reachedLimit) {\n const readLength = Math.min(EVENT_READ_CHUNK_BYTES, size - position);\n const chunk = Buffer.allocUnsafe(readLength);\n const bytesRead = fs.readSync(descriptor, chunk, 0, readLength, position);\n if (bytesRead <= 0) break;\n position += bytesRead;\n const captured = chunk.subarray(0, bytesRead);\n let segmentStart = 0;\n while (segmentStart < captured.length && !reachedLimit) {\n const newline = captured.indexOf(0x0a, segmentStart);\n const segmentEnd = newline < 0 ? captured.length : newline;\n const segment = captured.subarray(segmentStart, segmentEnd);\n if (!skippingOversizedLine) {\n if (lineBytes + segment.length <= this.maxEventBytes) {\n if (segment.length > 0) lineChunks.push(segment);\n lineBytes += segment.length;\n } else {\n lineChunks = [];\n lineBytes = 0;\n skippingOversizedLine = true;\n }\n }\n if (newline < 0) break;\n emitLine();\n segmentStart = newline + 1;\n }\n }\n if (!reachedLimit && (lineBytes > 0 || skippingOversizedLine)) emitLine();\n return events;\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return [];\n throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #eventMatches(event: MeshEvent, input: { topic?: string; to?: string }): boolean {\n if (input.topic !== undefined && event.topic !== input.topic) return false;\n if (input.to !== undefined && event.to !== input.to) return false;\n return true;\n }\n\n get(key: string): MeshStateEntry | undefined {\n this.#validateKey(key);\n const entries = this.#readCachedState().entries;\n return Object.hasOwn(entries, key) ? jsonClone(entries[key]) : undefined;\n }\n\n list(prefix = \"\", limit = 100): MeshStateEntry[] {\n const boundedLimit = Math.max(1, Math.min(Math.floor(limit), this.maxReadEvents));\n return this.listAll(prefix).slice(0, boundedLimit);\n }\n\n /** Internal project-state scan for host-managed indexes that must reconcile every key. */\n listAll(prefix = \"\"): MeshStateEntry[] {\n if (prefix) this.#validateKey(prefix);\n return Object.values(this.#readCachedState().entries)\n .filter((entry) => !prefix || entry.key.startsWith(prefix))\n .sort((left, right) => left.key.localeCompare(right.key))\n .map((entry) => jsonClone(entry));\n }\n\n async put(input: {\n key: string;\n value: unknown;\n identity: MeshIdentity;\n ifVersion?: number;\n }): Promise<MeshStateEntry> {\n const { key, value, identity, ifVersion } = input;\n this.#validateKey(key);\n const request = captureStoragePut({ key, value, identity, ifVersion }, this.maxEventBytes);\n return this.#withLock(() => {\n const state = readState(this.#statePath, this.#maxStateBytes, false);\n const slot = stateSlot(state, request.key);\n const plan = request.transition(slot.present, slot.version, slot.highWater);\n if (plan.kind !== \"put\") throw new Error(\"Invalid verified storage put plan\");\n const entry: MeshStateEntry = {\n key: plan.key,\n value: plan.value,\n version: plan.version,\n updatedAt: Date.now(),\n updatedBy: plan.identity,\n };\n state.entries[plan.key] = entry;\n state.versions ??= {};\n state.versions[plan.key] = plan.version;\n // Keep the envelope readable by existing hosts; revisionFormat marks the\n // mandatory persistent clock without making old readers quarantine it.\n state.format = 1;\n state.revisionFormat = 2;\n state.highWater = plan.highWater;\n state.tombstoneOrder = (state.tombstoneOrder ?? []).filter((key) => key !== plan.key);\n compactStateTombstones(state, this.#maxStateTombstones);\n atomicWrite(this.#statePath, state, this.#maxStateBytes);\n this.#cacheState(state);\n return jsonClone(entry);\n });\n }\n\n async delete(input: {\n key: string;\n ifVersion?: number;\n }): Promise<{ deleted: boolean; version?: number }> {\n const { key, ifVersion } = input;\n this.#validateKey(key);\n const request = captureStorageDelete({ key, ifVersion });\n return this.#withLock(() => {\n const state = readState(this.#statePath, this.#maxStateBytes, false);\n const slot = stateSlot(state, request.key);\n const plan = request.transition(slot.present, slot.version, slot.highWater);\n if (plan.kind === \"unchanged\") {\n this.#cacheState(state);\n return { deleted: false };\n }\n if (plan.kind !== \"delete\") throw new Error(\"Invalid verified storage delete plan\");\n delete state.entries[plan.key];\n state.versions ??= {};\n // Delete consumes a key successor and advances the persistent clock.\n // Eviction can forget a CAS tombstone, but not allocation history.\n state.versions[plan.key] = plan.version;\n // Keep the envelope readable by existing hosts; revisionFormat marks the\n // mandatory persistent clock without making old readers quarantine it.\n state.format = 1;\n state.revisionFormat = 2;\n state.highWater = plan.highWater;\n state.tombstoneOrder = [\n ...(state.tombstoneOrder ?? []).filter((key) => key !== plan.key),\n plan.key,\n ];\n compactStateTombstones(state, this.#maxStateTombstones);\n atomicWrite(this.#statePath, state, this.#maxStateBytes);\n this.#cacheState(state);\n return { deleted: true, version: plan.version };\n });\n }\n\n #readCachedState(): MeshStateFile {\n try {\n const stat = fs.statSync(this.#statePath);\n const cached = this.#stateCache;\n if (\n cached &&\n cached.device === stat.dev &&\n cached.inode === stat.ino &&\n cached.size === stat.size &&\n cached.modifiedAt === stat.mtimeMs\n ) {\n return cached.state;\n }\n } catch (error) {\n this.#stateCache = undefined;\n if (errorCode(error) === \"ENOENT\") return emptyState();\n throw error;\n }\n const state = readState(this.#statePath, this.#maxStateBytes);\n this.#cacheState(state);\n return state;\n }\n\n #cacheState(state: MeshStateFile): void {\n try {\n const stat = fs.statSync(this.#statePath);\n this.#stateCache = {\n device: stat.dev,\n inode: stat.ino,\n size: stat.size,\n modifiedAt: stat.mtimeMs,\n state,\n };\n } catch {\n this.#stateCache = undefined;\n }\n }\n\n async #withLock<T>(operation: () => T): Promise<T> {\n fs.mkdirSync(this.root, { recursive: true, mode: 0o700 });\n const deadline = Date.now() + this.#lockTimeoutMs;\n const token = randomUUID();\n const ownerPath = path.join(this.#lockPath, \"owner\");\n while (true) {\n try {\n fs.mkdirSync(this.#lockPath, { mode: 0o700 });\n fs.writeFileSync(ownerPath, `${token}\\n${process.pid}\\n${Date.now()}\\n${encodeOwnerIdentityLine()}\\n`, {\n encoding: \"utf8\",\n mode: 0o600,\n });\n break;\n } catch (error) {\n if (errorCode(error) !== \"EEXIST\") throw error;\n if (this.#clearStaleLock(ownerPath)) continue;\n if (Date.now() >= deadline) throw new Error(\"Timed out waiting for the Fabric mesh lock\");\n await delay(10);\n }\n }\n try {\n return operation();\n } finally {\n try {\n const owner = fs.readFileSync(ownerPath, \"utf8\");\n if (owner.startsWith(`${token}\\n`)) {\n fs.rmSync(this.#lockPath, { recursive: true, force: true });\n }\n } catch {\n // Another process already recovered or removed this lock.\n }\n }\n }\n\n // Returns true when a stale lock was removed and acquisition should retry.\n // A lock is stale when it outlived the stale window without a live owner:\n // either the owner file names a dead process, or the owner file is missing\n // or corrupt \u2014 the owner crashed between creating the lock directory and\n // writing the owner file \u2014 and the untouched lock directory itself is\n // stale. A younger lock is also removed when its owner is provably dead:\n // same host, PID namespace and boot, and the pid is gone or reused. Removal\n // re-reads the state it judged stale so a freshly rotated owner is never\n // deleted mid-check, and an owner lock is removed through a rename claim so\n // a lock a new owner took after that re-read survives.\n #clearStaleLock(ownerPath: string): boolean {\n let lockModifiedAt: number | undefined;\n let owner: string | undefined;\n try {\n owner = fs.readFileSync(ownerPath, \"utf8\");\n } catch {\n try {\n lockModifiedAt = fs.statSync(this.#lockPath).mtimeMs;\n } catch {\n return false;\n }\n }\n if (owner !== undefined) {\n const [, pidText, createdText, identityLine] = owner.trim().split(\"\\n\");\n const createdAt = Number(createdText);\n const fresh = Number.isFinite(createdAt) && Date.now() - createdAt <= this.#staleLockMs;\n // A fresh lock is cleared only when its local owner is provably dead.\n // Unknown (another PID namespace within the hold ceiling) is not death.\n const dead = fresh\n ? lockOwnerProvablyDead(Number(pidText), identityLine)\n : lockOwnerLiveness(Number(pidText), createdAt, identityLine, {\n legacyAlive: processAlive,\n maxHoldMs: Math.max(SHORT_LOCK_MAX_HOLD_MS, this.#staleLockMs),\n }) === \"dead\";\n if (!dead) return false;\n try {\n if (fs.readFileSync(ownerPath, \"utf8\") !== owner) return false;\n return reapLockByRenameClaim(this.#lockPath, (claimed) => {\n try {\n return fs.readFileSync(path.join(claimed, \"owner\"), \"utf8\") === owner;\n } catch {\n return false;\n }\n });\n } catch {\n return false;\n }\n }\n if (lockModifiedAt === undefined || Date.now() - lockModifiedAt <= this.#staleLockMs) {\n return false;\n }\n try {\n if (fs.statSync(this.#lockPath).mtimeMs !== lockModifiedAt) return false;\n fs.rmSync(this.#lockPath, { recursive: true, force: true });\n return true;\n } catch {\n return false;\n }\n }\n\n #readGeneration(): number {\n try {\n const parsed: unknown = JSON.parse(fs.readFileSync(this.#generationPath, \"utf8\"));\n return typeof parsed === \"number\" && Number.isSafeInteger(parsed) && parsed >= 0 ? parsed : 0;\n } catch {\n return 0;\n }\n }\n\n #encodeCursor(generation: number, offset: number): number {\n const cursor = generation * CURSOR_OFFSET_BASE + offset;\n if (!Number.isSafeInteger(cursor) || cursor < 0) {\n throw new Error(\"Fabric mesh cursor exhausted its safe integer range\");\n }\n return cursor;\n }\n\n #decodeCursor(cursor: number): { generation: number; offset: number } {\n if (!Number.isSafeInteger(cursor) || cursor < 0) return { generation: -1, offset: 0 };\n return {\n generation: Math.floor(cursor / CURSOR_OFFSET_BASE),\n offset: cursor % CURSOR_OFFSET_BASE,\n };\n }\n\n #compactEventLog(): void {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n if (size <= this.#maxEventLogBytes) return;\n const readBytes = Math.min(\n size,\n this.#retainedEventLogBytes + this.maxEventBytes + 1,\n );\n const buffer = Buffer.allocUnsafe(readBytes);\n const bytesRead = fs.readSync(descriptor, buffer, 0, readBytes, size - readBytes);\n const captured = buffer.subarray(0, bytesRead);\n const retentionBoundary = Math.max(0, captured.length - this.#retainedEventLogBytes);\n const newline = retentionBoundary === 0 ? -1 : captured.indexOf(0x0a, retentionBoundary);\n const retainedStart = retentionBoundary === 0 ? 0 : newline >= 0 ? newline + 1 : captured.length;\n const retained = captured.subarray(retainedStart);\n fs.closeSync(descriptor);\n descriptor = undefined;\n const temporaryPath =\n this.#eventsPath + \".\" + process.pid + \".\" + randomUUID() + \".tmp\";\n try {\n fs.writeFileSync(temporaryPath, retained, { mode: 0o600 });\n fs.renameSync(temporaryPath, this.#eventsPath);\n } finally {\n try { fs.rmSync(temporaryPath, { force: true }); } catch {}\n }\n atomicWrite(this.#generationPath, this.#readGeneration() + 1);\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #repairEventLog(): void {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r+\");\n const size = fs.fstatSync(descriptor).size;\n if (size === 0) return;\n const lastByte = Buffer.allocUnsafe(1);\n fs.readSync(descriptor, lastByte, 0, 1, size - 1);\n if (lastByte[0] === 0x0a) return;\n const readBytes = Math.min(size, this.maxEventBytes + 1);\n const tail = Buffer.allocUnsafe(readBytes);\n fs.readSync(descriptor, tail, 0, readBytes, size - readBytes);\n const newline = tail.lastIndexOf(0x0a);\n fs.ftruncateSync(descriptor, newline >= 0 ? size - readBytes + newline + 1 : 0);\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #readLastEventSequence(): number {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n if (size === 0) return 0;\n const readBytes = Math.min(size, this.maxEventBytes + 1);\n const tail = Buffer.allocUnsafe(readBytes);\n fs.readSync(descriptor, tail, 0, readBytes, size - readBytes);\n const lines = tail.toString(\"utf8\").trim().split(\"\\n\");\n for (let index = lines.length - 1; index >= 0; index--) {\n const line = lines[index];\n if (!line) continue;\n try {\n const parsed = JSON.parse(line) as { sequence?: unknown };\n if (typeof parsed.sequence === \"number\" && Number.isSafeInteger(parsed.sequence)) {\n return parsed.sequence;\n }\n } catch { /* skip malformed sequence line */ }\n }\n return 0;\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return 0;\n throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #readSequence(): number {\n try {\n const parsed: unknown = JSON.parse(fs.readFileSync(this.#counterPath, \"utf8\"));\n return typeof parsed === \"number\" && Number.isSafeInteger(parsed) && parsed >= 0 ? parsed : 0;\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return 0;\n return 0;\n }\n }\n\n #validateTopic(topic: string): void {\n validateMeshTopic(topic);\n }\n\n #validateKey(key: string): void {\n const unsafeSegment = key\n .split(/[/:]/)\n .some(\n (segment) =>\n segment === \"__proto__\" || segment === \"prototype\" || segment === \"constructor\",\n );\n if (!KEY_PATTERN.test(key) || unsafeSegment) {\n throw new Error(`Invalid Fabric mesh key: ${key}`);\n }\n }\n}\n", "// Generated by scripts/verified-kernels.ts from proofs/storage.ts with gdp-wired@0.13.3. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\n\nexport const storageTransition = /* @__PURE__ */ (() => {\n// Generated from the machine storage transition. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.plan\": 0, \"out.key\": 0, \"out.value\": 0, \"out.identity\": 0, \"out.version\": 0, \"out.highWater\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"key\": $n(input[\"key\"], \"input key\"), \"any\": $n(input[\"any\"], \"input any\"), \"expected\": $n(input[\"expected\"], \"input expected\"), \"put\": $n(input[\"put\"], \"input put\"), \"value\": $n(input[\"value\"], \"input value\"), \"identity\": $n(input[\"identity\"], \"input identity\"), \"present\": $n(input[\"present\"], \"input present\"), \"version\": $n(input[\"version\"], \"input version\"), \"highWater\": $n(input[\"highWater\"], \"input highWater\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"any\"] <= 1) && (env[\"put\"] <= 1) && (env[\"present\"] <= 1))) throw new RangeError(\"storage transition: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.plan\": ((!((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"]))) ? 0 : (((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1))) ? 2 : ((!((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? 1 : ((env[\"put\"] === 1) ? 3 : 4)))), \"out.key\": ((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? env[\"key\"] : 0), \"out.value\": (((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) && (env[\"put\"] === 1)) ? env[\"value\"] : 0), \"out.identity\": (((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) && (env[\"put\"] === 1)) ? env[\"identity\"] : 0), \"out.version\": ((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? $x(((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) + 1) : 0), \"out.highWater\": ((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? $x(env[\"highWater\"] + 1) : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { Interner, bit } from \"./machine.js\";\nimport { storageTransition } from \"./generated/storage.js\";\nimport type { MeshIdentity } from \"../mesh/store.js\";\n\nconst PLANS = [\"Conflict\", \"Exhausted\", \"Unchanged\", \"PutNext\", \"DeleteNext\"] as const;\n\nexport const storageRevision = (value: unknown): number => {\n if (typeof value !== \"number\" || !Number.isSafeInteger(value) || value < 0) {\n throw new Error(\"Invalid Fabric mesh revision: expected a nonnegative safe integer\");\n }\n return value;\n};\n\nconst serialize = (value: unknown): string => {\n const json = JSON.stringify(value);\n if (json === undefined) throw new Error(\"Mesh values must be JSON-serializable\");\n return json;\n};\n\nexport type StorageTransition =\n | { kind: \"put\"; key: string; value: unknown; identity: MeshIdentity; version: number; highWater: number }\n | { kind: \"delete\"; key: string; version: number; highWater: number }\n | { kind: \"unchanged\" };\n\nexport interface CapturedStorageRequest {\n readonly key: string;\n readonly transition: (present: boolean, actualVersion: number, highWater: number) => StorageTransition;\n}\n\nconst capture = (\n key: string,\n ifVersion: number | undefined,\n payload?: { value: string; identity: string },\n): CapturedStorageRequest => {\n const expected = ifVersion === undefined ? undefined : storageRevision(ifVersion);\n // The JSON strings never escape this closure. Caller-owned objects (including\n // nested identity/value) are not retained across lock wait.\n return Object.freeze({\n key,\n transition(present: boolean, actualVersion: number, highWater: number): StorageTransition {\n const actual = storageRevision(actualVersion);\n const clock = storageRevision(highWater);\n if (clock < actual) throw new Error(\"Inconsistent Fabric mesh high-water revision\");\n // Ids start at 1, so a forwarded 0 can never name a string.\n const names = new Interner(1);\n const out = storageTransition.step({}, storageTransition.init({}), {\n key: names.id(key), any: bit(expected === undefined), expected: expected ?? 0,\n put: bit(payload !== undefined), value: names.id(payload?.value ?? \"\"), identity: names.id(payload?.identity ?? \"\"),\n present: bit(present), version: actual, highWater: clock,\n }).scalars;\n // Representation conversion only; CAS, overflow and successor decisions are\n // performed by the executable proved reducer, not reproduced here.\n const plan = PLANS[out[\"out.plan\"]!];\n switch (plan) {\n case \"Conflict\":\n throw new Error(`Mesh compare-and-swap failed for ${key}: expected version ${expected}, found ${actual}`);\n case \"Exhausted\":\n throw new Error(`Fabric mesh revision exhausted for ${key}`);\n case \"Unchanged\":\n return { kind: \"unchanged\" };\n case \"PutNext\":\n return {\n kind: \"put\", key: names.name(out[\"out.key\"]!), value: JSON.parse(names.name(out[\"out.value\"]!)),\n identity: JSON.parse(names.name(out[\"out.identity\"]!)) as MeshIdentity,\n version: storageRevision(out[\"out.version\"]), highWater: storageRevision(out[\"out.highWater\"]),\n };\n case \"DeleteNext\":\n return { kind: \"delete\", key: names.name(out[\"out.key\"]!), version: storageRevision(out[\"out.version\"]), highWater: storageRevision(out[\"out.highWater\"]) };\n default:\n throw new Error(\"Invalid verified storage plan\");\n }\n },\n });\n};\n\nexport const captureStoragePut = (input: {\n key: string; ifVersion?: number | undefined; value: unknown; identity: MeshIdentity;\n}, maxValueBytes = Number.POSITIVE_INFINITY): CapturedStorageRequest => {\n const { key, ifVersion, value, identity } = input;\n // Capture scalars before serialization can invoke user-defined toJSON hooks.\n if (ifVersion !== undefined) storageRevision(ifVersion);\n const identityJson = serialize(identity);\n const valueJson = serialize(value);\n if (Buffer.byteLength(valueJson, \"utf8\") > maxValueBytes) {\n throw new Error(`Mesh state value exceeds ${maxValueBytes} bytes`);\n }\n return capture(key, ifVersion, { value: valueJson, identity: identityJson });\n};\n\nexport const captureStorageDelete = (input: {\n key: string; ifVersion?: number | undefined;\n}): CapturedStorageRequest => {\n const { key, ifVersion } = input;\n return capture(key, ifVersion);\n};\n"],
|
|
4
|
+
"sourcesContent": ["import { randomUUID } from \"node:crypto\";\nimport fs from \"node:fs\";\nimport path from \"node:path\";\nimport {\n writeFileAtomic,\n encodeOwnerIdentityLine,\n lockOwnerLiveness,\n lockOwnerProvablyDead,\n reapLockByRenameClaim,\n SHORT_LOCK_MAX_HOLD_MS,\n} from \"../core/atomic-write.js\";\nimport { readJsonlPage } from \"../log-tail.js\";\nimport { captureStoragePut, captureStorageDelete, storageRevision } from \"../verified/storage.js\";\nimport type { FabricMessageSender } from \"../protocol.js\";\nimport { processSender } from \"../scope.js\";\n\nexport interface MeshIdentity {\n id: string;\n name: string;\n kind: \"main\" | \"actor\" | \"agent\";\n sessionId?: string;\n}\n\nexport interface MeshEvent {\n id: string;\n sequence: number;\n topic: string;\n kind: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n createdAt: number;\n /** Set on events appended through a scoped external grant (`pi-fabric mesh post`). */\n origin?: \"external\";\n untrusted?: true;\n grantId?: string;\n /** Set on events released from a pending schedule; the event id is the schedule id. */\n scheduled?: { dueAt: number; key?: string };\n /** Host-stamped authority of the publishing process; absent from older builds and grant posts. */\n sender?: FabricMessageSender;\n}\n\n/** Host-internal append request used inside {@link MeshStore.transact}. */\nexport interface MeshAppendInput {\n id?: string;\n topic: string;\n kind?: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n origin?: \"external\";\n untrusted?: true;\n grantId?: string;\n scheduled?: { dueAt: number; key?: string };\n sender?: FabricMessageSender;\n /** A tighter per-event byte ceiling than the store's own. */\n maxEventBytes?: number;\n}\n\n/** A pending scheduled event; released into its topic log once due. */\nexport interface MeshSchedule {\n id: string;\n key?: string;\n topic: string;\n kind: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n dueAt: number;\n createdAt: number;\n /** Stamped when scheduled; carried onto the released event. */\n sender?: FabricMessageSender;\n}\n\ninterface MeshScheduleFile {\n format: 1;\n schedules: MeshSchedule[];\n}\n\nexport interface MeshTailResult {\n events: MeshEvent[];\n nextOffset: number;\n}\n\nexport interface MeshStateEntry {\n key: string;\n value: unknown;\n version: number;\n updatedAt: number;\n updatedBy: MeshIdentity;\n}\n\ninterface MeshStateFile {\n format: 1 | 2;\n revisionFormat?: 2;\n entries: Record<string, MeshStateEntry>;\n versions?: Record<string, number>;\n tombstoneOrder?: string[];\n /** Persisted allocation clock; never evicted with per-key tombstones. */\n highWater?: number;\n}\n\nexport interface MeshStoreOptions {\n maxEventLogBytes?: number;\n retainedEventLogBytes?: number;\n maxStateBytes?: number;\n maxStateTombstones?: number;\n lockTimeoutMs?: number;\n staleLockMs?: number;\n}\n\nconst TOPIC_PATTERN = /^[a-zA-Z0-9][a-zA-Z0-9._:/-]{0,127}$/;\nconst KEY_PATTERN = /^[a-zA-Z0-9][a-zA-Z0-9._:/-]{0,255}$/;\n\nexport const validateMeshTopic = (topic: string): void => {\n if (!TOPIC_PATTERN.test(topic)) throw new Error(`Invalid Fabric mesh topic: ${topic}`);\n};\nconst LOCK_TIMEOUT_MS = 10_000;\nconst STALE_LOCK_MS = 30_000;\nconst DEFAULT_MAX_EVENT_LOG_BYTES = 64 * 1024 * 1024;\nconst DEFAULT_RETAINED_EVENT_LOG_BYTES = 16 * 1024 * 1024;\nconst DEFAULT_MAX_STATE_BYTES = 32 * 1024 * 1024;\nconst DEFAULT_MAX_STATE_TOMBSTONES = 10_000;\nconst EVENT_READ_PAGE_BYTES = 4 * 1024 * 1024;\nconst EVENT_READ_CHUNK_BYTES = 64 * 1024;\nconst CURSOR_OFFSET_BASE = 2 ** 32;\nexport const MESH_MAX_PENDING_SCHEDULES = 1_000;\nexport const MESH_MAX_SCHEDULE_AHEAD_MS = 366 * 24 * 60 * 60 * 1_000;\nconst MAX_SCHEDULE_FILE_BYTES = 16 * 1024 * 1024;\nconst SCHEDULE_KEY_PATTERN = /^[a-zA-Z0-9][a-zA-Z0-9._:/-]{0,127}$/;\n\nconst delay = (milliseconds: number): Promise<void> =>\n new Promise((resolve) => setTimeout(resolve, milliseconds));\n\nconst errorCode = (error: unknown): string | undefined =>\n error instanceof Error && \"code\" in error && typeof error.code === \"string\"\n ? error.code\n : undefined;\n\nconst processAlive = (pid: number): boolean => {\n if (!Number.isSafeInteger(pid) || pid <= 0) return false;\n try {\n process.kill(pid, 0);\n return true;\n } catch {\n return false;\n }\n};\n\nconst jsonClone = <T>(value: T): T => {\n const serialized = JSON.stringify(value);\n if (serialized === undefined) throw new Error(\"Mesh values must be JSON-serializable\");\n return JSON.parse(serialized) as T;\n};\n\nconst isMeshStateFile = (value: unknown): value is MeshStateFile => {\n if (\n typeof value !== \"object\" ||\n value === null ||\n Array.isArray(value) ||\n ![1, 2].includes((value as { format?: unknown }).format as number)\n ) {\n return false;\n }\n const entries = (value as { entries?: unknown }).entries;\n return typeof entries === \"object\" && entries !== null && !Array.isArray(entries);\n};\n\nconst recoverConcatenatedState = (serialized: string): MeshStateFile | undefined => {\n const snapshots: MeshStateFile[] = [];\n let documents = 0;\n let start = -1;\n let depth = 0;\n let inString = false;\n let escaped = false;\n\n for (let index = 0; index < serialized.length; index += 1) {\n const character = serialized[index]!;\n if (start < 0) {\n if (/\\s/.test(character)) continue;\n if (character !== \"{\") return undefined;\n start = index;\n depth = 1;\n continue;\n }\n if (inString) {\n if (escaped) escaped = false;\n else if (character === \"\\\\\") escaped = true;\n else if (character === '\"') inString = false;\n continue;\n }\n if (character === '\"') inString = true;\n else if (character === \"{\") depth += 1;\n else if (character === \"}\") {\n depth -= 1;\n if (depth !== 0) continue;\n try {\n const parsed: unknown = JSON.parse(serialized.slice(start, index + 1));\n documents += 1;\n if (isMeshStateFile(parsed)) snapshots.push(parsed);\n } catch {\n return undefined;\n }\n start = -1;\n }\n }\n\n return start < 0 && documents > 1 ? snapshots.at(-1) : undefined;\n};\n\nconst compareSchedules = (left: MeshSchedule, right: MeshSchedule): number =>\n left.dueAt - right.dueAt || left.createdAt - right.createdAt || left.id.localeCompare(right.id);\n\nconst isMeshSchedule = (value: unknown): value is MeshSchedule => {\n if (typeof value !== \"object\" || value === null || Array.isArray(value)) return false;\n const entry = value as Partial<MeshSchedule>;\n return typeof entry.id === \"string\" && typeof entry.topic === \"string\" &&\n typeof entry.kind === \"string\" && typeof entry.from === \"object\" && entry.from !== null &&\n Number.isSafeInteger(entry.dueAt) && Number.isSafeInteger(entry.createdAt) &&\n (entry.key === undefined || typeof entry.key === \"string\");\n};\n\nconst emptyState = (): MeshStateFile => ({ format: 1, revisionFormat: 2, entries: {}, highWater: 0 });\n\nconst readState = (filePath: string, maxBytes: number, recoverDamage = true): MeshStateFile => {\n let serialized: string;\n try {\n const stat = fs.statSync(filePath);\n if (stat.size > maxBytes) throw new Error(`state exceeds ${maxBytes} bytes`);\n if (stat.size === 0 && recoverDamage) return emptyState();\n serialized = fs.readFileSync(filePath, \"utf8\");\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return emptyState();\n const message = error instanceof Error ? error.message : String(error);\n throw new Error(`Failed to read Fabric mesh state: ${message}`);\n }\n if (!serialized.trim() && recoverDamage) return emptyState();\n try {\n const parsed: unknown = JSON.parse(serialized);\n if (isMeshStateFile(parsed)) return parsed;\n throw new Error(\"invalid state format\");\n } catch (error) {\n // Failed parsing must not silently erase the allocation clock. Read-only\n // startup can tolerate damage, but mutations require a repaired snapshot.\n const recovered = recoverConcatenatedState(serialized);\n if (recovered) return recovered;\n if (!recoverDamage) throw new Error(\"Failed to read Fabric mesh state: invalid state format\");\n // Preserve the original bytes at this path as a barrier to clock reset.\n return emptyState();\n }\n};\n\nconst atomicWrite = (filePath: string, value: unknown, maxBytes = Number.POSITIVE_INFINITY): void => {\n const serialized = JSON.stringify(value, null, 2);\n if (Buffer.byteLength(serialized, \"utf8\") > maxBytes) {\n throw new Error(`Fabric mesh state exceeds ${maxBytes} bytes`);\n }\n writeFileAtomic(filePath, serialized);\n};\n\n// Host invariant for the proved reducer: the persisted clock covers every\n// issued token. Legacy files can seed only from retained entries/tombstones;\n// tokens already evicted before this migration cannot be reconstructed.\nconst stateSlot = (state: MeshStateFile, key: string): {\n present: boolean; version: number; highWater: number;\n} => {\n if (state.versions !== undefined &&\n (typeof state.versions !== \"object\" || state.versions === null || Array.isArray(state.versions))) {\n throw new Error(\"Invalid Fabric mesh revision table\");\n }\n let retainedMaximum = 0;\n for (const revision of Object.values(state.versions ?? {})) {\n retainedMaximum = Math.max(retainedMaximum, storageRevision(revision));\n }\n for (const [entryKey, entry] of Object.entries(state.entries)) {\n if (typeof entry !== \"object\" || entry === null || entry.key !== entryKey) {\n throw new Error(\"Invalid Fabric mesh state entry\");\n }\n const version = storageRevision(entry.version);\n const retained = state.versions !== undefined && Object.hasOwn(state.versions, entryKey)\n ? state.versions[entryKey] : undefined;\n if (version === 0 || (retained !== undefined && retained !== version)) {\n throw new Error(\"Inconsistent Fabric mesh revision\");\n }\n retainedMaximum = Math.max(retainedMaximum, version);\n }\n // New snapshots require their clock: losing it must not look like legacy\n // migration and silently reissue revisions from an evicted history.\n if (Object.hasOwn(state, \"revisionFormat\") && state.revisionFormat !== 2) {\n throw new Error(\"Unsupported Fabric mesh revision protocol\");\n }\n if ((state.format === 2 || state.revisionFormat === 2) && !Object.hasOwn(state, \"highWater\")) {\n throw new Error(\"Missing Fabric mesh high-water revision\");\n }\n const highWater = Object.hasOwn(state, \"highWater\")\n ? storageRevision(state.highWater) : retainedMaximum;\n if (highWater < retainedMaximum) throw new Error(\"Inconsistent Fabric mesh high-water revision\");\n const present = Object.hasOwn(state.entries, key);\n const version = present ? state.entries[key]!.version\n : state.versions !== undefined && Object.hasOwn(state.versions, key) ? state.versions[key]! : 0;\n return { present, version, highWater };\n};\n\nconst compactStateTombstones = (state: MeshStateFile, maxTombstones: number): void => {\n state.versions ??= {};\n const orderedKeys: string[] = [];\n const seen = new Set<string>();\n for (const key of state.tombstoneOrder ?? []) {\n if (Object.hasOwn(state.entries, key) || !Object.hasOwn(state.versions, key) || seen.has(key)) continue;\n seen.add(key);\n orderedKeys.push(key);\n }\n for (const key of Object.keys(state.versions)) {\n if (Object.hasOwn(state.entries, key) || seen.has(key)) continue;\n seen.add(key);\n orderedKeys.push(key);\n }\n const retainedKeys = orderedKeys.slice(-maxTombstones);\n const retained = new Set(retainedKeys);\n for (const key of Object.keys(state.versions)) {\n if (!Object.hasOwn(state.entries, key) && !retained.has(key)) delete state.versions[key];\n }\n state.tombstoneOrder = retainedKeys;\n};\n\nexport class MeshStore {\n readonly #eventsPath: string;\n readonly #statePath: string;\n readonly #counterPath: string;\n readonly #generationPath: string;\n readonly #lockPath: string;\n readonly #maxEventLogBytes: number;\n readonly #retainedEventLogBytes: number;\n readonly #maxStateBytes: number;\n readonly #maxStateTombstones: number;\n readonly #lockTimeoutMs: number;\n readonly #staleLockMs: number;\n #stateCache:\n | { device: number; inode: number; size: number; modifiedAt: number; state: MeshStateFile }\n | undefined;\n readonly #schedulesPath: string;\n #scheduleCache:\n | { inode: number; size: number; modifiedAt: number; file: MeshScheduleFile; error?: string }\n | undefined;\n\n constructor(\n readonly root: string,\n readonly maxEventBytes: number,\n readonly maxReadEvents: number,\n options: MeshStoreOptions = {},\n ) {\n this.#eventsPath = path.join(root, \"events.jsonl\");\n this.#statePath = path.join(root, \"state.json\");\n this.#counterPath = path.join(root, \"sequence\");\n this.#generationPath = path.join(root, \"generation\");\n this.#lockPath = path.join(root, \".lock\");\n // Pending schedules live beside state.json, outside the verified storage\n // revision table: they are serialized by this lock, not by key CAS.\n this.#schedulesPath = path.join(root, \"schedules.json\");\n this.#maxEventLogBytes = Math.min(\n CURSOR_OFFSET_BASE - 1,\n Math.max(maxEventBytes + 2, Math.floor(options.maxEventLogBytes ?? DEFAULT_MAX_EVENT_LOG_BYTES)),\n );\n this.#retainedEventLogBytes = Math.min(\n this.#maxEventLogBytes - 1,\n Math.max(\n maxEventBytes + 1,\n Math.floor(options.retainedEventLogBytes ?? DEFAULT_RETAINED_EVENT_LOG_BYTES),\n ),\n );\n this.#maxStateBytes = Math.max(\n maxEventBytes * 2,\n Math.floor(options.maxStateBytes ?? DEFAULT_MAX_STATE_BYTES),\n );\n this.#maxStateTombstones = Math.max(\n 1,\n Math.floor(options.maxStateTombstones ?? DEFAULT_MAX_STATE_TOMBSTONES),\n );\n this.#lockTimeoutMs = Math.max(100, Math.floor(options.lockTimeoutMs ?? LOCK_TIMEOUT_MS));\n this.#staleLockMs = Math.max(100, Math.floor(options.staleLockMs ?? STALE_LOCK_MS));\n fs.mkdirSync(root, { recursive: true, mode: 0o700 });\n }\n\n async publish(input: {\n topic: string;\n kind?: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n /** Host-only: publish on behalf of another authority (an actor's scope). */\n sender?: FabricMessageSender;\n }): Promise<MeshEvent> {\n this.#validateTopic(input.topic);\n if (input.to !== undefined && !input.to.trim()) throw new Error(\"Mesh recipient is empty\");\n const eventData = input.data === undefined ? undefined : jsonClone(input.data);\n const sender = input.sender ?? processSender();\n return this.#withLock(() => {\n // Any write that already holds the lock also releases due schedules first,\n // so the log keeps due-time order relative to this event. Damaged\n // schedule state must not block ordinary publishing.\n try { this.#releaseDueLocked(Date.now()); } catch { /* schedule mutations report it */ }\n return this.#appendLocked({ ...input, ...(eventData !== undefined ? { data: eventData } : {}), sender });\n });\n }\n\n /**\n * Host-internal: runs `operation` under the mesh lock with an append\n * capability, for side stores (grants) that must commit with an event.\n */\n async transact<T>(operation: (append: (input: MeshAppendInput) => MeshEvent) => T): Promise<T> {\n return this.#withLock(() => {\n try { this.#releaseDueLocked(Date.now()); } catch { /* schedule mutations report it */ }\n return operation((input) => {\n this.#validateTopic(input.topic);\n return this.#appendLocked(input);\n });\n });\n }\n\n #appendLocked(input: MeshAppendInput): MeshEvent {\n this.#repairEventLog();\n const sequence = Math.max(this.#readSequence(), this.#readLastEventSequence()) + 1;\n const event: MeshEvent = {\n id: input.id ?? randomUUID(),\n sequence,\n topic: input.topic,\n kind: input.kind?.trim() || \"message\",\n from: jsonClone(input.from),\n ...(input.to ? { to: input.to } : {}),\n ...(input.text !== undefined ? { text: input.text } : {}),\n ...(input.data !== undefined ? { data: jsonClone(input.data) } : {}),\n createdAt: Date.now(),\n ...(input.origin ? { origin: input.origin } : {}),\n ...(input.untrusted ? { untrusted: true as const } : {}),\n ...(input.grantId ? { grantId: input.grantId } : {}),\n ...(input.scheduled ? { scheduled: { ...input.scheduled } } : {}),\n ...(input.sender ? { sender: jsonClone(input.sender) } : {}),\n };\n const line = JSON.stringify(event);\n const limit = Math.min(this.maxEventBytes, input.maxEventBytes ?? this.maxEventBytes);\n if (Buffer.byteLength(line, \"utf8\") > limit) {\n throw new Error(`Mesh event exceeds ${limit} bytes`);\n }\n fs.appendFileSync(this.#eventsPath, `${line}\\n`, { encoding: \"utf8\", mode: 0o600 });\n atomicWrite(this.#counterPath, sequence);\n this.#compactEventLog();\n return event;\n }\n\n /**\n * Stores a pending event released into `topic` once `dueAt` passes. A `key`\n * replaces any pending schedule with that key in the same locked write, so\n * concurrent publishers never leave two schedules for one key.\n */\n async schedule(input: {\n topic: string;\n kind?: string;\n from: MeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n dueAt: number;\n key?: string;\n }, now = Date.now()): Promise<MeshSchedule> {\n this.#validateTopic(input.topic);\n if (input.to !== undefined && !input.to.trim()) throw new Error(\"Mesh recipient is empty\");\n if (input.key !== undefined && !SCHEDULE_KEY_PATTERN.test(input.key)) {\n throw new Error(`Invalid Fabric mesh schedule key: ${input.key}`);\n }\n if (!Number.isSafeInteger(input.dueAt) || input.dueAt < 0) {\n throw new Error(\"Mesh schedule due time must be a nonnegative epoch millisecond integer\");\n }\n if (input.dueAt > now + MESH_MAX_SCHEDULE_AHEAD_MS) {\n throw new Error(\"Mesh schedules may be at most 366 days ahead\");\n }\n const schedule: MeshSchedule = {\n id: randomUUID(),\n ...(input.key !== undefined ? { key: input.key } : {}),\n topic: input.topic,\n kind: input.kind?.trim() || \"message\",\n from: jsonClone(input.from),\n ...(input.to ? { to: input.to } : {}),\n ...(input.text !== undefined ? { text: input.text } : {}),\n ...(input.data !== undefined ? { data: jsonClone(input.data) } : {}),\n dueAt: input.dueAt,\n createdAt: now,\n sender: processSender(),\n };\n // Reject at schedule time what release could never append.\n const released: MeshEvent = {\n id: schedule.id, sequence: Number.MAX_SAFE_INTEGER, topic: schedule.topic, kind: schedule.kind,\n from: schedule.from, ...(schedule.to ? { to: schedule.to } : {}),\n ...(schedule.text !== undefined ? { text: schedule.text } : {}),\n ...(schedule.data !== undefined ? { data: schedule.data } : {}),\n createdAt: Number.MAX_SAFE_INTEGER,\n scheduled: { dueAt: schedule.dueAt, ...(schedule.key !== undefined ? { key: schedule.key } : {}) },\n ...(schedule.sender ? { sender: schedule.sender } : {}),\n };\n if (Buffer.byteLength(JSON.stringify(released), \"utf8\") > this.maxEventBytes) {\n throw new Error(`Mesh event exceeds ${this.maxEventBytes} bytes`);\n }\n return this.#withLock(() => {\n const file = this.#readSchedules(false);\n const pending = file.schedules.filter((entry) => input.key === undefined || entry.key !== input.key);\n if (pending.length >= MESH_MAX_PENDING_SCHEDULES) {\n throw new Error(`At most ${MESH_MAX_PENDING_SCHEDULES} mesh schedules may be pending`);\n }\n pending.push(schedule);\n this.#writeSchedules(pending);\n this.#releaseDueLocked(now);\n return jsonClone(schedule);\n });\n }\n\n /** Removes the pending schedule with `key`, if any. */\n async unschedule(key: string): Promise<{ removed: boolean }> {\n if (!SCHEDULE_KEY_PATTERN.test(key)) throw new Error(`Invalid Fabric mesh schedule key: ${key}`);\n return this.#withLock(() => {\n const file = this.#readSchedules(false);\n const pending = file.schedules.filter((entry) => entry.key !== key);\n if (pending.length === file.schedules.length) return { removed: false };\n this.#writeSchedules(pending);\n return { removed: true };\n });\n }\n\n /** Pending schedules by due time; a due one stays listed until a releaser appends it. */\n scheduled(input: { topic?: string; limit?: number } = {}): MeshSchedule[] {\n if (input.topic !== undefined) this.#validateTopic(input.topic);\n const limit = Math.max(1, Math.min(Math.floor(input.limit ?? 100), MESH_MAX_PENDING_SCHEDULES));\n return this.#readSchedules(true).schedules\n .filter((entry) => input.topic === undefined || entry.topic === input.topic)\n .sort(compareSchedules)\n .slice(0, limit)\n .map((entry) => jsonClone(entry));\n }\n\n /** Earliest pending due time, read without the lock (one stat when unchanged). */\n nextScheduleDueAt(): number | undefined {\n let next: number | undefined;\n for (const entry of this.#readSchedules(true).schedules) {\n if (next === undefined || entry.dueAt < next) next = entry.dueAt;\n }\n return next;\n }\n\n /**\n * Appends every due schedule to its topic and removes it, under the mesh\n * lock, so concurrent releasers (monitors, resident hosts, CLI posts) append\n * each schedule once. The lock is taken only when something is due.\n */\n async releaseDueSchedules(now = Date.now()): Promise<MeshEvent[]> {\n const next = this.nextScheduleDueAt();\n if (next === undefined || next > now) return [];\n return this.#withLock(() => this.#releaseDueLocked(now));\n }\n\n #releaseDueLocked(now: number): MeshEvent[] {\n if (!fs.existsSync(this.#schedulesPath)) return [];\n const file = this.#readSchedules(false);\n const due = file.schedules.filter((entry) => entry.dueAt <= now).sort(compareSchedules);\n if (due.length === 0) return [];\n const released: MeshEvent[] = [];\n const releasedIds = new Set<string>();\n try {\n // Events first, then the shrunken schedule file: a crash in between\n // re-releases with the same event id (at-least-once, dedupe by id).\n for (const entry of due) {\n released.push(this.#appendLocked({\n id: entry.id,\n topic: entry.topic,\n kind: entry.kind,\n from: entry.from,\n ...(entry.to ? { to: entry.to } : {}),\n ...(entry.text !== undefined ? { text: entry.text } : {}),\n ...(entry.data !== undefined ? { data: entry.data } : {}),\n scheduled: { dueAt: entry.dueAt, ...(entry.key !== undefined ? { key: entry.key } : {}) },\n // Older schedules stay unstamped: the releasing host never lends its own authority.\n ...(entry.sender ? { sender: entry.sender } : {}),\n }));\n releasedIds.add(entry.id);\n }\n } finally {\n if (releasedIds.size > 0) {\n this.#writeSchedules(file.schedules.filter((entry) => !releasedIds.has(entry.id)));\n }\n }\n return released;\n }\n\n #readSchedules(lenient: boolean): MeshScheduleFile {\n let stat: fs.Stats;\n try {\n stat = fs.statSync(this.#schedulesPath);\n } catch (error) {\n this.#scheduleCache = undefined;\n if (errorCode(error) === \"ENOENT\") return { format: 1, schedules: [] };\n throw error;\n }\n // Locked mutations always re-read; the stat-keyed cache serves only lockless reads.\n const cached = lenient ? this.#scheduleCache : undefined;\n if (cached && cached.inode === stat.ino && cached.size === stat.size && cached.modifiedAt === stat.mtimeMs) {\n return cached.error === undefined ? cached.file : { format: 1, schedules: [] };\n }\n let file: MeshScheduleFile = { format: 1, schedules: [] };\n let damage: string | undefined;\n try {\n if (stat.size > MAX_SCHEDULE_FILE_BYTES) throw new Error(`exceeds ${MAX_SCHEDULE_FILE_BYTES} bytes`);\n const parsed = JSON.parse(fs.readFileSync(this.#schedulesPath, \"utf8\")) as Partial<MeshScheduleFile>;\n if (parsed?.format !== 1 || !Array.isArray(parsed.schedules) || !parsed.schedules.every(isMeshSchedule)) {\n throw new Error(\"invalid format\");\n }\n file = { format: 1, schedules: parsed.schedules };\n } catch (error) {\n damage = error instanceof Error ? error.message : String(error);\n }\n this.#scheduleCache = {\n inode: stat.ino, size: stat.size, modifiedAt: stat.mtimeMs, file, ...(damage !== undefined ? { error: damage } : {}),\n };\n if (damage === undefined) return file;\n // Reads tolerate damage; mutations refuse to overwrite it silently.\n if (lenient) return { format: 1, schedules: [] };\n throw new Error(`Failed to read Fabric mesh schedules: ${damage}`);\n }\n\n #writeSchedules(schedules: MeshSchedule[]): void {\n if (schedules.length === 0) {\n fs.rmSync(this.#schedulesPath, { force: true });\n this.#scheduleCache = undefined;\n return;\n }\n atomicWrite(this.#schedulesPath, { format: 1, schedules }, MAX_SCHEDULE_FILE_BYTES);\n this.#scheduleCache = undefined;\n }\n\n read(\n input: {\n after?: number;\n topic?: string;\n to?: string;\n limit?: number;\n } = {},\n ): MeshEvent[] {\n if (input.topic !== undefined) this.#validateTopic(input.topic);\n const limit = Math.max(1, Math.min(Math.floor(input.limit ?? 100), this.maxReadEvents));\n const events =\n input.after === undefined\n ? this.#readRecentEvents(input, limit)\n : this.#readEventsAfter(Math.max(0, Math.floor(input.after)), input, limit);\n return events.map((event) => jsonClone(event));\n }\n\n latestSequence(): number {\n return Math.max(this.#readSequence(), this.#readLastEventSequence());\n }\n\n latestOffset(): number {\n const generation = this.#readGeneration();\n let descriptor: number | undefined;\n let completeOffset = 0;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n if (size > 0) {\n const lastByte = Buffer.allocUnsafe(1);\n fs.readSync(descriptor, lastByte, 0, 1, size - 1);\n if (lastByte[0] === 0x0a) {\n completeOffset = size;\n } else {\n const readBytes = Math.min(size, this.maxEventBytes + 1);\n const tail = Buffer.allocUnsafe(readBytes);\n fs.readSync(descriptor, tail, 0, readBytes, size - readBytes);\n const newline = tail.lastIndexOf(0x0a);\n completeOffset = newline >= 0 ? size - readBytes + newline + 1 : 0;\n }\n }\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n return this.#encodeCursor(generation, completeOffset);\n }\n\n tail(cursor: number, limit = 100): MeshTailResult {\n const boundedLimit = Math.max(1, Math.min(Math.floor(limit), this.maxReadEvents));\n const generation = this.#readGeneration();\n const decoded = this.#decodeCursor(cursor);\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n let position = decoded.generation === generation ? Math.min(decoded.offset, size) : 0;\n if (position > 0) {\n const previousByte = Buffer.allocUnsafe(1);\n fs.readSync(descriptor, previousByte, 0, 1, position - 1);\n if (previousByte[0] !== 0x0a) position = 0;\n }\n if (position >= size) {\n return { events: [], nextOffset: this.#encodeCursor(generation, position) };\n }\n const chunkBytes = Math.min(\n size - position,\n Math.max(this.maxEventBytes + 1, EVENT_READ_PAGE_BYTES),\n );\n const buffer = Buffer.allocUnsafe(chunkBytes);\n const bytesRead = fs.readSync(descriptor, buffer, 0, chunkBytes, position);\n const events: MeshEvent[] = [];\n let lineStart = 0;\n let consumed = 0;\n for (let index = 0; index < bytesRead; index++) {\n if (buffer[index] !== 0x0a) continue;\n const line = buffer.subarray(lineStart, index).toString(\"utf8\").trim();\n lineStart = index + 1;\n consumed = lineStart;\n if (line) {\n try {\n const event = JSON.parse(line) as MeshEvent;\n if (typeof event.sequence === \"number\") events.push(event);\n } catch { /* skip malformed mesh log line */ }\n }\n if (events.length >= boundedLimit) break;\n }\n return {\n events: events.map((event) => jsonClone(event)),\n nextOffset: this.#encodeCursor(generation, position + consumed),\n };\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") {\n return { events: [], nextOffset: this.#encodeCursor(generation, 0) };\n }\n throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #readRecentEvents(\n input: { topic?: string; to?: string },\n limit: number,\n ): MeshEvent[] {\n let events: MeshEvent[] = [];\n let before: number | undefined;\n while (events.length < limit) {\n const page = readJsonlPage(\n this.#eventsPath,\n this.maxReadEvents,\n before,\n Math.max(this.maxEventBytes + 1, EVENT_READ_PAGE_BYTES),\n );\n const pageEvents: MeshEvent[] = [];\n for (const line of page.lines) {\n const parsed = line.parsed;\n if (typeof parsed !== \"object\" || parsed === null || Array.isArray(parsed)) continue;\n const event = parsed as MeshEvent;\n if (typeof event.sequence !== \"number\" || !this.#eventMatches(event, input)) continue;\n pageEvents.push(event);\n }\n events = [...pageEvents, ...events].slice(-limit);\n if (!page.hasMore || page.before === undefined || page.before === before) break;\n before = page.before;\n }\n return events;\n }\n\n #readEventsAfter(\n after: number,\n input: { topic?: string; to?: string },\n limit: number,\n ): MeshEvent[] {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n const events: MeshEvent[] = [];\n let position = 0;\n let lineChunks: Buffer[] = [];\n let lineBytes = 0;\n let skippingOversizedLine = false;\n let reachedLimit = false;\n\n const emitLine = (): void => {\n if (!skippingOversizedLine && lineBytes > 0) {\n const decoded = Buffer.concat(lineChunks, lineBytes).toString(\"utf8\");\n const line = decoded.endsWith(String.fromCharCode(13)) ? decoded.slice(0, -1) : decoded;\n try {\n const event = JSON.parse(line) as MeshEvent;\n if (\n typeof event.sequence === \"number\" &&\n event.sequence > after &&\n this.#eventMatches(event, input)\n ) {\n events.push(event);\n reachedLimit = events.length >= limit;\n }\n } catch { /* skip malformed mesh log line */ }\n }\n lineChunks = [];\n lineBytes = 0;\n skippingOversizedLine = false;\n };\n\n while (position < size && !reachedLimit) {\n const readLength = Math.min(EVENT_READ_CHUNK_BYTES, size - position);\n const chunk = Buffer.allocUnsafe(readLength);\n const bytesRead = fs.readSync(descriptor, chunk, 0, readLength, position);\n if (bytesRead <= 0) break;\n position += bytesRead;\n const captured = chunk.subarray(0, bytesRead);\n let segmentStart = 0;\n while (segmentStart < captured.length && !reachedLimit) {\n const newline = captured.indexOf(0x0a, segmentStart);\n const segmentEnd = newline < 0 ? captured.length : newline;\n const segment = captured.subarray(segmentStart, segmentEnd);\n if (!skippingOversizedLine) {\n if (lineBytes + segment.length <= this.maxEventBytes) {\n if (segment.length > 0) lineChunks.push(segment);\n lineBytes += segment.length;\n } else {\n lineChunks = [];\n lineBytes = 0;\n skippingOversizedLine = true;\n }\n }\n if (newline < 0) break;\n emitLine();\n segmentStart = newline + 1;\n }\n }\n if (!reachedLimit && (lineBytes > 0 || skippingOversizedLine)) emitLine();\n return events;\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return [];\n throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #eventMatches(event: MeshEvent, input: { topic?: string; to?: string }): boolean {\n if (input.topic !== undefined && event.topic !== input.topic) return false;\n if (input.to !== undefined && event.to !== input.to) return false;\n return true;\n }\n\n get(key: string): MeshStateEntry | undefined {\n this.#validateKey(key);\n const entries = this.#readCachedState().entries;\n return Object.hasOwn(entries, key) ? jsonClone(entries[key]) : undefined;\n }\n\n list(prefix = \"\", limit = 100): MeshStateEntry[] {\n const boundedLimit = Math.max(1, Math.min(Math.floor(limit), this.maxReadEvents));\n return this.listAll(prefix).slice(0, boundedLimit);\n }\n\n /** Internal project-state scan for host-managed indexes that must reconcile every key. */\n listAll(prefix = \"\"): MeshStateEntry[] {\n if (prefix) this.#validateKey(prefix);\n return Object.values(this.#readCachedState().entries)\n .filter((entry) => !prefix || entry.key.startsWith(prefix))\n .sort((left, right) => left.key.localeCompare(right.key))\n .map((entry) => jsonClone(entry));\n }\n\n async put(input: {\n key: string;\n value: unknown;\n identity: MeshIdentity;\n ifVersion?: number;\n }): Promise<MeshStateEntry> {\n const { key, value, identity, ifVersion } = input;\n this.#validateKey(key);\n const request = captureStoragePut({ key, value, identity, ifVersion }, this.maxEventBytes);\n return this.#withLock(() => {\n const state = readState(this.#statePath, this.#maxStateBytes, false);\n const slot = stateSlot(state, request.key);\n const plan = request.transition(slot.present, slot.version, slot.highWater);\n if (plan.kind !== \"put\") throw new Error(\"Invalid verified storage put plan\");\n const entry: MeshStateEntry = {\n key: plan.key,\n value: plan.value,\n version: plan.version,\n updatedAt: Date.now(),\n updatedBy: plan.identity,\n };\n state.entries[plan.key] = entry;\n state.versions ??= {};\n state.versions[plan.key] = plan.version;\n // Keep the envelope readable by existing hosts; revisionFormat marks the\n // mandatory persistent clock without making old readers quarantine it.\n state.format = 1;\n state.revisionFormat = 2;\n state.highWater = plan.highWater;\n state.tombstoneOrder = (state.tombstoneOrder ?? []).filter((key) => key !== plan.key);\n compactStateTombstones(state, this.#maxStateTombstones);\n atomicWrite(this.#statePath, state, this.#maxStateBytes);\n this.#cacheState(state);\n return jsonClone(entry);\n });\n }\n\n async delete(input: {\n key: string;\n ifVersion?: number;\n }): Promise<{ deleted: boolean; version?: number }> {\n const { key, ifVersion } = input;\n this.#validateKey(key);\n const request = captureStorageDelete({ key, ifVersion });\n return this.#withLock(() => {\n const state = readState(this.#statePath, this.#maxStateBytes, false);\n const slot = stateSlot(state, request.key);\n const plan = request.transition(slot.present, slot.version, slot.highWater);\n if (plan.kind === \"unchanged\") {\n this.#cacheState(state);\n return { deleted: false };\n }\n if (plan.kind !== \"delete\") throw new Error(\"Invalid verified storage delete plan\");\n delete state.entries[plan.key];\n state.versions ??= {};\n // Delete consumes a key successor and advances the persistent clock.\n // Eviction can forget a CAS tombstone, but not allocation history.\n state.versions[plan.key] = plan.version;\n // Keep the envelope readable by existing hosts; revisionFormat marks the\n // mandatory persistent clock without making old readers quarantine it.\n state.format = 1;\n state.revisionFormat = 2;\n state.highWater = plan.highWater;\n state.tombstoneOrder = [\n ...(state.tombstoneOrder ?? []).filter((key) => key !== plan.key),\n plan.key,\n ];\n compactStateTombstones(state, this.#maxStateTombstones);\n atomicWrite(this.#statePath, state, this.#maxStateBytes);\n this.#cacheState(state);\n return { deleted: true, version: plan.version };\n });\n }\n\n #readCachedState(): MeshStateFile {\n try {\n const stat = fs.statSync(this.#statePath);\n const cached = this.#stateCache;\n if (\n cached &&\n cached.device === stat.dev &&\n cached.inode === stat.ino &&\n cached.size === stat.size &&\n cached.modifiedAt === stat.mtimeMs\n ) {\n return cached.state;\n }\n } catch (error) {\n this.#stateCache = undefined;\n if (errorCode(error) === \"ENOENT\") return emptyState();\n throw error;\n }\n const state = readState(this.#statePath, this.#maxStateBytes);\n this.#cacheState(state);\n return state;\n }\n\n #cacheState(state: MeshStateFile): void {\n try {\n const stat = fs.statSync(this.#statePath);\n this.#stateCache = {\n device: stat.dev,\n inode: stat.ino,\n size: stat.size,\n modifiedAt: stat.mtimeMs,\n state,\n };\n } catch {\n this.#stateCache = undefined;\n }\n }\n\n async #withLock<T>(operation: () => T): Promise<T> {\n fs.mkdirSync(this.root, { recursive: true, mode: 0o700 });\n const deadline = Date.now() + this.#lockTimeoutMs;\n const token = randomUUID();\n const ownerPath = path.join(this.#lockPath, \"owner\");\n while (true) {\n try {\n fs.mkdirSync(this.#lockPath, { mode: 0o700 });\n fs.writeFileSync(ownerPath, `${token}\\n${process.pid}\\n${Date.now()}\\n${encodeOwnerIdentityLine()}\\n`, {\n encoding: \"utf8\",\n mode: 0o600,\n });\n break;\n } catch (error) {\n if (errorCode(error) !== \"EEXIST\") throw error;\n if (this.#clearStaleLock(ownerPath)) continue;\n if (Date.now() >= deadline) throw new Error(\"Timed out waiting for the Fabric mesh lock\");\n await delay(10);\n }\n }\n try {\n return operation();\n } finally {\n try {\n const owner = fs.readFileSync(ownerPath, \"utf8\");\n if (owner.startsWith(`${token}\\n`)) {\n fs.rmSync(this.#lockPath, { recursive: true, force: true });\n }\n } catch {\n // Another process already recovered or removed this lock.\n }\n }\n }\n\n // Returns true when a stale lock was removed and acquisition should retry.\n // A lock is stale when it outlived the stale window without a live owner:\n // either the owner file names a dead process, or the owner file is missing\n // or corrupt \u2014 the owner crashed between creating the lock directory and\n // writing the owner file \u2014 and the untouched lock directory itself is\n // stale. A younger lock is also removed when its owner is provably dead:\n // same host, PID namespace and boot, and the pid is gone or reused. Removal\n // re-reads the state it judged stale so a freshly rotated owner is never\n // deleted mid-check, and an owner lock is removed through a rename claim so\n // a lock a new owner took after that re-read survives.\n #clearStaleLock(ownerPath: string): boolean {\n let lockModifiedAt: number | undefined;\n let owner: string | undefined;\n try {\n owner = fs.readFileSync(ownerPath, \"utf8\");\n } catch {\n try {\n lockModifiedAt = fs.statSync(this.#lockPath).mtimeMs;\n } catch {\n return false;\n }\n }\n if (owner !== undefined) {\n const [, pidText, createdText, identityLine] = owner.trim().split(\"\\n\");\n const createdAt = Number(createdText);\n const fresh = Number.isFinite(createdAt) && Date.now() - createdAt <= this.#staleLockMs;\n // A fresh lock is cleared only when its local owner is provably dead.\n // Unknown (another PID namespace within the hold ceiling) is not death.\n const dead = fresh\n ? lockOwnerProvablyDead(Number(pidText), identityLine)\n : lockOwnerLiveness(Number(pidText), createdAt, identityLine, {\n legacyAlive: processAlive,\n maxHoldMs: Math.max(SHORT_LOCK_MAX_HOLD_MS, this.#staleLockMs),\n }) === \"dead\";\n if (!dead) return false;\n try {\n if (fs.readFileSync(ownerPath, \"utf8\") !== owner) return false;\n return reapLockByRenameClaim(this.#lockPath, (claimed) => {\n try {\n return fs.readFileSync(path.join(claimed, \"owner\"), \"utf8\") === owner;\n } catch {\n return false;\n }\n });\n } catch {\n return false;\n }\n }\n if (lockModifiedAt === undefined || Date.now() - lockModifiedAt <= this.#staleLockMs) {\n return false;\n }\n try {\n if (fs.statSync(this.#lockPath).mtimeMs !== lockModifiedAt) return false;\n fs.rmSync(this.#lockPath, { recursive: true, force: true });\n return true;\n } catch {\n return false;\n }\n }\n\n #readGeneration(): number {\n try {\n const parsed: unknown = JSON.parse(fs.readFileSync(this.#generationPath, \"utf8\"));\n return typeof parsed === \"number\" && Number.isSafeInteger(parsed) && parsed >= 0 ? parsed : 0;\n } catch {\n return 0;\n }\n }\n\n #encodeCursor(generation: number, offset: number): number {\n const cursor = generation * CURSOR_OFFSET_BASE + offset;\n if (!Number.isSafeInteger(cursor) || cursor < 0) {\n throw new Error(\"Fabric mesh cursor exhausted its safe integer range\");\n }\n return cursor;\n }\n\n #decodeCursor(cursor: number): { generation: number; offset: number } {\n if (!Number.isSafeInteger(cursor) || cursor < 0) return { generation: -1, offset: 0 };\n return {\n generation: Math.floor(cursor / CURSOR_OFFSET_BASE),\n offset: cursor % CURSOR_OFFSET_BASE,\n };\n }\n\n #compactEventLog(): void {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n if (size <= this.#maxEventLogBytes) return;\n const readBytes = Math.min(\n size,\n this.#retainedEventLogBytes + this.maxEventBytes + 1,\n );\n const buffer = Buffer.allocUnsafe(readBytes);\n const bytesRead = fs.readSync(descriptor, buffer, 0, readBytes, size - readBytes);\n const captured = buffer.subarray(0, bytesRead);\n const retentionBoundary = Math.max(0, captured.length - this.#retainedEventLogBytes);\n const newline = retentionBoundary === 0 ? -1 : captured.indexOf(0x0a, retentionBoundary);\n const retainedStart = retentionBoundary === 0 ? 0 : newline >= 0 ? newline + 1 : captured.length;\n const retained = captured.subarray(retainedStart);\n fs.closeSync(descriptor);\n descriptor = undefined;\n const temporaryPath =\n this.#eventsPath + \".\" + process.pid + \".\" + randomUUID() + \".tmp\";\n try {\n fs.writeFileSync(temporaryPath, retained, { mode: 0o600 });\n fs.renameSync(temporaryPath, this.#eventsPath);\n } finally {\n try { fs.rmSync(temporaryPath, { force: true }); } catch {}\n }\n atomicWrite(this.#generationPath, this.#readGeneration() + 1);\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #repairEventLog(): void {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r+\");\n const size = fs.fstatSync(descriptor).size;\n if (size === 0) return;\n const lastByte = Buffer.allocUnsafe(1);\n fs.readSync(descriptor, lastByte, 0, 1, size - 1);\n if (lastByte[0] === 0x0a) return;\n const readBytes = Math.min(size, this.maxEventBytes + 1);\n const tail = Buffer.allocUnsafe(readBytes);\n fs.readSync(descriptor, tail, 0, readBytes, size - readBytes);\n const newline = tail.lastIndexOf(0x0a);\n fs.ftruncateSync(descriptor, newline >= 0 ? size - readBytes + newline + 1 : 0);\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #readLastEventSequence(): number {\n let descriptor: number | undefined;\n try {\n descriptor = fs.openSync(this.#eventsPath, \"r\");\n const size = fs.fstatSync(descriptor).size;\n if (size === 0) return 0;\n const readBytes = Math.min(size, this.maxEventBytes + 1);\n const tail = Buffer.allocUnsafe(readBytes);\n fs.readSync(descriptor, tail, 0, readBytes, size - readBytes);\n const lines = tail.toString(\"utf8\").trim().split(\"\\n\");\n for (let index = lines.length - 1; index >= 0; index--) {\n const line = lines[index];\n if (!line) continue;\n try {\n const parsed = JSON.parse(line) as { sequence?: unknown };\n if (typeof parsed.sequence === \"number\" && Number.isSafeInteger(parsed.sequence)) {\n return parsed.sequence;\n }\n } catch { /* skip malformed sequence line */ }\n }\n return 0;\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return 0;\n throw error;\n } finally {\n if (descriptor !== undefined) fs.closeSync(descriptor);\n }\n }\n\n #readSequence(): number {\n try {\n const parsed: unknown = JSON.parse(fs.readFileSync(this.#counterPath, \"utf8\"));\n return typeof parsed === \"number\" && Number.isSafeInteger(parsed) && parsed >= 0 ? parsed : 0;\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return 0;\n return 0;\n }\n }\n\n #validateTopic(topic: string): void {\n validateMeshTopic(topic);\n }\n\n #validateKey(key: string): void {\n const unsafeSegment = key\n .split(/[/:]/)\n .some(\n (segment) =>\n segment === \"__proto__\" || segment === \"prototype\" || segment === \"constructor\",\n );\n if (!KEY_PATTERN.test(key) || unsafeSegment) {\n throw new Error(`Invalid Fabric mesh key: ${key}`);\n }\n }\n}\n", "// Generated by scripts/verified-kernels.ts from proofs/storage.ts with gdp-wired@0.30.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\n\nexport const storageTransition = /* @__PURE__ */ (() => {\n// Generated from the machine storage transition. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.plan\": 0, \"out.key\": 0, \"out.value\": 0, \"out.identity\": 0, \"out.version\": 0, \"out.highWater\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"key\": $n(input[\"key\"], \"input key\"), \"any\": $n(input[\"any\"], \"input any\"), \"expected\": $n(input[\"expected\"], \"input expected\"), \"put\": $n(input[\"put\"], \"input put\"), \"value\": $n(input[\"value\"], \"input value\"), \"identity\": $n(input[\"identity\"], \"input identity\"), \"present\": $n(input[\"present\"], \"input present\"), \"version\": $n(input[\"version\"], \"input version\"), \"highWater\": $n(input[\"highWater\"], \"input highWater\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"any\"] <= 1) && (env[\"put\"] <= 1) && (env[\"present\"] <= 1))) throw new RangeError(\"storage transition: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.plan\": ((!((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"]))) ? 0 : (((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1))) ? 2 : ((!((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? 1 : ((env[\"put\"] === 1) ? 3 : 4)))), \"out.key\": ((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? env[\"key\"] : 0), \"out.value\": (((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) && (env[\"put\"] === 1)) ? env[\"value\"] : 0), \"out.identity\": (((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) && (env[\"put\"] === 1)) ? env[\"identity\"] : 0), \"out.version\": ((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? $x(((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) + 1) : 0), \"out.highWater\": ((((env[\"any\"] === 1) || (env[\"expected\"] === env[\"version\"])) && (!((!(env[\"put\"] === 1)) && (!(env[\"present\"] === 1)))) && ((((env[\"put\"] === 1) ? ((env[\"present\"] === 1) ? env[\"version\"] : env[\"highWater\"]) : env[\"version\"]) < 9007199254740991) && (env[\"highWater\"] < 9007199254740991))) ? $x(env[\"highWater\"] + 1) : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { Interner, bit } from \"./machine.js\";\nimport { storageTransition } from \"./generated/storage.js\";\nimport type { MeshIdentity } from \"../mesh/store.js\";\n\nconst PLANS = [\"Conflict\", \"Exhausted\", \"Unchanged\", \"PutNext\", \"DeleteNext\"] as const;\n\nexport const storageRevision = (value: unknown): number => {\n if (typeof value !== \"number\" || !Number.isSafeInteger(value) || value < 0) {\n throw new Error(\"Invalid Fabric mesh revision: expected a nonnegative safe integer\");\n }\n return value;\n};\n\nconst serialize = (value: unknown): string => {\n const json = JSON.stringify(value);\n if (json === undefined) throw new Error(\"Mesh values must be JSON-serializable\");\n return json;\n};\n\nexport type StorageTransition =\n | { kind: \"put\"; key: string; value: unknown; identity: MeshIdentity; version: number; highWater: number }\n | { kind: \"delete\"; key: string; version: number; highWater: number }\n | { kind: \"unchanged\" };\n\nexport interface CapturedStorageRequest {\n readonly key: string;\n readonly transition: (present: boolean, actualVersion: number, highWater: number) => StorageTransition;\n}\n\nconst capture = (\n key: string,\n ifVersion: number | undefined,\n payload?: { value: string; identity: string },\n): CapturedStorageRequest => {\n const expected = ifVersion === undefined ? undefined : storageRevision(ifVersion);\n // The JSON strings never escape this closure. Caller-owned objects (including\n // nested identity/value) are not retained across lock wait.\n return Object.freeze({\n key,\n transition(present: boolean, actualVersion: number, highWater: number): StorageTransition {\n const actual = storageRevision(actualVersion);\n const clock = storageRevision(highWater);\n if (clock < actual) throw new Error(\"Inconsistent Fabric mesh high-water revision\");\n // Ids start at 1, so a forwarded 0 can never name a string.\n const names = new Interner(1);\n const out = storageTransition.step({}, storageTransition.init({}), {\n key: names.id(key), any: bit(expected === undefined), expected: expected ?? 0,\n put: bit(payload !== undefined), value: names.id(payload?.value ?? \"\"), identity: names.id(payload?.identity ?? \"\"),\n present: bit(present), version: actual, highWater: clock,\n }).scalars;\n // Representation conversion only; CAS, overflow and successor decisions are\n // performed by the executable proved reducer, not reproduced here.\n const plan = PLANS[out[\"out.plan\"]!];\n switch (plan) {\n case \"Conflict\":\n throw new Error(`Mesh compare-and-swap failed for ${key}: expected version ${expected}, found ${actual}`);\n case \"Exhausted\":\n throw new Error(`Fabric mesh revision exhausted for ${key}`);\n case \"Unchanged\":\n return { kind: \"unchanged\" };\n case \"PutNext\":\n return {\n kind: \"put\", key: names.name(out[\"out.key\"]!), value: JSON.parse(names.name(out[\"out.value\"]!)),\n identity: JSON.parse(names.name(out[\"out.identity\"]!)) as MeshIdentity,\n version: storageRevision(out[\"out.version\"]), highWater: storageRevision(out[\"out.highWater\"]),\n };\n case \"DeleteNext\":\n return { kind: \"delete\", key: names.name(out[\"out.key\"]!), version: storageRevision(out[\"out.version\"]), highWater: storageRevision(out[\"out.highWater\"]) };\n default:\n throw new Error(\"Invalid verified storage plan\");\n }\n },\n });\n};\n\nexport const captureStoragePut = (input: {\n key: string; ifVersion?: number | undefined; value: unknown; identity: MeshIdentity;\n}, maxValueBytes = Number.POSITIVE_INFINITY): CapturedStorageRequest => {\n const { key, ifVersion, value, identity } = input;\n // Capture scalars before serialization can invoke user-defined toJSON hooks.\n if (ifVersion !== undefined) storageRevision(ifVersion);\n const identityJson = serialize(identity);\n const valueJson = serialize(value);\n if (Buffer.byteLength(valueJson, \"utf8\") > maxValueBytes) {\n throw new Error(`Mesh state value exceeds ${maxValueBytes} bytes`);\n }\n return capture(key, ifVersion, { value: valueJson, identity: identityJson });\n};\n\nexport const captureStorageDelete = (input: {\n key: string; ifVersion?: number | undefined;\n}): CapturedStorageRequest => {\n const { key, ifVersion } = input;\n return capture(key, ifVersion);\n};\n"],
|
|
5
5
|
"mappings": ";;;;;;;;;;;;;;;;;;;;AAAA,SAAS,kBAAkB;AAC3B,OAAO,QAAQ;AACf,OAAO,UAAU;;;ACDjB,SAAS,GAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AACzK,SAAS,GAAG,GAAG;AAAE,MAAI,IAAI,iBAAkB,OAAM,IAAI,WAAW,6FAA6F;AAAG,SAAO;AAAG;AAEnK,IAAM,oBAAqC,uBAAM;AAExD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,YAAY,GAAG,WAAW,GAAG,aAAa,GAAG,gBAAgB,GAAG,eAAe,GAAG,iBAAiB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EACnI;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC7e,QAAI,EAAG,IAAI,KAAK,KAAK,KAAO,IAAI,KAAK,KAAK,KAAO,IAAI,SAAS,KAAK,GAAK,OAAM,IAAI,WAAW,wGAAwG;AACrM,UAAM,UAAU,EAAC,GAAG,GAAG,YAAc,EAAG,IAAI,KAAK,MAAM,KAAO,IAAI,UAAU,MAAM,IAAI,SAAS,KAAO,IAAO,EAAE,IAAI,KAAK,MAAM,MAAQ,EAAE,IAAI,SAAS,MAAM,KAAO,IAAM,GAAK,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,oBAAsB,IAAI,WAAW,IAAI,oBAAsB,IAAM,IAAI,KAAK,MAAM,IAAK,IAAI,GAAO,YAAe,IAAI,KAAK,MAAM,KAAO,IAAI,UAAU,MAAM,IAAI,SAAS,MAAQ,EAAG,EAAE,IAAI,KAAK,MAAM,MAAQ,EAAE,IAAI,SAAS,MAAM,SAAa,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,oBAAsB,IAAI,WAAW,IAAI,oBAAsB,IAAI,KAAK,IAAI,GAAI,cAAkB,IAAI,KAAK,MAAM,KAAO,IAAI,UAAU,MAAM,IAAI,SAAS,MAAQ,EAAG,EAAE,IAAI,KAAK,MAAM,MAAQ,EAAE,IAAI,SAAS,MAAM,SAAa,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,oBAAsB,IAAI,WAAW,IAAI,qBAAwB,IAAI,KAAK,MAAM,IAAM,IAAI,OAAO,IAAI,GAAI,iBAAqB,IAAI,KAAK,MAAM,KAAO,IAAI,UAAU,MAAM,IAAI,SAAS,MAAQ,EAAG,EAAE,IAAI,KAAK,MAAM,MAAQ,EAAE,IAAI,SAAS,MAAM,SAAa,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,oBAAsB,IAAI,WAAW,IAAI,qBAAwB,IAAI,KAAK,MAAM,IAAM,IAAI,UAAU,IAAI,GAAI,gBAAmB,IAAI,KAAK,MAAM,KAAO,IAAI,UAAU,MAAM,IAAI,SAAS,MAAQ,EAAG,EAAE,IAAI,KAAK,MAAM,MAAQ,EAAE,IAAI,SAAS,MAAM,SAAa,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,oBAAsB,IAAI,WAAW,IAAI,oBAAsB,IAAK,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,CAAC,IAAI,GAAI,kBAAqB,IAAI,KAAK,MAAM,KAAO,IAAI,UAAU,MAAM,IAAI,SAAS,MAAQ,EAAG,EAAE,IAAI,KAAK,MAAM,MAAQ,EAAE,IAAI,SAAS,MAAM,SAAa,IAAI,KAAK,MAAM,IAAO,IAAI,SAAS,MAAM,IAAK,IAAI,SAAS,IAAI,IAAI,WAAW,IAAK,IAAI,SAAS,KAAK,oBAAsB,IAAI,WAAW,IAAI,oBAAsB,GAAG,IAAI,WAAW,IAAI,CAAC,IAAI,EAAE;AACjnE,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;;;ACbH,IAAM,QAAQ,CAAC,YAAY,aAAa,aAAa,WAAW,YAAY;AAErE,IAAM,kBAAkB,CAAC,UAA2B;AACzD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC1E,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,SAAO;AACT;AAEA,IAAM,YAAY,CAAC,UAA2B;AAC5C,QAAM,OAAO,KAAK,UAAU,KAAK;AACjC,MAAI,SAAS,OAAW,OAAM,IAAI,MAAM,uCAAuC;AAC/E,SAAO;AACT;AAYA,IAAM,UAAU,CACd,KACA,WACA,YAC2B;AAC3B,QAAM,WAAW,cAAc,SAAY,SAAY,gBAAgB,SAAS;AAGhF,SAAO,OAAO,OAAO;AAAA,IACnB;AAAA,IACA,WAAW,SAAkB,eAAuB,WAAsC;AACxF,YAAM,SAAS,gBAAgB,aAAa;AAC5C,YAAM,QAAQ,gBAAgB,SAAS;AACvC,UAAI,QAAQ,OAAQ,OAAM,IAAI,MAAM,8CAA8C;AAElF,YAAM,QAAQ,IAAI,SAAS,CAAC;AAC5B,YAAM,MAAM,kBAAkB,KAAK,CAAC,GAAG,kBAAkB,KAAK,CAAC,CAAC,GAAG;AAAA,QACjE,KAAK,MAAM,GAAG,GAAG;AAAA,QAAG,KAAK,IAAI,aAAa,MAAS;AAAA,QAAG,UAAU,YAAY;AAAA,QAC5E,KAAK,IAAI,YAAY,MAAS;AAAA,QAAG,OAAO,MAAM,GAAG,SAAS,SAAS,EAAE;AAAA,QAAG,UAAU,MAAM,GAAG,SAAS,YAAY,EAAE;AAAA,QAClH,SAAS,IAAI,OAAO;AAAA,QAAG,SAAS;AAAA,QAAQ,WAAW;AAAA,MACrD,CAAC,EAAE;AAGH,YAAM,OAAO,MAAM,IAAI,UAAU,CAAE;AACnC,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH,gBAAM,IAAI,MAAM,oCAAoC,GAAG,sBAAsB,QAAQ,WAAW,MAAM,EAAE;AAAA,QAC1G,KAAK;AACH,gBAAM,IAAI,MAAM,sCAAsC,GAAG,EAAE;AAAA,QAC7D,KAAK;AACH,iBAAO,EAAE,MAAM,YAAY;AAAA,QAC7B,KAAK;AACH,iBAAO;AAAA,YACL,MAAM;AAAA,YAAO,KAAK,MAAM,KAAK,IAAI,SAAS,CAAE;AAAA,YAAG,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI,WAAW,CAAE,CAAC;AAAA,YAC9F,UAAU,KAAK,MAAM,MAAM,KAAK,IAAI,cAAc,CAAE,CAAC;AAAA,YACrD,SAAS,gBAAgB,IAAI,aAAa,CAAC;AAAA,YAAG,WAAW,gBAAgB,IAAI,eAAe,CAAC;AAAA,UAC/F;AAAA,QACF,KAAK;AACH,iBAAO,EAAE,MAAM,UAAU,KAAK,MAAM,KAAK,IAAI,SAAS,CAAE,GAAG,SAAS,gBAAgB,IAAI,aAAa,CAAC,GAAG,WAAW,gBAAgB,IAAI,eAAe,CAAC,EAAE;AAAA,QAC5J;AACE,gBAAM,IAAI,MAAM,+BAA+B;AAAA,MACnD;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEO,IAAM,oBAAoB,CAAC,OAE/B,gBAAgB,OAAO,sBAA8C;AACtE,QAAM,EAAE,KAAK,WAAW,OAAO,SAAS,IAAI;AAE5C,MAAI,cAAc,OAAW,iBAAgB,SAAS;AACtD,QAAM,eAAe,UAAU,QAAQ;AACvC,QAAM,YAAY,UAAU,KAAK;AACjC,MAAI,OAAO,WAAW,WAAW,MAAM,IAAI,eAAe;AACxD,UAAM,IAAI,MAAM,4BAA4B,aAAa,QAAQ;AAAA,EACnE;AACA,SAAO,QAAQ,KAAK,WAAW,EAAE,OAAO,WAAW,UAAU,aAAa,CAAC;AAC7E;AAEO,IAAM,uBAAuB,CAAC,UAEP;AAC5B,QAAM,EAAE,KAAK,UAAU,IAAI;AAC3B,SAAO,QAAQ,KAAK,SAAS;AAC/B;;;AFoBA,IAAM,gBAAgB;AACtB,IAAM,cAAc;AAEb,IAAM,oBAAoB,CAAC,UAAwB;AACxD,MAAI,CAAC,cAAc,KAAK,KAAK,EAAG,OAAM,IAAI,MAAM,8BAA8B,KAAK,EAAE;AACvF;AACA,IAAM,kBAAkB;AACxB,IAAM,gBAAgB;AACtB,IAAM,8BAA8B,KAAK,OAAO;AAChD,IAAM,mCAAmC,KAAK,OAAO;AACrD,IAAM,0BAA0B,KAAK,OAAO;AAC5C,IAAM,+BAA+B;AACrC,IAAM,wBAAwB,IAAI,OAAO;AACzC,IAAM,yBAAyB,KAAK;AACpC,IAAM,qBAAqB,KAAK;AACzB,IAAM,6BAA6B;AACnC,IAAM,6BAA6B,MAAM,KAAK,KAAK,KAAK;AAC/D,IAAM,0BAA0B,KAAK,OAAO;AAC5C,IAAM,uBAAuB;AAE7B,IAAM,QAAQ,CAAC,iBACb,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,YAAY,CAAC;AAE5D,IAAM,YAAY,CAAC,UACjB,iBAAiB,SAAS,UAAU,SAAS,OAAO,MAAM,SAAS,WAC/D,MAAM,OACN;AAEN,IAAM,eAAe,CAAC,QAAyB;AAC7C,MAAI,CAAC,OAAO,cAAc,GAAG,KAAK,OAAO,EAAG,QAAO;AACnD,MAAI;AACF,YAAQ,KAAK,KAAK,CAAC;AACnB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,YAAY,CAAI,UAAgB;AACpC,QAAM,aAAa,KAAK,UAAU,KAAK;AACvC,MAAI,eAAe,OAAW,OAAM,IAAI,MAAM,uCAAuC;AACrF,SAAO,KAAK,MAAM,UAAU;AAC9B;AAEA,IAAM,kBAAkB,CAAC,UAA2C;AAClE,MACE,OAAO,UAAU,YACjB,UAAU,QACV,MAAM,QAAQ,KAAK,KACnB,CAAC,CAAC,GAAG,CAAC,EAAE,SAAU,MAA+B,MAAgB,GACjE;AACA,WAAO;AAAA,EACT;AACA,QAAM,UAAW,MAAgC;AACjD,SAAO,OAAO,YAAY,YAAY,YAAY,QAAQ,CAAC,MAAM,QAAQ,OAAO;AAClF;AAEA,IAAM,2BAA2B,CAAC,eAAkD;AAClF,QAAM,YAA6B,CAAC;AACpC,MAAI,YAAY;AAChB,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI,UAAU;AAEd,WAAS,QAAQ,GAAG,QAAQ,WAAW,QAAQ,SAAS,GAAG;AACzD,UAAM,YAAY,WAAW,KAAK;AAClC,QAAI,QAAQ,GAAG;AACb,UAAI,KAAK,KAAK,SAAS,EAAG;AAC1B,UAAI,cAAc,IAAK,QAAO;AAC9B,cAAQ;AACR,cAAQ;AACR;AAAA,IACF;AACA,QAAI,UAAU;AACZ,UAAI,QAAS,WAAU;AAAA,eACd,cAAc,KAAM,WAAU;AAAA,eAC9B,cAAc,IAAK,YAAW;AACvC;AAAA,IACF;AACA,QAAI,cAAc,IAAK,YAAW;AAAA,aACzB,cAAc,IAAK,UAAS;AAAA,aAC5B,cAAc,KAAK;AAC1B,eAAS;AACT,UAAI,UAAU,EAAG;AACjB,UAAI;AACF,cAAM,SAAkB,KAAK,MAAM,WAAW,MAAM,OAAO,QAAQ,CAAC,CAAC;AACrE,qBAAa;AACb,YAAI,gBAAgB,MAAM,EAAG,WAAU,KAAK,MAAM;AAAA,MACpD,QAAQ;AACN,eAAO;AAAA,MACT;AACA,cAAQ;AAAA,IACV;AAAA,EACF;AAEA,SAAO,QAAQ,KAAK,YAAY,IAAI,UAAU,GAAG,EAAE,IAAI;AACzD;AAEA,IAAM,mBAAmB,CAAC,MAAoB,UAC5C,KAAK,QAAQ,MAAM,SAAS,KAAK,YAAY,MAAM,aAAa,KAAK,GAAG,cAAc,MAAM,EAAE;AAEhG,IAAM,iBAAiB,CAAC,UAA0C;AAChE,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,EAAG,QAAO;AAChF,QAAM,QAAQ;AACd,SAAO,OAAO,MAAM,OAAO,YAAY,OAAO,MAAM,UAAU,YAC5D,OAAO,MAAM,SAAS,YAAY,OAAO,MAAM,SAAS,YAAY,MAAM,SAAS,QACnF,OAAO,cAAc,MAAM,KAAK,KAAK,OAAO,cAAc,MAAM,SAAS,MACxE,MAAM,QAAQ,UAAa,OAAO,MAAM,QAAQ;AACrD;AAEA,IAAM,aAAa,OAAsB,EAAE,QAAQ,GAAG,gBAAgB,GAAG,SAAS,CAAC,GAAG,WAAW,EAAE;AAEnG,IAAM,YAAY,CAAC,UAAkB,UAAkB,gBAAgB,SAAwB;AAC7F,MAAI;AACJ,MAAI;AACF,UAAM,OAAO,GAAG,SAAS,QAAQ;AACjC,QAAI,KAAK,OAAO,SAAU,OAAM,IAAI,MAAM,iBAAiB,QAAQ,QAAQ;AAC3E,QAAI,KAAK,SAAS,KAAK,cAAe,QAAO,WAAW;AACxD,iBAAa,GAAG,aAAa,UAAU,MAAM;AAAA,EAC/C,SAAS,OAAO;AACd,QAAI,UAAU,KAAK,MAAM,SAAU,QAAO,WAAW;AACrD,UAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,UAAM,IAAI,MAAM,qCAAqC,OAAO,EAAE;AAAA,EAChE;AACA,MAAI,CAAC,WAAW,KAAK,KAAK,cAAe,QAAO,WAAW;AAC3D,MAAI;AACF,UAAM,SAAkB,KAAK,MAAM,UAAU;AAC7C,QAAI,gBAAgB,MAAM,EAAG,QAAO;AACpC,UAAM,IAAI,MAAM,sBAAsB;AAAA,EACxC,SAAS,OAAO;AAGd,UAAM,YAAY,yBAAyB,UAAU;AACrD,QAAI,UAAW,QAAO;AACtB,QAAI,CAAC,cAAe,OAAM,IAAI,MAAM,wDAAwD;AAE5F,WAAO,WAAW;AAAA,EACpB;AACF;AAEA,IAAM,cAAc,CAAC,UAAkB,OAAgB,WAAW,OAAO,sBAA4B;AACnG,QAAM,aAAa,KAAK,UAAU,OAAO,MAAM,CAAC;AAChD,MAAI,OAAO,WAAW,YAAY,MAAM,IAAI,UAAU;AACpD,UAAM,IAAI,MAAM,6BAA6B,QAAQ,QAAQ;AAAA,EAC/D;AACA,kBAAgB,UAAU,UAAU;AACtC;AAKA,IAAM,YAAY,CAAC,OAAsB,QAEpC;AACH,MAAI,MAAM,aAAa,WAClB,OAAO,MAAM,aAAa,YAAY,MAAM,aAAa,QAAQ,MAAM,QAAQ,MAAM,QAAQ,IAAI;AACpG,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AACA,MAAI,kBAAkB;AACtB,aAAW,YAAY,OAAO,OAAO,MAAM,YAAY,CAAC,CAAC,GAAG;AAC1D,sBAAkB,KAAK,IAAI,iBAAiB,gBAAgB,QAAQ,CAAC;AAAA,EACvE;AACA,aAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,OAAO,GAAG;AAC7D,QAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,UAAU;AACzE,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAMA,WAAU,gBAAgB,MAAM,OAAO;AAC7C,UAAM,WAAW,MAAM,aAAa,UAAa,OAAO,OAAO,MAAM,UAAU,QAAQ,IACnF,MAAM,SAAS,QAAQ,IAAI;AAC/B,QAAIA,aAAY,KAAM,aAAa,UAAa,aAAaA,UAAU;AACrE,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AACA,sBAAkB,KAAK,IAAI,iBAAiBA,QAAO;AAAA,EACrD;AAGA,MAAI,OAAO,OAAO,OAAO,gBAAgB,KAAK,MAAM,mBAAmB,GAAG;AACxE,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AACA,OAAK,MAAM,WAAW,KAAK,MAAM,mBAAmB,MAAM,CAAC,OAAO,OAAO,OAAO,WAAW,GAAG;AAC5F,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AACA,QAAM,YAAY,OAAO,OAAO,OAAO,WAAW,IAC9C,gBAAgB,MAAM,SAAS,IAAI;AACvC,MAAI,YAAY,gBAAiB,OAAM,IAAI,MAAM,8CAA8C;AAC/F,QAAM,UAAU,OAAO,OAAO,MAAM,SAAS,GAAG;AAChD,QAAM,UAAU,UAAU,MAAM,QAAQ,GAAG,EAAG,UAC1C,MAAM,aAAa,UAAa,OAAO,OAAO,MAAM,UAAU,GAAG,IAAI,MAAM,SAAS,GAAG,IAAK;AAChG,SAAO,EAAE,SAAS,SAAS,UAAU;AACvC;AAEA,IAAM,yBAAyB,CAAC,OAAsB,kBAAgC;AACpF,QAAM,aAAa,CAAC;AACpB,QAAM,cAAwB,CAAC;AAC/B,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,OAAO,MAAM,kBAAkB,CAAC,GAAG;AAC5C,QAAI,OAAO,OAAO,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,OAAO,MAAM,UAAU,GAAG,KAAK,KAAK,IAAI,GAAG,EAAG;AAC/F,SAAK,IAAI,GAAG;AACZ,gBAAY,KAAK,GAAG;AAAA,EACtB;AACA,aAAW,OAAO,OAAO,KAAK,MAAM,QAAQ,GAAG;AAC7C,QAAI,OAAO,OAAO,MAAM,SAAS,GAAG,KAAK,KAAK,IAAI,GAAG,EAAG;AACxD,SAAK,IAAI,GAAG;AACZ,gBAAY,KAAK,GAAG;AAAA,EACtB;AACA,QAAM,eAAe,YAAY,MAAM,CAAC,aAAa;AACrD,QAAM,WAAW,IAAI,IAAI,YAAY;AACrC,aAAW,OAAO,OAAO,KAAK,MAAM,QAAQ,GAAG;AAC7C,QAAI,CAAC,OAAO,OAAO,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,GAAG,EAAG,QAAO,MAAM,SAAS,GAAG;AAAA,EACzF;AACA,QAAM,iBAAiB;AACzB;AAEO,IAAM,YAAN,MAAgB;AAAA,EAoBrB,YACW,MACA,eACA,eACT,UAA4B,CAAC,GAC7B;AAJS;AACA;AACA;AAGT,SAAK,cAAc,KAAK,KAAK,MAAM,cAAc;AACjD,SAAK,aAAa,KAAK,KAAK,MAAM,YAAY;AAC9C,SAAK,eAAe,KAAK,KAAK,MAAM,UAAU;AAC9C,SAAK,kBAAkB,KAAK,KAAK,MAAM,YAAY;AACnD,SAAK,YAAY,KAAK,KAAK,MAAM,OAAO;AAGxC,SAAK,iBAAiB,KAAK,KAAK,MAAM,gBAAgB;AACtD,SAAK,oBAAoB,KAAK;AAAA,MAC5B,qBAAqB;AAAA,MACrB,KAAK,IAAI,gBAAgB,GAAG,KAAK,MAAM,QAAQ,oBAAoB,2BAA2B,CAAC;AAAA,IACjG;AACA,SAAK,yBAAyB,KAAK;AAAA,MACjC,KAAK,oBAAoB;AAAA,MACzB,KAAK;AAAA,QACH,gBAAgB;AAAA,QAChB,KAAK,MAAM,QAAQ,yBAAyB,gCAAgC;AAAA,MAC9E;AAAA,IACF;AACA,SAAK,iBAAiB,KAAK;AAAA,MACzB,gBAAgB;AAAA,MAChB,KAAK,MAAM,QAAQ,iBAAiB,uBAAuB;AAAA,IAC7D;AACA,SAAK,sBAAsB,KAAK;AAAA,MAC9B;AAAA,MACA,KAAK,MAAM,QAAQ,sBAAsB,4BAA4B;AAAA,IACvE;AACA,SAAK,iBAAiB,KAAK,IAAI,KAAK,KAAK,MAAM,QAAQ,iBAAiB,eAAe,CAAC;AACxF,SAAK,eAAe,KAAK,IAAI,KAAK,KAAK,MAAM,QAAQ,eAAe,aAAa,CAAC;AAClF,OAAG,UAAU,MAAM,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AAAA,EACrD;AAAA,EAvDS;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT;AAAA,EAGS;AAAA,EACT;AAAA,EA0CA,MAAM,QAAQ,OASS;AACrB,SAAK,eAAe,MAAM,KAAK;AAC/B,QAAI,MAAM,OAAO,UAAa,CAAC,MAAM,GAAG,KAAK,EAAG,OAAM,IAAI,MAAM,yBAAyB;AACzF,UAAM,YAAY,MAAM,SAAS,SAAY,SAAY,UAAU,MAAM,IAAI;AAC7E,UAAM,SAAS,MAAM,UAAU,cAAc;AAC7C,WAAO,KAAK,UAAU,MAAM;AAI1B,UAAI;AAAE,aAAK,kBAAkB,KAAK,IAAI,CAAC;AAAA,MAAG,QAAQ;AAAA,MAAqC;AACvF,aAAO,KAAK,cAAc,EAAE,GAAG,OAAO,GAAI,cAAc,SAAY,EAAE,MAAM,UAAU,IAAI,CAAC,GAAI,OAAO,CAAC;AAAA,IACzG,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,SAAY,WAA6E;AAC7F,WAAO,KAAK,UAAU,MAAM;AAC1B,UAAI;AAAE,aAAK,kBAAkB,KAAK,IAAI,CAAC;AAAA,MAAG,QAAQ;AAAA,MAAqC;AACvF,aAAO,UAAU,CAAC,UAAU;AAC1B,aAAK,eAAe,MAAM,KAAK;AAC/B,eAAO,KAAK,cAAc,KAAK;AAAA,MACjC,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAAA,EAEA,cAAc,OAAmC;AAC/C,SAAK,gBAAgB;AACrB,UAAM,WAAW,KAAK,IAAI,KAAK,cAAc,GAAG,KAAK,uBAAuB,CAAC,IAAI;AACjF,UAAM,QAAmB;AAAA,MACvB,IAAI,MAAM,MAAM,WAAW;AAAA,MAC3B;AAAA,MACA,OAAO,MAAM;AAAA,MACb,MAAM,MAAM,MAAM,KAAK,KAAK;AAAA,MAC5B,MAAM,UAAU,MAAM,IAAI;AAAA,MAC1B,GAAI,MAAM,KAAK,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,MACnC,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;AAAA,MACvD,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,UAAU,MAAM,IAAI,EAAE,IAAI,CAAC;AAAA,MAClE,WAAW,KAAK,IAAI;AAAA,MACpB,GAAI,MAAM,SAAS,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;AAAA,MAC/C,GAAI,MAAM,YAAY,EAAE,WAAW,KAAc,IAAI,CAAC;AAAA,MACtD,GAAI,MAAM,UAAU,EAAE,SAAS,MAAM,QAAQ,IAAI,CAAC;AAAA,MAClD,GAAI,MAAM,YAAY,EAAE,WAAW,EAAE,GAAG,MAAM,UAAU,EAAE,IAAI,CAAC;AAAA,MAC/D,GAAI,MAAM,SAAS,EAAE,QAAQ,UAAU,MAAM,MAAM,EAAE,IAAI,CAAC;AAAA,IAC5D;AACA,UAAM,OAAO,KAAK,UAAU,KAAK;AACjC,UAAM,QAAQ,KAAK,IAAI,KAAK,eAAe,MAAM,iBAAiB,KAAK,aAAa;AACpF,QAAI,OAAO,WAAW,MAAM,MAAM,IAAI,OAAO;AAC3C,YAAM,IAAI,MAAM,sBAAsB,KAAK,QAAQ;AAAA,IACrD;AACA,OAAG,eAAe,KAAK,aAAa,GAAG,IAAI;AAAA,GAAM,EAAE,UAAU,QAAQ,MAAM,IAAM,CAAC;AAClF,gBAAY,KAAK,cAAc,QAAQ;AACvC,SAAK,iBAAiB;AACtB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,SAAS,OASZ,MAAM,KAAK,IAAI,GAA0B;AAC1C,SAAK,eAAe,MAAM,KAAK;AAC/B,QAAI,MAAM,OAAO,UAAa,CAAC,MAAM,GAAG,KAAK,EAAG,OAAM,IAAI,MAAM,yBAAyB;AACzF,QAAI,MAAM,QAAQ,UAAa,CAAC,qBAAqB,KAAK,MAAM,GAAG,GAAG;AACpE,YAAM,IAAI,MAAM,qCAAqC,MAAM,GAAG,EAAE;AAAA,IAClE;AACA,QAAI,CAAC,OAAO,cAAc,MAAM,KAAK,KAAK,MAAM,QAAQ,GAAG;AACzD,YAAM,IAAI,MAAM,wEAAwE;AAAA,IAC1F;AACA,QAAI,MAAM,QAAQ,MAAM,4BAA4B;AAClD,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAChE;AACA,UAAM,WAAyB;AAAA,MAC7B,IAAI,WAAW;AAAA,MACf,GAAI,MAAM,QAAQ,SAAY,EAAE,KAAK,MAAM,IAAI,IAAI,CAAC;AAAA,MACpD,OAAO,MAAM;AAAA,MACb,MAAM,MAAM,MAAM,KAAK,KAAK;AAAA,MAC5B,MAAM,UAAU,MAAM,IAAI;AAAA,MAC1B,GAAI,MAAM,KAAK,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,MACnC,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;AAAA,MACvD,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,UAAU,MAAM,IAAI,EAAE,IAAI,CAAC;AAAA,MAClE,OAAO,MAAM;AAAA,MACb,WAAW;AAAA,MACX,QAAQ,cAAc;AAAA,IACxB;AAEA,UAAM,WAAsB;AAAA,MAC1B,IAAI,SAAS;AAAA,MAAI,UAAU,OAAO;AAAA,MAAkB,OAAO,SAAS;AAAA,MAAO,MAAM,SAAS;AAAA,MAC1F,MAAM,SAAS;AAAA,MAAM,GAAI,SAAS,KAAK,EAAE,IAAI,SAAS,GAAG,IAAI,CAAC;AAAA,MAC9D,GAAI,SAAS,SAAS,SAAY,EAAE,MAAM,SAAS,KAAK,IAAI,CAAC;AAAA,MAC7D,GAAI,SAAS,SAAS,SAAY,EAAE,MAAM,SAAS,KAAK,IAAI,CAAC;AAAA,MAC7D,WAAW,OAAO;AAAA,MAClB,WAAW,EAAE,OAAO,SAAS,OAAO,GAAI,SAAS,QAAQ,SAAY,EAAE,KAAK,SAAS,IAAI,IAAI,CAAC,EAAG;AAAA,MACjG,GAAI,SAAS,SAAS,EAAE,QAAQ,SAAS,OAAO,IAAI,CAAC;AAAA,IACvD;AACA,QAAI,OAAO,WAAW,KAAK,UAAU,QAAQ,GAAG,MAAM,IAAI,KAAK,eAAe;AAC5E,YAAM,IAAI,MAAM,sBAAsB,KAAK,aAAa,QAAQ;AAAA,IAClE;AACA,WAAO,KAAK,UAAU,MAAM;AAC1B,YAAM,OAAO,KAAK,eAAe,KAAK;AACtC,YAAM,UAAU,KAAK,UAAU,OAAO,CAAC,UAAU,MAAM,QAAQ,UAAa,MAAM,QAAQ,MAAM,GAAG;AACnG,UAAI,QAAQ,UAAU,4BAA4B;AAChD,cAAM,IAAI,MAAM,WAAW,0BAA0B,gCAAgC;AAAA,MACvF;AACA,cAAQ,KAAK,QAAQ;AACrB,WAAK,gBAAgB,OAAO;AAC5B,WAAK,kBAAkB,GAAG;AAC1B,aAAO,UAAU,QAAQ;AAAA,IAC3B,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,WAAW,KAA4C;AAC3D,QAAI,CAAC,qBAAqB,KAAK,GAAG,EAAG,OAAM,IAAI,MAAM,qCAAqC,GAAG,EAAE;AAC/F,WAAO,KAAK,UAAU,MAAM;AAC1B,YAAM,OAAO,KAAK,eAAe,KAAK;AACtC,YAAM,UAAU,KAAK,UAAU,OAAO,CAAC,UAAU,MAAM,QAAQ,GAAG;AAClE,UAAI,QAAQ,WAAW,KAAK,UAAU,OAAQ,QAAO,EAAE,SAAS,MAAM;AACtE,WAAK,gBAAgB,OAAO;AAC5B,aAAO,EAAE,SAAS,KAAK;AAAA,IACzB,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,UAAU,QAA4C,CAAC,GAAmB;AACxE,QAAI,MAAM,UAAU,OAAW,MAAK,eAAe,MAAM,KAAK;AAC9D,UAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,MAAM,MAAM,SAAS,GAAG,GAAG,0BAA0B,CAAC;AAC9F,WAAO,KAAK,eAAe,IAAI,EAAE,UAC9B,OAAO,CAAC,UAAU,MAAM,UAAU,UAAa,MAAM,UAAU,MAAM,KAAK,EAC1E,KAAK,gBAAgB,EACrB,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,UAAU,UAAU,KAAK,CAAC;AAAA,EACpC;AAAA;AAAA,EAGA,oBAAwC;AACtC,QAAI;AACJ,eAAW,SAAS,KAAK,eAAe,IAAI,EAAE,WAAW;AACvD,UAAI,SAAS,UAAa,MAAM,QAAQ,KAAM,QAAO,MAAM;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,oBAAoB,MAAM,KAAK,IAAI,GAAyB;AAChE,UAAM,OAAO,KAAK,kBAAkB;AACpC,QAAI,SAAS,UAAa,OAAO,IAAK,QAAO,CAAC;AAC9C,WAAO,KAAK,UAAU,MAAM,KAAK,kBAAkB,GAAG,CAAC;AAAA,EACzD;AAAA,EAEA,kBAAkB,KAA0B;AAC1C,QAAI,CAAC,GAAG,WAAW,KAAK,cAAc,EAAG,QAAO,CAAC;AACjD,UAAM,OAAO,KAAK,eAAe,KAAK;AACtC,UAAM,MAAM,KAAK,UAAU,OAAO,CAAC,UAAU,MAAM,SAAS,GAAG,EAAE,KAAK,gBAAgB;AACtF,QAAI,IAAI,WAAW,EAAG,QAAO,CAAC;AAC9B,UAAM,WAAwB,CAAC;AAC/B,UAAM,cAAc,oBAAI,IAAY;AACpC,QAAI;AAGF,iBAAW,SAAS,KAAK;AACvB,iBAAS,KAAK,KAAK,cAAc;AAAA,UAC/B,IAAI,MAAM;AAAA,UACV,OAAO,MAAM;AAAA,UACb,MAAM,MAAM;AAAA,UACZ,MAAM,MAAM;AAAA,UACZ,GAAI,MAAM,KAAK,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC;AAAA,UACnC,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;AAAA,UACvD,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;AAAA,UACvD,WAAW,EAAE,OAAO,MAAM,OAAO,GAAI,MAAM,QAAQ,SAAY,EAAE,KAAK,MAAM,IAAI,IAAI,CAAC,EAAG;AAAA;AAAA,UAExF,GAAI,MAAM,SAAS,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;AAAA,QACjD,CAAC,CAAC;AACF,oBAAY,IAAI,MAAM,EAAE;AAAA,MAC1B;AAAA,IACF,UAAE;AACA,UAAI,YAAY,OAAO,GAAG;AACxB,aAAK,gBAAgB,KAAK,UAAU,OAAO,CAAC,UAAU,CAAC,YAAY,IAAI,MAAM,EAAE,CAAC,CAAC;AAAA,MACnF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,eAAe,SAAoC;AACjD,QAAI;AACJ,QAAI;AACF,aAAO,GAAG,SAAS,KAAK,cAAc;AAAA,IACxC,SAAS,OAAO;AACd,WAAK,iBAAiB;AACtB,UAAI,UAAU,KAAK,MAAM,SAAU,QAAO,EAAE,QAAQ,GAAG,WAAW,CAAC,EAAE;AACrE,YAAM;AAAA,IACR;AAEA,UAAM,SAAS,UAAU,KAAK,iBAAiB;AAC/C,QAAI,UAAU,OAAO,UAAU,KAAK,OAAO,OAAO,SAAS,KAAK,QAAQ,OAAO,eAAe,KAAK,SAAS;AAC1G,aAAO,OAAO,UAAU,SAAY,OAAO,OAAO,EAAE,QAAQ,GAAG,WAAW,CAAC,EAAE;AAAA,IAC/E;AACA,QAAI,OAAyB,EAAE,QAAQ,GAAG,WAAW,CAAC,EAAE;AACxD,QAAI;AACJ,QAAI;AACF,UAAI,KAAK,OAAO,wBAAyB,OAAM,IAAI,MAAM,WAAW,uBAAuB,QAAQ;AACnG,YAAM,SAAS,KAAK,MAAM,GAAG,aAAa,KAAK,gBAAgB,MAAM,CAAC;AACtE,UAAI,QAAQ,WAAW,KAAK,CAAC,MAAM,QAAQ,OAAO,SAAS,KAAK,CAAC,OAAO,UAAU,MAAM,cAAc,GAAG;AACvG,cAAM,IAAI,MAAM,gBAAgB;AAAA,MAClC;AACA,aAAO,EAAE,QAAQ,GAAG,WAAW,OAAO,UAAU;AAAA,IAClD,SAAS,OAAO;AACd,eAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,IAChE;AACA,SAAK,iBAAiB;AAAA,MACpB,OAAO,KAAK;AAAA,MAAK,MAAM,KAAK;AAAA,MAAM,YAAY,KAAK;AAAA,MAAS;AAAA,MAAM,GAAI,WAAW,SAAY,EAAE,OAAO,OAAO,IAAI,CAAC;AAAA,IACpH;AACA,QAAI,WAAW,OAAW,QAAO;AAEjC,QAAI,QAAS,QAAO,EAAE,QAAQ,GAAG,WAAW,CAAC,EAAE;AAC/C,UAAM,IAAI,MAAM,yCAAyC,MAAM,EAAE;AAAA,EACnE;AAAA,EAEA,gBAAgB,WAAiC;AAC/C,QAAI,UAAU,WAAW,GAAG;AAC1B,SAAG,OAAO,KAAK,gBAAgB,EAAE,OAAO,KAAK,CAAC;AAC9C,WAAK,iBAAiB;AACtB;AAAA,IACF;AACA,gBAAY,KAAK,gBAAgB,EAAE,QAAQ,GAAG,UAAU,GAAG,uBAAuB;AAClF,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEA,KACE,QAKI,CAAC,GACQ;AACb,QAAI,MAAM,UAAU,OAAW,MAAK,eAAe,MAAM,KAAK;AAC9D,UAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,MAAM,MAAM,SAAS,GAAG,GAAG,KAAK,aAAa,CAAC;AACtF,UAAM,SACJ,MAAM,UAAU,SACZ,KAAK,kBAAkB,OAAO,KAAK,IACnC,KAAK,iBAAiB,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,KAAK,CAAC,GAAG,OAAO,KAAK;AAC9E,WAAO,OAAO,IAAI,CAAC,UAAU,UAAU,KAAK,CAAC;AAAA,EAC/C;AAAA,EAEA,iBAAyB;AACvB,WAAO,KAAK,IAAI,KAAK,cAAc,GAAG,KAAK,uBAAuB,CAAC;AAAA,EACrE;AAAA,EAEA,eAAuB;AACrB,UAAM,aAAa,KAAK,gBAAgB;AACxC,QAAI;AACJ,QAAI,iBAAiB;AACrB,QAAI;AACF,mBAAa,GAAG,SAAS,KAAK,aAAa,GAAG;AAC9C,YAAM,OAAO,GAAG,UAAU,UAAU,EAAE;AACtC,UAAI,OAAO,GAAG;AACZ,cAAM,WAAW,OAAO,YAAY,CAAC;AACrC,WAAG,SAAS,YAAY,UAAU,GAAG,GAAG,OAAO,CAAC;AAChD,YAAI,SAAS,CAAC,MAAM,IAAM;AACxB,2BAAiB;AAAA,QACnB,OAAO;AACL,gBAAM,YAAY,KAAK,IAAI,MAAM,KAAK,gBAAgB,CAAC;AACvD,gBAAM,OAAO,OAAO,YAAY,SAAS;AACzC,aAAG,SAAS,YAAY,MAAM,GAAG,WAAW,OAAO,SAAS;AAC5D,gBAAM,UAAU,KAAK,YAAY,EAAI;AACrC,2BAAiB,WAAW,IAAI,OAAO,YAAY,UAAU,IAAI;AAAA,QACnE;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,OAAM;AAAA,IAC3C,UAAE;AACA,UAAI,eAAe,OAAW,IAAG,UAAU,UAAU;AAAA,IACvD;AACA,WAAO,KAAK,cAAc,YAAY,cAAc;AAAA,EACtD;AAAA,EAEA,KAAK,QAAgB,QAAQ,KAAqB;AAChD,UAAM,eAAe,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,MAAM,KAAK,GAAG,KAAK,aAAa,CAAC;AAChF,UAAM,aAAa,KAAK,gBAAgB;AACxC,UAAM,UAAU,KAAK,cAAc,MAAM;AACzC,QAAI;AACJ,QAAI;AACF,mBAAa,GAAG,SAAS,KAAK,aAAa,GAAG;AAC9C,YAAM,OAAO,GAAG,UAAU,UAAU,EAAE;AACtC,UAAI,WAAW,QAAQ,eAAe,aAAa,KAAK,IAAI,QAAQ,QAAQ,IAAI,IAAI;AACpF,UAAI,WAAW,GAAG;AAChB,cAAM,eAAe,OAAO,YAAY,CAAC;AACzC,WAAG,SAAS,YAAY,cAAc,GAAG,GAAG,WAAW,CAAC;AACxD,YAAI,aAAa,CAAC,MAAM,GAAM,YAAW;AAAA,MAC3C;AACA,UAAI,YAAY,MAAM;AACpB,eAAO,EAAE,QAAQ,CAAC,GAAG,YAAY,KAAK,cAAc,YAAY,QAAQ,EAAE;AAAA,MAC5E;AACA,YAAM,aAAa,KAAK;AAAA,QACtB,OAAO;AAAA,QACP,KAAK,IAAI,KAAK,gBAAgB,GAAG,qBAAqB;AAAA,MACxD;AACA,YAAM,SAAS,OAAO,YAAY,UAAU;AAC5C,YAAM,YAAY,GAAG,SAAS,YAAY,QAAQ,GAAG,YAAY,QAAQ;AACzE,YAAM,SAAsB,CAAC;AAC7B,UAAI,YAAY;AAChB,UAAI,WAAW;AACf,eAAS,QAAQ,GAAG,QAAQ,WAAW,SAAS;AAC9C,YAAI,OAAO,KAAK,MAAM,GAAM;AAC5B,cAAM,OAAO,OAAO,SAAS,WAAW,KAAK,EAAE,SAAS,MAAM,EAAE,KAAK;AACrE,oBAAY,QAAQ;AACpB,mBAAW;AACX,YAAI,MAAM;AACR,cAAI;AACF,kBAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,gBAAI,OAAO,MAAM,aAAa,SAAU,QAAO,KAAK,KAAK;AAAA,UAC3D,QAAQ;AAAA,UAAqC;AAAA,QAC/C;AACA,YAAI,OAAO,UAAU,aAAc;AAAA,MACrC;AACA,aAAO;AAAA,QACL,QAAQ,OAAO,IAAI,CAAC,UAAU,UAAU,KAAK,CAAC;AAAA,QAC9C,YAAY,KAAK,cAAc,YAAY,WAAW,QAAQ;AAAA,MAChE;AAAA,IACF,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,UAAU;AACjC,eAAO,EAAE,QAAQ,CAAC,GAAG,YAAY,KAAK,cAAc,YAAY,CAAC,EAAE;AAAA,MACrE;AACA,YAAM;AAAA,IACR,UAAE;AACA,UAAI,eAAe,OAAW,IAAG,UAAU,UAAU;AAAA,IACvD;AAAA,EACF;AAAA,EAEA,kBACE,OACA,OACa;AACb,QAAI,SAAsB,CAAC;AAC3B,QAAI;AACJ,WAAO,OAAO,SAAS,OAAO;AAC5B,YAAM,OAAO;AAAA,QACX,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA,QACA,KAAK,IAAI,KAAK,gBAAgB,GAAG,qBAAqB;AAAA,MACxD;AACA,YAAM,aAA0B,CAAC;AACjC,iBAAW,QAAQ,KAAK,OAAO;AAC7B,cAAM,SAAS,KAAK;AACpB,YAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,EAAG;AAC5E,cAAM,QAAQ;AACd,YAAI,OAAO,MAAM,aAAa,YAAY,CAAC,KAAK,cAAc,OAAO,KAAK,EAAG;AAC7E,mBAAW,KAAK,KAAK;AAAA,MACvB;AACA,eAAS,CAAC,GAAG,YAAY,GAAG,MAAM,EAAE,MAAM,CAAC,KAAK;AAChD,UAAI,CAAC,KAAK,WAAW,KAAK,WAAW,UAAa,KAAK,WAAW,OAAQ;AAC1E,eAAS,KAAK;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,iBACE,OACA,OACA,OACa;AACb,QAAI;AACJ,QAAI;AACF,mBAAa,GAAG,SAAS,KAAK,aAAa,GAAG;AAC9C,YAAM,OAAO,GAAG,UAAU,UAAU,EAAE;AACtC,YAAM,SAAsB,CAAC;AAC7B,UAAI,WAAW;AACf,UAAI,aAAuB,CAAC;AAC5B,UAAI,YAAY;AAChB,UAAI,wBAAwB;AAC5B,UAAI,eAAe;AAEnB,YAAM,WAAW,MAAY;AAC3B,YAAI,CAAC,yBAAyB,YAAY,GAAG;AAC3C,gBAAM,UAAU,OAAO,OAAO,YAAY,SAAS,EAAE,SAAS,MAAM;AACpE,gBAAM,OAAO,QAAQ,SAAS,OAAO,aAAa,EAAE,CAAC,IAAI,QAAQ,MAAM,GAAG,EAAE,IAAI;AAChF,cAAI;AACF,kBAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,gBACE,OAAO,MAAM,aAAa,YAC1B,MAAM,WAAW,SACjB,KAAK,cAAc,OAAO,KAAK,GAC/B;AACA,qBAAO,KAAK,KAAK;AACjB,6BAAe,OAAO,UAAU;AAAA,YAClC;AAAA,UACF,QAAQ;AAAA,UAAqC;AAAA,QAC/C;AACA,qBAAa,CAAC;AACd,oBAAY;AACZ,gCAAwB;AAAA,MAC1B;AAEA,aAAO,WAAW,QAAQ,CAAC,cAAc;AACvC,cAAM,aAAa,KAAK,IAAI,wBAAwB,OAAO,QAAQ;AACnE,cAAM,QAAQ,OAAO,YAAY,UAAU;AAC3C,cAAM,YAAY,GAAG,SAAS,YAAY,OAAO,GAAG,YAAY,QAAQ;AACxE,YAAI,aAAa,EAAG;AACpB,oBAAY;AACZ,cAAM,WAAW,MAAM,SAAS,GAAG,SAAS;AAC5C,YAAI,eAAe;AACnB,eAAO,eAAe,SAAS,UAAU,CAAC,cAAc;AACtD,gBAAM,UAAU,SAAS,QAAQ,IAAM,YAAY;AACnD,gBAAM,aAAa,UAAU,IAAI,SAAS,SAAS;AACnD,gBAAM,UAAU,SAAS,SAAS,cAAc,UAAU;AAC1D,cAAI,CAAC,uBAAuB;AAC1B,gBAAI,YAAY,QAAQ,UAAU,KAAK,eAAe;AACpD,kBAAI,QAAQ,SAAS,EAAG,YAAW,KAAK,OAAO;AAC/C,2BAAa,QAAQ;AAAA,YACvB,OAAO;AACL,2BAAa,CAAC;AACd,0BAAY;AACZ,sCAAwB;AAAA,YAC1B;AAAA,UACF;AACA,cAAI,UAAU,EAAG;AACjB,mBAAS;AACT,yBAAe,UAAU;AAAA,QAC3B;AAAA,MACF;AACA,UAAI,CAAC,iBAAiB,YAAY,KAAK,uBAAwB,UAAS;AACxE,aAAO;AAAA,IACT,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,QAAO,CAAC;AAC3C,YAAM;AAAA,IACR,UAAE;AACA,UAAI,eAAe,OAAW,IAAG,UAAU,UAAU;AAAA,IACvD;AAAA,EACF;AAAA,EAEA,cAAc,OAAkB,OAAiD;AAC/E,QAAI,MAAM,UAAU,UAAa,MAAM,UAAU,MAAM,MAAO,QAAO;AACrE,QAAI,MAAM,OAAO,UAAa,MAAM,OAAO,MAAM,GAAI,QAAO;AAC5D,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,KAAyC;AAC3C,SAAK,aAAa,GAAG;AACrB,UAAM,UAAU,KAAK,iBAAiB,EAAE;AACxC,WAAO,OAAO,OAAO,SAAS,GAAG,IAAI,UAAU,QAAQ,GAAG,CAAC,IAAI;AAAA,EACjE;AAAA,EAEA,KAAK,SAAS,IAAI,QAAQ,KAAuB;AAC/C,UAAM,eAAe,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,MAAM,KAAK,GAAG,KAAK,aAAa,CAAC;AAChF,WAAO,KAAK,QAAQ,MAAM,EAAE,MAAM,GAAG,YAAY;AAAA,EACnD;AAAA;AAAA,EAGA,QAAQ,SAAS,IAAsB;AACrC,QAAI,OAAQ,MAAK,aAAa,MAAM;AACpC,WAAO,OAAO,OAAO,KAAK,iBAAiB,EAAE,OAAO,EACjD,OAAO,CAAC,UAAU,CAAC,UAAU,MAAM,IAAI,WAAW,MAAM,CAAC,EACzD,KAAK,CAAC,MAAM,UAAU,KAAK,IAAI,cAAc,MAAM,GAAG,CAAC,EACvD,IAAI,CAAC,UAAU,UAAU,KAAK,CAAC;AAAA,EACpC;AAAA,EAEA,MAAM,IAAI,OAKkB;AAC1B,UAAM,EAAE,KAAK,OAAO,UAAU,UAAU,IAAI;AAC5C,SAAK,aAAa,GAAG;AACrB,UAAM,UAAU,kBAAkB,EAAE,KAAK,OAAO,UAAU,UAAU,GAAG,KAAK,aAAa;AACzF,WAAO,KAAK,UAAU,MAAM;AAC1B,YAAM,QAAQ,UAAU,KAAK,YAAY,KAAK,gBAAgB,KAAK;AACnE,YAAM,OAAO,UAAU,OAAO,QAAQ,GAAG;AACzC,YAAM,OAAO,QAAQ,WAAW,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS;AAC1E,UAAI,KAAK,SAAS,MAAO,OAAM,IAAI,MAAM,mCAAmC;AAC5E,YAAM,QAAwB;AAAA,QAC5B,KAAK,KAAK;AAAA,QACV,OAAO,KAAK;AAAA,QACZ,SAAS,KAAK;AAAA,QACd,WAAW,KAAK,IAAI;AAAA,QACpB,WAAW,KAAK;AAAA,MAClB;AACA,YAAM,QAAQ,KAAK,GAAG,IAAI;AAC1B,YAAM,aAAa,CAAC;AACpB,YAAM,SAAS,KAAK,GAAG,IAAI,KAAK;AAGhC,YAAM,SAAS;AACf,YAAM,iBAAiB;AACvB,YAAM,YAAY,KAAK;AACvB,YAAM,kBAAkB,MAAM,kBAAkB,CAAC,GAAG,OAAO,CAACC,SAAQA,SAAQ,KAAK,GAAG;AACpF,6BAAuB,OAAO,KAAK,mBAAmB;AACtD,kBAAY,KAAK,YAAY,OAAO,KAAK,cAAc;AACvD,WAAK,YAAY,KAAK;AACtB,aAAO,UAAU,KAAK;AAAA,IACxB,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,OAAO,OAGuC;AAClD,UAAM,EAAE,KAAK,UAAU,IAAI;AAC3B,SAAK,aAAa,GAAG;AACrB,UAAM,UAAU,qBAAqB,EAAE,KAAK,UAAU,CAAC;AACvD,WAAO,KAAK,UAAU,MAAM;AAC1B,YAAM,QAAQ,UAAU,KAAK,YAAY,KAAK,gBAAgB,KAAK;AACnE,YAAM,OAAO,UAAU,OAAO,QAAQ,GAAG;AACzC,YAAM,OAAO,QAAQ,WAAW,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS;AAC1E,UAAI,KAAK,SAAS,aAAa;AAC7B,aAAK,YAAY,KAAK;AACtB,eAAO,EAAE,SAAS,MAAM;AAAA,MAC1B;AACA,UAAI,KAAK,SAAS,SAAU,OAAM,IAAI,MAAM,sCAAsC;AAClF,aAAO,MAAM,QAAQ,KAAK,GAAG;AAC7B,YAAM,aAAa,CAAC;AAGpB,YAAM,SAAS,KAAK,GAAG,IAAI,KAAK;AAGhC,YAAM,SAAS;AACf,YAAM,iBAAiB;AACvB,YAAM,YAAY,KAAK;AACvB,YAAM,iBAAiB;AAAA,QACrB,IAAI,MAAM,kBAAkB,CAAC,GAAG,OAAO,CAACA,SAAQA,SAAQ,KAAK,GAAG;AAAA,QAChE,KAAK;AAAA,MACP;AACA,6BAAuB,OAAO,KAAK,mBAAmB;AACtD,kBAAY,KAAK,YAAY,OAAO,KAAK,cAAc;AACvD,WAAK,YAAY,KAAK;AACtB,aAAO,EAAE,SAAS,MAAM,SAAS,KAAK,QAAQ;AAAA,IAChD,CAAC;AAAA,EACH;AAAA,EAEA,mBAAkC;AAChC,QAAI;AACF,YAAM,OAAO,GAAG,SAAS,KAAK,UAAU;AACxC,YAAM,SAAS,KAAK;AACpB,UACE,UACA,OAAO,WAAW,KAAK,OACvB,OAAO,UAAU,KAAK,OACtB,OAAO,SAAS,KAAK,QACrB,OAAO,eAAe,KAAK,SAC3B;AACA,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,OAAO;AACd,WAAK,cAAc;AACnB,UAAI,UAAU,KAAK,MAAM,SAAU,QAAO,WAAW;AACrD,YAAM;AAAA,IACR;AACA,UAAM,QAAQ,UAAU,KAAK,YAAY,KAAK,cAAc;AAC5D,SAAK,YAAY,KAAK;AACtB,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,OAA4B;AACtC,QAAI;AACF,YAAM,OAAO,GAAG,SAAS,KAAK,UAAU;AACxC,WAAK,cAAc;AAAA,QACjB,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK;AAAA,QACZ,MAAM,KAAK;AAAA,QACX,YAAY,KAAK;AAAA,QACjB;AAAA,MACF;AAAA,IACF,QAAQ;AACN,WAAK,cAAc;AAAA,IACrB;AAAA,EACF;AAAA,EAEA,MAAM,UAAa,WAAgC;AACjD,OAAG,UAAU,KAAK,MAAM,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AACxD,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK;AACnC,UAAM,QAAQ,WAAW;AACzB,UAAM,YAAY,KAAK,KAAK,KAAK,WAAW,OAAO;AACnD,WAAO,MAAM;AACX,UAAI;AACF,WAAG,UAAU,KAAK,WAAW,EAAE,MAAM,IAAM,CAAC;AAC5C,WAAG,cAAc,WAAW,GAAG,KAAK;AAAA,EAAK,QAAQ,GAAG;AAAA,EAAK,KAAK,IAAI,CAAC;AAAA,EAAK,wBAAwB,CAAC;AAAA,GAAM;AAAA,UACrG,UAAU;AAAA,UACV,MAAM;AAAA,QACR,CAAC;AACD;AAAA,MACF,SAAS,OAAO;AACd,YAAI,UAAU,KAAK,MAAM,SAAU,OAAM;AACzC,YAAI,KAAK,gBAAgB,SAAS,EAAG;AACrC,YAAI,KAAK,IAAI,KAAK,SAAU,OAAM,IAAI,MAAM,4CAA4C;AACxF,cAAM,MAAM,EAAE;AAAA,MAChB;AAAA,IACF;AACA,QAAI;AACF,aAAO,UAAU;AAAA,IACnB,UAAE;AACA,UAAI;AACF,cAAM,QAAQ,GAAG,aAAa,WAAW,MAAM;AAC/C,YAAI,MAAM,WAAW,GAAG,KAAK;AAAA,CAAI,GAAG;AAClC,aAAG,OAAO,KAAK,WAAW,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,QAC5D;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,gBAAgB,WAA4B;AAC1C,QAAI;AACJ,QAAI;AACJ,QAAI;AACF,cAAQ,GAAG,aAAa,WAAW,MAAM;AAAA,IAC3C,QAAQ;AACN,UAAI;AACF,yBAAiB,GAAG,SAAS,KAAK,SAAS,EAAE;AAAA,MAC/C,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,UAAU,QAAW;AACvB,YAAM,CAAC,EAAE,SAAS,aAAa,YAAY,IAAI,MAAM,KAAK,EAAE,MAAM,IAAI;AACtE,YAAM,YAAY,OAAO,WAAW;AACpC,YAAM,QAAQ,OAAO,SAAS,SAAS,KAAK,KAAK,IAAI,IAAI,aAAa,KAAK;AAG3E,YAAM,OAAO,QACT,sBAAsB,OAAO,OAAO,GAAG,YAAY,IACnD,kBAAkB,OAAO,OAAO,GAAG,WAAW,cAAc;AAAA,QAC5D,aAAa;AAAA,QACb,WAAW,KAAK,IAAI,wBAAwB,KAAK,YAAY;AAAA,MAC/D,CAAC,MAAM;AACT,UAAI,CAAC,KAAM,QAAO;AAClB,UAAI;AACF,YAAI,GAAG,aAAa,WAAW,MAAM,MAAM,MAAO,QAAO;AACzD,eAAO,sBAAsB,KAAK,WAAW,CAAC,YAAY;AACxD,cAAI;AACF,mBAAO,GAAG,aAAa,KAAK,KAAK,SAAS,OAAO,GAAG,MAAM,MAAM;AAAA,UAClE,QAAQ;AACN,mBAAO;AAAA,UACT;AAAA,QACF,CAAC;AAAA,MACH,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,mBAAmB,UAAa,KAAK,IAAI,IAAI,kBAAkB,KAAK,cAAc;AACpF,aAAO;AAAA,IACT;AACA,QAAI;AACF,UAAI,GAAG,SAAS,KAAK,SAAS,EAAE,YAAY,eAAgB,QAAO;AACnE,SAAG,OAAO,KAAK,WAAW,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAC1D,aAAO;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,kBAA0B;AACxB,QAAI;AACF,YAAM,SAAkB,KAAK,MAAM,GAAG,aAAa,KAAK,iBAAiB,MAAM,CAAC;AAChF,aAAO,OAAO,WAAW,YAAY,OAAO,cAAc,MAAM,KAAK,UAAU,IAAI,SAAS;AAAA,IAC9F,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,cAAc,YAAoB,QAAwB;AACxD,UAAM,SAAS,aAAa,qBAAqB;AACjD,QAAI,CAAC,OAAO,cAAc,MAAM,KAAK,SAAS,GAAG;AAC/C,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AACA,WAAO;AAAA,EACT;AAAA,EAEA,cAAc,QAAwD;AACpE,QAAI,CAAC,OAAO,cAAc,MAAM,KAAK,SAAS,EAAG,QAAO,EAAE,YAAY,IAAI,QAAQ,EAAE;AACpF,WAAO;AAAA,MACL,YAAY,KAAK,MAAM,SAAS,kBAAkB;AAAA,MAClD,QAAQ,SAAS;AAAA,IACnB;AAAA,EACF;AAAA,EAEA,mBAAyB;AACvB,QAAI;AACJ,QAAI;AACF,mBAAa,GAAG,SAAS,KAAK,aAAa,GAAG;AAC9C,YAAM,OAAO,GAAG,UAAU,UAAU,EAAE;AACtC,UAAI,QAAQ,KAAK,kBAAmB;AACpC,YAAM,YAAY,KAAK;AAAA,QACrB;AAAA,QACA,KAAK,yBAAyB,KAAK,gBAAgB;AAAA,MACrD;AACA,YAAM,SAAS,OAAO,YAAY,SAAS;AAC3C,YAAM,YAAY,GAAG,SAAS,YAAY,QAAQ,GAAG,WAAW,OAAO,SAAS;AAChF,YAAM,WAAW,OAAO,SAAS,GAAG,SAAS;AAC7C,YAAM,oBAAoB,KAAK,IAAI,GAAG,SAAS,SAAS,KAAK,sBAAsB;AACnF,YAAM,UAAU,sBAAsB,IAAI,KAAK,SAAS,QAAQ,IAAM,iBAAiB;AACvF,YAAM,gBAAgB,sBAAsB,IAAI,IAAI,WAAW,IAAI,UAAU,IAAI,SAAS;AAC1F,YAAM,WAAW,SAAS,SAAS,aAAa;AAChD,SAAG,UAAU,UAAU;AACvB,mBAAa;AACb,YAAM,gBACJ,KAAK,cAAc,MAAM,QAAQ,MAAM,MAAM,WAAW,IAAI;AAC9D,UAAI;AACF,WAAG,cAAc,eAAe,UAAU,EAAE,MAAM,IAAM,CAAC;AACzD,WAAG,WAAW,eAAe,KAAK,WAAW;AAAA,MAC/C,UAAE;AACA,YAAI;AAAE,aAAG,OAAO,eAAe,EAAE,OAAO,KAAK,CAAC;AAAA,QAAG,QAAQ;AAAA,QAAC;AAAA,MAC5D;AACA,kBAAY,KAAK,iBAAiB,KAAK,gBAAgB,IAAI,CAAC;AAAA,IAC9D,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,OAAM;AAAA,IAC3C,UAAE;AACA,UAAI,eAAe,OAAW,IAAG,UAAU,UAAU;AAAA,IACvD;AAAA,EACF;AAAA,EAEA,kBAAwB;AACtB,QAAI;AACJ,QAAI;AACF,mBAAa,GAAG,SAAS,KAAK,aAAa,IAAI;AAC/C,YAAM,OAAO,GAAG,UAAU,UAAU,EAAE;AACtC,UAAI,SAAS,EAAG;AAChB,YAAM,WAAW,OAAO,YAAY,CAAC;AACrC,SAAG,SAAS,YAAY,UAAU,GAAG,GAAG,OAAO,CAAC;AAChD,UAAI,SAAS,CAAC,MAAM,GAAM;AAC1B,YAAM,YAAY,KAAK,IAAI,MAAM,KAAK,gBAAgB,CAAC;AACvD,YAAM,OAAO,OAAO,YAAY,SAAS;AACzC,SAAG,SAAS,YAAY,MAAM,GAAG,WAAW,OAAO,SAAS;AAC5D,YAAM,UAAU,KAAK,YAAY,EAAI;AACrC,SAAG,cAAc,YAAY,WAAW,IAAI,OAAO,YAAY,UAAU,IAAI,CAAC;AAAA,IAChF,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,OAAM;AAAA,IAC3C,UAAE;AACA,UAAI,eAAe,OAAW,IAAG,UAAU,UAAU;AAAA,IACvD;AAAA,EACF;AAAA,EAEA,yBAAiC;AAC/B,QAAI;AACJ,QAAI;AACF,mBAAa,GAAG,SAAS,KAAK,aAAa,GAAG;AAC9C,YAAM,OAAO,GAAG,UAAU,UAAU,EAAE;AACtC,UAAI,SAAS,EAAG,QAAO;AACvB,YAAM,YAAY,KAAK,IAAI,MAAM,KAAK,gBAAgB,CAAC;AACvD,YAAM,OAAO,OAAO,YAAY,SAAS;AACzC,SAAG,SAAS,YAAY,MAAM,GAAG,WAAW,OAAO,SAAS;AAC5D,YAAM,QAAQ,KAAK,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,IAAI;AACrD,eAAS,QAAQ,MAAM,SAAS,GAAG,SAAS,GAAG,SAAS;AACtD,cAAM,OAAO,MAAM,KAAK;AACxB,YAAI,CAAC,KAAM;AACX,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,cAAI,OAAO,OAAO,aAAa,YAAY,OAAO,cAAc,OAAO,QAAQ,GAAG;AAChF,mBAAO,OAAO;AAAA,UAChB;AAAA,QACF,QAAQ;AAAA,QAAqC;AAAA,MAC/C;AACA,aAAO;AAAA,IACT,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,QAAO;AAC1C,YAAM;AAAA,IACR,UAAE;AACA,UAAI,eAAe,OAAW,IAAG,UAAU,UAAU;AAAA,IACvD;AAAA,EACF;AAAA,EAEA,gBAAwB;AACtB,QAAI;AACF,YAAM,SAAkB,KAAK,MAAM,GAAG,aAAa,KAAK,cAAc,MAAM,CAAC;AAC7E,aAAO,OAAO,WAAW,YAAY,OAAO,cAAc,MAAM,KAAK,UAAU,IAAI,SAAS;AAAA,IAC9F,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,QAAO;AAC1C,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,eAAe,OAAqB;AAClC,sBAAkB,KAAK;AAAA,EACzB;AAAA,EAEA,aAAa,KAAmB;AAC9B,UAAM,gBAAgB,IACnB,MAAM,MAAM,EACZ;AAAA,MACC,CAAC,YACC,YAAY,eAAe,YAAY,eAAe,YAAY;AAAA,IACtE;AACF,QAAI,CAAC,YAAY,KAAK,GAAG,KAAK,eAAe;AAC3C,YAAM,IAAI,MAAM,4BAA4B,GAAG,EAAE;AAAA,IACnD;AAAA,EACF;AACF;",
|
|
6
6
|
"names": ["version", "key"]
|
|
7
7
|
}
|
|
@@ -5,7 +5,7 @@ import {
|
|
|
5
5
|
ENTROPY_WEIGHTS,
|
|
6
6
|
MAX_COMPILED_SURFACE_PROPOSALS,
|
|
7
7
|
emptyCompiledSurface
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-7WEXQQEQ.js";
|
|
9
9
|
import {
|
|
10
10
|
withExclusiveFileLock,
|
|
11
11
|
withExclusiveFileLockAsync
|
|
@@ -17,11 +17,11 @@ import {
|
|
|
17
17
|
import {
|
|
18
18
|
sessionDirForCwd,
|
|
19
19
|
sessionsDirRoot
|
|
20
|
-
} from "./chunk-
|
|
20
|
+
} from "./chunk-3KRAD6BR.js";
|
|
21
21
|
import {
|
|
22
22
|
FABRIC_EXECUTION_TRACE_KIND,
|
|
23
23
|
readFabricExecutionTraceV1
|
|
24
|
-
} from "./chunk-
|
|
24
|
+
} from "./chunk-4QTGATQD.js";
|
|
25
25
|
import {
|
|
26
26
|
MAX_NORMAL_FORM_PLANS,
|
|
27
27
|
applyNormalFormPlan,
|
|
@@ -34,7 +34,7 @@ import {
|
|
|
34
34
|
signatureDistance,
|
|
35
35
|
staticFreedomFromSchema,
|
|
36
36
|
trendFromScores
|
|
37
|
-
} from "./chunk-
|
|
37
|
+
} from "./chunk-DXVMGTC7.js";
|
|
38
38
|
import {
|
|
39
39
|
stableJsonHash
|
|
40
40
|
} from "./chunk-3YZUQESG.js";
|
|
@@ -1902,4 +1902,4 @@ export {
|
|
|
1902
1902
|
sessionWindowEvidence,
|
|
1903
1903
|
runEntropyTrial
|
|
1904
1904
|
};
|
|
1905
|
-
//# sourceMappingURL=chunk-
|
|
1905
|
+
//# sourceMappingURL=chunk-7C6QZCUR.js.map
|
|
@@ -10,7 +10,7 @@ import {
|
|
|
10
10
|
MAX_NORMAL_FORM_PLANS,
|
|
11
11
|
isNormalFormPlan,
|
|
12
12
|
provesNormalFormPlan
|
|
13
|
-
} from "./chunk-
|
|
13
|
+
} from "./chunk-DXVMGTC7.js";
|
|
14
14
|
import {
|
|
15
15
|
stableJsonHash
|
|
16
16
|
} from "./chunk-3YZUQESG.js";
|
|
@@ -416,4 +416,4 @@ export {
|
|
|
416
416
|
saveCompiledSurface,
|
|
417
417
|
saveCompiledSurfaceAsync
|
|
418
418
|
};
|
|
419
|
-
//# sourceMappingURL=chunk-
|
|
419
|
+
//# sourceMappingURL=chunk-7WEXQQEQ.js.map
|
|
@@ -162,15 +162,15 @@ import {
|
|
|
162
162
|
ApprovalController,
|
|
163
163
|
FabricAutoApprovalClassifier,
|
|
164
164
|
FabricSessionApprovals
|
|
165
|
-
} from "./chunk-
|
|
165
|
+
} from "./chunk-IWK5QA3D.js";
|
|
166
166
|
import {
|
|
167
167
|
getActiveRepairCompiler,
|
|
168
168
|
setActiveCompiledSurface
|
|
169
|
-
} from "./chunk-
|
|
169
|
+
} from "./chunk-BAYAQYAL.js";
|
|
170
170
|
import {
|
|
171
171
|
isFabricExecutionTraceV1,
|
|
172
172
|
readFabricExecutionTraceV1
|
|
173
|
-
} from "./chunk-
|
|
173
|
+
} from "./chunk-4QTGATQD.js";
|
|
174
174
|
import {
|
|
175
175
|
stableJsonHash
|
|
176
176
|
} from "./chunk-3YZUQESG.js";
|
|
@@ -6315,4 +6315,4 @@ export {
|
|
|
6315
6315
|
FABRIC_MANAGED_HOST_VERSION,
|
|
6316
6316
|
createFabricExtension
|
|
6317
6317
|
};
|
|
6318
|
-
//# sourceMappingURL=chunk-
|
|
6318
|
+
//# sourceMappingURL=chunk-B43JHNA4.js.map
|
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
import {
|
|
2
2
|
applyNormalFormPlan,
|
|
3
3
|
deriveNormalFormPlan
|
|
4
|
-
} from "./chunk-
|
|
4
|
+
} from "./chunk-DXVMGTC7.js";
|
|
5
5
|
|
|
6
6
|
// src/entropy/active.ts
|
|
7
7
|
var active;
|
|
@@ -48,4 +48,4 @@ export {
|
|
|
48
48
|
applyActiveArgRepairs,
|
|
49
49
|
applyActiveActionName
|
|
50
50
|
};
|
|
51
|
-
//# sourceMappingURL=chunk-
|
|
51
|
+
//# sourceMappingURL=chunk-BAYAQYAL.js.map
|
|
@@ -34,7 +34,7 @@ import {
|
|
|
34
34
|
import {
|
|
35
35
|
compileFabricSummary,
|
|
36
36
|
rawContextTokens
|
|
37
|
-
} from "./chunk-
|
|
37
|
+
} from "./chunk-RX74PKZS.js";
|
|
38
38
|
import {
|
|
39
39
|
launchScope,
|
|
40
40
|
normalizeScope,
|
|
@@ -96,7 +96,7 @@ import {
|
|
|
96
96
|
import {
|
|
97
97
|
compactionRequestBoundsError,
|
|
98
98
|
encodeCompactionRequest
|
|
99
|
-
} from "./chunk-
|
|
99
|
+
} from "./chunk-MK4TBJ6O.js";
|
|
100
100
|
import {
|
|
101
101
|
FABRIC_ACTOR_HOST_EVENTS
|
|
102
102
|
} from "./chunk-IIPKG52D.js";
|
|
@@ -7984,4 +7984,4 @@ export {
|
|
|
7984
7984
|
agentParticipantRecords,
|
|
7985
7985
|
actorParticipantRecord
|
|
7986
7986
|
};
|
|
7987
|
-
//# sourceMappingURL=chunk-
|
|
7987
|
+
//# sourceMappingURL=chunk-BOTUL4UK.js.map
|