pi-fabric 0.119.3 → 0.119.4
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/dist/agents.js +3 -3
- package/dist/chunks/{chunk-UHB7A6MG.js → chunk-2RSSU4NI.js} +2 -2
- package/dist/chunks/{chunk-RVN55KEL.js → chunk-3UQEAJXZ.js} +2 -2
- package/dist/chunks/{chunk-I2JMXAJV.js → chunk-4HRBFAU5.js} +3 -3
- package/dist/chunks/{chunk-A3H4FYNR.js → chunk-5QS7PFWD.js} +4 -4
- package/dist/chunks/{chunk-OG3KRP7U.js → chunk-6WASKKYA.js} +5 -5
- package/dist/chunks/{chunk-QEZB37HJ.js → chunk-7BKIL623.js} +2 -2
- package/dist/chunks/{chunk-2YFBLL32.js → chunk-BIMXYJ6U.js} +3 -3
- package/dist/chunks/{chunk-2UXC5BEZ.js → chunk-FAOWQ2C3.js} +2 -2
- package/dist/chunks/{chunk-XY3TVGTB.js → chunk-FLXFYKS7.js} +2 -2
- package/dist/chunks/{chunk-OHTC52ZS.js → chunk-GARKXYZT.js} +3 -3
- package/dist/chunks/{chunk-UJLAGEVY.js → chunk-IO64KE65.js} +14 -1
- package/dist/chunks/chunk-IO64KE65.js.map +7 -0
- package/dist/chunks/{chunk-JLMQ7XDU.js → chunk-IQ5F63LE.js} +2 -2
- package/dist/chunks/{chunk-AVUU6UU5.js → chunk-KB4KQ7KT.js} +2 -2
- package/dist/chunks/{chunk-EOBJ4KLU.js → chunk-KH2JKXOQ.js} +5 -5
- package/dist/chunks/{chunk-Y5YFAC6C.js → chunk-KZX725OF.js} +2 -2
- package/dist/chunks/{chunk-HFDHXETI.js → chunk-LCZATITG.js} +2 -2
- package/dist/chunks/{chunk-U2IV4DXV.js → chunk-LPUOI5BZ.js} +3 -3
- package/dist/chunks/{chunk-KFI44DIQ.js → chunk-MU5IB2IR.js} +2 -2
- package/dist/chunks/{chunk-E3PZ5HHF.js → chunk-NBHUIZ6P.js} +4 -4
- package/dist/chunks/{chunk-CUQ6ALHF.js → chunk-NQZXLTLI.js} +2 -2
- package/dist/chunks/{chunk-ERHPAZ2M.js → chunk-QNDJXXYE.js} +2 -2
- package/dist/chunks/{chunk-R2QIPBQF.js → chunk-TLR3CWIF.js} +4 -4
- package/dist/chunks/{chunk-QC73WZ3R.js → chunk-ULPAF2EY.js} +2 -2
- package/dist/chunks/{chunk-SDG5ZUS4.js → chunk-WH35F4JO.js} +2 -2
- package/dist/chunks/{chunk-RUXIUYY7.js → chunk-WLUMFHDX.js} +6 -6
- package/dist/chunks/{chunk-55E55TBV.js → chunk-XDZHPIV3.js} +2 -2
- package/dist/chunks/{chunk-CO6GJSJ3.js → chunk-XZKS6WUR.js} +2 -1
- package/dist/chunks/{chunk-CO6GJSJ3.js.map → chunk-XZKS6WUR.js.map} +2 -2
- package/dist/chunks/{chunk-UB4S5K5Q.js → chunk-YDJJMB3Z.js} +69 -37
- package/dist/chunks/chunk-YDJJMB3Z.js.map +7 -0
- 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 +6 -6
- package/dist/core/provider-operations.js +1 -0
- package/dist/core/provider-operations.js.map +2 -2
- package/dist/entropy/index.js +8 -8
- package/dist/extension-bootstrap.js +9 -9
- package/dist/fabric-runtime-state.js +23 -23
- package/dist/index.js +13 -13
- 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 +2 -1
- package/dist/verified/generated/compaction.d.ts +1 -1
- package/dist/verified/generated/compaction.js +2 -1
- package/dist/verified/generated/lifecycle.d.ts +1 -1
- package/dist/verified/generated/lifecycle.js +2 -1
- package/dist/verified/generated/manifest.json +18 -17
- package/dist/verified/generated/policy.d.ts +1 -1
- package/dist/verified/generated/policy.js +13 -1
- package/dist/verified/generated/provider.d.ts +1 -1
- package/dist/verified/generated/provider.js +2 -1
- package/dist/verified/generated/resources.d.ts +2 -1
- package/dist/verified/generated/resources.js +27 -1
- package/dist/verified/generated/storage.d.ts +1 -1
- package/dist/verified/generated/storage.js +2 -1
- package/dist/verified/resources.d.ts +3 -2
- package/dist/verified/resources.d.ts.map +1 -1
- package/docs/verified-kernels.md +29 -10
- package/package.json +2 -2
- package/proofs/resources.ts +51 -3
- package/dist/chunks/chunk-UB4S5K5Q.js.map +0 -7
- package/dist/chunks/chunk-UJLAGEVY.js.map +0 -7
- /package/dist/chunks/{chunk-UHB7A6MG.js.map → chunk-2RSSU4NI.js.map} +0 -0
- /package/dist/chunks/{chunk-RVN55KEL.js.map → chunk-3UQEAJXZ.js.map} +0 -0
- /package/dist/chunks/{chunk-I2JMXAJV.js.map → chunk-4HRBFAU5.js.map} +0 -0
- /package/dist/chunks/{chunk-A3H4FYNR.js.map → chunk-5QS7PFWD.js.map} +0 -0
- /package/dist/chunks/{chunk-OG3KRP7U.js.map → chunk-6WASKKYA.js.map} +0 -0
- /package/dist/chunks/{chunk-QEZB37HJ.js.map → chunk-7BKIL623.js.map} +0 -0
- /package/dist/chunks/{chunk-2YFBLL32.js.map → chunk-BIMXYJ6U.js.map} +0 -0
- /package/dist/chunks/{chunk-2UXC5BEZ.js.map → chunk-FAOWQ2C3.js.map} +0 -0
- /package/dist/chunks/{chunk-XY3TVGTB.js.map → chunk-FLXFYKS7.js.map} +0 -0
- /package/dist/chunks/{chunk-OHTC52ZS.js.map → chunk-GARKXYZT.js.map} +0 -0
- /package/dist/chunks/{chunk-JLMQ7XDU.js.map → chunk-IQ5F63LE.js.map} +0 -0
- /package/dist/chunks/{chunk-AVUU6UU5.js.map → chunk-KB4KQ7KT.js.map} +0 -0
- /package/dist/chunks/{chunk-EOBJ4KLU.js.map → chunk-KH2JKXOQ.js.map} +0 -0
- /package/dist/chunks/{chunk-Y5YFAC6C.js.map → chunk-KZX725OF.js.map} +0 -0
- /package/dist/chunks/{chunk-HFDHXETI.js.map → chunk-LCZATITG.js.map} +0 -0
- /package/dist/chunks/{chunk-U2IV4DXV.js.map → chunk-LPUOI5BZ.js.map} +0 -0
- /package/dist/chunks/{chunk-KFI44DIQ.js.map → chunk-MU5IB2IR.js.map} +0 -0
- /package/dist/chunks/{chunk-E3PZ5HHF.js.map → chunk-NBHUIZ6P.js.map} +0 -0
- /package/dist/chunks/{chunk-CUQ6ALHF.js.map → chunk-NQZXLTLI.js.map} +0 -0
- /package/dist/chunks/{chunk-ERHPAZ2M.js.map → chunk-QNDJXXYE.js.map} +0 -0
- /package/dist/chunks/{chunk-R2QIPBQF.js.map → chunk-TLR3CWIF.js.map} +0 -0
- /package/dist/chunks/{chunk-QC73WZ3R.js.map → chunk-ULPAF2EY.js.map} +0 -0
- /package/dist/chunks/{chunk-SDG5ZUS4.js.map → chunk-WH35F4JO.js.map} +0 -0
- /package/dist/chunks/{chunk-RUXIUYY7.js.map → chunk-WLUMFHDX.js.map} +0 -0
- /package/dist/chunks/{chunk-55E55TBV.js.map → chunk-XDZHPIV3.js.map} +0 -0
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-IQ5F63LE.js";
|
|
5
5
|
import {
|
|
6
6
|
AgentAdmission,
|
|
7
7
|
assertAgentTask,
|
|
@@ -17,12 +17,12 @@ import {
|
|
|
17
17
|
import "./chunks/chunk-IIPKG52D.js";
|
|
18
18
|
import "./chunks/chunk-ZLNJDTCN.js";
|
|
19
19
|
import "./chunks/chunk-V73NIH6B.js";
|
|
20
|
-
import "./chunks/chunk-
|
|
20
|
+
import "./chunks/chunk-KB4KQ7KT.js";
|
|
21
21
|
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-IO64KE65.js";
|
|
26
26
|
|
|
27
27
|
// src/agents/service-schema.ts
|
|
28
28
|
import { Value } from "typebox/value";
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
MemoryProvider
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-WLUMFHDX.js";
|
|
4
4
|
|
|
5
5
|
// src/memory/worker-provider.ts
|
|
6
6
|
import path from "node:path";
|
|
@@ -187,4 +187,4 @@ var WorkerMemoryProvider = class extends MemoryProvider {
|
|
|
187
187
|
export {
|
|
188
188
|
WorkerMemoryProvider
|
|
189
189
|
};
|
|
190
|
-
//# sourceMappingURL=chunk-
|
|
190
|
+
//# sourceMappingURL=chunk-2RSSU4NI.js.map
|
|
@@ -3,7 +3,7 @@ import {
|
|
|
3
3
|
} from "./chunk-3YZUQESG.js";
|
|
4
4
|
import {
|
|
5
5
|
useNormalized
|
|
6
|
-
} from "./chunk-
|
|
6
|
+
} from "./chunk-IO64KE65.js";
|
|
7
7
|
|
|
8
8
|
// src/entropy/fingerprint.ts
|
|
9
9
|
var SIGNATURE_MAX_KEYS = 32;
|
|
@@ -289,4 +289,4 @@ export {
|
|
|
289
289
|
provesNormalFormPlan,
|
|
290
290
|
applyNormalFormPlan
|
|
291
291
|
};
|
|
292
|
-
//# sourceMappingURL=chunk-
|
|
292
|
+
//# sourceMappingURL=chunk-3UQEAJXZ.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-WLUMFHDX.js";
|
|
6
6
|
import {
|
|
7
7
|
readSessionHeader
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-GARKXYZT.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-4HRBFAU5.js.map
|
|
@@ -5,14 +5,14 @@ import {
|
|
|
5
5
|
normalizeMemoryPhrase,
|
|
6
6
|
planMemoryQuery,
|
|
7
7
|
tokenizeLexical
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-KZX725OF.js";
|
|
9
9
|
import {
|
|
10
10
|
DEFAULT_MEMORY_INDEX_PRIVACY,
|
|
11
11
|
normalizeSession
|
|
12
|
-
} from "./chunk-
|
|
12
|
+
} from "./chunk-GARKXYZT.js";
|
|
13
13
|
import {
|
|
14
14
|
coverageComplete
|
|
15
|
-
} from "./chunk-
|
|
15
|
+
} from "./chunk-IO64KE65.js";
|
|
16
16
|
|
|
17
17
|
// src/memory/index.ts
|
|
18
18
|
import crypto2 from "node:crypto";
|
|
@@ -1242,4 +1242,4 @@ export {
|
|
|
1242
1242
|
searchMemoryIndex,
|
|
1243
1243
|
searchShards
|
|
1244
1244
|
};
|
|
1245
|
-
//# sourceMappingURL=chunk-
|
|
1245
|
+
//# sourceMappingURL=chunk-5QS7PFWD.js.map
|
|
@@ -5,7 +5,7 @@ import {
|
|
|
5
5
|
ENTROPY_WEIGHTS,
|
|
6
6
|
MAX_COMPILED_SURFACE_PROPOSALS,
|
|
7
7
|
emptyCompiledSurface
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-MU5IB2IR.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-7BKIL623.js";
|
|
21
21
|
import {
|
|
22
22
|
FABRIC_EXECUTION_TRACE_KIND,
|
|
23
23
|
readFabricExecutionTraceV1
|
|
24
|
-
} from "./chunk-
|
|
24
|
+
} from "./chunk-ULPAF2EY.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-3UQEAJXZ.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-6WASKKYA.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
readSessionHeader
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-GARKXYZT.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-7BKIL623.js.map
|
|
@@ -54,7 +54,7 @@ import {
|
|
|
54
54
|
import {
|
|
55
55
|
compileFabricSummary,
|
|
56
56
|
rawContextTokens
|
|
57
|
-
} from "./chunk-
|
|
57
|
+
} from "./chunk-TLR3CWIF.js";
|
|
58
58
|
import {
|
|
59
59
|
SHORT_LOCK_MAX_HOLD_MS,
|
|
60
60
|
encodeOwnerIdentityLine,
|
|
@@ -97,7 +97,7 @@ import {
|
|
|
97
97
|
import {
|
|
98
98
|
compactionRequestBoundsError,
|
|
99
99
|
encodeCompactionRequest
|
|
100
|
-
} from "./chunk-
|
|
100
|
+
} from "./chunk-KB4KQ7KT.js";
|
|
101
101
|
import {
|
|
102
102
|
BUILT_IN_RUNNER_IDS,
|
|
103
103
|
getAgentRunner,
|
|
@@ -7962,4 +7962,4 @@ export {
|
|
|
7962
7962
|
agentParticipantRecords,
|
|
7963
7963
|
actorParticipantRecord
|
|
7964
7964
|
};
|
|
7965
|
-
//# sourceMappingURL=chunk-
|
|
7965
|
+
//# sourceMappingURL=chunk-BIMXYJ6U.js.map
|
|
@@ -12,7 +12,7 @@ import {
|
|
|
12
12
|
} from "./chunk-G54PEZ44.js";
|
|
13
13
|
import {
|
|
14
14
|
FabricTraceSafeError
|
|
15
|
-
} from "./chunk-
|
|
15
|
+
} from "./chunk-ULPAF2EY.js";
|
|
16
16
|
|
|
17
17
|
// src/core/approval-controller.ts
|
|
18
18
|
import {
|
|
@@ -580,4 +580,4 @@ export {
|
|
|
580
580
|
FabricSessionApprovals,
|
|
581
581
|
ApprovalController
|
|
582
582
|
};
|
|
583
|
-
//# sourceMappingURL=chunk-
|
|
583
|
+
//# sourceMappingURL=chunk-FAOWQ2C3.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
fabricCompactionVersion
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-TLR3CWIF.js";
|
|
4
4
|
|
|
5
5
|
// src/compaction/owner.ts
|
|
6
6
|
var COMPACTION_OWNERSHIP_DOC = "docs/compaction.md#pi-vcc-precedence";
|
|
@@ -54,4 +54,4 @@ export {
|
|
|
54
54
|
ownershipWarning,
|
|
55
55
|
CompactionOwnerObserver
|
|
56
56
|
};
|
|
57
|
-
//# sourceMappingURL=chunk-
|
|
57
|
+
//# sourceMappingURL=chunk-FLXFYKS7.js.map
|
|
@@ -1,10 +1,10 @@
|
|
|
1
1
|
import {
|
|
2
2
|
readFabricBranchSummaryDetails,
|
|
3
3
|
readFabricProjectionTrace
|
|
4
|
-
} from "./chunk-
|
|
4
|
+
} from "./chunk-NQZXLTLI.js";
|
|
5
5
|
import {
|
|
6
6
|
lineageSelected
|
|
7
|
-
} from "./chunk-
|
|
7
|
+
} from "./chunk-IO64KE65.js";
|
|
8
8
|
|
|
9
9
|
// src/memory/normalize.ts
|
|
10
10
|
import fs from "node:fs";
|
|
@@ -654,4 +654,4 @@ export {
|
|
|
654
654
|
expandSessionEntries,
|
|
655
655
|
expandSessionEntriesChecked
|
|
656
656
|
};
|
|
657
|
-
//# sourceMappingURL=chunk-
|
|
657
|
+
//# sourceMappingURL=chunk-GARKXYZT.js.map
|
|
@@ -17,6 +17,7 @@ var transitionCurrent = /* @__PURE__ */ (() => {
|
|
|
17
17
|
}
|
|
18
18
|
function step(params, state, input) {
|
|
19
19
|
const env = { "retired": $n(input["retired"], "input retired"), "sameEpoch": $n(input["sameEpoch"], "input sameEpoch"), "sameOwner": $n(input["sameOwner"], "input sameOwner"), "closed": $n(input["closed"], "input closed") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
20
|
+
if (!(env["retired"] <= 1 && env["sameEpoch"] <= 1 && env["sameOwner"] <= 1 && env["closed"] <= 1)) throw new RangeError("transition current: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
20
21
|
const scalars = { ...s, "out.ok": !(env["retired"] === 1) && env["sameEpoch"] === 1 && env["sameOwner"] === 1 && !(env["closed"] === 1) ? 1 : 0 };
|
|
21
22
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
22
23
|
}
|
|
@@ -29,6 +30,7 @@ var cleanupState = /* @__PURE__ */ (() => {
|
|
|
29
30
|
}
|
|
30
31
|
function step(params, state, input) {
|
|
31
32
|
const env = { "failed": $n(input["failed"], "input failed"), "diverted": $n(input["diverted"], "input diverted") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
33
|
+
if (!(env["failed"] <= 1 && env["diverted"] <= 1)) throw new RangeError("cleanup state: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
32
34
|
const scalars = { ...s, "out.state": env["failed"] === 1 ? 2 : env["diverted"] === 1 ? 1 : 0 };
|
|
33
35
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
34
36
|
}
|
|
@@ -41,6 +43,7 @@ var unknownConflict = /* @__PURE__ */ (() => {
|
|
|
41
43
|
}
|
|
42
44
|
function step(params, state, input) {
|
|
43
45
|
const env = { "lu": $n(input["lu"], "input lu"), "luo": $n(input["luo"], "input luo"), "lo": $n(input["lo"], "input lo"), "ru": $n(input["ru"], "input ru"), "ruo": $n(input["ruo"], "input ruo"), "ro": $n(input["ro"], "input ro") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
46
|
+
if (!(env["lu"] <= 1 && env["luo"] <= 1 && env["lo"] <= 1 && env["ru"] <= 1 && env["ruo"] <= 1 && env["ro"] <= 1)) throw new RangeError("unknown conflict: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
44
47
|
const scalars = { ...s, "out.conflict": env["lu"] === 1 && (env["luo"] === 1 || env["ro"] === 1) || env["ru"] === 1 && (env["ruo"] === 1 || env["lo"] === 1) ? 1 : 0 };
|
|
45
48
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
46
49
|
}
|
|
@@ -53,6 +56,7 @@ var knownConflict = /* @__PURE__ */ (() => {
|
|
|
53
56
|
}
|
|
54
57
|
function step(params, state, input) {
|
|
55
58
|
const env = { "shared": $n(input["shared"], "input shared"), "leftOrdered": $n(input["leftOrdered"], "input leftOrdered"), "rightOrdered": $n(input["rightOrdered"], "input rightOrdered") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
59
|
+
if (!(env["shared"] <= 1 && env["leftOrdered"] <= 1 && env["rightOrdered"] <= 1)) throw new RangeError("known conflict: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
56
60
|
const scalars = { ...s, "out.conflict": env["shared"] === 1 && (env["leftOrdered"] === 1 || env["rightOrdered"] === 1) ? 1 : 0 };
|
|
57
61
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
58
62
|
}
|
|
@@ -65,6 +69,7 @@ var lineageSelected = /* @__PURE__ */ (() => {
|
|
|
65
69
|
}
|
|
66
70
|
function step(params, state, input) {
|
|
67
71
|
const env = { "allBranches": $n(input["allBranches"], "input allBranches"), "member": $n(input["member"], "input member") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
72
|
+
if (!(env["allBranches"] <= 1 && env["member"] <= 1)) throw new RangeError("lineage selected: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
68
73
|
const scalars = { ...s, "out.selected": env["allBranches"] === 1 || env["member"] === 1 ? 1 : 0 };
|
|
69
74
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
70
75
|
}
|
|
@@ -77,6 +82,7 @@ var pointerCurrent = /* @__PURE__ */ (() => {
|
|
|
77
82
|
}
|
|
78
83
|
function step(params, state, input) {
|
|
79
84
|
const env = { "source": $n(input["source"], "input source"), "lineage": $n(input["lineage"], "input lineage") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
85
|
+
if (!(env["source"] <= 1 && env["lineage"] <= 1)) throw new RangeError("pointer current: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
80
86
|
const scalars = { ...s, "out.current": env["source"] === 1 && env["lineage"] === 1 ? 1 : 0 };
|
|
81
87
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
82
88
|
}
|
|
@@ -89,6 +95,7 @@ var coverageComplete = /* @__PURE__ */ (() => {
|
|
|
89
95
|
}
|
|
90
96
|
function step(params, state, input) {
|
|
91
97
|
const env = { "sourceComplete": $n(input["sourceComplete"], "input sourceComplete"), "truncated": $n(input["truncated"], "input truncated") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
98
|
+
if (!(env["sourceComplete"] <= 1 && env["truncated"] <= 1)) throw new RangeError("coverage complete: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
92
99
|
const scalars = { ...s, "out.complete": env["sourceComplete"] === 1 && !(env["truncated"] === 1) ? 1 : 0 };
|
|
93
100
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
94
101
|
}
|
|
@@ -101,6 +108,7 @@ var useNormalized = /* @__PURE__ */ (() => {
|
|
|
101
108
|
}
|
|
102
109
|
function step(params, state, input) {
|
|
103
110
|
const env = { "canonical": $n(input["canonical"], "input canonical"), "plan": $n(input["plan"], "input plan"), "changed": $n(input["changed"], "input changed"), "accepted": $n(input["accepted"], "input accepted") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
111
|
+
if (!(env["canonical"] <= 1 && env["plan"] <= 1 && env["changed"] <= 1 && env["accepted"] <= 1)) throw new RangeError("use normalized: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
104
112
|
const scalars = { ...s, "out.use": !(env["canonical"] === 1) && env["plan"] === 1 && env["changed"] === 1 && env["accepted"] === 1 ? 1 : 0 };
|
|
105
113
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
106
114
|
}
|
|
@@ -113,6 +121,7 @@ var headReadable = /* @__PURE__ */ (() => {
|
|
|
113
121
|
}
|
|
114
122
|
function step(params, state, input) {
|
|
115
123
|
const env = { "sequence": $n(input["sequence"], "input sequence"), "version": $n(input["version"], "input version"), "committed": $n(input["committed"], "input committed"), "pending": $n(input["pending"], "input pending"), "marker": $n(input["marker"], "input marker") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
124
|
+
if (!(env["sequence"] <= 1 && env["version"] <= 1 && env["committed"] <= 1 && env["pending"] <= 1 && env["marker"] <= 1)) throw new RangeError("head readable: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
116
125
|
const scalars = { ...s, "out.readable": env["sequence"] === 1 && env["version"] === 1 && (env["committed"] === 1 || env["pending"] === 1 && env["marker"] === 1) ? 1 : 0 };
|
|
117
126
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
118
127
|
}
|
|
@@ -125,6 +134,7 @@ var certificateAccepted = /* @__PURE__ */ (() => {
|
|
|
125
134
|
}
|
|
126
135
|
function step(params, state, input) {
|
|
127
136
|
const env = { "f0": $n(input["f0"], "input f0"), "f1": $n(input["f1"], "input f1"), "f2": $n(input["f2"], "input f2"), "f3": $n(input["f3"], "input f3"), "f4": $n(input["f4"], "input f4"), "f5": $n(input["f5"], "input f5"), "f6": $n(input["f6"], "input f6"), "f7": $n(input["f7"], "input f7") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
137
|
+
if (!(env["f0"] <= 1 && env["f1"] <= 1 && env["f2"] <= 1 && env["f3"] <= 1 && env["f4"] <= 1 && env["f5"] <= 1 && env["f6"] <= 1 && env["f7"] <= 1)) throw new RangeError("certificate accepted: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
128
138
|
const scalars = { ...s, "out.accepted": env["f0"] === 1 && env["f1"] === 1 && env["f2"] === 1 && env["f3"] === 1 && env["f4"] === 1 && env["f5"] === 1 && env["f6"] === 1 && env["f7"] === 1 ? 1 : 0 };
|
|
129
139
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
130
140
|
}
|
|
@@ -137,6 +147,7 @@ var consume = /* @__PURE__ */ (() => {
|
|
|
137
147
|
}
|
|
138
148
|
function step(params, state, input) {
|
|
139
149
|
const env = { "active": $n(input["active"], "input active") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
150
|
+
if (!(env["active"] <= 1)) throw new RangeError("consume: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
140
151
|
const scalars = { ...s, "out.released": env["active"] === 1 ? 1 : 0, "out.active": env["active"] === 1 && !(env["active"] === 1) ? 1 : 0 };
|
|
141
152
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
142
153
|
}
|
|
@@ -173,6 +184,7 @@ var chunkAccepted = /* @__PURE__ */ (() => {
|
|
|
173
184
|
}
|
|
174
185
|
function step(params, state, input) {
|
|
175
186
|
const env = { "start": $n(input["start"], "input start"), "end": $n(input["end"], "input end"), "total": $n(input["total"], "input total"), "expectedStart": $n(input["expectedStart"], "input expectedStart"), "expectedTotal": $n(input["expectedTotal"], "input expectedTotal"), "length": $n(input["length"], "input length"), "complete": $n(input["complete"], "input complete") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
187
|
+
if (!(env["complete"] <= 1)) throw new RangeError("chunk accepted: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
176
188
|
const scalars = { ...s, "out.accepted": env["start"] === env["expectedStart"] && env["total"] === env["expectedTotal"] && env["start"] <= env["end"] && env["end"] <= env["total"] && $x(env["length"] + env["start"]) === env["end"] && ((!(env["complete"] === 1) || env["end"] === env["total"]) && (!(env["end"] === env["total"]) || env["complete"] === 1)) && (env["complete"] === 1 || env["start"] < env["end"]) ? 1 : 0 };
|
|
177
189
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
178
190
|
}
|
|
@@ -193,6 +205,7 @@ var compactionCut = /* @__PURE__ */ (() => {
|
|
|
193
205
|
const env = { "eligible": $n2(params["eligible"], "param eligible"), "afterPrevious": $n2(params["afterPrevious"], "param afterPrevious"), "retained": $n2(params["retained"], "param retained"), "budget": $n2(params["budget"], "param budget"), "boundary": $n2(params["boundary"], "param boundary"), "op": $n2(input["op"], "input op"), "first": $n2(input["first"], "input first"), "last": $n2(input["last"], "input last"), "paired": $n2(input["paired"], "input paired") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
|
|
194
206
|
const flag0 = env["eligible"] === 1 && env["afterPrevious"] === 1 && env["retained"] <= env["budget"];
|
|
195
207
|
const flag1 = !(env["paired"] === 1) || env["boundary"] <= env["first"] || env["last"] < env["boundary"];
|
|
208
|
+
if (!(env["op"] < 2 && env["paired"] <= 1)) throw new RangeError("compaction cut: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
196
209
|
const scalars = { ...s, "phase": env["op"] === 0 ? s["phase"] === 0 && flag0 ? 1 : 2 : s["phase"] === 1 && flag1 ? 1 : 2 };
|
|
197
210
|
return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
|
|
198
211
|
}
|
|
@@ -278,4 +291,4 @@ export {
|
|
|
278
291
|
acceptMemoryChunk,
|
|
279
292
|
assertCertificateFacts
|
|
280
293
|
};
|
|
281
|
-
//# sourceMappingURL=chunk-
|
|
294
|
+
//# sourceMappingURL=chunk-IO64KE65.js.map
|
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
{
|
|
2
|
+
"version": 3,
|
|
3
|
+
"sources": ["../../src/verified/nat.ts", "../../src/verified/generated/policy.js", "../../src/verified/generated/compaction.js", "../../src/verified/policy.ts"],
|
|
4
|
+
"sourcesContent": ["// The compiled gdp-wired runtime refuses any natural past 2^53 - 1, where the\n// proofs over the naturals stop describing the run. Counters fail closed first.\nexport const VERIFIED_NAT_MAX = Number.MAX_SAFE_INTEGER;\n", "// Generated by scripts/verified-kernels.ts from proofs/policy.ts with gdp-wired@0.12.7. 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 transitionCurrent = /* @__PURE__ */ (() => {\n// Generated from the machine transition current. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.ok\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"retired\": $n(input[\"retired\"], \"input retired\"), \"sameEpoch\": $n(input[\"sameEpoch\"], \"input sameEpoch\"), \"sameOwner\": $n(input[\"sameOwner\"], \"input sameOwner\"), \"closed\": $n(input[\"closed\"], \"input closed\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"retired\"] <= 1) && (env[\"sameEpoch\"] <= 1) && (env[\"sameOwner\"] <= 1) && (env[\"closed\"] <= 1))) throw new RangeError(\"transition current: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.ok\": (((!(env[\"retired\"] === 1)) && (env[\"sameEpoch\"] === 1) && (env[\"sameOwner\"] === 1) && (!(env[\"closed\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const cleanupState = /* @__PURE__ */ (() => {\n// Generated from the machine cleanup state. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.state\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"failed\": $n(input[\"failed\"], \"input failed\"), \"diverted\": $n(input[\"diverted\"], \"input diverted\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"failed\"] <= 1) && (env[\"diverted\"] <= 1))) throw new RangeError(\"cleanup state: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.state\": ((env[\"failed\"] === 1) ? 2 : ((env[\"diverted\"] === 1) ? 1 : 0))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const unknownConflict = /* @__PURE__ */ (() => {\n// Generated from the machine unknown conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"lu\": $n(input[\"lu\"], \"input lu\"), \"luo\": $n(input[\"luo\"], \"input luo\"), \"lo\": $n(input[\"lo\"], \"input lo\"), \"ru\": $n(input[\"ru\"], \"input ru\"), \"ruo\": $n(input[\"ruo\"], \"input ruo\"), \"ro\": $n(input[\"ro\"], \"input ro\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"lu\"] <= 1) && (env[\"luo\"] <= 1) && (env[\"lo\"] <= 1) && (env[\"ru\"] <= 1) && (env[\"ruo\"] <= 1) && (env[\"ro\"] <= 1))) throw new RangeError(\"unknown conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.conflict\": ((((env[\"lu\"] === 1) && ((env[\"luo\"] === 1) || (env[\"ro\"] === 1))) || ((env[\"ru\"] === 1) && ((env[\"ruo\"] === 1) || (env[\"lo\"] === 1)))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const knownConflict = /* @__PURE__ */ (() => {\n// Generated from the machine known conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"shared\": $n(input[\"shared\"], \"input shared\"), \"leftOrdered\": $n(input[\"leftOrdered\"], \"input leftOrdered\"), \"rightOrdered\": $n(input[\"rightOrdered\"], \"input rightOrdered\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"shared\"] <= 1) && (env[\"leftOrdered\"] <= 1) && (env[\"rightOrdered\"] <= 1))) throw new RangeError(\"known conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.conflict\": (((env[\"shared\"] === 1) && ((env[\"leftOrdered\"] === 1) || (env[\"rightOrdered\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const lineageSelected = /* @__PURE__ */ (() => {\n// Generated from the machine lineage selected. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.selected\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"allBranches\": $n(input[\"allBranches\"], \"input allBranches\"), \"member\": $n(input[\"member\"], \"input member\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"allBranches\"] <= 1) && (env[\"member\"] <= 1))) throw new RangeError(\"lineage selected: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.selected\": (((env[\"allBranches\"] === 1) || (env[\"member\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const pointerCurrent = /* @__PURE__ */ (() => {\n// Generated from the machine pointer current. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.current\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"source\": $n(input[\"source\"], \"input source\"), \"lineage\": $n(input[\"lineage\"], \"input lineage\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"source\"] <= 1) && (env[\"lineage\"] <= 1))) throw new RangeError(\"pointer current: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.current\": (((env[\"source\"] === 1) && (env[\"lineage\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const coverageComplete = /* @__PURE__ */ (() => {\n// Generated from the machine coverage complete. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.complete\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"sourceComplete\": $n(input[\"sourceComplete\"], \"input sourceComplete\"), \"truncated\": $n(input[\"truncated\"], \"input truncated\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"sourceComplete\"] <= 1) && (env[\"truncated\"] <= 1))) throw new RangeError(\"coverage complete: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.complete\": (((env[\"sourceComplete\"] === 1) && (!(env[\"truncated\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const useNormalized = /* @__PURE__ */ (() => {\n// Generated from the machine use normalized. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.use\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"canonical\": $n(input[\"canonical\"], \"input canonical\"), \"plan\": $n(input[\"plan\"], \"input plan\"), \"changed\": $n(input[\"changed\"], \"input changed\"), \"accepted\": $n(input[\"accepted\"], \"input accepted\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"canonical\"] <= 1) && (env[\"plan\"] <= 1) && (env[\"changed\"] <= 1) && (env[\"accepted\"] <= 1))) throw new RangeError(\"use normalized: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.use\": (((!(env[\"canonical\"] === 1)) && (env[\"plan\"] === 1) && (env[\"changed\"] === 1) && (env[\"accepted\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const headReadable = /* @__PURE__ */ (() => {\n// Generated from the machine head readable. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.readable\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"sequence\": $n(input[\"sequence\"], \"input sequence\"), \"version\": $n(input[\"version\"], \"input version\"), \"committed\": $n(input[\"committed\"], \"input committed\"), \"pending\": $n(input[\"pending\"], \"input pending\"), \"marker\": $n(input[\"marker\"], \"input marker\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"sequence\"] <= 1) && (env[\"version\"] <= 1) && (env[\"committed\"] <= 1) && (env[\"pending\"] <= 1) && (env[\"marker\"] <= 1))) throw new RangeError(\"head readable: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.readable\": (((env[\"sequence\"] === 1) && (env[\"version\"] === 1) && ((env[\"committed\"] === 1) || ((env[\"pending\"] === 1) && (env[\"marker\"] === 1)))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const certificateAccepted = /* @__PURE__ */ (() => {\n// Generated from the machine certificate accepted. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.accepted\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"f0\": $n(input[\"f0\"], \"input f0\"), \"f1\": $n(input[\"f1\"], \"input f1\"), \"f2\": $n(input[\"f2\"], \"input f2\"), \"f3\": $n(input[\"f3\"], \"input f3\"), \"f4\": $n(input[\"f4\"], \"input f4\"), \"f5\": $n(input[\"f5\"], \"input f5\"), \"f6\": $n(input[\"f6\"], \"input f6\"), \"f7\": $n(input[\"f7\"], \"input f7\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"f0\"] <= 1) && (env[\"f1\"] <= 1) && (env[\"f2\"] <= 1) && (env[\"f3\"] <= 1) && (env[\"f4\"] <= 1) && (env[\"f5\"] <= 1) && (env[\"f6\"] <= 1) && (env[\"f7\"] <= 1))) throw new RangeError(\"certificate accepted: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.accepted\": (((env[\"f0\"] === 1) && (env[\"f1\"] === 1) && (env[\"f2\"] === 1) && (env[\"f3\"] === 1) && (env[\"f4\"] === 1) && (env[\"f5\"] === 1) && (env[\"f6\"] === 1) && (env[\"f7\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const consume = /* @__PURE__ */ (() => {\n// Generated from the machine consume. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.released\": 0, \"out.active\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"active\": $n(input[\"active\"], \"input active\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!(env[\"active\"] <= 1)) throw new RangeError(\"consume: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.released\": ((env[\"active\"] === 1) ? 1 : 0), \"out.active\": (((env[\"active\"] === 1) && (!(env[\"active\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const summaryWithin = /* @__PURE__ */ (() => {\n// Generated from the machine summary within. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.within\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"bytes\": $n(input[\"bytes\"], \"input bytes\"), \"byteLimit\": $n(input[\"byteLimit\"], \"input byteLimit\"), \"projected\": $n(input[\"projected\"], \"input projected\"), \"target\": $n(input[\"target\"], \"input target\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const scalars = {...s, \"out.within\": (((env[\"bytes\"] <= env[\"byteLimit\"]) && (env[\"projected\"] <= env[\"target\"])) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const sampleWithin = /* @__PURE__ */ (() => {\n// Generated from the machine sample within. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.within\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"total\": $n(input[\"total\"], \"input total\"), \"retained\": $n(input[\"retained\"], \"input retained\"), \"omitted\": $n(input[\"omitted\"], \"input omitted\"), \"limit\": $n(input[\"limit\"], \"input limit\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const scalars = {...s, \"out.within\": (((env[\"total\"] === $x(env[\"retained\"] + env[\"omitted\"])) && (env[\"retained\"] <= env[\"limit\"])) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const chunkAccepted = /* @__PURE__ */ (() => {\n// Generated from the machine chunk accepted. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.accepted\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"start\": $n(input[\"start\"], \"input start\"), \"end\": $n(input[\"end\"], \"input end\"), \"total\": $n(input[\"total\"], \"input total\"), \"expectedStart\": $n(input[\"expectedStart\"], \"input expectedStart\"), \"expectedTotal\": $n(input[\"expectedTotal\"], \"input expectedTotal\"), \"length\": $n(input[\"length\"], \"input length\"), \"complete\": $n(input[\"complete\"], \"input complete\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!(env[\"complete\"] <= 1)) throw new RangeError(\"chunk accepted: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.accepted\": (((env[\"start\"] === env[\"expectedStart\"]) && (env[\"total\"] === env[\"expectedTotal\"]) && (env[\"start\"] <= env[\"end\"]) && (env[\"end\"] <= env[\"total\"]) && ($x(env[\"length\"] + env[\"start\"]) === env[\"end\"]) && (((!(env[\"complete\"] === 1)) || (env[\"end\"] === env[\"total\"])) && ((!(env[\"end\"] === env[\"total\"])) || (env[\"complete\"] === 1))) && ((env[\"complete\"] === 1) || (env[\"start\"] < env[\"end\"]))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "// Generated by scripts/verified-kernels.ts from proofs/compaction.ts with gdp-wired@0.12.7. 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; }\n\nexport const compactionCut = /* @__PURE__ */ (() => {\n// Generated from the machine compaction cut. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {\"eligible\": $n(params[\"eligible\"], \"param eligible\"), \"afterPrevious\": $n(params[\"afterPrevious\"], \"param afterPrevious\"), \"retained\": $n(params[\"retained\"], \"param retained\"), \"budget\": $n(params[\"budget\"], \"param budget\"), \"boundary\": $n(params[\"boundary\"], \"param boundary\")}, s = {};\n return {scalars: {\"phase\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"eligible\": $n(params[\"eligible\"], \"param eligible\"), \"afterPrevious\": $n(params[\"afterPrevious\"], \"param afterPrevious\"), \"retained\": $n(params[\"retained\"], \"param retained\"), \"budget\": $n(params[\"budget\"], \"param budget\"), \"boundary\": $n(params[\"boundary\"], \"param boundary\"), \"op\": $n(input[\"op\"], \"input op\"), \"first\": $n(input[\"first\"], \"input first\"), \"last\": $n(input[\"last\"], \"input last\"), \"paired\": $n(input[\"paired\"], \"input paired\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const flag0 = ((env[\"eligible\"] === 1) && (env[\"afterPrevious\"] === 1) && (env[\"retained\"] <= env[\"budget\"]));\n const flag1 = ((!(env[\"paired\"] === 1)) || (env[\"boundary\"] <= env[\"first\"]) || (env[\"last\"] < env[\"boundary\"]));\n if (!((env[\"op\"] < 2) && (env[\"paired\"] <= 1))) throw new RangeError(\"compaction cut: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"phase\": ((env[\"op\"] === 0) ? (((s[\"phase\"] === 0) && flag0) ? 1 : 2) : (((s[\"phase\"] === 1) && flag1) ? 1 : 2))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { VERIFIED_NAT_MAX } from \"./nat.js\";\nimport type { Machine } from \"./machine.js\";\nimport {\n transitionCurrent as transitionMachine, cleanupState as cleanupMachine, unknownConflict as unknownMachine,\n knownConflict as knownMachine, lineageSelected as lineageMachine, pointerCurrent as pointerMachine,\n coverageComplete as coverageMachine, useNormalized as normalizedMachine, headReadable as headMachine,\n certificateAccepted as certificateMachine, consume as consumeMachine, summaryWithin as summaryMachine,\n sampleWithin as sampleMachine, chunkAccepted as chunkMachine,\n} from \"./generated/policy.js\";\nimport { compactionCut } from \"./generated/compaction.js\";\n\n// Kept local rather than shared with ./machine.js: these decisions sit in the\n// startup graph, and the stateful kernels' codecs load at first use.\nconst bit = (value: boolean): number => (value ? 1 : 0);\nconst isNatural = (value: unknown): value is number => typeof value === \"number\" && Number.isSafeInteger(value) && value >= 0;\nconst call = (machine: Machine, input: object): Record<string, number> => machine.step({}, machine.init({}), input).scalars;\nconst yes = (value: number | undefined): boolean => value === 1;\n\nexport const transitionCurrent = (retired: boolean, sameEpoch: boolean, sameOwner: boolean, closed: boolean): boolean =>\n yes(call(transitionMachine, { retired: bit(retired), sameEpoch: bit(sameEpoch), sameOwner: bit(sameOwner), closed: bit(closed) })[\"out.ok\"]);\n\n/** 0 disposed, 1 diverted, 2 quarantined. */\nexport const cleanupState = (failed: boolean, diverted: boolean): number =>\n call(cleanupMachine, { failed: bit(failed), diverted: bit(diverted) })[\"out.state\"]!;\n\nexport const unknownConflict = (lu: boolean, luo: boolean, lo: boolean, ru: boolean, ruo: boolean, ro: boolean): boolean =>\n yes(call(unknownMachine, { lu: bit(lu), luo: bit(luo), lo: bit(lo), ru: bit(ru), ruo: bit(ruo), ro: bit(ro) })[\"out.conflict\"]);\n\nexport const knownConflict = (shared: boolean, leftOrdered: boolean, rightOrdered: boolean): boolean =>\n yes(call(knownMachine, { shared: bit(shared), leftOrdered: bit(leftOrdered), rightOrdered: bit(rightOrdered) })[\"out.conflict\"]);\n\nexport const lineageSelected = (allBranches: boolean, member: boolean): boolean =>\n yes(call(lineageMachine, { allBranches: bit(allBranches), member: bit(member) })[\"out.selected\"]);\n\nexport const pointerCurrent = (source: boolean, lineage: boolean): boolean =>\n yes(call(pointerMachine, { source: bit(source), lineage: bit(lineage) })[\"out.current\"]);\n\nexport const coverageComplete = (sourceComplete: boolean, truncated: boolean): boolean =>\n yes(call(coverageMachine, { sourceComplete: bit(sourceComplete), truncated: bit(truncated) })[\"out.complete\"]);\n\nexport const useNormalized = (canonical: boolean, plan: boolean, changed: boolean, accepted: boolean): boolean =>\n yes(call(normalizedMachine, { canonical: bit(canonical), plan: bit(plan), changed: bit(changed), accepted: bit(accepted) })[\"out.use\"]);\n\nexport const headReadable = (sequence: boolean, version: boolean, committed: boolean, pending: boolean, marker: boolean): boolean =>\n yes(call(headMachine, { sequence: bit(sequence), version: bit(version), committed: bit(committed), pending: bit(pending), marker: bit(marker) })[\"out.readable\"]);\n\n/** One-use consumption: whether this use releases the token, and whether it stays active. */\nexport const consume = (active: boolean): { released: boolean; active: boolean } => {\n const out = call(consumeMachine, { active: bit(active) });\n return { released: yes(out[\"out.released\"]), active: yes(out[\"out.active\"]) };\n};\n\nexport const acceptSummaryBounds = (bytes: number, byteLimit: number, projected: number, target: number): boolean =>\n [bytes, byteLimit, projected, target].every(isNatural) &&\n yes(call(summaryMachine, { bytes, byteLimit, projected, target })[\"out.within\"]);\n\nexport const acceptSampleAccounting = (total: number, retained: number, omitted: number, limit: number): boolean =>\n [total, retained, omitted, limit].every(isNatural) && retained + omitted <= VERIFIED_NAT_MAX &&\n yes(call(sampleMachine, { total, retained, omitted, limit })[\"out.within\"]);\n\nexport interface CutSpan {\n first: number;\n last: number;\n hasCall: boolean;\n hasResult: boolean;\n}\n\nexport interface CutCandidate {\n eligible: boolean;\n afterPrevious: boolean;\n retained: number;\n budget: number;\n boundary: number;\n}\n\nconst OPEN = 1;\n/** The producer may reject cheaply, but cannot publish a cut without this check.\n * The compiled cut machine folds the header and then every source span. */\nexport const acceptCompactionCut = (candidate: CutCandidate, spans: Iterable<CutSpan>): boolean => {\n if (![candidate.retained, candidate.budget, candidate.boundary].every(isNatural) ||\n typeof candidate.eligible !== \"boolean\" || typeof candidate.afterPrevious !== \"boolean\") return false;\n const params = {\n eligible: bit(candidate.eligible), afterPrevious: bit(candidate.afterPrevious),\n retained: candidate.retained, budget: candidate.budget, boundary: candidate.boundary,\n };\n let state = compactionCut.step(params, compactionCut.init(params), { op: 0, first: 0, last: 0, paired: 0 });\n if (state.scalars.phase !== OPEN) return false;\n for (const span of spans) {\n if (!isNatural(span.first) || !isNatural(span.last) || span.first > span.last ||\n typeof span.hasCall !== \"boolean\" || typeof span.hasResult !== \"boolean\") return false;\n state = compactionCut.step(params, state, { op: 1, first: span.first, last: span.last, paired: bit(span.hasCall && span.hasResult) });\n if (state.scalars.phase !== OPEN) return false;\n }\n return true;\n};\n\nexport interface TextRange { start: number; end: number; total: number; complete: boolean }\nexport const acceptMemoryChunk = (\n range: TextRange, length: number, expectedStart: number, expectedTotal: number,\n): boolean => {\n if (![range.start, range.end, range.total, length, expectedStart, expectedTotal].every(isNatural) ||\n range.start + length > VERIFIED_NAT_MAX || typeof range.complete !== \"boolean\") return false;\n return yes(call(chunkMachine, {\n start: range.start, end: range.end, total: range.total, expectedStart, expectedTotal,\n length, complete: bit(range.complete),\n })[\"out.accepted\"]);\n};\n\n/** A fixed ordered tuple prevents a missing check from becoming an empty,\n * vacuously accepted certificate. Messages are diagnostics, never authority. */\nexport const assertCertificateFacts = (\n facts: readonly [CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact],\n): void => {\n if (facts.length !== 8 || facts.some((fact) => typeof fact.valid !== \"boolean\")) {\n throw new Error(\"Invalid Schema certificate evidence\");\n }\n const input = Object.fromEntries(facts.map((fact, index) => [`f${index}`, bit(fact.valid)]));\n if (!yes(call(certificateMachine, input)[\"out.accepted\"])) {\n throw new Error(facts.find((fact) => !fact.valid)?.error ?? \"Schema certificate rejected\");\n }\n};\ninterface CertificateFact { valid: boolean; error: string }\n"],
|
|
5
|
+
"mappings": ";AAEO,IAAM,mBAAmB,OAAO;;;ACDvC,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,UAAU,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC1C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC1R,QAAI,EAAG,IAAI,SAAS,KAAK,KAAO,IAAI,WAAW,KAAK,KAAO,IAAI,WAAW,KAAK,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,wGAAwG;AACzO,UAAM,UAAU,EAAC,GAAG,GAAG,UAAa,EAAE,IAAI,SAAS,MAAM,MAAQ,IAAI,WAAW,MAAM,KAAO,IAAI,WAAW,MAAM,KAAO,EAAE,IAAI,QAAQ,MAAM,KAAO,IAAI,EAAE;AAC1J,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;AAEI,IAAM,eAAgC,uBAAM;AAEnD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,aAAa,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC7C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC7K,QAAI,EAAG,IAAI,QAAQ,KAAK,KAAO,IAAI,UAAU,KAAK,GAAK,OAAM,IAAI,WAAW,mGAAmG;AAC/K,UAAM,UAAU,EAAC,GAAG,GAAG,aAAe,IAAI,QAAQ,MAAM,IAAK,IAAM,IAAI,UAAU,MAAM,IAAK,IAAI,EAAG;AACnG,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;AAEI,IAAM,kBAAmC,uBAAM;AAEtD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACjS,QAAI,EAAG,IAAI,IAAI,KAAK,KAAO,IAAI,KAAK,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,KAAK,KAAK,KAAO,IAAI,IAAI,KAAK,GAAK,OAAM,IAAI,WAAW,sGAAsG;AAC1P,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAoB,IAAI,IAAI,MAAM,MAAQ,IAAI,KAAK,MAAM,KAAO,IAAI,IAAI,MAAM,MAAU,IAAI,IAAI,MAAM,MAAQ,IAAI,KAAK,MAAM,KAAO,IAAI,IAAI,MAAM,KAAQ,IAAI,EAAE;AACvL,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;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,eAAe,GAAG,MAAM,aAAa,GAAG,mBAAmB,GAAG,gBAAgB,GAAG,MAAM,cAAc,GAAG,oBAAoB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACvP,QAAI,EAAG,IAAI,QAAQ,KAAK,KAAO,IAAI,aAAa,KAAK,KAAO,IAAI,cAAc,KAAK,GAAK,OAAM,IAAI,WAAW,oGAAoG;AACjN,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,QAAQ,MAAM,MAAQ,IAAI,aAAa,MAAM,KAAO,IAAI,cAAc,MAAM,KAAO,IAAI,EAAE;AACvI,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;AAEI,IAAM,kBAAmC,uBAAM;AAEtD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,eAAe,GAAG,MAAM,aAAa,GAAG,mBAAmB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACtL,QAAI,EAAG,IAAI,aAAa,KAAK,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,sGAAsG;AACrL,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,aAAa,MAAM,KAAO,IAAI,QAAQ,MAAM,IAAM,IAAI,EAAE;AACtG,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;AAEI,IAAM,iBAAkC,uBAAM;AAErD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,eAAe,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC/C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC1K,QAAI,EAAG,IAAI,QAAQ,KAAK,KAAO,IAAI,SAAS,KAAK,GAAK,OAAM,IAAI,WAAW,qGAAqG;AAChL,UAAM,UAAU,EAAC,GAAG,GAAG,eAAkB,IAAI,QAAQ,MAAM,KAAO,IAAI,SAAS,MAAM,IAAM,IAAI,EAAE;AACjG,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;AAEI,IAAM,mBAAoC,uBAAM;AAEvD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,kBAAkB,GAAG,MAAM,gBAAgB,GAAG,sBAAsB,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACxM,QAAI,EAAG,IAAI,gBAAgB,KAAK,KAAO,IAAI,WAAW,KAAK,GAAK,OAAM,IAAI,WAAW,uGAAuG;AAC5L,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,gBAAgB,MAAM,KAAO,EAAE,IAAI,WAAW,MAAM,KAAO,IAAI,EAAE;AAC/G,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;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,WAAW,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC3C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,QAAQ,GAAG,MAAM,MAAM,GAAG,YAAY,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACjR,QAAI,EAAG,IAAI,WAAW,KAAK,KAAO,IAAI,MAAM,KAAK,KAAO,IAAI,SAAS,KAAK,KAAO,IAAI,UAAU,KAAK,GAAK,OAAM,IAAI,WAAW,oGAAoG;AAClO,UAAM,UAAU,EAAC,GAAG,GAAG,WAAc,EAAE,IAAI,WAAW,MAAM,MAAQ,IAAI,MAAM,MAAM,KAAO,IAAI,SAAS,MAAM,KAAO,IAAI,UAAU,MAAM,IAAM,IAAI,EAAE;AACrJ,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;AAEI,IAAM,eAAgC,uBAAM;AAEnD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACzU,QAAI,EAAG,IAAI,UAAU,KAAK,KAAO,IAAI,SAAS,KAAK,KAAO,IAAI,WAAW,KAAK,KAAO,IAAI,SAAS,KAAK,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,mGAAmG;AAC5P,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,UAAU,MAAM,KAAO,IAAI,SAAS,MAAM,MAAQ,IAAI,WAAW,MAAM,KAAQ,IAAI,SAAS,MAAM,KAAO,IAAI,QAAQ,MAAM,KAAQ,IAAI,EAAE;AACvL,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;AAEI,IAAM,sBAAuC,uBAAM;AAE1D,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACjW,QAAI,EAAG,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,GAAK,OAAM,IAAI,WAAW,0GAA0G;AACpS,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,IAAM,IAAI,EAAE;AACvN,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;AAEI,IAAM,UAA2B,uBAAM;AAE9C,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,GAAG,cAAc,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EACjE;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACxH,QAAI,EAAE,IAAI,QAAQ,KAAK,GAAI,OAAM,IAAI,WAAW,6FAA6F;AAC7I,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAkB,IAAI,QAAQ,MAAM,IAAK,IAAI,GAAI,cAAiB,IAAI,QAAQ,MAAM,KAAO,EAAE,IAAI,QAAQ,MAAM,KAAO,IAAI,EAAE;AACnJ,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;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,cAAc,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC9C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACpR,UAAM,UAAU,EAAC,GAAG,GAAG,cAAiB,IAAI,OAAO,KAAK,IAAI,WAAW,KAAO,IAAI,WAAW,KAAK,IAAI,QAAQ,IAAM,IAAI,EAAE;AAC1H,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;AAEI,IAAM,eAAgC,uBAAM;AAEnD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,cAAc,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC9C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACxQ,UAAM,UAAU,EAAC,GAAG,GAAG,cAAiB,IAAI,OAAO,MAAM,GAAG,IAAI,UAAU,IAAI,IAAI,SAAS,CAAC,KAAO,IAAI,UAAU,KAAK,IAAI,OAAO,IAAM,IAAI,EAAE;AAC7I,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;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,iBAAiB,GAAG,MAAM,eAAe,GAAG,qBAAqB,GAAG,iBAAiB,GAAG,MAAM,eAAe,GAAG,qBAAqB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACnb,QAAI,EAAE,IAAI,UAAU,KAAK,GAAI,OAAM,IAAI,WAAW,oGAAoG;AACtJ,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,OAAO,MAAM,IAAI,eAAe,KAAO,IAAI,OAAO,MAAM,IAAI,eAAe,KAAO,IAAI,OAAO,KAAK,IAAI,KAAK,KAAO,IAAI,KAAK,KAAK,IAAI,OAAO,KAAO,GAAG,IAAI,QAAQ,IAAI,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK,OAAS,EAAE,IAAI,UAAU,MAAM,MAAQ,IAAI,KAAK,MAAM,IAAI,OAAO,OAAS,EAAE,IAAI,KAAK,MAAM,IAAI,OAAO,MAAQ,IAAI,UAAU,MAAM,QAAU,IAAI,UAAU,MAAM,KAAO,IAAI,OAAO,IAAI,IAAI,KAAK,KAAO,IAAI,EAAE;AAC1b,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;;;ACjNH,SAASA,IAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AAElK,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,EAAC,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,iBAAiBA,IAAG,OAAO,eAAe,GAAG,qBAAqB,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,UAAUA,IAAG,OAAO,QAAQ,GAAG,cAAc,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,CAAC;AAC1S,WAAO,EAAC,SAAS,EAAC,SAAS,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EACzC;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,iBAAiBA,IAAG,OAAO,eAAe,GAAG,qBAAqB,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,UAAUA,IAAG,OAAO,QAAQ,GAAG,cAAc,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,MAAMA,IAAG,MAAM,IAAI,GAAG,UAAU,GAAG,SAASA,IAAG,MAAM,OAAO,GAAG,aAAa,GAAG,QAAQA,IAAG,MAAM,MAAM,GAAG,YAAY,GAAG,UAAUA,IAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACvgB,UAAM,QAAU,IAAI,UAAU,MAAM,KAAO,IAAI,eAAe,MAAM,KAAO,IAAI,UAAU,KAAK,IAAI,QAAQ;AAC1G,UAAM,QAAU,EAAE,IAAI,QAAQ,MAAM,MAAQ,IAAI,UAAU,KAAK,IAAI,OAAO,KAAO,IAAI,MAAM,IAAI,IAAI,UAAU;AAC7G,QAAI,EAAG,IAAI,IAAI,IAAI,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,oGAAoG;AACzK,UAAM,UAAU,EAAC,GAAG,GAAG,SAAW,IAAI,IAAI,MAAM,IAAQ,EAAE,OAAO,MAAM,KAAM,QAAS,IAAI,IAAQ,EAAE,OAAO,MAAM,KAAM,QAAS,IAAI,EAAG;AACvI,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;;;ACLH,IAAM,MAAM,CAAC,UAA4B,QAAQ,IAAI;AACrD,IAAM,YAAY,CAAC,UAAoC,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS;AAC5H,IAAM,OAAO,CAAC,SAAkB,UAA0C,QAAQ,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE;AACpH,IAAM,MAAM,CAAC,UAAuC,UAAU;AAEvD,IAAMC,qBAAoB,CAAC,SAAkB,WAAoB,WAAoB,WAC1F,IAAI,KAAK,mBAAmB,EAAE,SAAS,IAAI,OAAO,GAAG,WAAW,IAAI,SAAS,GAAG,WAAW,IAAI,SAAS,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC;AAGtI,IAAMC,gBAAe,CAAC,QAAiB,aAC5C,KAAK,cAAgB,EAAE,QAAQ,IAAI,MAAM,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAC,EAAE,WAAW;AAE7E,IAAMC,mBAAkB,CAAC,IAAa,KAAc,IAAa,IAAa,KAAc,OACjG,IAAI,KAAK,iBAAgB,EAAE,IAAI,IAAI,EAAE,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC;AAEzH,IAAMC,iBAAgB,CAAC,QAAiB,aAAsB,iBACnE,IAAI,KAAK,eAAc,EAAE,QAAQ,IAAI,MAAM,GAAG,aAAa,IAAI,WAAW,GAAG,cAAc,IAAI,YAAY,EAAE,CAAC,EAAE,cAAc,CAAC;AAE1H,IAAMC,mBAAkB,CAAC,aAAsB,WACpD,IAAI,KAAK,iBAAgB,EAAE,aAAa,IAAI,WAAW,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,cAAc,CAAC;AAE3F,IAAMC,kBAAiB,CAAC,QAAiB,YAC9C,IAAI,KAAK,gBAAgB,EAAE,QAAQ,IAAI,MAAM,GAAG,SAAS,IAAI,OAAO,EAAE,CAAC,EAAE,aAAa,CAAC;AAElF,IAAMC,oBAAmB,CAAC,gBAAyB,cACxD,IAAI,KAAK,kBAAiB,EAAE,gBAAgB,IAAI,cAAc,GAAG,WAAW,IAAI,SAAS,EAAE,CAAC,EAAE,cAAc,CAAC;AAExG,IAAMC,iBAAgB,CAAC,WAAoB,MAAe,SAAkB,aACjF,IAAI,KAAK,eAAmB,EAAE,WAAW,IAAI,SAAS,GAAG,MAAM,IAAI,IAAI,GAAG,SAAS,IAAI,OAAO,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAC,EAAE,SAAS,CAAC;AAEjI,IAAMC,gBAAe,CAAC,UAAmB,SAAkB,WAAoB,SAAkB,WACtG,IAAI,KAAK,cAAa,EAAE,UAAU,IAAI,QAAQ,GAAG,SAAS,IAAI,OAAO,GAAG,WAAW,IAAI,SAAS,GAAG,SAAS,IAAI,OAAO,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,cAAc,CAAC;AAG3J,IAAMC,WAAU,CAAC,WAA4D;AAClF,QAAM,MAAM,KAAK,SAAgB,EAAE,QAAQ,IAAI,MAAM,EAAE,CAAC;AACxD,SAAO,EAAE,UAAU,IAAI,IAAI,cAAc,CAAC,GAAG,QAAQ,IAAI,IAAI,YAAY,CAAC,EAAE;AAC9E;AAEO,IAAM,sBAAsB,CAAC,OAAe,WAAmB,WAAmB,WACvF,CAAC,OAAO,WAAW,WAAW,MAAM,EAAE,MAAM,SAAS,KACrD,IAAI,KAAK,eAAgB,EAAE,OAAO,WAAW,WAAW,OAAO,CAAC,EAAE,YAAY,CAAC;AAE1E,IAAM,yBAAyB,CAAC,OAAe,UAAkB,SAAiB,UACvF,CAAC,OAAO,UAAU,SAAS,KAAK,EAAE,MAAM,SAAS,KAAK,WAAW,WAAW,oBAC5E,IAAI,KAAK,cAAe,EAAE,OAAO,UAAU,SAAS,MAAM,CAAC,EAAE,YAAY,CAAC;AAiB5E,IAAM,OAAO;AAGN,IAAM,sBAAsB,CAAC,WAAyB,UAAsC;AACjG,MAAI,CAAC,CAAC,UAAU,UAAU,UAAU,QAAQ,UAAU,QAAQ,EAAE,MAAM,SAAS,KAC3E,OAAO,UAAU,aAAa,aAAa,OAAO,UAAU,kBAAkB,UAAW,QAAO;AACpG,QAAM,SAAS;AAAA,IACb,UAAU,IAAI,UAAU,QAAQ;AAAA,IAAG,eAAe,IAAI,UAAU,aAAa;AAAA,IAC7E,UAAU,UAAU;AAAA,IAAU,QAAQ,UAAU;AAAA,IAAQ,UAAU,UAAU;AAAA,EAC9E;AACA,MAAI,QAAQ,cAAc,KAAK,QAAQ,cAAc,KAAK,MAAM,GAAG,EAAE,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC;AAC1G,MAAI,MAAM,QAAQ,UAAU,KAAM,QAAO;AACzC,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,UAAU,KAAK,KAAK,KAAK,CAAC,UAAU,KAAK,IAAI,KAAK,KAAK,QAAQ,KAAK,QACrE,OAAO,KAAK,YAAY,aAAa,OAAO,KAAK,cAAc,UAAW,QAAO;AACrF,YAAQ,cAAc,KAAK,QAAQ,OAAO,EAAE,IAAI,GAAG,OAAO,KAAK,OAAO,MAAM,KAAK,MAAM,QAAQ,IAAI,KAAK,WAAW,KAAK,SAAS,EAAE,CAAC;AACpI,QAAI,MAAM,QAAQ,UAAU,KAAM,QAAO;AAAA,EAC3C;AACA,SAAO;AACT;AAGO,IAAM,oBAAoB,CAC/B,OAAkB,QAAgB,eAAuB,kBAC7C;AACZ,MAAI,CAAC,CAAC,MAAM,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,eAAe,aAAa,EAAE,MAAM,SAAS,KAC5F,MAAM,QAAQ,SAAS,oBAAoB,OAAO,MAAM,aAAa,UAAW,QAAO;AAC3F,SAAO,IAAI,KAAK,eAAc;AAAA,IAC5B,OAAO,MAAM;AAAA,IAAO,KAAK,MAAM;AAAA,IAAK,OAAO,MAAM;AAAA,IAAO;AAAA,IAAe;AAAA,IACvE;AAAA,IAAQ,UAAU,IAAI,MAAM,QAAQ;AAAA,EACtC,CAAC,EAAE,cAAc,CAAC;AACpB;AAIO,IAAM,yBAAyB,CACpC,UACS;AACT,MAAI,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC,SAAS,OAAO,KAAK,UAAU,SAAS,GAAG;AAC/E,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AACA,QAAM,QAAQ,OAAO,YAAY,MAAM,IAAI,CAAC,MAAM,UAAU,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC;AAC3F,MAAI,CAAC,IAAI,KAAK,qBAAoB,KAAK,EAAE,cAAc,CAAC,GAAG;AACzD,UAAM,IAAI,MAAM,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,KAAK,GAAG,SAAS,6BAA6B;AAAA,EAC3F;AACF;",
|
|
6
|
+
"names": ["$n", "transitionCurrent", "cleanupState", "unknownConflict", "knownConflict", "lineageSelected", "pointerCurrent", "coverageComplete", "useNormalized", "headReadable", "consume"]
|
|
7
|
+
}
|
|
@@ -15,7 +15,7 @@ import {
|
|
|
15
15
|
MAX_COMPACTION_INSTRUCTIONS_CHARS,
|
|
16
16
|
MAX_PRESERVE_ITEMS,
|
|
17
17
|
MAX_PRESERVE_ITEM_CHARS
|
|
18
|
-
} from "./chunk-
|
|
18
|
+
} from "./chunk-KB4KQ7KT.js";
|
|
19
19
|
import {
|
|
20
20
|
isFabricRunnerId
|
|
21
21
|
} from "./chunk-6QVQXGMR.js";
|
|
@@ -822,4 +822,4 @@ export {
|
|
|
822
822
|
AGENTS_ACTION_DESCRIPTORS,
|
|
823
823
|
normalizeAgentRunRequest
|
|
824
824
|
};
|
|
825
|
-
//# sourceMappingURL=chunk-
|
|
825
|
+
//# sourceMappingURL=chunk-IQ5F63LE.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
acceptSampleAccounting
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-IO64KE65.js";
|
|
4
4
|
|
|
5
5
|
// src/compaction/bounds.ts
|
|
6
6
|
var MAX_SUMMARY_BYTES = 32 * 1024;
|
|
@@ -486,4 +486,4 @@ export {
|
|
|
486
486
|
encodeCompactionRequest,
|
|
487
487
|
decodeCompactionInstructions
|
|
488
488
|
};
|
|
489
|
-
//# sourceMappingURL=chunk-
|
|
489
|
+
//# sourceMappingURL=chunk-KB4KQ7KT.js.map
|
|
@@ -143,7 +143,7 @@ import {
|
|
|
143
143
|
fabricExecTitleHintCached,
|
|
144
144
|
normalizeRunDisplay,
|
|
145
145
|
registerCompactionHook
|
|
146
|
-
} from "./chunk-
|
|
146
|
+
} from "./chunk-TLR3CWIF.js";
|
|
147
147
|
import {
|
|
148
148
|
fabricWriteBindings
|
|
149
149
|
} from "./chunk-SZUXWOO7.js";
|
|
@@ -165,15 +165,15 @@ import {
|
|
|
165
165
|
ApprovalController,
|
|
166
166
|
FabricAutoApprovalClassifier,
|
|
167
167
|
FabricSessionApprovals
|
|
168
|
-
} from "./chunk-
|
|
168
|
+
} from "./chunk-FAOWQ2C3.js";
|
|
169
169
|
import {
|
|
170
170
|
getActiveRepairCompiler,
|
|
171
171
|
setActiveCompiledSurface
|
|
172
|
-
} from "./chunk-
|
|
172
|
+
} from "./chunk-WH35F4JO.js";
|
|
173
173
|
import {
|
|
174
174
|
isFabricExecutionTraceV1,
|
|
175
175
|
readFabricExecutionTraceV1
|
|
176
|
-
} from "./chunk-
|
|
176
|
+
} from "./chunk-ULPAF2EY.js";
|
|
177
177
|
import {
|
|
178
178
|
PI_CORE_TOOL_NAMES,
|
|
179
179
|
PI_CORE_TOOL_NAME_SET
|
|
@@ -6962,4 +6962,4 @@ export {
|
|
|
6962
6962
|
FABRIC_MANAGED_HOST_VERSION,
|
|
6963
6963
|
createFabricExtension
|
|
6964
6964
|
};
|
|
6965
|
-
//# sourceMappingURL=chunk-
|
|
6965
|
+
//# sourceMappingURL=chunk-KH2JKXOQ.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
coverageComplete
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-IO64KE65.js";
|
|
4
4
|
|
|
5
5
|
// src/memory/tokenize.ts
|
|
6
6
|
var compareLexical = (left, right) => left < right ? -1 : left > right ? 1 : 0;
|
|
@@ -120,4 +120,4 @@ export {
|
|
|
120
120
|
planMemoryQuery,
|
|
121
121
|
foldSessionDigest
|
|
122
122
|
};
|
|
123
|
-
//# sourceMappingURL=chunk-
|
|
123
|
+
//# sourceMappingURL=chunk-KZX725OF.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
validateMeshTopic
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-XZKS6WUR.js";
|
|
4
4
|
import {
|
|
5
5
|
writeFileAtomic
|
|
6
6
|
} from "./chunk-IZIBLVU2.js";
|
|
@@ -232,4 +232,4 @@ export {
|
|
|
232
232
|
meshPostCommand,
|
|
233
233
|
wrapDurableNotifyScript
|
|
234
234
|
};
|
|
235
|
-
//# sourceMappingURL=chunk-
|
|
235
|
+
//# sourceMappingURL=chunk-LCZATITG.js.map
|
|
@@ -8,10 +8,10 @@ import {
|
|
|
8
8
|
agentParticipantRecords,
|
|
9
9
|
loadModelUsage,
|
|
10
10
|
useBudgetLedger
|
|
11
|
-
} from "./chunk-
|
|
11
|
+
} from "./chunk-BIMXYJ6U.js";
|
|
12
12
|
import {
|
|
13
13
|
MeshStore
|
|
14
|
-
} from "./chunk-
|
|
14
|
+
} from "./chunk-XZKS6WUR.js";
|
|
15
15
|
import {
|
|
16
16
|
RESIDENT_HOST_FORMAT,
|
|
17
17
|
residentDeliveryPrefix,
|
|
@@ -815,4 +815,4 @@ export {
|
|
|
815
815
|
residentIdleDecision,
|
|
816
816
|
runResidentHostFromConfigPath
|
|
817
817
|
};
|
|
818
|
-
//# sourceMappingURL=chunk-
|
|
818
|
+
//# sourceMappingURL=chunk-LPUOI5BZ.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-3UQEAJXZ.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-MU5IB2IR.js.map
|
|
@@ -5,7 +5,7 @@ import {
|
|
|
5
5
|
import {
|
|
6
6
|
checkObserve,
|
|
7
7
|
jevObserveSchema
|
|
8
|
-
} from "./chunk-
|
|
8
|
+
} from "./chunk-XDZHPIV3.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-QNDJXXYE.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-FAOWQ2C3.js";
|
|
27
27
|
import {
|
|
28
28
|
DECISION_APIS,
|
|
29
29
|
DECISION_MAX_BYTES
|
|
@@ -851,4 +851,4 @@ export {
|
|
|
851
851
|
JEV_ACTION_DESCRIPTORS,
|
|
852
852
|
JevProvider
|
|
853
853
|
};
|
|
854
|
-
//# sourceMappingURL=chunk-
|
|
854
|
+
//# sourceMappingURL=chunk-NBHUIZ6P.js.map
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
readFabricExecutionTraceV1
|
|
3
|
-
} from "./chunk-
|
|
3
|
+
} from "./chunk-ULPAF2EY.js";
|
|
4
4
|
|
|
5
5
|
// src/compaction/branch-details.ts
|
|
6
6
|
var FABRIC_BRANCH_SUMMARY_KIND = "pi-fabric.branch-summary";
|
|
@@ -218,4 +218,4 @@ export {
|
|
|
218
218
|
readFabricBranchSummaryDetails,
|
|
219
219
|
readFabricProjectionTrace
|
|
220
220
|
};
|
|
221
|
-
//# sourceMappingURL=chunk-
|
|
221
|
+
//# sourceMappingURL=chunk-NQZXLTLI.js.map
|