@duckcodeailabs/dql-agent 1.13.5 → 1.14.1

package/dist/analytical-orchestration.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analytical-orchestration.d.ts","sourceRoot":"","sources":["../src/analytical-orchestration.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AAE5E,eAAO,MAAM,yCAAyC,EAAG,CAAU,CAAC;AAEpE,MAAM,MAAM,kBAAkB,GAC1B,cAAc,GACd,YAAY,GACZ,QAAQ,GACR,SAAS,GACT,WAAW,GACX,YAAY,GACZ,WAAW,GACX,WAAW,GACX,UAAU,GACV,UAAU,GACV,eAAe,GAIf,aAAa,CAAC;AAElB,MAAM,MAAM,kBAAkB,GAC1B,YAAY,GACZ,aAAa,GACb,SAAS,GACT,kBAAkB,GAClB,WAAW,GACX,YAAY,GACZ,WAAW,GACX,WAAW,GACX,iBAAiB,CAAC;AAEtB,MAAM,MAAM,oBAAoB,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;AAEvG,MAAM,WAAW,8BAA8B;IAC7C,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,OAAO,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IACvB,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC7B;AAED,wEAAwE;AACxE,MAAM,WAAW,0BAA0B;IACzC,OAAO,EAAE,CAAC,CAAC;IACX,IAAI,EAAE,mBAAmB,CAAC;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,QAAQ,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,WAAW,iCAAiC;IAChD,OAAO,EAAE,CAAC,CAAC;IACX,YAAY,EAAE,MAAM,CAAC;IACrB,uBAAuB,EAAE,MAAM,CAAC;IAChC,eAAe,EAAE,MAAM,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,MAAM,kCAAkC,GAC1C;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,iCAAiC,CAAA;CAAE,GACxD;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,0BAA0B,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC;AAErE,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,CAAC,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,kBAAkB,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,UAAU,CAAC,EAAE,0BAA0B,CAAC;IACxC,MAAM,EAAE,8BAA8B,CAAC;IACvC,MAAM,EAAE,oBAAoB,CAAC;IAC7B,6DAA6D;IAC7D,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,gEAAgE;IAChE,iBAAiB,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,cAAc,GAAG,QAAQ,GAAG,MAAM,CAAA;KAAE,CAAC,CAAC;CACrG;AAED,uEAAuE;AACvE,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,CAAC,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,WAAW,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;IACpD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,GAAG,CAAC,EAAE,uBAAuB,CAAC;CAC/B;AAED,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,CAAC,CAAC;IACX,IAAI,EACA,iBAAiB,GACjB,mBAAmB,GACnB,mBAAmB,GACnB,sBAAsB,GACtB,4BAA4B,GAC5B,0BAA0B,GAC1B,sBAAsB,GACtB,kBAAkB,GAClB,mBAAmB,GACnB,gBAAgB,CAAC;IACrB,KAAK,EAAE,WAAW,GAAG,SAAS,GAAG,UAAU,GAAG,aAAa,GAAG,WAAW,GAAG,cAAc,CAAC;IAC3F,OAAO,EAAE,MAAM,CAAC;IAChB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,KAAK,CAAC,WAAW,GAAG,UAAU,GAAG,qBAAqB,GAAG,WAAW,GAAG,UAAU,CAAC,CAAC;IACpG,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,WAAW,EAAE,OAAO,CAAC;IACrB,UAAU,EAAE,OAAO,CAAC;IACpB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,CAAC,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,kBAAkB,CAAC;IACzB,6EAA6E;IAC7E,iBAAiB,EAAE,CAAC,GAAG,CAAC,CAAC;IACzB,iBAAiB,EAAE,kBAAkB,GAAG,mBAAmB,GAAG,0BAA0B,GAAG,uBAAuB,CAAC;IACnH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,EAAE,gBAAgB,EAAE,CAAC;IAC1B,cAAc,EAAE,KAAK,CAAC,WAAW,GAAG,UAAU,GAAG,qBAAqB,GAAG,WAAW,CAAC,CAAC;IACtF,0EAA0E;IAC1E,MAAM,EAAE,OAAO,CAAC;IAChB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,yBAAyB;IACxC,OAAO,EAAE,CAAC,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,UAAU,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;IACnD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,sBAAsB,CAAC;IAChC,GAAG,CAAC,EAAE,uBAAuB,CAAC;IAC9B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,UAAU,EAAE,WAAW,GAAG,UAAU,GAAG,iBAAiB,GAAG,gBAAgB,GAAG,SAAS,CAAC;CACzF;AAED,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,CAAC,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,yBAAyB,EAAE,CAAC;IACtC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,GAAG,kBAAkB,CAY5E;AAUD,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAuB/D;AAED,wBAAgB,wBAAwB,CAAC,KAAK,EAAE;IAC9C,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,IAAI,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC;IAC1B,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAClD,iBAAiB,CAAC,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,cAAc,GAAG,QAAQ,GAAG,MAAM,CAAA;KAAE,CAAC,CAAC;IACrG,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GAAG;IAAE,IAAI,EAAE,kBAAkB,CAAC;IAAC,KAAK,EAAE,gBAAgB,EAAE,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAmD5E;AAyBD,wBAAgB,uBAAuB,CAAC,KAAK,EAAE;IAC7C,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,OAAO,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAClD,iBAAiB,CAAC,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,cAAc,GAAG,QAAQ,GAAG,MAAM,CAAA;KAAE,CAAC,CAAC;IACrG,cAAc,CAAC,EAAE,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;IAC3D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B,GAAG,oBAAoB,CAmBvB;AAED,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,gBAAgB,EAAE,GAAG;IAChE,MAAM,EAAE,WAAW,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;IACpD,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB,CAWA;AAED,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,CAAC,CAAC;IACX,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,6EAA6E;IAC7E,gBAAgB,CAAC,EAAE,2BAA2B,CAAC;IAC/C,yEAAyE;IACzE,UAAU,CAAC,EAAE,WAAW,GAAG,UAAU,GAAG,iBAAiB,GAAG,gBAAgB,GAAG,SAAS,CAAC;IACzF,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,4BAA4B;IAC3C,OAAO,EAAE,CAAC,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,MAAM,oCAAoC,GAC5C;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,4BAA4B,CAAA;CAAE,GACnD;IACE,EAAE,EAAE,KAAK,CAAC;IACV,IAAI,EAAE,wBAAwB,GAAG,gCAAgC,GAAG,6BAA6B,CAAC;IAClG,OAAO,EAAE,MAAM,CAAC;CACjB,CAAC;AAEN,oEAAoE;AACpE,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,CAK9E;AAED,8EAA8E;AAC9E,wBAAgB,6BAA6B,CAAC,MAAM,EAAE,IAAI,CAAC,sBAAsB,EAAE,SAAS,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAKnI;AAED;;;;GAIG;AACH,wBAAgB,6BAA6B,CAC3C,OAAO,EAAE,4BAA4B,GAAG,SAAS,EACjD,MAAM,EAAE,sBAAsB,GAAG,SAAS,GACzC,oCAAoC,CAwCtC;AAED;;;;;;;GAOG;AACH,wBAAgB,gCAAgC,CAC9C,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,sBAAsB,GAAG,SAAS,EAC1C,UAAU,CAAC,EAAE,IAAI,CAAC,gBAAgB,EAAE,MAAM,GAAG,QAAQ,CAAC,GACrD,kCAAkC,CA8DpC;AAkCD;;;;GAIG;AACH,wBAAgB,6BAA6B,CAAC,KAAK,EAAE;IACnD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB,GAAG,sBAAsB,CAsDzB;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,sBAAsB,GAAG,OAAO,EAAE,EAAE,CAE/E;AAED,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,sBAAsB,GAAG,IAAI,CAW1E;AAED,MAAM,WAAW,sBAAsB;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,OAAO,GAAG,SAAS,GAAG,QAAQ,GAAG,OAAO,GAAG,eAAe,GAAG,QAAQ,GAAG,OAAO,GAAG,cAAc,GAClG,WAAW,GAAG,UAAU,GAAG,YAAY,GAAG,UAAU,CAAC;IACzD,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,WAAW,GAAG,UAAU,GAAG,cAAc,GAAG,aAAa,CAAC;IAClE,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,0BAA0B;IACzC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE;QACpB,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,MAAM,CAAC,EAAE,IAAI,GAAG,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;QAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,qBAAqB;IACpC,UAAU,EAAE,sBAAsB,EAAE,CAAC;IACrC,WAAW,EAAE,0BAA0B,CAAC;CACzC;AAED,mFAAmF;AACnF,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,sBAAsB,EAAE,CAAC,EAC/C,KAAK,SAAK,GACT,qBAAqB,CA4BvB;AAED,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,OAAO,CAAC,sBAAsB,EAAE,CAAC,CAAC,EAC9D,KAAK,SAAK,EACV,aAAa,SAAI,GAChB,OAAO,CAAC,qBAAqB,CAAC,CA+ChC;AAED,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,UAAU,GAAG,QAAQ,GAAG,SAAS,CAAC;IAC1C,2EAA2E;IAC3E,gBAAgB,CAAC,EAAE,2BAA2B,CAAC;IAC/C,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,wBAAwB;IACvC,OAAO,EAAE,CAAC,CAAC;IACX,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,qBAAqB,EAAE,CAAC;IACjC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,cAAc,EAAE,WAAW,GAAG,QAAQ,GAAG,uBAAuB,GAAG,SAAS,GAAG,aAAa,CAAC;CAC9F;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,GAAG,SAAI,GAAG,CAAC,EAAE,CAElE;AAED,wBAAgB,2BAA2B,CAAC,KAAK,EAAE;IACjD,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,qBAAqB,EAAE,CAAC;IACjC,cAAc,CAAC,EAAE,wBAAwB,CAAC,gBAAgB,CAAC,CAAC;CAC7D,GAAG,wBAAwB,CAgD3B;AAED,+EAA+E;AAC/E,wBAAgB,uCAAuC,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,CAI1F;AAED;;;GAGG;AACH,wBAAgB,mCAAmC,CAAC,KAAK,EAAE,OAAO,GAAG,2BAA2B,GAAG,SAAS,CAU3G;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,uBAAuB,EAAE,SAAS,CAAC,GAAG,uBAAuB,CAEzG"}

package/dist/analytical-orchestration.js

@@ -0,0 +1,631 @@
+/**
+ * Shared contracts for the conversational analytical orchestrator.
+ *
+ * The existing DQL engine remains the authority for compilation, execution,
+ * trust, and the immutable resolved analytical plan.  This module is the thin
+ * outer contract used by the conversational layer to describe what it
+ * understood, what it searched, and why it could or could not continue.
+ *
+ * The contract is intentionally content-only: it never carries model
+ * chain-of-thought, credentials, raw provider payloads, or authorization.
+ *
+ * Acceptance: AGT-027..033, CTX-007, PERF-003, E2E-022.
+ */
+import { createHash } from 'node:crypto';
+export const ANALYTICAL_ORCHESTRATION_CONTRACT_VERSION = 1;
+/**
+ * Small, explainable intent vocabulary used before the physical plan exists.
+ * It is deliberately not a second semantic matcher: candidate identity still
+ * comes from retrieval plus the bounded meaning call. These helpers only turn
+ * a request into a task graph and output contract, so a compound question can
+ * report partial success instead of collapsing the whole turn to one error.
+ */
+export function inferAnalyticalTurnKind(question) {
+    const text = question.toLowerCase();
+    if (/\b(hello|hi|hey|thanks|thank you|good morning|good afternoon)\b/.test(text))
+        return 'conversation';
+    if (/\b(why|root cause|driver|diagnos|anomal|changed)\b/.test(text))
+        return 'diagnosis';
+    if (/\b(research|investigate|deep dive|tell a story|surrounding context)\b/.test(text))
+        return 'research';
+    if (/\b(compare|versus|vs\.?|difference)\b/.test(text))
+        return 'comparison';
+    if (/\b(top|bottom|highest|lowest|rank)\b/.test(text))
+        return 'ranking';
+    if (/\b(by|per|over time|trend|monthly|daily|weekly)\b/.test(text))
+        return 'breakdown';
+    if (/\b(what is|what are|define|definition|meaning)\b/.test(text) && !/\b(total|revenue|count|sales|amount)\b/.test(text))
+        return 'definition';
+    if (/\b(region|country|state|city|name|label|email|category|product|customer)\b/.test(text)
+        && /\b(where|which|what|who)\b/.test(text))
+        return 'lookup';
+    return 'aggregation';
+}
+/**
+ * `Regarding: "Mr. Matthew Meyer"` and friends — a short label, a colon, and a
+ * quoted value, with nothing else in the clause. Deliberately narrow: it must
+ * be the WHOLE clause and the value must be quoted, so an ordinary question
+ * that happens to contain a colon is untouched.
+ */
+const ANNOTATION_CLAUSE = /^\s*[A-Za-z][A-Za-z ]{0,24}:\s*["“'‘][^"”'’]*["”'’]\s*$/;
+export function splitAnalyticalTasks(question) {
+    // The separator belongs to the SPLIT, not to the clause. Carrying it through
+    // produced a child task whose question was literally
+    // `" then "What customer type is Wesley Jenkins` — quote, connector and all —
+    // which then failed to resolve and surfaced that punctuation to the reader as
+    // the task title.
+    const leadingJunk = /^(?:[\s"'“”‘’,:;.\-]+|\b(?:then|and|also)\b)+/i;
+    const trailingJunk = /[\s"'“”‘’,:;.\-]+$/;
+    const raw = question
+        .split(/\s*(?:\?|;|\band then\b|\balso\b)\s*/i)
+        .flatMap((part) => part.split(/\s+\band\s+(?=(?:what|who|which|show|list|tell|give|how|why)\b)/i));
+    // A `Label: "value"` clause is an ANNOTATION, not a question. The composer
+    // appends `Regarding: "<selected row>"` when the reader follows up on
+    // something they clicked, and splitting on the `?` before it turned that
+    // referent into a task of its own — titled `Regarding: "Mr. Matthew Meyer`,
+    // which then "answered" by computing an unrelated maximum over the rows still
+    // on screen. Context says WHO the real task is about; it is never a task.
+    // Filtered before the junk strip, which would unbalance the quotes.
+    const asked = raw.filter((part) => !ANNOTATION_CLAUSE.test(part));
+    const parts = (asked.length > 0 ? asked : raw)
+        .map((part) => part.replace(leadingJunk, '').replace(trailingJunk, '').trim())
+        .filter(Boolean);
+    return parts.length > 0 ? parts : [question.trim()];
+}
+export function buildAnalyticalTaskGraph(input) {
+    const rootKind = input.mode === 'research' ? 'research' : inferAnalyticalTurnKind(input.question);
+    // A research turn may later create bounded evidence branches, but that is a
+    // research planner's job. Splitting at ingress loses the surrounding story
+    // before it has an opportunity to reason about it.
+    const clauses = (rootKind === 'research' ? [input.question.trim()] : splitAnalyticalTasks(input.question))
+        .slice(0, Math.max(1, Math.min(6, input.maxTasks ?? 6)));
+    const candidateIds = [...new Set((input.candidateIds ?? []).filter((id) => id.trim()))];
+    const metrics = [...new Set((input.metrics ?? []).filter((metric) => metric.trim()))];
+    const dimensions = [...new Set((input.dimensions ?? []).filter((dimension) => dimension.trim()))];
+    const filters = input.filters ?? [];
+    const inheritedBindings = input.inheritedBindings ?? [];
+    const unboundTasks = clauses.map((clause, index) => {
+        const kind = rootKind === 'research' ? 'research' : inferAnalyticalTurnKind(clause);
+        const research = kind === 'research' || kind === 'diagnosis';
+        const taskKind = research
+            ? 'research_branch'
+            : kind === 'lookup'
+                ? 'attribute_lookup'
+                : kind === 'breakdown'
+                    ? 'breakdown'
+                    : kind === 'comparison'
+                        ? 'comparison'
+                        : kind === 'ranking'
+                            ? 'ranking'
+                            : kind === 'definition'
+                                ? 'definition'
+                                : 'aggregation';
+        return {
+            version: 1,
+            id: `task-${index + 1}`,
+            kind: taskKind,
+            question: clause,
+            dependencies: index === 0 ? [] : [],
+            output: {
+                metrics,
+                dimensions,
+                filters,
+                ...(kind === 'ranking' ? { order: 'desc' } : {}),
+            },
+            status: 'planned',
+            candidateIds,
+            inheritedBindings,
+        };
+    });
+    const tasks = bindTopRankedRegionDependencies(unboundTasks);
+    return {
+        kind: rootKind === 'research' ? 'research' : tasks.length > 1 ? 'compound' : rootKind,
+        tasks,
+        partial: false,
+    };
+}
+const TOP_RANKED_REGION_RE = /(?:\b(?:top|highest|most)\b[^?.!]{0,72}\bregions?\b|\bregions?\b[^?.!]{0,72}\b(?:top|highest|most)\b)/i;
+const DEPENDENT_REGION_CUSTOMERS_RE = /\b(?:that|this|same)\s+region\b/i;
+/**
+ * Recognise only the demonstrated two-step dependency. Broader pronoun
+ * resolution belongs to the normal conversation layer; turning every compound
+ * question into a dependency would serialise unrelated work and invent filters.
+ */
+function bindTopRankedRegionDependencies(tasks) {
+    return tasks.map((task, index) => {
+        if (!DEPENDENT_REGION_CUSTOMERS_RE.test(task.question) || !/\bcustomers?\b/i.test(task.question))
+            return task;
+        const parent = tasks.slice(0, index).reverse().find((candidate) => TOP_RANKED_REGION_RE.test(candidate.question));
+        if (!parent)
+            return task;
+        const dependency = {
+            version: 1,
+            kind: 'top_ranked_region',
+            sourceTaskId: parent.id,
+            targetDimension: 'region',
+        };
+        return { ...task, dependencies: [parent.id], dependency };
+    });
+}
+export function buildAnalyticalTurnPlan(input) {
+    const graph = buildAnalyticalTaskGraph(input);
+    const zeroCall = input.zeroCallReason === 'explicit_binding'
+        || input.zeroCallReason === 'conversation_only'
+        || input.zeroCallReason === 'frozen_research_child';
+    return {
+        version: 1,
+        ...(input.turnId ? { turnId: input.turnId } : {}),
+        question: input.question,
+        kind: graph.kind,
+        meaningCallBudget: zeroCall ? 0 : 1,
+        meaningCallReason: input.zeroCallReason ?? 'candidate_interpretation',
+        ...(input.snapshotId ? { snapshotId: input.snapshotId } : {}),
+        ...(input.sourceFingerprint ? { sourceFingerprint: input.sourceFingerprint } : {}),
+        taskIds: graph.tasks.map((task) => task.id),
+        tasks: graph.tasks,
+        authorityOrder: ['certified', 'semantic', 'governed_relational', 'generated'],
+        frozen: input.frozen === true,
+    };
+}
+export function summarizeTaskOutcomes(tasks) {
+    const completed = tasks.filter((task) => task.status === 'completed').map((task) => task.id);
+    const gaps = tasks.filter((task) => task.status === 'gap' || task.status === 'blocked').map((task) => task.id);
+    const status = completed.length === tasks.length && tasks.length > 0
+        ? 'completed'
+        : completed.length > 0
+            ? 'partial'
+            : gaps.some((id) => tasks.find((task) => task.id === id)?.status === 'blocked')
+                ? 'blocked'
+                : 'gap';
+    return { status, completed, gaps };
+}
+/** Stable scalar transport for a selected canonical result cell. */
+export function canonicalResultBindingValue(value) {
+    if (typeof value === 'string')
+        return value;
+    if (typeof value === 'number' && Number.isFinite(value))
+        return String(value);
+    if (typeof value === 'boolean')
+        return String(value);
+    return undefined;
+}
+/** A row proof includes all canonical columns, not just the selected cell. */
+export function canonicalResultRowFingerprint(result, row) {
+    return stableFingerprint({
+        columns: result.columns,
+        row: Object.fromEntries(result.columns.map((column) => [column, row[column]])),
+    });
+}
+/**
+ * Validate an untrusted selected-result reference against a persisted
+ * canonical result. The source run/artifact identities are checked by the
+ * host before calling this pure result-level validator.
+ */
+export function validateSelectedResultBinding(binding, result) {
+    if (!binding
+        || binding.version !== 1
+        || !binding.sourceRunId.trim()
+        || !binding.sourceArtifactId.trim()
+        || !binding.canonicalColumn.trim()
+        || !binding.value.trim()
+        || !normalizeAnalyticalExecutionFingerprint(binding.rowFingerprint)
+        || !normalizeAnalyticalExecutionFingerprint(binding.resultFingerprint)) {
+        return {
+            ok: false,
+            code: 'RESULT_BINDING_INVALID',
+            message: 'The selected result reference is incomplete or malformed.',
+        };
+    }
+    if (!result || binding.resultFingerprint !== result.resultFingerprint) {
+        return {
+            ok: false,
+            code: 'RESULT_BINDING_RESULT_MISMATCH',
+            message: 'The selected result is no longer the persisted result for this run.',
+        };
+    }
+    if (!result.columns.includes(binding.canonicalColumn)) {
+        return {
+            ok: false,
+            code: 'RESULT_BINDING_ROW_MISMATCH',
+            message: `The selected column ${binding.canonicalColumn} is not present in the persisted result.`,
+        };
+    }
+    const matched = result.rows.some((row) => canonicalResultRowFingerprint(result, row) === binding.rowFingerprint
+        && canonicalResultBindingValue(row[binding.canonicalColumn]) === binding.value);
+    if (!matched) {
+        return {
+            ok: false,
+            code: 'RESULT_BINDING_ROW_MISMATCH',
+            message: 'The selected row/value does not match the persisted result.',
+        };
+    }
+    return { ok: true, binding: { ...binding, resultFingerprint: result.resultFingerprint } };
+}
+/**
+ * Derive the one value a `top region -> customers in that region` child may
+ * consume. A first row alone is never proof. The parent must either return an
+ * explicit rank, or be the server-computed descending ranking task and return
+ * at least two rows with one strictly-leading numeric measure. `rowCount` is
+ * the returned-row contract, not proof that a singleton is the complete group
+ * set. Ties and ambiguous result shapes remain a typed child gap.
+ */
+export function resolveTopRankedRegionDependency(sourceTaskId, result, parentTask) {
+    if (!result || result.rows.length === 0) {
+        return {
+            ok: false,
+            code: 'RESULT_CONTRACT_MISMATCH',
+            message: 'The top-region task did not produce a canonical result that can bind the dependent customer task.',
+        };
+    }
+    const canonicalResultFingerprint = normalizeAnalyticalExecutionFingerprint(result.resultFingerprint);
+    const executionReceipt = normalizeAnalyticalExecutionReceipt(result.executionReceipt);
+    if (!executionReceipt) {
+        return {
+            ok: false,
+            code: 'RESULT_CONTRACT_MISMATCH',
+            message: 'The top-region result did not retain a complete normalized execution receipt, so the dependent customer task was not run.',
+        };
+    }
+    if (!canonicalResultFingerprint
+        || result.resultFingerprint !== canonicalResultFingerprint
+        || executionReceipt.resultFingerprint !== canonicalResultFingerprint) {
+        return {
+            ok: false,
+            code: 'RESULT_CONTRACT_MISMATCH',
+            message: 'The top-region execution receipt does not match the canonical result, so the dependent customer task was not run.',
+        };
+    }
+    const regionColumns = result.columns.filter((column) => /(?:^|_)region(?:_name)?$/i.test(column));
+    if (regionColumns.length !== 1) {
+        return {
+            ok: false,
+            code: 'RESULT_CONTRACT_MISMATCH',
+            message: 'The top-region result did not contain exactly one canonical region column.',
+        };
+    }
+    const canonicalColumn = regionColumns[0];
+    const first = result.rows[0];
+    const value = canonicalResultBindingValue(first[canonicalColumn]);
+    if (!value) {
+        return {
+            ok: false,
+            code: 'RESULT_CONTRACT_MISMATCH',
+            message: 'The leading top-region row did not contain a usable region value.',
+        };
+    }
+    if (!hasUnambiguousTopRow(result, parentTask)) {
+        return {
+            ok: false,
+            code: 'RESULT_CONTRACT_MISMATCH',
+            message: 'The top-region result did not prove a single leading region, so the dependent customer task was not run.',
+        };
+    }
+    return {
+        ok: true,
+        binding: {
+            version: 1,
+            sourceTaskId,
+            sourceResultFingerprint: canonicalResultFingerprint,
+            canonicalColumn,
+            value,
+            rowFingerprint: canonicalResultRowFingerprint(result, first),
+        },
+    };
+}
+function hasUnambiguousTopRow(result, parentTask) {
+    const rankColumn = result.columns.find((column) => /(?:^|_)(?:rank|row_number)$/i.test(column));
+    if (rankColumn) {
+        const ranks = result.rows.map((row) => numericCell(row[rankColumn]));
+        if (ranks[0] === 1 && ranks.slice(1).every((rank) => rank === undefined || rank > 1))
+            return true;
+    }
+    // A plain numerical result column does not say that its first row was ranked.
+    // It becomes a ranking proof only when the server's own parent task explicitly
+    // asked for a descending ranking AND the returned rows demonstrate a strictly
+    // leading value. A singleton needs an explicit rank = 1: it cannot establish
+    // that unreturned groups are lower.
+    if (parentTask?.kind !== 'ranking' || parentTask.output.order !== 'desc')
+        return false;
+    if (result.rows.length < 2)
+        return false;
+    const measures = result.columns.filter((column) => {
+        if (column === rankColumn)
+            return false;
+        const values = result.rows.map((row) => numericCell(row[column]));
+        return values.every((value) => value !== undefined);
+    });
+    if (measures.length !== 1)
+        return false;
+    const values = result.rows.map((row) => numericCell(row[measures[0]]));
+    return values.slice(1).every((value) => values[0] > value);
+}
+function numericCell(value) {
+    if (typeof value === 'number' && Number.isFinite(value))
+        return value;
+    if (typeof value === 'string' && value.trim() && Number.isFinite(Number(value)))
+        return Number(value);
+    return undefined;
+}
+/**
+ * Normalize connector, MetricFlow, and provider result shapes at one boundary.
+ * Connectors may return `ColumnMeta[]` and rows as arrays; UI surfaces should
+ * never need to guess how to index those rows.
+ */
+export function normalizeCanonicalQueryResult(input) {
+    const columns = Array.isArray(input.columns)
+        ? input.columns.map(columnName)
+        : [];
+    const rawRows = Array.isArray(input.rows) ? input.rows : [];
+    const inferredColumns = columns.length > 0
+        ? columns
+        : objectRowColumns(rawRows).length > 0
+            ? objectRowColumns(rawRows)
+            : firstArrayRow(rawRows)
+                ? firstArrayRow(rawRows).map((_, index) => `column_${index + 1}`)
+                : [];
+    const rows = rawRows.map((row) => normalizeRow(row, inferredColumns));
+    const rowCount = typeof input.rowCount === 'number' && Number.isFinite(input.rowCount)
+        ? Math.max(0, Math.trunc(input.rowCount))
+        : rows.length;
+    const executionTime = typeof input.executionTimeMs === 'number'
+        ? input.executionTimeMs
+        : typeof input.executionTime === 'number'
+            ? input.executionTime
+            : undefined;
+    const canonical = {
+        version: 1,
+        columns: inferredColumns,
+        rows,
+        rowCount,
+        ...(executionTime !== undefined ? { executionTime } : {}),
+        ...(input.truncated === true ? { truncated: true } : {}),
+    };
+    const receipt = input.executionReceipt && typeof input.executionReceipt === 'object'
+        ? input.executionReceipt
+        : undefined;
+    const receiptFingerprint = typeof receipt?.resultFingerprint === 'string' ? receipt.resultFingerprint : undefined;
+    const suppliedFingerprint = typeof input.resultFingerprint === 'string' && input.resultFingerprint.trim()
+        ? input.resultFingerprint.trim()
+        : receiptFingerprint;
+    const trustState = input.trustState === 'certified'
+        || input.trustState === 'governed'
+        || input.trustState === 'review_required'
+        || input.trustState === 'not_applicable'
+        || input.trustState === 'blocked'
+        ? input.trustState
+        : undefined;
+    return {
+        ...canonical,
+        ...(receipt ? { executionReceipt: receipt } : {}),
+        ...(trustState ? { trustState } : {}),
+        ...(typeof input.answerTier === 'string' && input.answerTier.trim()
+            ? { answerTier: input.answerTier.trim() }
+            : {}),
+        // A connector/execution receipt is authoritative. The local digest is only
+        // a backwards-compatible fallback for legacy unreceipted rows.
+        resultFingerprint: suppliedFingerprint ?? stableFingerprint(canonical),
+    };
+}
+export function canonicalResultRows(result) {
+    return result.rows.map((row) => result.columns.map((column) => row[column]));
+}
+export function assertCanonicalResult(result) {
+    if (result.version !== 1)
+        throw new Error('Unsupported analytical result contract version.');
+    if (result.rowCount < result.rows.length)
+        throw new Error('Result rowCount cannot be smaller than the returned rows.');
+    if (new Set(result.columns).size !== result.columns.length)
+        throw new Error('Result columns must be unique.');
+    for (const row of result.rows) {
+        for (const column of result.columns) {
+            if (!Object.prototype.hasOwnProperty.call(row, column)) {
+                throw new Error(`Result row is missing the declared column ${column}.`);
+            }
+        }
+    }
+}
+/** Reciprocal-rank fusion keeps recall across lexical, vector, and graph lanes. */
+export function fuseContextCandidates(lanes, limit = 32) {
+    const safeLimit = Math.max(1, Math.min(100, Math.trunc(limit)));
+    const byId = new Map();
+    const diagnostics = { lanes: {}, selectedIds: [], truncated: false };
+    for (const [lane, cards] of Object.entries(lanes)) {
+        diagnostics.lanes[lane] = { returned: cards.length };
+        cards.forEach((card, index) => {
+            if (!card.id.trim())
+                return;
+            const score = 1 / (60 + index + 1) + Math.max(0, Math.min(1, card.relevance)) * 0.25;
+            const existing = byId.get(card.id);
+            if (existing) {
+                existing.score += score;
+                existing.lanes.add(lane);
+                if ((card.relevance ?? 0) > existing.relevance)
+                    existing.relevance = card.relevance;
+                if (card.compatible === true)
+                    existing.compatible = true;
+                if (!existing.summary && card.summary)
+                    existing.summary = card.summary;
+            }
+            else {
+                byId.set(card.id, { ...card, score, lanes: new Set([lane]) });
+            }
+        });
+    }
+    const selected = [...byId.values()]
+        .sort((left, right) => right.score - left.score || right.relevance - left.relevance || left.id.localeCompare(right.id))
+        .slice(0, safeLimit)
+        .map(({ score: _score, lanes: _lanes, ...card }) => card);
+    diagnostics.selectedIds = selected.map((card) => card.id);
+    diagnostics.truncated = byId.size > selected.length;
+    return { candidates: selected, diagnostics };
+}
+export async function retrieveContextLanes(lanes, limit = 32, maxConcurrent = 4) {
+    const entries = Object.entries(lanes);
+    const concurrency = Math.max(1, Math.min(8, Math.trunc(maxConcurrent) || 1));
+    const settled = [];
+    let nextIndex = 0;
+    const worker = async () => {
+        for (;;) {
+            const index = nextIndex;
+            nextIndex += 1;
+            const entry = entries[index];
+            if (!entry)
+                return;
+            const [name, retrieve] = entry;
+            const startedAt = Date.now();
+            try {
+                const cards = await retrieve();
+                settled[index] = [name, cards, Date.now() - startedAt];
+            }
+            catch (error) {
+                settled[index] = [name, { error: error instanceof Error ? error.message : String(error) }, Date.now() - startedAt];
+            }
+        }
+    };
+    await Promise.all(Array.from({ length: Math.min(concurrency, entries.length) }, () => worker()));
+    const successful = {};
+    const errors = {};
+    const durations = {};
+    for (const [name, result, durationMs] of settled) {
+        durations[name] = durationMs;
+        if (Array.isArray(result))
+            successful[name] = result;
+        else
+            errors[name] = result.error;
+    }
+    const fused = fuseContextCandidates(successful, limit);
+    for (const [name, cards] of Object.entries(successful)) {
+        fused.diagnostics.lanes[name] = {
+            returned: cards.length,
+            durationMs: durations[name],
+            status: cards.length > 0 ? 'ok' : 'empty',
+        };
+    }
+    for (const [name, error] of Object.entries(errors)) {
+        fused.diagnostics.lanes[name] = {
+            returned: 0,
+            durationMs: durations[name],
+            status: 'error',
+            error,
+        };
+    }
+    return fused;
+}
+export function capResearchBranches(branches, max = 6) {
+    return branches.slice(0, Math.max(1, Math.min(6, Math.trunc(max))));
+}
+export function buildResearchEvidenceLedger(input) {
+    const entries = input.entries.slice(0, 6).map((entry) => {
+        const resultFingerprint = normalizeAnalyticalExecutionFingerprint(entry.resultFingerprint);
+        const executionReceipt = normalizeAnalyticalExecutionReceipt(entry.executionReceipt);
+        const receiptFingerprint = executionReceipt?.resultFingerprint;
+        const listedFingerprint = entry.receipts
+            .map((receipt) => normalizeAnalyticalExecutionFingerprint(receipt))
+            .find((receipt) => Boolean(receipt));
+        const executionProof = resultFingerprint ?? receiptFingerprint ?? listedFingerprint;
+        // A receipt/result proof is meaningful only for an observed branch. Never
+        // carry a preloaded receipt, child ID, context-pack ID, or malformed
+        // fingerprint through a failed/cancelled/skipped entry.
+        if (entry.status !== 'observed') {
+            const { executionReceipt: _receipt, resultFingerprint: _fingerprint, ...withoutProof } = entry;
+            return { ...withoutProof, receipts: [] };
+        }
+        // A ready/observed branch without a complete receipt or canonical result
+        // fingerprint is not an observation. Downgrade it and retain no invented
+        // proof; callers can still inspect the branch and retry it explicitly.
+        if (!executionProof) {
+            const { executionReceipt: _receipt, resultFingerprint: _fingerprint, ...withoutProof } = entry;
+            return {
+                ...withoutProof,
+                status: 'failed',
+                receipts: [],
+                error: entry.error ?? 'Research branch had no valid execution receipt or canonical result fingerprint.',
+            };
+        }
+        return {
+            ...entry,
+            status: 'observed',
+            resultFingerprint: executionProof,
+            ...(executionReceipt ? { executionReceipt } : {}),
+            receipts: [executionProof],
+        };
+    });
+    return {
+        version: 1,
+        rootQuestion: input.rootQuestion,
+        ...(input.planId ? { planId: input.planId } : {}),
+        ...(input.snapshotId ? { snapshotId: input.snapshotId } : {}),
+        entries,
+        factIds: [...new Set(entries.flatMap((entry) => entry.facts))],
+        stoppingReason: input.stoppingReason ?? (entries.length > 0 ? 'completed' : 'not_started'),
+    };
+}
+/** The only accepted host-side execution identity is a SHA-256 fingerprint. */
+export function normalizeAnalyticalExecutionFingerprint(value) {
+    return typeof value === 'string' && /^[a-f0-9]{64}$/i.test(value.trim())
+        ? value.trim().toLowerCase()
+        : undefined;
+}
+/**
+ * Normalize a complete DQL execution receipt. A partial object or arbitrary
+ * identifier is deliberately not execution evidence.
+ */
+export function normalizeAnalyticalExecutionReceipt(value) {
+    if (!value || typeof value !== 'object' || Array.isArray(value))
+        return undefined;
+    const record = value;
+    const sourceFingerprint = normalizeAnalyticalExecutionFingerprint(record.sourceFingerprint);
+    const compiledSqlFingerprint = normalizeAnalyticalExecutionFingerprint(record.compiledSqlFingerprint);
+    const parameterFingerprint = normalizeAnalyticalExecutionFingerprint(record.parameterFingerprint);
+    const resultFingerprint = normalizeAnalyticalExecutionFingerprint(record.resultFingerprint);
+    return sourceFingerprint && compiledSqlFingerprint && parameterFingerprint && resultFingerprint
+        ? { sourceFingerprint, compiledSqlFingerprint, parameterFingerprint, resultFingerprint }
+        : undefined;
+}
+export function buildCoverageGap(input) {
+    return { version: 1, ...input };
+}
+function columnName(value) {
+    if (typeof value === 'string')
+        return value;
+    if (value && typeof value === 'object' && typeof value.name === 'string') {
+        return String(value.name);
+    }
+    return String(value ?? 'column');
+}
+function objectRowColumns(rows) {
+    const columns = new Set();
+    for (const row of rows) {
+        if (!row || typeof row !== 'object' || Array.isArray(row))
+            continue;
+        for (const column of Object.keys(row))
+            columns.add(column);
+    }
+    return [...columns];
+}
+function firstArrayRow(rows) {
+    const row = rows.find((candidate) => Array.isArray(candidate));
+    return row;
+}
+function normalizeRow(row, columns) {
+    if (Array.isArray(row))
+        return Object.fromEntries(columns.map((column, index) => [column, row[index]]));
+    if (row && typeof row === 'object') {
+        const record = row;
+        return Object.fromEntries(columns.map((column) => [column, record[column]]));
+    }
+    return Object.fromEntries(columns.map((column) => [column, undefined]));
+}
+function stableFingerprint(value) {
+    const text = stableStringify(value);
+    return createHash('sha256').update(text).digest('hex');
+}
+function stableStringify(value) {
+    if (value === null || typeof value !== 'object')
+        return JSON.stringify(value);
+    if (Array.isArray(value))
+        return `[${value.map(stableStringify).join(',')}]`;
+    const record = value;
+    return `{${Object.keys(record).sort().map((key) => `${JSON.stringify(key)}:${stableStringify(record[key])}`).join(',')}}`;
+}
+//# sourceMappingURL=analytical-orchestration.js.map