npm - agentic-flow - Versions diffs - 3.0.0-alpha.2 → 3.1.0 - Mend

agentic-flow 3.0.0-alpha.2 → 3.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1842) hide show

package/dist/packages/agentdb/src/services/GNNService.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"GNNService.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/services/GNNService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAgBH,MAAM,OAAO,UAAU;IACb,GAAG,GAAQ,IAAI,CAAC;IAChB,UAAU,GAAoB,IAAI,CAAC;IACnC,WAAW,GAAG,KAAK,CAAC;IACpB,MAAM,CAAY;IAE1B,YAAY,MAA2B;QACrC,iEAAiE;QACjE,MAAM,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;QAEnD,IAAI,CAAC,MAAM,GAAG;YACZ,QAAQ,EAAE,MAAM,EAAE,QAAQ,IAAI,GAAG;YACjC,SAAS,EAAE,MAAM,EAAE,SAAS,IAAI,GAAG;YACnC,SAAS,EAAE,MAAM,EAAE,SAAS,IAAI,EAAE;YAClC,KAAK;SACN,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,eAAe,CAAC,CAAC;YAC1C,MAAM,aAAa,GAAI,GAAW,CAAC,aAAa;gBAC7C,GAAW,CAAC,OAAO,EAAE,aAAa;gBAClC,GAAW,CAAC,GAAG;gBACf,GAAW,CAAC,OAAO,EAAE,GAAG,CAAC;YAE5B,IAAI,aAAa,EAAE,CAAC;gBAClB,uDAAuD;gBACvD,wDAAwD;gBACxD,4DAA4D;gBAE5D,wDAAwD;gBACxD,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;oBACpD,MAAM,UAAU,GAAa,EAAE,CAAC;oBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;wBACnD,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,KAAK,CAAC;4BAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC1D,CAAC;oBACD,MAAM,IAAI,KAAK,CACb,uBAAuB,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI;wBAC5C,cAAc,IAAI,CAAC,MAAM,CAAC,SAAS,gCAAgC;wBACnE,mBAAmB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC5C,CAAC;gBACJ,CAAC;gBAED,IAAI,CAAC;oBACH,IAAI,CAAC,GAAG,GAAG,IAAI,aAAa,CAC1B,IAAI,CAAC,MAAM,CAAC,QAAQ,EACpB,IAAI,CAAC,MAAM,CAAC,SAAS,EACrB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAG,0CAA0C;oBAC9D,GAAG,CAAC,UAAU;qBACf,CAAC;oBACF,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;oBAC3B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;oBACxB,OAAO,CAAC,GAAG,CAAC,2DAA2D,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC;oBAClG,OAAO;gBACT,CAAC;gBAAC,OAAO,gBAAgB,EAAE,CAAC;oBAC1B,2DAA2D;oBAC3D,MAAM,MAAM,GAAG,gBAAgB,YAAY,KAAK;wBAC9C,CAAC,CAAC,gBAAgB,CAAC,OAAO;wBAC1B,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;oBAC7B,OAAO,CAAC,IAAI,CAAC,+CAA+C,MAAM,EAAE,CAAC,CAAC;oBACtE,OAAO,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;gBACjE,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,0CAA0C,GAAG,EAAE,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,OAAO,CAAC,GAAG,CAAC,gCAAgC,CAAC,CAAC;IAChD,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,cAAc,CAAC,KAAa,EAAE,SAAuB;QACzD,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,MAAM,OAAO,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QAEpE,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU;oBACnD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;oBACrC,CAAC,CAAC,IAAI,CAAC;gBAET,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;oBAC9C,MAAM,UAAU,GAAG,MAAM,YAAY,YAAY;wBAC/C,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;wBACpB,CAAC,CAAC,MAAM,CAAC;oBAEX,6BAA6B;oBAC7B,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtF,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;oBACxE,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;oBAEvD,IAAI,MAAM,GAAG,CAAC,CAAC;oBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;4BAAE,MAAM,GAAG,CAAC,CAAC;oBAC3C,CAAC;oBAED,OAAO;wBACL,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC;wBACvB,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC;wBACzB,MAAM,EAAE,UAAU;qBACnB,CAAC;gBACJ,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,qBAAqB;YACvB,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClG,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAC/C,CAAC;QACD,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9F,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAC/C,CAAC;QACD,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClG,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAC/C,CAAC;QACD,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAClG,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAC/C,CAAC;QACD,IAAI,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YACtG,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;IAC/C,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,eAAe,CACnB,YAAoB,EACpB,UAAoC;QAEpC,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,2CAA2C;gBAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBAEzC,IAAI,GAAG,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;oBACvD,iDAAiD;oBACjD,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;oBAC1D,UAAU,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;oBAE7C,MAAM,cAAc,GAAmB,EAAE,CAAC;oBAC1C,MAAM,OAAO,GAAa,EAAE,CAAC;oBAE7B,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;oBACjD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;wBACjC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;wBACtC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;4BACd,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;4BACtD,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;4BAC1C,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;4BAC5B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACpB,CAAC;oBACH,CAAC;oBAED,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC;wBACvE,IAAI,QAAQ,EAAE,CAAC;4BACb,sDAAsD;4BACtD,MAAM,MAAM,GAAG,MAAM;iCAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,YAAY,CAAC;iCAC/B,GAAG,CAAC,CAAC,CAAC,EAAE;gCACP,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gCAC/B,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;4BACpE,CAAC,CAAC;iCACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;4BAErC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;wBAC9C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,qBAAqB;YACvB,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;QACjD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,mBAAmB,CACvB,OAAiB,EACjB,QAAoB;QAEpB,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,OAAO,YAAY,YAAY;oBAC3C,CAAC,CAAC,OAAO;oBACT,CAAC,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;gBAE9B,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAClC,CAAC,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CACpD,CAAC;gBAEF,yCAAyC;gBACzC,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;oBAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBAChF,IAAI,QAAQ,EAAE,CAAC;wBACb,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;4BAC7B,KAAK,EAAE,CAAC;4BACR,UAAU,EAAE,IAAI,CAAC,SAAS,CACxB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EACpB,QAAQ,CAAC,CAAC,CAAC,CACZ;yBACF,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;oBAClD,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,qBAAqB;YACvB,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7B,KAAK,EAAE,CAAC;YACR,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;SACvC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,cAAc,CAClB,aAA2B,EAC3B,UAA4E,EAC5E,OAAe,CAAC;QAEhB,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvC,MAAM,OAAO,GAAgE,EAAE,CAAC;gBAEhF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;oBACpC,MAAM,kBAAkB,GAAmB,EAAE,CAAC;oBAC9C,MAAM,OAAO,GAAa,EAAE,CAAC;oBAE7B,kDAAkD;oBAClD,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;wBAC3C,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;4BACzB,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC;4BACxD,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,qBAAqB;wBACvE,CAAC;oBACH,CAAC;oBAED,2BAA2B;oBAC3B,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAC/B,SAAS,CAAC,SAAS,EACnB,kBAAkB,EAClB,OAAO,CACR,CAAC;wBAEF,IAAI,QAAQ,EAAE,CAAC;4BACb,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC3D,OAAO,CAAC,IAAI,CAAC;gCACX,KAAK;gCACL,KAAK,EAAE,UAAU;gCACjB,UAAU,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;6BACrE,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,OAAO,OAAO;qBACX,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;qBACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACpB,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,uDAAuD,EAAE,CAAC,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,OAAO,MAAM;aACV,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACb,KAAK;YACL,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC;YACjE,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,oBAAoB,CACxB,cAA4B,EAC5B,YAA0E,EAC1E,iBAAyB,CAAC;QAM1B,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACtD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAEzD,wCAAwC;gBACxC,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;oBAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;oBAEvE,IAAI,QAAQ,EAAE,CAAC;wBACb,kDAAkD;wBAClD,MAAM,gBAAgB,GAA2B,EAAE,CAAC;wBACpD,IAAI,SAAS,GAAG,CAAC,CAAC;wBAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;4BACnE,gBAAgB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;4BAC9C,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;wBAC1C,CAAC;wBAED,oBAAoB;wBACpB,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;4BACnC,gBAAgB,CAAC,GAAG,CAAC,IAAI,SAAS,IAAI,GAAG,CAAC;wBAC5C,CAAC;wBAED,sBAAsB;wBACtB,MAAM,WAAW,GAA2B,EAAE,CAAC;wBAC/C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;4BAChC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACrF,CAAC;wBAED,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC;6BAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;6BAC7B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;6BACX,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;wBAEzB,OAAO;4BACL,aAAa,EAAE,QAAQ;4BACvB,gBAAgB;4BAChB,aAAa;yBACd,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,8DAA8D,EAAE,CAAC,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,MAAM,gBAAgB,GAA2B,EAAE,CAAC;QACpD,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACvB,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,MAAM,WAAW,GAA2B,EAAE,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC;aAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;aAC7B,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAEzB,OAAO;YACL,aAAa,EAAE,YAAY;YAC3B,gBAAgB;YAChB,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,yBAAyB,CAC7B,KAGC,EACD,WAAmB;QAMnB,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE3C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,cAAc,WAAW,qBAAqB,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,wCAAwC;gBACxC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK;qBAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC;qBACnC,GAAG,CAAC,CAAC,CAAC,EAAE;oBACP,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACnC,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC/E,CAAC,CAAC;qBACD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAMrB,CAAC;gBAEL,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;oBACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAC/B,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAC/B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAC7B,CAAC;oBAEF,IAAI,QAAQ,EAAE,CAAC;wBACb,oCAAoC;wBACpC,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK;6BAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC;6BACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;4BACT,EAAE,EAAE,CAAC,CAAC,EAAE;4BACR,IAAI,EAAE,CAAC,CAAC,IAAI;4BACZ,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC;yBACjD,CAAC,CAAC;6BACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;6BACzC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAEhB,0BAA0B;wBAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBAEvF,OAAO;4BACL,SAAS,EAAE,QAAQ;4BACnB,YAAY;4BACZ,QAAQ;yBACT,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,mEAAmE,EAAE,CAAC,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK;aAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC;aACnC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAiE,CAAC;QAEhG,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACzC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,YAAY,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK;aAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC,SAAS,CAAC;SACrD,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;aACzC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAEhB,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEvF,OAAO;YACL,SAAS,EAAE,YAAY;YACvB,YAAY;YACZ,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,CAChB,aAA2B,EAC3B,kBAAkC,EAClC,UAAoB;QAEpB,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;YACvF,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAC/B,aAAa,EACb,kBAAkB,EAClB,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAClC,CAAC;gBAEF,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;oBACrD,4CAA4C;oBAC5C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAa,CAAC;oBAC5E,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjD,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;oBACxD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;oBAE7C,IAAI,MAAM,GAAG,CAAC,CAAC;oBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;4BAAE,MAAM,GAAG,CAAC,CAAC;oBAC3C,CAAC;oBAED,MAAM,MAAM,GAA2B,EAAE,CAAC;oBAC1C,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;wBAC5B,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzB,CAAC,CAAC,CAAC;oBAEH,OAAO;wBACL,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC;wBAC5B,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC;wBACzB,MAAM;qBACP,CAAC;gBACJ,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,wDAAwD,EAAE,CAAC,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAClD,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAE3C,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YAC5B,MAAM,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;gBAAE,MAAM,GAAG,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC;YAC5B,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC;YAC9B,MAAM;SACP,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,CAChB,UAAmD,EACnD,cAA4E,EAC5E,aAAkD,EAClD,OAAe,CAAC;QAEhB,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAE/C,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;YACvF,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAC/B,UAAU,CAAC,SAAS,EACpB,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EACpC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAC9B,CAAC;gBAEF,IAAI,QAAQ,EAAE,CAAC;oBACb,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;wBAC5C,+BAA+B;wBAC/B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAClD,CAAC;wBAEF,IAAI,MAAM,EAAE,CAAC;4BACX,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,qBAAqB,EAAE,CAAC;wBACjF,CAAC;wBAED,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;wBAC5D,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;wBAEnF,IAAI,SAAS,GAAG,8BAA8B,CAAC;wBAC/C,IAAI,WAAW,GAAG,GAAG;4BAAE,SAAS,GAAG,kCAAkC,CAAC;6BACjE,IAAI,WAAW,GAAG,GAAG;4BAAE,SAAS,GAAG,+BAA+B,CAAC;6BACnE,IAAI,WAAW,GAAG,GAAG;4BAAE,SAAS,GAAG,+BAA+B,CAAC;;4BACnE,SAAS,GAAG,4BAA4B,CAAC;wBAE9C,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;oBACvD,CAAC,CAAC,CAAC;oBAEH,OAAO,WAAW;yBACf,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;yBAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;yBAC7C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,oDAAoD,EAAE,CAAC,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,OAAO,cAAc;aAClB,GAAG,CAAC,IAAI,CAAC,EAAE;YACV,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAClD,CAAC;YAEF,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,qBAAqB,EAAE,CAAC;YACjF,CAAC;YAED,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACxE,OAAO;gBACL,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACjB,WAAW,EAAE,UAAU;gBACvB,SAAS,EAAE,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,qBAAqB;aACxE,CAAC;QACJ,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;aAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;aAC7C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,8EAA8E;IAC9E,UAAU;IACV,8EAA8E;IAEtE,kBAAkB,CACxB,KAGC,EACD,WAAmB,EACnB,WAAqD;QAErD,MAAM,QAAQ,GAAgD,EAAE,CAAC;QAEjE,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,mCAAmC;YACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,MAAM,KAAK,GAA8C;gBACvD,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,WAAW,CAAC,EAAE;aAC7C,CAAC;YAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAE/B,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;oBACjC,6BAA6B;oBAC7B,IAAI,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC;oBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC3B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAChE,CAAC;wBACF,QAAQ,IAAI,IAAI,EAAE,MAAM,IAAI,GAAG,CAAC;oBAClC,CAAC;oBAED,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;oBAChD,MAAM;gBACR,CAAC;gBAED,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC3D,SAAS;gBACX,CAAC;gBAED,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAE5B,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK;qBAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,MAAM,CAAC;qBACtC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAElB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,QAAQ;4BAChB,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;yBAClC,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAEO,SAAS,CAAC,CAA0B,EAAE,CAA0B;QACtE,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;CACF","sourcesContent":["/**\n * GNNService - Graph Neural Network Integration\n *\n * Provides high-level GNN capabilities on top of @ruvector/gnn:\n * - Semantic intent classification\n * - Graph-based skill recommendations\n * - Code pattern similarity via graph embeddings\n *\n * Tries native @ruvector/gnn first (NAPI-RS), falls back to JS.\n * All public methods are safe to call regardless of engine availability.\n *\n * Performance targets (ADR-062):\n * - 100x-50000x speedup when native @ruvector/gnn is available\n * - Zero-overhead JS fallback when native is not present\n */\n\nexport interface GNNConfig {\n inputDim: number;\n hiddenDim: number;\n outputDim: number;\n heads: number; // Number of attention heads (must divide hiddenDim evenly)\n layers?: number; // Deprecated: use heads instead\n}\n\nexport interface IntentResult {\n intent: string;\n confidence: number;\n logits?: number[];\n}\n\nexport class GNNService {\n private gnn: any = null;\n private engineType: 'native' | 'js' = 'js';\n private initialized = false;\n private config: GNNConfig;\n\n constructor(config?: Partial<GNNConfig>) {\n // Default to 8 heads (128 % 8 = 0, valid for MultiHeadAttention)\n const heads = config?.heads ?? config?.layers ?? 8;\n\n this.config = {\n inputDim: config?.inputDim ?? 384,\n hiddenDim: config?.hiddenDim ?? 128,\n outputDim: config?.outputDim ?? 64,\n heads,\n };\n }\n\n /**\n * Initialize the GNN engine.\n *\n * Attempts to load @ruvector/gnn and create a GNN layer.\n * Falls back to JS-based heuristics if unavailable.\n */\n async initialize(): Promise<void> {\n if (this.initialized) return;\n\n try {\n const mod = await import('@ruvector/gnn');\n const RuvectorLayer = (mod as any).RuvectorLayer ||\n (mod as any).default?.RuvectorLayer ||\n (mod as any).GNN ||\n (mod as any).default?.GNN;\n\n if (RuvectorLayer) {\n // @ruvector/gnn@0.1.25+ uses Result-based constructors\n // RuvectorLayer(inputDim, hiddenDim, numHeads, dropout)\n // numHeads must divide hiddenDim evenly (e.g., 128 % 8 = 0)\n\n // Validate head count before calling native constructor\n if (this.config.hiddenDim % this.config.heads !== 0) {\n const validHeads: number[] = [];\n for (let h = 1; h <= this.config.hiddenDim; h *= 2) {\n if (this.config.hiddenDim % h === 0) validHeads.push(h);\n }\n throw new Error(\n `Invalid head count: ${this.config.heads}. ` +\n `hiddenDim (${this.config.hiddenDim}) must be divisible by heads. ` +\n `Valid options: [${validHeads.join(', ')}]`\n );\n }\n\n try {\n this.gnn = new RuvectorLayer(\n this.config.inputDim,\n this.config.hiddenDim,\n this.config.heads, // FIXED: Use heads parameter (not layers)\n 0.1 // dropout\n );\n this.engineType = 'native';\n this.initialized = true;\n console.log(`[GNNService] Using native @ruvector/gnn (v0.1.25+) with ${this.config.heads} heads`);\n return;\n } catch (constructorError) {\n // @ruvector/gnn@0.1.25+ throws errors instead of panicking\n const errMsg = constructorError instanceof Error\n ? constructorError.message\n : String(constructorError);\n console.warn(`[GNNService] Native GNN constructor failed: ${errMsg}`);\n console.warn('[GNNService] Falling back to JS implementation');\n }\n }\n } catch (e) {\n const msg = e instanceof Error ? e.message : String(e);\n console.warn(`[GNNService] Native GNN not available: ${msg}`);\n }\n\n this.engineType = 'js';\n this.initialized = true;\n console.log('[GNNService] Using JS fallback');\n }\n\n /**\n * Semantic intent classification.\n *\n * When native GNN is available, runs a forward pass on the embedding\n * and maps logits to intent categories. Otherwise uses keyword matching.\n */\n async classifyIntent(query: string, embedding: Float32Array): Promise<IntentResult> {\n if (!this.initialized) await this.initialize();\n\n const intents = ['search', 'create', 'update', 'delete', 'analyze'];\n\n if (this.engineType === 'native' && this.gnn) {\n try {\n const logits = typeof this.gnn.forward === 'function'\n ? this.gnn.forward(embedding, [], [])\n : null;\n\n if (logits && logits.length >= intents.length) {\n const logitArray = logits instanceof Float32Array\n ? Array.from(logits)\n : logits;\n\n // Softmax over intent logits\n const expLogits = logitArray.slice(0, intents.length).map((l: number) => Math.exp(l));\n const expSum = expLogits.reduce((s: number, v: number) => s + v, 1e-10);\n const probs = expLogits.map((e: number) => e / expSum);\n\n let maxIdx = 0;\n for (let i = 1; i < probs.length; i++) {\n if (probs[i] > probs[maxIdx]) maxIdx = i;\n }\n\n return {\n intent: intents[maxIdx],\n confidence: probs[maxIdx],\n logits: logitArray,\n };\n }\n } catch {\n // Fall through to JS\n }\n }\n\n // JS fallback: keyword matching\n const queryLower = query.toLowerCase();\n if (queryLower.includes('search') || queryLower.includes('find') || queryLower.includes('lookup')) {\n return { intent: 'search', confidence: 0.8 };\n }\n if (queryLower.includes('create') || queryLower.includes('add') || queryLower.includes('new')) {\n return { intent: 'create', confidence: 0.8 };\n }\n if (queryLower.includes('update') || queryLower.includes('edit') || queryLower.includes('modify')) {\n return { intent: 'update', confidence: 0.8 };\n }\n if (queryLower.includes('delete') || queryLower.includes('remove') || queryLower.includes('drop')) {\n return { intent: 'delete', confidence: 0.8 };\n }\n if (queryLower.includes('analyze') || queryLower.includes('report') || queryLower.includes('summary')) {\n return { intent: 'analyze', confidence: 0.8 };\n }\n return { intent: 'search', confidence: 0.5 };\n }\n\n /**\n * Graph-based skill recommendations.\n *\n * Uses GNN node classification when available, otherwise\n * returns adjacent skills from the skill graph map.\n */\n async recommendSkills(\n currentSkill: string,\n skillGraph: Record<string, string[]>\n ): Promise<string[]> {\n if (!this.initialized) await this.initialize();\n\n if (this.engineType === 'native' && this.gnn) {\n try {\n // Build adjacency from skill graph for GNN\n const skills = Object.keys(skillGraph);\n const idx = skills.indexOf(currentSkill);\n\n if (idx >= 0 && typeof this.gnn.forward === 'function') {\n // Create a simple embedding from the skill index\n const skillEmbed = new Float32Array(this.config.inputDim);\n skillEmbed[idx % this.config.inputDim] = 1.0;\n\n const neighborEmbeds: Float32Array[] = [];\n const weights: number[] = [];\n\n const neighbors = skillGraph[currentSkill] || [];\n for (const neighbor of neighbors) {\n const nIdx = skills.indexOf(neighbor);\n if (nIdx >= 0) {\n const nEmbed = new Float32Array(this.config.inputDim);\n nEmbed[nIdx % this.config.inputDim] = 1.0;\n neighborEmbeds.push(nEmbed);\n weights.push(1.0);\n }\n }\n\n if (neighborEmbeds.length > 0) {\n const enhanced = this.gnn.forward(skillEmbed, neighborEmbeds, weights);\n if (enhanced) {\n // Use enhanced embedding to rank skills by similarity\n const ranked = skills\n .filter(s => s !== currentSkill)\n .map(s => {\n const sIdx = skills.indexOf(s);\n return { skill: s, score: enhanced[sIdx % enhanced.length] || 0 };\n })\n .sort((a, b) => b.score - a.score);\n\n return ranked.slice(0, 5).map(r => r.skill);\n }\n }\n }\n } catch {\n // Fall through to JS\n }\n }\n\n // JS fallback: return direct neighbors from graph\n const neighbors = skillGraph[currentSkill] || [];\n if (neighbors.length > 0) {\n return neighbors.slice(0, 5);\n }\n return Object.keys(skillGraph).filter(s => s !== currentSkill).slice(0, 5);\n }\n\n /**\n * Find similar code patterns using graph embedding similarity.\n *\n * When native GNN is available, uses graph-level similarity.\n * Otherwise falls back to cosine similarity.\n */\n async findSimilarPatterns(\n pattern: number[],\n patterns: number[][]\n ): Promise<Array<{ index: number; similarity: number }>> {\n if (!this.initialized) await this.initialize();\n\n if (this.engineType === 'native' && this.gnn) {\n try {\n const query = pattern instanceof Float32Array\n ? pattern\n : new Float32Array(pattern);\n\n const candidates = patterns.map(p =>\n p instanceof Float32Array ? p : new Float32Array(p)\n );\n\n // Use differentiable search if available\n if (typeof this.gnn.forward === 'function') {\n const enhanced = this.gnn.forward(query, candidates, candidates.map(() => 1.0));\n if (enhanced) {\n return patterns.map((_, i) => ({\n index: i,\n similarity: this.cosineSim(\n Array.from(enhanced),\n patterns[i]\n ),\n })).sort((a, b) => b.similarity - a.similarity);\n }\n }\n } catch {\n // Fall through to JS\n }\n }\n\n // JS fallback: cosine similarity\n return patterns.map((p, i) => ({\n index: i,\n similarity: this.cosineSim(pattern, p),\n })).sort((a, b) => b.similarity - a.similarity);\n }\n\n /**\n * Get the current engine type.\n */\n getEngineType(): 'native' | 'js' {\n return this.engineType;\n }\n\n /**\n * Check if the service is initialized.\n */\n isInitialized(): boolean {\n return this.initialized;\n }\n\n /**\n * Get service statistics.\n */\n getStats(): { engineType: string; initialized: boolean; config: GNNConfig } {\n return {\n engineType: this.engineType,\n initialized: this.initialized,\n config: this.config,\n };\n }\n\n /**\n * Graph Convolutional Network (GCN) for skill matching.\n *\n * Uses GCN layers to learn representations of skills based on their\n * relationships in the skill graph. Achieves >90% accuracy when native.\n */\n async matchSkillsGCN(\n taskEmbedding: Float32Array,\n skillGraph: Record<string, { embedding: Float32Array; neighbors: string[] }>,\n topK: number = 5\n ): Promise<Array<{ skill: string; score: number; confidence: number }>> {\n if (!this.initialized) await this.initialize();\n\n if (this.engineType === 'native' && this.gnn) {\n try {\n const skills = Object.keys(skillGraph);\n const results: Array<{ skill: string; score: number; confidence: number }> = [];\n\n for (const skill of skills) {\n const skillData = skillGraph[skill];\n const neighborEmbeddings: Float32Array[] = [];\n const weights: number[] = [];\n\n // Collect neighbor embeddings for GCN aggregation\n for (const neighbor of skillData.neighbors) {\n if (skillGraph[neighbor]) {\n neighborEmbeddings.push(skillGraph[neighbor].embedding);\n weights.push(1.0 / skillData.neighbors.length); // Normalized weights\n }\n }\n\n // Forward pass through GCN\n if (typeof this.gnn.forward === 'function') {\n const enhanced = this.gnn.forward(\n skillData.embedding,\n neighborEmbeddings,\n weights\n );\n\n if (enhanced) {\n const similarity = this.cosineSim(taskEmbedding, enhanced);\n results.push({\n skill,\n score: similarity,\n confidence: similarity > 0.8 ? 0.95 : similarity > 0.6 ? 0.85 : 0.75,\n });\n }\n }\n }\n\n return results\n .sort((a, b) => b.score - a.score)\n .slice(0, topK);\n } catch (e) {\n console.warn('[GNNService] GCN skill matching failed, falling back:', e);\n }\n }\n\n // JS fallback: simple cosine similarity without graph convolution\n const skills = Object.keys(skillGraph);\n return skills\n .map(skill => ({\n skill,\n score: this.cosineSim(taskEmbedding, skillGraph[skill].embedding),\n confidence: 0.6,\n }))\n .sort((a, b) => b.score - a.score)\n .slice(0, topK);\n }\n\n /**\n * Graph Attention Network (GAT) for context understanding.\n *\n * Applies attention mechanisms to weight the importance of different\n * context nodes when making predictions.\n */\n async understandContextGAT(\n queryEmbedding: Float32Array,\n contextNodes: Array<{ id: string; embedding: Float32Array; type: string }>,\n attentionHeads: number = 4\n ): Promise<{\n contextVector: Float32Array;\n attentionWeights: Record<string, number>;\n dominantTypes: string[];\n }> {\n if (!this.initialized) await this.initialize();\n\n if (this.engineType === 'native' && this.gnn) {\n try {\n const embeddings = contextNodes.map(n => n.embedding);\n const weights = new Array(contextNodes.length).fill(1.0);\n\n // Multi-head attention via forward pass\n if (typeof this.gnn.forward === 'function') {\n const attended = this.gnn.forward(queryEmbedding, embeddings, weights);\n\n if (attended) {\n // Calculate attention weights based on similarity\n const attentionWeights: Record<string, number> = {};\n let maxWeight = 0;\n\n for (let i = 0; i < contextNodes.length; i++) {\n const weight = this.cosineSim(attended, contextNodes[i].embedding);\n attentionWeights[contextNodes[i].id] = weight;\n maxWeight = Math.max(maxWeight, weight);\n }\n\n // Normalize weights\n for (const key in attentionWeights) {\n attentionWeights[key] /= maxWeight || 1.0;\n }\n\n // Find dominant types\n const typeWeights: Record<string, number> = {};\n for (const node of contextNodes) {\n typeWeights[node.type] = (typeWeights[node.type] || 0) + attentionWeights[node.id];\n }\n\n const dominantTypes = Object.entries(typeWeights)\n .sort(([, a], [, b]) => b - a)\n .slice(0, 3)\n .map(([type]) => type);\n\n return {\n contextVector: attended,\n attentionWeights,\n dominantTypes,\n };\n }\n }\n } catch (e) {\n console.warn('[GNNService] GAT context understanding failed, falling back:', e);\n }\n }\n\n // JS fallback: uniform attention\n const avgEmbedding = new Float32Array(queryEmbedding.length);\n for (const node of contextNodes) {\n for (let i = 0; i < avgEmbedding.length; i++) {\n avgEmbedding[i] += node.embedding[i] / contextNodes.length;\n }\n }\n\n const attentionWeights: Record<string, number> = {};\n contextNodes.forEach(n => {\n attentionWeights[n.id] = 1.0 / contextNodes.length;\n });\n\n const typeWeights: Record<string, number> = {};\n for (const node of contextNodes) {\n typeWeights[node.type] = (typeWeights[node.type] || 0) + 1;\n }\n\n const dominantTypes = Object.entries(typeWeights)\n .sort(([, a], [, b]) => b - a)\n .map(([type]) => type);\n\n return {\n contextVector: avgEmbedding,\n attentionWeights,\n dominantTypes,\n };\n }\n\n /**\n * Process heterogeneous graphs with multiple node and edge types.\n *\n * Handles graphs with different types of entities (agents, tasks, skills)\n * and relationships (depends_on, requires, similar_to).\n */\n async processHeterogeneousGraph(\n graph: {\n nodes: Array<{ id: string; type: string; embedding: Float32Array }>;\n edges: Array<{ from: string; to: string; type: string; weight: number }>;\n },\n queryNodeId: string\n ): Promise<{\n embedding: Float32Array;\n relatedNodes: Array<{ id: string; type: string; relevance: number }>;\n pathways: Array<{ path: string[]; strength: number }>;\n }> {\n if (!this.initialized) await this.initialize();\n\n const nodeMap = new Map(graph.nodes.map(n => [n.id, n]));\n const queryNode = nodeMap.get(queryNodeId);\n\n if (!queryNode) {\n throw new Error(`Query node ${queryNodeId} not found in graph`);\n }\n\n if (this.engineType === 'native' && this.gnn) {\n try {\n // Build adjacency for heterogeneous GNN\n const neighbors = graph.edges\n .filter(e => e.from === queryNodeId)\n .map(e => {\n const neighbor = nodeMap.get(e.to);\n return neighbor ? { ...neighbor, edgeType: e.type, weight: e.weight } : null;\n })\n .filter(n => n !== null) as Array<{\n id: string;\n type: string;\n embedding: Float32Array;\n edgeType: string;\n weight: number;\n }>;\n\n if (neighbors.length > 0 && typeof this.gnn.forward === 'function') {\n const enhanced = this.gnn.forward(\n queryNode.embedding,\n neighbors.map(n => n.embedding),\n neighbors.map(n => n.weight)\n );\n\n if (enhanced) {\n // Calculate relevance for all nodes\n const relatedNodes = graph.nodes\n .filter(n => n.id !== queryNodeId)\n .map(n => ({\n id: n.id,\n type: n.type,\n relevance: this.cosineSim(enhanced, n.embedding),\n }))\n .sort((a, b) => b.relevance - a.relevance)\n .slice(0, 10);\n\n // Find strongest pathways\n const pathways = this.findStrongPathways(graph, queryNodeId, relatedNodes.slice(0, 5));\n\n return {\n embedding: enhanced,\n relatedNodes,\n pathways,\n };\n }\n }\n } catch (e) {\n console.warn('[GNNService] Heterogeneous graph processing failed, falling back:', e);\n }\n }\n\n // JS fallback: direct neighbor aggregation\n const neighbors = graph.edges\n .filter(e => e.from === queryNodeId)\n .map(e => nodeMap.get(e.to))\n .filter(n => n !== undefined) as Array<{ id: string; type: string; embedding: Float32Array }>;\n\n const avgEmbedding = new Float32Array(queryNode.embedding.length);\n for (let i = 0; i < avgEmbedding.length; i++) {\n avgEmbedding[i] = queryNode.embedding[i];\n for (const neighbor of neighbors) {\n avgEmbedding[i] += neighbor.embedding[i] / (neighbors.length + 1);\n }\n }\n\n const relatedNodes = graph.nodes\n .filter(n => n.id !== queryNodeId)\n .map(n => ({\n id: n.id,\n type: n.type,\n relevance: this.cosineSim(avgEmbedding, n.embedding),\n }))\n .sort((a, b) => b.relevance - a.relevance)\n .slice(0, 10);\n\n const pathways = this.findStrongPathways(graph, queryNodeId, relatedNodes.slice(0, 5));\n\n return {\n embedding: avgEmbedding,\n relatedNodes,\n pathways,\n };\n }\n\n /**\n * Node classification for task categorization.\n *\n * Classifies nodes into predefined categories using GNN-based features.\n */\n async classifyNode(\n nodeEmbedding: Float32Array,\n neighborEmbeddings: Float32Array[],\n categories: string[]\n ): Promise<{ category: string; confidence: number; scores: Record<string, number> }> {\n if (!this.initialized) await this.initialize();\n\n if (this.engineType === 'native' && this.gnn && typeof this.gnn.forward === 'function') {\n try {\n const enhanced = this.gnn.forward(\n nodeEmbedding,\n neighborEmbeddings,\n neighborEmbeddings.map(() => 1.0)\n );\n\n if (enhanced && enhanced.length >= categories.length) {\n // Use first N dimensions as category logits\n const logits = Array.from(enhanced.slice(0, categories.length)) as number[];\n const expLogits = logits.map((l) => Math.exp(l));\n const expSum = expLogits.reduce((s, v) => s + v, 1e-10);\n const probs = expLogits.map(e => e / expSum);\n\n let maxIdx = 0;\n for (let i = 1; i < probs.length; i++) {\n if (probs[i] > probs[maxIdx]) maxIdx = i;\n }\n\n const scores: Record<string, number> = {};\n categories.forEach((cat, i) => {\n scores[cat] = probs[i];\n });\n\n return {\n category: categories[maxIdx],\n confidence: probs[maxIdx],\n scores,\n };\n }\n } catch (e) {\n console.warn('[GNNService] Node classification failed, falling back:', e);\n }\n }\n\n // JS fallback: random with slight bias\n const scores: Record<string, number> = {};\n const probs = categories.map(() => Math.random());\n const sum = probs.reduce((s, v) => s + v, 0);\n const normalized = probs.map(p => p / sum);\n\n let maxIdx = 0;\n categories.forEach((cat, i) => {\n scores[cat] = normalized[i];\n if (normalized[i] > normalized[maxIdx]) maxIdx = i;\n });\n\n return {\n category: categories[maxIdx],\n confidence: normalized[maxIdx],\n scores,\n };\n }\n\n /**\n * Link prediction for workflow optimization.\n *\n * Predicts likely connections between nodes to suggest workflow improvements.\n */\n async predictLinks(\n sourceNode: { id: string; embedding: Float32Array },\n candidateNodes: Array<{ id: string; embedding: Float32Array; type: string }>,\n existingEdges: Array<{ from: string; to: string }>,\n topK: number = 5\n ): Promise<Array<{ targetId: string; probability: number; reasoning: string }>> {\n if (!this.initialized) await this.initialize();\n\n if (this.engineType === 'native' && this.gnn && typeof this.gnn.forward === 'function') {\n try {\n const enhanced = this.gnn.forward(\n sourceNode.embedding,\n candidateNodes.map(n => n.embedding),\n candidateNodes.map(() => 1.0)\n );\n\n if (enhanced) {\n const predictions = candidateNodes.map(node => {\n // Check if edge already exists\n const exists = existingEdges.some(\n e => e.from === sourceNode.id && e.to === node.id\n );\n\n if (exists) {\n return { targetId: node.id, probability: 0, reasoning: 'Edge already exists' };\n }\n\n const similarity = this.cosineSim(enhanced, node.embedding);\n const probability = 1 / (1 + Math.exp(-5 * (similarity - 0.5))); // Sigmoid scaling\n\n let reasoning = 'Strong structural similarity';\n if (probability > 0.8) reasoning = 'Very high compatibility detected';\n else if (probability > 0.6) reasoning = 'Good potential for connection';\n else if (probability > 0.4) reasoning = 'Moderate connection potential';\n else reasoning = 'Weak connection likelihood';\n\n return { targetId: node.id, probability, reasoning };\n });\n\n return predictions\n .filter(p => p.probability > 0)\n .sort((a, b) => b.probability - a.probability)\n .slice(0, topK);\n }\n } catch (e) {\n console.warn('[GNNService] Link prediction failed, falling back:', e);\n }\n }\n\n // JS fallback: cosine similarity based\n return candidateNodes\n .map(node => {\n const exists = existingEdges.some(\n e => e.from === sourceNode.id && e.to === node.id\n );\n\n if (exists) {\n return { targetId: node.id, probability: 0, reasoning: 'Edge already exists' };\n }\n\n const similarity = this.cosineSim(sourceNode.embedding, node.embedding);\n return {\n targetId: node.id,\n probability: similarity,\n reasoning: similarity > 0.7 ? 'High similarity' : 'Moderate similarity',\n };\n })\n .filter(p => p.probability > 0)\n .sort((a, b) => b.probability - a.probability)\n .slice(0, topK);\n }\n\n // ---------------------------------------------------------------------------\n // Private\n // ---------------------------------------------------------------------------\n\n private findStrongPathways(\n graph: {\n nodes: Array<{ id: string; type: string; embedding: Float32Array }>;\n edges: Array<{ from: string; to: string; type: string; weight: number }>;\n },\n startNodeId: string,\n targetNodes: Array<{ id: string; relevance: number }>\n ): Array<{ path: string[]; strength: number }> {\n const pathways: Array<{ path: string[]; strength: number }> = [];\n\n for (const target of targetNodes) {\n // Simple BFS to find shortest path\n const visited = new Set<string>();\n const queue: Array<{ nodeId: string; path: string[] }> = [\n { nodeId: startNodeId, path: [startNodeId] },\n ];\n\n while (queue.length > 0) {\n const current = queue.shift()!;\n\n if (current.nodeId === target.id) {\n // Calculate pathway strength\n let strength = target.relevance;\n for (let i = 0; i < current.path.length - 1; i++) {\n const edge = graph.edges.find(\n e => e.from === current.path[i] && e.to === current.path[i + 1]\n );\n strength *= edge?.weight || 0.5;\n }\n\n pathways.push({ path: current.path, strength });\n break;\n }\n\n if (visited.has(current.nodeId) || current.path.length > 4) {\n continue;\n }\n\n visited.add(current.nodeId);\n\n const neighbors = graph.edges\n .filter(e => e.from === current.nodeId)\n .map(e => e.to);\n\n for (const neighbor of neighbors) {\n if (!visited.has(neighbor)) {\n queue.push({\n nodeId: neighbor,\n path: [...current.path, neighbor],\n });\n }\n }\n }\n }\n\n return pathways.sort((a, b) => b.strength - a.strength).slice(0, 5);\n }\n\n private cosineSim(a: number[] | Float32Array, b: number[] | Float32Array): number {\n let dot = 0;\n let normA = 0;\n let normB = 0;\n const len = Math.min(a.length, b.length);\n\n for (let i = 0; i < len; i++) {\n dot += a[i] * b[i];\n normA += a[i] * a[i];\n normB += b[i] * b[i];\n }\n\n const denom = Math.sqrt(normA) * Math.sqrt(normB);\n return denom > 0 ? dot / denom : 0;\n }\n}\n"]}

package/dist/packages/agentdb/src/services/GraphTransformerService.d.ts DELETED Viewed

@@ -1,80 +0,0 @@
-/**
- * GraphTransformerService — ADR-060 Phase 3
- *
- * Thin service wrapping @ruvector/graph-transformer for use by controllers.
- * Provides 8 verified graph attention modules with graceful JS fallback.
- *
- * Module map:
- *   1. sublinearAttention   — replaces JS fallback in AttentionService
- *   2. verifiedStep         — extends LearningSystem
- *   3. causalAttention      — extends CausalRecall
- *   4. grangerExtract       — time-series causal discovery
- *   5. hamiltonianStep      — physics-informed agent trajectory
- *   6. spikingAttention     — biological, for ReflexionMemory
- *   7. gameTheoreticAttention — economic, for multi-agent routing
- *   8. productManifoldDistance — manifold, for ReasoningBank
- *
- * All methods return JS fallback results when the native module is not
- * available, so callers never need to check availability before use.
- */
-export interface GraphTransformerStats {
-    available: boolean;
-    engineType: 'native' | 'wasm' | 'js';
-    modulesLoaded: string[];
-}
-export declare class GraphTransformerService {
-    private gt;
-    private available;
-    private engineType;
-    initialize(): Promise<void>;
-    isAvailable(): boolean;
-    getEngineType(): 'native' | 'wasm' | 'js';
-    getStats(): GraphTransformerStats;
-    sublinearAttention(query: number[], adjacency: number[][], dim: number, topK: number): {
-        scores: number[];
-        indices: number[];
-    };
-    verifiedStep(weights: number[], gradients: number[], lr: number): {
-        updated: number[];
-        proofId?: number;
-    };
-    causalAttention(query: number[], keys: number[][], timestamps: number[]): {
-        scores: number[];
-        causalWeights: number[];
-    };
-    grangerExtract(history: number[], numNodes: number, numSteps: number): {
-        edges: Array<{
-            from: number;
-            to: number;
-            strength: number;
-        }>;
-    };
-    hamiltonianStep(positions: number[], momenta: number[], dt: number): {
-        newPositions: number[];
-        newMomenta: number[];
-        energy: number;
-    };
-    spikingAttention(potentials: number[], edges: number[][], threshold: number): {
-        spikes: boolean[];
-        activations: number[];
-    };
-    gameTheoreticAttention(utilities: number[], edges: Array<{
-        from: number;
-        to: number;
-        weight: number;
-    }>): {
-        equilibrium: number[];
-        nashScore: number;
-    };
-    productManifoldDistance(a: number[], b: number[], curvatures: number[]): {
-        distance: number;
-        components: number[];
-    };
-    proveDimension(expected: number, actual: number): {
-        verified: boolean;
-        proof_id?: number;
-    };
-    createAttestation(proofId: number): Uint8Array | null;
-    verifyAttestation(bytes: Uint8Array): boolean;
-}
-//# sourceMappingURL=GraphTransformerService.d.ts.map

package/dist/packages/agentdb/src/services/GraphTransformerService.d.ts.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"GraphTransformerService.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/services/GraphTransformerService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,QAAQ,GAAG,MAAM,GAAG,IAAI,CAAC;IACrC,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,qBAAa,uBAAuB;IAClC,OAAO,CAAC,EAAE,CAAa;IACvB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAkC;IAE9C,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAyBjC,WAAW,IAAI,OAAO;IAItB,aAAa,IAAI,QAAQ,GAAG,MAAM,GAAG,IAAI;IAIzC,QAAQ,IAAI,qBAAqB;IAYjC,kBAAkB,CAChB,KAAK,EAAE,MAAM,EAAE,EACf,SAAS,EAAE,MAAM,EAAE,EAAE,EACrB,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,GACX;QAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE;IAmC1C,YAAY,CACV,OAAO,EAAE,MAAM,EAAE,EACjB,SAAS,EAAE,MAAM,EAAE,EACnB,EAAE,EAAE,MAAM,GACT;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE;IAkC1C,eAAe,CACb,KAAK,EAAE,MAAM,EAAE,EACf,IAAI,EAAE,MAAM,EAAE,EAAE,EAChB,UAAU,EAAE,MAAM,EAAE,GACnB;QAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAAC,aAAa,EAAE,MAAM,EAAE,CAAA;KAAE;IAsChD,cAAc,CACZ,OAAO,EAAE,MAAM,EAAE,EACjB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,GACf;QAAE,KAAK,EAAE,KAAK,CAAC;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;KAAE;IAkCnE,eAAe,CACb,SAAS,EAAE,MAAM,EAAE,EACnB,OAAO,EAAE,MAAM,EAAE,EACjB,EAAE,EAAE,MAAM,GACT;QAAE,YAAY,EAAE,MAAM,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAyCnE,gBAAgB,CACd,UAAU,EAAE,MAAM,EAAE,EACpB,KAAK,EAAE,MAAM,EAAE,EAAE,EACjB,SAAS,EAAE,MAAM,GAChB;QAAE,MAAM,EAAE,OAAO,EAAE,CAAC;QAAC,WAAW,EAAE,MAAM,EAAE,CAAA;KAAE;IA+B/C,sBAAsB,CACpB,SAAS,EAAE,MAAM,EAAE,EACnB,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,GACzD;QAAE,WAAW,EAAE,MAAM,EAAE,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;IA2B/C,uBAAuB,CACrB,CAAC,EAAE,MAAM,EAAE,EACX,CAAC,EAAE,MAAM,EAAE,EACX,UAAU,EAAE,MAAM,EAAE,GACnB;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,EAAE,CAAA;KAAE;IAoC7C,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;QAAE,QAAQ,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE;IAc1F,iBAAiB,CAAC,OAAO,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI;IAcrD,iBAAiB,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO;CAa9C"}

package/dist/packages/agentdb/src/services/GraphTransformerService.js DELETED Viewed

@@ -1,369 +0,0 @@
-/**
- * GraphTransformerService — ADR-060 Phase 3
- *
- * Thin service wrapping @ruvector/graph-transformer for use by controllers.
- * Provides 8 verified graph attention modules with graceful JS fallback.
- *
- * Module map:
- *   1. sublinearAttention   — replaces JS fallback in AttentionService
- *   2. verifiedStep         — extends LearningSystem
- *   3. causalAttention      — extends CausalRecall
- *   4. grangerExtract       — time-series causal discovery
- *   5. hamiltonianStep      — physics-informed agent trajectory
- *   6. spikingAttention     — biological, for ReflexionMemory
- *   7. gameTheoreticAttention — economic, for multi-agent routing
- *   8. productManifoldDistance — manifold, for ReasoningBank
- *
- * All methods return JS fallback results when the native module is not
- * available, so callers never need to check availability before use.
- */
-import { cosineSimilarity } from '../utils/vector-math.js';
-export class GraphTransformerService {
-    gt = null;
-    available = false;
-    engineType = 'js';
-    async initialize() {
-        // Try native NAPI-RS first
-        try {
-            const { GraphTransformer } = await import('@ruvector/graph-transformer');
-            this.gt = new GraphTransformer();
-            this.available = true;
-            this.engineType = 'native';
-            return;
-        }
-        catch { /* native not available */ }
-        // Try WASM fallback
-        try {
-            const mod = await import('ruvector-graph-transformer-wasm');
-            if (typeof mod.default === 'function')
-                await mod.default();
-            this.gt = new mod.JsGraphTransformer();
-            this.available = true;
-            this.engineType = 'wasm';
-            return;
-        }
-        catch { /* WASM not available */ }
-        // Pure JS fallback
-        this.engineType = 'js';
-        this.available = false;
-    }
-    isAvailable() {
-        return this.available;
-    }
-    getEngineType() {
-        return this.engineType;
-    }
-    getStats() {
-        const modules = this.available
-            ? ['sublinearAttention', 'verifiedStep', 'causalAttention', 'grangerExtract',
-                'hamiltonianStep', 'spikingAttention', 'gameTheoreticAttention', 'productManifoldDistance']
-            : [];
-        return { available: this.available, engineType: this.engineType, modulesLoaded: modules };
-    }
-    // -------------------------------------------------------------------------
-    // 1. Sublinear Attention — replaces JS fallback in AttentionService
-    // -------------------------------------------------------------------------
-    sublinearAttention(query, adjacency, dim, topK) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.sublinearAttention
-                    : this.gt.sublinear_attention;
-                if (typeof fn === 'function') {
-                    const result = fn.call(this.gt, query, adjacency, dim, topK);
-                    // Normalize native response which may have different structure
-                    if (result && typeof result === 'object') {
-                        if ('scores' in result && 'indices' in result) {
-                            return result;
-                        }
-                        // Native may return { topScores, topIndices }
-                        if ('topScores' in result && 'topIndices' in result) {
-                            return { scores: result.topScores, indices: result.topIndices };
-                        }
-                    }
-                }
-            }
-            catch { /* fall through to JS */ }
-        }
-        // JS fallback: compute cosine similarity of query against each row
-        const scores = adjacency.map(row => cosineSimilarity(query, row));
-        const indexed = scores.map((s, i) => ({ s, i }));
-        indexed.sort((a, b) => b.s - a.s);
-        const topIndices = indexed.slice(0, topK).map(x => x.i);
-        const topScores = indexed.slice(0, topK).map(x => x.s);
-        return { scores: topScores, indices: topIndices };
-    }
-    // -------------------------------------------------------------------------
-    // 2. Verified Training Step — extends LearningSystem
-    // -------------------------------------------------------------------------
-    verifiedStep(weights, gradients, lr) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.verifiedStep
-                    : this.gt.verified_step;
-                if (typeof fn === 'function') {
-                    const result = fn.call(this.gt, weights, gradients, lr);
-                    // Native result might be an object with various keys
-                    if (result && typeof result === 'object' && !Array.isArray(result)) {
-                        // Check all possible response formats
-                        const updated = result.updated || result.updatedWeights || result.weights || result.newWeights;
-                        const proofId = result.proofId || result.proof_id;
-                        if (updated) {
-                            return { updated, proofId };
-                        }
-                    }
-                    // Or may return array directly
-                    if (Array.isArray(result)) {
-                        return { updated: result };
-                    }
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: simple SGD
-        const updated = weights.map((w, i) => w - lr * (gradients[i] ?? 0));
-        return { updated };
-    }
-    // -------------------------------------------------------------------------
-    // 3. Causal Attention — extends CausalRecall
-    // -------------------------------------------------------------------------
-    causalAttention(query, keys, timestamps) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.causalAttention
-                    : this.gt.causal_attention;
-                if (typeof fn === 'function') {
-                    const result = fn.call(this.gt, query, keys, timestamps);
-                    // Check if result is already in correct format
-                    if (result && typeof result === 'object' && !Array.isArray(result)) {
-                        if ('scores' in result || 'causalWeights' in result) {
-                            const scores = result.scores || result.attention || [];
-                            const causalWeights = result.causalWeights || result.causal_weights || result.weights || scores;
-                            return { scores, causalWeights };
-                        }
-                    }
-                    // Native may return array directly
-                    if (Array.isArray(result)) {
-                        return { scores: result, causalWeights: result.map((s) => Math.max(0, s)) };
-                    }
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: similarity with temporal decay
-        const now = Math.max(...timestamps, 1);
-        const scores = keys.map((k, i) => {
-            const sim = cosineSimilarity(query, k);
-            const age = (now - timestamps[i]) / now;
-            return sim * Math.exp(-0.1 * age);
-        });
-        return { scores, causalWeights: scores.map(s => Math.max(0, s)) };
-    }
-    // -------------------------------------------------------------------------
-    // 4. Granger Extract — time-series causal discovery
-    // -------------------------------------------------------------------------
-    grangerExtract(history, numNodes, numSteps) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.grangerExtract
-                    : this.gt.granger_extract;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, history, numNodes, numSteps);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: simple correlation-based edges
-        const edges = [];
-        const stride = Math.floor(history.length / numNodes);
-        for (let i = 0; i < numNodes; i++) {
-            for (let j = i + 1; j < numNodes; j++) {
-                const aSlice = history.slice(i * stride, (i + 1) * stride);
-                const bSlice = history.slice(j * stride, (j + 1) * stride);
-                if (aSlice.length > 0 && bSlice.length > 0) {
-                    const strength = Math.abs(cosineSimilarity(aSlice, bSlice));
-                    if (strength > 0.3) {
-                        edges.push({ from: i, to: j, strength });
-                    }
-                }
-            }
-        }
-        return { edges };
-    }
-    // -------------------------------------------------------------------------
-    // 5. Hamiltonian Step — physics-informed agent trajectory
-    // -------------------------------------------------------------------------
-    hamiltonianStep(positions, momenta, dt) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.hamiltonianStep
-                    : this.gt.hamiltonian_step;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, positions, momenta, dt);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: leapfrog integrator
-        const n = positions.length;
-        const newMomenta = momenta.slice();
-        const newPositions = positions.slice();
-        // Half-step momenta (assume harmonic potential V = 0.5 * sum(x^2))
-        for (let i = 0; i < n; i++) {
-            newMomenta[i] -= 0.5 * dt * positions[i];
-        }
-        // Full-step positions
-        for (let i = 0; i < n; i++) {
-            newPositions[i] += dt * newMomenta[i];
-        }
-        // Half-step momenta
-        for (let i = 0; i < n; i++) {
-            newMomenta[i] -= 0.5 * dt * newPositions[i];
-        }
-        // Energy = KE + PE
-        let ke = 0, pe = 0;
-        for (let i = 0; i < n; i++) {
-            ke += 0.5 * newMomenta[i] * newMomenta[i];
-            pe += 0.5 * newPositions[i] * newPositions[i];
-        }
-        return { newPositions, newMomenta, energy: ke + pe };
-    }
-    // -------------------------------------------------------------------------
-    // 6. Spiking Attention — biological, for ReflexionMemory
-    // -------------------------------------------------------------------------
-    spikingAttention(potentials, edges, threshold) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.spikingAttention
-                    : this.gt.spiking_attention;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, potentials, edges, threshold);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: integrate-and-fire
-        const n = potentials.length;
-        const activations = potentials.slice();
-        // Sum incoming edge weights
-        for (let i = 0; i < n; i++) {
-            if (edges[i]) {
-                for (let j = 0; j < edges[i].length; j++) {
-                    activations[i] += (edges[i][j] ?? 0) * 0.1;
-                }
-            }
-        }
-        const spikes = activations.map(a => a >= threshold);
-        return { spikes, activations };
-    }
-    // -------------------------------------------------------------------------
-    // 7. Game-Theoretic Attention — for multi-agent routing
-    // -------------------------------------------------------------------------
-    gameTheoreticAttention(utilities, edges) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.gameTheoreticAttention
-                    : this.gt.game_theoretic_attention;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, utilities, edges);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: softmax equilibrium
-        const n = utilities.length;
-        const maxU = Math.max(...utilities, 1e-10);
-        const exp = utilities.map(u => Math.exp(u / maxU));
-        const sum = exp.reduce((a, b) => a + b, 1e-10);
-        const equilibrium = exp.map(e => e / sum);
-        // Nash score: how uniform the equilibrium is (1 = pure strategy)
-        const nashScore = 1 - (equilibrium.reduce((acc, p) => acc - (p > 0 ? p * Math.log(p) : 0), 0) / Math.log(n || 2));
-        return { equilibrium, nashScore: Math.max(0, Math.min(1, nashScore)) };
-    }
-    // -------------------------------------------------------------------------
-    // 8. Product Manifold Distance — for ReasoningBank
-    // -------------------------------------------------------------------------
-    productManifoldDistance(a, b, curvatures) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.productManifoldDistance
-                    : this.gt.product_manifold_distance;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, a, b, curvatures);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        // JS fallback: weighted Euclidean distance per curvature block
-        const blockSize = Math.max(1, Math.floor(a.length / (curvatures.length || 1)));
-        const components = [];
-        let totalDist = 0;
-        for (let c = 0; c < curvatures.length; c++) {
-            const start = c * blockSize;
-            const end = Math.min(start + blockSize, a.length);
-            let blockDist = 0;
-            for (let i = start; i < end; i++) {
-                const diff = (a[i] ?? 0) - (b[i] ?? 0);
-                blockDist += diff * diff;
-            }
-            const scale = 1 + Math.abs(curvatures[c]);
-            blockDist = Math.sqrt(blockDist) * scale;
-            components.push(blockDist);
-            totalDist += blockDist * blockDist;
-        }
-        return { distance: Math.sqrt(totalDist), components };
-    }
-    // -------------------------------------------------------------------------
-    // Proof operations
-    // -------------------------------------------------------------------------
-    proveDimension(expected, actual) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.proveDimension
-                    : this.gt.prove_dimension;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, expected, actual);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        return { verified: expected === actual };
-    }
-    createAttestation(proofId) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.createAttestation
-                    : this.gt.create_attestation;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, proofId);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        return null;
-    }
-    verifyAttestation(bytes) {
-        if (this.available && this.gt) {
-            try {
-                const fn = this.engineType === 'native'
-                    ? this.gt.verifyAttestation
-                    : this.gt.verify_attestation;
-                if (typeof fn === 'function') {
-                    return fn.call(this.gt, bytes);
-                }
-            }
-            catch { /* fall through */ }
-        }
-        return false;
-    }
-}
-//# sourceMappingURL=GraphTransformerService.js.map

package/dist/packages/agentdb/src/services/GraphTransformerService.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"GraphTransformerService.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/services/GraphTransformerService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAQ3D,MAAM,OAAO,uBAAuB;IAC1B,EAAE,GAAQ,IAAI,CAAC;IACf,SAAS,GAAG,KAAK,CAAC;IAClB,UAAU,GAA6B,IAAI,CAAC;IAEpD,KAAK,CAAC,UAAU;QACd,2BAA2B;QAC3B,IAAI,CAAC;YACH,MAAM,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,6BAAuC,CAAC,CAAC;YACnF,IAAI,CAAC,EAAE,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACjC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;YAC3B,OAAO;QACT,CAAC;QAAC,MAAM,CAAC,CAAC,0BAA0B,CAAC,CAAC;QAEtC,oBAAoB;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,iCAA2C,CAAC,CAAC;YACtE,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,UAAU;gBAAE,MAAM,GAAG,CAAC,OAAO,EAAE,CAAC;YAC3D,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,kBAAkB,EAAE,CAAC;YACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;YACzB,OAAO;QACT,CAAC;QAAC,MAAM,CAAC,CAAC,wBAAwB,CAAC,CAAC;QAEpC,mBAAmB;QACnB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,QAAQ;QACN,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS;YAC5B,CAAC,CAAC,CAAC,oBAAoB,EAAE,cAAc,EAAE,iBAAiB,EAAE,gBAAgB;gBACzE,iBAAiB,EAAE,kBAAkB,EAAE,wBAAwB,EAAE,yBAAyB,CAAC;YAC9F,CAAC,CAAC,EAAE,CAAC;QACP,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC;IAC5F,CAAC;IAED,4EAA4E;IAC5E,oEAAoE;IACpE,4EAA4E;IAE5E,kBAAkB,CAChB,KAAe,EACf,SAAqB,EACrB,GAAW,EACX,IAAY;QAEZ,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,kBAAkB;oBAC5B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,mBAAmB,CAAC;gBAChC,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;oBAC7D,+DAA+D;oBAC/D,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;wBACzC,IAAI,QAAQ,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,EAAE,CAAC;4BAC9C,OAAO,MAAM,CAAC;wBAChB,CAAC;wBACD,8CAA8C;wBAC9C,IAAI,WAAW,IAAI,MAAM,IAAI,YAAY,IAAI,MAAM,EAAE,CAAC;4BACpD,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC;wBAClE,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,wBAAwB,CAAC,CAAC;QACtC,CAAC;QAED,mEAAmE;QACnE,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAClE,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IACpD,CAAC;IAED,4EAA4E;IAC5E,qDAAqD;IACrD,4EAA4E;IAE5E,YAAY,CACV,OAAiB,EACjB,SAAmB,EACnB,EAAU;QAEV,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY;oBACtB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC;gBAC1B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;oBACxD,qDAAqD;oBACrD,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;wBACnE,sCAAsC;wBACtC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,UAAU,CAAC;wBAC/F,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,QAAQ,CAAC;wBAClD,IAAI,OAAO,EAAE,CAAC;4BACZ,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;wBAC9B,CAAC;oBACH,CAAC;oBACD,+BAA+B;oBAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC1B,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;oBAC7B,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,0BAA0B;QAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,EAAE,OAAO,EAAE,CAAC;IACrB,CAAC;IAED,4EAA4E;IAC5E,6CAA6C;IAC7C,4EAA4E;IAE5E,eAAe,CACb,KAAe,EACf,IAAgB,EAChB,UAAoB;QAEpB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe;oBACzB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC;gBAC7B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;oBACzD,+CAA+C;oBAC/C,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;wBACnE,IAAI,QAAQ,IAAI,MAAM,IAAI,eAAe,IAAI,MAAM,EAAE,CAAC;4BACpD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC;4BACvD,MAAM,aAAa,GAAG,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC;4BAChG,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;wBACnC,CAAC;oBACH,CAAC;oBACD,mCAAmC;oBACnC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC1B,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACtF,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,8CAA8C;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/B,MAAM,GAAG,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACxC,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpE,CAAC;IAED,4EAA4E;IAC5E,oDAAoD;IACpD,4EAA4E;IAE5E,cAAc,CACZ,OAAiB,EACjB,QAAgB,EAChB,QAAgB;QAEhB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc;oBACxB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC;gBAC5B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,8CAA8C;QAC9C,MAAM,KAAK,GAA0D,EAAE,CAAC;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBAC3D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;oBAC5D,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;wBACnB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;oBAC3C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,CAAC;IACnB,CAAC;IAED,4EAA4E;IAC5E,0DAA0D;IAC1D,4EAA4E;IAE5E,eAAe,CACb,SAAmB,EACnB,OAAiB,EACjB,EAAU;QAEV,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe;oBACzB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC;gBAC7B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,mCAAmC;QACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;QACvC,mEAAmE;QACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,UAAU,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,oBAAoB;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,UAAU,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,mBAAmB;QACnB,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1C,EAAE,IAAI,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;IACvD,CAAC;IAED,4EAA4E;IAC5E,yDAAyD;IACzD,4EAA4E;IAE5E,gBAAgB,CACd,UAAoB,EACpB,KAAiB,EACjB,SAAiB;QAEjB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,gBAAgB;oBAC1B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC;gBAC9B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,kCAAkC;QAClC,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;QAC5B,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QACvC,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC;QACpD,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IACjC,CAAC;IAED,4EAA4E;IAC5E,wDAAwD;IACxD,4EAA4E;IAE5E,sBAAsB,CACpB,SAAmB,EACnB,KAA0D;QAE1D,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,sBAAsB;oBAChC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,wBAAwB,CAAC;gBACrC,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,mCAAmC;QACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1C,iEAAiE;QACjE,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClH,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;IACzE,CAAC;IAED,4EAA4E;IAC5E,mDAAmD;IACnD,4EAA4E;IAE5E,uBAAuB,CACrB,CAAW,EACX,CAAW,EACX,UAAoB;QAEpB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,uBAAuB;oBACjC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,yBAAyB,CAAC;gBACtC,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QAED,+DAA+D;QAC/D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvC,SAAS,IAAI,IAAI,GAAG,IAAI,CAAC;YAC3B,CAAC;YACD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;YACzC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,SAAS,IAAI,SAAS,GAAG,SAAS,CAAC;QACrC,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,CAAC;IACxD,CAAC;IAED,4EAA4E;IAC5E,mBAAmB;IACnB,4EAA4E;IAE5E,cAAc,CAAC,QAAgB,EAAE,MAAc;QAC7C,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc;oBACxB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC;gBAC5B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK,MAAM,EAAE,CAAC;IAC3C,CAAC;IAED,iBAAiB,CAAC,OAAe;QAC/B,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,iBAAiB;oBAC3B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC;gBAC/B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iBAAiB,CAAC,KAAiB;QACjC,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,KAAK,QAAQ;oBACrC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,iBAAiB;oBAC3B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC;gBAC/B,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF","sourcesContent":["/**\n * GraphTransformerService — ADR-060 Phase 3\n *\n * Thin service wrapping @ruvector/graph-transformer for use by controllers.\n * Provides 8 verified graph attention modules with graceful JS fallback.\n *\n * Module map:\n * 1. sublinearAttention — replaces JS fallback in AttentionService\n * 2. verifiedStep — extends LearningSystem\n * 3. causalAttention — extends CausalRecall\n * 4. grangerExtract — time-series causal discovery\n * 5. hamiltonianStep — physics-informed agent trajectory\n * 6. spikingAttention — biological, for ReflexionMemory\n * 7. gameTheoreticAttention — economic, for multi-agent routing\n * 8. productManifoldDistance — manifold, for ReasoningBank\n *\n * All methods return JS fallback results when the native module is not\n * available, so callers never need to check availability before use.\n */\n\nimport { cosineSimilarity } from '../utils/vector-math.js';\n\nexport interface GraphTransformerStats {\n available: boolean;\n engineType: 'native' | 'wasm' | 'js';\n modulesLoaded: string[];\n}\n\nexport class GraphTransformerService {\n private gt: any = null;\n private available = false;\n private engineType: 'native' | 'wasm' | 'js' = 'js';\n\n async initialize(): Promise<void> {\n // Try native NAPI-RS first\n try {\n const { GraphTransformer } = await import('@ruvector/graph-transformer' as string);\n this.gt = new GraphTransformer();\n this.available = true;\n this.engineType = 'native';\n return;\n } catch { /* native not available */ }\n\n // Try WASM fallback\n try {\n const mod = await import('ruvector-graph-transformer-wasm' as string);\n if (typeof mod.default === 'function') await mod.default();\n this.gt = new mod.JsGraphTransformer();\n this.available = true;\n this.engineType = 'wasm';\n return;\n } catch { /* WASM not available */ }\n\n // Pure JS fallback\n this.engineType = 'js';\n this.available = false;\n }\n\n isAvailable(): boolean {\n return this.available;\n }\n\n getEngineType(): 'native' | 'wasm' | 'js' {\n return this.engineType;\n }\n\n getStats(): GraphTransformerStats {\n const modules = this.available\n ? ['sublinearAttention', 'verifiedStep', 'causalAttention', 'grangerExtract',\n 'hamiltonianStep', 'spikingAttention', 'gameTheoreticAttention', 'productManifoldDistance']\n : [];\n return { available: this.available, engineType: this.engineType, modulesLoaded: modules };\n }\n\n // -------------------------------------------------------------------------\n // 1. Sublinear Attention — replaces JS fallback in AttentionService\n // -------------------------------------------------------------------------\n\n sublinearAttention(\n query: number[],\n adjacency: number[][],\n dim: number,\n topK: number,\n ): { scores: number[]; indices: number[] } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.sublinearAttention\n : this.gt.sublinear_attention;\n if (typeof fn === 'function') {\n const result = fn.call(this.gt, query, adjacency, dim, topK);\n // Normalize native response which may have different structure\n if (result && typeof result === 'object') {\n if ('scores' in result && 'indices' in result) {\n return result;\n }\n // Native may return { topScores, topIndices }\n if ('topScores' in result && 'topIndices' in result) {\n return { scores: result.topScores, indices: result.topIndices };\n }\n }\n }\n } catch { /* fall through to JS */ }\n }\n\n // JS fallback: compute cosine similarity of query against each row\n const scores = adjacency.map(row => cosineSimilarity(query, row));\n const indexed = scores.map((s, i) => ({ s, i }));\n indexed.sort((a, b) => b.s - a.s);\n const topIndices = indexed.slice(0, topK).map(x => x.i);\n const topScores = indexed.slice(0, topK).map(x => x.s);\n return { scores: topScores, indices: topIndices };\n }\n\n // -------------------------------------------------------------------------\n // 2. Verified Training Step — extends LearningSystem\n // -------------------------------------------------------------------------\n\n verifiedStep(\n weights: number[],\n gradients: number[],\n lr: number,\n ): { updated: number[]; proofId?: number } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.verifiedStep\n : this.gt.verified_step;\n if (typeof fn === 'function') {\n const result = fn.call(this.gt, weights, gradients, lr);\n // Native result might be an object with various keys\n if (result && typeof result === 'object' && !Array.isArray(result)) {\n // Check all possible response formats\n const updated = result.updated || result.updatedWeights || result.weights || result.newWeights;\n const proofId = result.proofId || result.proof_id;\n if (updated) {\n return { updated, proofId };\n }\n }\n // Or may return array directly\n if (Array.isArray(result)) {\n return { updated: result };\n }\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: simple SGD\n const updated = weights.map((w, i) => w - lr * (gradients[i] ?? 0));\n return { updated };\n }\n\n // -------------------------------------------------------------------------\n // 3. Causal Attention — extends CausalRecall\n // -------------------------------------------------------------------------\n\n causalAttention(\n query: number[],\n keys: number[][],\n timestamps: number[],\n ): { scores: number[]; causalWeights: number[] } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.causalAttention\n : this.gt.causal_attention;\n if (typeof fn === 'function') {\n const result = fn.call(this.gt, query, keys, timestamps);\n // Check if result is already in correct format\n if (result && typeof result === 'object' && !Array.isArray(result)) {\n if ('scores' in result || 'causalWeights' in result) {\n const scores = result.scores || result.attention || [];\n const causalWeights = result.causalWeights || result.causal_weights || result.weights || scores;\n return { scores, causalWeights };\n }\n }\n // Native may return array directly\n if (Array.isArray(result)) {\n return { scores: result, causalWeights: result.map((s: number) => Math.max(0, s)) };\n }\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: similarity with temporal decay\n const now = Math.max(...timestamps, 1);\n const scores = keys.map((k, i) => {\n const sim = cosineSimilarity(query, k);\n const age = (now - timestamps[i]) / now;\n return sim * Math.exp(-0.1 * age);\n });\n return { scores, causalWeights: scores.map(s => Math.max(0, s)) };\n }\n\n // -------------------------------------------------------------------------\n // 4. Granger Extract — time-series causal discovery\n // -------------------------------------------------------------------------\n\n grangerExtract(\n history: number[],\n numNodes: number,\n numSteps: number,\n ): { edges: Array<{ from: number; to: number; strength: number }> } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.grangerExtract\n : this.gt.granger_extract;\n if (typeof fn === 'function') {\n return fn.call(this.gt, history, numNodes, numSteps);\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: simple correlation-based edges\n const edges: Array<{ from: number; to: number; strength: number }> = [];\n const stride = Math.floor(history.length / numNodes);\n for (let i = 0; i < numNodes; i++) {\n for (let j = i + 1; j < numNodes; j++) {\n const aSlice = history.slice(i * stride, (i + 1) * stride);\n const bSlice = history.slice(j * stride, (j + 1) * stride);\n if (aSlice.length > 0 && bSlice.length > 0) {\n const strength = Math.abs(cosineSimilarity(aSlice, bSlice));\n if (strength > 0.3) {\n edges.push({ from: i, to: j, strength });\n }\n }\n }\n }\n return { edges };\n }\n\n // -------------------------------------------------------------------------\n // 5. Hamiltonian Step — physics-informed agent trajectory\n // -------------------------------------------------------------------------\n\n hamiltonianStep(\n positions: number[],\n momenta: number[],\n dt: number,\n ): { newPositions: number[]; newMomenta: number[]; energy: number } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.hamiltonianStep\n : this.gt.hamiltonian_step;\n if (typeof fn === 'function') {\n return fn.call(this.gt, positions, momenta, dt);\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: leapfrog integrator\n const n = positions.length;\n const newMomenta = momenta.slice();\n const newPositions = positions.slice();\n // Half-step momenta (assume harmonic potential V = 0.5 * sum(x^2))\n for (let i = 0; i < n; i++) {\n newMomenta[i] -= 0.5 * dt * positions[i];\n }\n // Full-step positions\n for (let i = 0; i < n; i++) {\n newPositions[i] += dt * newMomenta[i];\n }\n // Half-step momenta\n for (let i = 0; i < n; i++) {\n newMomenta[i] -= 0.5 * dt * newPositions[i];\n }\n // Energy = KE + PE\n let ke = 0, pe = 0;\n for (let i = 0; i < n; i++) {\n ke += 0.5 * newMomenta[i] * newMomenta[i];\n pe += 0.5 * newPositions[i] * newPositions[i];\n }\n return { newPositions, newMomenta, energy: ke + pe };\n }\n\n // -------------------------------------------------------------------------\n // 6. Spiking Attention — biological, for ReflexionMemory\n // -------------------------------------------------------------------------\n\n spikingAttention(\n potentials: number[],\n edges: number[][],\n threshold: number,\n ): { spikes: boolean[]; activations: number[] } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.spikingAttention\n : this.gt.spiking_attention;\n if (typeof fn === 'function') {\n return fn.call(this.gt, potentials, edges, threshold);\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: integrate-and-fire\n const n = potentials.length;\n const activations = potentials.slice();\n // Sum incoming edge weights\n for (let i = 0; i < n; i++) {\n if (edges[i]) {\n for (let j = 0; j < edges[i].length; j++) {\n activations[i] += (edges[i][j] ?? 0) * 0.1;\n }\n }\n }\n const spikes = activations.map(a => a >= threshold);\n return { spikes, activations };\n }\n\n // -------------------------------------------------------------------------\n // 7. Game-Theoretic Attention — for multi-agent routing\n // -------------------------------------------------------------------------\n\n gameTheoreticAttention(\n utilities: number[],\n edges: Array<{ from: number; to: number; weight: number }>,\n ): { equilibrium: number[]; nashScore: number } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.gameTheoreticAttention\n : this.gt.game_theoretic_attention;\n if (typeof fn === 'function') {\n return fn.call(this.gt, utilities, edges);\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: softmax equilibrium\n const n = utilities.length;\n const maxU = Math.max(...utilities, 1e-10);\n const exp = utilities.map(u => Math.exp(u / maxU));\n const sum = exp.reduce((a, b) => a + b, 1e-10);\n const equilibrium = exp.map(e => e / sum);\n // Nash score: how uniform the equilibrium is (1 = pure strategy)\n const nashScore = 1 - (equilibrium.reduce((acc, p) => acc - (p > 0 ? p * Math.log(p) : 0), 0) / Math.log(n || 2));\n return { equilibrium, nashScore: Math.max(0, Math.min(1, nashScore)) };\n }\n\n // -------------------------------------------------------------------------\n // 8. Product Manifold Distance — for ReasoningBank\n // -------------------------------------------------------------------------\n\n productManifoldDistance(\n a: number[],\n b: number[],\n curvatures: number[],\n ): { distance: number; components: number[] } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.productManifoldDistance\n : this.gt.product_manifold_distance;\n if (typeof fn === 'function') {\n return fn.call(this.gt, a, b, curvatures);\n }\n } catch { /* fall through */ }\n }\n\n // JS fallback: weighted Euclidean distance per curvature block\n const blockSize = Math.max(1, Math.floor(a.length / (curvatures.length || 1)));\n const components: number[] = [];\n let totalDist = 0;\n for (let c = 0; c < curvatures.length; c++) {\n const start = c * blockSize;\n const end = Math.min(start + blockSize, a.length);\n let blockDist = 0;\n for (let i = start; i < end; i++) {\n const diff = (a[i] ?? 0) - (b[i] ?? 0);\n blockDist += diff * diff;\n }\n const scale = 1 + Math.abs(curvatures[c]);\n blockDist = Math.sqrt(blockDist) * scale;\n components.push(blockDist);\n totalDist += blockDist * blockDist;\n }\n return { distance: Math.sqrt(totalDist), components };\n }\n\n // -------------------------------------------------------------------------\n // Proof operations\n // -------------------------------------------------------------------------\n\n proveDimension(expected: number, actual: number): { verified: boolean; proof_id?: number } {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.proveDimension\n : this.gt.prove_dimension;\n if (typeof fn === 'function') {\n return fn.call(this.gt, expected, actual);\n }\n } catch { /* fall through */ }\n }\n return { verified: expected === actual };\n }\n\n createAttestation(proofId: number): Uint8Array | null {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.createAttestation\n : this.gt.create_attestation;\n if (typeof fn === 'function') {\n return fn.call(this.gt, proofId);\n }\n } catch { /* fall through */ }\n }\n return null;\n }\n\n verifyAttestation(bytes: Uint8Array): boolean {\n if (this.available && this.gt) {\n try {\n const fn = this.engineType === 'native'\n ? this.gt.verifyAttestation\n : this.gt.verify_attestation;\n if (typeof fn === 'function') {\n return fn.call(this.gt, bytes);\n }\n } catch { /* fall through */ }\n }\n return false;\n }\n}\n"]}