universal-physics-tensor 11.0.0 → 12.0.0

package/dist/composition/canonical-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"canonical-graph.js","sourceRoot":"","sources":["../../src/composition/canonical-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AAEH,OAAO,EAAE,cAAc,EAAwC,MAAM,WAAW,CAAC;AAEjF,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,sCAAsC,CAAC;AAC3H,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAGjE,OAAO,EAAU,aAAa,EAAQ,MAAM,yBAAyB,CAAC;AACtE,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAEnD,OAAO,EAAE,0BAA0B,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AACpH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAQvD;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAA0C,MAAM,CAAC,WAAW,CAC1F,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAC/D,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAC/F,CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,QAAQ,GAA6E;IACzF,UAAU,EAAE,aAAa;IACzB,OAAO,EAAE,SAAS;IAClB,UAAU,EAAE,YAAY;IACxB,cAAc,EAAE,SAAS;CAC1B,CAAC;AAEF,8EAA8E;AAC9E,MAAM,aAAa,GAAG,CAAC,IAAY,EAAE,GAAc,EAAiB,EAAE;IACpE,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IACpC,OAAO,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAChE,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,EAAqB;IACzC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAI,EAAE,CAAC,MAA4C,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,IAAI,KAAK,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,SAAS;QAClE,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACvB,CAAC;IACD,IAAI,EAAE,CAAC,MAAM,CAAC,WAAW;QAAE,MAAM,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IACnF,OAAO,kBAAkB,CAAC,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;AACjE,CAAC;AAED,MAAM,iBAAiB,GAAmB;IACxC,WAAW,EAAE,6CAA6C;IAC1D,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI;IACrB,UAAU,EAAE,GAAG,EAAE,CAAC,EAAE;CACrB,CAAC;AAEF;;;GAGG;AACH,SAAS,QAAQ,CAAC,EAAqB,EAAE,WAA8B;IACrE,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC;IACtB,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,iBAAiB,CAAC;IACjD,OAAO,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;AACxD,CAAC;AAED,yFAAyF;AACzF,SAAS,iBAAiB,CAAC,IAAY;IACrC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC1B,IAAI,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC;IACpE,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACvB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,wBAAwB,CAAC,IAAc;IAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACtC,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,CAAC,GAAG,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACpE,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACvF,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,KAAK,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uGAAuG;AACvG,SAAS,iBAAiB,CAAC,IAAc,EAAE,SAA8B;IACvE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC7D,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3C,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IACtF,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,gCAAgC,CAAC,EAAqB;IAC7D,IAAI,EAAE,CAAC,eAAe,KAAK,oBAAoB,IAAI,EAAE,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAChG,2EAA2E;IAC3E,6DAA6D;IAC7D,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC9D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,IAAI,iBAAiB,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IACjE,MAAM,CAAC,GAAG,wBAAwB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACxE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK;QAAE,OAAO,SAAS,CAAC;IAC9C,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,SAAS,sBAAsB,CAAC,EAAqB;IACnD,IAAI,EAAE,CAAC,eAAe,KAAK,oBAAoB,IAAI,EAAE,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,MAAM,GAAG,iBAAiB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAC/C,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC1C,iBAAiB,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7E,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,SAAS;QAC/D,IAAI,iBAAiB,CAAC,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QACpD,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC;YAAE,SAAS;QAChE,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAID;;;;;GAKG;AACH,SAAS,WAAW,CAAC,IAAc,EAAE,IAAY;IAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;IACzE,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC5D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IACnD,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;QAC3F,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACxC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACzD,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QACpD,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,IAAI,GAAG,GAAgB,QAAQ,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,IAAI,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAChC,IAAI,GAAG,KAAK,QAAQ;gBAAE,GAAG,GAAG,IAAI,CAAC;iBAC5B,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK;gBAAE,GAAG,GAAG,MAAM,CAAC;iBAClD,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK;gBAAE,GAAG,GAAG,KAAK,CAAC;;gBACjD,GAAG,GAAG,MAAM,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/F,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QACnG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACrD,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QACpE,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACxC,OAAO,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,qFAAqF;AACrF,SAAS,cAAc,CAAC,IAA0B;IAChD,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,iBAAiB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/G,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,sFAAsF;AACtF,SAAS,mBAAmB,CAC1B,EAAqB,EACrB,MAAmC;IAEnC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;QACxD,MAAM,EAAE,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,IAAI,EAAE,KAAK,IAAI;YAAE,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;YAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,CAAC,MAA8B,EAAU,EAAE;QAChD,IAAI,CAAC,GAAG,WAAW,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;YAC9D,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,4EAA4E;AAC5E,SAAS,aAAa,CAAC,IAAc,EAAE,MAA8B;IACnE,MAAM,KAAK,GAA2B,EAAE,GAAG,MAAM,EAAE,CAAC;IACpD,MAAM,IAAI,GAAG,CAAC,OAAiB,EAAQ,EAAE;QACvC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC;gBAAE,OAAO;YAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;YAC1F,OAAO;QACT,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI;YAAE,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC;aAChE,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,gBAAgB,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5H,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAC3B,EAAqB;IAErB,IAAI,EAAE,CAAC,eAAe,KAAK,oBAAoB,IAAI,EAAE,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAChG,IAAI,iBAAiB,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACpE,MAAM,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC;IACzB,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC;IACvH,OAAO,CAAC,MAAM,EAAE,EAAE;QAChB,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;QACxE,CAAC;QACD,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;YACxD,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;QACrD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,MAAM,CAAC,GAAG,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,YAAY,CACnB,EAAqB;IAErB,MAAM,MAAM,GAAG,EAAE,CAAC,eAAe,KAAK,oBAAoB,CAAC,CAAC,CAAC,iBAAiB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACzG,MAAM,OAAO,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;QAClG,OAAO,mBAAmB,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;IACxC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC;IACzC,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,IAAI,EAAE,KAAK,IAAI;YAAE,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;YAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,QAAQ,GAAG,gCAAgC,CAAC,EAAE,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,EAAE,CAAC,eAAe,KAAK,aAAa,IAAI,MAAM,KAAK,SAAS,CAAC;IAC3E,OAAO,CAAC,MAA8B,EAAU,EAAE;QAChD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;YAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,GAAG,WAAW,CAAC;QACpB,IAAI,QAAQ,KAAK,SAAS;YAAE,CAAC,IAAI,QAAQ,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS;YAAE,CAAC,IAAI,MAAM,CAAC;QACtC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1C,MAAM,MAAM,GAAG,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACjD,IAAI,MAAM,KAAK,SAAS;oBAAE,CAAC,IAAI,MAAM,CAAC;YACxC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,kEAAkE;AAClE,SAAS,MAAM,CAAC,EAAqB;IACnC,MAAM,UAAU,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,MAAM,GAAa;QACvB,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI;QAChC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI;QAClC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG;QAC9B,UAAU;KACX,CAAC;IACF,MAAM,OAAO,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAe,EAAE,CAAC,WAAW,CAAC,SAAS;SACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;SACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC1E,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,UAAU,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,WAAW,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClG,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC;IACzC,OAAO;QACL,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,KAAK;QACX,KAAK,EAAE,EAAE,CAAC,IAAI;QACd,OAAO;QACP,MAAM;QACN,UAAU,EAAE,aAAa;QACzB,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1D,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjF,QAAQ,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE;QACnC,GAAG,CAAC,EAAE,CAAC,eAAe,KAAK,aAAa,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,SAAS;YACjF,CAAC,CAAC,EAAE,gBAAgB,EAAE,IAAa,EAAE;YACrC,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACjD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAS,GAAiC,mBAAmB;IAE7D,OAAO,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAA0B,gBAAgB,EAAE,CAAC","sourcesContent":["/**\n * Canonical-only graph — project the standard-physics L-layer\n * (`CANONICAL_EQUATIONS`) into the composition-graph edge vocabulary so the\n * discovery/analysis funnel (`upt discover` / `candidates` / `map`) can run on\n * established textbook physics ALONE, with the speculative bridge catalog\n * excluded.\n *\n * WHY this exists: `CATALOG_GRAPH` mixes established bridges with speculative\n * ones (the counts per status are NOTES.md's), so a `promising` discovery\n * there is polluted by speculation. Feeding ONLY canonical equations gives (a) a new-candidate\n * review surface motivated by textbook physics, and (b) a regression harness —\n * discovery on canonical-only must introduce no numerical contradiction\n * (standard physics, fed to the inference suite, stays self-consistent).\n *\n * DESIGN — parity with the bridge graph:\n *   - Universal constants (G, c, ℏ, k_B, ε₀, σ_sb, b, e) are BAKED INTO the\n *     evaluator, exactly as the catalog edges bake them — they are not graph\n *     nodes. This keeps the candidate proposer about physical OBSERVABLES and\n *     lets the numeric filter fire from the standard `{ mass }` anchor (an\n *     anchor cannot supply G/c/ℏ). A `governing` entry is a constant iff its\n *     name is registered in `CANONICAL_CONSTANT_SI`; everything else is a\n *     physical variable and becomes a source/target node.\n *   - Every canonical equation is `established` physics, so every edge is\n *     `confidence: 'established'` — the canonical graph IS the anchored core.\n *   - `kind: 'law'` (within-domain ground truth, not a cross-regime bridge);\n *     `beId: null` (not a catalog bridge). **Annotation-correctness note:**\n *     `toEdge` hardcodes `kind:'law'`; the attributes an edge carries do not\n *     decide its kind here. The attribute mapping is annotation-only; there\n *     is no edge-kind path and no delta to measure.\n *   - Evaluator: the dimensional MONOMIAL gives the power law over the variable\n *     sources, times the baked constant factor. A fully-quantitative scalar\n *     AST whose extra factors are a closed dimensionless coefficient\n *     (4π, ln 2, 8π/3, …) multiplies that coefficient on the Buckingham path,\n *     including a minus sign. The sourced prefactor table owns the factor\n *     for an AST that is intentionally constant-free, so that path does not\n *     multiply the AST coefficient again. A null monomial, or a dimensionless\n *     count, is evaluated from the AST, which already folded those leaves.\n *     A sourced prefactor from `canonicalPrefactor` multiplies as well. A dimensionless\n *     group in `CANONICAL_GROUP_PREFACTORS` multiplies only when that input is\n *     present (`√γ` for sound speed). Absent, a dimensional entry with no\n *     sourced prefactor returns no number. That table is\n *     outside this tree. `scalar-up-to-constant` is not a license to drop ½,\n *     2π, or 6π. A sourced 1 stays a value. A fully-quantitative dimensionless count (`N`,\n *     `1-e²`) is a source in `formulaFactors`, not a stub that drops the\n *     rest of the coefficient: the evaluator multiplies it, and a missing\n *     count does not return the count-free value. A `scalar-up-to-constant`\n *     stub (Jarzynski's log average) stays out of that list. A G-closure\n *     is not given a second constant here. Where\n *     dimensions cannot pin a monomial\n *     (`monomial: null`), a fully-quantitative product, quotient, or integer\n *     power is evaluated from that AST, so a numeric leaf (4, 6π, 8π) is not\n *     dropped and Newton's two same-dim masses still return G m₁ m₂ / r².\n *     A fully-quantitative sum or transcendental (Carnot, the first law, the\n *     Boltzmann factor) is evaluated from that same AST. A\n *     `scalar-up-to-constant` stub still carries a NaN evaluator;\n *     `retrodict` accepts only finite derivations, so it abstains on those\n *     rather than inventing a monomial or presenting the dropped ½ as the law.\n *\n * The public counterpart to `CATALOG_GRAPH` (the bridge-catalog graph): exported\n * from the package manifest and surfaced via the CLI's `--source=canonical`\n * flag on `discover` / `candidates` / `map`.\n *\n * @module composition/canonical-graph\n */\n\nimport { validityDomain, type BridgeEdge, type ValidityDomain } from './edge.js';\nimport type { Quantity, RegimeAttributes } from './quantity.js';\nimport { regimeAttributesOf } from './quantity.js';\nimport { AXES } from './axes.js';\nimport type { CanonicalEquation } from '../canonical/canonical-equation.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { applyCarrierSignPolicy } from '../bridges/carrier-sign.js';\nimport { CONSTANT_REGISTRY, CONSTANTS, isRegisteredConstant, piMultipleValue } from '../dimensional/symbolic-constants.js';\nimport { forEachScalarLeaf } from '../dimensional/ast-leaves.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport type { InformationMeasure } from '../core/types.js';\nimport { CHARGE, DIMENSIONLESS, MASS } from '../dimensional/types.js';\nimport { equals } from '../dimensional/algebra.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { CANONICAL_GROUP_PREFACTORS, canonicalGroupPrefactor, canonicalPrefactor } from './canonical-prefactors.js';\nimport { evalExpr } from './expr-eval.js';\nimport { monomialExponents } from './formula-shape.js';\n\n/** A universal constant a canonical `governing` list may name: SI value + dim. Named by the public `CANONICAL_CONSTANTS`. @public */\nexport interface ConstantDef {\n  readonly value: number;\n  readonly dim: Dimension;\n}\n\n/**\n * The universal constants a canonical `governing` list may name, under every\n * registered spelling, with SI value AND dimension: the canonical rows of the\n * constant registry. A governing entry is BAKED into the evaluator iff its\n * name AND dimension match an entry here; everything else is a physical\n * variable (a graph node). The dimension guard is load-bearing: it stops a\n * future same-named physical variable (e.g. orbital eccentricity `e`,\n * dimensionless) from being silently replaced by a constant of the same name.\n */\nexport const CANONICAL_CONSTANTS: Readonly<Record<string, ConstantDef>> = Object.fromEntries(\n  CONSTANT_REGISTRY.filter((row) => row.canonical).flatMap((row) =>\n    [row.name, ...row.spellings].map((spelling) => [spelling, { value: row.value, dim: row.dim }]),\n  ),\n);\n\n/**\n * Map camelCase `InformationMeasure` (from canonical regime) to kebab-case\n * `RegimeAttributes.information` (for composition graph).\n */\nconst INFO_MAP: Record<InformationMeasure, NonNullable<RegimeAttributes['information']>> = {\n  vonNeumann: 'von-neumann',\n  shannon: 'shannon',\n  kolmogorov: 'kolmogorov',\n  quantumDiscord: 'discord',\n};\n\n/** A governing entry is a baked constant iff its name AND dimension match. */\nconst constantValue = (name: string, dim: Dimension): number | null => {\n  const c = CANONICAL_CONSTANTS[name];\n  return c !== undefined && equals(c.dim, dim) ? c.value : null;\n};\n\n/**\n * Carry every registry axis the canonical regime states under the same\n * vocabulary (scale, force, symmetry), plus information through `INFO_MAP`,\n * whose spelling differs. `TensorIndices.topology` is a number, not a\n * `TopologyAxis`, and `dimension` is not a registry axis; neither is carried.\n * The result is checked against the registry, so a canonical regime value\n * outside an axis's value list is a load-time error, not an unstated axis.\n */\nfunction attributesOf(eq: CanonicalEquation): RegimeAttributes {\n  const stated: Record<string, string> = {};\n  for (const { name } of AXES) {\n    const value = (eq.regime as Readonly<Record<string, unknown>>)[name];\n    if (name === 'information' || typeof value !== 'string') continue;\n    stated[name] = value;\n  }\n  if (eq.regime.information) stated['information'] = INFO_MAP[eq.regime.information];\n  return regimeAttributesOf(stated, `canonical ${eq.id} regime`);\n}\n\nconst PERMISSIVE_DOMAIN: ValidityDomain = {\n  description: 'standard-physics regime (canonical L-layer)',\n  predicate: () => true,\n  violations: () => [],\n};\n\n/**\n * The validity domain of `eq`: its stated condition over the source names, or\n * the permissive domain when none is stated. An unbound name is a violation.\n */\nfunction domainOf(eq: CanonicalEquation, sourceNames: readonly string[]): ValidityDomain {\n  const text = eq.holds;\n  if (text === undefined) return PERMISSIVE_DOMAIN;\n  return validityDomain(text, sourceNames, sourceNames);\n}\n\n/** A registered or literal dimensionless number, or undefined when `name` is not one. */\nfunction dimensionlessLeaf(name: string): number | undefined {\n  const c = CONSTANTS[name];\n  if (c !== undefined && equals(c.dim, DIMENSIONLESS)) return c.value;\n  const pi = piMultipleValue(name);\n  if (pi !== undefined) return pi;\n  const n = Number(name);\n  return Number.isFinite(n) ? n : undefined;\n}\n\n/**\n * The dimensionless coefficient of a product or quotient. Dimensionful symbols\n * contribute 1 — the monomial evaluator already carries them. A sum, a\n * non-scalar arm, or a non-literal exponent is not a closed coefficient.\n */\nfunction dimensionlessCoefficient(node: ExprNode): number | undefined {\n  if (node.kind === 'symbol') {\n    const v = dimensionlessLeaf(node.name);\n    return v !== undefined ? v : 1;\n  }\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '*') {\n    let acc = 1;\n    for (const a of node.args) {\n      const c = dimensionlessCoefficient(a);\n      if (c === undefined) return undefined;\n      acc *= c;\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const n = dimensionlessCoefficient(node.args[0]!);\n    const d = dimensionlessCoefficient(node.args[1]!);\n    if (n === undefined || d === undefined || d === 0) return undefined;\n    return n / d;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const exp = node.args[1];\n    if (base === undefined || exp === undefined || exp.kind !== 'symbol') return undefined;\n    const e = Number(exp.name);\n    if (!Number.isFinite(e)) return undefined;\n    if (base.kind === 'symbol') {\n      const v = dimensionlessLeaf(base.name);\n      return v !== undefined ? Math.pow(v, e) : 1;\n    }\n    const inner = dimensionlessCoefficient(base);\n    return inner === undefined ? undefined : Math.pow(inner, e);\n  }\n  return undefined;\n}\n\n/** A symbol the coefficient walker would treat as 1 but that is not a constant or a governing name. */\nfunction hasUnresolvedStub(node: ExprNode, governing: ReadonlySet<string>): boolean {\n  if (node.kind === 'symbol') {\n    if (dimensionlessLeaf(node.name) !== undefined) return false;\n    if (governing.has(node.name)) return false;\n    if (isRegisteredConstant(node.name)) return false;\n    return true;\n  }\n  if (node.kind === 'op') return node.args.some((a) => hasUnresolvedStub(a, governing));\n  return true;\n}\n\n/**\n * The closed dimensionless factor a fully-quantitative AST records in front of\n * its dimensional monomial. `undefined` when there is nothing to multiply\n * (no AST, not fully quantitative, a stub, a sum, a factor of +1, or a factor\n * the sourced prefactor table already owns).\n */\nfunction recordedDimensionlessCoefficient(eq: CanonicalEquation): number | undefined {\n  if (eq.epistemicStatus !== 'fully-quantitative' || eq.scalarAst === undefined) return undefined;\n  // The table is the sourced multiplier for an AST that stays constant-free.\n  // Multiplying the AST as well would count that factor twice.\n  if (canonicalPrefactor(eq.id) !== undefined) return undefined;\n  const governing = new Set(eq.dimensional.governing.map((g) => g.name));\n  if (hasUnresolvedStub(eq.scalarAst, governing)) return undefined;\n  const c = dimensionlessCoefficient(eq.scalarAst);\n  if (c === undefined || !Number.isFinite(c) || c === 0) return undefined;\n  if (Math.abs(c - 1) < 1e-12) return undefined;\n  return c;\n}\n\n/**\n * Dimensionless counts a fully-quantitative AST multiplies in and Buckingham\n * cannot see. `scalar-up-to-constant` stays excluded: that stub is the\n * unfixed factor, not a required input.\n */\nfunction formulaFactorExponents(eq: CanonicalEquation): Record<string, number> {\n  if (eq.epistemicStatus !== 'fully-quantitative' || eq.scalarAst === undefined) return {};\n  const powers = monomialExponents(eq.scalarAst);\n  if (powers === undefined) return {};\n  const governing = new Set(eq.dimensional.governing.map((g) => g.name));\n  const dims = new Map<string, Dimension>();\n  forEachScalarLeaf(eq.scalarAst, (leaf) => dims.set(leaf.name, leaf.dim), {});\n  const factors: Record<string, number> = {};\n  for (const [name, exp] of powers) {\n    if (exp === 0) continue;\n    const dim = dims.get(name);\n    if (dim === undefined || !equals(dim, DIMENSIONLESS)) continue;\n    if (dimensionlessLeaf(name) !== undefined) continue;\n    if (governing.has(name) || isRegisteredConstant(name)) continue;\n    factors[name] = exp;\n  }\n  return factors;\n}\n\ntype InputParity = 'even' | 'odd' | 'neither' | 'absent';\n\n/**\n * Sign parity of `node` as a function of `name`. A product of two odd\n * factors is even. An absolute value is even. An even integer power is\n * even. A fractional power of an even subexpression stays even\n * (`√(q²)`), and a fractional power of an odd one is not a magnitude.\n */\nfunction inputParity(node: ExprNode, name: string): InputParity {\n  if (node.kind === 'symbol') return node.name === name ? 'odd' : 'absent';\n  if (node.kind === 'abs') {\n    const inner = inputParity(node.arg, name);\n    if (inner === 'absent' || inner === 'neither') return inner;\n    return 'even';\n  }\n  if (node.kind === 'transcendental' || node.kind === 'dirac-delta') {\n    const inner = inputParity(node.arg, name);\n    return inner === 'absent' ? 'absent' : 'neither';\n  }\n  if (node.kind !== 'op') return 'neither';\n  if (node.op === '+' || node.op === '-') {\n    const parts = node.args.map((arg) => inputParity(arg, name)).filter((p) => p !== 'absent');\n    if (parts.length === 0) return 'absent';\n    if (parts.some((p) => p === 'neither')) return 'neither';\n    if (parts.every((p) => p === 'even')) return 'even';\n    if (parts.every((p) => p === 'odd')) return 'odd';\n    return 'neither';\n  }\n  if (node.op === '*' || node.op === '/') {\n    let acc: InputParity = 'absent';\n    for (const arg of node.args) {\n      const part = inputParity(arg, name);\n      if (part === 'neither') return 'neither';\n      if (part === 'absent') continue;\n      if (acc === 'absent') acc = part;\n      else if (acc === 'odd' && part === 'odd') acc = 'even';\n      else if (acc === 'odd' || part === 'odd') acc = 'odd';\n      else acc = 'even';\n    }\n    return acc;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const expNode = node.args[1];\n    if (base === undefined || expNode === undefined || expNode.kind !== 'symbol') return 'neither';\n    const exp = Number(expNode.name);\n    const inner = inputParity(base, name);\n    if (!Number.isFinite(exp) || inner === 'neither') return inner === 'absent' ? 'absent' : 'neither';\n    if (inner === 'absent' || exp === 0) return 'absent';\n    if (Number.isInteger(exp) && Math.abs(exp) % 2 === 0) return 'even';\n    if (Number.isInteger(exp)) return inner;\n    return inner === 'even' ? 'even' : 'neither';\n  }\n  return 'neither';\n}\n\n/** Names whose scalar AST is an even function. A magnitude uses these absolutely. */\nfunction evenInputNames(node: ExprNode | undefined): ReadonlySet<string> {\n  if (node === undefined) return new Set();\n  const names = new Set<string>();\n  forEachScalarLeaf(node, (leaf) => names.add(leaf.name), { abs: true, transcendental: true, diracDelta: true });\n  const even = new Set<string>();\n  for (const name of names) {\n    if (inputParity(node, name) === 'even') even.add(name);\n  }\n  return even;\n}\n\n/** Evaluate a fully-quantitative monomial AST, including its dimensionless counts. */\nfunction evaluateAstMonomial(\n  eq: CanonicalEquation,\n  powers: ReadonlyMap<string, number>,\n): (inputs: Record<string, number>) => number {\n  const dimByName = new Map(eq.dimensional.governing.map((g) => [g.name, g.dim]));\n  let constFactor = 1;\n  const varExps: Array<[string, number]> = [];\n  for (const [name, exp] of powers) {\n    if (exp === 0) continue;\n    const leaf = dimensionlessLeaf(name);\n    if (leaf !== undefined) {\n      constFactor *= Math.pow(leaf, exp);\n      continue;\n    }\n    const dim = dimByName.get(name) ?? CONSTANTS[name]?.dim;\n    const cv = dim !== undefined ? constantValue(name, dim) : null;\n    if (cv !== null) constFactor *= Math.pow(cv, exp);\n    else varExps.push([name, exp]);\n  }\n  return (inputs: Record<string, number>): number => {\n    let v = constFactor;\n    for (const [name, exp] of varExps) {\n      const x = inputs[name];\n      if (x === undefined || !Number.isFinite(x)) return Number.NaN;\n      v *= Math.pow(x, exp);\n    }\n    return v;\n  };\n}\n\n/** Numeric literal symbols (`1`, `-1`) the monomial path already folded. */\nfunction literalInputs(node: ExprNode, inputs: Record<string, number>): Record<string, number> {\n  const scope: Record<string, number> = { ...inputs };\n  const walk = (current: ExprNode): void => {\n    if (current.kind === 'symbol') {\n      if (Object.hasOwn(scope, current.name)) return;\n      const numeric = Number(current.name);\n      if (current.name.trim() !== '' && Number.isFinite(numeric)) scope[current.name] = numeric;\n      return;\n    }\n    if (current.kind === 'op') for (const arg of current.args) walk(arg);\n    else if (current.kind === 'abs' || current.kind === 'transcendental' || current.kind === 'dirac-delta') walk(current.arg);\n  };\n  walk(node);\n  return scope;\n}\n\n/**\n * A fully-quantitative sum or transcendental. The monomial exponent walk\n * cannot see it. `scalar-up-to-constant` stays out: that status dropped a\n * factor, and the AST is not the law.\n */\nfunction evaluateClosedScalar(\n  eq: CanonicalEquation,\n): ((inputs: Record<string, number>) => number) | undefined {\n  if (eq.epistemicStatus !== 'fully-quantitative' || eq.scalarAst === undefined) return undefined;\n  if (monomialExponents(eq.scalarAst) !== undefined) return undefined;\n  const ast = eq.scalarAst;\n  const required = eq.dimensional.governing.filter((governing) => constantValue(governing.name, governing.dim) === null);\n  return (inputs) => {\n    for (const governing of required) {\n      const value = inputs[governing.name];\n      if (value === undefined || !Number.isFinite(value)) return Number.NaN;\n    }\n    try {\n      const value = evalExpr(ast, literalInputs(ast, inputs));\n      return Number.isFinite(value) ? value : Number.NaN;\n    } catch {\n      return Number.NaN;\n    }\n  };\n}\n\n/**\n * Build the evaluator for one canonical equation, keyed by its VARIABLE source\n * names. Variables carry the monomial exponent from `inputs`; constants\n * contribute a fixed baked factor. A fully-quantitative monomial multiplies\n * its recorded dimensionless coefficient when the sourced table does not\n * already own that factor, and multiplies the sourced table prefactor.\n * A fully-quantitative AST that names a dimensionless count, or whose\n * Buckingham monomial is null, is evaluated from that AST so the count and\n * the numeric leaves (6π) are not dropped. A fully-quantitative sum or\n * transcendental is evaluated from that AST too. The edge applies the sign policy\n * once before this function: an input the AST is even in is an absolute\n * value, and a product odd in both charge and mobility rejects opposite\n * signs. This function does not do that again.\n * Returns NaN when the monomial is null and the AST is not a fully-quantitative\n * closed form, and when a dimensional coefficient is unset and its group is unbound.\n * `retrodict` then abstains.\n */\nfunction makeEvaluate(\n  eq: CanonicalEquation,\n): (inputs: Record<string, number>) => number {\n  const powers = eq.epistemicStatus === 'fully-quantitative' ? monomialExponents(eq.scalarAst) : undefined;\n  const factors = formulaFactorExponents(eq);\n  if (powers !== undefined && (Object.keys(factors).length > 0 || eq.dimensional.monomial === null)) {\n    return evaluateAstMonomial(eq, powers);\n  }\n  const closed = evaluateClosedScalar(eq);\n  if (closed !== undefined) return closed;\n  const monomial = eq.dimensional.monomial;\n  if (monomial === null) return () => NaN;\n  const dimByName = new Map(eq.dimensional.governing.map((g) => [g.name, g.dim]));\n  let constFactor = 1;\n  const varExps: Array<[string, number]> = [];\n  for (const [name, exp] of Object.entries(monomial)) {\n    const dim = dimByName.get(name);\n    const cv = dim !== undefined ? constantValue(name, dim) : null;\n    if (cv !== null) constFactor *= Math.pow(cv, exp);\n    else varExps.push([name, exp]);\n  }\n  const recorded = recordedDimensionlessCoefficient(eq);\n  const tabled = canonicalPrefactor(eq.id);\n  const group = CANONICAL_GROUP_PREFACTORS.find((p) => p.id === eq.id);\n  const unset = eq.epistemicStatus === 'dimensional' && tabled === undefined;\n  return (inputs: Record<string, number>): number => {\n    if (unset) {\n      if (group === undefined) return Number.NaN;\n      const bound = inputs[group.group];\n      if (bound === undefined || !Number.isFinite(bound)) return Number.NaN;\n    }\n    let v = constFactor;\n    if (recorded !== undefined) v *= recorded;\n    if (tabled !== undefined) v *= tabled;\n    if (group !== undefined) {\n      const g = inputs[group.group];\n      if (g !== undefined && Number.isFinite(g)) {\n        const factor = canonicalGroupPrefactor(eq.id, g);\n        if (factor !== undefined) v *= factor;\n      }\n    }\n    for (const [name, exp] of varExps) {\n      const x = inputs[name];\n      v *= Math.pow(x === undefined ? Number.NaN : x, exp);\n    }\n    return v;\n  };\n}\n\n/** Project one canonical equation to a composition-graph edge. */\nfunction toEdge(eq: CanonicalEquation): BridgeEdge {\n  const attributes = attributesOf(eq);\n  const target: Quantity = {\n    name: eq.dimensional.target.name,\n    symbol: eq.dimensional.target.name,\n    dim: eq.dimensional.target.dim,\n    attributes,\n  };\n  const factors = formulaFactorExponents(eq);\n  const sources: Quantity[] = eq.dimensional.governing\n    .filter((g) => constantValue(g.name, g.dim) === null)\n    .map((g) => ({ name: g.name, symbol: g.name, dim: g.dim, attributes }));\n  for (const name of Object.keys(factors)) {\n    sources.push({ name, symbol: name, dim: DIMENSIONLESS, attributes });\n  }\n  const evaluateRaw = makeEvaluate(eq);\n  const even = evenInputNames(eq.scalarAst);\n  const evenInputs = sources.filter((source) => even.has(source.name)).map((source) => source.name);\n  const monomial = eq.dimensional.monomial;\n  return {\n    id: eq.id,\n    beId: null,\n    kind: 'law',\n    label: eq.name,\n    sources,\n    target,\n    confidence: 'established',\n    domain: domainOf(eq, sources.map((source) => source.name)),\n    evaluate: (inputs) => evaluateRaw(applyCarrierSignPolicy(monomial, inputs, even)),\n    citation: eq.references[0] ?? eq.id,\n    ...(eq.epistemicStatus === 'dimensional' && canonicalPrefactor(eq.id) === undefined\n      ? { coefficientUnset: true as const }\n      : {}),\n    ...(Object.keys(factors).length > 0 ? { formulaFactors: factors } : {}),\n    ...(evenInputs.length > 0 ? { evenInputs } : {}),\n  };\n}\n\n/**\n * Project canonical equations into composition-graph edges (defaults to the\n * full registry). See the module docstring for the modelling decisions.\n *\n * @internal\n */\nexport function canonicalToEdges(\n  equations: readonly CanonicalEquation[] = CANONICAL_EQUATIONS,\n): BridgeEdge[] {\n  return equations.map(toEdge);\n}\n\n/**\n * The standard-physics composition graph: every canonical equation as an\n * `established` `law` edge. The bridge-free counterpart to `CATALOG_GRAPH`.\n *\n * @internal\n */\nexport const CANONICAL_GRAPH: readonly BridgeEdge[] = canonicalToEdges();\n"]}
+{"version":3,"file":"canonical-graph.js","sourceRoot":"","sources":["../../src/composition/canonical-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AAEH,OAAO,EAAE,cAAc,EAAwC,MAAM,WAAW,CAAC;AAEjF,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AACpE,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,sCAAsC,CAAC;AAC3H,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAGjE,OAAO,EAAU,aAAa,EAAQ,MAAM,yBAAyB,CAAC;AACtE,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAEnD,OAAO,EAAE,0BAA0B,EAAE,uBAAuB,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AACpH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAQvD;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAA0C,MAAM,CAAC,WAAW,CAC1F,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAC/D,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAC/F,CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,QAAQ,GAA6E;IACzF,UAAU,EAAE,aAAa;IACzB,OAAO,EAAE,SAAS;IAClB,UAAU,EAAE,YAAY;IACxB,cAAc,EAAE,SAAS;CAC1B,CAAC;AAEF,8EAA8E;AAC9E,MAAM,aAAa,GAAG,CAAC,IAAY,EAAE,GAAc,EAAiB,EAAE;IACpE,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IACpC,OAAO,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAChE,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,EAAqB;IACzC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAI,EAAE,CAAC,MAA4C,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,IAAI,KAAK,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,SAAS;QAClE,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACvB,CAAC;IACD,IAAI,EAAE,CAAC,MAAM,CAAC,WAAW;QAAE,MAAM,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IACnF,OAAO,kBAAkB,CAAC,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;AACjE,CAAC;AAED,MAAM,iBAAiB,GAAmB;IACxC,WAAW,EAAE,6CAA6C;IAC1D,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI;IACrB,UAAU,EAAE,GAAG,EAAE,CAAC,EAAE;CACrB,CAAC;AAEF;;;GAGG;AACH,SAAS,QAAQ,CAAC,EAAqB,EAAE,WAA8B;IACrE,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC;IACtB,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,iBAAiB,CAAC;IACjD,OAAO,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;AACxD,CAAC;AAED,yFAAyF;AACzF,SAAS,iBAAiB,CAAC,IAAY;IACrC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC1B,IAAI,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC;IACpE,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACvB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,wBAAwB,CAAC,IAAc;IAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACtC,GAAG,IAAI,CAAC,CAAC;QACX,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,CAAC,GAAG,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACpE,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACvF,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,KAAK,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uGAAuG;AACvG,SAAS,iBAAiB,CAAC,IAAc,EAAE,SAA8B;IACvE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC7D,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3C,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IACtF,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,gCAAgC,CAAC,EAAqB;IAC7D,IAAI,EAAE,CAAC,eAAe,KAAK,oBAAoB,IAAI,EAAE,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAChG,2EAA2E;IAC3E,6DAA6D;IAC7D,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC9D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,IAAI,iBAAiB,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IACjE,MAAM,CAAC,GAAG,wBAAwB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACxE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK;QAAE,OAAO,SAAS,CAAC;IAC9C,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,SAAS,sBAAsB,CAAC,EAAqB;IACnD,IAAI,EAAE,CAAC,eAAe,KAAK,oBAAoB,IAAI,EAAE,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,MAAM,GAAG,iBAAiB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAC/C,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC1C,iBAAiB,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAC7E,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,SAAS;QAC/D,IAAI,iBAAiB,CAAC,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QACpD,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC;YAAE,SAAS;QAChE,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAID;;;;;GAKG;AACH,SAAS,WAAW,CAAC,IAAc,EAAE,IAAY;IAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;IACzE,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC5D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IACnD,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;QAC3F,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACxC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACzD,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QACpD,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,IAAI,GAAG,GAAgB,QAAQ,CAAC;QAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,IAAI,IAAI,KAAK,QAAQ;gBAAE,SAAS;YAChC,IAAI,GAAG,KAAK,QAAQ;gBAAE,GAAG,GAAG,IAAI,CAAC;iBAC5B,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK;gBAAE,GAAG,GAAG,MAAM,CAAC;iBAClD,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK;gBAAE,GAAG,GAAG,KAAK,CAAC;;gBACjD,GAAG,GAAG,MAAM,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/F,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QACnG,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC;QACrD,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QACpE,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACxC,OAAO,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,qFAAqF;AACrF,SAAS,cAAc,CAAC,IAA0B;IAChD,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,iBAAiB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/G,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,sFAAsF;AACtF,SAAS,mBAAmB,CAC1B,EAAqB,EACrB,MAAmC;IAEnC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,SAAS;QACX,CAAC;QACD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;QACxD,MAAM,EAAE,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,IAAI,EAAE,KAAK,IAAI;YAAE,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;YAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,CAAC,MAA8B,EAAU,EAAE;QAChD,IAAI,CAAC,GAAG,WAAW,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;YAC9D,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,4EAA4E;AAC5E,SAAS,aAAa,CAAC,IAAc,EAAE,MAA8B;IACnE,MAAM,KAAK,GAA2B,EAAE,GAAG,MAAM,EAAE,CAAC;IACpD,MAAM,IAAI,GAAG,CAAC,OAAiB,EAAQ,EAAE;QACvC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC;gBAAE,OAAO;YAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;YAC1F,OAAO;QACT,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI;YAAE,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC;aAChE,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,gBAAgB,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5H,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAC3B,EAAqB;IAErB,IAAI,EAAE,CAAC,eAAe,KAAK,oBAAoB,IAAI,EAAE,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAChG,IAAI,iBAAiB,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACpE,MAAM,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC;IACzB,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC;IACvH,OAAO,CAAC,MAAM,EAAE,EAAE;QAChB,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;QACxE,CAAC;QACD,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;YACxD,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;QACrD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,MAAM,CAAC,GAAG,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,YAAY,CACnB,EAAqB;IAErB,MAAM,MAAM,GAAG,EAAE,CAAC,eAAe,KAAK,oBAAoB,CAAC,CAAC,CAAC,iBAAiB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACzG,MAAM,OAAO,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;QAClG,OAAO,mBAAmB,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;IACxC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC;IACzC,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,IAAI,EAAE,KAAK,IAAI;YAAE,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;YAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,QAAQ,GAAG,gCAAgC,CAAC,EAAE,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,EAAE,CAAC,eAAe,KAAK,aAAa,IAAI,MAAM,KAAK,SAAS,CAAC;IAC3E,OAAO,CAAC,MAA8B,EAAU,EAAE;QAChD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;YAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,GAAG,WAAW,CAAC;QACpB,IAAI,QAAQ,KAAK,SAAS;YAAE,CAAC,IAAI,QAAQ,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS;YAAE,CAAC,IAAI,MAAM,CAAC;QACtC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1C,MAAM,MAAM,GAAG,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACjD,IAAI,MAAM,KAAK,SAAS;oBAAE,CAAC,IAAI,MAAM,CAAC;YACxC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,kEAAkE;AAClE,SAAS,MAAM,CAAC,EAAqB;IACnC,MAAM,UAAU,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,MAAM,GAAa;QACvB,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI;QAChC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI;QAClC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG;QAC9B,UAAU;KACX,CAAC;IACF,MAAM,OAAO,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAe,EAAE,CAAC,WAAW,CAAC,SAAS;SACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;SACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC1E,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,UAAU,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,WAAW,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClG,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC;IACzC,OAAO;QACL,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,KAAK;QACX,KAAK,EAAE,EAAE,CAAC,IAAI;QACd,OAAO;QACP,MAAM;QACN,UAAU,EAAE,aAAa;QACzB,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1D,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,sBAAsB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjF,QAAQ,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE;QACnC,GAAG,CAAC,EAAE,CAAC,eAAe,KAAK,aAAa,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,SAAS;YACjF,CAAC,CAAC,EAAE,gBAAgB,EAAE,IAAa,EAAE;YACrC,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACjD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAS,GAAiC,mBAAmB;IAE7D,OAAO,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAA0B,gBAAgB,EAAE,CAAC","sourcesContent":["/**\n * Canonical-only graph — project the standard-physics L-layer\n * (`CANONICAL_EQUATIONS`) into the composition-graph edge vocabulary so the\n * discovery/analysis funnel (`upt discover` / `candidates` / `map`) can run on\n * established textbook physics ALONE, with the speculative bridge catalog\n * excluded.\n *\n * WHY this exists: `CATALOG_GRAPH` mixes established bridges with speculative\n * ones (the counts per status are NOTES.md's), so a `promising` discovery\n * there is polluted by speculation. Feeding ONLY canonical equations gives (a) a new-candidate\n * review surface motivated by textbook physics, and (b) a regression harness —\n * discovery on canonical-only must introduce no numerical contradiction\n * (standard physics, fed to the inference suite, stays self-consistent).\n *\n * DESIGN — parity with the bridge graph:\n *   - Universal constants (G, c, ℏ, k_B, ε₀, σ_sb, b, e) are BAKED INTO the\n *     evaluator, exactly as the catalog edges bake them — they are not graph\n *     nodes. This keeps the candidate proposer about physical OBSERVABLES and\n *     lets the numeric filter fire from the standard `{ mass }` anchor (an\n *     anchor cannot supply G/c/ℏ). A `governing` entry is a constant iff its\n *     name is registered in `CANONICAL_CONSTANT_SI`; everything else is a\n *     physical variable and becomes a source/target node.\n *   - Every canonical equation is `established` physics, so every edge is\n *     `confidence: 'established'` — the canonical graph IS the anchored core.\n *   - `kind: 'law'` (within-domain ground truth, not a cross-regime bridge);\n *     `beId: null` (not a catalog bridge). **Annotation-correctness note:**\n *     `toEdge` hardcodes `kind:'law'`; the attributes an edge carries do not\n *     decide its kind here. The attribute mapping is annotation-only; there\n *     is no edge-kind path and no delta to measure.\n *   - Evaluator: the dimensional MONOMIAL gives the power law over the variable\n *     sources, times the baked constant factor. A fully-quantitative scalar\n *     AST whose extra factors are a closed dimensionless coefficient\n *     (4π, ln 2, 8π/3, …) multiplies that coefficient on the Buckingham path,\n *     including a minus sign. The sourced prefactor table owns the factor\n *     for an AST that is intentionally constant-free, so that path does not\n *     multiply the AST coefficient again. A null monomial, or a dimensionless\n *     count, is evaluated from the AST, which already folded those leaves.\n *     A sourced prefactor from `canonicalPrefactor` multiplies as well. A dimensionless\n *     group in `CANONICAL_GROUP_PREFACTORS` multiplies only when that input is\n *     present (`√γ` for sound speed). Absent, a dimensional entry with no\n *     sourced prefactor returns no number. That table is\n *     outside this tree. `scalar-up-to-constant` is not a license to drop ½,\n *     2π, or 6π. A sourced 1 stays a value. A fully-quantitative dimensionless count (`N`,\n *     `1-e²`) is a source in `formulaFactors`, not a stub that drops the\n *     rest of the coefficient: the evaluator multiplies it, and a missing\n *     count does not return the count-free value. A `scalar-up-to-constant`\n *     stub (Jarzynski's log average) stays out of that list. A G-closure\n *     is not given a second constant here. Where\n *     dimensions cannot pin a monomial\n *     (`monomial: null`), a fully-quantitative product, quotient, or integer\n *     power is evaluated from that AST, so a numeric leaf (4, 6π, 8π) is not\n *     dropped and Newton's two same-dim masses still return G m₁ m₂ / r².\n *     A fully-quantitative sum or transcendental (Carnot, the first law, the\n *     Boltzmann factor) is evaluated from that same AST. A\n *     `scalar-up-to-constant` stub still carries a NaN evaluator;\n *     `retrodict` accepts only finite derivations, so it abstains on those\n *     rather than inventing a monomial or presenting the dropped ½ as the law.\n *\n * The public counterpart to `CATALOG_GRAPH` (the bridge-catalog graph): exported\n * from the package manifest and surfaced via the CLI's `--source=canonical`\n * flag on `discover` / `candidates` / `map`.\n *\n * @module composition/canonical-graph\n */\n\nimport { validityDomain, type BridgeEdge, type ValidityDomain } from './edge.js';\nimport type { Quantity, RegimeAttributes } from './quantity.js';\nimport { regimeAttributesOf } from './quantity.js';\nimport { AXES } from './axes.js';\nimport type { CanonicalEquation } from '../canonical/canonical-equation.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { applyCarrierSignPolicy } from '../bridges/carrier-sign.js';\nimport { CONSTANT_REGISTRY, CONSTANTS, isRegisteredConstant, piMultipleValue } from '../dimensional/symbolic-constants.js';\nimport { forEachScalarLeaf } from '../dimensional/ast-leaves.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport type { InformationMeasure } from '../core/types.js';\nimport { CHARGE, DIMENSIONLESS, MASS } from '../dimensional/types.js';\nimport { equals } from '../dimensional/algebra.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { CANONICAL_GROUP_PREFACTORS, canonicalGroupPrefactor, canonicalPrefactor } from './canonical-prefactors.js';\nimport { evalExpr } from './expr-eval.js';\nimport { monomialExponents } from './formula-shape.js';\n\n/** A universal constant a canonical `governing` list may name: SI value + dim. Named by the public `CANONICAL_CONSTANTS`. @public */\nexport interface ConstantDef {\n  readonly value: number;\n  readonly dim: Dimension;\n}\n\n/**\n * The universal constants a canonical `governing` list may name, under every\n * registered spelling, with SI value AND dimension: the canonical rows of the\n * constant registry. A governing entry is BAKED into the evaluator iff its\n * name AND dimension match an entry here; everything else is a physical\n * variable (a graph node). The dimension guard is load-bearing: it stops a\n * future same-named physical variable (e.g. orbital eccentricity `e`,\n * dimensionless) from being silently replaced by a constant of the same name.\n */\nexport const CANONICAL_CONSTANTS: Readonly<Record<string, ConstantDef>> = Object.fromEntries(\n  CONSTANT_REGISTRY.filter((row) => row.canonical).flatMap((row) =>\n    [row.name, ...row.spellings].map((spelling) => [spelling, { value: row.value, dim: row.dim }]),\n  ),\n);\n\n/**\n * Map camelCase `InformationMeasure` (from canonical regime) to kebab-case\n * `RegimeAttributes.information` (for composition graph).\n */\nconst INFO_MAP: Record<InformationMeasure, NonNullable<RegimeAttributes['information']>> = {\n  vonNeumann: 'von-neumann',\n  shannon: 'shannon',\n  kolmogorov: 'kolmogorov',\n  quantumDiscord: 'discord',\n};\n\n/** A governing entry is a baked constant iff its name AND dimension match. */\nconst constantValue = (name: string, dim: Dimension): number | null => {\n  const c = CANONICAL_CONSTANTS[name];\n  return c !== undefined && equals(c.dim, dim) ? c.value : null;\n};\n\n/**\n * Carry every registry axis the canonical regime states under the same\n * vocabulary (scale, force, symmetry), plus information through `INFO_MAP`,\n * whose spelling differs. `TensorIndices.topology` is a number, not a\n * `TopologyAxis`, and `dimension` is not a registry axis; neither is carried.\n * The result is checked against the registry, so a canonical regime value\n * outside an axis's value list is a load-time error, not an unstated axis.\n */\nfunction attributesOf(eq: CanonicalEquation): RegimeAttributes {\n  const stated: Record<string, string> = {};\n  for (const { name } of AXES) {\n    const value = (eq.regime as Readonly<Record<string, unknown>>)[name];\n    if (name === 'information' || typeof value !== 'string') continue;\n    stated[name] = value;\n  }\n  if (eq.regime.information) stated['information'] = INFO_MAP[eq.regime.information];\n  return regimeAttributesOf(stated, `canonical ${eq.id} regime`);\n}\n\nconst PERMISSIVE_DOMAIN: ValidityDomain = {\n  description: 'standard-physics regime (canonical L-layer)',\n  predicate: () => true,\n  violations: () => [],\n};\n\n/**\n * The validity domain of `eq`: its stated condition over the source names, or\n * the permissive domain when none is stated. An unbound name is a violation.\n */\nfunction domainOf(eq: CanonicalEquation, sourceNames: readonly string[]): ValidityDomain {\n  const text = eq.holds;\n  if (text === undefined) return PERMISSIVE_DOMAIN;\n  return validityDomain(text, sourceNames, sourceNames);\n}\n\n/** A registered or literal dimensionless number, or undefined when `name` is not one. */\nfunction dimensionlessLeaf(name: string): number | undefined {\n  const c = CONSTANTS[name];\n  if (c !== undefined && equals(c.dim, DIMENSIONLESS)) return c.value;\n  const pi = piMultipleValue(name);\n  if (pi !== undefined) return pi;\n  const n = Number(name);\n  return Number.isFinite(n) ? n : undefined;\n}\n\n/**\n * The dimensionless coefficient of a product or quotient. Dimensionful symbols\n * contribute 1 — the monomial evaluator already carries them. A sum, a\n * non-scalar arm, or a non-literal exponent is not a closed coefficient.\n */\nfunction dimensionlessCoefficient(node: ExprNode): number | undefined {\n  if (node.kind === 'symbol') {\n    const v = dimensionlessLeaf(node.name);\n    return v !== undefined ? v : 1;\n  }\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '*') {\n    let acc = 1;\n    for (const a of node.args) {\n      const c = dimensionlessCoefficient(a);\n      if (c === undefined) return undefined;\n      acc *= c;\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const n = dimensionlessCoefficient(node.args[0]!);\n    const d = dimensionlessCoefficient(node.args[1]!);\n    if (n === undefined || d === undefined || d === 0) return undefined;\n    return n / d;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const exp = node.args[1];\n    if (base === undefined || exp === undefined || exp.kind !== 'symbol') return undefined;\n    const e = Number(exp.name);\n    if (!Number.isFinite(e)) return undefined;\n    if (base.kind === 'symbol') {\n      const v = dimensionlessLeaf(base.name);\n      return v !== undefined ? Math.pow(v, e) : 1;\n    }\n    const inner = dimensionlessCoefficient(base);\n    return inner === undefined ? undefined : Math.pow(inner, e);\n  }\n  return undefined;\n}\n\n/** A symbol the coefficient walker would treat as 1 but that is not a constant or a governing name. */\nfunction hasUnresolvedStub(node: ExprNode, governing: ReadonlySet<string>): boolean {\n  if (node.kind === 'symbol') {\n    if (dimensionlessLeaf(node.name) !== undefined) return false;\n    if (governing.has(node.name)) return false;\n    if (isRegisteredConstant(node.name)) return false;\n    return true;\n  }\n  if (node.kind === 'op') return node.args.some((a) => hasUnresolvedStub(a, governing));\n  return true;\n}\n\n/**\n * The closed dimensionless factor a fully-quantitative AST records in front of\n * its dimensional monomial. `undefined` when there is nothing to multiply\n * (no AST, not fully quantitative, a stub, a sum, a factor of +1, or a factor\n * the sourced prefactor table already owns).\n */\nfunction recordedDimensionlessCoefficient(eq: CanonicalEquation): number | undefined {\n  if (eq.epistemicStatus !== 'fully-quantitative' || eq.scalarAst === undefined) return undefined;\n  // The table is the sourced multiplier for an AST that stays constant-free.\n  // Multiplying the AST as well would count that factor twice.\n  if (canonicalPrefactor(eq.id) !== undefined) return undefined;\n  const governing = new Set(eq.dimensional.governing.map((g) => g.name));\n  if (hasUnresolvedStub(eq.scalarAst, governing)) return undefined;\n  const c = dimensionlessCoefficient(eq.scalarAst);\n  if (c === undefined || !Number.isFinite(c) || c === 0) return undefined;\n  if (Math.abs(c - 1) < 1e-12) return undefined;\n  return c;\n}\n\n/**\n * Dimensionless counts a fully-quantitative AST multiplies in and Buckingham\n * cannot see. `scalar-up-to-constant` stays excluded: that stub is the\n * unfixed factor, not a required input.\n */\nfunction formulaFactorExponents(eq: CanonicalEquation): Record<string, number> {\n  if (eq.epistemicStatus !== 'fully-quantitative' || eq.scalarAst === undefined) return {};\n  const powers = monomialExponents(eq.scalarAst);\n  if (powers === undefined) return {};\n  const governing = new Set(eq.dimensional.governing.map((g) => g.name));\n  const dims = new Map<string, Dimension>();\n  forEachScalarLeaf(eq.scalarAst, (leaf) => dims.set(leaf.name, leaf.dim), {});\n  const factors: Record<string, number> = {};\n  for (const [name, exp] of powers) {\n    if (exp === 0) continue;\n    const dim = dims.get(name);\n    if (dim === undefined || !equals(dim, DIMENSIONLESS)) continue;\n    if (dimensionlessLeaf(name) !== undefined) continue;\n    if (governing.has(name) || isRegisteredConstant(name)) continue;\n    factors[name] = exp;\n  }\n  return factors;\n}\n\ntype InputParity = 'even' | 'odd' | 'neither' | 'absent';\n\n/**\n * Sign parity of `node` as a function of `name`. A product of two odd\n * factors is even. An absolute value is even. An even integer power is\n * even. A fractional power of an even subexpression stays even\n * (`√(q²)`), and a fractional power of an odd one is not a magnitude.\n */\nfunction inputParity(node: ExprNode, name: string): InputParity {\n  if (node.kind === 'symbol') return node.name === name ? 'odd' : 'absent';\n  if (node.kind === 'abs') {\n    const inner = inputParity(node.arg, name);\n    if (inner === 'absent' || inner === 'neither') return inner;\n    return 'even';\n  }\n  if (node.kind === 'transcendental' || node.kind === 'dirac-delta') {\n    const inner = inputParity(node.arg, name);\n    return inner === 'absent' ? 'absent' : 'neither';\n  }\n  if (node.kind !== 'op') return 'neither';\n  if (node.op === '+' || node.op === '-') {\n    const parts = node.args.map((arg) => inputParity(arg, name)).filter((p) => p !== 'absent');\n    if (parts.length === 0) return 'absent';\n    if (parts.some((p) => p === 'neither')) return 'neither';\n    if (parts.every((p) => p === 'even')) return 'even';\n    if (parts.every((p) => p === 'odd')) return 'odd';\n    return 'neither';\n  }\n  if (node.op === '*' || node.op === '/') {\n    let acc: InputParity = 'absent';\n    for (const arg of node.args) {\n      const part = inputParity(arg, name);\n      if (part === 'neither') return 'neither';\n      if (part === 'absent') continue;\n      if (acc === 'absent') acc = part;\n      else if (acc === 'odd' && part === 'odd') acc = 'even';\n      else if (acc === 'odd' || part === 'odd') acc = 'odd';\n      else acc = 'even';\n    }\n    return acc;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const expNode = node.args[1];\n    if (base === undefined || expNode === undefined || expNode.kind !== 'symbol') return 'neither';\n    const exp = Number(expNode.name);\n    const inner = inputParity(base, name);\n    if (!Number.isFinite(exp) || inner === 'neither') return inner === 'absent' ? 'absent' : 'neither';\n    if (inner === 'absent' || exp === 0) return 'absent';\n    if (Number.isInteger(exp) && Math.abs(exp) % 2 === 0) return 'even';\n    if (Number.isInteger(exp)) return inner;\n    return inner === 'even' ? 'even' : 'neither';\n  }\n  return 'neither';\n}\n\n/** Names whose scalar AST is an even function. A magnitude uses these absolutely. */\nfunction evenInputNames(node: ExprNode | undefined): ReadonlySet<string> {\n  if (node === undefined) return new Set();\n  const names = new Set<string>();\n  forEachScalarLeaf(node, (leaf) => names.add(leaf.name), { abs: true, transcendental: true, diracDelta: true });\n  const even = new Set<string>();\n  for (const name of names) {\n    if (inputParity(node, name) === 'even') even.add(name);\n  }\n  return even;\n}\n\n/** Evaluate a fully-quantitative monomial AST, including its dimensionless counts. */\nfunction evaluateAstMonomial(\n  eq: CanonicalEquation,\n  powers: ReadonlyMap<string, number>,\n): (inputs: Record<string, number>) => number {\n  const dimByName = new Map(eq.dimensional.governing.map((g) => [g.name, g.dim]));\n  let constFactor = 1;\n  const varExps: Array<[string, number]> = [];\n  for (const [name, exp] of powers) {\n    if (exp === 0) continue;\n    const leaf = dimensionlessLeaf(name);\n    if (leaf !== undefined) {\n      constFactor *= Math.pow(leaf, exp);\n      continue;\n    }\n    const dim = dimByName.get(name) ?? CONSTANTS[name]?.dim;\n    const cv = dim !== undefined ? constantValue(name, dim) : null;\n    if (cv !== null) constFactor *= Math.pow(cv, exp);\n    else varExps.push([name, exp]);\n  }\n  return (inputs: Record<string, number>): number => {\n    let v = constFactor;\n    for (const [name, exp] of varExps) {\n      const x = inputs[name];\n      if (x === undefined || !Number.isFinite(x)) return Number.NaN;\n      v *= Math.pow(x, exp);\n    }\n    return v;\n  };\n}\n\n/** Numeric literal symbols (`1`, `-1`) the monomial path already folded. */\nfunction literalInputs(node: ExprNode, inputs: Record<string, number>): Record<string, number> {\n  const scope: Record<string, number> = { ...inputs };\n  const walk = (current: ExprNode): void => {\n    if (current.kind === 'symbol') {\n      if (Object.hasOwn(scope, current.name)) return;\n      const numeric = Number(current.name);\n      if (current.name.trim() !== '' && Number.isFinite(numeric)) scope[current.name] = numeric;\n      return;\n    }\n    if (current.kind === 'op') for (const arg of current.args) walk(arg);\n    else if (current.kind === 'abs' || current.kind === 'transcendental' || current.kind === 'dirac-delta') walk(current.arg);\n  };\n  walk(node);\n  return scope;\n}\n\n/**\n * A fully-quantitative sum or transcendental. The monomial exponent walk\n * cannot see it. `scalar-up-to-constant` stays out: that status dropped a\n * factor, and the AST is not the law.\n */\nfunction evaluateClosedScalar(\n  eq: CanonicalEquation,\n): ((inputs: Record<string, number>) => number) | undefined {\n  if (eq.epistemicStatus !== 'fully-quantitative' || eq.scalarAst === undefined) return undefined;\n  if (monomialExponents(eq.scalarAst) !== undefined) return undefined;\n  const ast = eq.scalarAst;\n  const required = eq.dimensional.governing.filter((governing) => constantValue(governing.name, governing.dim) === null);\n  return (inputs) => {\n    for (const governing of required) {\n      const value = inputs[governing.name];\n      if (value === undefined || !Number.isFinite(value)) return Number.NaN;\n    }\n    try {\n      const value = evalExpr(ast, literalInputs(ast, inputs));\n      return Number.isFinite(value) ? value : Number.NaN;\n    } catch {\n      return Number.NaN;\n    }\n  };\n}\n\n/**\n * Build the evaluator for one canonical equation, keyed by its VARIABLE source\n * names. Variables carry the monomial exponent from `inputs`; constants\n * contribute a fixed baked factor. A fully-quantitative monomial multiplies\n * its recorded dimensionless coefficient when the sourced table does not\n * already own that factor, and multiplies the sourced table prefactor.\n * A fully-quantitative AST that names a dimensionless count, or whose\n * Buckingham monomial is null, is evaluated from that AST so the count and\n * the numeric leaves (6π) are not dropped. A fully-quantitative sum or\n * transcendental is evaluated from that AST too. The edge applies the sign policy\n * once before this function: an input the AST is even in is an absolute\n * value, and a product odd in both charge and mobility rejects opposite\n * signs. This function does not do that again.\n * Returns NaN when the monomial is null and the AST is not a fully-quantitative\n * closed form, and when a dimensional coefficient is unset and its group is unbound.\n * `retrodict` then abstains.\n */\nfunction makeEvaluate(\n  eq: CanonicalEquation,\n): (inputs: Record<string, number>) => number {\n  const powers = eq.epistemicStatus === 'fully-quantitative' ? monomialExponents(eq.scalarAst) : undefined;\n  const factors = formulaFactorExponents(eq);\n  if (powers !== undefined && (Object.keys(factors).length > 0 || eq.dimensional.monomial === null)) {\n    return evaluateAstMonomial(eq, powers);\n  }\n  const closed = evaluateClosedScalar(eq);\n  if (closed !== undefined) return closed;\n  const monomial = eq.dimensional.monomial;\n  if (monomial === null) return () => NaN;\n  const dimByName = new Map(eq.dimensional.governing.map((g) => [g.name, g.dim]));\n  let constFactor = 1;\n  const varExps: Array<[string, number]> = [];\n  for (const [name, exp] of Object.entries(monomial)) {\n    const dim = dimByName.get(name);\n    const cv = dim !== undefined ? constantValue(name, dim) : null;\n    if (cv !== null) constFactor *= Math.pow(cv, exp);\n    else varExps.push([name, exp]);\n  }\n  const recorded = recordedDimensionlessCoefficient(eq);\n  const tabled = canonicalPrefactor(eq.id);\n  const group = CANONICAL_GROUP_PREFACTORS.find((p) => p.id === eq.id);\n  const unset = eq.epistemicStatus === 'dimensional' && tabled === undefined;\n  return (inputs: Record<string, number>): number => {\n    if (unset) {\n      if (group === undefined) return Number.NaN;\n      const bound = inputs[group.group];\n      if (bound === undefined || !Number.isFinite(bound)) return Number.NaN;\n    }\n    let v = constFactor;\n    if (recorded !== undefined) v *= recorded;\n    if (tabled !== undefined) v *= tabled;\n    if (group !== undefined) {\n      const g = inputs[group.group];\n      if (g !== undefined && Number.isFinite(g)) {\n        const factor = canonicalGroupPrefactor(eq.id, g);\n        if (factor !== undefined) v *= factor;\n      }\n    }\n    for (const [name, exp] of varExps) {\n      const x = inputs[name];\n      v *= Math.pow(x === undefined ? Number.NaN : x, exp);\n    }\n    return v;\n  };\n}\n\n/** Project one canonical equation to a composition-graph edge. */\nfunction toEdge(eq: CanonicalEquation): BridgeEdge {\n  const attributes = attributesOf(eq);\n  const target: Quantity = {\n    name: eq.dimensional.target.name,\n    symbol: eq.dimensional.target.name,\n    dim: eq.dimensional.target.dim,\n    attributes,\n  };\n  const factors = formulaFactorExponents(eq);\n  const sources: Quantity[] = eq.dimensional.governing\n    .filter((g) => constantValue(g.name, g.dim) === null)\n    .map((g) => ({ name: g.name, symbol: g.name, dim: g.dim, attributes }));\n  for (const name of Object.keys(factors)) {\n    sources.push({ name, symbol: name, dim: DIMENSIONLESS, attributes });\n  }\n  const evaluateRaw = makeEvaluate(eq);\n  const even = evenInputNames(eq.scalarAst);\n  const evenInputs = sources.filter((source) => even.has(source.name)).map((source) => source.name);\n  const monomial = eq.dimensional.monomial;\n  return {\n    id: eq.id,\n    beId: null,\n    kind: 'law',\n    label: eq.name,\n    sources,\n    target,\n    confidence: 'established',\n    domain: domainOf(eq, sources.map((source) => source.name)),\n    evaluate: (inputs) => evaluateRaw(applyCarrierSignPolicy(monomial, inputs, even)),\n    citation: eq.references[0] ?? eq.id,\n    ...(eq.epistemicStatus === 'dimensional' && canonicalPrefactor(eq.id) === undefined\n      ? { coefficientUnset: true as const }\n      : {}),\n    ...(Object.keys(factors).length > 0 ? { formulaFactors: factors } : {}),\n    ...(evenInputs.length > 0 ? { evenInputs } : {}),\n  };\n}\n\n/**\n * Project canonical equations into composition-graph edges (defaults to the\n * full registry). See the module docstring for the modelling decisions.\n *\n * @public\n */\nexport function canonicalToEdges(\n  equations: readonly CanonicalEquation[] = CANONICAL_EQUATIONS,\n): BridgeEdge[] {\n  return equations.map(toEdge);\n}\n\n/**\n * The standard-physics composition graph: every canonical equation as an\n * `established` `law` edge. The bridge-free counterpart to `CATALOG_GRAPH`.\n *\n * @public\n */\nexport const CANONICAL_GRAPH: readonly BridgeEdge[] = canonicalToEdges();\n"]}

package/dist/composition/consequence.d.ts

@@ -14,9 +14,15 @@
 import type { VettedCandidate } from './discovery.js';
 import type { ProposedBridge } from './proposed-bridges.js';
 import type { CanonicalEquation } from '../canonical/canonical-equation.js';
-/** @public */
+/**
+ * The consequence signal of a promising candidate: entailed, novel-consequence or inconclusive.
+ * @public
+ */
 export type ConsequenceSignal = 'entailed' | 'novel-consequence' | 'inconclusive';
-/** @public */
+/**
+ * The evidence behind one consequence signal: the derived claim and any canonical match.
+ * @public
+ */
 export interface ConsequenceEvidence {
     readonly target: string;
     readonly governing: readonly string[];
@@ -25,7 +31,10 @@ export interface ConsequenceEvidence {
     readonly canonicalMatch: string | null;
     readonly sourceEquationIds: readonly [string, string];
 }
-/** @public */
+/**
+ * A vetted candidate, plus its optional consequence signal and evidence.
+ * @public
+ */
 export type ConsequenceAnnotatedCandidate = VettedCandidate & {
     readonly consequence?: {
         readonly signal: ConsequenceSignal;
@@ -84,8 +93,9 @@ type ClaimEquation = Pick<CanonicalEquation, 'id' | 'name' | 'assumptions' | 'sc
 export declare function describeDerivedClaim(proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>, canonical?: readonly ClaimEquation[]): DerivedClaim;
 /**
  * Annotate ranked candidates with their consequence signal. Order-preserving,
- * 1:1 with the input; only `promising` candidates are classified (they are the
- * only ones `deriveProposedBridges` processes). A promising candidate with no
+ * 1:1 with the input; only candidates in a promising tier (`promising` or
+ * `promising-unchecked`) are classified (they are the only ones
+ * `deriveProposedBridges` processes). A promising candidate with no
  * derived proposal is `inconclusive`. Generic over the input candidate type so
  * it composes with other post-pass annotators (e.g. `annotateAdjudications`)
  * without forgetting fields the caller already attached.

package/dist/composition/consequence.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"consequence.d.ts","sourceRoot":"","sources":["../../src/composition/consequence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAI5D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAE5E,cAAc;AACd,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG,mBAAmB,GAAG,cAAc,CAAC;AAElF,cAAc;AACd,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,0EAA0E;IAC1E,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACvD;AAED,cAAc;AACd,MAAM,MAAM,6BAA6B,GAAG,eAAe,GAAG;IAC5D,QAAQ,CAAC,WAAW,CAAC,EAAE;QACrB,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;QACnC,QAAQ,CAAC,QAAQ,EAAE,SAAS,mBAAmB,EAAE,CAAC;KACnD,CAAC;CACH,CAAC;AASF;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,IAAI,CAAC,cAAc,EAAE,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,aAAa,CAAC,EACpF,SAAS,GAAE,SAAS,iBAAiB,EAAwB,GAC5D;IAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,iBAAiB,EAAE,cAAc,CAAC,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,mBAAmB,CAAA;CAAE,CAsBzG;AAED;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,8DAA8D;IAC9D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,2GAA2G;IAC3G,QAAQ,CAAC,QAAQ,EAAE,WAAW,GAAG,sBAAsB,CAAC;IACxD,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;IACpG,QAAQ,CAAC,WAAW,EAAE,SAAS;QAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACxG,QAAQ,CAAC,cAAc,EAAE;QACvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;QAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;QACxC,QAAQ,CAAC,KAAK,EAAE,6BAA6B,CAAC;KAC/C,CAAC;CACH;AAED,KAAK,aAAa,GAAG,IAAI,CAAC,iBAAiB,EAAE,IAAI,GAAG,MAAM,GAAG,aAAa,GAAG,WAAW,CAAC,GAAG;IAC1F,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,EAAE,QAAQ,GAAG,WAAW,CAAC,CAAC;CACtF,CAAC;AAEF;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,IAAI,CAAC,cAAc,EAAE,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,aAAa,CAAC,EACpF,SAAS,GAAE,SAAS,aAAa,EAAwB,GACxD,YAAY,CA4Cd;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,eAAe,EAC5D,UAAU,EAAE,SAAS,CAAC,EAAE,GACvB,SAAS,CAAC,CAAC,GAAG;IACf,QAAQ,CAAC,WAAW,CAAC,EAAE;QACrB,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;QACnC,QAAQ,CAAC,QAAQ,EAAE,SAAS,mBAAmB,EAAE,CAAC;KACnD,CAAC;CACH,CAAC,EAAE,CA0BH"}
+{"version":3,"file":"consequence.d.ts","sourceRoot":"","sources":["../../src/composition/consequence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAI5D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAE5E;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG,mBAAmB,GAAG,cAAc,CAAC;AAElF;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,0EAA0E;IAC1E,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACvD;AAED;;;GAGG;AACH,MAAM,MAAM,6BAA6B,GAAG,eAAe,GAAG;IAC5D,QAAQ,CAAC,WAAW,CAAC,EAAE;QACrB,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;QACnC,QAAQ,CAAC,QAAQ,EAAE,SAAS,mBAAmB,EAAE,CAAC;KACnD,CAAC;CACH,CAAC;AASF;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,IAAI,CAAC,cAAc,EAAE,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,aAAa,CAAC,EACpF,SAAS,GAAE,SAAS,iBAAiB,EAAwB,GAC5D;IAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,iBAAiB,EAAE,cAAc,CAAC,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,mBAAmB,CAAA;CAAE,CAsBzG;AAED;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,8DAA8D;IAC9D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,2GAA2G;IAC3G,QAAQ,CAAC,QAAQ,EAAE,WAAW,GAAG,sBAAsB,CAAC;IACxD,kEAAkE;IAClE,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;IACpG,QAAQ,CAAC,WAAW,EAAE,SAAS;QAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACxG,QAAQ,CAAC,cAAc,EAAE;QACvB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;QAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;QACxC,QAAQ,CAAC,KAAK,EAAE,6BAA6B,CAAC;KAC/C,CAAC;CACH;AAED,KAAK,aAAa,GAAG,IAAI,CAAC,iBAAiB,EAAE,IAAI,GAAG,MAAM,GAAG,aAAa,GAAG,WAAW,CAAC,GAAG;IAC1F,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,EAAE,QAAQ,GAAG,WAAW,CAAC,CAAC;CACtF,CAAC;AAEF;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,IAAI,CAAC,cAAc,EAAE,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,aAAa,CAAC,EACpF,SAAS,GAAE,SAAS,aAAa,EAAwB,GACxD,YAAY,CA4Cd;AAED;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,eAAe,EAC5D,UAAU,EAAE,SAAS,CAAC,EAAE,GACvB,SAAS,CAAC,CAAC,GAAG;IACf,QAAQ,CAAC,WAAW,CAAC,EAAE;QACrB,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;QACnC,QAAQ,CAAC,QAAQ,EAAE,SAAS,mBAAmB,EAAE,CAAC;KACnD,CAAC;CACH,CAAC,EAAE,CA0BH"}

package/dist/composition/consequence.js

@@ -1,3 +1,4 @@
+import { isPromisingTier } from './discovery.js';
 import { deriveProposedBridges } from './proposed-bridges.js';
 import { normalForm } from '../canonical/normal-form.js';
 import { CANONICAL_EQUATIONS } from '../canonical/registry.js';
@@ -90,15 +91,16 @@ export function describeDerivedClaim(proposal, canonical = CANONICAL_EQUATIONS)
 }
 /**
  * Annotate ranked candidates with their consequence signal. Order-preserving,
- * 1:1 with the input; only `promising` candidates are classified (they are the
- * only ones `deriveProposedBridges` processes). A promising candidate with no
+ * 1:1 with the input; only candidates in a promising tier (`promising` or
+ * `promising-unchecked`) are classified (they are the only ones
+ * `deriveProposedBridges` processes). A promising candidate with no
  * derived proposal is `inconclusive`. Generic over the input candidate type so
  * it composes with other post-pass annotators (e.g. `annotateAdjudications`)
  * without forgetting fields the caller already attached.
  * @public
  */
 export function annotateConsequences(candidates) {
-    const promising = candidates.filter((c) => c.verdict === 'promising');
+    const promising = candidates.filter((c) => isPromisingTier(c.verdict));
     const proposals = deriveProposedBridges(promising);
     // Group proposals + their classification by the sorted candidate-pair key.
     const byPair = new Map();
@@ -117,7 +119,7 @@ export function annotateConsequences(candidates) {
         }
     }
     return candidates.map((c) => {
-        if (c.verdict !== 'promising')
+        if (!isPromisingTier(c.verdict))
             return c;
         const key = [c.a, c.b].sort().join('~');
         const hit = byPair.get(key);

package/dist/composition/consequence.js.map

@@ -1 +1 @@
-{"version":3,"file":"consequence.js","sourceRoot":"","sources":["../../src/composition/consequence.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAwB/D,uDAAuD;AACvD,SAAS,aAAa,CAAC,CAA8B,EAAE,CAA8B;IACnF,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAoF,EACpF,SAAS,GAAiC,mBAAmB;IAE7D,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,cAAc,GAAkB,IAAI,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC,SAAS;YAAE,SAAS;QAC5B,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAClE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC;YAAE,SAAS;QAC3E,IAAI,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;YAC3C,cAAc,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,uEAAuE;YAC/F,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,mBAAmB;QACzD,QAAQ,EAAE;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI;YAC5B,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAChD,iBAAiB,EAAE,SAAS;YAC5B,cAAc;YACd,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAAC,iBAAiB;SAC1D;KACF,CAAC;AACJ,CAAC;AA8BD;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAoF,EACpF,SAAS,GAA6B,mBAAmB;IAEzD,MAAM,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC;IAC9E,uEAAuE;IACvE,4EAA4E;IAC5E,2EAA2E;IAC3E,sEAAsE;IACtE,oDAAoD;IACpD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7D,MAAM,UAAU,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,iBAAiB;SAC9B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAsB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,MAAM,GAAG,IAAI,EAAE,EAAE,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;IAE1E,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9G,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IACrG,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,SAAU,CAAC,KAAK,SAAS,CAAC,CAAC;IAE1E,OAAO;QACL,OAAO,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE;QACpD,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,sBAAsB;QACtD,MAAM,EAAE,KAAK;QACb,MAAM,EAAE;YACN,IAAI,EAAE,SAAS;YACf,YAAY,EAAE,MAAM;YACpB,OAAO,EACL,GAAG,SAAS,WAAW,SAAS,OAAO,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,SAAS,aAAa;gBAC1H,GAAG,UAAU,WAAW,WAAW,KAAK,OAAO,gBAAgB,cAAc,CAAC,GAAG,UAAU;gBAC3F,OAAO,WAAW,wBAAwB,SAAS,EAAE;SACxD;QACD,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACtF,cAAc,EAAE;YACd,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,IAAI;YACrB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,sBAAsB,EAAE,OAAO,CAAC,MAAM;YACtC,KAAK,EAAE,6BAA6B;SACrC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAwB;IAOxB,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,WAAW,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAEnD,2EAA2E;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0E,CAAC;IACjG,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,MAAM,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,+FAA+F;YAC/F,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU;gBAAE,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC;QACzD,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,CAAC,OAAO,KAAK,WAAW;YAAE,OAAO,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAsB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC;QACpE,OAAO,EAAE,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Consequence propagation — the machine pre-classifier for the human\n * adjudication ledger. A POST-PASS annotation over ranked candidates (mirrors\n * `annotateAdjudications`): reuse `deriveProposedBridges` to derive each\n * promising candidate's monomial consequence, then compare its `normalForm`\n * against the canonical registry (SAME target AND SAME governing set) to label\n * it `entailed` (re-derives known physics), `novel-consequence` (valid, no\n * match), or `inconclusive` (no monomial consequence). Annotation-only: never\n * mutates the catalog/graph, never re-orders or re-scores, never writes to\n * ADJUDICATIONS. The underlying ProposedBridge stays `status:'unadjudicated'`.\n *\n * @module composition/consequence\n */\nimport type { VettedCandidate } from './discovery.js';\nimport type { ProposedBridge } from './proposed-bridges.js';\nimport { deriveProposedBridges } from './proposed-bridges.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport type { CanonicalEquation } from '../canonical/canonical-equation.js';\n\n/** @public */\nexport type ConsequenceSignal = 'entailed' | 'novel-consequence' | 'inconclusive';\n\n/** @public */\nexport interface ConsequenceEvidence {\n  readonly target: string;\n  readonly governing: readonly string[];\n  readonly derivedNormalForm: string;\n  /** The id of the canonical equation whose normalForm matched, or null. */\n  readonly canonicalMatch: string | null;\n  readonly sourceEquationIds: readonly [string, string];\n}\n\n/** @public */\nexport type ConsequenceAnnotatedCandidate = VettedCandidate & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n};\n\n/** Governing-name set equality (order-insensitive). */\nfunction sameGoverning(a: readonly { name: string }[], b: readonly { name: string }[]): boolean {\n  if (a.length !== b.length) return false;\n  const sa = new Set(a.map((g) => g.name));\n  return b.every((g) => sa.has(g.name));\n}\n\n/**\n * Classify ONE derived proposal against the canonical registry.\n * `entailed` iff some canonical equation with a `scalarAst` has the SAME target\n * name AND SAME governing set AND a matching `normalForm`. Otherwise\n * `novel-consequence`. There is NO contradiction signal — a differing normalForm\n * for the same target is NOT a contradiction (design r2: E=mc² vs E=hf).\n * @public\n */\nexport function classifyProposal(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly CanonicalEquation[] = CANONICAL_EQUATIONS,\n): { readonly signal: Exclude<ConsequenceSignal, 'inconclusive'>; readonly evidence: ConsequenceEvidence } {\n  const derivedNF = normalForm(proposal.scalarAst);\n  let canonicalMatch: string | null = null;\n  for (const ce of canonical) {\n    if (!ce.scalarAst) continue;\n    if (ce.dimensional.target.name !== proposal.target.name) continue;\n    if (!sameGoverning(ce.dimensional.governing, proposal.governing)) continue;\n    if (normalForm(ce.scalarAst) === derivedNF) {\n      canonicalMatch = ce.id; // CanonicalEquation.id is a top-level `readonly id: string` (verified)\n      break;\n    }\n  }\n  return {\n    signal: canonicalMatch ? 'entailed' : 'novel-consequence',\n    evidence: {\n      target: proposal.target.name,\n      governing: proposal.governing.map((g) => g.name),\n      derivedNormalForm: derivedNF,\n      canonicalMatch,\n      sourceEquationIds: proposal.derivedFrom.sourceEquationIds,\n    },\n  };\n}\n\n/**\n * What a derived proposal claims, in a form that travels with it: the premise,\n * whether it is a known law or a conditional identity, what the solved-for\n * symbol means, the source equations' assumptions, and the exact scope of the\n * canonical-match check.\n * @internal\n */\nexport interface DerivedClaim {\n  /** The unadjudicated identification the relation rests on. */\n  readonly premise: string;\n  /** `known-law`: re-derives a registry equation. `conditional-identity`: holds only if the premise does. */\n  readonly relation: 'known-law' | 'conditional-identity';\n  /** No derived proposal has been confronted with a measurement. */\n  readonly tested: false;\n  readonly symbol: { readonly name: string; readonly fromEquation: string; readonly meaning: string };\n  readonly assumptions: readonly { readonly equation: string; readonly assumptions: readonly string[] }[];\n  readonly canonicalMatch: {\n    readonly id: string | null;\n    readonly sameTarget: number;\n    readonly sameTargetAndGoverning: number;\n    readonly scope: 'the canonical registry only';\n  };\n}\n\ntype ClaimEquation = Pick<CanonicalEquation, 'id' | 'name' | 'assumptions' | 'scalarAst'> & {\n  readonly dimensional: Pick<CanonicalEquation['dimensional'], 'target' | 'governing'>;\n};\n\n/**\n * Describe the claim a derived proposal makes. Pure; the proposal is unchanged.\n * @internal\n */\nexport function describeDerivedClaim(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly ClaimEquation[] = CANONICAL_EQUATIONS,\n): DerivedClaim {\n  const { identification, sourceEquationIds, solvedFor } = proposal.derivedFrom;\n  // `deriveProposedBridges` resolves the first source id for the smaller\n  // endpoint name and the second for the larger, so each id's target is known\n  // even when the source is a catalog bridge the canonical registry does not\n  // hold (then `canonical.find` is undefined; the sentence once printed\n  // \"equals ? (undefined)\" there, 9.0.0 audit §7 T1).\n  const [t0, t1] = [identification.a, identification.b].sort();\n  const endpointOf = (id: string): string => (id === sourceEquationIds[0] ? t0 : t1);\n  const sources = sourceEquationIds\n    .map((id) => canonical.find((e) => e.id === id))\n    .filter((e): e is ClaimEquation => e !== undefined);\n  const home = sources.find((e) => e.dimensional.governing.some((g) => g.name === solvedFor)) ?? sources[0];\n  const homeId = home?.id ?? sourceEquationIds[0];\n  const otherId = sourceEquationIds.find((id) => id !== homeId) ?? sourceEquationIds[1];\n  const other = sources.find((e) => e.id === otherId);\n  const homeTarget = home?.dimensional.target.name ?? endpointOf(homeId);\n  const otherTarget = other?.dimensional.target.name ?? endpointOf(otherId);\n\n  const derivedNF = normalForm(proposal.scalarAst);\n  const sameTarget = canonical.filter((e) => e.scalarAst && e.dimensional.target.name === proposal.target.name);\n  const sameGov = sameTarget.filter((e) => sameGoverning(e.dimensional.governing, proposal.governing));\n  const match = sameGov.find((e) => normalForm(e.scalarAst!) === derivedNF);\n\n  return {\n    premise: `${identification.a} ≡ ${identification.b}`,\n    relation: match ? 'known-law' : 'conditional-identity',\n    tested: false,\n    symbol: {\n      name: solvedFor,\n      fromEquation: homeId,\n      meaning:\n        `${solvedFor} is the ${solvedFor} of ${homeId}${home !== undefined ? ` (${home.name})` : ''}: the ${solvedFor} for which ` +\n        `${homeTarget} equals ${otherTarget} (${otherId}) — an equal-${identification.dim} scale; ` +\n        `the ${otherTarget} side is not given a ${solvedFor}`,\n    },\n    assumptions: sources.map((e) => ({ equation: e.id, assumptions: [...e.assumptions] })),\n    canonicalMatch: {\n      id: match?.id ?? null,\n      sameTarget: sameTarget.length,\n      sameTargetAndGoverning: sameGov.length,\n      scope: 'the canonical registry only',\n    },\n  };\n}\n\n/**\n * Annotate ranked candidates with their consequence signal. Order-preserving,\n * 1:1 with the input; only `promising` candidates are classified (they are the\n * only ones `deriveProposedBridges` processes). A promising candidate with no\n * derived proposal is `inconclusive`. Generic over the input candidate type so\n * it composes with other post-pass annotators (e.g. `annotateAdjudications`)\n * without forgetting fields the caller already attached.\n * @public\n */\nexport function annotateConsequences<T extends VettedCandidate>(\n  candidates: readonly T[],\n): readonly (T & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n})[] {\n  const promising = candidates.filter((c) => c.verdict === 'promising');\n  const proposals = deriveProposedBridges(promising);\n\n  // Group proposals + their classification by the sorted candidate-pair key.\n  const byPair = new Map<string, { signal: ConsequenceSignal; evidence: ConsequenceEvidence[] }>();\n  for (const p of proposals) {\n    const key = [p.derivedFrom.identification.a, p.derivedFrom.identification.b].sort().join('~');\n    const cls = classifyProposal(p);\n    const cur = byPair.get(key);\n    if (!cur) {\n      byPair.set(key, { signal: cls.signal, evidence: [cls.evidence] });\n    } else {\n      cur.evidence.push(cls.evidence);\n      // entailed dominates novel: if ANY consequence re-derives known physics, the pair is entailed.\n      if (cls.signal === 'entailed') cur.signal = 'entailed';\n    }\n  }\n\n  return candidates.map((c) => {\n    if (c.verdict !== 'promising') return c;\n    const key = [c.a, c.b].sort().join('~');\n    const hit = byPair.get(key);\n    const signal: ConsequenceSignal = hit ? hit.signal : 'inconclusive';\n    return { ...c, consequence: { signal, evidence: hit?.evidence ?? [] } };\n  });\n}\n"]}
+{"version":3,"file":"consequence.js","sourceRoot":"","sources":["../../src/composition/consequence.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAiC/D,uDAAuD;AACvD,SAAS,aAAa,CAAC,CAA8B,EAAE,CAA8B;IACnF,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAoF,EACpF,SAAS,GAAiC,mBAAmB;IAE7D,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,cAAc,GAAkB,IAAI,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC,SAAS;YAAE,SAAS;QAC5B,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAClE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC;YAAE,SAAS;QAC3E,IAAI,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;YAC3C,cAAc,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,uEAAuE;YAC/F,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,mBAAmB;QACzD,QAAQ,EAAE;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI;YAC5B,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAChD,iBAAiB,EAAE,SAAS;YAC5B,cAAc;YACd,iBAAiB,EAAE,QAAQ,CAAC,WAAW,CAAC,iBAAiB;SAC1D;KACF,CAAC;AACJ,CAAC;AA8BD;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAoF,EACpF,SAAS,GAA6B,mBAAmB;IAEzD,MAAM,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC;IAC9E,uEAAuE;IACvE,4EAA4E;IAC5E,2EAA2E;IAC3E,sEAAsE;IACtE,oDAAoD;IACpD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7D,MAAM,UAAU,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,iBAAiB;SAC9B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAsB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,MAAM,GAAG,IAAI,EAAE,EAAE,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IACpD,MAAM,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;IAE1E,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9G,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IACrG,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,SAAU,CAAC,KAAK,SAAS,CAAC,CAAC;IAE1E,OAAO;QACL,OAAO,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE;QACpD,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,sBAAsB;QACtD,MAAM,EAAE,KAAK;QACb,MAAM,EAAE;YACN,IAAI,EAAE,SAAS;YACf,YAAY,EAAE,MAAM;YACpB,OAAO,EACL,GAAG,SAAS,WAAW,SAAS,OAAO,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,SAAS,aAAa;gBAC1H,GAAG,UAAU,WAAW,WAAW,KAAK,OAAO,gBAAgB,cAAc,CAAC,GAAG,UAAU;gBAC3F,OAAO,WAAW,wBAAwB,SAAS,EAAE;SACxD;QACD,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACtF,cAAc,EAAE;YACd,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,IAAI;YACrB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,sBAAsB,EAAE,OAAO,CAAC,MAAM;YACtC,KAAK,EAAE,6BAA6B;SACrC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAwB;IAOxB,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACvE,MAAM,SAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAEnD,2EAA2E;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0E,CAAC;IACjG,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9F,MAAM,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,+FAA+F;YAC/F,IAAI,GAAG,CAAC,MAAM,KAAK,UAAU;gBAAE,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC;QACzD,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,OAAO,CAAC;YAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAsB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC;QACpE,OAAO,EAAE,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * Consequence propagation — the machine pre-classifier for the human\n * adjudication ledger. A POST-PASS annotation over ranked candidates (mirrors\n * `annotateAdjudications`): reuse `deriveProposedBridges` to derive each\n * promising candidate's monomial consequence, then compare its `normalForm`\n * against the canonical registry (SAME target AND SAME governing set) to label\n * it `entailed` (re-derives known physics), `novel-consequence` (valid, no\n * match), or `inconclusive` (no monomial consequence). Annotation-only: never\n * mutates the catalog/graph, never re-orders or re-scores, never writes to\n * ADJUDICATIONS. The underlying ProposedBridge stays `status:'unadjudicated'`.\n *\n * @module composition/consequence\n */\nimport type { VettedCandidate } from './discovery.js';\nimport { isPromisingTier } from './discovery.js';\nimport type { ProposedBridge } from './proposed-bridges.js';\nimport { deriveProposedBridges } from './proposed-bridges.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport type { CanonicalEquation } from '../canonical/canonical-equation.js';\n\n/**\n * The consequence signal of a promising candidate: entailed, novel-consequence or inconclusive.\n * @public\n */\nexport type ConsequenceSignal = 'entailed' | 'novel-consequence' | 'inconclusive';\n\n/**\n * The evidence behind one consequence signal: the derived claim and any canonical match.\n * @public\n */\nexport interface ConsequenceEvidence {\n  readonly target: string;\n  readonly governing: readonly string[];\n  readonly derivedNormalForm: string;\n  /** The id of the canonical equation whose normalForm matched, or null. */\n  readonly canonicalMatch: string | null;\n  readonly sourceEquationIds: readonly [string, string];\n}\n\n/**\n * A vetted candidate, plus its optional consequence signal and evidence.\n * @public\n */\nexport type ConsequenceAnnotatedCandidate = VettedCandidate & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n};\n\n/** Governing-name set equality (order-insensitive). */\nfunction sameGoverning(a: readonly { name: string }[], b: readonly { name: string }[]): boolean {\n  if (a.length !== b.length) return false;\n  const sa = new Set(a.map((g) => g.name));\n  return b.every((g) => sa.has(g.name));\n}\n\n/**\n * Classify ONE derived proposal against the canonical registry.\n * `entailed` iff some canonical equation with a `scalarAst` has the SAME target\n * name AND SAME governing set AND a matching `normalForm`. Otherwise\n * `novel-consequence`. There is NO contradiction signal — a differing normalForm\n * for the same target is NOT a contradiction (design r2: E=mc² vs E=hf).\n * @public\n */\nexport function classifyProposal(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly CanonicalEquation[] = CANONICAL_EQUATIONS,\n): { readonly signal: Exclude<ConsequenceSignal, 'inconclusive'>; readonly evidence: ConsequenceEvidence } {\n  const derivedNF = normalForm(proposal.scalarAst);\n  let canonicalMatch: string | null = null;\n  for (const ce of canonical) {\n    if (!ce.scalarAst) continue;\n    if (ce.dimensional.target.name !== proposal.target.name) continue;\n    if (!sameGoverning(ce.dimensional.governing, proposal.governing)) continue;\n    if (normalForm(ce.scalarAst) === derivedNF) {\n      canonicalMatch = ce.id; // CanonicalEquation.id is a top-level `readonly id: string` (verified)\n      break;\n    }\n  }\n  return {\n    signal: canonicalMatch ? 'entailed' : 'novel-consequence',\n    evidence: {\n      target: proposal.target.name,\n      governing: proposal.governing.map((g) => g.name),\n      derivedNormalForm: derivedNF,\n      canonicalMatch,\n      sourceEquationIds: proposal.derivedFrom.sourceEquationIds,\n    },\n  };\n}\n\n/**\n * What a derived proposal claims, in a form that travels with it: the premise,\n * whether it is a known law or a conditional identity, what the solved-for\n * symbol means, the source equations' assumptions, and the exact scope of the\n * canonical-match check.\n * @internal\n */\nexport interface DerivedClaim {\n  /** The unadjudicated identification the relation rests on. */\n  readonly premise: string;\n  /** `known-law`: re-derives a registry equation. `conditional-identity`: holds only if the premise does. */\n  readonly relation: 'known-law' | 'conditional-identity';\n  /** No derived proposal has been confronted with a measurement. */\n  readonly tested: false;\n  readonly symbol: { readonly name: string; readonly fromEquation: string; readonly meaning: string };\n  readonly assumptions: readonly { readonly equation: string; readonly assumptions: readonly string[] }[];\n  readonly canonicalMatch: {\n    readonly id: string | null;\n    readonly sameTarget: number;\n    readonly sameTargetAndGoverning: number;\n    readonly scope: 'the canonical registry only';\n  };\n}\n\ntype ClaimEquation = Pick<CanonicalEquation, 'id' | 'name' | 'assumptions' | 'scalarAst'> & {\n  readonly dimensional: Pick<CanonicalEquation['dimensional'], 'target' | 'governing'>;\n};\n\n/**\n * Describe the claim a derived proposal makes. Pure; the proposal is unchanged.\n * @internal\n */\nexport function describeDerivedClaim(\n  proposal: Pick<ProposedBridge, 'target' | 'governing' | 'scalarAst' | 'derivedFrom'>,\n  canonical: readonly ClaimEquation[] = CANONICAL_EQUATIONS,\n): DerivedClaim {\n  const { identification, sourceEquationIds, solvedFor } = proposal.derivedFrom;\n  // `deriveProposedBridges` resolves the first source id for the smaller\n  // endpoint name and the second for the larger, so each id's target is known\n  // even when the source is a catalog bridge the canonical registry does not\n  // hold (then `canonical.find` is undefined; the sentence once printed\n  // \"equals ? (undefined)\" there, 9.0.0 audit §7 T1).\n  const [t0, t1] = [identification.a, identification.b].sort();\n  const endpointOf = (id: string): string => (id === sourceEquationIds[0] ? t0 : t1);\n  const sources = sourceEquationIds\n    .map((id) => canonical.find((e) => e.id === id))\n    .filter((e): e is ClaimEquation => e !== undefined);\n  const home = sources.find((e) => e.dimensional.governing.some((g) => g.name === solvedFor)) ?? sources[0];\n  const homeId = home?.id ?? sourceEquationIds[0];\n  const otherId = sourceEquationIds.find((id) => id !== homeId) ?? sourceEquationIds[1];\n  const other = sources.find((e) => e.id === otherId);\n  const homeTarget = home?.dimensional.target.name ?? endpointOf(homeId);\n  const otherTarget = other?.dimensional.target.name ?? endpointOf(otherId);\n\n  const derivedNF = normalForm(proposal.scalarAst);\n  const sameTarget = canonical.filter((e) => e.scalarAst && e.dimensional.target.name === proposal.target.name);\n  const sameGov = sameTarget.filter((e) => sameGoverning(e.dimensional.governing, proposal.governing));\n  const match = sameGov.find((e) => normalForm(e.scalarAst!) === derivedNF);\n\n  return {\n    premise: `${identification.a} ≡ ${identification.b}`,\n    relation: match ? 'known-law' : 'conditional-identity',\n    tested: false,\n    symbol: {\n      name: solvedFor,\n      fromEquation: homeId,\n      meaning:\n        `${solvedFor} is the ${solvedFor} of ${homeId}${home !== undefined ? ` (${home.name})` : ''}: the ${solvedFor} for which ` +\n        `${homeTarget} equals ${otherTarget} (${otherId}) — an equal-${identification.dim} scale; ` +\n        `the ${otherTarget} side is not given a ${solvedFor}`,\n    },\n    assumptions: sources.map((e) => ({ equation: e.id, assumptions: [...e.assumptions] })),\n    canonicalMatch: {\n      id: match?.id ?? null,\n      sameTarget: sameTarget.length,\n      sameTargetAndGoverning: sameGov.length,\n      scope: 'the canonical registry only',\n    },\n  };\n}\n\n/**\n * Annotate ranked candidates with their consequence signal. Order-preserving,\n * 1:1 with the input; only candidates in a promising tier (`promising` or\n * `promising-unchecked`) are classified (they are the only ones\n * `deriveProposedBridges` processes). A promising candidate with no\n * derived proposal is `inconclusive`. Generic over the input candidate type so\n * it composes with other post-pass annotators (e.g. `annotateAdjudications`)\n * without forgetting fields the caller already attached.\n * @public\n */\nexport function annotateConsequences<T extends VettedCandidate>(\n  candidates: readonly T[],\n): readonly (T & {\n  readonly consequence?: {\n    readonly signal: ConsequenceSignal;\n    readonly evidence: readonly ConsequenceEvidence[];\n  };\n})[] {\n  const promising = candidates.filter((c) => isPromisingTier(c.verdict));\n  const proposals = deriveProposedBridges(promising);\n\n  // Group proposals + their classification by the sorted candidate-pair key.\n  const byPair = new Map<string, { signal: ConsequenceSignal; evidence: ConsequenceEvidence[] }>();\n  for (const p of proposals) {\n    const key = [p.derivedFrom.identification.a, p.derivedFrom.identification.b].sort().join('~');\n    const cls = classifyProposal(p);\n    const cur = byPair.get(key);\n    if (!cur) {\n      byPair.set(key, { signal: cls.signal, evidence: [cls.evidence] });\n    } else {\n      cur.evidence.push(cls.evidence);\n      // entailed dominates novel: if ANY consequence re-derives known physics, the pair is entailed.\n      if (cls.signal === 'entailed') cur.signal = 'entailed';\n    }\n  }\n\n  return candidates.map((c) => {\n    if (!isPromisingTier(c.verdict)) return c;\n    const key = [c.a, c.b].sort().join('~');\n    const hit = byPair.get(key);\n    const signal: ConsequenceSignal = hit ? hit.signal : 'inconclusive';\n    return { ...c, consequence: { signal, evidence: hit?.evidence ?? [] } };\n  });\n}\n"]}

package/dist/composition/discovery.d.ts

@@ -38,6 +38,7 @@ import type { QuantityIdentification } from './compose.js';
 import type { RegimeAttributes } from './quantity.js';
 import type { LinkCandidate } from './bridge-analysis.js';
 import type { RepresentativeValue } from './representative-values.js';
+import type { DerivedMagnitudes } from './own-equation-magnitude.js';
 /** The canonical quantity→attributes map (registry nodes + per-equation stamps).
  *  Exported for the axis-discrimination audit. @internal */
 export declare const REGISTRY_ATTRIBUTES_BY_NAME: ReadonlyMap<string, RegimeAttributes>;
@@ -83,7 +84,8 @@ export interface VettedCandidate {
      * The calibrated STRENGTH of the magnitude falsifier against the two values' stated
      * uncertainties: `2·Φ(−ordersApart / √(σ_a² + σ_b²))`, with σ in decades per representative
      * value (`sigmaDecades`, default one decade: the table's "good to about one order"; an
-     * anchor-derived value takes the default), through MathTS `normalCDF` of the negative
+     * anchor-derived value takes the default; a value from the quantity's own equation, its
+     * propagated σ), through MathTS `normalCDF` of the negative
      * argument so a far tail is not rounded to 0 by `1 − cdf`. It is reported BESIDE the verdict
      * and changes no verdict: the clash threshold stays `ordersApart > maxOrders`. A small p says
      * the two magnitudes are hard to reconcile at their stated precision; 2.9 decades at σ = 1
@@ -95,7 +97,10 @@ export interface VettedCandidate {
     /** Both endpoints had a representative value, so the magnitude gate ran. */
     readonly magnitudeChecked: boolean;
     /** The magnitude gate read at least one endpoint value from the graph at
-     *  the anchor (no static table entry) rather than the sourced table. */
+     *  the anchor (no static table entry) rather than the sourced table. A value
+     *  the graph computes from registered constants alone, with no anchor input
+     *  (the target of a source-less equation), is a constant and is not
+     *  anchor-derived. */
     readonly magnitudeUsedAnchor: boolean;
     /**
      * The magnitude comparison used an anchor-derived value, and the ratio of the
@@ -106,17 +111,30 @@ export interface VettedCandidate {
      * the temperature to the Hawking temperature of the anchor mass M, and then
      * the thermal wavelength is exactly 4π ℓ_P for EVERY M. Its anchor-derived
      * magnitude is not a representative magnitude of the quantity at all.
-     * A quantity whose value really is a constant belongs in the
-     * representative-value table, where it is not anchor-derived.
+     * A quantity whose value really is a constant is not anchor-derived: the
+     * sourced table states it, or the graph computes it from registered constants
+     * with no anchor input (`DiscoveryContext.constantValues`), and the probe does
+     * not withhold a comparison of two such values, which can fail by the clash
+     * threshold.
      * A clash stays a clash (the graph itself fixes the two apart); only a pass is
      * withheld, in `describeGrounding`. Optional on the type so hand-built
      * candidates need not state it; the funnel always sets it.
      */
     readonly magnitudeAnchorInvariant?: boolean;
     /**
-     * The endpoints with no representative magnitude (neither in the sourced
-     * table nor valued at the anchor) — why the magnitude gate abstained. Empty
-     * when it ran. Optional on the type; the funnel always sets it.
+     * The endpoints whose magnitude the gate took from the quantity's own equation
+     * (`own-equation-magnitude.ts`): no table value and no no-anchor constant, but
+     * an edge into it whose every source the table or the constants value, at a
+     * propagated σ within one decade. Such a value is not anchor-derived. Empty
+     * when neither endpoint's magnitude came from there. Optional on the type; the
+     * funnel always sets it.
+     */
+    readonly magnitudeDerived?: readonly string[];
+    /**
+     * The endpoints with no representative magnitude (not in the sourced table,
+     * not a no-anchor constant, not derived from their own equation, not valued
+     * at the anchor) — why the magnitude gate abstained. Empty when it ran.
+     * Optional on the type; the funnel always sets it.
      */
     readonly magnitudeMissing?: readonly string[];
     /**
@@ -145,11 +163,18 @@ export interface VettedCandidate {
      *                       compares catalog labels and runs no computation, so
      *                       it is never counted or described as a falsification.
      * - `promising`       — consistent AND connects disconnected physics AND
-     *                       unlocks ≥1 quantity. Worth physicist review.
+     *                       unlocks ≥1 quantity, AND the magnitude falsifier ran
+     *                       and could have failed ({@link hasMagnitudeEvidence}).
+     *                       Worth physicist review.
+     * - `promising-unchecked` — the same structure, but the magnitude falsifier
+     *                       never tested it: it abstained (an endpoint has no
+     *                       representative magnitude) or its pass is anchor-invariant
+     *                       and so could not fail. A separate count, never added to
+     *                       `promising` (AGENTS law 4).
      * - `inert`           — consistent but structurally/numerically idle (a
      *                       dimensional coincidence with no consequence).
      */
-    readonly verdict: 'promising' | 'inert' | 'contradictory' | 'magnitude-clash' | 'axis-clash';
+    readonly verdict: 'promising' | 'promising-unchecked' | 'inert' | 'contradictory' | 'magnitude-clash' | 'axis-clash';
     /** Composite ranking score (higher = more worth review). */
     readonly score: number;
     /**
@@ -177,6 +202,23 @@ export interface VettedCandidate {
      *  (weak name-based prior; informational). */
     readonly touchesCanonical: boolean;
 }
+/**
+ * Whether the magnitude falsifier ran on a candidate AND could have failed: both endpoints had a
+ * representative magnitude (`magnitudeChecked`) and the comparison is not anchor-invariant. An
+ * anchor-invariant pass is fixed by the graph at every anchor, so it cannot fail and is not a
+ * check (AGENTS law 2). The one owner of this predicate: the verdict split between `promising`
+ * and `promising-unchecked`, the CLI readiness count and the grounding ledger all read it.
+ * @internal
+ */
+export declare function hasMagnitudeEvidence(c: Pick<VettedCandidate, 'magnitudeChecked' | 'magnitudeAnchorInvariant'>): boolean;
+/**
+ * Whether a verdict is one of the two promising tiers, `promising` (with magnitude evidence) or
+ * `promising-unchecked` (without): the structural set the consequence and proposal layers
+ * process, so splitting the tiers loses no proposal. A selector, never a count: the two tiers are
+ * reported apart and never added (AGENTS law 4).
+ * @internal
+ */
+export declare function isPromisingTier(verdict: VettedCandidate['verdict']): boolean;
 /** Options for the discovery loop. @internal */
 export interface DiscoveryOptions {
     /**
@@ -243,6 +285,19 @@ export interface DiscoveryContext {
     readonly attributesByName: ReadonlyMap<string, RegimeAttributes>;
     /** `forwardEvaluate(edges, groundTruth, baseIdents)` — anchor magnitudes. */
     readonly anchorValues: ReadonlyMap<string, number>;
+    /**
+     * `forwardEvaluate(edges, {}, baseIdents)` — the values the graph fixes with NO anchor input:
+     * the targets of source-less equations (an all-constant right-hand side such as the Rydberg
+     * energy or the Planck length) and whatever they alone determine. Such a value is a constant,
+     * not an anchor-derived magnitude, so the magnitude gate reads it as `fromAnchor: false`.
+     */
+    readonly constantValues: ReadonlyMap<string, number>;
+    /**
+     * The magnitudes the graph derives from the sourced table and the constants alone, never from
+     * the anchor (`deriveOwnEquationMagnitudes`), with every refusal and its reason: a σ above one
+     * decade, two disagreeing edges, or a σ that could not be measured.
+     */
+    readonly derivedMagnitudes: DerivedMagnitudes;
     /** The same evaluation with every anchor input times {@link ANCHOR_PROBE_FACTOR}. */
     readonly anchorValuesProbe: ReadonlyMap<string, number>;
     /** `quantityComponents(edges, baseIdents)` — base component roots. */
@@ -264,6 +319,8 @@ export declare function buildDiscoveryContext(edges: readonly BridgeEdge[], opts
 interface GateMagnitude {
     readonly value: number;
     readonly fromAnchor: boolean;
+    /** Derived from the quantity's own equation (`ctx.derivedMagnitudes`). */
+    readonly fromOwnEquation: boolean;
     readonly sigmaDecades: number;
 }
 /** What the magnitude gate found for one candidate. @internal */
@@ -281,6 +338,8 @@ export interface MagnitudeGate {
     readonly p: number | null;
     /** The endpoints with no magnitude (why the gate abstained); empty when it ran. */
     readonly missing: readonly string[];
+    /** The endpoints whose magnitude came from their own equation, in candidate order. */
+    readonly derived: readonly string[];
 }
 /**
  * The two-sided tail of a gap of `orders` decades between two values whose log10 carry
@@ -294,10 +353,14 @@ export declare function magnitudeStrength(orders: number, sigmaA: number, sigmaB
 /**
  * The magnitude gate: an INDEPENDENT falsifier the single-anchor graph cannot make. It runs only
  * when both endpoints have a representative value and abstains (never false-rejects) otherwise.
- * A value comes from the sourced static table first, else — for graph-derived quantities the
- * table omits by design (schwarzschild-radius, thermal-de-broglie-wavelength) — from the
- * quantity's value AT THE REGISTERED ANCHOR, a definite magnitude for this run, with the default
- * σ of one decade. The verdict is `ordersApart > ctx.maxOrders`; `p` is reported beside it.
+ * A value comes from the sourced static table first; else from the value the graph fixes with NO
+ * anchor input (a constant computed from registered constants alone, `ctx.constantValues`: not
+ * anchor-derived); else from the quantity's own equation evaluated from the table and the
+ * constants (`ctx.derivedMagnitudes`, at its propagated σ, never above one decade: not
+ * anchor-derived); else — for graph-derived quantities the table omits by design
+ * (schwarzschild-radius, thermal-de-broglie-wavelength) — from the quantity's value AT THE
+ * REGISTERED ANCHOR, a definite magnitude for this run. The constant and the anchor value take the
+ * default σ of one decade. The verdict is `ordersApart > ctx.maxOrders`; `p` is reported beside it.
  *
  * @internal
  */
@@ -320,7 +383,8 @@ export declare function vetLinkCandidate(edges: readonly BridgeEdge[], candidate
 export declare function vetInContext(edges: readonly BridgeEdge[], candidate: LinkCandidate, ctx: DiscoveryContext): VettedCandidate;
 /**
  * Run the full discovery funnel: propose cross-cluster candidates, vet each
- * against the inference suite, and rank — `promising` first, then by score.
+ * against the inference suite, and rank — `promising` first, then `promising-unchecked`, then
+ * the rest, and by score within a verdict.
  * The output is the physicist's worklist (vetted, provenance-traced), not a
  * list of discoveries.
  *

package/dist/composition/discovery.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAK1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAYtE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IAC7F,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AA4CD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CA6BlB;AA8DD,kGAAkG;AAClG,UAAU,aAAa;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAa;IAC5B,+DAA+D;IAC/D,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,gEAAgE;IAChE,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,8FAA8F;IAC9F,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mFAAmF;IACnF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AASD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAExF;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,aAAa,EAAE,GAAG,EAAE,gBAAgB,GAAG,aAAa,CAkC5F;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CAoLjB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAmBnB"}
+{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAK1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAMtE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAQrE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;;0BAIsB;IACtB,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;;;;OAiBG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;;;;OAOG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,qBAAqB,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IACrH,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,IAAI,CAAC,eAAe,EAAE,kBAAkB,GAAG,0BAA0B,CAAC,GACxE,OAAO,CAET;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,eAAe,CAAC,SAAS,CAAC,GAAG,OAAO,CAE5E;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AAyCD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD;;;;;OAKG;IACH,QAAQ,CAAC,cAAc,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrD;;;;OAIG;IACH,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC;IAC9C,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CAqClB;AA8DD,kGAAkG;AAClG,UAAU,aAAa;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAa;IAC5B,+DAA+D;IAC/D,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,gEAAgE;IAChE,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,8FAA8F;IAC9F,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mFAAmF;IACnF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,sFAAsF;IACtF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AASD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAExF;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,aAAa,EAAE,GAAG,EAAE,gBAAgB,GAAG,aAAa,CAqD5F;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CAqLjB;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAoBnB"}