pi-fabric 0.119.4 → 0.119.5

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 (170) hide show
  1. package/dist/agents.js +3 -3
  2. package/dist/audit/details.d.ts +1 -1
  3. package/dist/audit/details.d.ts.map +1 -1
  4. package/dist/audit/trace-schema.d.ts +50 -0
  5. package/dist/audit/trace-schema.d.ts.map +1 -0
  6. package/dist/audit/trace.d.ts +2 -48
  7. package/dist/audit/trace.d.ts.map +1 -1
  8. package/dist/chunks/{chunk-IO64KE65.js → chunk-2WT5GNUP.js} +1 -1
  9. package/dist/chunks/{chunk-IO64KE65.js.map → chunk-2WT5GNUP.js.map} +1 -1
  10. package/dist/chunks/{chunk-LNCG7GR6.js → chunk-36DWG6CP.js} +13 -13
  11. package/dist/chunks/chunk-36DWG6CP.js.map +7 -0
  12. package/dist/chunks/{chunk-FAOWQ2C3.js → chunk-474EF4LC.js} +2 -2
  13. package/dist/chunks/chunk-474EF4LC.js.map +7 -0
  14. package/dist/chunks/{chunk-WLUMFHDX.js → chunk-4DJPPVM6.js} +6 -6
  15. package/dist/chunks/{chunk-TLR3CWIF.js → chunk-57AXNQVW.js} +19 -98
  16. package/dist/chunks/chunk-57AXNQVW.js.map +7 -0
  17. package/dist/chunks/{chunk-NQZXLTLI.js → chunk-5OPYNHI6.js} +2 -2
  18. package/dist/chunks/{chunk-NQZXLTLI.js.map → chunk-5OPYNHI6.js.map} +1 -1
  19. package/dist/chunks/{chunk-BIMXYJ6U.js → chunk-7JDFICEH.js} +17 -15
  20. package/dist/chunks/{chunk-BIMXYJ6U.js.map → chunk-7JDFICEH.js.map} +1 -1
  21. package/dist/chunks/{chunk-5QS7PFWD.js → chunk-7OQGN47K.js} +4 -4
  22. package/dist/chunks/{chunk-4HRBFAU5.js → chunk-BPAACXYZ.js} +3 -3
  23. package/dist/chunks/{chunk-XDZHPIV3.js → chunk-BU4ENBYU.js} +5 -5
  24. package/dist/chunks/{chunk-ULPAF2EY.js → chunk-C3FFCLYG.js} +11 -78
  25. package/dist/chunks/chunk-C3FFCLYG.js.map +7 -0
  26. package/dist/chunks/chunk-C5JCNEWO.js +17 -0
  27. package/dist/chunks/chunk-C5JCNEWO.js.map +7 -0
  28. package/dist/chunks/{chunk-3UGN25XS.js → chunk-DIV2LS7X.js} +62 -1657
  29. package/dist/chunks/chunk-DIV2LS7X.js.map +7 -0
  30. package/dist/chunks/{chunk-FLXFYKS7.js → chunk-E4OD6Q54.js} +2 -2
  31. package/dist/chunks/{chunk-LPUOI5BZ.js → chunk-EHDL2RGJ.js} +3 -3
  32. package/dist/chunks/{chunk-2RSSU4NI.js → chunk-EQHAEYW5.js} +2 -2
  33. package/dist/chunks/chunk-F2LGSRIN.js +38 -0
  34. package/dist/chunks/chunk-F2LGSRIN.js.map +7 -0
  35. package/dist/chunks/{chunk-KH2JKXOQ.js → chunk-G2TY76TG.js} +135 -1097
  36. package/dist/chunks/chunk-G2TY76TG.js.map +7 -0
  37. package/dist/chunks/{chunk-GARKXYZT.js → chunk-HKQUC5EK.js} +3 -3
  38. package/dist/chunks/{chunk-YDJJMB3Z.js → chunk-JQEX3JPS.js} +42 -15
  39. package/dist/chunks/{chunk-YDJJMB3Z.js.map → chunk-JQEX3JPS.js.map} +2 -2
  40. package/dist/chunks/chunk-K67ZI5EI.js +94 -0
  41. package/dist/chunks/chunk-K67ZI5EI.js.map +7 -0
  42. package/dist/chunks/{chunk-7BKIL623.js → chunk-PI5HYN6C.js} +2 -2
  43. package/dist/chunks/{chunk-WH35F4JO.js → chunk-PK6ZB2YW.js} +2 -2
  44. package/dist/chunks/{chunk-KZX725OF.js → chunk-QHBH3XQ4.js} +2 -2
  45. package/dist/chunks/{chunk-V6IZH5K5.js → chunk-R7IMFOVG.js} +7 -7
  46. package/dist/chunks/{chunk-3UQEAJXZ.js → chunk-RYR555GF.js} +2 -2
  47. package/dist/chunks/{chunk-6WASKKYA.js → chunk-SJTNQLAJ.js} +5 -5
  48. package/dist/chunks/{chunk-MU5IB2IR.js → chunk-STF6ZFSQ.js} +2 -2
  49. package/dist/chunks/{chunk-KB4KQ7KT.js → chunk-STPXP6PN.js} +2 -2
  50. package/dist/chunks/{chunk-XZKS6WUR.js → chunk-UGISETNM.js} +1 -1
  51. package/dist/chunks/{chunk-XZKS6WUR.js.map → chunk-UGISETNM.js.map} +1 -1
  52. package/dist/chunks/{chunk-2F2RH2EN.js → chunk-VOFAFTGA.js} +2 -2
  53. package/dist/chunks/{chunk-PYFJW3HC.js → chunk-W5FEHVZA.js} +2 -16
  54. package/dist/chunks/{chunk-PYFJW3HC.js.map → chunk-W5FEHVZA.js.map} +3 -3
  55. package/dist/chunks/{chunk-LCZATITG.js → chunk-WIS6TT6Y.js} +2 -2
  56. package/dist/chunks/{chunk-QNDJXXYE.js → chunk-YJS5AZEU.js} +2 -2
  57. package/dist/chunks/{chunk-IQ5F63LE.js → chunk-YZNC6X4J.js} +6 -6
  58. package/dist/chunks/{chunk-NBHUIZ6P.js → chunk-Z6JOMCM6.js} +4 -4
  59. package/dist/chunks/{chunk-Y6JU46FD.js → chunk-ZCNOQ6NK.js} +8 -8
  60. package/dist/chunks/chunk-ZUWFYDYF.js +84 -0
  61. package/dist/chunks/chunk-ZUWFYDYF.js.map +7 -0
  62. package/dist/cli/decisions.js +1 -1
  63. package/dist/cli/mesh.js +2 -2
  64. package/dist/commands/fabric-handler.d.ts +7 -0
  65. package/dist/commands/fabric-handler.d.ts.map +1 -0
  66. package/dist/commands/fabric-handler.js +880 -0
  67. package/dist/commands/fabric-handler.js.map +7 -0
  68. package/dist/commands/fabric.d.ts +11 -1
  69. package/dist/commands/fabric.d.ts.map +1 -1
  70. package/dist/compaction/hook.d.ts +6 -1
  71. package/dist/compaction/hook.d.ts.map +1 -1
  72. package/dist/compaction/hook.js +9 -7
  73. package/dist/compaction/owner.js +8 -8
  74. package/dist/compaction/trace-events.d.ts +1 -1
  75. package/dist/compaction/trace-events.d.ts.map +1 -1
  76. package/dist/components/configuration.js +3 -3
  77. package/dist/core/action-registry.js +8 -7
  78. package/dist/core/prompt-guidance.d.ts +4 -0
  79. package/dist/core/prompt-guidance.d.ts.map +1 -0
  80. package/dist/core/prompt-guidance.js +139 -0
  81. package/dist/core/prompt-guidance.js.map +7 -0
  82. package/dist/core/provider-operations.js.map +1 -1
  83. package/dist/entropy/index.js +10 -9
  84. package/dist/extension-bootstrap.d.ts.map +1 -1
  85. package/dist/extension-bootstrap.js +12 -15
  86. package/dist/extension-bootstrap.js.map +1 -1
  87. package/dist/extension.d.ts.map +1 -1
  88. package/dist/fabric-runtime-state.js +55 -50
  89. package/dist/fabric-runtime-state.js.map +1 -1
  90. package/dist/index.d.ts.map +1 -1
  91. package/dist/index.js +24 -24
  92. package/dist/jev/observation.js +6 -6
  93. package/dist/jev.js +9 -10
  94. package/dist/memory/digest.js +2 -2
  95. package/dist/memory/discovery.js +6 -7
  96. package/dist/memory/file-worker.js +9 -10
  97. package/dist/memory/file-worker.js.map +1 -1
  98. package/dist/memory/normalize.js +5 -6
  99. package/dist/memory/search.js +7 -8
  100. package/dist/memory/worker-provider.js +10 -11
  101. package/dist/memory.js +10 -11
  102. package/dist/memory.js.map +1 -1
  103. package/dist/providers/jev-provider.js +9 -10
  104. package/dist/providers/memory-provider.js +9 -10
  105. package/dist/residency/host.js +15 -13
  106. package/dist/residency/pi-entry.js +15 -13
  107. package/dist/residency/pi-entry.js.map +1 -1
  108. package/dist/runtime/cpython-runtime.js +3 -3
  109. package/dist/runtime/monty-runtime.js +7 -7
  110. package/dist/runtime/node-process-runtime.js +4 -4
  111. package/dist/runtime/quickjs-runtime.js +3 -3
  112. package/dist/runtime/typescript-kernel.js +7 -7
  113. package/dist/topology/peer-settle.js +11 -0
  114. package/dist/topology/peer-settle.js.map +7 -0
  115. package/dist/ui/conversation.js +4 -4
  116. package/dist/ui/core-tool-render.d.ts +1 -0
  117. package/dist/ui/core-tool-render.d.ts.map +1 -1
  118. package/dist/ui/dashboard.js +8 -7
  119. package/dist/ui/dashboard.js.map +1 -1
  120. package/dist/ui/settings.js +2 -2
  121. package/dist/ui/word-diff/line-emphasis.js +1603 -0
  122. package/dist/ui/word-diff/line-emphasis.js.map +7 -0
  123. package/dist/verified/generated/authority.d.ts +1 -1
  124. package/dist/verified/generated/authority.js +1 -1
  125. package/dist/verified/generated/compaction.d.ts +1 -1
  126. package/dist/verified/generated/compaction.js +1 -1
  127. package/dist/verified/generated/lifecycle.d.ts +1 -1
  128. package/dist/verified/generated/lifecycle.js +34 -9
  129. package/dist/verified/generated/manifest.json +18 -18
  130. package/dist/verified/generated/policy.d.ts +1 -1
  131. package/dist/verified/generated/policy.js +1 -1
  132. package/dist/verified/generated/provider.d.ts +1 -1
  133. package/dist/verified/generated/provider.js +1 -1
  134. package/dist/verified/generated/resources.d.ts +1 -1
  135. package/dist/verified/generated/resources.js +1 -1
  136. package/dist/verified/generated/storage.d.ts +1 -1
  137. package/dist/verified/generated/storage.js +1 -1
  138. package/docs/verified-kernels.md +14 -6
  139. package/package.json +2 -2
  140. package/proofs/kernel.ts +2 -0
  141. package/proofs/lifecycle.ts +44 -57
  142. package/scripts/verified-kernels.ts +5 -0
  143. package/dist/chunks/chunk-3UGN25XS.js.map +0 -7
  144. package/dist/chunks/chunk-FAOWQ2C3.js.map +0 -7
  145. package/dist/chunks/chunk-KH2JKXOQ.js.map +0 -7
  146. package/dist/chunks/chunk-LNCG7GR6.js.map +0 -7
  147. package/dist/chunks/chunk-TLR3CWIF.js.map +0 -7
  148. package/dist/chunks/chunk-ULPAF2EY.js.map +0 -7
  149. /package/dist/chunks/{chunk-WLUMFHDX.js.map → chunk-4DJPPVM6.js.map} +0 -0
  150. /package/dist/chunks/{chunk-5QS7PFWD.js.map → chunk-7OQGN47K.js.map} +0 -0
  151. /package/dist/chunks/{chunk-4HRBFAU5.js.map → chunk-BPAACXYZ.js.map} +0 -0
  152. /package/dist/chunks/{chunk-XDZHPIV3.js.map → chunk-BU4ENBYU.js.map} +0 -0
  153. /package/dist/chunks/{chunk-FLXFYKS7.js.map → chunk-E4OD6Q54.js.map} +0 -0
  154. /package/dist/chunks/{chunk-LPUOI5BZ.js.map → chunk-EHDL2RGJ.js.map} +0 -0
  155. /package/dist/chunks/{chunk-2RSSU4NI.js.map → chunk-EQHAEYW5.js.map} +0 -0
  156. /package/dist/chunks/{chunk-GARKXYZT.js.map → chunk-HKQUC5EK.js.map} +0 -0
  157. /package/dist/chunks/{chunk-7BKIL623.js.map → chunk-PI5HYN6C.js.map} +0 -0
  158. /package/dist/chunks/{chunk-WH35F4JO.js.map → chunk-PK6ZB2YW.js.map} +0 -0
  159. /package/dist/chunks/{chunk-KZX725OF.js.map → chunk-QHBH3XQ4.js.map} +0 -0
  160. /package/dist/chunks/{chunk-V6IZH5K5.js.map → chunk-R7IMFOVG.js.map} +0 -0
  161. /package/dist/chunks/{chunk-3UQEAJXZ.js.map → chunk-RYR555GF.js.map} +0 -0
  162. /package/dist/chunks/{chunk-6WASKKYA.js.map → chunk-SJTNQLAJ.js.map} +0 -0
  163. /package/dist/chunks/{chunk-MU5IB2IR.js.map → chunk-STF6ZFSQ.js.map} +0 -0
  164. /package/dist/chunks/{chunk-KB4KQ7KT.js.map → chunk-STPXP6PN.js.map} +0 -0
  165. /package/dist/chunks/{chunk-2F2RH2EN.js.map → chunk-VOFAFTGA.js.map} +0 -0
  166. /package/dist/chunks/{chunk-LCZATITG.js.map → chunk-WIS6TT6Y.js.map} +0 -0
  167. /package/dist/chunks/{chunk-QNDJXXYE.js.map → chunk-YJS5AZEU.js.map} +0 -0
  168. /package/dist/chunks/{chunk-IQ5F63LE.js.map → chunk-YZNC6X4J.js.map} +0 -0
  169. /package/dist/chunks/{chunk-NBHUIZ6P.js.map → chunk-Z6JOMCM6.js.map} +0 -0
  170. /package/dist/chunks/{chunk-Y6JU46FD.js.map → chunk-ZCNOQ6NK.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-IQ5F63LE.js";
4
+ } from "./chunks/chunk-YZNC6X4J.js";
5
5
  import {
6
6
  AgentAdmission,
7
7
  assertAgentTask,
@@ -14,15 +14,15 @@ import {
14
14
  import {
15
15
  validateAgentResult
16
16
  } from "./chunks/chunk-GJVKEHDL.js";
17
+ import "./chunks/chunk-STPXP6PN.js";
17
18
  import "./chunks/chunk-IIPKG52D.js";
18
19
  import "./chunks/chunk-ZLNJDTCN.js";
19
20
  import "./chunks/chunk-V73NIH6B.js";
20
- import "./chunks/chunk-KB4KQ7KT.js";
21
21
  import {
22
22
  actionArgNormalizer
23
23
  } from "./chunks/chunk-NQOEHX62.js";
24
24
  import "./chunks/chunk-6QVQXGMR.js";
25
- import "./chunks/chunk-IO64KE65.js";
25
+ import "./chunks/chunk-2WT5GNUP.js";
26
26
 
27
27
  // src/agents/service-schema.ts
28
28
  import { Value } from "typebox/value";
@@ -1,6 +1,6 @@
1
1
  import type { FabricKernel } from "../runtime/kernel.js";
2
2
  import type { FabricAssessmentTraceV1 } from "./assessment.js";
3
- import { type FabricExecutionTraceV1 } from "./trace.js";
3
+ import { type FabricExecutionTraceV1 } from "./trace-schema.js";
4
4
  export declare const FABRIC_EXECUTION_DETAILS_MAX_BYTES: number;
5
5
  export interface FabricPersistedExecutionDetailsV1 {
6
6
  success: boolean;
@@ -1 +1 @@
1
- {"version":3,"file":"details.d.ts","sourceRoot":"","sources":["../../src/audit/details.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAGL,KAAK,sBAAsB,EAC5B,MAAM,YAAY,CAAC;AAEpB,eAAO,MAAM,kCAAkC,QAAa,CAAC;AAE7D,MAAM,WAAW,iCAAiC;IAChD,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,KAAK,EAAE,sBAAsB,CAAC;IAC9B,4FAA4F;IAC5F,UAAU,CAAC,EAAE,uBAAuB,CAAC;IACrC,kJAAkJ;IAClJ,MAAM,EAAE,uBAAuB,EAAE,CAAC;IAClC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,2BAA2B;IAC1C,GAAG,EAAE,MAAM,CAAC;IACZ,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,uBAAuB;IACtC,GAAG,EAAE,MAAM,CAAC;IACZ,sJAAsJ;IACtJ,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,4HAA4H;IAC5H,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,4BAA4B;IAC3C,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,MAAM,EAAE,uBAAuB,EAAE,CAAC;CACnC;AAwBD;;;;;;;;GAQG;AACH,eAAO,MAAM,qCAAqC,GAAI,OAAO;IAC3D,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,KAAK,EAAE,sBAAsB,CAAC;IAC9B,UAAU,CAAC,EAAE,uBAAuB,CAAC;IACrC,MAAM,CAAC,EAAE,SAAS,2BAA2B,EAAE,CAAC;IAChD,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B,KAAG,iCA6DH,CAAC;AAuCF;;;;GAIG;AACH,eAAO,MAAM,gCAAgC,GAC3C,OAAO,OAAO,KACb,4BAsCF,CAAC"}
1
+ {"version":3,"file":"details.d.ts","sourceRoot":"","sources":["../../src/audit/details.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAGL,KAAK,sBAAsB,EAC5B,MAAM,mBAAmB,CAAC;AAE3B,eAAO,MAAM,kCAAkC,QAAa,CAAC;AAE7D,MAAM,WAAW,iCAAiC;IAChD,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,KAAK,EAAE,sBAAsB,CAAC;IAC9B,4FAA4F;IAC5F,UAAU,CAAC,EAAE,uBAAuB,CAAC;IACrC,kJAAkJ;IAClJ,MAAM,EAAE,uBAAuB,EAAE,CAAC;IAClC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,2BAA2B;IAC1C,GAAG,EAAE,MAAM,CAAC;IACZ,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,uBAAuB;IACtC,GAAG,EAAE,MAAM,CAAC;IACZ,sJAAsJ;IACtJ,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,4HAA4H;IAC5H,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,4BAA4B;IAC3C,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,MAAM,EAAE,uBAAuB,EAAE,CAAC;CACnC;AAwBD;;;;;;;;GAQG;AACH,eAAO,MAAM,qCAAqC,GAAI,OAAO;IAC3D,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,KAAK,EAAE,sBAAsB,CAAC;IAC9B,UAAU,CAAC,EAAE,uBAAuB,CAAC;IACrC,MAAM,CAAC,EAAE,SAAS,2BAA2B,EAAE,CAAC;IAChD,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B,KAAG,iCA6DH,CAAC;AAuCF;;;;GAIG;AACH,eAAO,MAAM,gCAAgC,GAC3C,OAAO,OAAO,KACb,4BAsCF,CAAC"}
@@ -0,0 +1,50 @@
1
+ import { type NormalFormWitness } from "../entropy/normal-form.js";
2
+ export declare const FABRIC_EXECUTION_TRACE_KIND: "pi-fabric.execution";
3
+ export declare const FABRIC_EXECUTION_TRACE_VERSION: 1;
4
+ export declare const FABRIC_EXECUTION_TRACE_MAX_BYTES: number;
5
+ export declare const MAX_TRACE_DEPTH = 12;
6
+ export type FabricTraceJsonPrimitive = string | number | boolean | null;
7
+ export type FabricTraceJsonValue = FabricTraceJsonPrimitive | FabricTraceJsonValue[] | {
8
+ [key: string]: FabricTraceJsonValue;
9
+ };
10
+ export type FabricExecutionOutcomeV1 = "succeeded" | "failed" | "aborted" | "timed_out";
11
+ export type FabricExecutionFailureStageV1 = "resolve" | "prepare" | "validate" | "approve" | "invoke" | "guard";
12
+ export interface FabricExecutionTraceOperationV1 {
13
+ type: "call";
14
+ sequence: number;
15
+ ref: string;
16
+ provider?: string;
17
+ action?: string;
18
+ args: {
19
+ [key: string]: FabricTraceJsonValue;
20
+ };
21
+ outcome: FabricExecutionOutcomeV1;
22
+ normalization?: NormalFormWitness;
23
+ failureStage?: FabricExecutionFailureStageV1;
24
+ error?: string;
25
+ result?: FabricTraceJsonValue;
26
+ resultTruncated?: boolean;
27
+ }
28
+ export interface FabricExecutionTraceCountsV1 {
29
+ droppedValues: number;
30
+ truncatedValues: number;
31
+ redactedValues: number;
32
+ droppedOperations: number;
33
+ }
34
+ export interface FabricExecutionTraceV1 {
35
+ kind: typeof FABRIC_EXECUTION_TRACE_KIND;
36
+ version: typeof FABRIC_EXECUTION_TRACE_VERSION;
37
+ outcome: FabricExecutionOutcomeV1;
38
+ phases: string[];
39
+ operations: FabricExecutionTraceOperationV1[];
40
+ counts: FabricExecutionTraceCountsV1;
41
+ error?: string;
42
+ }
43
+ export declare class FabricTraceSafeError extends Error {
44
+ }
45
+ export declare class FabricResolutionError extends FabricTraceSafeError {
46
+ }
47
+ export declare const isFabricExecutionTraceOperationV1: (value: unknown) => value is FabricExecutionTraceOperationV1;
48
+ export declare const isFabricExecutionTraceV1: (value: unknown) => value is FabricExecutionTraceV1;
49
+ export declare const readFabricExecutionTraceV1: (value: unknown) => FabricExecutionTraceV1 | undefined;
50
+ //# sourceMappingURL=trace-schema.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"trace-schema.d.ts","sourceRoot":"","sources":["../../src/audit/trace-schema.ts"],"names":[],"mappings":"AAAA,OAAO,EAAuB,KAAK,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAIxF,eAAO,MAAM,2BAA2B,EAAG,qBAA8B,CAAC;AAC1E,eAAO,MAAM,8BAA8B,EAAG,CAAU,CAAC;AACzD,eAAO,MAAM,gCAAgC,QAAa,CAAC;AAC3D,eAAO,MAAM,eAAe,KAAK,CAAC;AAElC,MAAM,MAAM,wBAAwB,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;AACxE,MAAM,MAAM,oBAAoB,GAC5B,wBAAwB,GACxB,oBAAoB,EAAE,GACtB;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,oBAAoB,CAAA;CAAE,CAAC;AAE5C,MAAM,MAAM,wBAAwB,GAAG,WAAW,GAAG,QAAQ,GAAG,SAAS,GAAG,WAAW,CAAC;AACxF,MAAM,MAAM,6BAA6B,GACrC,SAAS,GACT,SAAS,GACT,UAAU,GACV,SAAS,GACT,QAAQ,GACR,OAAO,CAAC;AAEZ,MAAM,WAAW,+BAA+B;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,oBAAoB,CAAA;KAAE,CAAC;IAC9C,OAAO,EAAE,wBAAwB,CAAC;IAClC,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,YAAY,CAAC,EAAE,6BAA6B,CAAC;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,oBAAoB,CAAC;IAC9B,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,4BAA4B;IAC3C,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,OAAO,2BAA2B,CAAC;IACzC,OAAO,EAAE,OAAO,8BAA8B,CAAC;IAC/C,OAAO,EAAE,wBAAwB,CAAC;IAClC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,+BAA+B,EAAE,CAAC;IAC9C,MAAM,EAAE,4BAA4B,CAAC;IACrC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAKD,qBAAa,oBAAqB,SAAQ,KAAK;CAAG;AAGlD,qBAAa,qBAAsB,SAAQ,oBAAoB;CAAG;AAwClE,eAAO,MAAM,iCAAiC,GAC5C,OAAO,OAAO,KACb,KAAK,IAAI,+BAMX,CAAC;AAmBF,eAAO,MAAM,wBAAwB,GAAI,OAAO,OAAO,KAAG,KAAK,IAAI,sBAMlE,CAAC;AAEF,eAAO,MAAM,0BAA0B,GAAI,OAAO,OAAO,KAAG,sBAAsB,GAAG,SAChC,CAAC"}
@@ -1,44 +1,6 @@
1
1
  import { type NormalFormWitness } from "../entropy/normal-form.js";
2
- export declare const FABRIC_EXECUTION_TRACE_KIND: "pi-fabric.execution";
3
- export declare const FABRIC_EXECUTION_TRACE_VERSION: 1;
4
- export declare const FABRIC_EXECUTION_TRACE_MAX_BYTES: number;
5
- export type FabricTraceJsonPrimitive = string | number | boolean | null;
6
- export type FabricTraceJsonValue = FabricTraceJsonPrimitive | FabricTraceJsonValue[] | {
7
- [key: string]: FabricTraceJsonValue;
8
- };
9
- export type FabricExecutionOutcomeV1 = "succeeded" | "failed" | "aborted" | "timed_out";
10
- export type FabricExecutionFailureStageV1 = "resolve" | "prepare" | "validate" | "approve" | "invoke" | "guard";
11
- export interface FabricExecutionTraceOperationV1 {
12
- type: "call";
13
- sequence: number;
14
- ref: string;
15
- provider?: string;
16
- action?: string;
17
- args: {
18
- [key: string]: FabricTraceJsonValue;
19
- };
20
- outcome: FabricExecutionOutcomeV1;
21
- normalization?: NormalFormWitness;
22
- failureStage?: FabricExecutionFailureStageV1;
23
- error?: string;
24
- result?: FabricTraceJsonValue;
25
- resultTruncated?: boolean;
26
- }
27
- export interface FabricExecutionTraceCountsV1 {
28
- droppedValues: number;
29
- truncatedValues: number;
30
- redactedValues: number;
31
- droppedOperations: number;
32
- }
33
- export interface FabricExecutionTraceV1 {
34
- kind: typeof FABRIC_EXECUTION_TRACE_KIND;
35
- version: typeof FABRIC_EXECUTION_TRACE_VERSION;
36
- outcome: FabricExecutionOutcomeV1;
37
- phases: string[];
38
- operations: FabricExecutionTraceOperationV1[];
39
- counts: FabricExecutionTraceCountsV1;
40
- error?: string;
41
- }
2
+ import { type FabricExecutionFailureStageV1, type FabricExecutionOutcomeV1, type FabricExecutionTraceV1, type FabricTraceJsonValue } from "./trace-schema.js";
3
+ export * from "./trace-schema.js";
42
4
  interface MutableCounts {
43
5
  droppedValues: number;
44
6
  truncatedValues: number;
@@ -70,10 +32,6 @@ interface MutableOperation {
70
32
  resultTruncated?: boolean;
71
33
  droppedResultValues: number;
72
34
  }
73
- export declare class FabricTraceSafeError extends Error {
74
- }
75
- export declare class FabricResolutionError extends FabricTraceSafeError {
76
- }
77
35
  /**
78
36
  * Optional, non-deterministic side channel (the assessment projection). It
79
37
  * observes issue and settle events and never alters the deterministic trace.
@@ -107,8 +65,4 @@ export declare class FabricExecutionTraceRecorder {
107
65
  seal(outcome: FabricExecutionOutcomeV1, phases: readonly string[], safeError?: string): FabricExecutionTraceV1;
108
66
  }
109
67
  export declare const executionOutcomeFromError: (error: unknown, signal?: AbortSignal) => FabricExecutionOutcomeV1;
110
- export declare const isFabricExecutionTraceOperationV1: (value: unknown) => value is FabricExecutionTraceOperationV1;
111
- export declare const isFabricExecutionTraceV1: (value: unknown) => value is FabricExecutionTraceV1;
112
- export declare const readFabricExecutionTraceV1: (value: unknown) => FabricExecutionTraceV1 | undefined;
113
- export {};
114
68
  //# sourceMappingURL=trace.d.ts.map
@@ -1 +1 @@
1
- {"version":3,"file":"trace.d.ts","sourceRoot":"","sources":["../../src/audit/trace.ts"],"names":[],"mappings":"AACA,OAAO,EAAuB,KAAK,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAGxF,eAAO,MAAM,2BAA2B,EAAG,qBAA8B,CAAC;AAC1E,eAAO,MAAM,8BAA8B,EAAG,CAAU,CAAC;AACzD,eAAO,MAAM,gCAAgC,QAAa,CAAC;AAc3D,MAAM,MAAM,wBAAwB,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC;AACxE,MAAM,MAAM,oBAAoB,GAC5B,wBAAwB,GACxB,oBAAoB,EAAE,GACtB;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,oBAAoB,CAAA;CAAE,CAAC;AAE5C,MAAM,MAAM,wBAAwB,GAAG,WAAW,GAAG,QAAQ,GAAG,SAAS,GAAG,WAAW,CAAC;AACxF,MAAM,MAAM,6BAA6B,GACrC,SAAS,GACT,SAAS,GACT,UAAU,GACV,SAAS,GACT,QAAQ,GACR,OAAO,CAAC;AAEZ,MAAM,WAAW,+BAA+B;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,oBAAoB,CAAA;KAAE,CAAC;IAC9C,OAAO,EAAE,wBAAwB,CAAC;IAClC,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,YAAY,CAAC,EAAE,6BAA6B,CAAC;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,oBAAoB,CAAC;IAC9B,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,4BAA4B;IAC3C,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,sBAAsB;IACrC,IAAI,EAAE,OAAO,2BAA2B,CAAC;IACzC,OAAO,EAAE,OAAO,8BAA8B,CAAC;IAC/C,OAAO,EAAE,wBAAwB,CAAC;IAClC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,+BAA+B,EAAE,CAAC;IAC9C,MAAM,EAAE,4BAA4B,CAAC;IACrC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,UAAU,aAAa;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,UAAU,eAAe;IACvB,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,UAAU,SAAS,CAAC,CAAC,SAAS,oBAAoB;IAChD,KAAK,EAAE,CAAC,CAAC;IACT,MAAM,EAAE,aAAa,CAAC;CACvB;AAED,UAAU,gBAAgB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,EAAE,SAAS,CAAC;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,oBAAoB,CAAA;KAAE,CAAC,CAAC;IACzD,OAAO,CAAC,EAAE,wBAAwB,CAAC;IACnC,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,YAAY,CAAC,EAAE,6BAA6B,CAAC;IAC7C,KAAK,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC1B,MAAM,CAAC,EAAE,SAAS,CAAC,oBAAoB,CAAC,CAAC;IACzC,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AA2QD,qBAAa,oBAAqB,SAAQ,KAAK;CAAG;AAGlD,qBAAa,qBAAsB,SAAQ,oBAAoB;CAAG;AA0BlE;;;GAGG;AACH,MAAM,WAAW,4BAA4B;IAC3C,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAAC;CACrF;AAED,qBAAa,mCAAmC;IAE5C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,gFAAgF;IAChF,QAAQ,CAAC,QAAQ;gBAHA,QAAQ,EAAE,4BAA4B,EACtC,SAAS,EAAE,gBAAgB,GAAG,SAAS;IACxD,gFAAgF;IACvE,QAAQ,SAAK;IAGxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAYhD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAK7C,UAAU,CAAC,OAAO,EAAE,iBAAiB,GAAG,IAAI;IAK5C,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,IAAI;IActD,IAAI,CACF,KAAK,EAAE,6BAA6B,EACpC,KAAK,EAAE,OAAO,EACd,OAAO,GAAE,wBAAmC,EAC5C,MAAM,CAAC,EAAE,OAAO,EAChB,IAAI,CAAC,EAAE,eAAe,GACrB,IAAI;CAyBR;AAED,qBAAa,4BAA4B;;IAMvC,MAAM,UAAS;gBAEH,QAAQ,CAAC,EAAE,4BAA4B;IAInD,4FAA4F;IAC5F,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI;IAS1F,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,SAAuB,GAAG,MAAM;IAM1E,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,mCAAmC;IAgC1F,IAAI,CACF,OAAO,EAAE,wBAAwB,EACjC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,SAAS,CAAC,EAAE,MAAM,GACjB,sBAAsB;CA2I1B;AAED,eAAO,MAAM,yBAAyB,GACpC,OAAO,OAAO,EACd,SAAS,WAAW,KACnB,wBAGF,CAAC;AAwCF,eAAO,MAAM,iCAAiC,GAC5C,OAAO,OAAO,KACb,KAAK,IAAI,+BAMX,CAAC;AAmBF,eAAO,MAAM,wBAAwB,GAAI,OAAO,OAAO,KAAG,KAAK,IAAI,sBAMlE,CAAC;AAEF,eAAO,MAAM,0BAA0B,GAAI,OAAO,OAAO,KAAG,sBAAsB,GAAG,SAChC,CAAC"}
1
+ {"version":3,"file":"trace.d.ts","sourceRoot":"","sources":["../../src/audit/trace.ts"],"names":[],"mappings":"AACA,OAAO,EAAuB,KAAK,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AACxF,OAAO,EAML,KAAK,6BAA6B,EAClC,KAAK,wBAAwB,EAG7B,KAAK,sBAAsB,EAC3B,KAAK,oBAAoB,EAC1B,MAAM,mBAAmB,CAAC;AAG3B,cAAc,mBAAmB,CAAC;AAclC,UAAU,aAAa;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,UAAU,eAAe;IACvB,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,UAAU,SAAS,CAAC,CAAC,SAAS,oBAAoB;IAChD,KAAK,EAAE,CAAC,CAAC;IACT,MAAM,EAAE,aAAa,CAAC;CACvB;AAED,UAAU,gBAAgB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,MAAM,CAAC;IACZ,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,EAAE,SAAS,CAAC;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,oBAAoB,CAAA;KAAE,CAAC,CAAC;IACzD,OAAO,CAAC,EAAE,wBAAwB,CAAC;IACnC,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,YAAY,CAAC,EAAE,6BAA6B,CAAC;IAC7C,KAAK,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC1B,MAAM,CAAC,EAAE,SAAS,CAAC,oBAAoB,CAAC,CAAC;IACzC,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAgSD;;;GAGG;AACH,MAAM,WAAW,4BAA4B;IAC3C,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI,CAAC;CACrF;AAED,qBAAa,mCAAmC;IAE5C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,gFAAgF;IAChF,QAAQ,CAAC,QAAQ;gBAHA,QAAQ,EAAE,4BAA4B,EACtC,SAAS,EAAE,gBAAgB,GAAG,SAAS;IACxD,gFAAgF;IACvE,QAAQ,SAAK;IAGxB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAYhD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAK7C,UAAU,CAAC,OAAO,EAAE,iBAAiB,GAAG,IAAI;IAK5C,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,eAAe,GAAG,IAAI;IActD,IAAI,CACF,KAAK,EAAE,6BAA6B,EACpC,KAAK,EAAE,OAAO,EACd,OAAO,GAAE,wBAAmC,EAC5C,MAAM,CAAC,EAAE,OAAO,EAChB,IAAI,CAAC,EAAE,eAAe,GACrB,IAAI;CAyBR;AAED,qBAAa,4BAA4B;;IAMvC,MAAM,UAAS;gBAEH,QAAQ,CAAC,EAAE,4BAA4B;IAInD,4FAA4F;IAC5F,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI;IAS1F,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,SAAuB,GAAG,MAAM;IAM1E,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,mCAAmC;IAgC1F,IAAI,CACF,OAAO,EAAE,wBAAwB,EACjC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,SAAS,CAAC,EAAE,MAAM,GACjB,sBAAsB;CA2I1B;AAED,eAAO,MAAM,yBAAyB,GACpC,OAAO,OAAO,EACd,SAAS,WAAW,KACnB,wBAGF,CAAC"}
@@ -291,4 +291,4 @@ export {
291
291
  acceptMemoryChunk,
292
292
  assertCertificateFacts
293
293
  };
294
- //# sourceMappingURL=chunk-IO64KE65.js.map
294
+ //# sourceMappingURL=chunk-2WT5GNUP.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.7. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\n\nexport const transitionCurrent = /* @__PURE__ */ (() => {\n// Generated from the machine transition current. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.ok\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"retired\": $n(input[\"retired\"], \"input retired\"), \"sameEpoch\": $n(input[\"sameEpoch\"], \"input sameEpoch\"), \"sameOwner\": $n(input[\"sameOwner\"], \"input sameOwner\"), \"closed\": $n(input[\"closed\"], \"input closed\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"retired\"] <= 1) && (env[\"sameEpoch\"] <= 1) && (env[\"sameOwner\"] <= 1) && (env[\"closed\"] <= 1))) throw new RangeError(\"transition current: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.ok\": (((!(env[\"retired\"] === 1)) && (env[\"sameEpoch\"] === 1) && (env[\"sameOwner\"] === 1) && (!(env[\"closed\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const cleanupState = /* @__PURE__ */ (() => {\n// Generated from the machine cleanup state. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.state\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"failed\": $n(input[\"failed\"], \"input failed\"), \"diverted\": $n(input[\"diverted\"], \"input diverted\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"failed\"] <= 1) && (env[\"diverted\"] <= 1))) throw new RangeError(\"cleanup state: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.state\": ((env[\"failed\"] === 1) ? 2 : ((env[\"diverted\"] === 1) ? 1 : 0))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const unknownConflict = /* @__PURE__ */ (() => {\n// Generated from the machine unknown conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"lu\": $n(input[\"lu\"], \"input lu\"), \"luo\": $n(input[\"luo\"], \"input luo\"), \"lo\": $n(input[\"lo\"], \"input lo\"), \"ru\": $n(input[\"ru\"], \"input ru\"), \"ruo\": $n(input[\"ruo\"], \"input ruo\"), \"ro\": $n(input[\"ro\"], \"input ro\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"lu\"] <= 1) && (env[\"luo\"] <= 1) && (env[\"lo\"] <= 1) && (env[\"ru\"] <= 1) && (env[\"ruo\"] <= 1) && (env[\"ro\"] <= 1))) throw new RangeError(\"unknown conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.conflict\": ((((env[\"lu\"] === 1) && ((env[\"luo\"] === 1) || (env[\"ro\"] === 1))) || ((env[\"ru\"] === 1) && ((env[\"ruo\"] === 1) || (env[\"lo\"] === 1)))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const knownConflict = /* @__PURE__ */ (() => {\n// Generated from the machine known conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"shared\": $n(input[\"shared\"], \"input shared\"), \"leftOrdered\": $n(input[\"leftOrdered\"], \"input leftOrdered\"), \"rightOrdered\": $n(input[\"rightOrdered\"], \"input rightOrdered\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"shared\"] <= 1) && (env[\"leftOrdered\"] <= 1) && (env[\"rightOrdered\"] <= 1))) throw new RangeError(\"known conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.conflict\": (((env[\"shared\"] === 1) && ((env[\"leftOrdered\"] === 1) || (env[\"rightOrdered\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const lineageSelected = /* @__PURE__ */ (() => {\n// Generated from the machine lineage selected. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.selected\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"allBranches\": $n(input[\"allBranches\"], \"input allBranches\"), \"member\": $n(input[\"member\"], \"input member\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"allBranches\"] <= 1) && (env[\"member\"] <= 1))) throw new RangeError(\"lineage selected: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.selected\": (((env[\"allBranches\"] === 1) || (env[\"member\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const pointerCurrent = /* @__PURE__ */ (() => {\n// Generated from the machine pointer current. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.current\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"source\": $n(input[\"source\"], \"input source\"), \"lineage\": $n(input[\"lineage\"], \"input lineage\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"source\"] <= 1) && (env[\"lineage\"] <= 1))) throw new RangeError(\"pointer current: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.current\": (((env[\"source\"] === 1) && (env[\"lineage\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const coverageComplete = /* @__PURE__ */ (() => {\n// Generated from the machine coverage complete. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.complete\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"sourceComplete\": $n(input[\"sourceComplete\"], \"input sourceComplete\"), \"truncated\": $n(input[\"truncated\"], \"input truncated\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"sourceComplete\"] <= 1) && (env[\"truncated\"] <= 1))) throw new RangeError(\"coverage complete: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.complete\": (((env[\"sourceComplete\"] === 1) && (!(env[\"truncated\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const useNormalized = /* @__PURE__ */ (() => {\n// Generated from the machine use normalized. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.use\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"canonical\": $n(input[\"canonical\"], \"input canonical\"), \"plan\": $n(input[\"plan\"], \"input plan\"), \"changed\": $n(input[\"changed\"], \"input changed\"), \"accepted\": $n(input[\"accepted\"], \"input accepted\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"canonical\"] <= 1) && (env[\"plan\"] <= 1) && (env[\"changed\"] <= 1) && (env[\"accepted\"] <= 1))) throw new RangeError(\"use normalized: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.use\": (((!(env[\"canonical\"] === 1)) && (env[\"plan\"] === 1) && (env[\"changed\"] === 1) && (env[\"accepted\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const headReadable = /* @__PURE__ */ (() => {\n// Generated from the machine head readable. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.readable\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"sequence\": $n(input[\"sequence\"], \"input sequence\"), \"version\": $n(input[\"version\"], \"input version\"), \"committed\": $n(input[\"committed\"], \"input committed\"), \"pending\": $n(input[\"pending\"], \"input pending\"), \"marker\": $n(input[\"marker\"], \"input marker\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"sequence\"] <= 1) && (env[\"version\"] <= 1) && (env[\"committed\"] <= 1) && (env[\"pending\"] <= 1) && (env[\"marker\"] <= 1))) throw new RangeError(\"head readable: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.readable\": (((env[\"sequence\"] === 1) && (env[\"version\"] === 1) && ((env[\"committed\"] === 1) || ((env[\"pending\"] === 1) && (env[\"marker\"] === 1)))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const certificateAccepted = /* @__PURE__ */ (() => {\n// Generated from the machine certificate accepted. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.accepted\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"f0\": $n(input[\"f0\"], \"input f0\"), \"f1\": $n(input[\"f1\"], \"input f1\"), \"f2\": $n(input[\"f2\"], \"input f2\"), \"f3\": $n(input[\"f3\"], \"input f3\"), \"f4\": $n(input[\"f4\"], \"input f4\"), \"f5\": $n(input[\"f5\"], \"input f5\"), \"f6\": $n(input[\"f6\"], \"input f6\"), \"f7\": $n(input[\"f7\"], \"input f7\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"f0\"] <= 1) && (env[\"f1\"] <= 1) && (env[\"f2\"] <= 1) && (env[\"f3\"] <= 1) && (env[\"f4\"] <= 1) && (env[\"f5\"] <= 1) && (env[\"f6\"] <= 1) && (env[\"f7\"] <= 1))) throw new RangeError(\"certificate accepted: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.accepted\": (((env[\"f0\"] === 1) && (env[\"f1\"] === 1) && (env[\"f2\"] === 1) && (env[\"f3\"] === 1) && (env[\"f4\"] === 1) && (env[\"f5\"] === 1) && (env[\"f6\"] === 1) && (env[\"f7\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const consume = /* @__PURE__ */ (() => {\n// Generated from the machine consume. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.released\": 0, \"out.active\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"active\": $n(input[\"active\"], \"input active\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!(env[\"active\"] <= 1)) throw new RangeError(\"consume: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.released\": ((env[\"active\"] === 1) ? 1 : 0), \"out.active\": (((env[\"active\"] === 1) && (!(env[\"active\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const summaryWithin = /* @__PURE__ */ (() => {\n// Generated from the machine summary within. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.within\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"bytes\": $n(input[\"bytes\"], \"input bytes\"), \"byteLimit\": $n(input[\"byteLimit\"], \"input byteLimit\"), \"projected\": $n(input[\"projected\"], \"input projected\"), \"target\": $n(input[\"target\"], \"input target\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const scalars = {...s, \"out.within\": (((env[\"bytes\"] <= env[\"byteLimit\"]) && (env[\"projected\"] <= env[\"target\"])) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const sampleWithin = /* @__PURE__ */ (() => {\n// Generated from the machine sample within. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.within\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"total\": $n(input[\"total\"], \"input total\"), \"retained\": $n(input[\"retained\"], \"input retained\"), \"omitted\": $n(input[\"omitted\"], \"input omitted\"), \"limit\": $n(input[\"limit\"], \"input limit\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const scalars = {...s, \"out.within\": (((env[\"total\"] === $x(env[\"retained\"] + env[\"omitted\"])) && (env[\"retained\"] <= env[\"limit\"])) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const chunkAccepted = /* @__PURE__ */ (() => {\n// Generated from the machine chunk accepted. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.accepted\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"start\": $n(input[\"start\"], \"input start\"), \"end\": $n(input[\"end\"], \"input end\"), \"total\": $n(input[\"total\"], \"input total\"), \"expectedStart\": $n(input[\"expectedStart\"], \"input expectedStart\"), \"expectedTotal\": $n(input[\"expectedTotal\"], \"input expectedTotal\"), \"length\": $n(input[\"length\"], \"input length\"), \"complete\": $n(input[\"complete\"], \"input complete\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!(env[\"complete\"] <= 1)) throw new RangeError(\"chunk accepted: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.accepted\": (((env[\"start\"] === env[\"expectedStart\"]) && (env[\"total\"] === env[\"expectedTotal\"]) && (env[\"start\"] <= env[\"end\"]) && (env[\"end\"] <= env[\"total\"]) && ($x(env[\"length\"] + env[\"start\"]) === env[\"end\"]) && (((!(env[\"complete\"] === 1)) || (env[\"end\"] === env[\"total\"])) && ((!(env[\"end\"] === env[\"total\"])) || (env[\"complete\"] === 1))) && ((env[\"complete\"] === 1) || (env[\"start\"] < env[\"end\"]))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "// Generated by scripts/verified-kernels.ts from proofs/compaction.ts with gdp-wired@0.12.7. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\n\nexport const compactionCut = /* @__PURE__ */ (() => {\n// Generated from the machine compaction cut. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {\"eligible\": $n(params[\"eligible\"], \"param eligible\"), \"afterPrevious\": $n(params[\"afterPrevious\"], \"param afterPrevious\"), \"retained\": $n(params[\"retained\"], \"param retained\"), \"budget\": $n(params[\"budget\"], \"param budget\"), \"boundary\": $n(params[\"boundary\"], \"param boundary\")}, s = {};\n return {scalars: {\"phase\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"eligible\": $n(params[\"eligible\"], \"param eligible\"), \"afterPrevious\": $n(params[\"afterPrevious\"], \"param afterPrevious\"), \"retained\": $n(params[\"retained\"], \"param retained\"), \"budget\": $n(params[\"budget\"], \"param budget\"), \"boundary\": $n(params[\"boundary\"], \"param boundary\"), \"op\": $n(input[\"op\"], \"input op\"), \"first\": $n(input[\"first\"], \"input first\"), \"last\": $n(input[\"last\"], \"input last\"), \"paired\": $n(input[\"paired\"], \"input paired\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const flag0 = ((env[\"eligible\"] === 1) && (env[\"afterPrevious\"] === 1) && (env[\"retained\"] <= env[\"budget\"]));\n const flag1 = ((!(env[\"paired\"] === 1)) || (env[\"boundary\"] <= env[\"first\"]) || (env[\"last\"] < env[\"boundary\"]));\n if (!((env[\"op\"] < 2) && (env[\"paired\"] <= 1))) throw new RangeError(\"compaction cut: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"phase\": ((env[\"op\"] === 0) ? (((s[\"phase\"] === 0) && flag0) ? 1 : 2) : (((s[\"phase\"] === 1) && flag1) ? 1 : 2))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { VERIFIED_NAT_MAX } from \"./nat.js\";\nimport type { Machine } from \"./machine.js\";\nimport {\n transitionCurrent as transitionMachine, cleanupState as cleanupMachine, unknownConflict as unknownMachine,\n knownConflict as knownMachine, lineageSelected as lineageMachine, pointerCurrent as pointerMachine,\n coverageComplete as coverageMachine, useNormalized as normalizedMachine, headReadable as headMachine,\n certificateAccepted as certificateMachine, consume as consumeMachine, summaryWithin as summaryMachine,\n sampleWithin as sampleMachine, chunkAccepted as chunkMachine,\n} from \"./generated/policy.js\";\nimport { compactionCut } from \"./generated/compaction.js\";\n\n// Kept local rather than shared with ./machine.js: these decisions sit in the\n// startup graph, and the stateful kernels' codecs load at first use.\nconst bit = (value: boolean): number => (value ? 1 : 0);\nconst isNatural = (value: unknown): value is number => typeof value === \"number\" && Number.isSafeInteger(value) && value >= 0;\nconst call = (machine: Machine, input: object): Record<string, number> => machine.step({}, machine.init({}), input).scalars;\nconst yes = (value: number | undefined): boolean => value === 1;\n\nexport const transitionCurrent = (retired: boolean, sameEpoch: boolean, sameOwner: boolean, closed: boolean): boolean =>\n yes(call(transitionMachine, { retired: bit(retired), sameEpoch: bit(sameEpoch), sameOwner: bit(sameOwner), closed: bit(closed) })[\"out.ok\"]);\n\n/** 0 disposed, 1 diverted, 2 quarantined. */\nexport const cleanupState = (failed: boolean, diverted: boolean): number =>\n call(cleanupMachine, { failed: bit(failed), diverted: bit(diverted) })[\"out.state\"]!;\n\nexport const unknownConflict = (lu: boolean, luo: boolean, lo: boolean, ru: boolean, ruo: boolean, ro: boolean): boolean =>\n yes(call(unknownMachine, { lu: bit(lu), luo: bit(luo), lo: bit(lo), ru: bit(ru), ruo: bit(ruo), ro: bit(ro) })[\"out.conflict\"]);\n\nexport const knownConflict = (shared: boolean, leftOrdered: boolean, rightOrdered: boolean): boolean =>\n yes(call(knownMachine, { shared: bit(shared), leftOrdered: bit(leftOrdered), rightOrdered: bit(rightOrdered) })[\"out.conflict\"]);\n\nexport const lineageSelected = (allBranches: boolean, member: boolean): boolean =>\n yes(call(lineageMachine, { allBranches: bit(allBranches), member: bit(member) })[\"out.selected\"]);\n\nexport const pointerCurrent = (source: boolean, lineage: boolean): boolean =>\n yes(call(pointerMachine, { source: bit(source), lineage: bit(lineage) })[\"out.current\"]);\n\nexport const coverageComplete = (sourceComplete: boolean, truncated: boolean): boolean =>\n yes(call(coverageMachine, { sourceComplete: bit(sourceComplete), truncated: bit(truncated) })[\"out.complete\"]);\n\nexport const useNormalized = (canonical: boolean, plan: boolean, changed: boolean, accepted: boolean): boolean =>\n yes(call(normalizedMachine, { canonical: bit(canonical), plan: bit(plan), changed: bit(changed), accepted: bit(accepted) })[\"out.use\"]);\n\nexport const headReadable = (sequence: boolean, version: boolean, committed: boolean, pending: boolean, marker: boolean): boolean =>\n yes(call(headMachine, { sequence: bit(sequence), version: bit(version), committed: bit(committed), pending: bit(pending), marker: bit(marker) })[\"out.readable\"]);\n\n/** One-use consumption: whether this use releases the token, and whether it stays active. */\nexport const consume = (active: boolean): { released: boolean; active: boolean } => {\n const out = call(consumeMachine, { active: bit(active) });\n return { released: yes(out[\"out.released\"]), active: yes(out[\"out.active\"]) };\n};\n\nexport const acceptSummaryBounds = (bytes: number, byteLimit: number, projected: number, target: number): boolean =>\n [bytes, byteLimit, projected, target].every(isNatural) &&\n yes(call(summaryMachine, { bytes, byteLimit, projected, target })[\"out.within\"]);\n\nexport const acceptSampleAccounting = (total: number, retained: number, omitted: number, limit: number): boolean =>\n [total, retained, omitted, limit].every(isNatural) && retained + omitted <= VERIFIED_NAT_MAX &&\n yes(call(sampleMachine, { total, retained, omitted, limit })[\"out.within\"]);\n\nexport interface CutSpan {\n first: number;\n last: number;\n hasCall: boolean;\n hasResult: boolean;\n}\n\nexport interface CutCandidate {\n eligible: boolean;\n afterPrevious: boolean;\n retained: number;\n budget: number;\n boundary: number;\n}\n\nconst OPEN = 1;\n/** The producer may reject cheaply, but cannot publish a cut without this check.\n * The compiled cut machine folds the header and then every source span. */\nexport const acceptCompactionCut = (candidate: CutCandidate, spans: Iterable<CutSpan>): boolean => {\n if (![candidate.retained, candidate.budget, candidate.boundary].every(isNatural) ||\n typeof candidate.eligible !== \"boolean\" || typeof candidate.afterPrevious !== \"boolean\") return false;\n const params = {\n eligible: bit(candidate.eligible), afterPrevious: bit(candidate.afterPrevious),\n retained: candidate.retained, budget: candidate.budget, boundary: candidate.boundary,\n };\n let state = compactionCut.step(params, compactionCut.init(params), { op: 0, first: 0, last: 0, paired: 0 });\n if (state.scalars.phase !== OPEN) return false;\n for (const span of spans) {\n if (!isNatural(span.first) || !isNatural(span.last) || span.first > span.last ||\n typeof span.hasCall !== \"boolean\" || typeof span.hasResult !== \"boolean\") return false;\n state = compactionCut.step(params, state, { op: 1, first: span.first, last: span.last, paired: bit(span.hasCall && span.hasResult) });\n if (state.scalars.phase !== OPEN) return false;\n }\n return true;\n};\n\nexport interface TextRange { start: number; end: number; total: number; complete: boolean }\nexport const acceptMemoryChunk = (\n range: TextRange, length: number, expectedStart: number, expectedTotal: number,\n): boolean => {\n if (![range.start, range.end, range.total, length, expectedStart, expectedTotal].every(isNatural) ||\n range.start + length > VERIFIED_NAT_MAX || typeof range.complete !== \"boolean\") return false;\n return yes(call(chunkMachine, {\n start: range.start, end: range.end, total: range.total, expectedStart, expectedTotal,\n length, complete: bit(range.complete),\n })[\"out.accepted\"]);\n};\n\n/** A fixed ordered tuple prevents a missing check from becoming an empty,\n * vacuously accepted certificate. Messages are diagnostics, never authority. */\nexport const assertCertificateFacts = (\n facts: readonly [CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact],\n): void => {\n if (facts.length !== 8 || facts.some((fact) => typeof fact.valid !== \"boolean\")) {\n throw new Error(\"Invalid Schema certificate evidence\");\n }\n const input = Object.fromEntries(facts.map((fact, index) => [`f${index}`, bit(fact.valid)]));\n if (!yes(call(certificateMachine, input)[\"out.accepted\"])) {\n throw new Error(facts.find((fact) => !fact.valid)?.error ?? \"Schema certificate rejected\");\n }\n};\ninterface CertificateFact { valid: boolean; error: string }\n"],
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.13.3. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\n\nexport const transitionCurrent = /* @__PURE__ */ (() => {\n// Generated from the machine transition current. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.ok\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"retired\": $n(input[\"retired\"], \"input retired\"), \"sameEpoch\": $n(input[\"sameEpoch\"], \"input sameEpoch\"), \"sameOwner\": $n(input[\"sameOwner\"], \"input sameOwner\"), \"closed\": $n(input[\"closed\"], \"input closed\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"retired\"] <= 1) && (env[\"sameEpoch\"] <= 1) && (env[\"sameOwner\"] <= 1) && (env[\"closed\"] <= 1))) throw new RangeError(\"transition current: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.ok\": (((!(env[\"retired\"] === 1)) && (env[\"sameEpoch\"] === 1) && (env[\"sameOwner\"] === 1) && (!(env[\"closed\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const cleanupState = /* @__PURE__ */ (() => {\n// Generated from the machine cleanup state. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.state\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"failed\": $n(input[\"failed\"], \"input failed\"), \"diverted\": $n(input[\"diverted\"], \"input diverted\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"failed\"] <= 1) && (env[\"diverted\"] <= 1))) throw new RangeError(\"cleanup state: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.state\": ((env[\"failed\"] === 1) ? 2 : ((env[\"diverted\"] === 1) ? 1 : 0))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const unknownConflict = /* @__PURE__ */ (() => {\n// Generated from the machine unknown conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"lu\": $n(input[\"lu\"], \"input lu\"), \"luo\": $n(input[\"luo\"], \"input luo\"), \"lo\": $n(input[\"lo\"], \"input lo\"), \"ru\": $n(input[\"ru\"], \"input ru\"), \"ruo\": $n(input[\"ruo\"], \"input ruo\"), \"ro\": $n(input[\"ro\"], \"input ro\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"lu\"] <= 1) && (env[\"luo\"] <= 1) && (env[\"lo\"] <= 1) && (env[\"ru\"] <= 1) && (env[\"ruo\"] <= 1) && (env[\"ro\"] <= 1))) throw new RangeError(\"unknown conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.conflict\": ((((env[\"lu\"] === 1) && ((env[\"luo\"] === 1) || (env[\"ro\"] === 1))) || ((env[\"ru\"] === 1) && ((env[\"ruo\"] === 1) || (env[\"lo\"] === 1)))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const knownConflict = /* @__PURE__ */ (() => {\n// Generated from the machine known conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"shared\": $n(input[\"shared\"], \"input shared\"), \"leftOrdered\": $n(input[\"leftOrdered\"], \"input leftOrdered\"), \"rightOrdered\": $n(input[\"rightOrdered\"], \"input rightOrdered\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"shared\"] <= 1) && (env[\"leftOrdered\"] <= 1) && (env[\"rightOrdered\"] <= 1))) throw new RangeError(\"known conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.conflict\": (((env[\"shared\"] === 1) && ((env[\"leftOrdered\"] === 1) || (env[\"rightOrdered\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const lineageSelected = /* @__PURE__ */ (() => {\n// Generated from the machine lineage selected. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.selected\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"allBranches\": $n(input[\"allBranches\"], \"input allBranches\"), \"member\": $n(input[\"member\"], \"input member\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"allBranches\"] <= 1) && (env[\"member\"] <= 1))) throw new RangeError(\"lineage selected: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.selected\": (((env[\"allBranches\"] === 1) || (env[\"member\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const pointerCurrent = /* @__PURE__ */ (() => {\n// Generated from the machine pointer current. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.current\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"source\": $n(input[\"source\"], \"input source\"), \"lineage\": $n(input[\"lineage\"], \"input lineage\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"source\"] <= 1) && (env[\"lineage\"] <= 1))) throw new RangeError(\"pointer current: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.current\": (((env[\"source\"] === 1) && (env[\"lineage\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const coverageComplete = /* @__PURE__ */ (() => {\n// Generated from the machine coverage complete. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.complete\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"sourceComplete\": $n(input[\"sourceComplete\"], \"input sourceComplete\"), \"truncated\": $n(input[\"truncated\"], \"input truncated\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"sourceComplete\"] <= 1) && (env[\"truncated\"] <= 1))) throw new RangeError(\"coverage complete: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.complete\": (((env[\"sourceComplete\"] === 1) && (!(env[\"truncated\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const useNormalized = /* @__PURE__ */ (() => {\n// Generated from the machine use normalized. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.use\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"canonical\": $n(input[\"canonical\"], \"input canonical\"), \"plan\": $n(input[\"plan\"], \"input plan\"), \"changed\": $n(input[\"changed\"], \"input changed\"), \"accepted\": $n(input[\"accepted\"], \"input accepted\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"canonical\"] <= 1) && (env[\"plan\"] <= 1) && (env[\"changed\"] <= 1) && (env[\"accepted\"] <= 1))) throw new RangeError(\"use normalized: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.use\": (((!(env[\"canonical\"] === 1)) && (env[\"plan\"] === 1) && (env[\"changed\"] === 1) && (env[\"accepted\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const headReadable = /* @__PURE__ */ (() => {\n// Generated from the machine head readable. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.readable\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"sequence\": $n(input[\"sequence\"], \"input sequence\"), \"version\": $n(input[\"version\"], \"input version\"), \"committed\": $n(input[\"committed\"], \"input committed\"), \"pending\": $n(input[\"pending\"], \"input pending\"), \"marker\": $n(input[\"marker\"], \"input marker\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"sequence\"] <= 1) && (env[\"version\"] <= 1) && (env[\"committed\"] <= 1) && (env[\"pending\"] <= 1) && (env[\"marker\"] <= 1))) throw new RangeError(\"head readable: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.readable\": (((env[\"sequence\"] === 1) && (env[\"version\"] === 1) && ((env[\"committed\"] === 1) || ((env[\"pending\"] === 1) && (env[\"marker\"] === 1)))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const certificateAccepted = /* @__PURE__ */ (() => {\n// Generated from the machine certificate accepted. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.accepted\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"f0\": $n(input[\"f0\"], \"input f0\"), \"f1\": $n(input[\"f1\"], \"input f1\"), \"f2\": $n(input[\"f2\"], \"input f2\"), \"f3\": $n(input[\"f3\"], \"input f3\"), \"f4\": $n(input[\"f4\"], \"input f4\"), \"f5\": $n(input[\"f5\"], \"input f5\"), \"f6\": $n(input[\"f6\"], \"input f6\"), \"f7\": $n(input[\"f7\"], \"input f7\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!((env[\"f0\"] <= 1) && (env[\"f1\"] <= 1) && (env[\"f2\"] <= 1) && (env[\"f3\"] <= 1) && (env[\"f4\"] <= 1) && (env[\"f5\"] <= 1) && (env[\"f6\"] <= 1) && (env[\"f7\"] <= 1))) throw new RangeError(\"certificate accepted: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.accepted\": (((env[\"f0\"] === 1) && (env[\"f1\"] === 1) && (env[\"f2\"] === 1) && (env[\"f3\"] === 1) && (env[\"f4\"] === 1) && (env[\"f5\"] === 1) && (env[\"f6\"] === 1) && (env[\"f7\"] === 1)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const consume = /* @__PURE__ */ (() => {\n// Generated from the machine consume. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.released\": 0, \"out.active\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"active\": $n(input[\"active\"], \"input active\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!(env[\"active\"] <= 1)) throw new RangeError(\"consume: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.released\": ((env[\"active\"] === 1) ? 1 : 0), \"out.active\": (((env[\"active\"] === 1) && (!(env[\"active\"] === 1))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const summaryWithin = /* @__PURE__ */ (() => {\n// Generated from the machine summary within. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.within\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"bytes\": $n(input[\"bytes\"], \"input bytes\"), \"byteLimit\": $n(input[\"byteLimit\"], \"input byteLimit\"), \"projected\": $n(input[\"projected\"], \"input projected\"), \"target\": $n(input[\"target\"], \"input target\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const scalars = {...s, \"out.within\": (((env[\"bytes\"] <= env[\"byteLimit\"]) && (env[\"projected\"] <= env[\"target\"])) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const sampleWithin = /* @__PURE__ */ (() => {\n// Generated from the machine sample within. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.within\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"total\": $n(input[\"total\"], \"input total\"), \"retained\": $n(input[\"retained\"], \"input retained\"), \"omitted\": $n(input[\"omitted\"], \"input omitted\"), \"limit\": $n(input[\"limit\"], \"input limit\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const scalars = {...s, \"out.within\": (((env[\"total\"] === $x(env[\"retained\"] + env[\"omitted\"])) && (env[\"retained\"] <= env[\"limit\"])) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const chunkAccepted = /* @__PURE__ */ (() => {\n// Generated from the machine chunk accepted. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"out.accepted\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"start\": $n(input[\"start\"], \"input start\"), \"end\": $n(input[\"end\"], \"input end\"), \"total\": $n(input[\"total\"], \"input total\"), \"expectedStart\": $n(input[\"expectedStart\"], \"input expectedStart\"), \"expectedTotal\": $n(input[\"expectedTotal\"], \"input expectedTotal\"), \"length\": $n(input[\"length\"], \"input length\"), \"complete\": $n(input[\"complete\"], \"input complete\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n if (!(env[\"complete\"] <= 1)) throw new RangeError(\"chunk accepted: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"out.accepted\": (((env[\"start\"] === env[\"expectedStart\"]) && (env[\"total\"] === env[\"expectedTotal\"]) && (env[\"start\"] <= env[\"end\"]) && (env[\"end\"] <= env[\"total\"]) && ($x(env[\"length\"] + env[\"start\"]) === env[\"end\"]) && (((!(env[\"complete\"] === 1)) || (env[\"end\"] === env[\"total\"])) && ((!(env[\"end\"] === env[\"total\"])) || (env[\"complete\"] === 1))) && ((env[\"complete\"] === 1) || (env[\"start\"] < env[\"end\"]))) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "// Generated by scripts/verified-kernels.ts from proofs/compaction.ts with gdp-wired@0.13.3. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\n\nexport const compactionCut = /* @__PURE__ */ (() => {\n// Generated from the machine compaction cut. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {\"eligible\": $n(params[\"eligible\"], \"param eligible\"), \"afterPrevious\": $n(params[\"afterPrevious\"], \"param afterPrevious\"), \"retained\": $n(params[\"retained\"], \"param retained\"), \"budget\": $n(params[\"budget\"], \"param budget\"), \"boundary\": $n(params[\"boundary\"], \"param boundary\")}, s = {};\n return {scalars: {\"phase\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"eligible\": $n(params[\"eligible\"], \"param eligible\"), \"afterPrevious\": $n(params[\"afterPrevious\"], \"param afterPrevious\"), \"retained\": $n(params[\"retained\"], \"param retained\"), \"budget\": $n(params[\"budget\"], \"param budget\"), \"boundary\": $n(params[\"boundary\"], \"param boundary\"), \"op\": $n(input[\"op\"], \"input op\"), \"first\": $n(input[\"first\"], \"input first\"), \"last\": $n(input[\"last\"], \"input last\"), \"paired\": $n(input[\"paired\"], \"input paired\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const flag0 = ((env[\"eligible\"] === 1) && (env[\"afterPrevious\"] === 1) && (env[\"retained\"] <= env[\"budget\"]));\n const flag1 = ((!(env[\"paired\"] === 1)) || (env[\"boundary\"] <= env[\"first\"]) || (env[\"last\"] < env[\"boundary\"]));\n if (!((env[\"op\"] < 2) && (env[\"paired\"] <= 1))) throw new RangeError(\"compaction cut: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"phase\": ((env[\"op\"] === 0) ? (((s[\"phase\"] === 0) && flag0) ? 1 : 2) : (((s[\"phase\"] === 1) && flag1) ? 1 : 2))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { VERIFIED_NAT_MAX } from \"./nat.js\";\nimport type { Machine } from \"./machine.js\";\nimport {\n transitionCurrent as transitionMachine, cleanupState as cleanupMachine, unknownConflict as unknownMachine,\n knownConflict as knownMachine, lineageSelected as lineageMachine, pointerCurrent as pointerMachine,\n coverageComplete as coverageMachine, useNormalized as normalizedMachine, headReadable as headMachine,\n certificateAccepted as certificateMachine, consume as consumeMachine, summaryWithin as summaryMachine,\n sampleWithin as sampleMachine, chunkAccepted as chunkMachine,\n} from \"./generated/policy.js\";\nimport { compactionCut } from \"./generated/compaction.js\";\n\n// Kept local rather than shared with ./machine.js: these decisions sit in the\n// startup graph, and the stateful kernels' codecs load at first use.\nconst bit = (value: boolean): number => (value ? 1 : 0);\nconst isNatural = (value: unknown): value is number => typeof value === \"number\" && Number.isSafeInteger(value) && value >= 0;\nconst call = (machine: Machine, input: object): Record<string, number> => machine.step({}, machine.init({}), input).scalars;\nconst yes = (value: number | undefined): boolean => value === 1;\n\nexport const transitionCurrent = (retired: boolean, sameEpoch: boolean, sameOwner: boolean, closed: boolean): boolean =>\n yes(call(transitionMachine, { retired: bit(retired), sameEpoch: bit(sameEpoch), sameOwner: bit(sameOwner), closed: bit(closed) })[\"out.ok\"]);\n\n/** 0 disposed, 1 diverted, 2 quarantined. */\nexport const cleanupState = (failed: boolean, diverted: boolean): number =>\n call(cleanupMachine, { failed: bit(failed), diverted: bit(diverted) })[\"out.state\"]!;\n\nexport const unknownConflict = (lu: boolean, luo: boolean, lo: boolean, ru: boolean, ruo: boolean, ro: boolean): boolean =>\n yes(call(unknownMachine, { lu: bit(lu), luo: bit(luo), lo: bit(lo), ru: bit(ru), ruo: bit(ruo), ro: bit(ro) })[\"out.conflict\"]);\n\nexport const knownConflict = (shared: boolean, leftOrdered: boolean, rightOrdered: boolean): boolean =>\n yes(call(knownMachine, { shared: bit(shared), leftOrdered: bit(leftOrdered), rightOrdered: bit(rightOrdered) })[\"out.conflict\"]);\n\nexport const lineageSelected = (allBranches: boolean, member: boolean): boolean =>\n yes(call(lineageMachine, { allBranches: bit(allBranches), member: bit(member) })[\"out.selected\"]);\n\nexport const pointerCurrent = (source: boolean, lineage: boolean): boolean =>\n yes(call(pointerMachine, { source: bit(source), lineage: bit(lineage) })[\"out.current\"]);\n\nexport const coverageComplete = (sourceComplete: boolean, truncated: boolean): boolean =>\n yes(call(coverageMachine, { sourceComplete: bit(sourceComplete), truncated: bit(truncated) })[\"out.complete\"]);\n\nexport const useNormalized = (canonical: boolean, plan: boolean, changed: boolean, accepted: boolean): boolean =>\n yes(call(normalizedMachine, { canonical: bit(canonical), plan: bit(plan), changed: bit(changed), accepted: bit(accepted) })[\"out.use\"]);\n\nexport const headReadable = (sequence: boolean, version: boolean, committed: boolean, pending: boolean, marker: boolean): boolean =>\n yes(call(headMachine, { sequence: bit(sequence), version: bit(version), committed: bit(committed), pending: bit(pending), marker: bit(marker) })[\"out.readable\"]);\n\n/** One-use consumption: whether this use releases the token, and whether it stays active. */\nexport const consume = (active: boolean): { released: boolean; active: boolean } => {\n const out = call(consumeMachine, { active: bit(active) });\n return { released: yes(out[\"out.released\"]), active: yes(out[\"out.active\"]) };\n};\n\nexport const acceptSummaryBounds = (bytes: number, byteLimit: number, projected: number, target: number): boolean =>\n [bytes, byteLimit, projected, target].every(isNatural) &&\n yes(call(summaryMachine, { bytes, byteLimit, projected, target })[\"out.within\"]);\n\nexport const acceptSampleAccounting = (total: number, retained: number, omitted: number, limit: number): boolean =>\n [total, retained, omitted, limit].every(isNatural) && retained + omitted <= VERIFIED_NAT_MAX &&\n yes(call(sampleMachine, { total, retained, omitted, limit })[\"out.within\"]);\n\nexport interface CutSpan {\n first: number;\n last: number;\n hasCall: boolean;\n hasResult: boolean;\n}\n\nexport interface CutCandidate {\n eligible: boolean;\n afterPrevious: boolean;\n retained: number;\n budget: number;\n boundary: number;\n}\n\nconst OPEN = 1;\n/** The producer may reject cheaply, but cannot publish a cut without this check.\n * The compiled cut machine folds the header and then every source span. */\nexport const acceptCompactionCut = (candidate: CutCandidate, spans: Iterable<CutSpan>): boolean => {\n if (![candidate.retained, candidate.budget, candidate.boundary].every(isNatural) ||\n typeof candidate.eligible !== \"boolean\" || typeof candidate.afterPrevious !== \"boolean\") return false;\n const params = {\n eligible: bit(candidate.eligible), afterPrevious: bit(candidate.afterPrevious),\n retained: candidate.retained, budget: candidate.budget, boundary: candidate.boundary,\n };\n let state = compactionCut.step(params, compactionCut.init(params), { op: 0, first: 0, last: 0, paired: 0 });\n if (state.scalars.phase !== OPEN) return false;\n for (const span of spans) {\n if (!isNatural(span.first) || !isNatural(span.last) || span.first > span.last ||\n typeof span.hasCall !== \"boolean\" || typeof span.hasResult !== \"boolean\") return false;\n state = compactionCut.step(params, state, { op: 1, first: span.first, last: span.last, paired: bit(span.hasCall && span.hasResult) });\n if (state.scalars.phase !== OPEN) return false;\n }\n return true;\n};\n\nexport interface TextRange { start: number; end: number; total: number; complete: boolean }\nexport const acceptMemoryChunk = (\n range: TextRange, length: number, expectedStart: number, expectedTotal: number,\n): boolean => {\n if (![range.start, range.end, range.total, length, expectedStart, expectedTotal].every(isNatural) ||\n range.start + length > VERIFIED_NAT_MAX || typeof range.complete !== \"boolean\") return false;\n return yes(call(chunkMachine, {\n start: range.start, end: range.end, total: range.total, expectedStart, expectedTotal,\n length, complete: bit(range.complete),\n })[\"out.accepted\"]);\n};\n\n/** A fixed ordered tuple prevents a missing check from becoming an empty,\n * vacuously accepted certificate. Messages are diagnostics, never authority. */\nexport const assertCertificateFacts = (\n facts: readonly [CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact, CertificateFact],\n): void => {\n if (facts.length !== 8 || facts.some((fact) => typeof fact.valid !== \"boolean\")) {\n throw new Error(\"Invalid Schema certificate evidence\");\n }\n const input = Object.fromEntries(facts.map((fact, index) => [`f${index}`, bit(fact.valid)]));\n if (!yes(call(certificateMachine, input)[\"out.accepted\"])) {\n throw new Error(facts.find((fact) => !fact.valid)?.error ?? \"Schema certificate rejected\");\n }\n};\ninterface CertificateFact { valid: boolean; error: string }\n"],
5
5
  "mappings": ";AAEO,IAAM,mBAAmB,OAAO;;;ACDvC,SAAS,GAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AACzK,SAAS,GAAG,GAAG;AAAE,MAAI,IAAI,iBAAkB,OAAM,IAAI,WAAW,6FAA6F;AAAG,SAAO;AAAG;AAEnK,IAAM,oBAAqC,uBAAM;AAExD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,UAAU,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC1C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC1R,QAAI,EAAG,IAAI,SAAS,KAAK,KAAO,IAAI,WAAW,KAAK,KAAO,IAAI,WAAW,KAAK,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,wGAAwG;AACzO,UAAM,UAAU,EAAC,GAAG,GAAG,UAAa,EAAE,IAAI,SAAS,MAAM,MAAQ,IAAI,WAAW,MAAM,KAAO,IAAI,WAAW,MAAM,KAAO,EAAE,IAAI,QAAQ,MAAM,KAAO,IAAI,EAAE;AAC1J,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,eAAgC,uBAAM;AAEnD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,aAAa,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC7C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC7K,QAAI,EAAG,IAAI,QAAQ,KAAK,KAAO,IAAI,UAAU,KAAK,GAAK,OAAM,IAAI,WAAW,mGAAmG;AAC/K,UAAM,UAAU,EAAC,GAAG,GAAG,aAAe,IAAI,QAAQ,MAAM,IAAK,IAAM,IAAI,UAAU,MAAM,IAAK,IAAI,EAAG;AACnG,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,kBAAmC,uBAAM;AAEtD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACjS,QAAI,EAAG,IAAI,IAAI,KAAK,KAAO,IAAI,KAAK,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,KAAK,KAAK,KAAO,IAAI,IAAI,KAAK,GAAK,OAAM,IAAI,WAAW,sGAAsG;AAC1P,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAoB,IAAI,IAAI,MAAM,MAAQ,IAAI,KAAK,MAAM,KAAO,IAAI,IAAI,MAAM,MAAU,IAAI,IAAI,MAAM,MAAQ,IAAI,KAAK,MAAM,KAAO,IAAI,IAAI,MAAM,KAAQ,IAAI,EAAE;AACvL,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,eAAe,GAAG,MAAM,aAAa,GAAG,mBAAmB,GAAG,gBAAgB,GAAG,MAAM,cAAc,GAAG,oBAAoB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACvP,QAAI,EAAG,IAAI,QAAQ,KAAK,KAAO,IAAI,aAAa,KAAK,KAAO,IAAI,cAAc,KAAK,GAAK,OAAM,IAAI,WAAW,oGAAoG;AACjN,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,QAAQ,MAAM,MAAQ,IAAI,aAAa,MAAM,KAAO,IAAI,cAAc,MAAM,KAAO,IAAI,EAAE;AACvI,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,kBAAmC,uBAAM;AAEtD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,eAAe,GAAG,MAAM,aAAa,GAAG,mBAAmB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACtL,QAAI,EAAG,IAAI,aAAa,KAAK,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,sGAAsG;AACrL,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,aAAa,MAAM,KAAO,IAAI,QAAQ,MAAM,IAAM,IAAI,EAAE;AACtG,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,iBAAkC,uBAAM;AAErD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,eAAe,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC/C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AAC1K,QAAI,EAAG,IAAI,QAAQ,KAAK,KAAO,IAAI,SAAS,KAAK,GAAK,OAAM,IAAI,WAAW,qGAAqG;AAChL,UAAM,UAAU,EAAC,GAAG,GAAG,eAAkB,IAAI,QAAQ,MAAM,KAAO,IAAI,SAAS,MAAM,IAAM,IAAI,EAAE;AACjG,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,mBAAoC,uBAAM;AAEvD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,kBAAkB,GAAG,MAAM,gBAAgB,GAAG,sBAAsB,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACxM,QAAI,EAAG,IAAI,gBAAgB,KAAK,KAAO,IAAI,WAAW,KAAK,GAAK,OAAM,IAAI,WAAW,uGAAuG;AAC5L,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,gBAAgB,MAAM,KAAO,EAAE,IAAI,WAAW,MAAM,KAAO,IAAI,EAAE;AAC/G,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,WAAW,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC3C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,QAAQ,GAAG,MAAM,MAAM,GAAG,YAAY,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACjR,QAAI,EAAG,IAAI,WAAW,KAAK,KAAO,IAAI,MAAM,KAAK,KAAO,IAAI,SAAS,KAAK,KAAO,IAAI,UAAU,KAAK,GAAK,OAAM,IAAI,WAAW,oGAAoG;AAClO,UAAM,UAAU,EAAC,GAAG,GAAG,WAAc,EAAE,IAAI,WAAW,MAAM,MAAQ,IAAI,MAAM,MAAM,KAAO,IAAI,SAAS,MAAM,KAAO,IAAI,UAAU,MAAM,IAAM,IAAI,EAAE;AACrJ,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,eAAgC,uBAAM;AAEnD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACzU,QAAI,EAAG,IAAI,UAAU,KAAK,KAAO,IAAI,SAAS,KAAK,KAAO,IAAI,WAAW,KAAK,KAAO,IAAI,SAAS,KAAK,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,mGAAmG;AAC5P,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,UAAU,MAAM,KAAO,IAAI,SAAS,MAAM,MAAQ,IAAI,WAAW,MAAM,KAAQ,IAAI,SAAS,MAAM,KAAO,IAAI,QAAQ,MAAM,KAAQ,IAAI,EAAE;AACvL,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,sBAAuC,uBAAM;AAE1D,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACjW,QAAI,EAAG,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,KAAO,IAAI,IAAI,KAAK,GAAK,OAAM,IAAI,WAAW,0GAA0G;AACpS,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,KAAO,IAAI,IAAI,MAAM,IAAM,IAAI,EAAE;AACvN,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,UAA2B,uBAAM;AAE9C,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,GAAG,cAAc,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EACjE;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACxH,QAAI,EAAE,IAAI,QAAQ,KAAK,GAAI,OAAM,IAAI,WAAW,6FAA6F;AAC7I,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAkB,IAAI,QAAQ,MAAM,IAAK,IAAI,GAAI,cAAiB,IAAI,QAAQ,MAAM,KAAO,EAAE,IAAI,QAAQ,MAAM,KAAO,IAAI,EAAE;AACnJ,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,cAAc,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC9C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACpR,UAAM,UAAU,EAAC,GAAG,GAAG,cAAiB,IAAI,OAAO,KAAK,IAAI,WAAW,KAAO,IAAI,WAAW,KAAK,IAAI,QAAQ,IAAM,IAAI,EAAE;AAC1H,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,eAAgC,uBAAM;AAEnD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,cAAc,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC9C;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,WAAW,GAAG,MAAM,SAAS,GAAG,eAAe,GAAG,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACxQ,UAAM,UAAU,EAAC,GAAG,GAAG,cAAiB,IAAI,OAAO,MAAM,GAAG,IAAI,UAAU,IAAI,IAAI,SAAS,CAAC,KAAO,IAAI,UAAU,KAAK,IAAI,OAAO,IAAM,IAAI,EAAE;AAC7I,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;AAEI,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,gBAAgB,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAChD;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,OAAO,GAAG,MAAM,KAAK,GAAG,WAAW,GAAG,SAAS,GAAG,MAAM,OAAO,GAAG,aAAa,GAAG,iBAAiB,GAAG,MAAM,eAAe,GAAG,qBAAqB,GAAG,iBAAiB,GAAG,MAAM,eAAe,GAAG,qBAAqB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,YAAY,GAAG,MAAM,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACnb,QAAI,EAAE,IAAI,UAAU,KAAK,GAAI,OAAM,IAAI,WAAW,oGAAoG;AACtJ,UAAM,UAAU,EAAC,GAAG,GAAG,gBAAmB,IAAI,OAAO,MAAM,IAAI,eAAe,KAAO,IAAI,OAAO,MAAM,IAAI,eAAe,KAAO,IAAI,OAAO,KAAK,IAAI,KAAK,KAAO,IAAI,KAAK,KAAK,IAAI,OAAO,KAAO,GAAG,IAAI,QAAQ,IAAI,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK,OAAS,EAAE,IAAI,UAAU,MAAM,MAAQ,IAAI,KAAK,MAAM,IAAI,OAAO,OAAS,EAAE,IAAI,KAAK,MAAM,IAAI,OAAO,MAAQ,IAAI,UAAU,MAAM,QAAU,IAAI,UAAU,MAAM,KAAO,IAAI,OAAO,IAAI,IAAI,KAAK,KAAO,IAAI,EAAE;AAC1b,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;;;ACjNH,SAASA,IAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AAElK,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,EAAC,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,iBAAiBA,IAAG,OAAO,eAAe,GAAG,qBAAqB,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,UAAUA,IAAG,OAAO,QAAQ,GAAG,cAAc,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,EAAC,GAAG,IAAI,CAAC;AAC1S,WAAO,EAAC,SAAS,EAAC,SAAS,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EACzC;AACA,WAAS,KAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,iBAAiBA,IAAG,OAAO,eAAe,GAAG,qBAAqB,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,UAAUA,IAAG,OAAO,QAAQ,GAAG,cAAc,GAAG,YAAYA,IAAG,OAAO,UAAU,GAAG,gBAAgB,GAAG,MAAMA,IAAG,MAAM,IAAI,GAAG,UAAU,GAAG,SAASA,IAAG,MAAM,OAAO,GAAG,aAAa,GAAG,QAAQA,IAAG,MAAM,MAAM,GAAG,YAAY,GAAG,UAAUA,IAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACvgB,UAAM,QAAU,IAAI,UAAU,MAAM,KAAO,IAAI,eAAe,MAAM,KAAO,IAAI,UAAU,KAAK,IAAI,QAAQ;AAC1G,UAAM,QAAU,EAAE,IAAI,QAAQ,MAAM,MAAQ,IAAI,UAAU,KAAK,IAAI,OAAO,KAAO,IAAI,MAAM,IAAI,IAAI,UAAU;AAC7G,QAAI,EAAG,IAAI,IAAI,IAAI,KAAO,IAAI,QAAQ,KAAK,GAAK,OAAM,IAAI,WAAW,oGAAoG;AACzK,UAAM,UAAU,EAAC,GAAG,GAAG,SAAW,IAAI,IAAI,MAAM,IAAQ,EAAE,OAAO,MAAM,KAAM,QAAS,IAAI,IAAQ,EAAE,OAAO,MAAM,KAAM,QAAS,IAAI,EAAG;AACvI,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,KAAK;AACpB,GAAG;;;ACLH,IAAM,MAAM,CAAC,UAA4B,QAAQ,IAAI;AACrD,IAAM,YAAY,CAAC,UAAoC,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS;AAC5H,IAAM,OAAO,CAAC,SAAkB,UAA0C,QAAQ,KAAK,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE;AACpH,IAAM,MAAM,CAAC,UAAuC,UAAU;AAEvD,IAAMC,qBAAoB,CAAC,SAAkB,WAAoB,WAAoB,WAC1F,IAAI,KAAK,mBAAmB,EAAE,SAAS,IAAI,OAAO,GAAG,WAAW,IAAI,SAAS,GAAG,WAAW,IAAI,SAAS,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC;AAGtI,IAAMC,gBAAe,CAAC,QAAiB,aAC5C,KAAK,cAAgB,EAAE,QAAQ,IAAI,MAAM,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAC,EAAE,WAAW;AAE7E,IAAMC,mBAAkB,CAAC,IAAa,KAAc,IAAa,IAAa,KAAc,OACjG,IAAI,KAAK,iBAAgB,EAAE,IAAI,IAAI,EAAE,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC;AAEzH,IAAMC,iBAAgB,CAAC,QAAiB,aAAsB,iBACnE,IAAI,KAAK,eAAc,EAAE,QAAQ,IAAI,MAAM,GAAG,aAAa,IAAI,WAAW,GAAG,cAAc,IAAI,YAAY,EAAE,CAAC,EAAE,cAAc,CAAC;AAE1H,IAAMC,mBAAkB,CAAC,aAAsB,WACpD,IAAI,KAAK,iBAAgB,EAAE,aAAa,IAAI,WAAW,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,cAAc,CAAC;AAE3F,IAAMC,kBAAiB,CAAC,QAAiB,YAC9C,IAAI,KAAK,gBAAgB,EAAE,QAAQ,IAAI,MAAM,GAAG,SAAS,IAAI,OAAO,EAAE,CAAC,EAAE,aAAa,CAAC;AAElF,IAAMC,oBAAmB,CAAC,gBAAyB,cACxD,IAAI,KAAK,kBAAiB,EAAE,gBAAgB,IAAI,cAAc,GAAG,WAAW,IAAI,SAAS,EAAE,CAAC,EAAE,cAAc,CAAC;AAExG,IAAMC,iBAAgB,CAAC,WAAoB,MAAe,SAAkB,aACjF,IAAI,KAAK,eAAmB,EAAE,WAAW,IAAI,SAAS,GAAG,MAAM,IAAI,IAAI,GAAG,SAAS,IAAI,OAAO,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAC,EAAE,SAAS,CAAC;AAEjI,IAAMC,gBAAe,CAAC,UAAmB,SAAkB,WAAoB,SAAkB,WACtG,IAAI,KAAK,cAAa,EAAE,UAAU,IAAI,QAAQ,GAAG,SAAS,IAAI,OAAO,GAAG,WAAW,IAAI,SAAS,GAAG,SAAS,IAAI,OAAO,GAAG,QAAQ,IAAI,MAAM,EAAE,CAAC,EAAE,cAAc,CAAC;AAG3J,IAAMC,WAAU,CAAC,WAA4D;AAClF,QAAM,MAAM,KAAK,SAAgB,EAAE,QAAQ,IAAI,MAAM,EAAE,CAAC;AACxD,SAAO,EAAE,UAAU,IAAI,IAAI,cAAc,CAAC,GAAG,QAAQ,IAAI,IAAI,YAAY,CAAC,EAAE;AAC9E;AAEO,IAAM,sBAAsB,CAAC,OAAe,WAAmB,WAAmB,WACvF,CAAC,OAAO,WAAW,WAAW,MAAM,EAAE,MAAM,SAAS,KACrD,IAAI,KAAK,eAAgB,EAAE,OAAO,WAAW,WAAW,OAAO,CAAC,EAAE,YAAY,CAAC;AAE1E,IAAM,yBAAyB,CAAC,OAAe,UAAkB,SAAiB,UACvF,CAAC,OAAO,UAAU,SAAS,KAAK,EAAE,MAAM,SAAS,KAAK,WAAW,WAAW,oBAC5E,IAAI,KAAK,cAAe,EAAE,OAAO,UAAU,SAAS,MAAM,CAAC,EAAE,YAAY,CAAC;AAiB5E,IAAM,OAAO;AAGN,IAAM,sBAAsB,CAAC,WAAyB,UAAsC;AACjG,MAAI,CAAC,CAAC,UAAU,UAAU,UAAU,QAAQ,UAAU,QAAQ,EAAE,MAAM,SAAS,KAC3E,OAAO,UAAU,aAAa,aAAa,OAAO,UAAU,kBAAkB,UAAW,QAAO;AACpG,QAAM,SAAS;AAAA,IACb,UAAU,IAAI,UAAU,QAAQ;AAAA,IAAG,eAAe,IAAI,UAAU,aAAa;AAAA,IAC7E,UAAU,UAAU;AAAA,IAAU,QAAQ,UAAU;AAAA,IAAQ,UAAU,UAAU;AAAA,EAC9E;AACA,MAAI,QAAQ,cAAc,KAAK,QAAQ,cAAc,KAAK,MAAM,GAAG,EAAE,IAAI,GAAG,OAAO,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC;AAC1G,MAAI,MAAM,QAAQ,UAAU,KAAM,QAAO;AACzC,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,UAAU,KAAK,KAAK,KAAK,CAAC,UAAU,KAAK,IAAI,KAAK,KAAK,QAAQ,KAAK,QACrE,OAAO,KAAK,YAAY,aAAa,OAAO,KAAK,cAAc,UAAW,QAAO;AACrF,YAAQ,cAAc,KAAK,QAAQ,OAAO,EAAE,IAAI,GAAG,OAAO,KAAK,OAAO,MAAM,KAAK,MAAM,QAAQ,IAAI,KAAK,WAAW,KAAK,SAAS,EAAE,CAAC;AACpI,QAAI,MAAM,QAAQ,UAAU,KAAM,QAAO;AAAA,EAC3C;AACA,SAAO;AACT;AAGO,IAAM,oBAAoB,CAC/B,OAAkB,QAAgB,eAAuB,kBAC7C;AACZ,MAAI,CAAC,CAAC,MAAM,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,eAAe,aAAa,EAAE,MAAM,SAAS,KAC5F,MAAM,QAAQ,SAAS,oBAAoB,OAAO,MAAM,aAAa,UAAW,QAAO;AAC3F,SAAO,IAAI,KAAK,eAAc;AAAA,IAC5B,OAAO,MAAM;AAAA,IAAO,KAAK,MAAM;AAAA,IAAK,OAAO,MAAM;AAAA,IAAO;AAAA,IAAe;AAAA,IACvE;AAAA,IAAQ,UAAU,IAAI,MAAM,QAAQ;AAAA,EACtC,CAAC,EAAE,cAAc,CAAC;AACpB;AAIO,IAAM,yBAAyB,CACpC,UACS;AACT,MAAI,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC,SAAS,OAAO,KAAK,UAAU,SAAS,GAAG;AAC/E,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACvD;AACA,QAAM,QAAQ,OAAO,YAAY,MAAM,IAAI,CAAC,MAAM,UAAU,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC;AAC3F,MAAI,CAAC,IAAI,KAAK,qBAAoB,KAAK,EAAE,cAAc,CAAC,GAAG;AACzD,UAAM,IAAI,MAAM,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,KAAK,GAAG,SAAS,6BAA6B;AAAA,EAC3F;AACF;",
6
6
  "names": ["$n", "transitionCurrent", "cleanupState", "unknownConflict", "knownConflict", "lineageSelected", "pointerCurrent", "coverageComplete", "useNormalized", "headReadable", "consume"]
7
7
  }
@@ -2,6 +2,9 @@ import {
2
2
  defaultCodePreviewSettings,
3
3
  normalizeCodePreviewSettings
4
4
  } from "./chunk-OKOHRXGF.js";
5
+ import {
6
+ PI_CORE_TOOL_NAME_SET
7
+ } from "./chunk-YU62DDKK.js";
5
8
  import {
6
9
  renameAtomic
7
10
  } from "./chunk-IZIBLVU2.js";
@@ -24,18 +27,6 @@ import {
24
27
  import {
25
28
  normalizeJevApprovalModel
26
29
  } from "./chunk-G54PEZ44.js";
27
- import {
28
- PI_CORE_TOOL_NAME_SET
29
- } from "./chunk-YU62DDKK.js";
30
-
31
- // src/core/shell-limits.ts
32
- var DEFAULT_SHELL_HANG_MS = 12e4;
33
- var SHELL_HANG_MAX_MS = 6e5;
34
-
35
- // src/config.ts
36
- import fs2 from "node:fs";
37
- import os from "node:os";
38
- import path2 from "node:path";
39
30
 
40
31
  // src/core/foreground-tools.ts
41
32
  var MAX_FOREGROUND_TOOLS = 8;
@@ -87,6 +78,15 @@ var resolveForegroundTools = (input) => {
87
78
  };
88
79
  var formatForeground = ({ tools, refused }) => (refused.length > 0 ? `refused ${refused.map(({ name, reason }) => `${name} (${reason})`).join(", ")}; ` : "") + `declared ${tools.length > 0 ? tools.join(", ") : "fabric_exec only"}`;
89
80
 
81
+ // src/core/shell-limits.ts
82
+ var DEFAULT_SHELL_HANG_MS = 12e4;
83
+ var SHELL_HANG_MAX_MS = 6e5;
84
+
85
+ // src/config.ts
86
+ import fs2 from "node:fs";
87
+ import os from "node:os";
88
+ import path2 from "node:path";
89
+
90
90
  // src/core/damaged-file.ts
91
91
  import fs from "node:fs";
92
92
  import path from "node:path";
@@ -1368,4 +1368,4 @@ export {
1368
1368
  loadFabricConfig,
1369
1369
  saveFabricConfig
1370
1370
  };
1371
- //# sourceMappingURL=chunk-LNCG7GR6.js.map
1371
+ //# sourceMappingURL=chunk-36DWG6CP.js.map