universal-physics-tensor 10.0.0 → 11.0.0

package/dist/composition/proposed-bridges.js.map

@@ -1 +1 @@
-{"version":3,"file":"proposed-bridges.js","sourceRoot":"","sources":["../../src/composition/proposed-bridges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AAErD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAG3D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AACjE,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAQnD,2FAA2F;AAC3F,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;IAClC,CAAC;CACF;AAED,SAAS,SAAS,CAAC,IAAU,EAAE,IAAU,EAAE,KAAa;IACtD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,iBAAiB,CACzB,SAAS,IAAI,wCAAwC,CACtD,CAAC;YACJ,CAAC;YACD,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,KAAK,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,GAAa;IACtC,MAAM,GAAG,GAAS,IAAI,GAAG,EAAE,CAAC;IAC5B,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5C,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC;gBACf,KAAK,GAAG;oBACN,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC3D,OAAO,GAAG,CAAC;gBACb,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBAChC,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnC,KAAK,MAAM,CAAC,IAAI,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBACjC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;wBAC9B,MAAM,IAAI,iBAAiB,CAAC,sBAAsB,CAAC,CAAC;oBACtD,CAAC;oBACD,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;wBACxB,MAAM,IAAI,iBAAiB,CAAC,yBAAyB,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;oBACxE,CAAC;oBACD,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpC,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD;oBACE,MAAM,IAAI,iBAAiB,CAAC,aAAa,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACxE,CAAC;QACH;YACE,MAAM,IAAI,iBAAiB,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED;;gBAEgB;AAChB,MAAM,UAAU,YAAY,CAAC,CAAO;IAClC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,GAAc,EAAE,CAAS,EAAY,EAAE,CACnE,CAAC,KAAK,CAAC;QACL,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;QAChB,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC;IAErF,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,IAAI,GAAG,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;;YACzC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,EAAc,EAAY,EAAE,CAC3C,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAE9D,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5E,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAClE,CAAC;AAyCD,MAAM,UAAU,GAAG,CAAC,IAAY,EAAW,EAAE,CAC3C,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAExD,sEAAsE;AACtE,SAAS,qBAAqB,CAAC,CAAO;IACpC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,aAAa,CAAC,CAAO;IAC5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,IAAI,GAAG,KAAK,CAAC;YAAE,SAAS;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;QACtE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;IACtC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED,+EAA+E;AAC/E,0EAA0E;AAC1E,iFAAiF;AACjF,4EAA4E;AAC5E,6EAA6E;AAC7E,sEAAsE;AAEtE,SAAS,eAAe,CAAC,GAAa,EAAE,IAA4B;IAClE,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACvD,CAAC;SAAM,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;YAAE,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED;0EAC0E;AAC1E,SAAS,YAAY,CACnB,SAAmB,EACnB,SAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,eAAe,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAAE,SAAS;QAChE,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS,CAAC,uBAAuB;QAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,GAAa,EAAE,GAAgC;IACnE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/B,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IACvC,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IACrE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAoBD;;;gFAGgF;AAChF,SAAS,kBAAkB,CAAC,CAAO,EAAE,MAA2B;IAC9D,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,IACE,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAC1B,CAAC,UAAU,CAAC,IAAI,CAAC;YACjB,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EACjB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;gBAIgB;AAChB,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,MAAM,GAAG,GAAqB,EAAE,CAAC;IAEjC,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IACE,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI;YAC/B,CAAC,CAAC,eAAe,KAAK,oBAAoB,EAC1C,CAAC;YACD,yEAAyE;YACzE,4EAA4E;YAC5E,sCAAsC;YACtC,MAAM,SAAS,GAAG,YAAY,CAC5B,CAAC,CAAC,SAAS,EACX,YAAY,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CACnD,CAAC;YACF,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,WAAW;gBACjB,SAAS;gBACT,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG;gBACnC,KAAK,EAAE,CAAC,CAAC,eAAe;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,wEAAwE;IACxE,6DAA6D;IAC7D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAC1D,IAAI,CAAO,CAAC;QACZ,IAAI,CAAC;YACH,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,iBAAiB;gBAAE,SAAS;YAC/C,MAAM,GAAG,CAAC;QACZ,CAAC;QACD,IAAI,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9E,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,iBAAiB,CAAC;QACtD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,SAAS;QACpD,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG;YAC1B,KAAK,EAAE,IAAI,CAAC,UAAU;SACvB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAU,GAA+B,eAAe,CAAC,eAAe,CAAC;IAEzE,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,OAAO,KAAK,WAAW;YAAE,SAAS;QAC3C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzC,0EAA0E;QAC1E,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC3C,IAAI,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,6EAA6E;AAC7E,SAAS,UAAU,CACjB,IAAqB,EACrB,EAAU,EACV,EAAU,EACV,EAAkB,EAClB,EAAkB;IAElB,IAAI,EAAQ,CAAC;IACb,IAAI,EAAQ,CAAC;IACb,IAAI,CAAC;QACH,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;QAC9B,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,iBAAiB;YAAE,OAAO,IAAI,CAAC;QAChD,MAAM,CAAC,CAAC;IACV,CAAC;IAED,MAAM,QAAQ,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC,CAAC,kCAAkC;IAC9D,IAAI,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mCAAmC;IAE3E,6EAA6E;IAC7E,MAAM,MAAM,GAAS,IAAI,GAAG,EAAE,CAAC;IAC/B,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACzB,MAAM,SAAS,GAAS,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;IACpC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,QAAQ,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;YAAE,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC;IACzD,CAAC;IAED,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,iBAAiB,CAAC;IAClD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mBAAmB;IAExE,MAAM,SAAS,GAA0B,CAAC,GAAG,MAAM,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACrC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAG,CAAC,CAAiB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC;IACrE,MAAM,UAAU,GACd,4DAA4D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG;QACjF,IAAI,GAAG,CAAC,EAAE,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,sBAAsB,QAAQ,CAAC,IAAI,KAAK;QACpE,wEAAwE;QACxE,wEAAwE,CAAC;IAE3E,OAAO;QACL,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,QAAQ,CAAC,IAAI,EAAE;QACvC,WAAW,EAAE;YACX,cAAc,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;YACvD,iBAAiB,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;YACjC,SAAS,EAAE,QAAQ,CAAC,IAAI;SACzB;QACD,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE;QAClD,SAAS;QACT,YAAY,EAAE,GAAG,QAAQ,CAAC,IAAI,MAAM,aAAa,CAAC,MAAM,CAAC,EAAE;QAC3D,SAAS;QACT,oBAAoB,EAAE,MAAM,CAAC,GAAG,CAAC;QACjC,UAAU;QACV,iBAAiB,EAAE,EAAE;QACrB,MAAM,EAAE,eAAe;QACvB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,eAAe,CACtB,SAAoC;IAEpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;QACzB,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;QACvE,CAAC,CAAC,CAAC,CACN,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAoC;IAEpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAChD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,oBAAoB,EAAE,CAAC;QACpE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,iBAAiB,CAAC,MAAM;YACjD,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC;AAqBD,gGAAgG;AAChG,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAwB,EACxB,QAA2B;IAE3B,MAAM,KAAK,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;IAChF,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;IAClF,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACpF,IAAI,CAAC,QAAQ,CAAC,MAAM;QAAE,MAAM,IAAI,oBAAoB,CAAC,iCAAiC,CAAC,CAAC;IACxF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAiCD;qEACqE;AACrE,SAAS,YAAY,CAAC,EAAU;IAC9B,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IAC7B,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IAChE,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAClF,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IACzG,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AAC/C,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,eAAe,CAAC,CAAiB;IAC/C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC;IACnD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC;IAC9C,MAAM,OAAO,GAAG;QACd,CAAC,GAAG,EAAE,EAAE,CAAU;QAClB,CAAC,GAAG,EAAE,EAAE,CAAU;KACnB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,SAAS,YAAY;QAC1D,QAAQ,EAAE,GAAG;QACb,aAAa,EAAE,uDAAuD;QACtE,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC;QAC/B,MAAM,EAAE,eAAe;QACvB,OAAO,EACL,6DAA6D,CAAC,MAAM,CAAC,GAAG;YACxE,IAAI,GAAG,UAAU,GAAG,qBAAqB,CAAC,CAAC,WAAW,CAAC,SAAS,MAAM;YACtE,yEAAyE;YACzE,gDAAgD;QAClD,aAAa,EAAE,CAAC,CAAC,YAAY;QAC7B,qBAAqB,EAAE,CAAC,CAAC,oBAAoB;QAC7C,UAAU,EAAE;YACV,uEAAuE;YACvE,GAAG,OAAO;SACX;QACD,YAAY,EAAE;YACZ;gBACE,QAAQ,EAAE,yBAAyB;gBACnC,WAAW,EACT,qEAAqE;oBACrE,+DAA+D;oBAC/D,oEAAoE;oBACpE,2EAA2E;gBAC7E,OAAO,EAAE,SAAS;aACnB;SACF;QACD,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,KAAK,EACH,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM;gBACzB,CAAC,CAAC,yBAAyB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBAC5D,CAAC,CAAC,EAAE,CAAC;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAC3B,qBAAqB,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC","sourcesContent":["/**\n * Identity-consequence surfacer — turns a `promising` discovery identification\n * into the ONE algebraic relation it implies, as an UNADJUDICATED proposal.\n *\n * When the discovery funnel flags `a ≟ b` (two canonical quantities of equal\n * dimension), and `a`, `b` are the TARGETS of two canonical equations `Eₐ`, `E_b`,\n * the hypothesised identity `a ≡ b` makes their right-hand sides equal:\n *\n *     Eₐ.scalarAst  =  E_b.scalarAst\n *\n * Eliminating (isolating) one free variable yields a relation among the union of\n * the two governing sets — e.g. Landauer `k_B T ln2` ≟ Planck–Einstein `h ν`\n * gives `ν = (k_B ln2 / h) · T`, the \"Landauer photon\".\n *\n * CRITICAL — this is NOT new physics and NOT a bridge. It is the algebraic\n * consequence of an UNADJUDICATED identification, surfaced for a physicist to\n * judge (Part-VI §XXVII-B: the enumerator proposes, humans dispose). Every\n * emitted record carries `status: 'unadjudicated'` — a literal that is NOT a\n * member of `BridgeEquationStatus`, so a proposal can never be assigned where a\n * catalog entry is expected. The generator NEVER writes `BRIDGE_EQUATIONS` and a\n * proposal is NEVER added to `CANONICAL_GRAPH` (no coincidence-amplifying loop).\n *\n * Scope (v0.24.0 pilot): canonical-only `promising` candidates whose BOTH source\n * equations (a) have a non-null `dimensional.monomial` (determinate) and (b) are\n * `epistemicStatus: 'fully-quantitative'` (so the eliminated prefactor is a\n * closed numeric constant, not an operator-valued stub — this gates out\n * `CE-jarzynski`). See `docs/planning/v0.24.0-{Design,Review-Findings}.md`.\n *\n * INTERNAL tooling — deliberately NOT re-exported from `src/index.ts`.\n *\n * @module composition/proposed-bridges\n */\n\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { validate } from '../dimensional/validator.js';\nimport { sym } from '../dimensional/ast-builders.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { DimensionalVariable } from '../dimensional/buckingham.js';\nimport type { BridgeEquationStatus } from '../bridges/index.js';\nimport { canonicalByTarget, canonicalById } from '../canonical/registry.js';\nimport type { KnownIssue } from '../bridges/index.js';\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { catalogIdNumber } from '../bridges/catalog-load.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CONSTANTS } from '../dimensional/symbolic-constants.js';\nimport { evalExpr } from './expr-eval.js';\nimport { rankDiscoveries } from './discovery.js';\nimport type { VettedCandidate } from './discovery.js';\nimport { CANONICAL_GRAPH } from './canonical-graph.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\n\n// ── monomial algebra over flat ExprNode forms ───────────────────────────────\n\n/** A flat monomial: leaf name → its dimension and (signed, possibly rational)\n *  exponent. `k_B·T·ln2 / h` ⇒ {k_B:+1, T:+1, ln2:+1, h:-1}. */\ntype Mono = Map<string, { dim: Dimension; exp: number }>;\n\n/** Thrown when an AST is not a product / quotient / integer-power of symbols. @internal */\nexport class NotAMonomialError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'NotAMonomialError';\n  }\n}\n\nfunction mergeInto(into: Mono, from: Mono, scale: number): void {\n  for (const [name, { dim, exp }] of from) {\n    const cur = into.get(name);\n    if (cur === undefined) {\n      into.set(name, { dim, exp: exp * scale });\n    } else {\n      if (!equals(cur.dim, dim)) {\n        throw new NotAMonomialError(\n          `leaf '${name}' appears with inconsistent dimensions`,\n        );\n      }\n      cur.exp += exp * scale;\n    }\n  }\n}\n\n/**\n * Decompose a flat-monomial `ExprNode` into a leaf→exponent map. Throws\n * `NotAMonomialError` on sums, differences, or non-symbol bases — this is the\n * AST-level monomial gate.\n *\n * @internal\n */\nexport function toMonomial(ast: ExprNode): Mono {\n  const out: Mono = new Map();\n  switch (ast.kind) {\n    case 'symbol':\n      out.set(ast.name, { dim: ast.dim, exp: 1 });\n      return out;\n    case 'op':\n      switch (ast.op) {\n        case '*':\n          for (const a of ast.args) mergeInto(out, toMonomial(a), 1);\n          return out;\n        case '/': {\n          const [num, ...dens] = ast.args;\n          mergeInto(out, toMonomial(num), 1);\n          for (const d of dens) mergeInto(out, toMonomial(d), -1);\n          return out;\n        }\n        case '^': {\n          const [base, expNode] = ast.args;\n          if (expNode.kind !== 'symbol') {\n            throw new NotAMonomialError('non-literal exponent');\n          }\n          const n = Number(expNode.name);\n          if (!Number.isFinite(n)) {\n            throw new NotAMonomialError(`non-numeric exponent '${expNode.name}'`);\n          }\n          mergeInto(out, toMonomial(base), n);\n          return out;\n        }\n        default:\n          throw new NotAMonomialError(`operator '${ast.op}' is not monomial`);\n      }\n    default:\n      throw new NotAMonomialError(`node kind '${ast.kind}' is not monomial`);\n  }\n}\n\n/** Rebuild a flat-monomial `ExprNode` from a leaf→exponent map (numerator =\n *  positive exponents, denominator = negative). Zero exponents drop out.\n *  @internal */\nexport function fromMonomial(m: Mono): ExprNode {\n  const factor = (name: string, dim: Dimension, e: number): ExprNode =>\n    e === 1\n      ? sym(name, dim)\n      : { kind: 'op', op: '^', args: [sym(name, dim), sym(String(e), DIMENSIONLESS)] };\n\n  const num: ExprNode[] = [];\n  const den: ExprNode[] = [];\n  for (const [name, { dim, exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp === 0) continue;\n    if (exp > 0) num.push(factor(name, dim, exp));\n    else den.push(factor(name, dim, -exp));\n  }\n  const product = (xs: ExprNode[]): ExprNode =>\n    xs.length === 1 ? xs[0] : { kind: 'op', op: '*', args: xs };\n\n  const numerator = num.length === 0 ? sym('1', DIMENSIONLESS) : product(num);\n  if (den.length === 0) return numerator;\n  return { kind: 'op', op: '/', args: [numerator, product(den)] };\n}\n\n// ── the proposal record ─────────────────────────────────────────────────────\n\n/**\n * A machine-DERIVED candidate bridge — the MATH ONLY. The algebraic consequence\n * of an UNADJUDICATED identification; never a status claim. Structurally distinct\n * from `BridgeEquationEntry` (omits every physics-judgment field) and carries the\n * literal `status: 'unadjudicated'`, which is NOT a `BridgeEquationStatus`.\n *\n * @internal\n */\nexport interface ProposedBridge {\n  /** `IC-<sorted-a>--<sorted-b>--<solvedFor>`. */\n  readonly id: string;\n  readonly derivedFrom: {\n    readonly identification: { readonly a: string; readonly b: string; readonly dim: string };\n    readonly sourceEquationIds: readonly [string, string];\n    readonly solvedFor: string;\n  };\n  readonly target: DimensionalVariable;\n  /** Free (non-constant) inputs of the derived relation. */\n  readonly governing: readonly DimensionalVariable[];\n  readonly formulaLatex: string;\n  /** Dimensionally-VALIDATED derived RHS (round-trips to `dimensionalSignature`). */\n  readonly scalarAst: ExprNode;\n  /** `format()` of the inferred dimension — same convention as the catalog. */\n  readonly dimensionalSignature: string;\n  /** Mechanical derivation description — NO physics claim. */\n  readonly provenance: string;\n  /** Other identifications that derive the SAME relation (same normal form, up\n   *  to dimensionless constants), collapsed into this proposal by the dedup pass.\n   *  Empty unless a wider candidate scope produced structural duplicates. */\n  readonly alsoDerivableFrom: readonly string[];\n  /** ALWAYS the literal 'unadjudicated'. NOT a BridgeEquationStatus. */\n  readonly status: 'unadjudicated';\n  /** Numerically evaluate the derived RHS; constants auto-resolve, supply the\n   *  free `governing` leaves (e.g. `{ T: 300 }`). */\n  evaluate(values: Readonly<Record<string, number>>): number;\n}\n\nconst isConstant = (name: string): boolean =>\n  Object.prototype.hasOwnProperty.call(CONSTANTS, name);\n\n/** The single non-constant leaf of a monomial, or null if 0 or >1. */\nfunction uniqueNonConstantLeaf(m: Mono): { name: string; dim: Dimension; exp: number } | null {\n  const free = [...m].filter(([name]) => !isConstant(name));\n  if (free.length !== 1) return null;\n  const [name, { dim, exp }] = free[0];\n  return { name, dim, exp };\n}\n\nfunction latexFromMono(m: Mono): string {\n  const num: string[] = [];\n  const den: string[] = [];\n  for (const [name, { exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp === 0) continue;\n    const tok = Math.abs(exp) === 1 ? name : `${name}^{${Math.abs(exp)}}`;\n    (exp > 0 ? num : den).push(tok);\n  }\n  const n = num.join(' \\\\cdot ') || '1';\n  return den.length ? `\\\\frac{${n}}{${den.join(' \\\\cdot ')}}` : n;\n}\n\n// ── leaf-name canonicalization ──────────────────────────────────────────────\n// A canonical equation's `scalarAst` uses private symbols (`T`) while its\n// `dimensional.governing` and the whole composition graph (and bridge `symbolic`\n// forms) use quantity names (`temperature`). Aligning the AST leaves to the\n// governing names lets a derivation from a canonical equation and one from a\n// bridge edge of the SAME physics collapse under `dedupByNormalForm`.\n\nfunction collectLeafDims(ast: ExprNode, into: Map<string, Dimension>): void {\n  if (ast.kind === 'symbol') {\n    if (!into.has(ast.name)) into.set(ast.name, ast.dim);\n  } else if (ast.kind === 'op') {\n    for (const a of ast.args) collectLeafDims(a, into);\n  }\n}\n\n/** Map each non-constant `scalarAst` leaf to the governing quantity of equal\n *  dimension, when that match is unique (else leave it — never guess). */\nfunction leafCanonMap(\n  scalarAst: ExprNode,\n  governing: readonly DimensionalVariable[],\n): Map<string, string> {\n  const leaves = new Map<string, Dimension>();\n  collectLeafDims(scalarAst, leaves);\n  const govFree = governing.filter((g) => !isConstant(g.name));\n  const map = new Map<string, string>();\n  for (const [leaf, dim] of leaves) {\n    if (isConstant(leaf) || Number.isFinite(Number(leaf))) continue;\n    if (govFree.some((g) => g.name === leaf)) continue; // already a graph name\n    const matches = govFree.filter((g) => equals(g.dim, dim));\n    if (matches.length === 1) map.set(leaf, matches[0].name);\n  }\n  return map;\n}\n\nfunction renameLeaves(ast: ExprNode, map: ReadonlyMap<string, string>): ExprNode {\n  if (map.size === 0) return ast;\n  if (ast.kind === 'symbol') {\n    const r = map.get(ast.name);\n    return r ? { ...ast, name: r } : ast;\n  }\n  if (ast.kind === 'op') {\n    return { ...ast, args: ast.args.map((a) => renameLeaves(a, map)) };\n  }\n  return ast;\n}\n\n// ── the generator ───────────────────────────────────────────────────────────\n\n/**\n * An admissible source for the elimination: a target name backed by a flat\n * monomial `scalarAst` whose prefactor is a closed constant. Canonical equations\n * and bridge edges both project to this shape, so the generator no longer needs\n * to know which it came from.\n */\ninterface EquationSource {\n  /** `CE-…` (canonical) or `BE-<n>` (bridge). */\n  readonly id: string;\n  readonly kind: 'canonical' | 'bridge';\n  readonly scalarAst: ExprNode;\n  readonly targetDim: Dimension;\n  /** `epistemicStatus` (canonical) or `confidence` (bridge) — recorded, not gated. */\n  readonly grade: string;\n}\n\n/** True if the monomial carries a dimensionless leaf that is neither a known\n *  constant, a numeric literal, NOR a declared input quantity — i.e. an\n *  operator-valued STUB (e.g. Jarzynski's `ln_avg_exp_minus_betaW`), not a clean\n *  dimensionless INPUT like a coupling constant (BE-18's `yukawa-coupling`). */\nfunction hasNonConstantStub(m: Mono, inputs: ReadonlySet<string>): boolean {\n  for (const [name, { dim }] of m) {\n    if (\n      equals(dim, DIMENSIONLESS) &&\n      !isConstant(name) &&\n      !Number.isFinite(Number(name)) &&\n      !inputs.has(name)\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** ALL admissible sources for `name` — every canonical equation AND every bridge\n *  edge whose target is `name` and whose form is a clean monomial. A target with\n *  several sources (e.g. BE-42 Hawking's two parametrisations) is DE-AMBIGUATED by\n *  enumeration, not skipped; coinciding derivations collapse later under dedup.\n *  @internal */\nexport function resolveSources(name: string): EquationSource[] {\n  const out: EquationSource[] = [];\n\n  // Canonical: a determinate monomial AND a fully-quantitative form.\n  for (const e of canonicalByTarget(name)) {\n    if (\n      e.scalarAst &&\n      e.dimensional.monomial !== null &&\n      e.epistemicStatus === 'fully-quantitative'\n    ) {\n      // Align the AST's private leaf symbols (`T`) with the governing quantity\n      // names (`temperature`) so canonical- and bridge-sourced derivations of the\n      // same relation collapse under dedup.\n      const scalarAst = renameLeaves(\n        e.scalarAst,\n        leafCanonMap(e.scalarAst, e.dimensional.governing),\n      );\n      out.push({\n        id: e.id,\n        kind: 'canonical',\n        scalarAst,\n        targetDim: e.dimensional.target.dim,\n        grade: e.epistemicStatus,\n      });\n    }\n  }\n\n  // Bridge: edges carrying a clean-monomial `symbolic` form. `confidence` is about\n  // FRAMING, not formula completeness, so it is recorded — not gated; the\n  // structural stub check enforces a closed prefactor instead.\n  for (const edge of CATALOG_GRAPH) {\n    if (edge.target.name !== name || !edge.symbolic) continue;\n    let m: Mono;\n    try {\n      m = toMonomial(edge.symbolic);\n    } catch (err) {\n      if (err instanceof NotAMonomialError) continue;\n      throw err;\n    }\n    if (hasNonConstantStub(m, new Set(edge.sources.map((s) => s.name)))) continue;\n    const dim = validate(edge.symbolic).inferredDimension;\n    if (!dim || !equals(dim, edge.target.dim)) continue;\n    out.push({\n      id: edge.beId !== null ? `BE-${edge.beId}` : edge.id,\n      kind: 'bridge',\n      scalarAst: edge.symbolic,\n      targetDim: edge.target.dim,\n      grade: edge.confidence,\n    });\n  }\n\n  return out;\n}\n\n/**\n * Derive the implied relation for each `promising` identification in `candidates`.\n * Returns ONE proposal per admissible candidate (Adam M2), structurally\n * de-duplicated (`dedupByNormalForm`).\n *\n * Candidate-set-agnostic: pass `rankDiscoveries(CANONICAL_GRAPH)` (default),\n * `…(CATALOG_GRAPH)`, or `…([...CATALOG_GRAPH, ...CANONICAL_GRAPH])` to widen the\n * source — the CLI `discover --derive` forwards whichever `--source=` graph is\n * selected. Each endpoint is resolved by `resolveSource` to a canonical equation\n * OR a bridge edge with a clean-monomial `symbolic` form, so a candidate yields a\n * proposal when BOTH endpoints resolve (the Landauer photon, for instance, is\n * derivable both from `CE-landauer` and — at `--source=both` — from the BE-16\n * bridge). A target with SEVERAL admissible sources (BE-42 Hawking's two\n * parametrisations, or a canonical + bridge pair) is de-ambiguated by ENUMERATION\n * — every source pair is tried and coincidences collapse under dedup. HONEST\n * BOUNDARY: an endpoint with no clean-monomial source (a bridge with no `symbolic`\n * form or a non-monomial one) yields nothing.\n *\n * Pure; reads the registries, writes nothing.\n *\n * @internal\n */\nexport function deriveProposedBridges(\n  candidates: readonly VettedCandidate[] = rankDiscoveries(CANONICAL_GRAPH),\n): readonly ProposedBridge[] {\n  const out: ProposedBridge[] = [];\n  for (const cand of candidates) {\n    if (cand.verdict !== 'promising') continue;\n    const [t0, t1] = [cand.a, cand.b].sort();\n    // Enumerate every admissible source pair (de-ambiguation by enumeration).\n    for (const E1 of resolveSources(t0)) {\n      for (const E2 of resolveSources(t1)) {\n        const p = derivePair(cand, t0, t1, E1, E2);\n        if (p) out.push(p);\n      }\n    }\n  }\n  return disambiguateIds(dedupByNormalForm(out));\n}\n\n/** Derive one proposal from a fixed source pair, or null if inadmissible. */\nfunction derivePair(\n  cand: VettedCandidate,\n  t0: string,\n  t1: string,\n  E1: EquationSource,\n  E2: EquationSource,\n): ProposedBridge | null {\n  let m1: Mono;\n  let m2: Mono;\n  try {\n    m1 = toMonomial(E1.scalarAst);\n    m2 = toMonomial(E2.scalarAst);\n  } catch (e) {\n    if (e instanceof NotAMonomialError) return null;\n    throw e;\n  }\n\n  const solveFor = uniqueNonConstantLeaf(m2);\n  if (!solveFor) return null; // no single observable to isolate\n  if (m1.has(solveFor.name)) return null; // degenerate overlap (Design §5.2)\n\n  // Isolate solveFor from `m1 = m2`:  solveFor^e = m1 / (m2 without solveFor).\n  const result: Mono = new Map();\n  mergeInto(result, m1, 1);\n  const m2NoSolve: Mono = new Map(m2);\n  m2NoSolve.delete(solveFor.name);\n  mergeInto(result, m2NoSolve, -1);\n  if (solveFor.exp !== 1) {\n    for (const v of result.values()) v.exp /= solveFor.exp;\n  }\n\n  const scalarAst = fromMonomial(result);\n  const dim = validate(scalarAst).inferredDimension;\n  if (!dim || !equals(dim, solveFor.dim)) return null; // round-trip guard\n\n  const governing: DimensionalVariable[] = [...result]\n    .filter(([name]) => !isConstant(name))\n    .map(([name, { dim: d }]) => ({ name, dim: d }));\n\n  const src = (e: EquationSource) => `${e.id} (${e.kind}, ${e.grade})`;\n  const provenance =\n    `Monomial elimination of the UNADJUDICATED identification ${cand.a} ≡ ${cand.b} ` +\n    `(${src(E1)}.rhs = ${src(E2)}.rhs), solved for '${solveFor.name}'. ` +\n    `Algebraic consequence of a hypothesised identity — NOT a new physical ` +\n    `relation and NOT a bridge. Invertible (any free leaf may be isolated).`;\n\n  return {\n    id: `IC-${t0}--${t1}--${solveFor.name}`,\n    derivedFrom: {\n      identification: { a: cand.a, b: cand.b, dim: cand.dim },\n      sourceEquationIds: [E1.id, E2.id],\n      solvedFor: solveFor.name,\n    },\n    target: { name: solveFor.name, dim: solveFor.dim },\n    governing,\n    formulaLatex: `${solveFor.name} = ${latexFromMono(result)}`,\n    scalarAst,\n    dimensionalSignature: format(dim),\n    provenance,\n    alsoDerivableFrom: [],\n    status: 'unadjudicated',\n    evaluate: (values) => evalExpr(scalarAst, values),\n  };\n}\n\n/** Make ids unique: when distinct proposals (different source pairs) collide on\n *  the base `IC-<a>--<b>--<solveFor>` id, suffix each with its source pair. */\nfunction disambiguateIds(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const counts = new Map<string, number>();\n  for (const p of proposals) counts.set(p.id, (counts.get(p.id) ?? 0) + 1);\n  return proposals.map((p) =>\n    (counts.get(p.id) ?? 0) > 1\n      ? { ...p, id: `${p.id}--${p.derivedFrom.sourceEquationIds.join('+')}` }\n      : p,\n  );\n}\n\n/**\n * Collapse proposals that derive the SAME relation — equal `normalForm` (up to\n * dimensionless constants) AND equal target dimension — into the first, recording\n * the others' identifications in `alsoDerivableFrom`. Distinct stubs do NOT\n * collapse (e.g. Landauer's dropped `ln2` vs an operator stub hash differently),\n * so this only merges genuine structural twins that a wider candidate scope can\n * produce (Design §9 #2). Deterministic: input order is preserved.\n *\n * @internal\n */\nexport function dedupByNormalForm(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const byKey = new Map<string, ProposedBridge>();\n  const order: string[] = [];\n  const extras = new Map<string, string[]>();\n\n  for (const p of proposals) {\n    const key = `${normalForm(p.scalarAst)}::${p.dimensionalSignature}`;\n    const kept = byKey.get(key);\n    if (kept === undefined) {\n      byKey.set(key, p);\n      order.push(key);\n      extras.set(key, [...p.alsoDerivableFrom]);\n    } else {\n      const tag = `${p.derivedFrom.identification.a} ≡ ${p.derivedFrom.identification.b}`;\n      extras.get(key)!.push(tag, ...p.alsoDerivableFrom);\n    }\n  }\n\n  return order.map((key) => {\n    const p = byKey.get(key)!;\n    const merged = [...new Set(extras.get(key)!)].sort();\n    return merged.length === p.alsoDerivableFrom.length\n      ? p\n      : { ...p, alsoDerivableFrom: merged };\n  });\n}\n\n// ── promotion gate (guardrail #5) ───────────────────────────────────────────\n\n/** The human inputs a proposal CANNOT supply — fabricating them is forbidden. */\ninterface PromotionEvidence {\n  /** Literature anchor establishing the relation (appears / contradicts / neither). */\n  readonly citation: string;\n  /** Human-chosen catalog status — never defaulted. */\n  readonly status: BridgeEquationStatus;\n  /** Path to the recorded adversarial + literature review. */\n  readonly reviewRef: string;\n}\n\n/** A review-ready promotion request — the artifact a human turns into a catalog\n *  entry. Holding one does NOT mutate `BRIDGE_EQUATIONS`. */\ninterface PromotionRequest {\n  readonly proposal: ProposedBridge;\n  readonly evidence: PromotionEvidence;\n}\n\n/** Thrown when a proposal is promoted without the evidence the promotion requires. @internal */\nexport class MissingEvidenceError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'MissingEvidenceError';\n  }\n}\n\n/**\n * Gate a proposal toward the catalog. THROWS `MissingEvidenceError` unless every\n * human input is present and non-blank (operationalises \"null, not guessed\").\n * Returns a `PromotionRequest`; it deliberately does NOT synthesise a\n * `BridgeEquationEntry` — the physics-judgment fields are human work.\n *\n * @internal\n */\nexport function promoteProposal(\n  proposal: ProposedBridge,\n  evidence: PromotionEvidence,\n): PromotionRequest {\n  const blank = (s: unknown): boolean => typeof s !== 'string' || s.trim() === '';\n  if (blank(evidence.citation)) throw new MissingEvidenceError('citation required');\n  if (blank(evidence.reviewRef)) throw new MissingEvidenceError('reviewRef required');\n  if (!evidence.status) throw new MissingEvidenceError('status required (not defaulted)');\n  return { proposal, evidence };\n}\n\n// ── PROPOSED_BRIDGES review surface (catalog field-shape, own registry) ──────\n\n/**\n * A derived proposal in the catalog's field SHAPE, for review — but in its OWN\n * registry and carrying `status: 'unadjudicated'` (NOT a `BridgeEquationStatus`).\n * This is deliberately NOT a `BridgeEquationEntry`: it omits the spec-only fields\n * (`source_part`/`source_section`/numeric `id`) and never enters `BRIDGE_EQUATIONS`,\n * which stays the faithful encoding of the specification.\n *\n * @internal\n */\ninterface ProposedBridgeEntry {\n  readonly id: string;\n  readonly name: string;\n  readonly category: 'Z';\n  readonly category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)';\n  /** The two regimes bridged — the source equations' domains. */\n  readonly bridges: readonly [string, string];\n  /** ALWAYS 'unadjudicated' — not a catalog status. */\n  readonly status: 'unadjudicated';\n  readonly context: string;\n  readonly formula_latex: string;\n  readonly dimensional_signature: string;\n  /** Honest references: a derivation note + the SOURCE equations' citations,\n   *  never a fabricated citation for the derived relation itself. */\n  readonly references: readonly string[];\n  readonly known_issues: readonly KnownIssue[];\n  readonly derivedFrom: ProposedBridge['derivedFrom'];\n  readonly notes: string;\n}\n\n/** Domain label + citations for a source id — canonical (`CE-…`) or bridge\n *  (`BE-<n>`), so the entry surface works for either source kind. */\nfunction equationMeta(id: string): { domain: string; references: readonly string[] } {\n  const ce = canonicalById(id);\n  if (ce) return { domain: ce.domain, references: ce.references };\n  const n = catalogIdNumber(id);\n  const be = n === undefined ? undefined : BRIDGE_EQUATIONS.find((e) => e.id === n);\n  if (be) return { domain: `${be.bridges[0]}↔${be.bridges[1]} (${be.status})`, references: be.references };\n  return { domain: 'unknown', references: [] };\n}\n\n/** Render a `ProposedBridge` into the catalog field-shape, filled honestly. @internal */\nexport function toProposedEntry(p: ProposedBridge): ProposedBridgeEntry {\n  const [id1, id2] = p.derivedFrom.sourceEquationIds;\n  const M1 = equationMeta(id1);\n  const M2 = equationMeta(id2);\n  const { a, b } = p.derivedFrom.identification;\n  const srcRefs = [\n    [id1, M1] as const,\n    [id2, M2] as const,\n  ].flatMap(([id, m]) => m.references.map((r) => `source ${id}: ${r}`));\n  return {\n    id: p.id,\n    name: `${a} ≡ ${b} ⇒ ${p.derivedFrom.solvedFor} (derived)`,\n    category: 'Z',\n    category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)',\n    bridges: [M1.domain, M2.domain],\n    status: 'unadjudicated',\n    context:\n      `Algebraic consequence of the UNADJUDICATED identification ${a} ≡ ${b} ` +\n      `(${id1}.rhs = ${id2}.rhs), solved for ${p.derivedFrom.solvedFor}. A ` +\n      `dimensional coincidence surfaced by the discovery funnel — no physical ` +\n      `mechanism is asserted, and it is NOT a bridge.`,\n    formula_latex: p.formulaLatex,\n    dimensional_signature: p.dimensionalSignature,\n    references: [\n      'Machine-derived; the combined relation has no independent literature.',\n      ...srcRefs,\n    ],\n    known_issues: [\n      {\n        severity: 'phenomenological-ansatz',\n        description:\n          'Machine-derived dimensional coincidence: the algebraic consequence ' +\n          'of an unadjudicated identification, with no mechanism and no ' +\n          'independent literature. Promotion to BRIDGE_EQUATIONS requires an ' +\n          'adversarial + literature review (Part-VI §XXVII-B) via promoteProposal().',\n        fixable: 'unknown',\n      },\n    ],\n    derivedFrom: p.derivedFrom,\n    notes:\n      p.provenance +\n      (p.alsoDerivableFrom.length\n        ? ` Also derivable from: ${p.alsoDerivableFrom.join('; ')}.`\n        : ''),\n  };\n}\n\n/**\n * The PROPOSED-BRIDGE review surface: derived identity-consequences in the\n * catalog's field shape, in their OWN registry, every entry `status:\n * 'unadjudicated'`. Separate from `BRIDGE_EQUATIONS` (the faithful spec\n * encoding), which this never mutates. Default scope: canonical-only — widen with\n * `deriveProposedBridges(rankDiscoveries(graph)).map(toProposedEntry)`.\n *\n * @internal\n */\nexport const PROPOSED_BRIDGES: readonly ProposedBridgeEntry[] =\n  deriveProposedBridges().map(toProposedEntry);\n"]}
+{"version":3,"file":"proposed-bridges.js","sourceRoot":"","sources":["../../src/composition/proposed-bridges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAG3D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AACpG,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAc1E,MAAM,GAAG,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC5B,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnC,2FAA2F;AAC3F,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAC1C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;IAClC,CAAC;CACF;AAED,SAAS,SAAS,CAAC,IAAU,EAAE,IAAU,EAAE,KAAe;IACxD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,iBAAiB,CACzB,SAAS,IAAI,wCAAwC,CACtD,CAAC;YACJ,CAAC;YACD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,GAAa;IACtC,MAAM,GAAG,GAAS,IAAI,GAAG,EAAE,CAAC;IAC5B,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,KAAK,IAAI;YACP,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC;gBACf,KAAK,GAAG;oBACN,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC7D,OAAO,GAAG,CAAC;gBACb,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBAChC,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;oBACrC,KAAK,MAAM,CAAC,IAAI,IAAI;wBAAE,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC/D,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD,KAAK,GAAG,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;oBACjC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;wBAC9B,MAAM,IAAI,iBAAiB,CAAC,sBAAsB,CAAC,CAAC;oBACtD,CAAC;oBACD,MAAM,CAAC,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC3C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;wBACpB,MAAM,IAAI,iBAAiB,CAAC,yBAAyB,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;oBACxE,CAAC;oBACD,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpC,OAAO,GAAG,CAAC;gBACb,CAAC;gBACD;oBACE,MAAM,IAAI,iBAAiB,CAAC,aAAa,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACxE,CAAC;QACH;YACE,MAAM,IAAI,iBAAiB,CAAC,cAAc,GAAG,CAAC,IAAI,mBAAmB,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED;;;;;;;;;;gBAUgB;AAChB,MAAM,UAAU,YAAY,CAAC,CAAO;IAClC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,GAAc,EAAE,CAAW,EAAY,EAAE,CACrE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,SAAS;QAC3B,IAAI,GAAG,CAAC,SAAS,GAAG,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;;YACpD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,EAAc,EAAY,EAAE,CAC3C,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAE9D,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5E,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AAClE,CAAC;AAyCD,MAAM,UAAU,GAAG,oBAAoB,CAAC;AASxC,sEAAsE;AACtE,SAAS,qBAAqB,CAAC,CAAO;IACpC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,aAAa,CAAC,CAAO;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,IAAI,GAAG,CAAC,MAAM,EAAE;YAAE,SAAS;QAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC;QACpF,CAAC,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;IACtC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,EAAQ,EAAE,EAAQ,EAAE,QAAkB;IAChE,MAAM,MAAM,GAAS,IAAI,GAAG,EAAE,CAAC;IAC/B,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAC3B,MAAM,SAAS,GAAS,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;IACpC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChC,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;YAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,0EAA0E;AAC1E,iFAAiF;AACjF,4EAA4E;AAC5E,6EAA6E;AAC7E,sEAAsE;AAEtE,SAAS,eAAe,CAAC,GAAa,EAAE,IAA4B;IAClE,iBAAiB,CACf,GAAG,EACH,CAAC,IAAI,EAAE,EAAE;QACP,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1D,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,SAAS,YAAY,CACnB,SAAmB,EACnB,SAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,eAAe,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QACjC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC;YAAE,SAAS;QACzD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS,CAAC,uBAAuB;QAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,GAAa,EAAE,GAAgC;IACnE,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/B,OAAO,eAAe,CACpB,GAAG,EACH,CAAC,IAAI,EAAE,EAAE;QACP,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC,EACD,EAAE,CACH,CAAC;AACJ,CAAC;AAoBD;;;gFAGgF;AAChF,SAAS,kBAAkB,CAAC,CAAO,EAAE,MAA2B;IAC9D,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,IACE,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAC1B,CAAC,UAAU,CAAC,IAAI,CAAC;YACjB,CAAC,gBAAgB,CAAC,IAAI,CAAC;YACvB,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EACjB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;gBAIgB;AAChB,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,MAAM,GAAG,GAAqB,EAAE,CAAC;IAEjC,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,IACE,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI;YAC/B,CAAC,CAAC,eAAe,KAAK,oBAAoB,EAC1C,CAAC;YACD,yEAAyE;YACzE,4EAA4E;YAC5E,sCAAsC;YACtC,MAAM,SAAS,GAAG,YAAY,CAC5B,CAAC,CAAC,SAAS,EACX,YAAY,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,CACnD,CAAC;YACF,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,WAAW;gBACjB,SAAS;gBACT,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG;gBACnC,KAAK,EAAE,CAAC,CAAC,eAAe;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,wEAAwE;IACxE,6DAA6D;IAC7D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAC1D,IAAI,CAAO,CAAC;QACZ,IAAI,CAAC;YACH,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,iBAAiB;gBAAE,SAAS;YAC/C,MAAM,GAAG,CAAC;QACZ,CAAC;QACD,IAAI,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9E,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,iBAAiB,CAAC;QACtD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,SAAS;QACpD,GAAG,CAAC,IAAI,CAAC;YACP,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG;YAC1B,KAAK,EAAE,IAAI,CAAC,UAAU;SACvB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAAU,GAA+B,eAAe,CAAC,eAAe,CAAC;IAEzE,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,OAAO,KAAK,WAAW;YAAE,SAAS;QAC3C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzC,0EAA0E;QAC1E,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC3C,IAAI,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,6EAA6E;AAC7E,SAAS,UAAU,CACjB,IAAqB,EACrB,EAAU,EACV,EAAU,EACV,EAAkB,EAClB,EAAkB;IAElB,IAAI,EAAQ,CAAC;IACb,IAAI,EAAQ,CAAC;IACb,IAAI,CAAC;QACH,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;QAC9B,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,IAAI,CAAC,YAAY,iBAAiB;YAAE,OAAO,IAAI,CAAC;QAChD,MAAM,CAAC,CAAC;IACV,CAAC;IAED,MAAM,QAAQ,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC,CAAC,kCAAkC;IAC9D,IAAI,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mCAAmC;IAE3E,6EAA6E;IAC7E,MAAM,MAAM,GAAG,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;IAE7C,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,iBAAiB,CAAC;IAClD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,mBAAmB;IAExE,MAAM,SAAS,GAA0B,CAAC,GAAG,MAAM,CAAC;SACjD,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACrC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAG,CAAC,CAAiB,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC;IACrE,MAAM,UAAU,GACd,4DAA4D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG;QACjF,IAAI,GAAG,CAAC,EAAE,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,sBAAsB,QAAQ,CAAC,IAAI,KAAK;QACpE,wEAAwE;QACxE,wEAAwE,CAAC;IAE3E,OAAO;QACL,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,QAAQ,CAAC,IAAI,EAAE;QACvC,WAAW,EAAE;YACX,cAAc,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;YACvD,iBAAiB,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;YACjC,SAAS,EAAE,QAAQ,CAAC,IAAI;SACzB;QACD,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE;QAClD,SAAS;QACT,YAAY,EAAE,GAAG,QAAQ,CAAC,IAAI,MAAM,aAAa,CAAC,MAAM,CAAC,EAAE;QAC3D,SAAS;QACT,oBAAoB,EAAE,MAAM,CAAC,GAAG,CAAC;QACjC,UAAU;QACV,iBAAiB,EAAE,EAAE;QACrB,MAAM,EAAE,eAAe;QACvB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,eAAe,CACtB,SAAoC;IAEpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;QACzB,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;QACvE,CAAC,CAAC,CAAC,CACN,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,CAAiB;IACjC,IAAI,SAAS,GAAa,CAAC,CAAC,SAAS,CAAC;IACtC,IAAI,CAAC;QACH,SAAS,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,YAAY,iBAAiB,CAAC;YAAE,MAAM,GAAG,CAAC;IACrD,CAAC;IACD,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,oBAAoB,EAAE,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAoC;IAEpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAChD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtB,4EAA4E;QAC5E,0EAA0E;QAC1E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAChC,OAAO,SAAS,CAAC,oBAAoB,KAAK,CAAC,CAAC,oBAAoB,IAAI,iBAAiB,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC;YAChI,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,KAAK,SAAS;gBAAE,GAAG,GAAG,IAAI,CAAC;QACrC,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC;YACpF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,iBAAiB,CAAC,MAAM;YACjD,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC;AAqBD,gGAAgG;AAChG,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAwB,EACxB,QAA2B;IAE3B,MAAM,KAAK,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;IAChF,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,mBAAmB,CAAC,CAAC;IAClF,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,CAAC;IACpF,IAAI,CAAC,QAAQ,CAAC,MAAM;QAAE,MAAM,IAAI,oBAAoB,CAAC,iCAAiC,CAAC,CAAC;IACxF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAiCD;qEACqE;AACrE,SAAS,YAAY,CAAC,EAAU;IAC9B,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IAC7B,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IAChE,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAClF,IAAI,EAAE;QAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,GAAG,EAAE,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,CAAC;IACzG,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AAC/C,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,eAAe,CAAC,CAAiB;IAC/C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,iBAAiB,CAAC;IACnD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,cAAc,CAAC;IAC9C,MAAM,OAAO,GAAG;QACd,CAAC,GAAG,EAAE,EAAE,CAAU;QAClB,CAAC,GAAG,EAAE,EAAE,CAAU;KACnB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,SAAS,YAAY;QAC1D,QAAQ,EAAE,GAAG;QACb,aAAa,EAAE,uDAAuD;QACtE,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC;QAC/B,MAAM,EAAE,eAAe;QACvB,OAAO,EACL,6DAA6D,CAAC,MAAM,CAAC,GAAG;YACxE,IAAI,GAAG,UAAU,GAAG,qBAAqB,CAAC,CAAC,WAAW,CAAC,SAAS,MAAM;YACtE,yEAAyE;YACzE,gDAAgD;QAClD,aAAa,EAAE,CAAC,CAAC,YAAY;QAC7B,qBAAqB,EAAE,CAAC,CAAC,oBAAoB;QAC7C,UAAU,EAAE;YACV,uEAAuE;YACvE,GAAG,OAAO;SACX;QACD,YAAY,EAAE;YACZ;gBACE,QAAQ,EAAE,yBAAyB;gBACnC,WAAW,EACT,qEAAqE;oBACrE,+DAA+D;oBAC/D,oEAAoE;oBACpE,2EAA2E;gBAC7E,OAAO,EAAE,SAAS;aACnB;SACF;QACD,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,KAAK,EACH,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM;gBACzB,CAAC,CAAC,yBAAyB,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBAC5D,CAAC,CAAC,EAAE,CAAC;KACV,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAC3B,qBAAqB,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC","sourcesContent":["/**\n * Identity-consequence surfacer — turns a `promising` discovery identification\n * into the ONE algebraic relation it implies, as an UNADJUDICATED proposal.\n *\n * When the discovery funnel flags `a ≟ b` (two canonical quantities of equal\n * dimension), and `a`, `b` are the TARGETS of two canonical equations `Eₐ`, `E_b`,\n * the hypothesised identity `a ≡ b` makes their right-hand sides equal:\n *\n *     Eₐ.scalarAst  =  E_b.scalarAst\n *\n * Eliminating (isolating) one free variable yields a relation among the union of\n * the two governing sets — e.g. Landauer `k_B T ln2` ≟ Planck–Einstein `h ν`\n * gives `ν = (k_B ln2 / h) · T`, the \"Landauer photon\".\n *\n * CRITICAL — this is NOT new physics and NOT a bridge. It is the algebraic\n * consequence of an UNADJUDICATED identification, surfaced for a physicist to\n * judge (Part-VI §XXVII-B: the enumerator proposes, humans dispose). Every\n * emitted record carries `status: 'unadjudicated'` — a literal that is NOT a\n * member of `BridgeEquationStatus`, so a proposal can never be assigned where a\n * catalog entry is expected. The generator NEVER writes `BRIDGE_EQUATIONS` and a\n * proposal is NEVER added to `CANONICAL_GRAPH` (no coincidence-amplifying loop).\n *\n * Scope (v0.24.0 pilot): canonical-only `promising` candidates whose BOTH source\n * equations (a) have a non-null `dimensional.monomial` (determinate) and (b) are\n * `epistemicStatus: 'fully-quantitative'` (so the eliminated prefactor is a\n * closed numeric constant, not an operator-valued stub — this gates out\n * `CE-jarzynski`). See `docs/planning/v0.24.0-{Design,Review-Findings}.md`.\n *\n * INTERNAL tooling — deliberately NOT re-exported from `src/index.ts`.\n *\n * @module composition/proposed-bridges\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { validate } from '../dimensional/validator.js';\nimport { sym, symbolPower } from '../dimensional/ast-builders.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { DimensionalVariable } from '../dimensional/buckingham.js';\nimport type { BridgeEquationStatus } from '../bridges/index.js';\nimport { canonicalByTarget, canonicalById } from '../canonical/registry.js';\nimport type { KnownIssue } from '../bridges/index.js';\nimport { BRIDGE_EQUATIONS } from '../bridges/index.js';\nimport { catalogIdNumber } from '../bridges/catalog-load.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport { forEachScalarLeaf, isDecimalLiteral, mapScalarLeaves } from '../dimensional/ast-leaves.js';\nimport { evalExpr } from './expr-eval.js';\nimport { rankDiscoveries } from './discovery.js';\nimport type { VettedCandidate } from './discovery.js';\nimport { CANONICAL_GRAPH } from './canonical-graph.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { rationalExponentOf } from './formula-shape.js';\nimport { equalUpToConstant } from './algebraic-equivalence.js';\nimport { formatRational, fractionToNumber } from './rational-exponent.js';\n\n// ── monomial algebra over flat ExprNode forms ───────────────────────────────\n\n/**\n * A flat monomial: leaf name → its dimension and signed exact exponent.\n * `k_B·T·ln2 / h` ⇒ {k_B:+1, T:+1, ln2:+1, h:-1}. The exponent is a core\n * `Fraction`, so solving for a cubed leaf carries `1/3`, not\n * `0.3333333333333333`, and a cancellation is an exact zero.\n *\n * @internal\n */\nexport type Mono = Map<string, { dim: Dimension; exp: Fraction }>;\n\nconst ONE = new Fraction(1);\nconst MINUS_ONE = new Fraction(-1);\n\n/** Thrown when an AST is not a product / quotient / integer-power of symbols. @internal */\nexport class NotAMonomialError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'NotAMonomialError';\n  }\n}\n\nfunction mergeInto(into: Mono, from: Mono, scale: Fraction): void {\n  for (const [name, { dim, exp }] of from) {\n    const cur = into.get(name);\n    if (cur === undefined) {\n      into.set(name, { dim, exp: exp.multiply(scale) });\n    } else {\n      if (!equals(cur.dim, dim)) {\n        throw new NotAMonomialError(\n          `leaf '${name}' appears with inconsistent dimensions`,\n        );\n      }\n      cur.exp = cur.exp.add(exp.multiply(scale));\n    }\n  }\n}\n\n/**\n * Decompose a flat-monomial `ExprNode` into a leaf→exponent map. Throws\n * `NotAMonomialError` on sums, differences, or non-symbol bases — this is the\n * AST-level monomial gate.\n *\n * @internal\n */\nexport function toMonomial(ast: ExprNode): Mono {\n  const out: Mono = new Map();\n  switch (ast.kind) {\n    case 'symbol':\n      out.set(ast.name, { dim: ast.dim, exp: ONE });\n      return out;\n    case 'op':\n      switch (ast.op) {\n        case '*':\n          for (const a of ast.args) mergeInto(out, toMonomial(a), ONE);\n          return out;\n        case '/': {\n          const [num, ...dens] = ast.args;\n          mergeInto(out, toMonomial(num), ONE);\n          for (const d of dens) mergeInto(out, toMonomial(d), MINUS_ONE);\n          return out;\n        }\n        case '^': {\n          const [base, expNode] = ast.args;\n          if (expNode.kind !== 'symbol') {\n            throw new NotAMonomialError('non-literal exponent');\n          }\n          const n = rationalExponentOf(expNode.name);\n          if (n === undefined) {\n            throw new NotAMonomialError(`non-numeric exponent '${expNode.name}'`);\n          }\n          mergeInto(out, toMonomial(base), n);\n          return out;\n        }\n        default:\n          throw new NotAMonomialError(`operator '${ast.op}' is not monomial`);\n      }\n    default:\n      throw new NotAMonomialError(`node kind '${ast.kind}' is not monomial`);\n  }\n}\n\n/** Rebuild a flat-monomial `ExprNode` from a leaf→exponent map (numerator =\n *  positive exponents, denominator = negative). Zero exponents drop out. The\n *  exponent literal is the double built from the fraction (`1/3` is written\n *  `0.3333333333333333`), so one rational is always one spelling.\n *\n *  This is not merged with `monomialToExpr` (composition/probe/generator.ts),\n *  which writes one product with negative exponents in code-unit name order;\n *  this one orders names by `localeCompare` and splits a quotient. The\n *  proposals' printed formulas and the IC dedup key read this tree, so one\n *  builder would move them. Both build each factor with `symbolPower`.\n *  @internal */\nexport function fromMonomial(m: Mono): ExprNode {\n  const factor = (name: string, dim: Dimension, e: Fraction): ExprNode =>\n    symbolPower(sym(name, dim), fractionToNumber(e));\n\n  const num: ExprNode[] = [];\n  const den: ExprNode[] = [];\n  for (const [name, { dim, exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp.isZero()) continue;\n    if (exp.numerator > 0n) num.push(factor(name, dim, exp));\n    else den.push(factor(name, dim, exp.abs()));\n  }\n  const product = (xs: ExprNode[]): ExprNode =>\n    xs.length === 1 ? xs[0] : { kind: 'op', op: '*', args: xs };\n\n  const numerator = num.length === 0 ? sym('1', DIMENSIONLESS) : product(num);\n  if (den.length === 0) return numerator;\n  return { kind: 'op', op: '/', args: [numerator, product(den)] };\n}\n\n// ── the proposal record ─────────────────────────────────────────────────────\n\n/**\n * A machine-DERIVED candidate bridge — the MATH ONLY. The algebraic consequence\n * of an UNADJUDICATED identification; never a status claim. Structurally distinct\n * from `BridgeEquationEntry` (omits every physics-judgment field) and carries the\n * literal `status: 'unadjudicated'`, which is NOT a `BridgeEquationStatus`.\n *\n * @internal\n */\nexport interface ProposedBridge {\n  /** `IC-<sorted-a>--<sorted-b>--<solvedFor>`. */\n  readonly id: string;\n  readonly derivedFrom: {\n    readonly identification: { readonly a: string; readonly b: string; readonly dim: string };\n    readonly sourceEquationIds: readonly [string, string];\n    readonly solvedFor: string;\n  };\n  readonly target: DimensionalVariable;\n  /** Free (non-constant) inputs of the derived relation. */\n  readonly governing: readonly DimensionalVariable[];\n  readonly formulaLatex: string;\n  /** Dimensionally-VALIDATED derived RHS (round-trips to `dimensionalSignature`). */\n  readonly scalarAst: ExprNode;\n  /** `format()` of the inferred dimension — same convention as the catalog. */\n  readonly dimensionalSignature: string;\n  /** Mechanical derivation description — NO physics claim. */\n  readonly provenance: string;\n  /** Other identifications that derive the SAME relation (same normal form, up\n   *  to dimensionless constants), collapsed into this proposal by the dedup pass.\n   *  Empty unless a wider candidate scope produced structural duplicates. */\n  readonly alsoDerivableFrom: readonly string[];\n  /** ALWAYS the literal 'unadjudicated'. NOT a BridgeEquationStatus. */\n  readonly status: 'unadjudicated';\n  /** Numerically evaluate the derived RHS; constants auto-resolve, supply the\n   *  free `governing` leaves (e.g. `{ T: 300 }`). */\n  evaluate(values: Readonly<Record<string, number>>): number;\n}\n\nconst isConstant = isRegisteredConstant;\n\n/** One leaf of a monomial with its exact exponent. @internal */\nexport interface MonoLeaf {\n  readonly name: string;\n  readonly dim: Dimension;\n  readonly exp: Fraction;\n}\n\n/** The single non-constant leaf of a monomial, or null if 0 or >1. */\nfunction uniqueNonConstantLeaf(m: Mono): MonoLeaf | null {\n  const free = [...m].filter(([name]) => !isConstant(name));\n  if (free.length !== 1) return null;\n  const [name, { dim, exp }] = free[0];\n  return { name, dim, exp };\n}\n\n/** The LaTeX of a monomial, exponents rendered from their fractions (`y^{1/3}`). @internal */\nexport function latexFromMono(m: Mono): string {\n  const num: string[] = [];\n  const den: string[] = [];\n  for (const [name, { exp }] of [...m].sort((a, b) => a[0].localeCompare(b[0]))) {\n    if (exp.isZero()) continue;\n    const magnitude = exp.abs();\n    const tok = magnitude.equals(ONE) ? name : `${name}^{${formatRational(magnitude)}}`;\n    (exp.numerator > 0n ? num : den).push(tok);\n  }\n  const n = num.join(' \\\\cdot ') || '1';\n  return den.length ? `\\\\frac{${n}}{${den.join(' \\\\cdot ')}}` : n;\n}\n\n/**\n * Isolate `solveFor` from `m1 = m2`: `solveFor^e = m1 / (m2 without solveFor)`,\n * every exponent divided by `e`, exactly. `m2` must hold `solveFor`.\n *\n * @internal\n */\nexport function isolateLeaf(m1: Mono, m2: Mono, solveFor: MonoLeaf): Mono {\n  const result: Mono = new Map();\n  mergeInto(result, m1, ONE);\n  const m2NoSolve: Mono = new Map(m2);\n  m2NoSolve.delete(solveFor.name);\n  mergeInto(result, m2NoSolve, MINUS_ONE);\n  if (!solveFor.exp.equals(ONE)) {\n    for (const v of result.values()) v.exp = v.exp.divide(solveFor.exp);\n  }\n  return result;\n}\n\n// ── leaf-name canonicalization ──────────────────────────────────────────────\n// A canonical equation's `scalarAst` uses private symbols (`T`) while its\n// `dimensional.governing` and the whole composition graph (and bridge `symbolic`\n// forms) use quantity names (`temperature`). Aligning the AST leaves to the\n// governing names lets a derivation from a canonical equation and one from a\n// bridge edge of the SAME physics collapse under `dedupByNormalForm`.\n\nfunction collectLeafDims(ast: ExprNode, into: Map<string, Dimension>): void {\n  forEachScalarLeaf(\n    ast,\n    (leaf) => {\n      if (!into.has(leaf.name)) into.set(leaf.name, leaf.dim);\n    },\n    {},\n  );\n}\n\n/** Map each non-constant `scalarAst` leaf to the governing quantity of equal\n *  dimension, when that match is unique (else leave it — never guess). */\nfunction leafCanonMap(\n  scalarAst: ExprNode,\n  governing: readonly DimensionalVariable[],\n): Map<string, string> {\n  const leaves = new Map<string, Dimension>();\n  collectLeafDims(scalarAst, leaves);\n  const govFree = governing.filter((g) => !isConstant(g.name));\n  const map = new Map<string, string>();\n  for (const [leaf, dim] of leaves) {\n    if (isConstant(leaf) || isDecimalLiteral(leaf)) continue;\n    if (govFree.some((g) => g.name === leaf)) continue; // already a graph name\n    const matches = govFree.filter((g) => equals(g.dim, dim));\n    if (matches.length === 1) map.set(leaf, matches[0].name);\n  }\n  return map;\n}\n\nfunction renameLeaves(ast: ExprNode, map: ReadonlyMap<string, string>): ExprNode {\n  if (map.size === 0) return ast;\n  return mapScalarLeaves(\n    ast,\n    (leaf) => {\n      const r = map.get(leaf.name);\n      return r ? { ...leaf, name: r } : leaf;\n    },\n    {},\n  );\n}\n\n// ── the generator ───────────────────────────────────────────────────────────\n\n/**\n * An admissible source for the elimination: a target name backed by a flat\n * monomial `scalarAst` whose prefactor is a closed constant. Canonical equations\n * and bridge edges both project to this shape, so the generator no longer needs\n * to know which it came from.\n */\ninterface EquationSource {\n  /** `CE-…` (canonical) or `BE-<n>` (bridge). */\n  readonly id: string;\n  readonly kind: 'canonical' | 'bridge';\n  readonly scalarAst: ExprNode;\n  readonly targetDim: Dimension;\n  /** `epistemicStatus` (canonical) or `confidence` (bridge) — recorded, not gated. */\n  readonly grade: string;\n}\n\n/** True if the monomial carries a dimensionless leaf that is neither a known\n *  constant, a numeric literal, NOR a declared input quantity — i.e. an\n *  operator-valued STUB (e.g. Jarzynski's `ln_avg_exp_minus_betaW`), not a clean\n *  dimensionless INPUT like a coupling constant (BE-18's `yukawa-coupling`). */\nfunction hasNonConstantStub(m: Mono, inputs: ReadonlySet<string>): boolean {\n  for (const [name, { dim }] of m) {\n    if (\n      equals(dim, DIMENSIONLESS) &&\n      !isConstant(name) &&\n      !isDecimalLiteral(name) &&\n      !inputs.has(name)\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** ALL admissible sources for `name` — every canonical equation AND every bridge\n *  edge whose target is `name` and whose form is a clean monomial. A target with\n *  several sources (e.g. BE-42 Hawking's two parametrisations) is DE-AMBIGUATED by\n *  enumeration, not skipped; coinciding derivations collapse later under dedup.\n *  @internal */\nexport function resolveSources(name: string): EquationSource[] {\n  const out: EquationSource[] = [];\n\n  // Canonical: a determinate monomial AND a fully-quantitative form.\n  for (const e of canonicalByTarget(name)) {\n    if (\n      e.scalarAst &&\n      e.dimensional.monomial !== null &&\n      e.epistemicStatus === 'fully-quantitative'\n    ) {\n      // Align the AST's private leaf symbols (`T`) with the governing quantity\n      // names (`temperature`) so canonical- and bridge-sourced derivations of the\n      // same relation collapse under dedup.\n      const scalarAst = renameLeaves(\n        e.scalarAst,\n        leafCanonMap(e.scalarAst, e.dimensional.governing),\n      );\n      out.push({\n        id: e.id,\n        kind: 'canonical',\n        scalarAst,\n        targetDim: e.dimensional.target.dim,\n        grade: e.epistemicStatus,\n      });\n    }\n  }\n\n  // Bridge: edges carrying a clean-monomial `symbolic` form. `confidence` is about\n  // FRAMING, not formula completeness, so it is recorded — not gated; the\n  // structural stub check enforces a closed prefactor instead.\n  for (const edge of CATALOG_GRAPH) {\n    if (edge.target.name !== name || !edge.symbolic) continue;\n    let m: Mono;\n    try {\n      m = toMonomial(edge.symbolic);\n    } catch (err) {\n      if (err instanceof NotAMonomialError) continue;\n      throw err;\n    }\n    if (hasNonConstantStub(m, new Set(edge.sources.map((s) => s.name)))) continue;\n    const dim = validate(edge.symbolic).inferredDimension;\n    if (!dim || !equals(dim, edge.target.dim)) continue;\n    out.push({\n      id: edge.beId !== null ? `BE-${edge.beId}` : edge.id,\n      kind: 'bridge',\n      scalarAst: edge.symbolic,\n      targetDim: edge.target.dim,\n      grade: edge.confidence,\n    });\n  }\n\n  return out;\n}\n\n/**\n * Derive the implied relation for each `promising` identification in `candidates`.\n * Returns ONE proposal per admissible candidate (Adam M2), structurally\n * de-duplicated (`dedupByNormalForm`).\n *\n * Candidate-set-agnostic: pass `rankDiscoveries(CANONICAL_GRAPH)` (default),\n * `…(CATALOG_GRAPH)`, or `…([...CATALOG_GRAPH, ...CANONICAL_GRAPH])` to widen the\n * source — the CLI `discover --derive` forwards whichever `--source=` graph is\n * selected. Each endpoint is resolved by `resolveSource` to a canonical equation\n * OR a bridge edge with a clean-monomial `symbolic` form, so a candidate yields a\n * proposal when BOTH endpoints resolve (the Landauer photon, for instance, is\n * derivable both from `CE-landauer` and — at `--source=both` — from the BE-16\n * bridge). A target with SEVERAL admissible sources (BE-42 Hawking's two\n * parametrisations, or a canonical + bridge pair) is de-ambiguated by ENUMERATION\n * — every source pair is tried and coincidences collapse under dedup. HONEST\n * BOUNDARY: an endpoint with no clean-monomial source (a bridge with no `symbolic`\n * form or a non-monomial one) yields nothing.\n *\n * Pure; reads the registries, writes nothing.\n *\n * @internal\n */\nexport function deriveProposedBridges(\n  candidates: readonly VettedCandidate[] = rankDiscoveries(CANONICAL_GRAPH),\n): readonly ProposedBridge[] {\n  const out: ProposedBridge[] = [];\n  for (const cand of candidates) {\n    if (cand.verdict !== 'promising') continue;\n    const [t0, t1] = [cand.a, cand.b].sort();\n    // Enumerate every admissible source pair (de-ambiguation by enumeration).\n    for (const E1 of resolveSources(t0)) {\n      for (const E2 of resolveSources(t1)) {\n        const p = derivePair(cand, t0, t1, E1, E2);\n        if (p) out.push(p);\n      }\n    }\n  }\n  return disambiguateIds(dedupByNormalForm(out));\n}\n\n/** Derive one proposal from a fixed source pair, or null if inadmissible. */\nfunction derivePair(\n  cand: VettedCandidate,\n  t0: string,\n  t1: string,\n  E1: EquationSource,\n  E2: EquationSource,\n): ProposedBridge | null {\n  let m1: Mono;\n  let m2: Mono;\n  try {\n    m1 = toMonomial(E1.scalarAst);\n    m2 = toMonomial(E2.scalarAst);\n  } catch (e) {\n    if (e instanceof NotAMonomialError) return null;\n    throw e;\n  }\n\n  const solveFor = uniqueNonConstantLeaf(m2);\n  if (!solveFor) return null; // no single observable to isolate\n  if (m1.has(solveFor.name)) return null; // degenerate overlap (Design §5.2)\n\n  // Isolate solveFor from `m1 = m2`:  solveFor^e = m1 / (m2 without solveFor).\n  const result = isolateLeaf(m1, m2, solveFor);\n\n  const scalarAst = fromMonomial(result);\n  const dim = validate(scalarAst).inferredDimension;\n  if (!dim || !equals(dim, solveFor.dim)) return null; // round-trip guard\n\n  const governing: DimensionalVariable[] = [...result]\n    .filter(([name]) => !isConstant(name))\n    .map(([name, { dim: d }]) => ({ name, dim: d }));\n\n  const src = (e: EquationSource) => `${e.id} (${e.kind}, ${e.grade})`;\n  const provenance =\n    `Monomial elimination of the UNADJUDICATED identification ${cand.a} ≡ ${cand.b} ` +\n    `(${src(E1)}.rhs = ${src(E2)}.rhs), solved for '${solveFor.name}'. ` +\n    `Algebraic consequence of a hypothesised identity — NOT a new physical ` +\n    `relation and NOT a bridge. Invertible (any free leaf may be isolated).`;\n\n  return {\n    id: `IC-${t0}--${t1}--${solveFor.name}`,\n    derivedFrom: {\n      identification: { a: cand.a, b: cand.b, dim: cand.dim },\n      sourceEquationIds: [E1.id, E2.id],\n      solvedFor: solveFor.name,\n    },\n    target: { name: solveFor.name, dim: solveFor.dim },\n    governing,\n    formulaLatex: `${solveFor.name} = ${latexFromMono(result)}`,\n    scalarAst,\n    dimensionalSignature: format(dim),\n    provenance,\n    alsoDerivableFrom: [],\n    status: 'unadjudicated',\n    evaluate: (values) => evalExpr(scalarAst, values),\n  };\n}\n\n/** Make ids unique: when distinct proposals (different source pairs) collide on\n *  the base `IC-<a>--<b>--<solveFor>` id, suffix each with its source pair. */\nfunction disambiguateIds(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const counts = new Map<string, number>();\n  for (const p of proposals) counts.set(p.id, (counts.get(p.id) ?? 0) + 1);\n  return proposals.map((p) =>\n    (counts.get(p.id) ?? 0) > 1\n      ? { ...p, id: `${p.id}--${p.derivedFrom.sourceEquationIds.join('+')}` }\n      : p,\n  );\n}\n\n/**\n * The hash a proposal dedupes under: `normalForm` of its monomial rebuilt\n * from the exact exponents (so `0.3333333333333333` and\n * `0.33333333333333337` are one `1/3`), or of the AST itself when it is not\n * a monomial.\n */\nfunction dedupKey(p: ProposedBridge): string {\n  let canonical: ExprNode = p.scalarAst;\n  try {\n    canonical = fromMonomial(toMonomial(p.scalarAst));\n  } catch (err) {\n    if (!(err instanceof NotAMonomialError)) throw err;\n  }\n  return `${normalForm(canonical)}::${p.dimensionalSignature}`;\n}\n\n/**\n * Collapse proposals that derive the SAME relation — equal `normalForm` (up to\n * dimensionless constants) of the exact monomial AND equal target dimension —\n * into the first, recording the others' identifications in\n * `alsoDerivableFrom`. Distinct stubs do NOT collapse (e.g. Landauer's dropped\n * `ln2` vs an operator stub hash differently), so this only merges genuine\n * structural twins that a wider candidate scope can produce (Design §9 #2).\n * Deterministic: input order is preserved.\n *\n * @internal\n */\nexport function dedupByNormalForm(\n  proposals: readonly ProposedBridge[],\n): readonly ProposedBridge[] {\n  const byKey = new Map<string, ProposedBridge>();\n  const order: string[] = [];\n  const extras = new Map<string, string[]>();\n\n  for (const p of proposals) {\n    let key = dedupKey(p);\n    // On a hash miss, the algebraic step: a kept proposal of the same dimension\n    // that is this one up to a constant owns the key (`a/(b/c)` for `a·c/b`).\n    if (!byKey.has(key)) {\n      const twin = order.find((k) => {\n        const candidate = byKey.get(k)!;\n        return candidate.dimensionalSignature === p.dimensionalSignature && equalUpToConstant(candidate.scalarAst, p.scalarAst).equal;\n      });\n      if (twin !== undefined) key = twin;\n    }\n    const kept = byKey.get(key);\n    if (kept === undefined) {\n      byKey.set(key, p);\n      order.push(key);\n      extras.set(key, [...p.alsoDerivableFrom]);\n    } else {\n      const tag = `${p.derivedFrom.identification.a} ≡ ${p.derivedFrom.identification.b}`;\n      extras.get(key)!.push(tag, ...p.alsoDerivableFrom);\n    }\n  }\n\n  return order.map((key) => {\n    const p = byKey.get(key)!;\n    const merged = [...new Set(extras.get(key)!)].sort();\n    return merged.length === p.alsoDerivableFrom.length\n      ? p\n      : { ...p, alsoDerivableFrom: merged };\n  });\n}\n\n// ── promotion gate (guardrail #5) ───────────────────────────────────────────\n\n/** The human inputs a proposal CANNOT supply — fabricating them is forbidden. */\ninterface PromotionEvidence {\n  /** Literature anchor establishing the relation (appears / contradicts / neither). */\n  readonly citation: string;\n  /** Human-chosen catalog status — never defaulted. */\n  readonly status: BridgeEquationStatus;\n  /** Path to the recorded adversarial + literature review. */\n  readonly reviewRef: string;\n}\n\n/** A review-ready promotion request — the artifact a human turns into a catalog\n *  entry. Holding one does NOT mutate `BRIDGE_EQUATIONS`. */\ninterface PromotionRequest {\n  readonly proposal: ProposedBridge;\n  readonly evidence: PromotionEvidence;\n}\n\n/** Thrown when a proposal is promoted without the evidence the promotion requires. @internal */\nexport class MissingEvidenceError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'MissingEvidenceError';\n  }\n}\n\n/**\n * Gate a proposal toward the catalog. THROWS `MissingEvidenceError` unless every\n * human input is present and non-blank (operationalises \"null, not guessed\").\n * Returns a `PromotionRequest`; it deliberately does NOT synthesise a\n * `BridgeEquationEntry` — the physics-judgment fields are human work.\n *\n * @internal\n */\nexport function promoteProposal(\n  proposal: ProposedBridge,\n  evidence: PromotionEvidence,\n): PromotionRequest {\n  const blank = (s: unknown): boolean => typeof s !== 'string' || s.trim() === '';\n  if (blank(evidence.citation)) throw new MissingEvidenceError('citation required');\n  if (blank(evidence.reviewRef)) throw new MissingEvidenceError('reviewRef required');\n  if (!evidence.status) throw new MissingEvidenceError('status required (not defaulted)');\n  return { proposal, evidence };\n}\n\n// ── PROPOSED_BRIDGES review surface (catalog field-shape, own registry) ──────\n\n/**\n * A derived proposal in the catalog's field SHAPE, for review — but in its OWN\n * registry and carrying `status: 'unadjudicated'` (NOT a `BridgeEquationStatus`).\n * This is deliberately NOT a `BridgeEquationEntry`: it omits the spec-only fields\n * (`source_part`/`source_section`/numeric `id`) and never enters `BRIDGE_EQUATIONS`,\n * which stays the faithful encoding of the specification.\n *\n * @internal\n */\ninterface ProposedBridgeEntry {\n  readonly id: string;\n  readonly name: string;\n  readonly category: 'Z';\n  readonly category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)';\n  /** The two regimes bridged — the source equations' domains. */\n  readonly bridges: readonly [string, string];\n  /** ALWAYS 'unadjudicated' — not a catalog status. */\n  readonly status: 'unadjudicated';\n  readonly context: string;\n  readonly formula_latex: string;\n  readonly dimensional_signature: string;\n  /** Honest references: a derivation note + the SOURCE equations' citations,\n   *  never a fabricated citation for the derived relation itself. */\n  readonly references: readonly string[];\n  readonly known_issues: readonly KnownIssue[];\n  readonly derivedFrom: ProposedBridge['derivedFrom'];\n  readonly notes: string;\n}\n\n/** Domain label + citations for a source id — canonical (`CE-…`) or bridge\n *  (`BE-<n>`), so the entry surface works for either source kind. */\nfunction equationMeta(id: string): { domain: string; references: readonly string[] } {\n  const ce = canonicalById(id);\n  if (ce) return { domain: ce.domain, references: ce.references };\n  const n = catalogIdNumber(id);\n  const be = n === undefined ? undefined : BRIDGE_EQUATIONS.find((e) => e.id === n);\n  if (be) return { domain: `${be.bridges[0]}↔${be.bridges[1]} (${be.status})`, references: be.references };\n  return { domain: 'unknown', references: [] };\n}\n\n/** Render a `ProposedBridge` into the catalog field-shape, filled honestly. @internal */\nexport function toProposedEntry(p: ProposedBridge): ProposedBridgeEntry {\n  const [id1, id2] = p.derivedFrom.sourceEquationIds;\n  const M1 = equationMeta(id1);\n  const M2 = equationMeta(id2);\n  const { a, b } = p.derivedFrom.identification;\n  const srcRefs = [\n    [id1, M1] as const,\n    [id2, M2] as const,\n  ].flatMap(([id, m]) => m.references.map((r) => `source ${id}: ${r}`));\n  return {\n    id: p.id,\n    name: `${a} ≡ ${b} ⇒ ${p.derivedFrom.solvedFor} (derived)`,\n    category: 'Z',\n    category_name: 'Machine-Derived Identity Consequences (UNADJUDICATED)',\n    bridges: [M1.domain, M2.domain],\n    status: 'unadjudicated',\n    context:\n      `Algebraic consequence of the UNADJUDICATED identification ${a} ≡ ${b} ` +\n      `(${id1}.rhs = ${id2}.rhs), solved for ${p.derivedFrom.solvedFor}. A ` +\n      `dimensional coincidence surfaced by the discovery funnel — no physical ` +\n      `mechanism is asserted, and it is NOT a bridge.`,\n    formula_latex: p.formulaLatex,\n    dimensional_signature: p.dimensionalSignature,\n    references: [\n      'Machine-derived; the combined relation has no independent literature.',\n      ...srcRefs,\n    ],\n    known_issues: [\n      {\n        severity: 'phenomenological-ansatz',\n        description:\n          'Machine-derived dimensional coincidence: the algebraic consequence ' +\n          'of an unadjudicated identification, with no mechanism and no ' +\n          'independent literature. Promotion to BRIDGE_EQUATIONS requires an ' +\n          'adversarial + literature review (Part-VI §XXVII-B) via promoteProposal().',\n        fixable: 'unknown',\n      },\n    ],\n    derivedFrom: p.derivedFrom,\n    notes:\n      p.provenance +\n      (p.alsoDerivableFrom.length\n        ? ` Also derivable from: ${p.alsoDerivableFrom.join('; ')}.`\n        : ''),\n  };\n}\n\n/**\n * The PROPOSED-BRIDGE review surface: derived identity-consequences in the\n * catalog's field shape, in their OWN registry, every entry `status:\n * 'unadjudicated'`. Separate from `BRIDGE_EQUATIONS` (the faithful spec\n * encoding), which this never mutates. Default scope: canonical-only — widen with\n * `deriveProposedBridges(rankDiscoveries(graph)).map(toProposedEntry)`.\n *\n * @internal\n */\nexport const PROPOSED_BRIDGES: readonly ProposedBridgeEntry[] =\n  deriveProposedBridges().map(toProposedEntry);\n"]}

package/dist/composition/quantity-clusters.d.ts

@@ -0,0 +1,48 @@
+/**
+ * The one component owner: items that share a (canonical) quantity are one cluster.
+ *
+ * `linkageMap` (equations sharing a quantity), `buildVizModel` (junctions sharing a quantity,
+ * with a proposed or user overlay) and the discovery funnel (quantities sharing an equation or
+ * an identification) each once ran their own union-find with the same ordering. This module is
+ * that partition, computed through MathTS `connectedComponents` over an adjacency of item
+ * indices, with the ordering every caller used: a cluster keeps its items in input order, and
+ * clusters come largest first, then by the id of their first item. The anchoring rules differ
+ * between callers on purpose (`graph-viz.ts` anchors on `law` or `established` status,
+ * `bridge-analysis.ts` on `established` confidence) and stay with each caller.
+ *
+ * @module composition/quantity-clusters
+ */
+/**
+ * Quantity-name canonicalizer honouring `QUANTITY_IDENTIFICATIONS`: maps each name to its
+ * identified representative (`hawking-temperature` → `temperature`) and leaves every other
+ * name alone. The linkage substrate of `linkageMap`, `proposeLinkCandidates` and the visual
+ * map. `anchoringDistance` deliberately does NOT use it (it links on raw names; its 0/∞
+ * distance contract is pinned).
+ *
+ * @internal
+ */
+export declare function quantityCanonicalizer(): (name: string) => string;
+/**
+ * Group items by one key, keys in first-seen order, members in input order. The group-by
+ * every cluster consumer once re-inlined as `if (!m.has(k)) m.set(k, []); m.get(k)!.push(v)`.
+ *
+ * @internal
+ */
+export declare function groupInto<K, V>(items: readonly V[], keyOf: (item: V) => K): Map<K, V[]>;
+/**
+ * Partition `items` into clusters of items that share at least one key (transitively): the
+ * connected components, through MathTS `connectedComponents`, of the graph whose nodes are item
+ * indices and whose links join items with a key in common. Each cluster lists its items in
+ * input order; clusters come largest first, then by `idOf` of their first item (by that item's
+ * input position when no `idOf` is given). An item with no key is a cluster of its own; an
+ * empty input is no cluster.
+ *
+ * Cost: `connectedComponents` takes a dense n×n adjacency matrix, so memory is O(n²) in the
+ * number of items (8·n² bytes as numbers: about 4 MB at n = 700, the order of the quantity
+ * names one discovery context clusters, once per context; 800 MB at n = 10 000). A caller with
+ * thousands of items should expect that, or cluster with a union-find over the key lists.
+ *
+ * @internal
+ */
+export declare function clusterBySharedKeys<T>(items: readonly T[], keysOf: (item: T) => readonly string[], idOf?: (item: T) => string): T[][];
+//# sourceMappingURL=quantity-clusters.d.ts.map

package/dist/composition/quantity-clusters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantity-clusters.d.ts","sourceRoot":"","sources":["../../src/composition/quantity-clusters.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,IAAI,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAGhE;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CASvF;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,EACtC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GACzB,CAAC,EAAE,EAAE,CAgCP"}

package/dist/composition/quantity-clusters.js

@@ -0,0 +1,98 @@
+/**
+ * The one component owner: items that share a (canonical) quantity are one cluster.
+ *
+ * `linkageMap` (equations sharing a quantity), `buildVizModel` (junctions sharing a quantity,
+ * with a proposed or user overlay) and the discovery funnel (quantities sharing an equation or
+ * an identification) each once ran their own union-find with the same ordering. This module is
+ * that partition, computed through MathTS `connectedComponents` over an adjacency of item
+ * indices, with the ordering every caller used: a cluster keeps its items in input order, and
+ * clusters come largest first, then by the id of their first item. The anchoring rules differ
+ * between callers on purpose (`graph-viz.ts` anchors on `law` or `established` status,
+ * `bridge-analysis.ts` on `established` confidence) and stay with each caller.
+ *
+ * @module composition/quantity-clusters
+ */
+import { connectedComponents } from '@danielsimonjr/mathts-functions';
+import { QUANTITY_IDENTIFICATIONS } from './compose.js';
+/**
+ * Quantity-name canonicalizer honouring `QUANTITY_IDENTIFICATIONS`: maps each name to its
+ * identified representative (`hawking-temperature` → `temperature`) and leaves every other
+ * name alone. The linkage substrate of `linkageMap`, `proposeLinkCandidates` and the visual
+ * map. `anchoringDistance` deliberately does NOT use it (it links on raw names; its 0/∞
+ * distance contract is pinned).
+ *
+ * @internal
+ */
+export function quantityCanonicalizer() {
+    const alias = new Map(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));
+    return (n) => alias.get(n) ?? n;
+}
+/**
+ * Group items by one key, keys in first-seen order, members in input order. The group-by
+ * every cluster consumer once re-inlined as `if (!m.has(k)) m.set(k, []); m.get(k)!.push(v)`.
+ *
+ * @internal
+ */
+export function groupInto(items, keyOf) {
+    const out = new Map();
+    for (const item of items) {
+        const k = keyOf(item);
+        const group = out.get(k);
+        if (group === undefined)
+            out.set(k, [item]);
+        else
+            group.push(item);
+    }
+    return out;
+}
+/**
+ * Partition `items` into clusters of items that share at least one key (transitively): the
+ * connected components, through MathTS `connectedComponents`, of the graph whose nodes are item
+ * indices and whose links join items with a key in common. Each cluster lists its items in
+ * input order; clusters come largest first, then by `idOf` of their first item (by that item's
+ * input position when no `idOf` is given). An item with no key is a cluster of its own; an
+ * empty input is no cluster.
+ *
+ * Cost: `connectedComponents` takes a dense n×n adjacency matrix, so memory is O(n²) in the
+ * number of items (8·n² bytes as numbers: about 4 MB at n = 700, the order of the quantity
+ * names one discovery context clusters, once per context; 800 MB at n = 10 000). A caller with
+ * thousands of items should expect that, or cluster with a union-find over the key lists.
+ *
+ * @internal
+ */
+export function clusterBySharedKeys(items, keysOf, idOf) {
+    const n = items.length;
+    if (n === 0)
+        return [];
+    // Items sharing a key: the first holder of the key is linked to every later holder, which is
+    // enough for connectivity (a star joins the whole set).
+    const holders = new Map();
+    items.forEach((item, i) => {
+        for (const key of keysOf(item)) {
+            const list = holders.get(key);
+            if (list === undefined)
+                holders.set(key, [i]);
+            else
+                list.push(i);
+        }
+    });
+    const adjacency = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (const idxs of holders.values()) {
+        for (let k = 1; k < idxs.length; k++) {
+            adjacency[idxs[0]][idxs[k]] = 1;
+            adjacency[idxs[k]][idxs[0]] = 1;
+        }
+    }
+    const components = connectedComponents(adjacency);
+    const clusters = components.map((idxs) => [...idxs].sort((a, b) => a - b));
+    const first = (c) => idOf === undefined ? String(c[0]).padStart(12, '0') : idOf(items[c[0]]);
+    clusters.sort((a, b) => b.length - a.length || first(a).localeCompare(first(b)));
+    // Every item is placed exactly once: a component listing that dropped or repeated an index
+    // would be the instrument reporting its own breakage, so say so rather than render it.
+    const placed = clusters.reduce((acc, c) => acc + c.length, 0);
+    if (placed !== n || new Set(clusters.flat()).size !== n) {
+        throw new Error(`clusterBySharedKeys: ${placed} placements over ${n} items`);
+    }
+    return clusters.map((c) => c.map((i) => items[i]));
+}
+//# sourceMappingURL=quantity-clusters.js.map

package/dist/composition/quantity-clusters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quantity-clusters.js","sourceRoot":"","sources":["../../src/composition/quantity-clusters.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AAExD;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAiB,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO,CAAC,CAAS,EAAU,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAO,KAAmB,EAAE,KAAqB;IACxE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;;YACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAmB,EACnB,MAAsC,EACtC,IAA0B;IAE1B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvB,6FAA6F;IAC7F,wDAAwD;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACxB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;;gBACzC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC,CAAC,CAAC;IACH,MAAM,SAAS,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAChC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IACD,MAAM,UAAU,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,CAAC,CAAoB,EAAU,EAAE,CAC7C,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,2FAA2F;IAC3F,uFAAuF;IACvF,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,IAAI,MAAM,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CAAC,wBAAwB,MAAM,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAC/E,CAAC;IACD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC","sourcesContent":["/**\n * The one component owner: items that share a (canonical) quantity are one cluster.\n *\n * `linkageMap` (equations sharing a quantity), `buildVizModel` (junctions sharing a quantity,\n * with a proposed or user overlay) and the discovery funnel (quantities sharing an equation or\n * an identification) each once ran their own union-find with the same ordering. This module is\n * that partition, computed through MathTS `connectedComponents` over an adjacency of item\n * indices, with the ordering every caller used: a cluster keeps its items in input order, and\n * clusters come largest first, then by the id of their first item. The anchoring rules differ\n * between callers on purpose (`graph-viz.ts` anchors on `law` or `established` status,\n * `bridge-analysis.ts` on `established` confidence) and stay with each caller.\n *\n * @module composition/quantity-clusters\n */\n\nimport { connectedComponents } from '@danielsimonjr/mathts-functions';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\n\n/**\n * Quantity-name canonicalizer honouring `QUANTITY_IDENTIFICATIONS`: maps each name to its\n * identified representative (`hawking-temperature` → `temperature`) and leaves every other\n * name alone. The linkage substrate of `linkageMap`, `proposeLinkCandidates` and the visual\n * map. `anchoringDistance` deliberately does NOT use it (it links on raw names; its 0/∞\n * distance contract is pinned).\n *\n * @internal\n */\nexport function quantityCanonicalizer(): (name: string) => string {\n  const alias = new Map<string, string>(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));\n  return (n: string): string => alias.get(n) ?? n;\n}\n\n/**\n * Group items by one key, keys in first-seen order, members in input order. The group-by\n * every cluster consumer once re-inlined as `if (!m.has(k)) m.set(k, []); m.get(k)!.push(v)`.\n *\n * @internal\n */\nexport function groupInto<K, V>(items: readonly V[], keyOf: (item: V) => K): Map<K, V[]> {\n  const out = new Map<K, V[]>();\n  for (const item of items) {\n    const k = keyOf(item);\n    const group = out.get(k);\n    if (group === undefined) out.set(k, [item]);\n    else group.push(item);\n  }\n  return out;\n}\n\n/**\n * Partition `items` into clusters of items that share at least one key (transitively): the\n * connected components, through MathTS `connectedComponents`, of the graph whose nodes are item\n * indices and whose links join items with a key in common. Each cluster lists its items in\n * input order; clusters come largest first, then by `idOf` of their first item (by that item's\n * input position when no `idOf` is given). An item with no key is a cluster of its own; an\n * empty input is no cluster.\n *\n * Cost: `connectedComponents` takes a dense n×n adjacency matrix, so memory is O(n²) in the\n * number of items (8·n² bytes as numbers: about 4 MB at n = 700, the order of the quantity\n * names one discovery context clusters, once per context; 800 MB at n = 10 000). A caller with\n * thousands of items should expect that, or cluster with a union-find over the key lists.\n *\n * @internal\n */\nexport function clusterBySharedKeys<T>(\n  items: readonly T[],\n  keysOf: (item: T) => readonly string[],\n  idOf?: (item: T) => string,\n): T[][] {\n  const n = items.length;\n  if (n === 0) return [];\n  // Items sharing a key: the first holder of the key is linked to every later holder, which is\n  // enough for connectivity (a star joins the whole set).\n  const holders = new Map<string, number[]>();\n  items.forEach((item, i) => {\n    for (const key of keysOf(item)) {\n      const list = holders.get(key);\n      if (list === undefined) holders.set(key, [i]);\n      else list.push(i);\n    }\n  });\n  const adjacency: number[][] = Array.from({ length: n }, () => new Array<number>(n).fill(0));\n  for (const idxs of holders.values()) {\n    for (let k = 1; k < idxs.length; k++) {\n      adjacency[idxs[0]][idxs[k]] = 1;\n      adjacency[idxs[k]][idxs[0]] = 1;\n    }\n  }\n  const components = connectedComponents(adjacency);\n  const clusters = components.map((idxs) => [...idxs].sort((a, b) => a - b));\n  const first = (c: readonly number[]): string =>\n    idOf === undefined ? String(c[0]).padStart(12, '0') : idOf(items[c[0]]);\n  clusters.sort((a, b) => b.length - a.length || first(a).localeCompare(first(b)));\n  // Every item is placed exactly once: a component listing that dropped or repeated an index\n  // would be the instrument reporting its own breakage, so say so rather than render it.\n  const placed = clusters.reduce((acc, c) => acc + c.length, 0);\n  if (placed !== n || new Set(clusters.flat()).size !== n) {\n    throw new Error(`clusterBySharedKeys: ${placed} placements over ${n} items`);\n  }\n  return clusters.map((c) => c.map((i) => items[i]));\n}\n"]}

package/dist/composition/rational-exponent.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Exact rationals from doubles, for exponents and prefactors.
+ *
+ * A monomial exponent read from an AST literal (`0.5`, `0.3333333333333333`)
+ * and a prefactor recovered by a fit are doubles that stand for small
+ * rationals. This module turns one into a core `Fraction` when a rational
+ * with a bounded denominator reproduces it to a stated relative tolerance,
+ * and refuses otherwise, so an irrational is never approximated into a
+ * rational and a rounding error never becomes a denominator of 10¹⁶.
+ *
+ * `Fraction.fromNumber(x, cap)` is asked first. Before `@danielsimonjr/mathts-core`
+ * 0.18.1 it could return a denominator above its cap; the cap and the tolerance
+ * are still checked here, which costs nothing and catches a regression. When that answer is refused, a bounded-denominator scan (the one
+ * `dimensional/buckingham.ts` uses for dimension exponents) is the second
+ * method, so a rational the continued fraction stepped past is still found.
+ *
+ * @module composition/rational-exponent
+ */
+import { Fraction } from '@danielsimonjr/mathts-core';
+/** The denominator cap the Buckingham enumerator uses for exponents. @internal */
+export declare const DEFAULT_MAX_DENOMINATOR = 720;
+/** Options of {@link rationalize}. @internal */
+export interface RationalizeOptions {
+    /** Largest denominator accepted (default {@link DEFAULT_MAX_DENOMINATOR}). */
+    readonly maxDenominator?: number;
+    /** Relative tolerance `|n/d − x| ≤ tolerance·|x|` (default 1e-9); for `x = 0` the match is exact. */
+    readonly tolerance?: number;
+}
+/**
+ * The rational with denominator ≤ `maxDenominator` that reproduces `x` to
+ * the tolerance, or `undefined` when there is none.
+ *
+ * @internal
+ */
+export declare function rationalize(x: number, options?: RationalizeOptions): Fraction | undefined;
+/** The double a fraction stands for (numerator over denominator, one rounding). @internal */
+export declare function fractionToNumber(f: Fraction): number;
+/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator. @internal */
+export declare function formatRational(f: Fraction): string;
+//# sourceMappingURL=rational-exponent.d.ts.map

package/dist/composition/rational-exponent.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rational-exponent.d.ts","sourceRoot":"","sources":["../../src/composition/rational-exponent.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,kFAAkF;AAClF,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAE3C,gDAAgD;AAChD,MAAM,WAAW,kBAAkB;IACjC,8EAA8E;IAC9E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,qGAAqG;IACrG,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAQD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,QAAQ,GAAG,SAAS,CAiB7F;AAED,6FAA6F;AAC7F,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAEpD;AAED,8FAA8F;AAC9F,wBAAgB,cAAc,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAElD"}

package/dist/composition/rational-exponent.js

@@ -0,0 +1,65 @@
+/**
+ * Exact rationals from doubles, for exponents and prefactors.
+ *
+ * A monomial exponent read from an AST literal (`0.5`, `0.3333333333333333`)
+ * and a prefactor recovered by a fit are doubles that stand for small
+ * rationals. This module turns one into a core `Fraction` when a rational
+ * with a bounded denominator reproduces it to a stated relative tolerance,
+ * and refuses otherwise, so an irrational is never approximated into a
+ * rational and a rounding error never becomes a denominator of 10¹⁶.
+ *
+ * `Fraction.fromNumber(x, cap)` is asked first. Before `@danielsimonjr/mathts-core`
+ * 0.18.1 it could return a denominator above its cap; the cap and the tolerance
+ * are still checked here, which costs nothing and catches a regression. When that answer is refused, a bounded-denominator scan (the one
+ * `dimensional/buckingham.ts` uses for dimension exponents) is the second
+ * method, so a rational the continued fraction stepped past is still found.
+ *
+ * @module composition/rational-exponent
+ */
+import { Fraction } from '@danielsimonjr/mathts-core';
+/** The denominator cap the Buckingham enumerator uses for exponents. @internal */
+export const DEFAULT_MAX_DENOMINATOR = 720;
+function within(candidate, x, tolerance) {
+    const value = fractionToNumber(candidate);
+    if (x === 0)
+        return value === 0;
+    return Math.abs(value - x) <= tolerance * Math.abs(x);
+}
+/**
+ * The rational with denominator ≤ `maxDenominator` that reproduces `x` to
+ * the tolerance, or `undefined` when there is none.
+ *
+ * @internal
+ */
+export function rationalize(x, options = {}) {
+    if (!Number.isFinite(x))
+        return undefined;
+    const maxDenominator = options.maxDenominator ?? DEFAULT_MAX_DENOMINATOR;
+    const tolerance = options.tolerance ?? 1e-9;
+    if (Number.isInteger(x))
+        return new Fraction(x, 1);
+    const guess = Fraction.fromNumber(x, BigInt(maxDenominator));
+    if (guess.denominator <= BigInt(maxDenominator) && within(guess, x, tolerance))
+        return guess;
+    for (let d = 1; d <= maxDenominator; d++) {
+        const n = Math.round(x * d);
+        // A safe-integer n/d is the same correctly rounded quotient as the reduced
+        // fraction's, so a miss is decided on doubles and no Fraction is built for it
+        // (the clean-prefactor rule asks this 43,200 times for one miss).
+        if (Number.isSafeInteger(n) && !(Math.abs(n / d - x) <= tolerance * Math.abs(x)))
+            continue;
+        const candidate = new Fraction(n, d);
+        if (within(candidate, x, tolerance))
+            return candidate;
+    }
+    return undefined;
+}
+/** The double a fraction stands for (numerator over denominator, one rounding). @internal */
+export function fractionToNumber(f) {
+    return Number(f.numerator) / Number(f.denominator);
+}
+/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator. @internal */
+export function formatRational(f) {
+    return f.denominator === 1n ? f.numerator.toString() : `${f.numerator}/${f.denominator}`;
+}
+//# sourceMappingURL=rational-exponent.js.map

package/dist/composition/rational-exponent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rational-exponent.js","sourceRoot":"","sources":["../../src/composition/rational-exponent.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,kFAAkF;AAClF,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAU3C,SAAS,MAAM,CAAC,SAAmB,EAAE,CAAS,EAAE,SAAiB;IAC/D,MAAM,KAAK,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,OAAO,GAAuB,EAAE;IACrE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1C,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,uBAAuB,CAAC;IACzE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;IAC7D,IAAI,KAAK,CAAC,WAAW,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,2EAA2E;QAC3E,8EAA8E;QAC9E,kEAAkE;QAClE,IAAI,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3F,MAAM,SAAS,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;IACxD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,gBAAgB,CAAC,CAAW;IAC1C,OAAO,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;AACrD,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,cAAc,CAAC,CAAW;IACxC,OAAO,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;AAC3F,CAAC","sourcesContent":["/**\n * Exact rationals from doubles, for exponents and prefactors.\n *\n * A monomial exponent read from an AST literal (`0.5`, `0.3333333333333333`)\n * and a prefactor recovered by a fit are doubles that stand for small\n * rationals. This module turns one into a core `Fraction` when a rational\n * with a bounded denominator reproduces it to a stated relative tolerance,\n * and refuses otherwise, so an irrational is never approximated into a\n * rational and a rounding error never becomes a denominator of 10¹⁶.\n *\n * `Fraction.fromNumber(x, cap)` is asked first. Before `@danielsimonjr/mathts-core`\n * 0.18.1 it could return a denominator above its cap; the cap and the tolerance\n * are still checked here, which costs nothing and catches a regression. When that answer is refused, a bounded-denominator scan (the one\n * `dimensional/buckingham.ts` uses for dimension exponents) is the second\n * method, so a rational the continued fraction stepped past is still found.\n *\n * @module composition/rational-exponent\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\n\n/** The denominator cap the Buckingham enumerator uses for exponents. @internal */\nexport const DEFAULT_MAX_DENOMINATOR = 720;\n\n/** Options of {@link rationalize}. @internal */\nexport interface RationalizeOptions {\n  /** Largest denominator accepted (default {@link DEFAULT_MAX_DENOMINATOR}). */\n  readonly maxDenominator?: number;\n  /** Relative tolerance `|n/d − x| ≤ tolerance·|x|` (default 1e-9); for `x = 0` the match is exact. */\n  readonly tolerance?: number;\n}\n\nfunction within(candidate: Fraction, x: number, tolerance: number): boolean {\n  const value = fractionToNumber(candidate);\n  if (x === 0) return value === 0;\n  return Math.abs(value - x) <= tolerance * Math.abs(x);\n}\n\n/**\n * The rational with denominator ≤ `maxDenominator` that reproduces `x` to\n * the tolerance, or `undefined` when there is none.\n *\n * @internal\n */\nexport function rationalize(x: number, options: RationalizeOptions = {}): Fraction | undefined {\n  if (!Number.isFinite(x)) return undefined;\n  const maxDenominator = options.maxDenominator ?? DEFAULT_MAX_DENOMINATOR;\n  const tolerance = options.tolerance ?? 1e-9;\n  if (Number.isInteger(x)) return new Fraction(x, 1);\n  const guess = Fraction.fromNumber(x, BigInt(maxDenominator));\n  if (guess.denominator <= BigInt(maxDenominator) && within(guess, x, tolerance)) return guess;\n  for (let d = 1; d <= maxDenominator; d++) {\n    const n = Math.round(x * d);\n    // A safe-integer n/d is the same correctly rounded quotient as the reduced\n    // fraction's, so a miss is decided on doubles and no Fraction is built for it\n    // (the clean-prefactor rule asks this 43,200 times for one miss).\n    if (Number.isSafeInteger(n) && !(Math.abs(n / d - x) <= tolerance * Math.abs(x))) continue;\n    const candidate = new Fraction(n, d);\n    if (within(candidate, x, tolerance)) return candidate;\n  }\n  return undefined;\n}\n\n/** The double a fraction stands for (numerator over denominator, one rounding). @internal */\nexport function fractionToNumber(f: Fraction): number {\n  return Number(f.numerator) / Number(f.denominator);\n}\n\n/** `9/8`, `2`, `-1/3`: the fraction in lowest terms, no sign on the denominator. @internal */\nexport function formatRational(f: Fraction): string {\n  return f.denominator === 1n ? f.numerator.toString() : `${f.numerator}/${f.denominator}`;\n}\n"]}

package/dist/composition/representative-values.d.ts

@@ -34,7 +34,29 @@ export interface RepresentativeValue {
     readonly value: number;
     /** Provenance — how the estimate is obtained (a citation or a one-liner). */
     readonly source: string;
+    /**
+     * The value's stated uncertainty, as a standard deviation in decades of `log10|value|`.
+     * Absent means {@link DEFAULT_SIGMA_DECADES}, the table's "good to about one order"; a row
+     * states another only with a source for it. The graded magnitude gate
+     * (`discovery.ts`, `magnitudeP`) reads it; the verdict threshold does not.
+     */
+    readonly sigmaDecades?: number;
 }
+/**
+ * The σ in decades a representative value carries when its row states none: one decade, the
+ * precision this table has always claimed ("good to ~1 order"). Not a per-row measurement.
+ *
+ * @internal
+ */
+export declare const DEFAULT_SIGMA_DECADES = 1;
+/**
+ * The σ in decades of a representative value: its own `sigmaDecades`, else the default. A stated
+ * σ that is not a finite number > 0 is refused with a `RangeError` naming the row's source: σ = 0
+ * would make the falsifier's strength 0 (certain) and a negative or NaN σ would make it NaN.
+ *
+ * @internal
+ */
+export declare function sigmaDecadesOf(rv: RepresentativeValue): number;
 /**
  * Scale-specific quantities only. Keyed by the canonical quantity name used in
  * the composition graph. Generic quantities are intentionally omitted.

package/dist/composition/representative-values.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"representative-values.d.ts","sourceRoot":"","sources":["../../src/composition/representative-values.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,qEAAqE;AACrE,MAAM,WAAW,mBAAmB;IAClC,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAC1C,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CA0DpC,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,GACX,mBAAmB,GAAG,SAAS,CAEjC"}
+{"version":3,"file":"representative-values.d.ts","sourceRoot":"","sources":["../../src/composition/representative-values.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,qEAAqE;AACrE,MAAM,WAAW,mBAAmB;IAClC,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAChC;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAEvC;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,mBAAmB,GAAG,MAAM,CAS9D;AAED;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAC1C,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CA0DpC,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,GACX,mBAAmB,GAAG,SAAS,CAEjC"}

package/dist/composition/representative-values.js

@@ -28,6 +28,29 @@
  *
  * @module composition/representative-values
  */
+/**
+ * The σ in decades a representative value carries when its row states none: one decade, the
+ * precision this table has always claimed ("good to ~1 order"). Not a per-row measurement.
+ *
+ * @internal
+ */
+export const DEFAULT_SIGMA_DECADES = 1;
+/**
+ * The σ in decades of a representative value: its own `sigmaDecades`, else the default. A stated
+ * σ that is not a finite number > 0 is refused with a `RangeError` naming the row's source: σ = 0
+ * would make the falsifier's strength 0 (certain) and a negative or NaN σ would make it NaN.
+ *
+ * @internal
+ */
+export function sigmaDecadesOf(rv) {
+    const sigma = rv.sigmaDecades;
+    if (sigma === undefined)
+        return DEFAULT_SIGMA_DECADES;
+    if (!(Number.isFinite(sigma) && sigma > 0)) {
+        throw new RangeError(`representative value sigmaDecades ${String(sigma)} (source: ${rv.source}) must be a finite number > 0 decades`);
+    }
+    return sigma;
+}
 /**
  * Scale-specific quantities only. Keyed by the canonical quantity name used in
  * the composition graph. Generic quantities are intentionally omitted.