pi-fabric 0.119.1 → 0.119.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (101) hide show
  1. package/dist/agents.js +3 -3
  2. package/dist/chunks/{chunk-UGL2GGEI.js → chunk-2CK6AXFV.js} +3 -3
  3. package/dist/chunks/{chunk-KV2BMN4O.js → chunk-3I7BOD7I.js} +2 -2
  4. package/dist/chunks/{chunk-KTMY3N4K.js → chunk-3LAFYYJQ.js} +2 -2
  5. package/dist/chunks/{chunk-V77AT4MY.js → chunk-4HESA6IH.js} +1 -1
  6. package/dist/chunks/{chunk-V77AT4MY.js.map → chunk-4HESA6IH.js.map} +1 -1
  7. package/dist/chunks/{chunk-IQEYJ7JH.js → chunk-4ZC7S7WM.js} +2 -2
  8. package/dist/chunks/{chunk-QTZ7LABB.js → chunk-55HN5FIN.js} +4 -4
  9. package/dist/chunks/{chunk-EZSZHQI5.js → chunk-5OCTOWOT.js} +3 -3
  10. package/dist/chunks/{chunk-KKM4N4KK.js → chunk-AQNJ3NGK.js} +5 -5
  11. package/dist/chunks/{chunk-2MQNW2TR.js → chunk-BEUJKVW7.js} +5 -5
  12. package/dist/chunks/{chunk-2MQNW2TR.js.map → chunk-BEUJKVW7.js.map} +1 -1
  13. package/dist/chunks/{chunk-CGBPO5GZ.js → chunk-BGXY424A.js} +6 -6
  14. package/dist/chunks/{chunk-THPZ3K5D.js → chunk-GEFDLAAN.js} +2 -2
  15. package/dist/chunks/{chunk-C3T2PF4D.js → chunk-M4PC2VVT.js} +2 -2
  16. package/dist/chunks/{chunk-7LO5MUUW.js → chunk-MUW5GZGV.js} +5 -5
  17. package/dist/chunks/{chunk-Y6RTTXB7.js → chunk-NBOBIS7K.js} +2 -2
  18. package/dist/chunks/{chunk-ESBX5W3V.js → chunk-O2TQ243N.js} +4 -4
  19. package/dist/chunks/{chunk-YMW6GBWU.js → chunk-OZXEPZ37.js} +4 -4
  20. package/dist/chunks/{chunk-YBNTQL7H.js → chunk-P7WCYZXS.js} +2 -2
  21. package/dist/chunks/{chunk-JI4HOOAT.js → chunk-QO4E75U3.js} +2 -2
  22. package/dist/chunks/{chunk-H7TWWJZ6.js → chunk-STJ3QF7N.js} +2 -2
  23. package/dist/chunks/{chunk-CL4CTBRZ.js → chunk-SU237EZI.js} +2 -2
  24. package/dist/chunks/{chunk-IXXSXJZ3.js → chunk-UGLBJ6RS.js} +1 -1
  25. package/dist/chunks/{chunk-IXXSXJZ3.js.map → chunk-UGLBJ6RS.js.map} +1 -1
  26. package/dist/chunks/{chunk-W23LT3LG.js → chunk-VR3KXTNR.js} +2 -2
  27. package/dist/chunks/{chunk-XBNRUKNC.js → chunk-WEAJT5NU.js} +3 -3
  28. package/dist/chunks/{chunk-H6XUB2XT.js → chunk-WZ6JGJY6.js} +3 -3
  29. package/dist/chunks/{chunk-ZDJT6TLX.js → chunk-XHGIFCKY.js} +7 -3
  30. package/dist/chunks/chunk-XHGIFCKY.js.map +7 -0
  31. package/dist/chunks/{chunk-WU72VY7D.js → chunk-YR33LQ3D.js} +2 -2
  32. package/dist/chunks/{chunk-WCA63AQA.js → chunk-ZJXXGYAZ.js} +2 -2
  33. package/dist/chunks/{chunk-EI3Q35TB.js → chunk-ZTPFPLDC.js} +2 -2
  34. package/dist/chunks/{chunk-IPOMULFZ.js → chunk-ZX7ROXSS.js} +2 -2
  35. package/dist/cli/decisions.js +1 -1
  36. package/dist/cli/mesh.js +2 -2
  37. package/dist/compaction/hook.js +6 -6
  38. package/dist/compaction/owner.js +7 -7
  39. package/dist/core/action-registry.js +6 -6
  40. package/dist/core/provider-operations.js.map +1 -1
  41. package/dist/entropy/index.js +8 -8
  42. package/dist/extension-bootstrap.js +9 -9
  43. package/dist/fabric-runtime-state.js +24 -24
  44. package/dist/index.js +13 -13
  45. package/dist/jev/observation.js +5 -5
  46. package/dist/jev.js +8 -8
  47. package/dist/memory/digest.js +2 -2
  48. package/dist/memory/discovery.js +6 -6
  49. package/dist/memory/file-worker.js +9 -9
  50. package/dist/memory/normalize.js +5 -5
  51. package/dist/memory/search.js +7 -7
  52. package/dist/memory/worker-provider.js +10 -10
  53. package/dist/memory.js +10 -10
  54. package/dist/programs/host.js +1 -1
  55. package/dist/programs/store.d.ts.map +1 -1
  56. package/dist/providers/jev-provider.js +8 -8
  57. package/dist/providers/memory-provider.js +9 -9
  58. package/dist/residency/host.js +9 -9
  59. package/dist/residency/pi-entry.js +9 -9
  60. package/dist/verified/generated/authority.d.ts +1 -1
  61. package/dist/verified/generated/authority.js +1 -1
  62. package/dist/verified/generated/compaction.d.ts +1 -1
  63. package/dist/verified/generated/compaction.js +1 -1
  64. package/dist/verified/generated/lifecycle.d.ts +1 -1
  65. package/dist/verified/generated/lifecycle.js +1 -1
  66. package/dist/verified/generated/manifest.json +15 -15
  67. package/dist/verified/generated/policy.d.ts +1 -1
  68. package/dist/verified/generated/policy.js +1 -1
  69. package/dist/verified/generated/provider.d.ts +1 -1
  70. package/dist/verified/generated/provider.js +1 -1
  71. package/dist/verified/generated/resources.d.ts +1 -1
  72. package/dist/verified/generated/resources.js +1 -1
  73. package/dist/verified/generated/storage.d.ts +1 -1
  74. package/dist/verified/generated/storage.js +1 -1
  75. package/package.json +2 -2
  76. package/dist/chunks/chunk-ZDJT6TLX.js.map +0 -7
  77. /package/dist/chunks/{chunk-UGL2GGEI.js.map → chunk-2CK6AXFV.js.map} +0 -0
  78. /package/dist/chunks/{chunk-KV2BMN4O.js.map → chunk-3I7BOD7I.js.map} +0 -0
  79. /package/dist/chunks/{chunk-KTMY3N4K.js.map → chunk-3LAFYYJQ.js.map} +0 -0
  80. /package/dist/chunks/{chunk-IQEYJ7JH.js.map → chunk-4ZC7S7WM.js.map} +0 -0
  81. /package/dist/chunks/{chunk-QTZ7LABB.js.map → chunk-55HN5FIN.js.map} +0 -0
  82. /package/dist/chunks/{chunk-EZSZHQI5.js.map → chunk-5OCTOWOT.js.map} +0 -0
  83. /package/dist/chunks/{chunk-KKM4N4KK.js.map → chunk-AQNJ3NGK.js.map} +0 -0
  84. /package/dist/chunks/{chunk-CGBPO5GZ.js.map → chunk-BGXY424A.js.map} +0 -0
  85. /package/dist/chunks/{chunk-THPZ3K5D.js.map → chunk-GEFDLAAN.js.map} +0 -0
  86. /package/dist/chunks/{chunk-C3T2PF4D.js.map → chunk-M4PC2VVT.js.map} +0 -0
  87. /package/dist/chunks/{chunk-7LO5MUUW.js.map → chunk-MUW5GZGV.js.map} +0 -0
  88. /package/dist/chunks/{chunk-Y6RTTXB7.js.map → chunk-NBOBIS7K.js.map} +0 -0
  89. /package/dist/chunks/{chunk-ESBX5W3V.js.map → chunk-O2TQ243N.js.map} +0 -0
  90. /package/dist/chunks/{chunk-YMW6GBWU.js.map → chunk-OZXEPZ37.js.map} +0 -0
  91. /package/dist/chunks/{chunk-YBNTQL7H.js.map → chunk-P7WCYZXS.js.map} +0 -0
  92. /package/dist/chunks/{chunk-JI4HOOAT.js.map → chunk-QO4E75U3.js.map} +0 -0
  93. /package/dist/chunks/{chunk-H7TWWJZ6.js.map → chunk-STJ3QF7N.js.map} +0 -0
  94. /package/dist/chunks/{chunk-CL4CTBRZ.js.map → chunk-SU237EZI.js.map} +0 -0
  95. /package/dist/chunks/{chunk-W23LT3LG.js.map → chunk-VR3KXTNR.js.map} +0 -0
  96. /package/dist/chunks/{chunk-XBNRUKNC.js.map → chunk-WEAJT5NU.js.map} +0 -0
  97. /package/dist/chunks/{chunk-H6XUB2XT.js.map → chunk-WZ6JGJY6.js.map} +0 -0
  98. /package/dist/chunks/{chunk-WU72VY7D.js.map → chunk-YR33LQ3D.js.map} +0 -0
  99. /package/dist/chunks/{chunk-WCA63AQA.js.map → chunk-ZJXXGYAZ.js.map} +0 -0
  100. /package/dist/chunks/{chunk-EI3Q35TB.js.map → chunk-ZTPFPLDC.js.map} +0 -0
  101. /package/dist/chunks/{chunk-IPOMULFZ.js.map → chunk-ZX7ROXSS.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-YBNTQL7H.js";
4
+ } from "./chunks/chunk-P7WCYZXS.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-EI3Q35TB.js";
20
+ import "./chunks/chunk-ZTPFPLDC.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-V77AT4MY.js";
25
+ import "./chunks/chunk-4HESA6IH.js";
26
26
 
27
27
  // src/agents/service-schema.ts
28
28
  import { Value } from "typebox/value";
@@ -1,10 +1,10 @@
1
1
  import {
2
2
  readFabricBranchSummaryDetails,
3
3
  readFabricProjectionTrace
4
- } from "./chunk-WCA63AQA.js";
4
+ } from "./chunk-ZJXXGYAZ.js";
5
5
  import {
6
6
  lineageSelected
7
- } from "./chunk-V77AT4MY.js";
7
+ } from "./chunk-4HESA6IH.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-UGL2GGEI.js.map
657
+ //# sourceMappingURL=chunk-2CK6AXFV.js.map
@@ -3,7 +3,7 @@ import {
3
3
  } from "./chunk-YU62DDKK.js";
4
4
  import {
5
5
  isNormalFormWitness
6
- } from "./chunk-IPOMULFZ.js";
6
+ } from "./chunk-ZX7ROXSS.js";
7
7
 
8
8
  // src/audit/projection.ts
9
9
  var emptyProjection = (args) => ({
@@ -831,4 +831,4 @@ export {
831
831
  isFabricExecutionTraceV1,
832
832
  readFabricExecutionTraceV1
833
833
  };
834
- //# sourceMappingURL=chunk-KV2BMN4O.js.map
834
+ //# sourceMappingURL=chunk-3I7BOD7I.js.map
@@ -10,7 +10,7 @@ import {
10
10
  MAX_NORMAL_FORM_PLANS,
11
11
  isNormalFormPlan,
12
12
  provesNormalFormPlan
13
- } from "./chunk-IPOMULFZ.js";
13
+ } from "./chunk-ZX7ROXSS.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-KTMY3N4K.js.map
419
+ //# sourceMappingURL=chunk-3LAFYYJQ.js.map
@@ -278,4 +278,4 @@ export {
278
278
  acceptMemoryChunk,
279
279
  assertCertificateFacts
280
280
  };
281
- //# sourceMappingURL=chunk-V77AT4MY.js.map
281
+ //# sourceMappingURL=chunk-4HESA6IH.js.map
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "version": 3,
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.2. 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 $spread(keys, n) { const out = new Set(); for (const k of keys) for (let i = 0; i < n; i++) out.add(k + i); return [...out].sort((a, b) => a - b); }\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.12.2. 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 $spread(keys, n) { const out = new Set(); for (const k of keys) for (let i = 0; i < n; i++) out.add(k + i); return [...out].sort((a, b) => a - b); }\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"],
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.3. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\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 $spread(keys, n) { const out = new Set(); for (const k of keys) for (let i = 0; i < n; i++) out.add(k + i); return [...out].sort((a, b) => a - b); }\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.12.3. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\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 $spread(keys, n) { const out = new Set(); for (const k of keys) for (let i = 0; i < n; i++) out.add(k + i); return [...out].sort((a, b) => a - b); }\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
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;AAQnK,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;;;AC3MH,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;AASlK,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;;;ACXH,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
6
  "names": ["$n", "$n", "transitionCurrent", "cleanupState", "unknownConflict", "knownConflict", "lineageSelected", "pointerCurrent", "coverageComplete", "useNormalized", "headReadable", "consume"]
7
7
  }
@@ -2,7 +2,7 @@ import {
2
2
  applyActiveArgRepairs,
3
3
  getActiveRepairCompiler,
4
4
  normalizeActiveArguments
5
- } from "./chunk-CL4CTBRZ.js";
5
+ } from "./chunk-SU237EZI.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-IQEYJ7JH.js.map
193
+ //# sourceMappingURL=chunk-4ZC7S7WM.js.map
@@ -5,7 +5,7 @@ import {
5
5
  import {
6
6
  checkObserve,
7
7
  jevObserveSchema
8
- } from "./chunk-JI4HOOAT.js";
8
+ } from "./chunk-QO4E75U3.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-IQEYJ7JH.js";
18
+ } from "./chunk-4ZC7S7WM.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-H7TWWJZ6.js";
26
+ } from "./chunk-STJ3QF7N.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-QTZ7LABB.js.map
854
+ //# sourceMappingURL=chunk-55HN5FIN.js.map
@@ -8,10 +8,10 @@ import {
8
8
  agentParticipantRecords,
9
9
  loadModelUsage,
10
10
  useBudgetLedger
11
- } from "./chunk-H6XUB2XT.js";
11
+ } from "./chunk-WZ6JGJY6.js";
12
12
  import {
13
13
  MeshStore
14
- } from "./chunk-IXXSXJZ3.js";
14
+ } from "./chunk-UGLBJ6RS.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-EZSZHQI5.js.map
818
+ //# sourceMappingURL=chunk-5OCTOWOT.js.map
@@ -143,7 +143,7 @@ import {
143
143
  fabricExecTitleHintCached,
144
144
  normalizeRunDisplay,
145
145
  registerCompactionHook
146
- } from "./chunk-YMW6GBWU.js";
146
+ } from "./chunk-OZXEPZ37.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-H7TWWJZ6.js";
168
+ } from "./chunk-STJ3QF7N.js";
169
169
  import {
170
170
  getActiveRepairCompiler,
171
171
  setActiveCompiledSurface
172
- } from "./chunk-CL4CTBRZ.js";
172
+ } from "./chunk-SU237EZI.js";
173
173
  import {
174
174
  isFabricExecutionTraceV1,
175
175
  readFabricExecutionTraceV1
176
- } from "./chunk-KV2BMN4O.js";
176
+ } from "./chunk-3I7BOD7I.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-KKM4N4KK.js.map
6965
+ //# sourceMappingURL=chunk-AQNJ3NGK.js.map
@@ -22,7 +22,7 @@ import {
22
22
  strictDecisionResult,
23
23
  validateCatalogArgs,
24
24
  validationMessage
25
- } from "./chunk-IQEYJ7JH.js";
25
+ } from "./chunk-4ZC7S7WM.js";
26
26
  import {
27
27
  runAbortable,
28
28
  settleWithin,
@@ -36,12 +36,12 @@ import {
36
36
  getActiveRepairCompiler,
37
37
  isActiveQuarantine,
38
38
  normalizeActiveArguments
39
- } from "./chunk-CL4CTBRZ.js";
39
+ } from "./chunk-SU237EZI.js";
40
40
  import {
41
41
  FabricResolutionError,
42
42
  FabricTraceSafeError,
43
43
  executionOutcomeFromError
44
- } from "./chunk-KV2BMN4O.js";
44
+ } from "./chunk-3I7BOD7I.js";
45
45
  import {
46
46
  stableJsonHash
47
47
  } from "./chunk-3YZUQESG.js";
@@ -50,7 +50,7 @@ import {
50
50
  consume,
51
51
  knownConflict,
52
52
  unknownConflict
53
- } from "./chunk-V77AT4MY.js";
53
+ } from "./chunk-4HESA6IH.js";
54
54
 
55
55
  // src/verified/generated/authority.js
56
56
  function $n(v, what) {
@@ -2175,4 +2175,4 @@ export {
2175
2175
  scoreActionSearch,
2176
2176
  ActionRegistry
2177
2177
  };
2178
- //# sourceMappingURL=chunk-2MQNW2TR.js.map
2178
+ //# sourceMappingURL=chunk-BEUJKVW7.js.map