pi-fabric 0.118.0 → 0.119.0

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.
Files changed (188) hide show
  1. package/README.md +1 -1
  2. package/THIRD_PARTY_NOTICES.md +7 -8
  3. package/dist/agents.js +3 -3
  4. package/dist/chunks/{chunk-53N2I4QA.js → chunk-4FJLLWHW.js} +2 -2
  5. package/dist/chunks/{chunk-PW4QY7KA.js → chunk-5X56NZZH.js} +2 -2
  6. package/dist/chunks/{chunk-G4TLWHRS.js → chunk-AFVHOYPX.js} +2 -2
  7. package/dist/chunks/chunk-B76JMSSE.js +281 -0
  8. package/dist/chunks/chunk-B76JMSSE.js.map +7 -0
  9. package/dist/chunks/{chunk-XPLNN7SC.js → chunk-D6R3ZHAK.js} +4 -4
  10. package/dist/chunks/{chunk-TIJ3YQXX.js → chunk-DX273LMC.js} +2 -2
  11. package/dist/chunks/{chunk-FVRHS744.js → chunk-EDH4ZIPH.js} +2 -2
  12. package/dist/chunks/{chunk-7SJRJV4D.js → chunk-ERBZDTJX.js} +2 -2
  13. package/dist/chunks/{chunk-KVYNGDGC.js → chunk-FRMIHEIB.js} +6 -6
  14. package/dist/chunks/{chunk-KVYNGDGC.js.map → chunk-FRMIHEIB.js.map} +1 -1
  15. package/dist/chunks/{chunk-ZEXCKK4K.js → chunk-HCZ6ZGJC.js} +3 -3
  16. package/dist/chunks/{chunk-TIIIHPHF.js → chunk-J42WBU34.js} +2 -2
  17. package/dist/chunks/{chunk-HICYHMZ7.js → chunk-KFCIKTHZ.js} +3 -3
  18. package/dist/chunks/{chunk-MZUC6LLH.js → chunk-KFKNB664.js} +4 -4
  19. package/dist/chunks/{chunk-MZUC6LLH.js.map → chunk-KFKNB664.js.map} +1 -1
  20. package/dist/chunks/{chunk-MLLYR3Y6.js → chunk-LZUKF4FV.js} +2 -2
  21. package/dist/chunks/{chunk-P7CBPPHY.js → chunk-M3B5DUH3.js} +5 -5
  22. package/dist/chunks/{chunk-P7CBPPHY.js.map → chunk-M3B5DUH3.js.map} +1 -1
  23. package/dist/chunks/chunk-NJHJKINP.js +47 -0
  24. package/dist/chunks/chunk-NJHJKINP.js.map +7 -0
  25. package/dist/chunks/{chunk-OXV2RHYX.js → chunk-R5XLW7CK.js} +2 -2
  26. package/dist/chunks/{chunk-QM3E4SKI.js → chunk-RZAB4B3V.js} +5 -5
  27. package/dist/chunks/{chunk-OGIEFCSW.js → chunk-UPIZDFXG.js} +368 -345
  28. package/dist/chunks/chunk-UPIZDFXG.js.map +7 -0
  29. package/dist/chunks/{chunk-NJY47ABJ.js → chunk-VIRHLUBS.js} +2 -2
  30. package/dist/chunks/{chunk-QGMPFYIL.js → chunk-VN2G5MLR.js} +5 -5
  31. package/dist/chunks/{chunk-FUY6XVRX.js → chunk-VPLKR6FC.js} +2 -2
  32. package/dist/chunks/{chunk-INRXG4J5.js → chunk-VUBAADKS.js} +2 -2
  33. package/dist/chunks/{chunk-MPRBK7QD.js → chunk-W7LCJXNX.js} +3 -3
  34. package/dist/chunks/{chunk-AOECMP47.js → chunk-WAXENKGC.js} +4 -4
  35. package/dist/chunks/{chunk-CRRUW26I.js → chunk-XGHI4W4C.js} +12 -12
  36. package/dist/chunks/{chunk-CRRUW26I.js.map → chunk-XGHI4W4C.js.map} +2 -2
  37. package/dist/chunks/{chunk-D5NYNIST.js → chunk-XLPTKM7H.js} +5 -5
  38. package/dist/chunks/{chunk-4AKDLRIX.js → chunk-XNEJANCM.js} +45 -148
  39. package/dist/chunks/{chunk-4AKDLRIX.js.map → chunk-XNEJANCM.js.map} +3 -3
  40. package/dist/chunks/{chunk-NRRML46A.js → chunk-YBX2NAIG.js} +2 -2
  41. package/dist/cli/decisions.js +2 -1
  42. package/dist/cli/decisions.js.map +1 -1
  43. package/dist/cli/mesh.js +3 -2
  44. package/dist/cli/mesh.js.map +1 -1
  45. package/dist/compaction/hook.js +6 -6
  46. package/dist/compaction/owner.js +7 -7
  47. package/dist/components/effect-scope.d.ts.map +1 -1
  48. package/dist/core/action-registry.js +7 -6
  49. package/dist/core/provider-operations.d.ts.map +1 -1
  50. package/dist/core/provider-operations.js +59 -108
  51. package/dist/core/provider-operations.js.map +3 -3
  52. package/dist/entropy/index.js +8 -8
  53. package/dist/extension-bootstrap.js +9 -9
  54. package/dist/fabric-runtime-state.js +42 -41
  55. package/dist/fabric-runtime-state.js.map +2 -2
  56. package/dist/index.js +13 -13
  57. package/dist/jev/observation.js +5 -5
  58. package/dist/jev.js +8 -8
  59. package/dist/memory/digest.js +2 -2
  60. package/dist/memory/discovery.js +6 -6
  61. package/dist/memory/file-worker.js +9 -9
  62. package/dist/memory/normalize.js +5 -5
  63. package/dist/memory/search.js +7 -7
  64. package/dist/memory/worker-provider.js +10 -10
  65. package/dist/memory.js +10 -10
  66. package/dist/providers/jev-provider.js +8 -8
  67. package/dist/providers/memory-provider.js +9 -9
  68. package/dist/residency/host.js +10 -9
  69. package/dist/residency/pi-entry.js +10 -9
  70. package/dist/residency/pi-entry.js.map +1 -1
  71. package/dist/verified/authority.d.ts +2 -2
  72. package/dist/verified/authority.d.ts.map +1 -1
  73. package/dist/verified/generated/authority.d.ts +4 -0
  74. package/dist/verified/generated/authority.js +30 -0
  75. package/dist/verified/generated/compaction.d.ts +4 -0
  76. package/dist/verified/generated/compaction.js +24 -0
  77. package/dist/verified/generated/lifecycle.d.ts +4 -0
  78. package/dist/verified/generated/lifecycle.js +29 -0
  79. package/dist/verified/generated/manifest.json +87 -48
  80. package/dist/verified/generated/policy.d.ts +17 -0
  81. package/dist/verified/generated/policy.js +204 -0
  82. package/dist/verified/generated/provider.d.ts +4 -0
  83. package/dist/verified/generated/provider.js +23 -0
  84. package/dist/verified/generated/resources.d.ts +5 -0
  85. package/dist/verified/generated/resources.js +46 -0
  86. package/dist/verified/generated/storage.d.ts +4 -0
  87. package/dist/verified/generated/storage.js +22 -0
  88. package/dist/verified/lifecycle.d.ts +31 -0
  89. package/dist/verified/lifecycle.d.ts.map +1 -0
  90. package/dist/verified/machine.d.ts +18 -0
  91. package/dist/verified/machine.d.ts.map +1 -0
  92. package/dist/verified/memory.d.ts +1 -1
  93. package/dist/verified/memory.d.ts.map +1 -1
  94. package/dist/verified/nat.d.ts +1 -1
  95. package/dist/verified/nat.d.ts.map +1 -1
  96. package/dist/verified/policy.d.ts +17 -5
  97. package/dist/verified/policy.d.ts.map +1 -1
  98. package/dist/verified/provider.d.ts +22 -0
  99. package/dist/verified/provider.d.ts.map +1 -0
  100. package/dist/verified/resources.d.ts +20 -7
  101. package/dist/verified/resources.d.ts.map +1 -1
  102. package/dist/verified/storage.d.ts.map +1 -1
  103. package/docs/licenses/gdp-wired-mit.txt +21 -0
  104. package/docs/provider-capabilities.md +15 -14
  105. package/docs/verified-kernels.md +221 -219
  106. package/package.json +7 -9
  107. package/proofs/authority.ts +61 -0
  108. package/proofs/compaction.ts +51 -0
  109. package/proofs/index.ts +32 -0
  110. package/proofs/kernel.ts +36 -0
  111. package/proofs/lifecycle.ts +141 -0
  112. package/proofs/policy.ts +193 -0
  113. package/proofs/provider.ts +52 -0
  114. package/proofs/resources.ts +106 -0
  115. package/proofs/storage.ts +66 -0
  116. package/scripts/verified-kernels.ts +125 -0
  117. package/LAWS.bend +0 -502
  118. package/PROOF.bend +0 -452
  119. package/dist/chunks/chunk-BN7F52EG.js +0 -525
  120. package/dist/chunks/chunk-BN7F52EG.js.map +0 -7
  121. package/dist/chunks/chunk-OGIEFCSW.js.map +0 -7
  122. package/dist/verified/generated/authority-kernel.d.ts +0 -10
  123. package/dist/verified/generated/authority-kernel.js +0 -127
  124. package/dist/verified/generated/kernel.d.ts +0 -31
  125. package/dist/verified/generated/kernel.js +0 -389
  126. package/dist/verified/generated/lifecycle-kernel.d.ts +0 -7
  127. package/dist/verified/generated/lifecycle-kernel.js +0 -164
  128. package/dist/verified/generated/provider-kernel.d.ts +0 -9
  129. package/dist/verified/generated/provider-kernel.js +0 -87
  130. package/dist/verified/generated/storage-kernel.d.ts +0 -11
  131. package/dist/verified/generated/storage-kernel.js +0 -107
  132. package/docs/licenses/bend-apache-2.0.txt +0 -202
  133. package/proofs/abi.json +0 -308
  134. package/proofs/authority-abi.json +0 -7
  135. package/proofs/authority-kernel.bend +0 -23
  136. package/proofs/authority-proof.bend +0 -74
  137. package/proofs/authority-spec.bend +0 -30
  138. package/proofs/authority-state.bend +0 -43
  139. package/proofs/authority-types.d.ts +0 -3
  140. package/proofs/kernel.bend +0 -139
  141. package/proofs/lifecycle-abi.json +0 -3
  142. package/proofs/lifecycle-kernel.bend +0 -11
  143. package/proofs/lifecycle-proof.bend +0 -249
  144. package/proofs/lifecycle-spec.bend +0 -261
  145. package/proofs/lifecycle-types.d.ts +0 -4
  146. package/proofs/lifecycle.bend +0 -119
  147. package/proofs/provider-abi.json +0 -4
  148. package/proofs/provider-kernel.bend +0 -14
  149. package/proofs/provider-plans.bend +0 -28
  150. package/proofs/provider-spec.bend +0 -14
  151. package/proofs/provider-types.d.ts +0 -5
  152. package/proofs/resource-proof.bend +0 -633
  153. package/proofs/resource-spec.bend +0 -133
  154. package/proofs/resources.bend +0 -160
  155. package/proofs/state-kernel.bend +0 -17
  156. package/proofs/state-plans.bend +0 -40
  157. package/proofs/state-proof.bend +0 -42
  158. package/proofs/state-spec.bend +0 -26
  159. package/proofs/storage-abi.json +0 -3
  160. package/proofs/storage-kernel.bend +0 -11
  161. package/proofs/storage-plans.bend +0 -100
  162. package/proofs/storage-proof.bend +0 -176
  163. package/proofs/storage-spec.bend +0 -70
  164. package/proofs/storage-types.d.ts +0 -8
  165. package/proofs/types.d.ts +0 -7
  166. package/scripts/test-verified-kernels.mjs +0 -107
  167. package/scripts/verified-kernels.mjs +0 -176
  168. /package/dist/chunks/{chunk-53N2I4QA.js.map → chunk-4FJLLWHW.js.map} +0 -0
  169. /package/dist/chunks/{chunk-PW4QY7KA.js.map → chunk-5X56NZZH.js.map} +0 -0
  170. /package/dist/chunks/{chunk-G4TLWHRS.js.map → chunk-AFVHOYPX.js.map} +0 -0
  171. /package/dist/chunks/{chunk-XPLNN7SC.js.map → chunk-D6R3ZHAK.js.map} +0 -0
  172. /package/dist/chunks/{chunk-TIJ3YQXX.js.map → chunk-DX273LMC.js.map} +0 -0
  173. /package/dist/chunks/{chunk-FVRHS744.js.map → chunk-EDH4ZIPH.js.map} +0 -0
  174. /package/dist/chunks/{chunk-7SJRJV4D.js.map → chunk-ERBZDTJX.js.map} +0 -0
  175. /package/dist/chunks/{chunk-ZEXCKK4K.js.map → chunk-HCZ6ZGJC.js.map} +0 -0
  176. /package/dist/chunks/{chunk-TIIIHPHF.js.map → chunk-J42WBU34.js.map} +0 -0
  177. /package/dist/chunks/{chunk-HICYHMZ7.js.map → chunk-KFCIKTHZ.js.map} +0 -0
  178. /package/dist/chunks/{chunk-MLLYR3Y6.js.map → chunk-LZUKF4FV.js.map} +0 -0
  179. /package/dist/chunks/{chunk-OXV2RHYX.js.map → chunk-R5XLW7CK.js.map} +0 -0
  180. /package/dist/chunks/{chunk-QM3E4SKI.js.map → chunk-RZAB4B3V.js.map} +0 -0
  181. /package/dist/chunks/{chunk-NJY47ABJ.js.map → chunk-VIRHLUBS.js.map} +0 -0
  182. /package/dist/chunks/{chunk-QGMPFYIL.js.map → chunk-VN2G5MLR.js.map} +0 -0
  183. /package/dist/chunks/{chunk-FUY6XVRX.js.map → chunk-VPLKR6FC.js.map} +0 -0
  184. /package/dist/chunks/{chunk-INRXG4J5.js.map → chunk-VUBAADKS.js.map} +0 -0
  185. /package/dist/chunks/{chunk-MPRBK7QD.js.map → chunk-W7LCJXNX.js.map} +0 -0
  186. /package/dist/chunks/{chunk-AOECMP47.js.map → chunk-WAXENKGC.js.map} +0 -0
  187. /package/dist/chunks/{chunk-D5NYNIST.js.map → chunk-XLPTKM7H.js.map} +0 -0
  188. /package/dist/chunks/{chunk-NRRML46A.js.map → chunk-YBX2NAIG.js.map} +0 -0
package/README.md CHANGED
@@ -176,7 +176,7 @@ See the [interface & commands reference](docs/interface.md) for every view, keyb
176
176
  - [Components & committed capabilities](docs/components.md): supervised effects, exact requirements, external per-model guidance and execution-profile replacement, rolling provider generations, actor commitments, and both formal calculi.
177
177
  - [External providers](docs/providers.md): the versioned provider protocol for extensions.
178
178
  - [Architecture & security](docs/architecture.md): the host bridge, sandboxing, tool-call robustness, and limits.
179
- - [Verified policy kernels](docs/verified-kernels.md): executable Bend proofs, production acceptance gates, regeneration, and the trusted boundary.
179
+ - [Verified policy kernels](docs/verified-kernels.md): gdp-wired laws over the executed rules, production acceptance gates, regeneration, and the trusted boundary.
180
180
  - [Provider capabilities](docs/provider-capabilities.md): proved dispatch, authority attenuation, lifecycle transitions, cancellation/cleanup contracts, and trust boundaries.
181
181
  - [Catalog repairs](docs/repairs.md): unique extra keys and unknown actions promoted into silent schema maps.
182
182
  - [Tool entropy](docs/entropy.md): static capability-preserving normal forms, deterministic invocation-friction metrics, bounded repair witnesses, and offline `certify:entropy` proof checks.
@@ -15,14 +15,13 @@ unmodified under `node_modules/pi-coralbricks-provider`, at the exact version
15
15
  pinned in `package.json`. It is licensed under MIT, and its complete license is
16
16
  distributed beside it at `node_modules/pi-coralbricks-provider/LICENSE`.
17
17
 
18
- ## Bend 2.0.37
19
-
20
- The generated policy kernel includes Bend's emitted JavaScript trampoline and
21
- compiled Base primitives from [Bend 2.0.37](https://github.com/bendlang/bend/tree/v2.0.37),
22
- Copyright 2026 HigherOrderCO, licensed under Apache-2.0. Pi Fabric selects the
23
- ABI library exports, adapts constructor tags at the boundary, and tree-shakes
24
- unused runtime code.
25
- The complete license is distributed at [docs/licenses/bend-apache-2.0.txt](docs/licenses/bend-apache-2.0.txt).
18
+ ## gdp-wired
19
+
20
+ The generated verified kernels in `dist/verified/generated/` are JavaScript
21
+ emitted by the compiler of [gdp-wired](https://github.com/monotykamary/gdp-wired),
22
+ including its small runtime guard helpers, Copyright (c) 2026 Tom X Nguyen,
23
+ licensed under MIT. The prover itself is a build-time dependency and is not
24
+ shipped. The complete license is distributed at [docs/licenses/gdp-wired-mit.txt](docs/licenses/gdp-wired-mit.txt).
26
25
 
27
26
 
28
27
  Pi Fabric's QuickJS host-bridge design and TypeScript code-mode ergonomics were informed by the MIT-licensed [`boozedog/pi-codemode`](https://github.com/boozedog/pi-codemode) project.
package/dist/agents.js CHANGED
@@ -1,7 +1,7 @@
1
1
  import {
2
2
  AGENTS_ACTION_DESCRIPTORS,
3
3
  normalizeAgentRunRequest
4
- } from "./chunks/chunk-FVRHS744.js";
4
+ } from "./chunks/chunk-EDH4ZIPH.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-INRXG4J5.js";
20
+ import "./chunks/chunk-VUBAADKS.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-BN7F52EG.js";
25
+ import "./chunks/chunk-B76JMSSE.js";
26
26
 
27
27
  // src/agents/service-schema.ts
28
28
  import { Value } from "typebox/value";
@@ -1,7 +1,7 @@
1
1
  import {
2
2
  applyNormalFormPlan,
3
3
  deriveNormalFormPlan
4
- } from "./chunk-P7CBPPHY.js";
4
+ } from "./chunk-M3B5DUH3.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-53N2I4QA.js.map
51
+ //# sourceMappingURL=chunk-4FJLLWHW.js.map
@@ -10,7 +10,7 @@ import {
10
10
  MAX_NORMAL_FORM_PLANS,
11
11
  isNormalFormPlan,
12
12
  provesNormalFormPlan
13
- } from "./chunk-P7CBPPHY.js";
13
+ } from "./chunk-M3B5DUH3.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-PW4QY7KA.js.map
419
+ //# sourceMappingURL=chunk-5X56NZZH.js.map
@@ -2,7 +2,7 @@ import {
2
2
  applyActiveArgRepairs,
3
3
  getActiveRepairCompiler,
4
4
  normalizeActiveArguments
5
- } from "./chunk-53N2I4QA.js";
5
+ } from "./chunk-4FJLLWHW.js";
6
6
 
7
7
  // src/core/action-result.ts
8
8
  var PREVIEW_ARG_CHARS = 2e3;
@@ -190,4 +190,4 @@ export {
190
190
  repairCatalogInput,
191
191
  validateCatalogArgs
192
192
  };
193
- //# sourceMappingURL=chunk-G4TLWHRS.js.map
193
+ //# sourceMappingURL=chunk-AFVHOYPX.js.map
@@ -0,0 +1,281 @@
1
+ // src/verified/nat.ts
2
+ var VERIFIED_NAT_MAX = Number.MAX_SAFE_INTEGER;
3
+
4
+ // src/verified/generated/policy.js
5
+ function $n(v, what) {
6
+ if (typeof v !== "number" || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + " must be a natural below 2^53, not " + v);
7
+ return v;
8
+ }
9
+ function $x(v) {
10
+ if (v > 9007199254740991) throw new RangeError("a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run");
11
+ return v;
12
+ }
13
+ var transitionCurrent = /* @__PURE__ */ (() => {
14
+ function init(params) {
15
+ const env = {}, s = {};
16
+ return { scalars: { "out.ok": 0 }, maps: {} };
17
+ }
18
+ function step(params, state, input) {
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
+ const scalars = { ...s, "out.ok": !(env["retired"] === 1) && env["sameEpoch"] === 1 && env["sameOwner"] === 1 && !(env["closed"] === 1) ? 1 : 0 };
21
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
22
+ }
23
+ return { init, step };
24
+ })();
25
+ var cleanupState = /* @__PURE__ */ (() => {
26
+ function init(params) {
27
+ const env = {}, s = {};
28
+ return { scalars: { "out.state": 0 }, maps: {} };
29
+ }
30
+ function step(params, state, input) {
31
+ const env = { "failed": $n(input["failed"], "input failed"), "diverted": $n(input["diverted"], "input diverted") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
32
+ const scalars = { ...s, "out.state": env["failed"] === 1 ? 2 : env["diverted"] === 1 ? 1 : 0 };
33
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
34
+ }
35
+ return { init, step };
36
+ })();
37
+ var unknownConflict = /* @__PURE__ */ (() => {
38
+ function init(params) {
39
+ const env = {}, s = {};
40
+ return { scalars: { "out.conflict": 0 }, maps: {} };
41
+ }
42
+ function step(params, state, input) {
43
+ 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;
44
+ 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
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
46
+ }
47
+ return { init, step };
48
+ })();
49
+ var knownConflict = /* @__PURE__ */ (() => {
50
+ function init(params) {
51
+ const env = {}, s = {};
52
+ return { scalars: { "out.conflict": 0 }, maps: {} };
53
+ }
54
+ function step(params, state, input) {
55
+ 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;
56
+ const scalars = { ...s, "out.conflict": env["shared"] === 1 && (env["leftOrdered"] === 1 || env["rightOrdered"] === 1) ? 1 : 0 };
57
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
58
+ }
59
+ return { init, step };
60
+ })();
61
+ var lineageSelected = /* @__PURE__ */ (() => {
62
+ function init(params) {
63
+ const env = {}, s = {};
64
+ return { scalars: { "out.selected": 0 }, maps: {} };
65
+ }
66
+ function step(params, state, input) {
67
+ const env = { "allBranches": $n(input["allBranches"], "input allBranches"), "member": $n(input["member"], "input member") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
68
+ const scalars = { ...s, "out.selected": env["allBranches"] === 1 || env["member"] === 1 ? 1 : 0 };
69
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
70
+ }
71
+ return { init, step };
72
+ })();
73
+ var pointerCurrent = /* @__PURE__ */ (() => {
74
+ function init(params) {
75
+ const env = {}, s = {};
76
+ return { scalars: { "out.current": 0 }, maps: {} };
77
+ }
78
+ function step(params, state, input) {
79
+ const env = { "source": $n(input["source"], "input source"), "lineage": $n(input["lineage"], "input lineage") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
80
+ const scalars = { ...s, "out.current": env["source"] === 1 && env["lineage"] === 1 ? 1 : 0 };
81
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
82
+ }
83
+ return { init, step };
84
+ })();
85
+ var coverageComplete = /* @__PURE__ */ (() => {
86
+ function init(params) {
87
+ const env = {}, s = {};
88
+ return { scalars: { "out.complete": 0 }, maps: {} };
89
+ }
90
+ function step(params, state, input) {
91
+ const env = { "sourceComplete": $n(input["sourceComplete"], "input sourceComplete"), "truncated": $n(input["truncated"], "input truncated") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
92
+ const scalars = { ...s, "out.complete": env["sourceComplete"] === 1 && !(env["truncated"] === 1) ? 1 : 0 };
93
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
94
+ }
95
+ return { init, step };
96
+ })();
97
+ var useNormalized = /* @__PURE__ */ (() => {
98
+ function init(params) {
99
+ const env = {}, s = {};
100
+ return { scalars: { "out.use": 0 }, maps: {} };
101
+ }
102
+ function step(params, state, input) {
103
+ 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;
104
+ const scalars = { ...s, "out.use": !(env["canonical"] === 1) && env["plan"] === 1 && env["changed"] === 1 && env["accepted"] === 1 ? 1 : 0 };
105
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
106
+ }
107
+ return { init, step };
108
+ })();
109
+ var headReadable = /* @__PURE__ */ (() => {
110
+ function init(params) {
111
+ const env = {}, s = {};
112
+ return { scalars: { "out.readable": 0 }, maps: {} };
113
+ }
114
+ function step(params, state, input) {
115
+ 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;
116
+ const scalars = { ...s, "out.readable": env["sequence"] === 1 && env["version"] === 1 && (env["committed"] === 1 || env["pending"] === 1 && env["marker"] === 1) ? 1 : 0 };
117
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
118
+ }
119
+ return { init, step };
120
+ })();
121
+ var certificateAccepted = /* @__PURE__ */ (() => {
122
+ function init(params) {
123
+ const env = {}, s = {};
124
+ return { scalars: { "out.accepted": 0 }, maps: {} };
125
+ }
126
+ function step(params, state, input) {
127
+ 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;
128
+ 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
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
130
+ }
131
+ return { init, step };
132
+ })();
133
+ var consume = /* @__PURE__ */ (() => {
134
+ function init(params) {
135
+ const env = {}, s = {};
136
+ return { scalars: { "out.released": 0, "out.active": 0 }, maps: {} };
137
+ }
138
+ function step(params, state, input) {
139
+ const env = { "active": $n(input["active"], "input active") }, s = state.scalars, dft = { ...state.defaults }, maps = state.maps;
140
+ const scalars = { ...s, "out.released": env["active"] === 1 ? 1 : 0, "out.active": env["active"] === 1 && !(env["active"] === 1) ? 1 : 0 };
141
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
142
+ }
143
+ return { init, step };
144
+ })();
145
+ var summaryWithin = /* @__PURE__ */ (() => {
146
+ function init(params) {
147
+ const env = {}, s = {};
148
+ return { scalars: { "out.within": 0 }, maps: {} };
149
+ }
150
+ function step(params, state, input) {
151
+ 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;
152
+ const scalars = { ...s, "out.within": env["bytes"] <= env["byteLimit"] && env["projected"] <= env["target"] ? 1 : 0 };
153
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
154
+ }
155
+ return { init, step };
156
+ })();
157
+ var sampleWithin = /* @__PURE__ */ (() => {
158
+ function init(params) {
159
+ const env = {}, s = {};
160
+ return { scalars: { "out.within": 0 }, maps: {} };
161
+ }
162
+ function step(params, state, input) {
163
+ 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;
164
+ const scalars = { ...s, "out.within": env["total"] === $x(env["retained"] + env["omitted"]) && env["retained"] <= env["limit"] ? 1 : 0 };
165
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
166
+ }
167
+ return { init, step };
168
+ })();
169
+ var chunkAccepted = /* @__PURE__ */ (() => {
170
+ function init(params) {
171
+ const env = {}, s = {};
172
+ return { scalars: { "out.accepted": 0 }, maps: {} };
173
+ }
174
+ function step(params, state, input) {
175
+ 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;
176
+ 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
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
178
+ }
179
+ return { init, step };
180
+ })();
181
+
182
+ // src/verified/generated/compaction.js
183
+ function $n2(v, what) {
184
+ if (typeof v !== "number" || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + " must be a natural below 2^53, not " + v);
185
+ return v;
186
+ }
187
+ var compactionCut = /* @__PURE__ */ (() => {
188
+ function init(params) {
189
+ 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") }, s = {};
190
+ return { scalars: { "phase": 0 }, maps: {} };
191
+ }
192
+ function step(params, state, input) {
193
+ 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
+ const flag0 = env["eligible"] === 1 && env["afterPrevious"] === 1 && env["retained"] <= env["budget"];
195
+ const flag1 = !(env["paired"] === 1) || env["boundary"] <= env["first"] || env["last"] < env["boundary"];
196
+ const scalars = { ...s, "phase": env["op"] === 0 ? s["phase"] === 0 && flag0 ? 1 : 2 : s["phase"] === 1 && flag1 ? 1 : 2 };
197
+ return Object.keys(dft).length ? { scalars, maps: state.maps, defaults: dft } : { scalars, maps: state.maps };
198
+ }
199
+ return { init, step };
200
+ })();
201
+
202
+ // src/verified/policy.ts
203
+ var bit = (value) => value ? 1 : 0;
204
+ var isNatural = (value) => typeof value === "number" && Number.isSafeInteger(value) && value >= 0;
205
+ var call = (machine, input) => machine.step({}, machine.init({}), input).scalars;
206
+ var yes = (value) => value === 1;
207
+ var transitionCurrent2 = (retired, sameEpoch, sameOwner, closed) => yes(call(transitionCurrent, { retired: bit(retired), sameEpoch: bit(sameEpoch), sameOwner: bit(sameOwner), closed: bit(closed) })["out.ok"]);
208
+ var cleanupState2 = (failed, diverted) => call(cleanupState, { failed: bit(failed), diverted: bit(diverted) })["out.state"];
209
+ var unknownConflict2 = (lu, luo, lo, ru, ruo, ro) => yes(call(unknownConflict, { lu: bit(lu), luo: bit(luo), lo: bit(lo), ru: bit(ru), ruo: bit(ruo), ro: bit(ro) })["out.conflict"]);
210
+ var knownConflict2 = (shared, leftOrdered, rightOrdered) => yes(call(knownConflict, { shared: bit(shared), leftOrdered: bit(leftOrdered), rightOrdered: bit(rightOrdered) })["out.conflict"]);
211
+ var lineageSelected2 = (allBranches, member) => yes(call(lineageSelected, { allBranches: bit(allBranches), member: bit(member) })["out.selected"]);
212
+ var pointerCurrent2 = (source, lineage) => yes(call(pointerCurrent, { source: bit(source), lineage: bit(lineage) })["out.current"]);
213
+ var coverageComplete2 = (sourceComplete, truncated) => yes(call(coverageComplete, { sourceComplete: bit(sourceComplete), truncated: bit(truncated) })["out.complete"]);
214
+ var useNormalized2 = (canonical, plan, changed, accepted) => yes(call(useNormalized, { canonical: bit(canonical), plan: bit(plan), changed: bit(changed), accepted: bit(accepted) })["out.use"]);
215
+ var headReadable2 = (sequence, version, committed, pending, marker) => yes(call(headReadable, { sequence: bit(sequence), version: bit(version), committed: bit(committed), pending: bit(pending), marker: bit(marker) })["out.readable"]);
216
+ var consume2 = (active) => {
217
+ const out = call(consume, { active: bit(active) });
218
+ return { released: yes(out["out.released"]), active: yes(out["out.active"]) };
219
+ };
220
+ var acceptSummaryBounds = (bytes, byteLimit, projected, target) => [bytes, byteLimit, projected, target].every(isNatural) && yes(call(summaryWithin, { bytes, byteLimit, projected, target })["out.within"]);
221
+ var acceptSampleAccounting = (total, retained, omitted, limit) => [total, retained, omitted, limit].every(isNatural) && retained + omitted <= VERIFIED_NAT_MAX && yes(call(sampleWithin, { total, retained, omitted, limit })["out.within"]);
222
+ var OPEN = 1;
223
+ var acceptCompactionCut = (candidate, spans) => {
224
+ if (![candidate.retained, candidate.budget, candidate.boundary].every(isNatural) || typeof candidate.eligible !== "boolean" || typeof candidate.afterPrevious !== "boolean") return false;
225
+ const params = {
226
+ eligible: bit(candidate.eligible),
227
+ afterPrevious: bit(candidate.afterPrevious),
228
+ retained: candidate.retained,
229
+ budget: candidate.budget,
230
+ boundary: candidate.boundary
231
+ };
232
+ let state = compactionCut.step(params, compactionCut.init(params), { op: 0, first: 0, last: 0, paired: 0 });
233
+ if (state.scalars.phase !== OPEN) return false;
234
+ for (const span of spans) {
235
+ if (!isNatural(span.first) || !isNatural(span.last) || span.first > span.last || typeof span.hasCall !== "boolean" || typeof span.hasResult !== "boolean") return false;
236
+ state = compactionCut.step(params, state, { op: 1, first: span.first, last: span.last, paired: bit(span.hasCall && span.hasResult) });
237
+ if (state.scalars.phase !== OPEN) return false;
238
+ }
239
+ return true;
240
+ };
241
+ var acceptMemoryChunk = (range, length, expectedStart, expectedTotal) => {
242
+ if (![range.start, range.end, range.total, length, expectedStart, expectedTotal].every(isNatural) || range.start + length > VERIFIED_NAT_MAX || typeof range.complete !== "boolean") return false;
243
+ return yes(call(chunkAccepted, {
244
+ start: range.start,
245
+ end: range.end,
246
+ total: range.total,
247
+ expectedStart,
248
+ expectedTotal,
249
+ length,
250
+ complete: bit(range.complete)
251
+ })["out.accepted"]);
252
+ };
253
+ var assertCertificateFacts = (facts) => {
254
+ if (facts.length !== 8 || facts.some((fact) => typeof fact.valid !== "boolean")) {
255
+ throw new Error("Invalid Schema certificate evidence");
256
+ }
257
+ const input = Object.fromEntries(facts.map((fact, index) => [`f${index}`, bit(fact.valid)]));
258
+ if (!yes(call(certificateAccepted, input)["out.accepted"])) {
259
+ throw new Error(facts.find((fact) => !fact.valid)?.error ?? "Schema certificate rejected");
260
+ }
261
+ };
262
+
263
+ export {
264
+ VERIFIED_NAT_MAX,
265
+ transitionCurrent2 as transitionCurrent,
266
+ cleanupState2 as cleanupState,
267
+ unknownConflict2 as unknownConflict,
268
+ knownConflict2 as knownConflict,
269
+ lineageSelected2 as lineageSelected,
270
+ pointerCurrent2 as pointerCurrent,
271
+ coverageComplete2 as coverageComplete,
272
+ useNormalized2 as useNormalized,
273
+ headReadable2 as headReadable,
274
+ consume2 as consume,
275
+ acceptSummaryBounds,
276
+ acceptSampleAccounting,
277
+ acceptCompactionCut,
278
+ acceptMemoryChunk,
279
+ assertCertificateFacts
280
+ };
281
+ //# sourceMappingURL=chunk-B76JMSSE.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.7.0. 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; }\nfunction $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }\nfunction $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }\nfunction $breaks(maps, reads, cmps) { const p = new Set([0]); for (const [n, d, minus] of reads) { for (const s of maps[n].keys()) { if (minus) p.add(s + d); else if (s >= d) p.add(s - d); } if (minus) p.add(d); } for (const [v, d, minus] of cmps) { if (minus) { p.add(v + d); p.add(d); } else if (v >= d) p.add(v - d); } const keys = new Set(); for (const q of p) for (let i = -1; i <= 2; i++) if (q + i >= 0) keys.add(q + i); const sorted = [...keys].sort((a, b) => a - b); sorted.push(sorted[sorted.length - 1] + 1); return sorted; }\nfunction $dense(keys, f) { const top = keys[keys.length - 1]; if (top > 1000000) throw new RangeError('a write at every key reads its key in arithmetic past a million keys (' + top + ')'); const d = f(top), cells = new Map(); for (let k = 0; k < top; k++) { const v = f(k); if (v !== d) cells.set(k, v); } return {cells, d}; }\nfunction $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }\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 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 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 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 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 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 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 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 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 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 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 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 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.7.0. 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; }\nfunction $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }\nfunction $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }\nfunction $breaks(maps, reads, cmps) { const p = new Set([0]); for (const [n, d, minus] of reads) { for (const s of maps[n].keys()) { if (minus) p.add(s + d); else if (s >= d) p.add(s - d); } if (minus) p.add(d); } for (const [v, d, minus] of cmps) { if (minus) { p.add(v + d); p.add(d); } else if (v >= d) p.add(v - d); } const keys = new Set(); for (const q of p) for (let i = -1; i <= 2; i++) if (q + i >= 0) keys.add(q + i); const sorted = [...keys].sort((a, b) => a - b); sorted.push(sorted[sorted.length - 1] + 1); return sorted; }\nfunction $dense(keys, f) { const top = keys[keys.length - 1]; if (top > 1000000) throw new RangeError('a write at every key reads its key in arithmetic past a million keys (' + top + ')'); const d = f(top), cells = new Map(); for (let k = 0; k < top; k++) { const v = f(k); if (v !== d) cells.set(k, v); } return {cells, d}; }\nfunction $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }\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 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;AAOnK,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,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,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,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,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,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,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,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,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,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,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,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,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;;;AC1MH,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;AAQlK,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,EAAC,YAAYC,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,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;;;ACVH,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", "$n", "transitionCurrent", "cleanupState", "unknownConflict", "knownConflict", "lineageSelected", "pointerCurrent", "coverageComplete", "useNormalized", "headReadable", "consume"]
7
+ }
@@ -5,7 +5,7 @@ import {
5
5
  import {
6
6
  checkObserve,
7
7
  jevObserveSchema
8
- } from "./chunk-7SJRJV4D.js";
8
+ } from "./chunk-ERBZDTJX.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-G4TLWHRS.js";
18
+ } from "./chunk-AFVHOYPX.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-OXV2RHYX.js";
26
+ } from "./chunk-R5XLW7CK.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-XPLNN7SC.js.map
854
+ //# sourceMappingURL=chunk-D6R3ZHAK.js.map
@@ -1,6 +1,6 @@
1
1
  import {
2
2
  readFabricExecutionTraceV1
3
- } from "./chunk-MLLYR3Y6.js";
3
+ } from "./chunk-LZUKF4FV.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-TIJ3YQXX.js.map
221
+ //# sourceMappingURL=chunk-DX273LMC.js.map
@@ -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-INRXG4J5.js";
18
+ } from "./chunk-VUBAADKS.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-FVRHS744.js.map
825
+ //# sourceMappingURL=chunk-EDH4ZIPH.js.map
@@ -6,7 +6,7 @@ import {
6
6
  } from "./chunk-FSYAGCGA.js";
7
7
  import {
8
8
  validationMessage
9
- } from "./chunk-G4TLWHRS.js";
9
+ } from "./chunk-AFVHOYPX.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-7SJRJV4D.js.map
286
+ //# sourceMappingURL=chunk-ERBZDTJX.js.map
@@ -5,14 +5,14 @@ import {
5
5
  normalizeMemoryPhrase,
6
6
  planMemoryQuery,
7
7
  tokenizeLexical
8
- } from "./chunk-MZUC6LLH.js";
8
+ } from "./chunk-KFKNB664.js";
9
9
  import {
10
10
  DEFAULT_MEMORY_INDEX_PRIVACY,
11
11
  normalizeSession
12
- } from "./chunk-D5NYNIST.js";
12
+ } from "./chunk-XLPTKM7H.js";
13
13
  import {
14
- Re
15
- } from "./chunk-BN7F52EG.js";
14
+ coverageComplete
15
+ } from "./chunk-B76JMSSE.js";
16
16
 
17
17
  // src/memory/index.ts
18
18
  import crypto2 from "node:crypto";
@@ -350,7 +350,7 @@ var maxFittingPrefix = (values, fits) => {
350
350
  var fitDigestCache = (digest, maxBytes) => {
351
351
  applyCacheMetrics(digest);
352
352
  if (digest.cacheBytes <= maxBytes) return digest;
353
- digest.indexCoverage.complete = Re(digest.indexCoverage.complete, true);
353
+ digest.indexCoverage.complete = coverageComplete(digest.indexCoverage.complete, true);
354
354
  if (!digest.indexCoverage.reasons.includes("max_cold_cache_bytes")) {
355
355
  digest.indexCoverage.reasons.push("max_cold_cache_bytes");
356
356
  }
@@ -1242,4 +1242,4 @@ export {
1242
1242
  searchMemoryIndex,
1243
1243
  searchShards
1244
1244
  };
1245
- //# sourceMappingURL=chunk-KVYNGDGC.js.map
1245
+ //# sourceMappingURL=chunk-FRMIHEIB.js.map