universal-physics-tensor 9.0.0 → 10.0.0

package/dist/composition/discovery.js.map

@@ -1 +1 @@
-{"version":3,"file":"discovery.js","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAIH,OAAO,EAAE,wBAAwB,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAC7E,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAE7D,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAEnD,8EAA8E;AAC9E,oEAAoE;AACpE,oEAAoE;AACpE,4EAA4E;AAC5E,2EAA2E;AAC3E,0CAA0C;AAC1C;4DAC4D;AAC5D,MAAM,CAAC,MAAM,2BAA2B,GAA0C,IAAI,GAAG,CACvF,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC,CACxE,CAAC;AAEF,gFAAgF;AAChF,iFAAiF;AACjF,gEAAgE;AAChE,kFAAkF;AAClF,2EAA2E;AAE3E,+EAA+E;AAC/E,sEAAsE;AACtE,2EAA2E;AAC3E,yEAAyE;AACzE,iFAAiF;AACjF,MAAM,sBAAsB,GAA2C,CAAC,GAAG,EAAE;IAC3E,MAAM,CAAC,GAAG,IAAI,GAAG,EAAuB,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC,CAAC,EAAE,CAAC;AAEL,MAAM,wBAAwB,GAAwB,CAAC,GAAG,EAAE;IAC1D,MAAM,CAAC,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,SAAS;YAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC,EAAE,CAAC;AAuJL;+DAC+D;AAC/D,SAAS,kBAAkB,CACzB,KAA4B,EAC5B,MAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;QACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,MAAM;QAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9D,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GAAqC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAEnF;;;;;GAKG;AACH,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,mFAAmF;AACnF,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAEnC;;;;;;;;GAQG;AACH,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7D,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACrD,OAAO,IAAI,CAAC;AACd,CAAC;AAyCD;gBACgB;AAChB,MAAM,UAAU,qBAAqB,CACnC,KAA4B,EAC5B,IAAsB;IAEtB,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;IACpE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,cAAc,CAAC;IACvD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxC,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC,CAAC;IAClF,OAAO;QACL,UAAU;QACV,WAAW;QACX,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,oBAAoB,IAAI,qBAAqB;QAC3D,SAAS,EAAE,IAAI,CAAC,oBAAoB,IAAI,CAAC;QACzC,gBAAgB,EAAE,IAAI,CAAC,kBAAkB,IAAI,2BAA2B;QACxE,2EAA2E;QAC3E,4EAA4E;QAC5E,YAAY,EAAE,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,CAAC;QAC7D,iBAAiB,EAAE,eAAe,CAChC,KAAK,EACL,MAAM,CAAC,WAAW,CAChB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAC1E,EACD,UAAU,CACX;QACD,KAAK,EAAE,kBAAkB,CAAC,KAAK,EAAE,UAAU,CAAC;QAC5C,WAAW,EAAE,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC;QACtD,yBAAyB,EAAE,UAAU,CAAC,aAAa;QACnD,qBAAqB,EAAE,UAAU,CAAC,OAAO;aACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CAAC;aAC3C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;aACpB,IAAI,EAAE;KACV,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAA4B,EAC5B,SAAwB,EACxB,IAAI,GAAqB,EAAE;IAE3B,OAAO,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,KAA4B,EAC5B,SAAwB,EACxB,GAAqB;IAErB,MAAM,EACJ,UAAU,EACV,WAAW,EACX,MAAM,EACN,OAAO,EACP,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,KAAK,EACL,WAAW,EACX,gBAAgB,EAChB,yBAAyB,EACzB,qBAAqB,GACtB,GAAG,GAAG,CAAC;IAER,+EAA+E;IAC/E,4EAA4E;IAC5E,8EAA8E;IAC9E,uEAAuE;IACvE,8EAA8E;IAC9E,8EAA8E;IAC9E,MAAM,WAAW,GAAG,CAClB,IAAY,EACwC,EAAE;QACtD,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QACzB,yEAAyE;QACzE,2EAA2E;QAC3E,2EAA2E;QAC3E,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,KAAK,CAAC;YACjE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;QAChD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;gBACvC,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACvC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IACF,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,gBAAgB,GAAG,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,CAAC;IAC9D,MAAM,mBAAmB,GACvB,gBAAgB,IAAI,CAAC,EAAG,CAAC,UAAU,IAAI,EAAG,CAAC,UAAU,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,gBAAgB;QAClC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,CAAC,CAAC,IAAI,CAAC;IACT,MAAM,cAAc,GAAG,WAAW,KAAK,IAAI,IAAI,WAAW,GAAG,SAAS,CAAC;IAEvE,wEAAwE;IACxE,kEAAkE;IAClE,MAAM,OAAO,GAAG,CACd,IAAY,EACZ,CAAyC,EACrB,EAAE;QACtB,IAAI,CAAC,CAAC,CAAC,UAAU;YAAE,OAAO,CAAC,CAAC,KAAK,CAAC;QAClC,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC,CAAC;IACF,IAAI,wBAAwB,GAAG,KAAK,CAAC;IACrC,IAAI,mBAAmB,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,EAAG,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,EAAG,CAAC,CAAC;QACrC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/G,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,wBAAwB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,qBAAqB,CAAC;QACxF,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,uEAAuE;IACvE,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAEzD,yEAAyE;IACzE,sEAAsE;IACtE,2DAA2D;IAC3D,kEAAkE;IAClE,mEAAmE;IACnE,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC9E,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,YAAY,GAA4C,EAAE,CAAC;IACjE,0EAA0E;IAC1E,iFAAiF;IACjF,MAAM,IAAI,GAAG,MAA4C,CAAC;IAC1D,MAAM,IAAI,GAAG,MAA4C,CAAC;IAC1D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACzC,YAAY,CAAC,IAAI,CAAC;gBAChB,IAAI;gBACJ,SAAS,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAC9F,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAC/B;aACF,CAAC,CAAC;YACH,SAAS,CAAC,UAAU;QACtB,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,EAAE,KAAK,EAAE;YAAE,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,CAAC;IACD,WAAW,CAAC,IAAI,EAAE,CAAC;IACnB,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAEzC,wEAAwE;IACxE,8DAA8D;IAC9D,MAAM,SAAS,GAAG,+BAA+B,SAAS,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,qBAAqB,SAAS,CAAC,GAAG,EAAE,CAAC;IAClH,MAAM,UAAU,GAA6B;QAC3C,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE;QACjD,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE;KAClD,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,UAAU,CAAC,CAAC;IAE/C,uEAAuE;IACvE,MAAM,gBAAgB,GACpB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEpD,6EAA6E;IAC7E,8EAA8E;IAC9E,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1D,MAAM,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC;SACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAClC,IAAI,EAAE,CAAC;IAEV,uEAAuE;IACvE,yEAAyE;IACzE,6EAA6E;IAC7E,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,cAAc;QAC3B,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;QAC7D,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,qBAAqB,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;IACtG,MAAM,iBAAiB,GACrB,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC;QAC5B,CAAC,CAAC,MAAM,CAAC,OAAO;aACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CAAC;aAC3C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;aACpB,IAAI,EAAE,CAAC;IAEhB,mEAAmE;IACnE,uEAAuE;IACvE,kEAAkE;IAClE,6EAA6E;IAC7E,IAAI,OAAmC,CAAC;IACxC,IAAI,cAAc;QAAE,OAAO,GAAG,iBAAiB,CAAC;SAC3C,IAAI,CAAC,qBAAqB;QAAE,OAAO,GAAG,eAAe,CAAC;SACtD,IAAI,SAAS;QAAE,OAAO,GAAG,YAAY,CAAC;SACtC,IAAI,gBAAgB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS;QACrE,OAAO,GAAG,WAAW,CAAC;;QACnB,OAAO,GAAG,OAAO,CAAC;IAEvB,2EAA2E;IAC3E,2EAA2E;IAC3E,2CAA2C;IAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,cAAc,IAAI,CAAC,qBAAqB,IAAI,SAAS,EAAE,CAAC;QAC1D,KAAK,GAAG,CAAC,CAAC,CAAC;IACb,CAAC;SAAM,IAAI,SAAS,EAAE,CAAC;QACrB,KAAK,GAAG,CAAC,CAAC;IACZ,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,KAAK,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,cAAc,GAAG,sBAAsB,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACvE,MAAM,gBAAgB,GACpB,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAE5C,OAAO;QACL,CAAC,EAAE,SAAS,CAAC,CAAC;QACd,CAAC,EAAE,SAAS,CAAC,CAAC;QACd,GAAG,EAAE,SAAS,CAAC,GAAG;QAClB,WAAW,EAAE,SAAS,CAAC,WAAW;QAClC,QAAQ,EAAE,SAAS,CAAC,QAAQ;QAC5B,gBAAgB;QAChB,iBAAiB;QACjB,qBAAqB;QACrB,iBAAiB;QACjB,WAAW;QACX,gBAAgB;QAChB,mBAAmB;QACnB,wBAAwB;QACxB,gBAAgB,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CACrG,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAC/B;QACD,YAAY;QACZ,SAAS;QACT,OAAO;QACP,KAAK;QACL,WAAW;QACX,WAAW;QACX,cAAc;QACd,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,IAAI,GAAqB,EAAE;IAE3B,MAAM,YAAY,GAA+C;QAC/D,SAAS,EAAE,CAAC;QACZ,KAAK,EAAE,CAAC;QACR,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,YAAY,EAAE,CAAC;KAChB,CAAC;IACF,MAAM,GAAG,GAAG,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAClE,MAAM,CAAC,IAAI,CACT,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC;QACjD,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;QACjB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CACzB,CAAC;IACF,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"discovery.js","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAIH,OAAO,EAAE,wBAAwB,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAC7E,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC,OAAO,EAAE,uBAAuB,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC/E,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAC9E,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAE7D,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAEnD,8EAA8E;AAC9E,oEAAoE;AACpE,oEAAoE;AACpE,4EAA4E;AAC5E,2EAA2E;AAC3E,0CAA0C;AAC1C;4DAC4D;AAC5D,MAAM,CAAC,MAAM,2BAA2B,GAA0C,IAAI,GAAG,CACvF,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC,CACxE,CAAC;AAEF,gFAAgF;AAChF,iFAAiF;AACjF,gEAAgE;AAChE,kFAAkF;AAClF,2EAA2E;AAE3E,+EAA+E;AAC/E,sEAAsE;AACtE,2EAA2E;AAC3E,yEAAyE;AACzE,iFAAiF;AACjF,MAAM,sBAAsB,GAA2C,CAAC,GAAG,EAAE;IAC3E,MAAM,CAAC,GAAG,IAAI,GAAG,EAAuB,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC,CAAC,EAAE,CAAC;AAEL,MAAM,wBAAwB,GAAwB,CAAC,GAAG,EAAE;IAC1D,MAAM,CAAC,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5B,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,CAAC,SAAS;YAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC,EAAE,CAAC;AA0JL;+DAC+D;AAC/D,SAAS,kBAAkB,CACzB,KAA4B,EAC5B,MAAyC;IAEzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;QACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,MAAM;QAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9D,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,cAAc,GAAqC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAEnF;;;;GAIG;AACH,MAAM,CAAC,MAAM,+BAA+B,GAAG,CAAC,CAAC;AAEjD;;;;;GAKG;AACH,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,mFAAmF;AACnF,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAEnC;;;;;;;;GAQG;AACH,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7D,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACrD,OAAO,IAAI,CAAC;AACd,CAAC;AAyCD;gBACgB;AAChB,MAAM,UAAU,qBAAqB,CACnC,KAA4B,EAC5B,IAAsB;IAEtB,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;IACpE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,cAAc,CAAC;IACvD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxC,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC,CAAC;IAClF,OAAO;QACL,UAAU;QACV,WAAW;QACX,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,oBAAoB,IAAI,qBAAqB;QAC3D,SAAS,EAAE,IAAI,CAAC,oBAAoB,IAAI,+BAA+B;QACvE,gBAAgB,EAAE,IAAI,CAAC,kBAAkB,IAAI,2BAA2B;QACxE,2EAA2E;QAC3E,4EAA4E;QAC5E,YAAY,EAAE,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,CAAC;QAC7D,iBAAiB,EAAE,eAAe,CAChC,KAAK,EACL,MAAM,CAAC,WAAW,CAChB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAC1E,EACD,UAAU,CACX;QACD,KAAK,EAAE,kBAAkB,CAAC,KAAK,EAAE,UAAU,CAAC;QAC5C,WAAW,EAAE,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC;QACtD,qBAAqB,EAAE,UAAU,CAAC,OAAO;aACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CAAC;aAC3C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;aACpB,IAAI,EAAE;KACV,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CACjB,KAA4B,EAC5B,KAAwB,EACxB,MAAyC;IAEzC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;IACnC,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACf,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,SAAS;YACrC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC3C,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACvB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,kBAAkB,CACzB,KAA4B,EAC5B,WAA6C,EAC7C,MAAyB,EACzB,SAAwB,EACxB,OAA0C,EAC1C,qBAAwC;IAExC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,qBAAqB,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACxF,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QAC/B,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,CAAC;QAChG,IAAI,UAAU,CAAC,OAAO,KAAK,iBAAiB;YAAE,SAAS;QACvD,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,CAAC;QACvF,IAAI,MAAM,CAAC,OAAO,KAAK,cAAc;YAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAA4B,EAC5B,SAAwB,EACxB,IAAI,GAAqB,EAAE;IAE3B,OAAO,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,KAA4B,EAC5B,SAAwB,EACxB,GAAqB;IAErB,MAAM,EACJ,UAAU,EACV,WAAW,EACX,MAAM,EACN,OAAO,EACP,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,KAAK,EACL,WAAW,EACX,gBAAgB,EAChB,qBAAqB,GACtB,GAAG,GAAG,CAAC;IAER,+EAA+E;IAC/E,4EAA4E;IAC5E,8EAA8E;IAC9E,uEAAuE;IACvE,8EAA8E;IAC9E,8EAA8E;IAC9E,MAAM,WAAW,GAAG,CAClB,IAAY,EACwC,EAAE;QACtD,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QACzB,yEAAyE;QACzE,2EAA2E;QAC3E,2EAA2E;QAC3E,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,KAAK,CAAC;YACjE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;QAChD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;gBACvC,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACvC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IACF,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpC,MAAM,gBAAgB,GAAG,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,CAAC;IAC9D,MAAM,mBAAmB,GACvB,gBAAgB,IAAI,CAAC,EAAG,CAAC,UAAU,IAAI,EAAG,CAAC,UAAU,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,gBAAgB;QAClC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,CAAC,CAAC,IAAI,CAAC;IACT,MAAM,cAAc,GAAG,WAAW,KAAK,IAAI,IAAI,WAAW,GAAG,SAAS,CAAC;IAEvE,wEAAwE;IACxE,kEAAkE;IAClE,MAAM,OAAO,GAAG,CACd,IAAY,EACZ,CAAyC,EACrB,EAAE;QACtB,IAAI,CAAC,CAAC,CAAC,UAAU;YAAE,OAAO,CAAC,CAAC,KAAK,CAAC;QAClC,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC,CAAC;IACF,IAAI,wBAAwB,GAAG,KAAK,CAAC;IACrC,IAAI,mBAAmB,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,EAAG,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,EAAG,CAAC,CAAC;QACrC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/G,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,wBAAwB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,qBAAqB,CAAC;QACxF,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,uEAAuE;IACvE,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAEzD,yEAAyE;IACzE,sEAAsE;IACtE,2DAA2D;IAC3D,kEAAkE;IAClE,mEAAmE;IACnE,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC9E,MAAM,MAAM,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,YAAY,GAA4C,EAAE,CAAC;IACjE,0EAA0E;IAC1E,iFAAiF;IACjF,MAAM,IAAI,GAAG,MAA4C,CAAC;IAC1D,MAAM,IAAI,GAAG,MAA4C,CAAC;IAC1D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACzC,YAAY,CAAC,IAAI,CAAC;gBAChB,IAAI;gBACJ,SAAS,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAC9F,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAC/B;aACF,CAAC,CAAC;YACH,SAAS,CAAC,UAAU;QACtB,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,EAAE,KAAK,EAAE;YAAE,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,CAAC;IACD,WAAW,CAAC,IAAI,EAAE,CAAC;IACnB,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAEzC,wEAAwE;IACxE,8DAA8D;IAC9D,MAAM,SAAS,GAAG,+BAA+B,SAAS,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,qBAAqB,SAAS,CAAC,GAAG,EAAE,CAAC;IAClH,MAAM,UAAU,GAA6B;QAC3C,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE;QACjD,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE;KAClD,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,UAAU,CAAC,CAAC;IAE/C,uEAAuE;IACvE,MAAM,gBAAgB,GACpB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEpD,yEAAyE;IACzE,mEAAmE;IACnE,6EAA6E;IAC7E,8EAA8E;IAC9E,sEAAsE;IACtE,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAEpF,6EAA6E;IAC7E,8EAA8E;IAC9E,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IACzF,MAAM,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC;SACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAClC,IAAI,EAAE,CAAC;IAEV,uEAAuE;IACvE,mEAAmE;IACnE,wEAAwE;IACxE,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,2BAA2B;IAC3B,MAAM,iBAAiB,GAAG,cAAc;QACtC,CAAC,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,qBAAqB,CAAC;QAC3F,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,qBAAqB,GAAG,iBAAiB,CAAC,MAAM,KAAK,CAAC,CAAC;IAE7D,mEAAmE;IACnE,uEAAuE;IACvE,kEAAkE;IAClE,6EAA6E;IAC7E,IAAI,OAAmC,CAAC;IACxC,IAAI,cAAc;QAAE,OAAO,GAAG,iBAAiB,CAAC;SAC3C,IAAI,CAAC,qBAAqB;QAAE,OAAO,GAAG,eAAe,CAAC;SACtD,IAAI,SAAS;QAAE,OAAO,GAAG,YAAY,CAAC;SACtC,IAAI,gBAAgB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS;QACrE,OAAO,GAAG,WAAW,CAAC;;QACnB,OAAO,GAAG,OAAO,CAAC;IAEvB,2EAA2E;IAC3E,2EAA2E;IAC3E,2CAA2C;IAC3C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,cAAc,IAAI,CAAC,qBAAqB,IAAI,SAAS,EAAE,CAAC;QAC1D,KAAK,GAAG,CAAC,CAAC,CAAC;IACb,CAAC;SAAM,IAAI,SAAS,EAAE,CAAC;QACrB,KAAK,GAAG,CAAC,CAAC;IACZ,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,KAAK,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,cAAc,GAAG,sBAAsB,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACvE,MAAM,gBAAgB,GACpB,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAE5C,OAAO;QACL,CAAC,EAAE,SAAS,CAAC,CAAC;QACd,CAAC,EAAE,SAAS,CAAC,CAAC;QACd,GAAG,EAAE,SAAS,CAAC,GAAG;QAClB,WAAW,EAAE,SAAS,CAAC,WAAW;QAClC,QAAQ,EAAE,SAAS,CAAC,QAAQ;QAC5B,gBAAgB;QAChB,iBAAiB;QACjB,qBAAqB;QACrB,iBAAiB;QACjB,WAAW;QACX,gBAAgB;QAChB,mBAAmB;QACnB,wBAAwB;QACxB,gBAAgB,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CACrG,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAC/B;QACD,YAAY;QACZ,SAAS;QACT,OAAO;QACP,KAAK;QACL,WAAW;QACX,WAAW;QACX,cAAc;QACd,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,KAA4B,EAC5B,IAAI,GAAqB,EAAE;IAE3B,MAAM,YAAY,GAA+C;QAC/D,SAAS,EAAE,CAAC;QACZ,KAAK,EAAE,CAAC;QACR,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,YAAY,EAAE,CAAC;KAChB,CAAC;IACF,MAAM,GAAG,GAAG,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAClE,MAAM,CAAC,IAAI,CACT,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC;QACjD,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK;QACjB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CACzB,CAAC;IACF,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["/**\n * Discovery loop — vet link candidates through the verification primitives\n * (Direction 2).\n *\n * `proposeLinkCandidates` surfaces cross-cluster quantity pairs that share a\n * dimension and hands the raw coincidences to a human (the counts at a given\n * catalog are measured by the tests and recorded in NOTES.md). This\n * module closes the loop: it HYPOTHESIZES each candidate identification\n * `a ≡ b` and tests it with the machinery that already exists —\n *\n *   - mergesComponents      — does identifying a≡b connect two previously\n *                             disconnected parts of the graph? (structural\n *                             significance)\n *   - unlocksFromAnchor     — what becomes determinable from an anchor input\n *                             set WITH the identification that was not before?\n *                             (`forwardClosure`)\n *   - numericallyConsistent — does retrodiction over the graph stay\n *                             all-consistent once the identification is\n *                             added, or does it introduce a contradiction?\n *                             (`retrodict` — the STRONG filter)\n *\n * so the physicist adjudicates a handful of VETTED, provenance-traced\n * candidates instead of dimensional noise.\n *\n * ⚠ Still a REVIEW SURFACE, never automated discovery (Part-VI §XXVII-B). A\n * shared dimension is a weak prior; the weight is on the numeric and\n * structural signals, and the numeric check only exercises the part of the\n * graph reachable from the anchor. `promising` means \"worth a physicist's\n * minute\", not \"true\".\n *\n * INTERNAL — not on the public surface (mirrors bridge-analysis.ts);\n * surfaced via `upt discover`.\n *\n * @module composition/discovery\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport type { QuantityIdentification } from './compose.js';\nimport { QUANTITY_IDENTIFICATIONS, effectiveAttributes } from './compose.js';\nimport { GATE_AXES } from './axes.js';\nimport type { RegimeAttributes } from './quantity.js';\nimport { classifyIdentifiability, forwardClosure } from './identifiability.js';\nimport { retrodict, retrodictNode, forwardEvaluate } from './retrodiction.js';\nimport { proposeLinkCandidates } from './bridge-analysis.js';\nimport type { LinkCandidate } from './bridge-analysis.js';\nimport { M_SUN_KG } from '../core/constants.js';\nimport { REPRESENTATIVE_VALUES } from './representative-values.js';\nimport type { RepresentativeValue } from './representative-values.js';\nimport { conventionScaleToSI } from '../dimensional/unit-convention.js';\nimport { allQuantities } from './quantities.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { format } from '../dimensional/algebra.js';\n\n// ── registry-only attribute lookup (D1 axis gate; Option-A resolution) ─────\n// Built from the centralized `Quantity` nodes ONLY (never canonical\n// per-equation stamps — audit adjudication F1). Names that aren't a\n// registry node (most bare canonical-equation variables) are simply absent,\n// so they always abstain — the canonical-only axis-clash=0 invariant holds\n// by construction, not by a special case.\n/** The canonical quantity→attributes map (registry nodes + per-equation stamps).\n *  Exported for the axis-discrimination audit. @internal */\nexport const REGISTRY_ATTRIBUTES_BY_NAME: ReadonlyMap<string, RegimeAttributes> = new Map(\n  allQuantities().map((quantity) => [quantity.name, quantity.attributes]),\n);\n\n// The axes the D1 regime-label gate compares are `GATE_AXES`, imported from the\n// `axes.ts` registry (`AXES.filter(gated)`) at the top of this module. Currently\n// scale + force; the 2026-07-05 extensible-axis expansion added\n// symmetry/topology/statistics as UNGATED attributes (they only abstain until the\n// discrimination audit earns them a gate — flip `gated: true` in axes.ts).\n\n// ── canonical-kind indexes (Sub-project C) ──────────────────────────────────\n// Discovery quantity names and canonical variable names are different\n// namespaces; the alignable axis is the DIMENSION. These are informational\n// annotations on each candidate (no verdict/score effect): they give the\n// physicist standard-physics context, not a hard filter (the registry is small).\nconst CANONICAL_KINDS_BY_DIM: ReadonlyMap<string, readonly string[]> = (() => {\n  const m = new Map<string, Set<string>>();\n  for (const ce of CANONICAL_EQUATIONS) {\n    const key = format(ce.dimensional.target.dim);\n    (m.get(key) ?? m.set(key, new Set()).get(key)!).add(ce.domain);\n  }\n  return new Map([...m].map(([k, v]) => [k, [...v].sort()]));\n})();\n\nconst CANONICAL_QUANTITY_NAMES: ReadonlySet<string> = (() => {\n  const s = new Set<string>();\n  for (const ce of CANONICAL_EQUATIONS) {\n    s.add(ce.dimensional.target.name);\n    for (const g of ce.dimensional.governing) s.add(g.name);\n  }\n  return s;\n})();\n\n/** A candidate after vetting against the inference suite. @hypothesis @public */\nexport interface VettedCandidate {\n  readonly a: string;\n  readonly b: string;\n  /** Shared SI dimension (from the proposer). */\n  readonly dim: string;\n  /** One endpoint is in the anchored (established) cluster. */\n  readonly touchesCore: boolean;\n  /** The names share a word token (same physical KIND). */\n  readonly sameKind: boolean;\n  /**\n   * Identifying a≡b merges two distinct connected components of the\n   * quantity graph — it connects physics the catalog keeps separate.\n   */\n  readonly mergesComponents: boolean;\n  /**\n   * Quantities newly determinable from the anchor known-set once the\n   * identification is added (structural unlock). Sorted.\n   */\n  readonly unlocksFromAnchor: readonly string[];\n  /**\n   * Retrodiction over the graph WITH the hypothesized identification creates\n   * no numerical contradiction in the anchor-reachable subgraph. The strong\n   * filter. A node whose routes already disagree in the base graph is the\n   * graph's finding (`retrodict` reports it) and does not make a candidate\n   * inconsistent; only a disagreement the hypothesis CREATES does.\n   */\n  readonly numericallyConsistent: boolean;\n  /** Nodes that became inconsistent under the identification and were not\n   *  inconsistent in the base graph (the falsification, when\n   *  `numericallyConsistent` is false). Sorted. */\n  readonly inconsistentNodes: readonly string[];\n  /**\n   * Orders of magnitude between the representative values of a and b\n   * (`|log10|va| − log10|vb||`), or `null` when either has no representative\n   * value (the gate abstained — see `magnitudeChecked`).\n   */\n  readonly ordersApart: number | null;\n  /** Both endpoints had a representative value, so the magnitude gate ran. */\n  readonly magnitudeChecked: boolean;\n  /** The magnitude gate read at least one endpoint value from the graph at\n   *  the anchor (no static table entry) rather than the sourced table. */\n  readonly magnitudeUsedAnchor: boolean;\n  /**\n   * The magnitude comparison used an anchor-derived value, and the ratio of the\n   * two magnitudes does NOT move when every anchor input is rescaled by\n   * {@link ANCHOR_PROBE_FACTOR}. The graph then fixes the ratio at every\n   * anchor, so agreement in magnitude is an identity of the graph and not\n   * evidence for the identification. The case that exposed it: the anchor sets\n   * the temperature to the Hawking temperature of the anchor mass M, and then\n   * the thermal wavelength is exactly 4π ℓ_P for EVERY M. Its anchor-derived\n   * magnitude is not a representative magnitude of the quantity at all.\n   * A quantity whose value really is a constant belongs in the\n   * representative-value table, where it is not anchor-derived.\n   * A clash stays a clash (the graph itself fixes the two apart); only a pass is\n   * withheld, in `describeGrounding`. Optional on the type so hand-built\n   * candidates need not state it; the funnel always sets it.\n   */\n  readonly magnitudeAnchorInvariant?: boolean;\n  /**\n   * The endpoints with no representative magnitude (neither in the sourced\n   * table nor valued at the anchor) — why the magnitude gate abstained. Empty\n   * when it ran. Optional on the type; the funnel always sets it.\n   */\n  readonly magnitudeMissing?: readonly string[];\n  /**\n   * Per gate axis that abstained, the endpoints that state no value on it —\n   * why the axis gate had nothing to compare. Optional; the funnel always sets it.\n   */\n  readonly axisUnstated?: readonly { readonly axis: string; readonly endpoints: readonly string[] }[];\n  /**\n   * One endpoint name's hyphen-token set is a strict subset of the other's\n   * (`mass` ⊂ `reference-mass`) — a generic↔specific identification of the\n   * same KIND. Near-tautological (identifying a generic quantity with one of\n   * its own specializations), so it is barred from `promising`.\n   */\n  readonly subsuming: boolean;\n  /**\n   * - `magnitude-clash` — representative values differ by more than the\n   *                       threshold N orders (an independent falsification the\n   *                       single-anchor graph cannot make). Checked first.\n   * - `contradictory`   — breaks numerical consistency (a graph falsification).\n   * - `axis-clash`      — the identification's stated `scale`/`force` regime\n   *                       attributes disagree. A regime-LABEL prior against a\n   *                       literal identity (D1), not a physical test: it\n   *                       compares catalog labels and runs no computation, so\n   *                       it is never counted or described as a falsification.\n   * - `promising`       — consistent AND connects disconnected physics AND\n   *                       unlocks ≥1 quantity. Worth physicist review.\n   * - `inert`           — consistent but structurally/numerically idle (a\n   *                       dimensional coincidence with no consequence).\n   */\n  readonly verdict: 'promising' | 'inert' | 'contradictory' | 'magnitude-clash' | 'axis-clash';\n  /** Composite ranking score (higher = more worth review). */\n  readonly score: number;\n  /**\n   * At least one of the `scale`/`force` axes had a resolved (non-conflicting)\n   * value on BOTH endpoints, so the axis-compatibility gate produced a real\n   * comparison (whether or not it clashed). `false` means every gate axis\n   * abstained (silent on one/both sides, or a fold conflict) — the gate had\n   * nothing to check. Populated on EVERY candidate, independent of verdict.\n   */\n  readonly axisChecked: boolean;\n  /**\n   * Per-axis clash descriptions (`'scale: quantum ≠ cosmological'`), sorted.\n   * Empty when no gate axis clashed — including when `axisChecked` is\n   * `false`, and even when a stronger falsifier (magnitude/contradictory)\n   * won the verdict (no falsifier shadows another's annotation).\n   */\n  readonly axisClashes: readonly string[];\n  /**\n   * Standard-physics domains whose canonical equation has a TARGET of this\n   * candidate's dimension (Sub-project C). Informational context — an empty\n   * list means no canonical equation targets this dimension.\n   */\n  readonly canonicalKinds: readonly string[];\n  /** At least one endpoint name is a quantity a canonical equation uses\n   *  (weak name-based prior; informational). */\n  readonly touchesCanonical: boolean;\n}\n\n/** Options for the discovery loop. @internal */\nexport interface DiscoveryOptions {\n  /**\n   * Numeric anchor for the consistency check (and the closure unlock).\n   * Default `{ mass: M_sun }` — the pre-registered retrodiction anchor.\n   */\n  readonly groundTruth?: Readonly<Record<string, number>>;\n  /** Extra identifications honored as the baseline (default registered). */\n  readonly identifications?: readonly QuantityIdentification[];\n  /**\n   * Max orders of magnitude two identified quantities may differ before the\n   * identification is falsified as a `magnitude-clash`. Default {@link DEFAULT_MAX_ORDERS_OF_MAGNITUDE} — generous\n   * enough for O(1) dimensionless prefactors and unit-convention slack, strict\n   * enough to kill the scale-clash decoys.\n   */\n  readonly maxOrdersOfMagnitude?: number;\n  /**\n   * Sourced order-of-magnitude values for the gate (default\n   * `REPRESENTATIVE_VALUES`). Injectable for testing and so the future\n   * canonical-equation registry can supply them centrally.\n   */\n  readonly representativeValues?: Readonly<Record<string, RepresentativeValue>>;\n  /**\n   * Registry-only `scale`/`force`/`information` attributes by quantity name,\n   * for the D1 axis-compatibility gate (default: every centralized\n   * `Quantity.attributes`). Injectable for testing — never canonical\n   * per-equation stamps (Option-A resolution).\n   */\n  readonly quantityAttributes?: ReadonlyMap<string, RegimeAttributes>;\n}\n\n/** Union-find over quantity names; merges each edge's endpoints and every\n *  identification's from↔to. Returns name → component-root. */\nfunction quantityComponents(\n  edges: readonly BridgeEdge[],\n  idents: readonly QuantityIdentification[],\n): Map<string, string> {\n  const parent = new Map<string, string>();\n  const find = (x: string): string => {\n    if (!parent.has(x)) parent.set(x, x);\n    let r = x;\n    while (parent.get(r) !== r) r = parent.get(r)!;\n    let cur = x;\n    while (parent.get(cur) !== r) {\n      const next = parent.get(cur)!;\n      parent.set(cur, r);\n      cur = next;\n    }\n    return r;\n  };\n  const union = (a: string, b: string) => {\n    parent.set(find(a), find(b));\n  };\n  for (const e of edges) {\n    const names = [...e.sources.map((s) => s.name), e.target.name];\n    for (let i = 1; i < names.length; i++) union(names[0], names[i]);\n  }\n  for (const id of idents) union(id.from, id.to);\n  const roots = new Map<string, string>();\n  for (const name of parent.keys()) roots.set(name, find(name));\n  return roots;\n}\n\n/**\n * The ground truth the funnel anchors magnitudes to when the caller gives none: one solar mass.\n * Exported so the CLI can print the anchor a result is relative to (audit I3).\n * @internal\n */\nexport const ANCHOR_DEFAULT: Readonly<Record<string, number>> = { mass: M_SUN_KG };\n\n/**\n * The magnitude-clash threshold when the caller gives none: how many orders of magnitude two\n * identified quantities may differ. Exported so the CLI states the default it runs with.\n * @internal\n */\nexport const DEFAULT_MAX_ORDERS_OF_MAGNITUDE = 3;\n\n/**\n * Factor every anchor input is multiplied by to probe whether a magnitude ratio\n * depends on the anchor at all (persona finding L3). Three decades moves any\n * log-ratio that depends on the anchor far beyond {@link ANCHOR_INVARIANCE_TOL}.\n * @internal\n */\nconst ANCHOR_PROBE_FACTOR = 1e3;\n\n/** Decades within which a log-ratio counts as unchanged by the probe. @internal */\nconst ANCHOR_INVARIANCE_TOL = 1e-9;\n\n/**\n * One name's hyphen-token set is a STRICT subset of the other's\n * (`mass` ⊂ `reference-mass`, `mass` ⊂ `planck-mass`) — i.e. identifying a\n * generic quantity with one of its own specializations of the same kind.\n * Such an identification is near-tautological (it asserts the specialization\n * IS its genus), not a discovered cross-cluster link, so it is barred from\n * `promising`. Returns false for equal token sets and for pairs sharing only\n * a partial token (`schwarzschild-radius` ⊄ `foerster-radius`).\n */\nfunction nameSubsumes(a: string, b: string): boolean {\n  const ta = new Set(a.split('-'));\n  const tb = new Set(b.split('-'));\n  if (ta.size === tb.size) return false;\n  const [small, big] = ta.size < tb.size ? [ta, tb] : [tb, ta];\n  for (const t of small) if (!big.has(t)) return false;\n  return true;\n}\n\n/**\n * Candidate-invariant state for the discovery funnel — everything in\n * `vetLinkCandidate` that depends only on `(edges, opts)`, not on the specific\n * candidate. Computed once by `buildDiscoveryContext` and shared across every\n * candidate so `rankDiscoveries` does loop-invariant work once instead of N\n * times. Holds read-only structures — `vetInContext` never mutates them, so\n * sharing is safe. `tests/composition/discovery.test.ts` pins that directly:\n * two builds are equal, and vetting every candidate leaves the context equal\n * to a snapshot taken before.\n *\n * @internal\n */\nexport interface DiscoveryContext {\n  readonly baseIdents: readonly QuantityIdentification[];\n  readonly groundTruth: Readonly<Record<string, number>>;\n  /** `Object.keys(groundTruth)` — the anchor known-set names. */\n  readonly anchor: readonly string[];\n  readonly repVals: Readonly<Record<string, RepresentativeValue>>;\n  readonly maxOrders: number;\n  /** Registry-only attribute lookup for the D1 axis gate (opts override or\n   *  `REGISTRY_ATTRIBUTES_BY_NAME`). */\n  readonly attributesByName: ReadonlyMap<string, RegimeAttributes>;\n  /** `forwardEvaluate(edges, groundTruth, baseIdents)` — anchor magnitudes. */\n  readonly anchorValues: ReadonlyMap<string, number>;\n  /** The same evaluation with every anchor input times {@link ANCHOR_PROBE_FACTOR}. */\n  readonly anchorValuesProbe: ReadonlyMap<string, number>;\n  /** `quantityComponents(edges, baseIdents)` — base component roots. */\n  readonly comps: ReadonlyMap<string, string>;\n  /** `forwardClosure(edges, anchor, baseIdents)` — base determinable set. */\n  readonly closureBase: ReadonlySet<string>;\n  /**\n   * The targets the retrodiction of the anchor finds inconsistent with no\n   * hypothesized identification (empty when the base is consistent). An\n   * identification of two quantities outside {@link closureBase} cannot fire,\n   * so that candidate's numeric report is this one.\n   */\n  readonly baseInconsistentNodes: readonly string[];\n}\n\n/** Resolve options and compute the candidate-invariant discovery state once.\n *  @internal */\nexport function buildDiscoveryContext(\n  edges: readonly BridgeEdge[],\n  opts: DiscoveryOptions,\n): DiscoveryContext {\n  const baseIdents = opts.identifications ?? QUANTITY_IDENTIFICATIONS;\n  const groundTruth = opts.groundTruth ?? ANCHOR_DEFAULT;\n  const anchor = Object.keys(groundTruth);\n  const baseReport = retrodict(edges, groundTruth, { identifications: baseIdents });\n  return {\n    baseIdents,\n    groundTruth,\n    anchor,\n    repVals: opts.representativeValues ?? REPRESENTATIVE_VALUES,\n    maxOrders: opts.maxOrdersOfMagnitude ?? DEFAULT_MAX_ORDERS_OF_MAGNITUDE,\n    attributesByName: opts.quantityAttributes ?? REGISTRY_ATTRIBUTES_BY_NAME,\n    // Candidate-invariant: the anchor's forward evaluation, the base component\n    // partition, and the base forward closure all depend only on (edges, opts).\n    anchorValues: forwardEvaluate(edges, groundTruth, baseIdents),\n    anchorValuesProbe: forwardEvaluate(\n      edges,\n      Object.fromEntries(\n        Object.entries(groundTruth).map(([k, v]) => [k, v * ANCHOR_PROBE_FACTOR]),\n      ),\n      baseIdents,\n    ),\n    comps: quantityComponents(edges, baseIdents),\n    closureBase: forwardClosure(edges, anchor, baseIdents),\n    baseInconsistentNodes: baseReport.results\n      .filter((r) => r.outcome === 'inconsistent')\n      .map((r) => r.target)\n      .sort(),\n  };\n}\n\n/**\n * The quantities whose value can depend on one of `seeds`: the seeds, every\n * `to` of an identification from the set, and every target of an edge with a\n * source in the set, to a fixed point. An over-approximation (an edge that\n * does not fire still lists its target), which is the safe side: a target\n * left out would keep its base retrodiction unexamined.\n */\nfunction dependents(\n  edges: readonly BridgeEdge[],\n  seeds: readonly string[],\n  idents: readonly QuantityIdentification[],\n): Set<string> {\n  const set = new Set<string>(seeds);\n  let changed = true;\n  while (changed) {\n    changed = false;\n    for (const id of idents) {\n      if (set.has(id.from) && !set.has(id.to)) {\n        set.add(id.to);\n        changed = true;\n      }\n    }\n    for (const e of edges) {\n      if (set.has(e.target.name)) continue;\n      if (e.sources.some((s) => set.has(s.name))) {\n        set.add(e.target.name);\n        changed = true;\n      }\n    }\n  }\n  return set;\n}\n\n/**\n * The nodes the hypothesis `a ≡ b` makes inconsistent that the base graph did\n * not already have: inconsistent(hypothesis) minus inconsistent(base). Only a\n * node downstream of `a` or `b` can change, so only those nodes are\n * classified and retrodicted, with the same over-determined rule and the\n * same tolerance `retrodict` applies to the whole graph. Sorted.\n */\nfunction newInconsistencies(\n  edges: readonly BridgeEdge[],\n  groundTruth: Readonly<Record<string, number>>,\n  anchor: readonly string[],\n  candidate: LinkCandidate,\n  withHyp: readonly QuantityIdentification[],\n  baseInconsistentNodes: readonly string[],\n): string[] {\n  const base = new Set(baseInconsistentNodes);\n  const nodes: string[] = [];\n  for (const target of [...dependents(edges, [candidate.a, candidate.b], withHyp)].sort()) {\n    if (base.has(target)) continue;\n    const classified = classifyIdentifiability(edges, anchor, target, { identifications: withHyp });\n    if (classified.verdict !== 'over-determined') continue;\n    const result = retrodictNode(edges, groundTruth, target, { identifications: withHyp });\n    if (result.outcome === 'inconsistent') nodes.push(target);\n  }\n  return nodes;\n}\n\n/**\n * Vet one link candidate by hypothesizing the identification a≡b and\n * measuring its structural and numerical consequences. See module docs.\n *\n * @internal\n */\nexport function vetLinkCandidate(\n  edges: readonly BridgeEdge[],\n  candidate: LinkCandidate,\n  opts: DiscoveryOptions = {},\n): VettedCandidate {\n  return vetInContext(edges, candidate, buildDiscoveryContext(edges, opts));\n}\n\n/**\n * The per-candidate vetting body, given pre-computed candidate-invariant\n * `ctx`. The hypothesis-augmented closure is per-candidate. Retrodiction is\n * per-candidate only when an endpoint is already in the anchor closure;\n * otherwise the identification cannot fire and the base report stands.\n *\n * @internal\n */\nexport function vetInContext(\n  edges: readonly BridgeEdge[],\n  candidate: LinkCandidate,\n  ctx: DiscoveryContext,\n): VettedCandidate {\n  const {\n    baseIdents,\n    groundTruth,\n    anchor,\n    repVals,\n    maxOrders,\n    anchorValues,\n    anchorValuesProbe,\n    comps,\n    closureBase,\n    attributesByName,\n    baseInconsistentNodes,\n  } = ctx;\n\n  // Magnitude gate: an INDEPENDENT falsifier the single-anchor graph can't make.\n  // Only fires when both endpoints have a representative value; abstains (and\n  // never false-rejects) otherwise. A value comes from the sourced static table\n  // first, else — for graph-derived quantities the table omits by design\n  // (schwarzschild-radius, thermal-de-broglie-wavelength) — from the quantity's\n  // value AT THE REGISTERED ANCHOR, which is a definite magnitude for this run.\n  const magnitudeOf = (\n    name: string,\n  ): { value: number; fromAnchor: boolean } | undefined => {\n    const rv = repVals[name];\n    // Both paths apply the same finite-and-nonzero gate: a 0/∞/NaN magnitude\n    // would make log10 blow up (log10(0) = -∞), spoofing or silently disabling\n    // the falsifier. Symmetric validation across the table and anchor sources.\n    if (rv !== undefined && Number.isFinite(rv.value) && rv.value !== 0)\n      return { value: rv.value, fromAnchor: false };\n    const av = anchorValues.get(name);\n    if (av !== undefined) {\n      const value = av * conventionScaleToSI(name);\n      if (Number.isFinite(value) && value !== 0)\n        return { value, fromAnchor: true };\n    }\n    return undefined;\n  };\n  const va = magnitudeOf(candidate.a);\n  const vb = magnitudeOf(candidate.b);\n  const magnitudeChecked = va !== undefined && vb !== undefined;\n  const magnitudeUsedAnchor =\n    magnitudeChecked && (va!.fromAnchor || vb!.fromAnchor);\n  const ordersApart = magnitudeChecked\n    ? Math.abs(Math.log10(Math.abs(va!.value)) - Math.log10(Math.abs(vb!.value)))\n    : null;\n  const magnitudeClash = ordersApart !== null && ordersApart > maxOrders;\n\n  // Anchor-invariance probe: re-read each anchor-derived magnitude at the\n  // rescaled anchor. A table value is a constant and does not move.\n  const probeOf = (\n    name: string,\n    m: { value: number; fromAnchor: boolean },\n  ): number | undefined => {\n    if (!m.fromAnchor) return m.value;\n    const probe = anchorValuesProbe.get(name);\n    return probe === undefined ? undefined : probe * conventionScaleToSI(name);\n  };\n  let magnitudeAnchorInvariant = false;\n  if (magnitudeUsedAnchor) {\n    const pa = probeOf(candidate.a, va!);\n    const pb = probeOf(candidate.b, vb!);\n    if (pa !== undefined && pb !== undefined && pa !== 0 && pb !== 0 && Number.isFinite(pa) && Number.isFinite(pb)) {\n      const la = Math.log10(Math.abs(va!.value));\n      const lb = Math.log10(Math.abs(vb!.value));\n      const lpa = Math.log10(Math.abs(pa));\n      const lpb = Math.log10(Math.abs(pb));\n      magnitudeAnchorInvariant = Math.abs((lpa - lpb) - (la - lb)) <= ANCHOR_INVARIANCE_TOL;\n    }\n  }\n\n  // A generic↔specialization identification (mass ≟ reference-mass) is\n  // near-tautological — barred from `promising` regardless of structure.\n  const subsuming = nameSubsumes(candidate.a, candidate.b);\n\n  // Axis-compatibility gate (D1): a literal identity cannot have endpoints\n  // whose STATED scale/force regimes disagree. Either side silent on an\n  // axis (including a fold-conflict, resolved as unstated by\n  // `effectiveAttributes`) abstains that axis rather than clashing.\n  // Populated on every candidate, independent of which verdict wins.\n  const attrsA = effectiveAttributes(candidate.a, attributesByName, baseIdents);\n  const attrsB = effectiveAttributes(candidate.b, attributesByName, baseIdents);\n  const checkedAxes: string[] = [];\n  const axisClashes: string[] = [];\n  const axisUnstated: { axis: string; endpoints: string[] }[] = [];\n  // GATE_AXES is registry-derived (string[]); every registry axis name is a\n  // RegimeAttributes key whose value is a string union — read via a string record.\n  const recA = attrsA as Record<string, string | undefined>;\n  const recB = attrsB as Record<string, string | undefined>;\n  for (const axis of GATE_AXES) {\n    const av = recA[axis];\n    const bv = recB[axis];\n    if (av === undefined || bv === undefined) {\n      axisUnstated.push({\n        axis,\n        endpoints: [av === undefined ? candidate.a : null, bv === undefined ? candidate.b : null].filter(\n          (e): e is string => e !== null,\n        ),\n      });\n      continue; // abstain\n    }\n    checkedAxes.push(axis);\n    if (av !== bv) axisClashes.push(`${axis}: ${av} ≠ ${bv}`);\n  }\n  axisClashes.sort();\n  const axisChecked = checkedAxes.length > 0;\n  const axisClash = axisClashes.length > 0;\n\n  // The hypothesized identification, added in both directions so a≡b is a\n  // full merge (identifications are directional in the engine).\n  const rationale = `HYPOTHESIS (unadjudicated): ${candidate.a} ≡ ${candidate.b} — same dimension ${candidate.dim}`;\n  const hypothesis: QuantityIdentification[] = [\n    { from: candidate.a, to: candidate.b, rationale },\n    { from: candidate.b, to: candidate.a, rationale },\n  ];\n  const withHyp = [...baseIdents, ...hypothesis];\n\n  // Structural: does a≡b merge two components? (base partition from ctx)\n  const mergesComponents =\n    comps.has(candidate.a) &&\n    comps.has(candidate.b) &&\n    comps.get(candidate.a) !== comps.get(candidate.b);\n\n  // Neither endpoint in the anchor closure means the identification cannot\n  // fire: `forwardClosure` copies a value across `a ≡ b` only from a\n  // determinable side. The hypothesis closure is then the base closure, and no\n  // value in the graph moves, so neither closure nor retrodiction is recomputed\n  // (9.0.0 audit §4 C9: 4004 of 4196 catalog candidates are this case).\n  const touchesClosure = closureBase.has(candidate.a) || closureBase.has(candidate.b);\n\n  // Closure unlock: forward closure from the anchor, with vs without. The base\n  // closure is candidate-invariant (ctx); only the hypothesis closure is fresh.\n  const closureHyp = touchesClosure ? forwardClosure(edges, anchor, withHyp) : closureBase;\n  const unlocksFromAnchor = [...closureHyp]\n    .filter((q) => !closureBase.has(q))\n    .sort();\n\n  // Numeric: the hypothesis must not CREATE a disagreement. A node whose\n  // routes already disagree in the base graph is the graph's finding\n  // (`retrodict` reports it), not this candidate's, so the attribution is\n  // inconsistent(hypothesis) minus inconsistent(base) (9.0.0 audit §4 C4).\n  // Only a target downstream of `a` or `b` can change under the hypothesis;\n  // every other target's retrodiction is the base one, so only those targets\n  // are retrodicted (§4 C9).\n  const inconsistentNodes = touchesClosure\n    ? newInconsistencies(edges, groundTruth, anchor, candidate, withHyp, baseInconsistentNodes)\n    : [];\n  const numericallyConsistent = inconsistentNodes.length === 0;\n\n  // Verdict precedence: a magnitude clash is the most decisive, most\n  // interpretable falsification, checked before the graph contradiction;\n  // the regime-label prior (axis-clash) is weaker than both numeric\n  // falsifiers and is not one itself, but still outranks promising/inert (D1).\n  let verdict: VettedCandidate['verdict'];\n  if (magnitudeClash) verdict = 'magnitude-clash';\n  else if (!numericallyConsistent) verdict = 'contradictory';\n  else if (axisClash) verdict = 'axis-clash';\n  else if (mergesComponents && unlocksFromAnchor.length > 0 && !subsuming)\n    verdict = 'promising';\n  else verdict = 'inert';\n\n  // Score: all falsifications sink to the bottom; a subsuming (tautological)\n  // identification sinks within `inert`; otherwise reward structural merges,\n  // unlocks, and the proposer's weak priors.\n  let score = 0;\n  if (magnitudeClash || !numericallyConsistent || axisClash) {\n    score = -1;\n  } else if (subsuming) {\n    score = 0;\n  } else {\n    score += mergesComponents ? 4 : 0;\n    score += Math.min(unlocksFromAnchor.length, 4);\n    score += candidate.touchesCore ? 1 : 0;\n    score += candidate.sameKind ? 1 : 0;\n  }\n\n  const canonicalKinds = CANONICAL_KINDS_BY_DIM.get(candidate.dim) ?? [];\n  const touchesCanonical =\n    CANONICAL_QUANTITY_NAMES.has(candidate.a) ||\n    CANONICAL_QUANTITY_NAMES.has(candidate.b);\n\n  return {\n    a: candidate.a,\n    b: candidate.b,\n    dim: candidate.dim,\n    touchesCore: candidate.touchesCore,\n    sameKind: candidate.sameKind,\n    mergesComponents,\n    unlocksFromAnchor,\n    numericallyConsistent,\n    inconsistentNodes,\n    ordersApart,\n    magnitudeChecked,\n    magnitudeUsedAnchor,\n    magnitudeAnchorInvariant,\n    magnitudeMissing: [va === undefined ? candidate.a : null, vb === undefined ? candidate.b : null].filter(\n      (e): e is string => e !== null,\n    ),\n    axisUnstated,\n    subsuming,\n    verdict,\n    score,\n    axisChecked,\n    axisClashes,\n    canonicalKinds,\n    touchesCanonical,\n  };\n}\n\n/**\n * Run the full discovery funnel: propose cross-cluster candidates, vet each\n * against the inference suite, and rank — `promising` first, then by score.\n * The output is the physicist's worklist (vetted, provenance-traced), not a\n * list of discoveries.\n *\n * @public\n */\nexport function rankDiscoveries(\n  edges: readonly BridgeEdge[],\n  opts: DiscoveryOptions = {},\n): VettedCandidate[] {\n  const VERDICT_RANK: Record<VettedCandidate['verdict'], number> = {\n    promising: 0,\n    inert: 1,\n    'magnitude-clash': 2,\n    contradictory: 3,\n    'axis-clash': 4,\n  };\n  const ctx = buildDiscoveryContext(edges, opts);\n  const candidates = proposeLinkCandidates(edges);\n  const vetted = candidates.map((c) => vetInContext(edges, c, ctx));\n  vetted.sort(\n    (x, y) =>\n      VERDICT_RANK[x.verdict] - VERDICT_RANK[y.verdict] ||\n      y.score - x.score ||\n      x.a.localeCompare(y.a) ||\n      x.b.localeCompare(y.b),\n  );\n  return vetted;\n}\n"]}

package/dist/composition/edge.d.ts

@@ -184,6 +184,16 @@ export declare class CoefficientUnsetError extends Error {
     readonly formula: string;
     constructor(id: string, formula: string);
 }
+/**
+ * The unset-coefficient gate: an edge whose coefficient is unset and whose
+ * group is not a finite input throws {@link CoefficientUnsetError}. This is
+ * the one rule; `evaluateEdge` applies it to the edge it is given, and a
+ * composed edge's evaluator applies it to each operand before calling it, so
+ * a monomial times an absent 1 never reaches a caller as a number.
+ *
+ * @internal
+ */
+export declare function assertCoefficientSet(edge: BridgeEdge, inputs: Record<string, number>): void;
 /**
  * Composition refused: the composed sources would contain a duplicate
  * quantity NAME across operands without a recorded disposition (v0.11
@@ -207,15 +217,16 @@ export declare class CompositionAliasError extends Error {
  * the composite is known to be false. The message names both edge ids AND both
  * relation types, so the refused pair is identifiable without the table.
  *
- * Thrown ONLY when both operands carry a `relation`. An edge with no relation
- * overlay composes exactly as it did before Atlas Phase 1.
+ * Thrown when both operands carry a `relation` and the table is silent, or
+ * when both carry a `regime` of different families (this layer does not state
+ * where a cross-family chain applies). An edge with no relation overlay and no
+ * regime composes exactly as it did before Atlas Phase 1.
  *
- * `@internal`, not `@public`, for the same reason the rest of the Atlas overlay
- * is: nothing atlas-related joins the published surface before ROADMAP Phase 6.
- * It is reachable from the `src/composition/index.ts` barrel, which is what
- * internal consumers and tests use. Promote it in Phase 6 together with the
- * overlay fields, and update `tests/api/public-surface.test.ts`'s snapshot in
- * the same commit — that snapshot caught this addition, which is it working.
+ * Internal, not public: nothing atlas-related joins the published
+ * surface before ROADMAP Phase 6. It is reachable from the
+ * `src/composition/index.ts` barrel, which is what internal consumers and
+ * tests use. Promoting it is a public-surface change and goes through
+ * `tests/api/public-surface.test.ts` like any other.
  *
  * @internal
  */

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

@@ -1 +1 @@
-{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/composition/edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,OAAO,KAAK,EACV,WAAW,EACX,cAAc,EACd,MAAM,EACN,gBAAgB,EACjB,MAAM,uBAAuB,CAAC;AAG/B;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,uEAAuE;IACvE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,oDAAoD;IACpD,QAAQ,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,OAAO,CAAC;CACjE;AAED;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GACtB,aAAa,GACb,aAAa,GACb,oBAAoB,CAAC;AAEzB;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAU;IACzB,0DAA0D;IAC1D,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,uDAAuD;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,2EAA2E;IAC3E,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC;IAChC,4BAA4B;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,gCAAgC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,CAAC;IACtC;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/D,uBAAuB;IACvB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC;IAChC,6DAA6D;IAC7D,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,CAAC;IAC9D;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC;;;;;;;OAOG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;;;OAMG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE;QAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF;;;OAGG;IACH,QAAQ,CAAC,qBAAqB,CAAC,EAAE,aAAa,CAAC;QAC7C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG;YAAE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;SAAE,CAAC;QAC/D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;KAC5B,CAAC,CAAC;IAGH,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IACrC;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,6CAA6C;IAC7C,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,4DAA4D;IAC5D,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IACrD;;;;;;OAMG;IACH,QAAQ,CAAC,mBAAmB,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC1D;AAED,gEAAgE;AAChE,qBAAa,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED,6EAA6E;AAC7E,qBAAa,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;;;GAOG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAKtC;CACF;AAUD;;;;;;;;GAQG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,qBAAa,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAgDD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAUjE;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC7B,MAAM,CAWR"}
+{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/composition/edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,OAAO,KAAK,EACV,WAAW,EACX,cAAc,EACd,MAAM,EACN,gBAAgB,EACjB,MAAM,uBAAuB,CAAC;AAG/B;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,uEAAuE;IACvE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,oDAAoD;IACpD,QAAQ,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,OAAO,CAAC;CACjE;AAED;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GACtB,aAAa,GACb,aAAa,GACb,oBAAoB,CAAC;AAEzB;;;;;;;;GAQG;AACH,MAAM,WAAW,UAAU;IACzB,0DAA0D;IAC1D,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,uDAAuD;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,2EAA2E;IAC3E,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,CAAC;IAChC,4BAA4B;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,gCAAgC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,QAAQ,EAAE,CAAC;IACtC;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/D,uBAAuB;IACvB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC;IAChC,6DAA6D;IAC7D,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,CAAC;IAC9D;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC;;;;;;;OAOG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;;;OAMG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE;QAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF;;;OAGG;IACH,QAAQ,CAAC,qBAAqB,CAAC,EAAE,aAAa,CAAC;QAC7C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG;YAAE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;SAAE,CAAC;QAC/D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;KAC5B,CAAC,CAAC;IAGH,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAC;IACrC;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,6CAA6C;IAC7C,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,4DAA4D;IAC5D,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IACrD;;;;;;OAMG;IACH,QAAQ,CAAC,mBAAmB,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC1D;AAED,gEAAgE;AAChE,qBAAa,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED,6EAA6E;AAC7E,qBAAa,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;;;GAOG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAKtC;CACF;AAUD;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAI3F;AAED;;;;;;;;GAQG;AACH,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAgDD;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAUjE;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC7B,MAAM,CASR"}

package/dist/composition/edge.js

@@ -53,6 +53,20 @@ function groupBound(edge, inputs) {
     const value = inputs[group.group];
     return value !== undefined && Number.isFinite(value);
 }
+/**
+ * The unset-coefficient gate: an edge whose coefficient is unset and whose
+ * group is not a finite input throws {@link CoefficientUnsetError}. This is
+ * the one rule; `evaluateEdge` applies it to the edge it is given, and a
+ * composed edge's evaluator applies it to each operand before calling it, so
+ * a monomial times an absent 1 never reaches a caller as a number.
+ *
+ * @internal
+ */
+export function assertCoefficientSet(edge, inputs) {
+    if (edge.coefficientUnset === true && !groupBound(edge, inputs)) {
+        throw new CoefficientUnsetError(edge.id, edge.label);
+    }
+}
 /**
  * Composition refused: the composed sources would contain a duplicate
  * quantity NAME across operands without a recorded disposition (v0.11
@@ -79,15 +93,16 @@ export class CompositionAliasError extends Error {
  * the composite is known to be false. The message names both edge ids AND both
  * relation types, so the refused pair is identifiable without the table.
  *
- * Thrown ONLY when both operands carry a `relation`. An edge with no relation
- * overlay composes exactly as it did before Atlas Phase 1.
+ * Thrown when both operands carry a `relation` and the table is silent, or
+ * when both carry a `regime` of different families (this layer does not state
+ * where a cross-family chain applies). An edge with no relation overlay and no
+ * regime composes exactly as it did before Atlas Phase 1.
  *
- * `@internal`, not `@public`, for the same reason the rest of the Atlas overlay
- * is: nothing atlas-related joins the published surface before ROADMAP Phase 6.
- * It is reachable from the `src/composition/index.ts` barrel, which is what
- * internal consumers and tests use. Promote it in Phase 6 together with the
- * overlay fields, and update `tests/api/public-surface.test.ts`'s snapshot in
- * the same commit — that snapshot caught this addition, which is it working.
+ * Internal, not public: nothing atlas-related joins the published
+ * surface before ROADMAP Phase 6. It is reachable from the
+ * `src/composition/index.ts` barrel, which is what internal consumers and
+ * tests use. Promoting it is a public-surface change and goes through
+ * `tests/api/public-surface.test.ts` like any other.
  *
  * @internal
  */
@@ -168,9 +183,7 @@ export function evaluateEdge(edge, inputs) {
     if (!edge.domain.predicate(bound)) {
         throw new DomainViolationError(`${edge.id}: inputs violate validity domain (${edge.domain.description})`);
     }
-    if (edge.coefficientUnset === true && !groupBound(edge, bound)) {
-        throw new CoefficientUnsetError(edge.id, edge.label);
-    }
+    assertCoefficientSet(edge, bound);
     return edge.evaluate(bound);
 }
 //# sourceMappingURL=edge.js.map

package/dist/composition/edge.js.map

@@ -1 +1 @@
-{"version":3,"file":"edge.js","sourceRoot":"","sources":["../../src/composition/edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AAOvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AA6JvE,gEAAgE;AAChE,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AAED,6EAA6E;AAC7E,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;IAC1C,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IACrC,EAAE,CAAS;IACX,OAAO,CAAS;IACzB,YAAY,EAAU,EAAE,OAAe;QACrC,KAAK,CAAC,iBAAiB,EAAE,0BAA0B,OAAO,GAAG,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAED,2EAA2E;AAC3E,SAAS,UAAU,CAAC,IAAgB,EAAE,MAA8B;IAClE,MAAM,KAAK,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;IACtC,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;IAC1C,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,kBAAmB,SAAQ,KAAK;IACpC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC;IACnC,CAAC;CACF;AAED;;;;;GAKG;AACH,SAAS,eAAe,CACtB,IAAgB,EAChB,MAA8B;IAE9B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAC9C,IAAI,GAAuC,CAAC;IAC5C,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC7C,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAE,EAAE,CAAC,CAAC;SACxD,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC;QAC/B,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,kBAAkB,CAC1B,GAAG,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,qBAAqB,QAAQ,EAAE,CAC3G,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC;YACtB,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;QACxB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,IAAI,MAAM,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAuB,IAAO;IAC5D,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5C,OAAO;QACL,GAAG,IAAI;QACP,MAAM,EAAE;YACN,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW;YACpC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;SAC5E;QACD,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;KACnE,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,IAAgB,EAChB,MAA8B;IAE9B,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,oBAAoB,CAC5B,GAAG,IAAI,CAAC,EAAE,qCAAqC,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,CAC1E,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,qBAAqB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC"}
+{"version":3,"file":"edge.js","sourceRoot":"","sources":["../../src/composition/edge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AAOvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AA6JvE,gEAAgE;AAChE,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AAED,6EAA6E;AAC7E,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;IAC1C,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IACrC,EAAE,CAAS;IACX,OAAO,CAAS;IACzB,YAAY,EAAU,EAAE,OAAe;QACrC,KAAK,CAAC,iBAAiB,EAAE,0BAA0B,OAAO,GAAG,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;QACpC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAED,2EAA2E;AAC3E,SAAS,UAAU,CAAC,IAAgB,EAAE,MAA8B;IAClE,MAAM,KAAK,GAAG,0BAA0B,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAgB,EAAE,MAA8B;IACnF,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QAChE,MAAM,IAAI,qBAAqB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;IACtC,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;IAC1C,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,kBAAmB,SAAQ,KAAK;IACpC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC;IACnC,CAAC;CACF;AAED;;;;;GAKG;AACH,SAAS,eAAe,CACtB,IAAgB,EAChB,MAA8B;IAE9B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAC9C,IAAI,GAAuC,CAAC;IAC5C,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC7C,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAE,EAAE,CAAC,CAAC;SACxD,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC;QAC/B,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,kBAAkB,CAC1B,GAAG,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,qBAAqB,QAAQ,EAAE,CAC3G,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC;YACtB,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;QACxB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,IAAI,MAAM,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAuB,IAAO;IAC5D,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5C,OAAO;QACL,GAAG,IAAI;QACP,MAAM,EAAE;YACN,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW;YACpC,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;SAC5E;QACD,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;KACnE,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,IAAgB,EAChB,MAA8B;IAE9B,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,oBAAoB,CAC5B,GAAG,IAAI,CAAC,EAAE,qCAAqC,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,CAC1E,CAAC;IACJ,CAAC;IACD,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC","sourcesContent":["/**\n * Composition graph — edges (bridges and laws) + validity domains\n * (v0.8.0 T1+T2+T3, per docs/planning/v0.8.0-Design.md §3).\n *\n * A `BridgeEdge` is an edge in the composition graph: n-ary source\n * quantities → one target quantity, carrying a closed-form evaluator,\n * a first-class validity domain (G-8), a confidence grade, and a\n * literature citation. `kind: 'law'` marks diagonal-law edges (P-1) —\n * edges whose endpoints share regime attributes, serving as the\n * connective tissue composition chains pass through.\n *\n * @module composition/edge\n */\n\nimport type { Quantity } from './quantity.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { CANONICAL_GROUP_PREFACTORS } from './canonical-prefactors.js';\nimport type {\n  Conventions,\n  Counterexample,\n  Regime,\n  RelationContract,\n} from '../relations/types.js';\nimport { DomainViolationError } from '../bridges/evaluation-errors.js';\n\n/**\n * First-class validity domain (v0.8.0 G-8). The predicate receives the\n * same keyed inputs as `evaluate` and returns whether the edge's\n * formula applies there (e.g. weak-field, positive mass, bound orbit).\n *\n * @public\n */\nexport interface ValidityDomain {\n  /** Human-readable statement, e.g. 'M > 0 and b ≫ r_s (weak field)'. */\n  readonly description: string;\n  /** Machine-checkable form of the same statement. */\n  readonly predicate: (inputs: Record<string, number>) => boolean;\n}\n\n/**\n * Confidence grade — mirrors the catalog's status taxonomy. Composition\n * demotes via {@link minConfidence}; it never promotes.\n *\n * @public\n */\nexport type EdgeConfidence =\n  | 'established'\n  | 'speculative'\n  | 'highly-speculative';\n\n/**\n * An edge in the composition graph.\n *\n * `evaluate` is keyed by source-quantity `name`s. For catalog-backed\n * edges, `beId` cross-references `BRIDGE_EQUATIONS`; diagonal-law\n * edges have `beId: null` (BE-1–10 are not individually catalogued).\n *\n * @public\n */\nexport interface BridgeEdge {\n  /** Graph id, e.g. 'be-42', 'law-schwarzschild-radius'. */\n  readonly id: string;\n  /** Catalog cross-reference; null for diagonal laws. */\n  readonly beId: number | null;\n  /** Bridge (endpoints differ in regime) vs law (endpoints share regime). */\n  readonly kind: 'bridge' | 'law';\n  /** Human-readable label. */\n  readonly label: string;\n  /** Input quantities (n-ary). */\n  readonly sources: readonly Quantity[];\n  /**\n   * Evaluator keys and the symbols a reader copies, keyed by source name.\n   * `evaluate`, the domain predicate, and `evaluateEdge` copy an alias onto\n   * that source name before the formula. Explain, search, map, and derive\n   * read the same record.\n   */\n  readonly aliases?: Readonly<Record<string, readonly string[]>>;\n  /** Output quantity. */\n  readonly target: Quantity;\n  readonly confidence: EdgeConfidence;\n  readonly domain: ValidityDomain;\n  /** Closed-form evaluator; keys are source-quantity names. */\n  readonly evaluate: (inputs: Record<string, number>) => number;\n  /**\n   * OPTIONAL symbolic form of the target (v0.12 symbolic composition): an\n   * `ExprNode` whose leaf symbols are EITHER this edge's source-quantity\n   * NAMES (graph vocabulary, e.g. `'mass'`) or registered constant symbols\n   * (`hbar`, `c`, `G`, `k_B`, `8pi`, `ln2`, …). When present, `composeSymbolic`\n   * can thread it through a junction by AST substitution; a drift-guard test\n   * binds it to `evaluate`. Absent on numeric-only edges (the default).\n   */\n  readonly symbolic?: ExprNode;\n  readonly citation: string;\n  /**\n   * The canonical entry is dimensional and no sourced prefactor multiplies\n   * the monomial. The evaluator's leading 1 is that absence. It is not a\n   * recovered constant. Absent on catalog edges and on a dimensional entry\n   * whose table already supplies the factor, including a sourced 1.\n   */\n  readonly coefficientUnset?: boolean;\n  /**\n   * Exponents of dimensionless counts the dimensional monomial cannot see.\n   * A fully-quantitative scalar AST records them (`N` in `P = N k_B T/V`,\n   * `one_minus_e_sq` in the Einstein perihelion formula). They are sources.\n   * Buckingham drops them, so the audit multiplies these exponents back in.\n   * Absent when the formula has no such count. A `scalar-up-to-constant`\n   * stub is not one of these.\n   */\n  readonly formulaFactors?: Readonly<Record<string, number>>;\n  /**\n   * Source names the scalar formula is an even function of. The evaluator\n   * takes the absolute value of each one. Buckingham still writes the\n   * dimensional exponent, which is odd for `√(q²)` and for `|q|`. Explain\n   * prints those names as magnitudes. Absent when no source is even.\n   */\n  readonly evenInputs?: readonly string[];\n  /**\n   * Provenance: the quantity identification the junction used, when a\n   * composed edge was formed via `QUANTITY_IDENTIFICATIONS` rather than\n   * a name match. Absent on primitive edges and name-matched\n   * compositions. (v0.8.0 punch-list: surfaced from the previously\n   * unused `findJunction` return.)\n   */\n  readonly identificationUsed?: {\n    readonly from: string;\n    readonly to: string;\n    readonly rationale: string;\n    readonly citation?: string;\n  };\n  /**\n   * Provenance: alias dispositions consumed at composition (v0.11\n   * Option D) — which duplicate-name collisions were resolved, and how.\n   */\n  readonly aliasDispositionsUsed?: ReadonlyArray<{\n    readonly name: string;\n    readonly treatAs: 'shared' | { readonly renameSecond: string };\n    readonly rationale: string;\n    readonly citation?: string;\n  }>;\n\n  // ── Atlas Phase 1 overlay (all OPTIONAL; an edge without them is unchanged) ──\n  /** The typed relation this edge asserts, when one has been recorded. */\n  readonly relation?: RelationContract;\n  /**\n   * Where in π-group space this edge is claimed to apply, when a regime has\n   * been recorded (Atlas Phase 2).\n   *\n   * ADDITIVE, and it does NOT replace `domain`. The two are different claims:\n   * `domain.predicate` is an opaque closure over RAW inputs that may encode\n   * conditions no π-group captures — positivity, integer-ness, a branch cut —\n   * while a `Regime` is declarative inequalities over DIMENSIONLESS groups,\n   * traceable back to the dimension matrix. Replacing the predicate with a\n   * regime would discard those conditions invisibly, because the result still\n   * type-checks and still answers (design note §1).\n   *\n   * When both are present the validity domain is satisfied IFF\n   * `predicate(rawInputs) === true` AND `regimeHolds(piGroups).ok === true`.\n   * Logical AND, no precedence: neither side wins, and a `'unknown'` from\n   * `regimeHolds` is a failure to confirm validity, never validity.\n   *\n   * A regime is stated over π-groups, so the CALLER supplies the group values.\n   * Nothing in this library infers them from raw inputs — that would be a\n   * silent, lossy guess at the mapping. An edge without this field behaves\n   * exactly as it did before Phase 2.\n   */\n  readonly regime?: Regime;\n  /** Sign/unit choices the edge depends on. */\n  readonly conventions?: Conventions;\n  /** Cases the edge does NOT cover, each with its witness. */\n  readonly counterexamples?: readonly Counterexample[];\n  /**\n   * Provenance for a `relation` that `composeEdges` DERIVED from the\n   * composition table, rather than one an author recorded: the ids of the two\n   * operands, in composition order. Present only on composed edges whose BOTH\n   * operands carried a `relation`; absent everywhere else, including on every\n   * primitive catalog edge.\n   */\n  readonly relationDerivedFrom?: readonly [string, string];\n}\n\n/** Composition failed: no junction quantity matched. @public */\nexport class CompositionJunctionError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'CompositionJunctionError';\n  }\n}\n\n/** Composition failed: junction dimensions are not exactly equal. @public */\nexport class CompositionDimensionError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'CompositionDimensionError';\n  }\n}\n\n/**\n * The edge's coefficient has no sourced number and its group is unbound.\n *\n * `evaluateEdge` throws this. `evaluateRelation` records it as\n * `kind: 'unset'` and does not return a number.\n *\n * @public\n */\nexport class CoefficientUnsetError extends Error {\n  readonly id: string;\n  readonly formula: string;\n  constructor(id: string, formula: string) {\n    super(`evaluateEdge: ${id} coefficient is unset (${formula})`);\n    this.name = 'CoefficientUnsetError';\n    this.id = id;\n    this.formula = formula;\n  }\n}\n\n/** A group prefactor is sourced only when that group is a finite input. */\nfunction groupBound(edge: BridgeEdge, inputs: Record<string, number>): boolean {\n  const group = CANONICAL_GROUP_PREFACTORS.find((row) => row.id === edge.id);\n  if (group === undefined) return false;\n  const value = inputs[group.group];\n  return value !== undefined && Number.isFinite(value);\n}\n\n/**\n * The unset-coefficient gate: an edge whose coefficient is unset and whose\n * group is not a finite input throws {@link CoefficientUnsetError}. This is\n * the one rule; `evaluateEdge` applies it to the edge it is given, and a\n * composed edge's evaluator applies it to each operand before calling it, so\n * a monomial times an absent 1 never reaches a caller as a number.\n *\n * @internal\n */\nexport function assertCoefficientSet(edge: BridgeEdge, inputs: Record<string, number>): void {\n  if (edge.coefficientUnset === true && !groupBound(edge, inputs)) {\n    throw new CoefficientUnsetError(edge.id, edge.label);\n  }\n}\n\n/**\n * Composition refused: the composed sources would contain a duplicate\n * quantity NAME across operands without a recorded disposition (v0.11\n * namespacing gate, Option D — pure name-collision rule per the Adam\n * vet A-1: object identity cannot distinguish wrong-physics aliasing\n * from deliberate sharing).\n *\n * @public\n */\nexport class CompositionAliasError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'CompositionAliasError';\n  }\n}\n\n/**\n * Composition refused: BOTH operands carry a `relation`, and the composition\n * table (`src/atlas/composition-table.ts`) returns `'no-composite-claim'` for\n * that ordered pair — this library declines to assert what the chain relates.\n *\n * Silence, not a defect in the operands: the table is a deliberate\n * under-approximation (design note `docs/planning/Atlas-Phase-1-Design.md`\n * §2.2), so a refusal here means the composite type is unrecorded, never that\n * the composite is known to be false. The message names both edge ids AND both\n * relation types, so the refused pair is identifiable without the table.\n *\n * Thrown when both operands carry a `relation` and the table is silent, or\n * when both carry a `regime` of different families (this layer does not state\n * where a cross-family chain applies). An edge with no relation overlay and no\n * regime composes exactly as it did before Atlas Phase 1.\n *\n * Internal, not public: nothing atlas-related joins the published\n * surface before ROADMAP Phase 6. It is reachable from the\n * `src/composition/index.ts` barrel, which is what internal consumers and\n * tests use. Promoting it is a public-surface change and goes through\n * `tests/api/public-surface.test.ts` like any other.\n *\n * @internal\n */\nexport class UndefinedCompositionError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'UndefinedCompositionError';\n  }\n}\n\n/**\n * Two keys for one source disagree. The formula is not run.\n * The message names the source and every key that was set.\n * @internal\n */\nclass AliasConflictError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'AliasConflictError';\n  }\n}\n\n/**\n * Copy each present alias onto its source name. The caller's record is\n * not mutated. A source that is already set to the same number stays.\n * Two different numbers for one source throw {@link AliasConflictError}.\n * @internal\n */\nfunction bindAliasInputs(\n  edge: BridgeEdge,\n  inputs: Record<string, number>,\n): Record<string, number> {\n  if (edge.aliases === undefined) return inputs;\n  let out: Record<string, number> | undefined;\n  for (const [quantity, keys] of Object.entries(edge.aliases)) {\n    const named = Object.hasOwn(inputs, quantity);\n    const present = keys.filter((key) => Object.hasOwn(inputs, key));\n    if (!named && present.length === 0) continue;\n    const values = [\n      ...(named ? [{ key: quantity, value: inputs[quantity]! }] : []),\n      ...present.map((key) => ({ key, value: inputs[key]! })),\n    ];\n    const first = values[0]!.value;\n    if (values.some((row) => !Object.is(row.value, first))) {\n      throw new AliasConflictError(\n        `${edge.id}: ${values.map((row) => `${row.key}=${row.value}`).join(' and ')}; those keys name ${quantity}`,\n      );\n    }\n    if (!named) {\n      out ??= { ...inputs };\n      out[quantity] = first;\n    }\n  }\n  return out ?? inputs;\n}\n\n/**\n * The domain predicate and `evaluate` read source names. This copy reads\n * aliases first, so a CLI key reaches the same formula.\n * @internal\n */\nexport function withBoundAliases<E extends BridgeEdge>(edge: E): E {\n  if (edge.aliases === undefined) return edge;\n  return {\n    ...edge,\n    domain: {\n      description: edge.domain.description,\n      predicate: (inputs) => edge.domain.predicate(bindAliasInputs(edge, inputs)),\n    },\n    evaluate: (inputs) => edge.evaluate(bindAliasInputs(edge, inputs)),\n  };\n}\n\n/**\n * Domain-checked evaluation: throws {@link DomainViolationError} when\n * `inputs` violate `edge.domain`, otherwise returns `edge.evaluate`.\n * An alias is copied onto its source name first. An unset coefficient\n * throws {@link CoefficientUnsetError} instead of a monomial times 1.\n *\n * @public\n */\nexport function evaluateEdge(\n  edge: BridgeEdge,\n  inputs: Record<string, number>,\n): number {\n  const bound = bindAliasInputs(edge, inputs);\n  if (!edge.domain.predicate(bound)) {\n    throw new DomainViolationError(\n      `${edge.id}: inputs violate validity domain (${edge.domain.description})`,\n    );\n  }\n  assertCoefficientSet(edge, bound);\n  return edge.evaluate(bound);\n}\n"]}

package/dist/composition/enumerate.d.ts

@@ -99,7 +99,8 @@ export interface EnumerationReport {
  * @public
  */
 export declare const REGISTERED_COMPOSITION_IDS: ReadonlySet<string>;
-type EnumerationOptions = ComposeOptions & {
+/** Options of {@link enumerateCompositions}: the compose options plus the registered and seed id sets. @public */
+export type EnumerationOptions = ComposeOptions & {
     readonly registeredIds?: ReadonlySet<string>;
     /** When set, only these edge ids are walked, and symbolic pairs are split. */
     readonly seedIds?: ReadonlySet<string>;
@@ -124,5 +125,4 @@ export declare function enumerateCompositions(edges: ReadonlyArray<BridgeEdge>,
  * @internal
  */
 export declare function enumerateCompositionsWithRefusals(edges: ReadonlyArray<BridgeEdge>, opts?: EnumerationOptions): EnumerationWithRefusals;
-export {};
 //# sourceMappingURL=enumerate.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"enumerate.d.ts","sourceRoot":"","sources":["../../src/composition/enumerate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAG5C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAGnD,2EAA2E;AAC3E,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,oEAAoE;IACpE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,8DAA8D;IAC9D,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;CACzB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAuBD;;;;;;;GAOG;AACH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,mCAAmC;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;IACnC,QAAQ,CAAC,gBAAgB,EAAE,SAAS,oBAAoB,EAAE,CAAC;CAC5D;AAED,kCAAkC;AAClC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IAClD,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IACzD,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IACpD,gEAAgE;IAChE,QAAQ,CAAC,mBAAmB,EAAE,aAAa,CAAC,mBAAmB,CAAC,CAAC;IACjE;;;OAGG;IACH,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC;QACnC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;QAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;QAC5B,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;KACzB,CAAC,CAAC;IACH;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,aAAa,CAAC;QACvC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;QAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;KAC7B,CAAC,CAAC;CACJ;AAED;;;;;GAKG;AACH,eAAO,MAAM,0BAA0B,EAAE,WAAW,CAAC,MAAM,CAKzD,CAAC;AAEH,KAAK,kBAAkB,GAAG,cAAc,GAAG;IACzC,QAAQ,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7C,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACxC,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,aAAa,CAAC,UAAU,CAAC,EAChC,IAAI,GAAE,kBAAuB,GAC5B,iBAAiB,CAEnB;AAED;;;;;;;;;GASG;AACH,wBAAgB,iCAAiC,CAC/C,KAAK,EAAE,aAAa,CAAC,UAAU,CAAC,EAChC,IAAI,GAAE,kBAAuB,GAC5B,uBAAuB,CAsEzB"}
+{"version":3,"file":"enumerate.d.ts","sourceRoot":"","sources":["../../src/composition/enumerate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAG5C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAGnD,2EAA2E;AAC3E,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,oEAAoE;IACpE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,8DAA8D;IAC9D,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;CACzB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAuBD;;;;;;;GAOG;AACH,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,mCAAmC;IACnC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;GAKG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;IACnC,QAAQ,CAAC,gBAAgB,EAAE,SAAS,oBAAoB,EAAE,CAAC;CAC5D;AAED,kCAAkC;AAClC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IAClD,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IACzD,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IACpD,gEAAgE;IAChE,QAAQ,CAAC,mBAAmB,EAAE,aAAa,CAAC,mBAAmB,CAAC,CAAC;IACjE;;;OAGG;IACH,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC;QACnC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;QAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;QAC5B,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;KACzB,CAAC,CAAC;IACH;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,aAAa,CAAC;QACvC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;QAC3B,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;KAC7B,CAAC,CAAC;CACJ;AAED;;;;;GAKG;AACH,eAAO,MAAM,0BAA0B,EAAE,WAAW,CAAC,MAAM,CAKzD,CAAC;AAEH,kHAAkH;AAClH,MAAM,MAAM,kBAAkB,GAAG,cAAc,GAAG;IAChD,QAAQ,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7C,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACxC,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,aAAa,CAAC,UAAU,CAAC,EAChC,IAAI,GAAE,kBAAuB,GAC5B,iBAAiB,CAEnB;AAED;;;;;;;;;GASG;AACH,wBAAgB,iCAAiC,CAC/C,KAAK,EAAE,aAAa,CAAC,UAAU,CAAC,EAChC,IAAI,GAAE,kBAAuB,GAC5B,uBAAuB,CAsEzB"}

package/dist/composition/enumerate.js.map

@@ -1 +1 @@
-{"version":3,"file":"enumerate.js","sourceRoot":"","sources":["../../src/composition/enumerate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,OAAO,EAAE,qBAAqB,EAAE,yBAAyB,EAAE,MAAM,WAAW,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE5C,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAqGxD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAwB,IAAI,GAAG,CAAC;IACrE,cAAc,EAAE,OAAO;IACvB,wCAAwC,EAAE,eAAe;IACzD,qBAAqB,EAAE,eAAe;IACtC,oBAAoB,EAAE,OAAO;CAC9B,CAAC,CAAC;AAQH;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAgC,EAChC,IAAI,GAAuB,EAAE;IAE7B,OAAO,iCAAiC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;AAC/D,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iCAAiC,CAC/C,KAAgC,EAChC,IAAI,GAAuB,EAAE;IAE7B,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,0BAA0B,CAAC;IACvE,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,MAAM,mBAAmB,GAA0B,EAAE,CAAC;IACtD,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,MAAM,YAAY,GAA0B,EAAE,CAAC;IAC/C,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC;IAC1C,MAAM,MAAM,GAAG,CAAC,IAAgB,EAAW,EAAE,CAC3C,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE1D,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,SAAS;QAC7B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,IAAI,KAAK,KAAK,MAAM;gBAAE,SAAS;YAC/B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC9B,IAAI,IAAgB,CAAC;YACrB,IAAI,CAAC;gBACH,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,GAAG,YAAY,qBAAqB,EAAE,CAAC;oBACzC,wDAAwD;oBACxD,qDAAqD;oBACrD,mBAAmB,CAAC,IAAI,CAAC;wBACvB,KAAK;wBACL,MAAM;wBACN,UAAU,EAAE,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE;wBACvC,OAAO,EAAE,GAAG,CAAC,OAAO;qBACrB,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,GAAG,YAAY,yBAAyB,EAAE,CAAC;oBACpD,gBAAgB,CAAC,IAAI,CAAC;wBACpB,KAAK;wBACL,MAAM;wBACN,UAAU,EAAE,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE;wBACvC,OAAO,EAAE,GAAG,CAAC,OAAO;qBACrB,CAAC,CAAC;gBACL,CAAC;gBACD,2DAA2D;gBAC3D,SAAS;YACX,CAAC;YACD,GAAG,CAAC,IAAI,CAAC;gBACP,KAAK;gBACL,MAAM;gBACN,IAAI;gBACJ,KAAK,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;YACH,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,IAAI,CAAC;gBACH,YAAY,CAAC,IAAI,CAAC;oBAChB,KAAK;oBACL,MAAM;oBACN,IAAI,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI;iBAChD,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,gBAAgB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE;YACN,GAAG;YACH,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACvC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;YACjC,mBAAmB;YACnB,YAAY;YACZ,gBAAgB;SACjB;QACD,gBAAgB;KACjB,CAAC;AACJ,CAAC"}
+{"version":3,"file":"enumerate.js","sourceRoot":"","sources":["../../src/composition/enumerate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,OAAO,EAAE,qBAAqB,EAAE,yBAAyB,EAAE,MAAM,WAAW,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE5C,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAqGxD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAwB,IAAI,GAAG,CAAC;IACrE,cAAc,EAAE,OAAO;IACvB,wCAAwC,EAAE,eAAe;IACzD,qBAAqB,EAAE,eAAe;IACtC,oBAAoB,EAAE,OAAO;CAC9B,CAAC,CAAC;AASH;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAgC,EAChC,IAAI,GAAuB,EAAE;IAE7B,OAAO,iCAAiC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;AAC/D,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iCAAiC,CAC/C,KAAgC,EAChC,IAAI,GAAuB,EAAE;IAE7B,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,0BAA0B,CAAC;IACvE,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,MAAM,mBAAmB,GAA0B,EAAE,CAAC;IACtD,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,MAAM,YAAY,GAA0B,EAAE,CAAC;IAC/C,MAAM,gBAAgB,GAA2B,EAAE,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC;IAC1C,MAAM,MAAM,GAAG,CAAC,IAAgB,EAAW,EAAE,CAC3C,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE1D,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,SAAS;QAC7B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,IAAI,KAAK,KAAK,MAAM;gBAAE,SAAS;YAC/B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC9B,IAAI,IAAgB,CAAC;YACrB,IAAI,CAAC;gBACH,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,GAAG,YAAY,qBAAqB,EAAE,CAAC;oBACzC,wDAAwD;oBACxD,qDAAqD;oBACrD,mBAAmB,CAAC,IAAI,CAAC;wBACvB,KAAK;wBACL,MAAM;wBACN,UAAU,EAAE,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE;wBACvC,OAAO,EAAE,GAAG,CAAC,OAAO;qBACrB,CAAC,CAAC;gBACL,CAAC;qBAAM,IAAI,GAAG,YAAY,yBAAyB,EAAE,CAAC;oBACpD,gBAAgB,CAAC,IAAI,CAAC;wBACpB,KAAK;wBACL,MAAM;wBACN,UAAU,EAAE,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE;wBACvC,OAAO,EAAE,GAAG,CAAC,OAAO;qBACrB,CAAC,CAAC;gBACL,CAAC;gBACD,2DAA2D;gBAC3D,SAAS;YACX,CAAC;YACD,GAAG,CAAC,IAAI,CAAC;gBACP,KAAK;gBACL,MAAM;gBACN,IAAI;gBACJ,KAAK,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;YACH,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,IAAI,CAAC;gBACH,YAAY,CAAC,IAAI,CAAC;oBAChB,KAAK;oBACL,MAAM;oBACN,IAAI,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI;iBAChD,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,gBAAgB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,EAAE;YACN,GAAG;YACH,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACvC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;YACjC,mBAAmB;YACnB,YAAY;YACZ,gBAAgB;SACjB;QACD,gBAAgB;KACjB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Phase-D novel-candidate enumeration (v0.10.0 T3 — Part-IX §6's\n * \"novel candidate generated for physicist review\").\n *\n * Enumerates every ordered pair of edges that `composeEdges` accepts\n * (junction by name or registered identification; exact dimension\n * functor; the same checks as hand-written compositions) and\n * partitions the results into REGISTERED (the pre-registered CT-*\n * compositions, by composed id) and NOVEL (everything else — the\n * candidates a physicist should look at).\n *\n * The enumerator PROPOSES; it never promotes. Per the Part-VI §XXVII-B\n * protocol, a novel candidate's only output path is human review —\n * `docs/research/v0.11.0-novel-candidates.md` is the current review\n * surface (v0.10.0 report superseded).\n *\n * @module composition/enumerate\n */\n\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { BridgeEdge } from './edge.js';\nimport { CompositionAliasError, UndefinedCompositionError } from './edge.js';\nimport { composeEdges } from './compose.js';\nimport type { ComposeOptions } from './compose.js';\nimport { composeSymbolic } from './compose-symbolic.js';\n\n/** One successful pairwise composition found by the enumerator. @public */\nexport interface CompositionCandidate {\n  readonly first: BridgeEdge;\n  readonly second: BridgeEdge;\n  /** The composed edge (carries demoted confidence, piped domain). */\n  readonly edge: BridgeEdge;\n  /** True when the composed id is NOT in the registered set. */\n  readonly novel: boolean;\n}\n\n/**\n * A pair that is junction- and dimension-compatible but whose composed\n * sources would collide on a quantity name without a recorded\n * disposition (v0.11 Option D) — the enumerator surfaces these for\n * human judgment instead of silently aliasing them.\n *\n * @public\n */\nexport interface DispositionRequired {\n  readonly first: BridgeEdge;\n  readonly second: BridgeEdge;\n  readonly composedId: string;\n  readonly message: string;\n}\n\n/**\n * A pair `composeSymbolic` accepts. The expression is the substituted\n * scalar formula. A pair that only `composeEdges` accepts is not one of\n * these. Inlined on {@link EnumerationReport} so the package barrel gains\n * no name.\n */\ninterface SymbolicProofTarget {\n  readonly first: BridgeEdge;\n  readonly second: BridgeEdge;\n  readonly expr: ExprNode;\n}\n\n/**\n * A pair `composeEdges` accepts and `composeSymbolic` refuses. Unclassified:\n * the gap note owns the reading. Not a proof target.\n */\ninterface NotSubstitutablePair {\n  readonly first: BridgeEdge;\n  readonly second: BridgeEdge;\n}\n\n/**\n * A pair both of whose edges carry a relation, refused by the composition table.\n *\n * This is {@link UndefinedCompositionError} only. A dimension or junction\n * failure is not one of these, and neither is {@link CompositionAliasError}.\n *\n * @internal\n */\nexport interface RelationTableRefusal {\n  readonly first: BridgeEdge;\n  readonly second: BridgeEdge;\n  /** `${first.id}>>${second.id}`. */\n  readonly composedId: string;\n  readonly message: string;\n}\n\n/**\n * The report {@link enumerateCompositions} returns, plus the table refusals\n * that report does not carry.\n *\n * @internal\n */\nexport interface EnumerationWithRefusals {\n  readonly report: EnumerationReport;\n  readonly relationRefusals: readonly RelationTableRefusal[];\n}\n\n/** Enumeration report. @public */\nexport interface EnumerationReport {\n  readonly all: ReadonlyArray<CompositionCandidate>;\n  readonly registered: ReadonlyArray<CompositionCandidate>;\n  readonly novel: ReadonlyArray<CompositionCandidate>;\n  /** v0.11: name-colliding pairs awaiting an AliasDisposition. */\n  readonly requiresDisposition: ReadonlyArray<DispositionRequired>;\n  /**\n   * Pairs `composeSymbolic` accepts, when a seed set was supplied.\n   * Empty on the default call.\n   */\n  readonly proofTargets: ReadonlyArray<{\n    readonly first: BridgeEdge;\n    readonly second: BridgeEdge;\n    readonly expr: ExprNode;\n  }>;\n  /**\n   * Pairs only `composeEdges` accepts, when a seed set was supplied.\n   * Empty on the default call. Unclassified.\n   */\n  readonly notSubstitutable: ReadonlyArray<{\n    readonly first: BridgeEdge;\n    readonly second: BridgeEdge;\n  }>;\n}\n\n/**\n * The pre-registered composed ids (the CT-* set at v0.10.0). CT-1b's\n * 3-edge chain appears pairwise as its two links.\n *\n * @public\n */\nexport const REGISTERED_COMPOSITION_IDS: ReadonlySet<string> = new Set([\n  'be-42>>be-16', // CT-1\n  'law-schwarzschild-radius>>be-42-via-rs', // CT-1b link 1\n  'be-42-via-rs>>be-16', // CT-1b link 2\n  'be-12>>be-11-zurek', // CT-3\n]);\n\n/** Options of {@link enumerateCompositions}: the compose options plus the registered and seed id sets. @public */\nexport type EnumerationOptions = ComposeOptions & {\n  readonly registeredIds?: ReadonlySet<string>;\n  /** When set, only these edge ids are walked, and symbolic pairs are split. */\n  readonly seedIds?: ReadonlySet<string>;\n};\n\n/**\n * Enumerate all valid ordered pairwise compositions over `edges`.\n *\n * A table refusal is not in this report. {@link enumerateCompositionsWithRefusals}\n * returns the same report plus that list.\n *\n * @public\n */\nexport function enumerateCompositions(\n  edges: ReadonlyArray<BridgeEdge>,\n  opts: EnumerationOptions = {},\n): EnumerationReport {\n  return enumerateCompositionsWithRefusals(edges, opts).report;\n}\n\n/**\n * The pairs {@link enumerateCompositions} returns, plus each\n * {@link UndefinedCompositionError} on its own list.\n *\n * `report.proofTargets` is that function's list. A refused pair is not\n * moved onto it. A dimension or junction failure stays a silent non-pair:\n * absent from `relationRefusals` and from `report`.\n *\n * @internal\n */\nexport function enumerateCompositionsWithRefusals(\n  edges: ReadonlyArray<BridgeEdge>,\n  opts: EnumerationOptions = {},\n): EnumerationWithRefusals {\n  const registeredIds = opts.registeredIds ?? REGISTERED_COMPOSITION_IDS;\n  const all: CompositionCandidate[] = [];\n  const requiresDisposition: DispositionRequired[] = [];\n  const relationRefusals: RelationTableRefusal[] = [];\n  const proofTargets: SymbolicProofTarget[] = [];\n  const notSubstitutable: NotSubstitutablePair[] = [];\n  const seeded = opts.seedIds !== undefined;\n  const inSeed = (edge: BridgeEdge): boolean =>\n    opts.seedIds === undefined || opts.seedIds.has(edge.id);\n\n  for (const first of edges) {\n    if (!inSeed(first)) continue;\n    for (const second of edges) {\n      if (first === second) continue;\n      if (!inSeed(second)) continue;\n      let edge: BridgeEdge;\n      try {\n        edge = composeEdges(first, second, opts);\n      } catch (err) {\n        if (err instanceof CompositionAliasError) {\n          // Junction + dimensions passed; only the name collision\n          // blocks it — a human disposition unlocks this pair.\n          requiresDisposition.push({\n            first,\n            second,\n            composedId: `${first.id}>>${second.id}`,\n            message: err.message,\n          });\n        } else if (err instanceof UndefinedCompositionError) {\n          relationRefusals.push({\n            first,\n            second,\n            composedId: `${first.id}>>${second.id}`,\n            message: err.message,\n          });\n        }\n        // A dimension or junction failure stays a silent non-pair.\n        continue;\n      }\n      all.push({\n        first,\n        second,\n        edge,\n        novel: !registeredIds.has(edge.id),\n      });\n      if (!seeded) continue;\n      try {\n        proofTargets.push({\n          first,\n          second,\n          expr: composeSymbolic(first, second, opts).expr,\n        });\n      } catch {\n        notSubstitutable.push({ first, second });\n      }\n    }\n  }\n\n  return {\n    report: {\n      all,\n      registered: all.filter((c) => !c.novel),\n      novel: all.filter((c) => c.novel),\n      requiresDisposition,\n      proofTargets,\n      notSubstitutable,\n    },\n    relationRefusals,\n  };\n}\n"]}

package/dist/composition/evaluate-relation.js.map

@@ -1 +1 @@
-{"version":3,"file":"evaluate-relation.js","sourceRoot":"","sources":["../../src/composition/evaluate-relation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAE9E,OAAO,EAAE,iBAAiB,EAAsB,MAAM,0BAA0B,CAAC;AACjF,OAAO,EAAE,WAAW,EAAE,aAAa,EAAsB,MAAM,8BAA8B,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC5F,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAmB,MAAM,WAAW,CAAC;AAuBjF;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAmB;IACjD,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,4BAA4B,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClE,OAAO;QACL,IAAI,EAAE,QAAQ,EAAE,MAAM,IAAI,OAAO;QACjC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,EAAU;IAChC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9E,OAAO;QACL,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7D,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;KAC7F,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CAAC,EAAU,EAAE,IAAgB;IAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChD,GAAG,EAAE,MAAM,CAAC,IAAI;QAChB,SAAS,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChE,UAAU,EAAE,EAAE;QACd,QAAQ,EAAE,KAAK;QACf,MAAM,EAAE,OAAgB;QACxB,MAAM,EAAE,IAAI;KACb,CAAC,CAAC,CAAC;IACJ,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACzH,OAAO,aAAa,CAAC,EAAE,EAAE;QACvB,GAAG,WAAW;QACd,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,OAAgB,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;KACrJ,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAgB;IAChD,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC;IACnE,OAAO,YAAY,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,IAAK,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,IAAI,CAAC,EAAmB;IAC/B,IAAI,OAAO,EAAE,KAAK,QAAQ;QAAE,OAAO,EAAE,GAAG,EAAE,cAAc,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC5E,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAClC,OAAO,EAAE,GAAG,EAAE,cAAc,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC;IACnD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IACzC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAmB;IAClD,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAC9F,MAAM,SAAS,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACrF,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAClD,MAAM,IAAI,KAAK,CAAC,iCAAiC,GAAG,GAAG,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO;QACL,EAAE,EAAE,GAAG;QACP,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;QACvC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,IAAmB,EACnB,IAA4B,EAC5B,QAA0C;IAE1C,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI,4BAA4B,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,QAAQ,2BAA2B,CAAC,CAAC;IACpF,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IACvE,2FAA2F;IAC3F,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;AACvG,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,gBAAgB,CAC9B,EAAmB,EACnB,QAA0C;IAE1C,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;IACnC,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,oBAAoB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACtG,MAAM,IAAI,GAAG,KAAK,CAAC,IAAK,CAAC;IACzB,MAAM,OAAO,GAAG,WAAW,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC;IAChE,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;QACjD,0FAA0F;QAC1F,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IAC9D,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,qBAAqB;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC;QAC7F,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC"}
+{"version":3,"file":"evaluate-relation.js","sourceRoot":"","sources":["../../src/composition/evaluate-relation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAE9E,OAAO,EAAE,iBAAiB,EAAsB,MAAM,0BAA0B,CAAC;AACjF,OAAO,EAAE,WAAW,EAAE,aAAa,EAAsB,MAAM,8BAA8B,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC5F,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAmB,MAAM,WAAW,CAAC;AAuBjF;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAmB;IACjD,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,4BAA4B,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClE,OAAO;QACL,IAAI,EAAE,QAAQ,EAAE,MAAM,IAAI,OAAO;QACjC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,EAAU;IAChC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9E,OAAO;QACL,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7D,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;KAC7F,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CAAC,EAAU,EAAE,IAAgB;IAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChD,GAAG,EAAE,MAAM,CAAC,IAAI;QAChB,SAAS,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAChE,UAAU,EAAE,EAAE;QACd,QAAQ,EAAE,KAAK;QACf,MAAM,EAAE,OAAgB;QACxB,MAAM,EAAE,IAAI;KACb,CAAC,CAAC,CAAC;IACJ,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACzH,OAAO,aAAa,CAAC,EAAE,EAAE;QACvB,GAAG,WAAW;QACd,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,OAAgB,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;KACrJ,CAAC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAgB;IAChD,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC;IACnE,OAAO,YAAY,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,IAAK,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,IAAI,CAAC,EAAmB;IAC/B,IAAI,OAAO,EAAE,KAAK,QAAQ;QAAE,OAAO,EAAE,GAAG,EAAE,cAAc,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC5E,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAClC,OAAO,EAAE,GAAG,EAAE,cAAc,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC;IACnD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IACzC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAmB;IAClD,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAC9F,MAAM,SAAS,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACrF,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAClD,MAAM,IAAI,KAAK,CAAC,iCAAiC,GAAG,GAAG,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO;QACL,EAAE,EAAE,GAAG;QACP,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;QACvC,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,IAAmB,EACnB,IAA4B,EAC5B,QAA0C;IAE1C,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAG,IAAI,EAAE,MAAM,CAAC,GAAG,IAAI,4BAA4B,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,QAAQ,2BAA2B,CAAC,CAAC;IACpF,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IACvE,2FAA2F;IAC3F,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;AACvG,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,gBAAgB,CAC9B,EAAmB,EACnB,QAA0C;IAE1C,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;IACnC,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,oBAAoB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACtG,MAAM,IAAI,GAAG,KAAK,CAAC,IAAK,CAAC;IACzB,MAAM,OAAO,GAAG,WAAW,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC;IAChE,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;QACjD,0FAA0F;QAC1F,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IAC9D,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,qBAAqB;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC;QAC7F,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC","sourcesContent":["/**\n * One public evaluation of a catalog id or a canonical id.\n *\n * A catalog id with a closed-form evaluator is that evaluator's `run`, the\n * same call `upt evaluate` makes, so the library and the CLI check the\n * bindings, the domain and the value in one place. A canonical id is its\n * graph edge, checked against the same {@link checkInputs} contract first.\n * A formula string is not parsed. An unset coefficient is `kind: 'unset'` and\n * is not a number.\n *\n * @module composition/evaluate-relation\n */\n\nimport { EXPECTED_DIMENSION_BY_BRIDGE } from '../dimensional/bridge-check.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { BRIDGE_EVALUATORS, type EvaluatorSpec } from '../bridges/evaluators.js';\nimport { checkInputs, inputContract, type InputContract } from '../bridges/input-contract.js';\nimport { catalogEdgeKey, parseBridgeId, primaryRelation } from '../bridges/catalog-load.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { CANONICAL_GROUP_PREFACTORS } from './canonical-prefactors.js';\nimport { CANONICAL_GRAPH } from './canonical-graph.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { CoefficientUnsetError, evaluateEdge, type BridgeEdge } from './edge.js';\n\n/**\n * A sourced number, or an unset coefficient.\n *\n * `dimension` is the edge target. `formula` is the edge label.\n *\n * @public\n */\nexport type Evaluation =\n  | { readonly kind: 'value'; readonly value: number; readonly dimension: Dimension }\n  | { readonly kind: 'unset'; readonly formula: string };\n\n/**\n * An id the library can evaluate: a graph edge, a closed-form evaluator, or both.\n * The CLI and {@link evaluateRelation} both call this. Neither looks the id up again.\n */\nexport interface Evaluable {\n  readonly id: string;\n  readonly edge?: BridgeEdge;\n  readonly evaluator?: EvaluatorSpec;\n}\n\n/**\n * The output of a closed-form evaluator: the quantity it computes and that\n * quantity's dimension. An evaluator with no catalog dimension (a closed form\n * with no AST) names no dimension.\n */\nexport function evaluatorOutput(spec: EvaluatorSpec): { readonly name: string; readonly dimension?: Dimension } {\n  const relation = primaryRelation(spec.bridgeId);\n  const dimension = EXPECTED_DIMENSION_BY_BRIDGE.get(spec.bridgeId);\n  return {\n    name: relation?.target ?? 'value',\n    ...(dimension === undefined ? {} : { dimension }),\n  };\n}\n\n/**\n * Names a canonical id may be bound under besides its sources: the equation's\n * governing names (a registered constant may be overridden), its formula\n * factors, and a bound dimensionless group such as `gamma`.\n */\nfunction canonicalNames(id: string): string[] {\n  const equation = CANONICAL_EQUATIONS.find((candidate) => candidate.id === id);\n  return [\n    ...(equation?.dimensional.governing.map((g) => g.name) ?? []),\n    ...CANONICAL_GROUP_PREFACTORS.filter((group) => group.id === id).map((group) => group.group),\n  ];\n}\n\n/**\n * The declared inputs of an edge with no evaluator: each source under its name\n * and aliases, required; and, optional, its formula factors, the canonical\n * equation's governing names and a bound dimensionless group. A name that\n * already spells a source binds that source, so it is not a second slot.\n */\nfunction edgeContract(id: string, edge: BridgeEdge): InputContract {\n  const sourceSlots = edge.sources.map((source) => ({\n    key: source.name,\n    spellings: [source.name, ...(edge.aliases?.[source.name] ?? [])],\n    alternates: [],\n    optional: false,\n    readBy: 'value' as const,\n    listed: true,\n  }));\n  const spelled = new Set(sourceSlots.flatMap((slot) => slot.spellings));\n  const optional = [...Object.keys(edge.formulaFactors ?? {}), ...canonicalNames(id)].filter((name) => !spelled.has(name));\n  return inputContract(id, [\n    ...sourceSlots,\n    ...[...new Set(optional)].map((name) => ({ key: name, spellings: [name], alternates: [], optional: true, readBy: 'value' as const, listed: false })),\n  ]);\n}\n\n/**\n * The declared inputs of an evaluable id: the closed-form evaluator's contract\n * when it has one, else its edge's. {@link evaluateRelation} checks bindings\n * against exactly this contract.\n * @internal\n */\nexport function evaluableContract(found: Evaluable): InputContract {\n  if (found.evaluator !== undefined) return found.evaluator.contract;\n  return edgeContract(found.id, found.edge!);\n}\n\nfunction idOf(id: string | number): { key: string; numeric: number | undefined } {\n  if (typeof id === 'number') return { key: catalogEdgeKey(id), numeric: id };\n  try {\n    const numeric = parseBridgeId(id);\n    return { key: catalogEdgeKey(numeric), numeric };\n  } catch {\n    return { key: id, numeric: undefined };\n  }\n}\n\n/**\n * The edge and the closed-form evaluator for `id`, when either exists.\n * An unknown id throws. An id with an evaluator and no edge is not unknown.\n */\nexport function resolveEvaluable(id: string | number): Evaluable {\n  const { key, numeric } = idOf(id);\n  const edge = [...CATALOG_GRAPH, ...CANONICAL_GRAPH].find((candidate) => candidate.id === key);\n  const evaluator = numeric === undefined ? undefined : BRIDGE_EVALUATORS.get(numeric);\n  if (edge === undefined && evaluator === undefined) {\n    throw new Error(`evaluateRelation: unknown id '${key}'`);\n  }\n  return {\n    id: key,\n    ...(edge === undefined ? {} : { edge }),\n    ...(evaluator === undefined ? {} : { evaluator }),\n  };\n}\n\n/**\n * The closed form's primary output, through the evaluator's `run`. A record's\n * `value` is the catalog signature; any other number it returns is an extra\n * output, named by `spec.outputs`. A non-finite value at finite inputs is an\n * unset result (a dropped factor, a singularity).\n */\nfunction closedFormEvaluation(\n  spec: EvaluatorSpec,\n  edge: BridgeEdge | undefined,\n  bindings: Readonly<Record<string, number>>,\n): Evaluation {\n  const { value } = spec.run(bindings, 'value');\n  const dimension = edge?.target.dim ?? EXPECTED_DIMENSION_BY_BRIDGE.get(spec.bridgeId);\n  if (dimension === undefined) {\n    throw new Error(`evaluateRelation: be-${spec.bridgeId} has no catalog dimension`);\n  }\n  if (Number.isFinite(value)) return { kind: 'value', value, dimension };\n  // `run` refused a non-finite input, so a non-finite value here comes from the closed form.\n  return { kind: 'unset', formula: edge?.label ?? primaryRelation(spec.bridgeId)?.label ?? spec.name };\n}\n\n/**\n * Evaluate `id` at `bindings`.\n *\n * A catalog id is `be-70` or `70`. A canonical id is `CE-sound-speed`.\n * Binding keys are the inputs' keys, quantity names or aliases.\n * The bindings are checked before the domain: an unknown key throws\n * `UnknownInputError`, a non-number `InputTypeError` (a `TypeError`), a\n * `NaN` or an infinity `NonFiniteInputError`, a key given twice\n * `DuplicateInputError`, an absent input `MissingInputError`.\n * A domain failure throws `DomainViolationError`.\n * An unset coefficient returns `{ kind: 'unset', formula }` and no number.\n * A complete finite input whose closed form is not finite (a dropped factor,\n * a singularity) is the same unset result, not a missing input.\n *\n * @public\n */\nexport function evaluateRelation(\n  id: string | number,\n  bindings: Readonly<Record<string, number>>,\n): Evaluation {\n  const found = resolveEvaluable(id);\n  if (found.evaluator !== undefined) return closedFormEvaluation(found.evaluator, found.edge, bindings);\n  const edge = found.edge!;\n  const checked = checkInputs(evaluableContract(found), bindings);\n  try {\n    const value = evaluateEdge(edge, { ...checked });\n    // `checkInputs` refused a non-finite input, so a non-finite value comes from the formula.\n    if (!Number.isFinite(value)) return { kind: 'unset', formula: edge.label };\n    return { kind: 'value', value, dimension: edge.target.dim };\n  } catch (error) {\n    if (error instanceof CoefficientUnsetError) return { kind: 'unset', formula: error.formula };\n    throw error;\n  }\n}\n"]}

package/dist/composition/explain.d.ts

@@ -29,12 +29,20 @@ import type { IdentifiabilityResult } from './identifiability.js';
 import type { RetrodictionResult } from './retrodiction.js';
 import type { Dimension } from '../dimensional/types.js';
 /**
- * Text form of a recovered quantity: 15 significant digits, the precision an
- * evaluator input is already passed at. JSON keeps the number; this is only
- * the printed form. An integer stays an integer (`1`, not `1.0000e+0`).
+ * Text form of a recovered quantity: `digits` significant digits (15 by default, the precision an
+ * evaluator input is already passed at; a statistic such as a residual in σ asks for 3). JSON keeps
+ * the number; this is only the printed form. An integer stays an integer (`1`, not `1.0000e+0`).
+ * Every command prints a number through this function or through {@link formatExact}.
  * @internal
  */
-export declare function formatQuantity(value: number): string;
+export declare function formatQuantity(value: number, digits?: number): string;
+/**
+ * Text form of a computed value that a reader may need to reproduce bit for bit: the shortest
+ * decimal that round-trips to the same double (`upt evaluate`'s outputs). A recovered or compared
+ * quantity prints through {@link formatQuantity} instead.
+ * @internal
+ */
+export declare function formatExact(value: number): string;
 import type { DimensionalDeterminationResult } from '../dimensional/buckingham.js';
 /** One structural derivation of the target, with the recovered value when
  *  ground-truth values were supplied. @public */
@@ -103,11 +111,8 @@ export interface QuantityExplanation {
     /** Whether the KNOWN set dimensionally fixes the target (Buckingham-π);
      *  absent when the target has no resolvable dimension. */
     readonly dimensional?: DimensionalDeterminationResult;
-    /** Derivations that refused the given values as outside their validity domain. */
-    readonly refusals?: readonly {
-        readonly edge: string;
-        readonly reason: string;
-    }[];
+    /** Derivations that refused the given values, each under its own kind (`RetrodictionRefusal`). */
+    readonly refusals?: RetrodictionResult['refusals'];
     /** Upstream gaps for an under-determined target (from the classifier). */
     readonly blockingFrontier: readonly string[];
     /** Plain-language synthesis of the above. */

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

@@ -1 +1 @@
-{"version":3,"file":"explain.d.ts","sourceRoot":"","sources":["../../src/composition/explain.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAE3D,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAElE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAE5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAIzD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEpD;AACD,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,8BAA8B,CAAC;AAKnF;iDACiD;AACjD,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,yDAAyD;IACzD,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC;;;;;OAKG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE;QACzB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QACpD,4EAA4E;QAC5E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;KAC1B,CAAC;IACF,yEAAyE;IACzE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,mDAAmD;AACnD,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D,mEAAmE;IACnE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;CAChE;AAED,uDAAuD;AACvD,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,mEAAmE;IACnE,QAAQ,CAAC,eAAe,EAAE,qBAAqB,CAAC;IAChD,iEAAiE;IACjE,QAAQ,CAAC,WAAW,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACvD,wEAAwE;IACxE,QAAQ,CAAC,WAAW,CAAC,EAAE,kBAAkB,CAAC;IAC1C,2EAA2E;IAC3E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;IACrD;8DAC0D;IAC1D,QAAQ,CAAC,WAAW,CAAC,EAAE,8BAA8B,CAAC;IACtD,kFAAkF;IAClF,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAClF,0EAA0E;IAC1E,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,6CAA6C;IAC7C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AA2QD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC3D,IAAI,GAAE,cAAmB,GACxB,mBAAmB,CAwOrB"}
+{"version":3,"file":"explain.d.ts","sourceRoot":"","sources":["../../src/composition/explain.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAE3D,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAElE,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAE5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAIzD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,SAAK,GAAG,MAAM,CAEjE;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEjD;AACD,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,8BAA8B,CAAC;AAKnF;iDACiD;AACjD,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,yDAAyD;IACzD,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC;;;;;OAKG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE;QACzB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QACpD,4EAA4E;QAC5E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;KAC1B,CAAC;IACF,yEAAyE;IACzE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,mDAAmD;AACnD,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D,mEAAmE;IACnE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;CAChE;AAED,uDAAuD;AACvD,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,mEAAmE;IACnE,QAAQ,CAAC,eAAe,EAAE,qBAAqB,CAAC;IAChD,iEAAiE;IACjE,QAAQ,CAAC,WAAW,EAAE,SAAS,qBAAqB,EAAE,CAAC;IACvD,wEAAwE;IACxE,QAAQ,CAAC,WAAW,CAAC,EAAE,kBAAkB,CAAC;IAC1C,2EAA2E;IAC3E,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;IACrD;8DAC0D;IAC1D,QAAQ,CAAC,WAAW,CAAC,EAAE,8BAA8B,CAAC;IACtD,kGAAkG;IAClG,QAAQ,CAAC,QAAQ,CAAC,EAAE,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACnD,0EAA0E;IAC1E,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,6CAA6C;IAC7C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAyRD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC3D,IAAI,GAAE,cAAmB,GACxB,mBAAmB,CAoPrB"}

package/dist/composition/explain.js

@@ -29,13 +29,23 @@ import { retrodictNode } from './retrodiction.js';
 import { CANONICAL_GROUP_PREFACTORS } from './canonical-prefactors.js';
 import { canonicalById } from '../canonical/registry.js';
 /**
- * Text form of a recovered quantity: 15 significant digits, the precision an
- * evaluator input is already passed at. JSON keeps the number; this is only
- * the printed form. An integer stays an integer (`1`, not `1.0000e+0`).
+ * Text form of a recovered quantity: `digits` significant digits (15 by default, the precision an
+ * evaluator input is already passed at; a statistic such as a residual in σ asks for 3). JSON keeps
+ * the number; this is only the printed form. An integer stays an integer (`1`, not `1.0000e+0`).
+ * Every command prints a number through this function or through {@link formatExact}.
  * @internal
  */
-export function formatQuantity(value) {
-    return String(Number(value.toPrecision(15)));
+export function formatQuantity(value, digits = 15) {
+    return String(Number(value.toPrecision(digits)));
+}
+/**
+ * Text form of a computed value that a reader may need to reproduce bit for bit: the shortest
+ * decimal that round-trips to the same double (`upt evaluate`'s outputs). A recovered or compared
+ * quantity prints through {@link formatQuantity} instead.
+ * @internal
+ */
+export function formatExact(value) {
+    return String(value);
 }
 import { dimensionallyDetermines } from '../dimensional/buckingham.js';
 import { collapseSynonymGovernors } from './aliases.js';
@@ -202,7 +212,9 @@ function monomialWithFactors(monomial, factors, present) {
     }
     return merged;
 }
-function buildSummary(target, id, derivations, consistency, recoveredValue, dimensional, knownNames, formulaIsSum, encodedMatchesMonomial, unsetSentence, even) {
+function buildSummary(target, id, derivations, consistency, recoveredValue, dimensional, knownNames, formulaIsSum, encodedMatchesMonomial, unsetSentence, even, 
+/** The identification that determines the target when no edge does. */
+viaIdentification) {
     const known = knownNames.length
         ? `{${knownNames.join(', ')}}`
         : '{} (no inputs)';
@@ -226,12 +238,22 @@ function buildSummary(target, id, derivations, consistency, recoveredValue, dime
                 s += ` Knowing one of {${id.blockingFrontier.join(', ')}} would unblock it.`;
             }
             break;
-        case 'exactly-determined':
-            s = `'${target}' is determined from ${known} via ${derivations[0]?.edge} (${derivations[0]?.label}).`;
+        case 'exactly-determined': {
+            // No edge derives a target the identification alone determines; the
+            // sentence then names the identification, not an undefined edge
+            // (9.0.0 audit §4 C11).
+            const first = derivations[0];
+            s =
+                first !== undefined
+                    ? `'${target}' is determined from ${known} via ${first.edge} (${first.label}).`
+                    : viaIdentification !== undefined
+                        ? `'${target}' is determined from ${known} by the identification ${viaIdentification.from} ≡ ${viaIdentification.to} (${viaIdentification.rationale}).`
+                        : `'${target}' is determined from ${known}.`;
             if (recoveredValue !== undefined) {
                 s += ` Recovered value: ${formatQuantity(recoveredValue)}.`;
             }
             break;
+        }
         case 'over-determined':
         default: {
             // Independence is counted by BRIDGE, not by edge: be-42 and be-42-via-rs
@@ -280,8 +302,6 @@ function buildSummary(target, id, derivations, consistency, recoveredValue, dime
     }
     else if (dimensional?.determined && dimensional.monomial) {
         s += ` Dimensionally, ${known} fix it up to a dimensionless constant: ${target} ∝ ${formatMonomial(dimensional.monomial, even)}.`;
-        if (unsetSentence !== undefined)
-            s += ` ${unsetSentence}`;
     }
     else if (dimensional?.outsideGoverningSpan && knownNames.length) {
         s += ` Dimensionally, those inputs alone do not fix it — the encoded formula carries dimensionful constants.`;
@@ -289,6 +309,10 @@ function buildSummary(target, id, derivations, consistency, recoveredValue, dime
     else if (dimensional && !dimensional.determined && knownNames.length) {
         s += ` Dimensionally, those inputs alone do not fix a unique monomial.`;
     }
+    // The unset factor is a fact about the edge, whatever the inputs span: it is said whether or
+    // not a ∝ line could be printed (a baked constant removes the ∝ line, not the unset factor).
+    if (unsetSentence !== undefined)
+        s += ` ${unsetSentence}`;
     return s;
 }
 /**
@@ -474,10 +498,19 @@ export function explainQuantity(edges, target, known, opts = {}) {
             : recoveredValue !== undefined
                 ? 'sourced'
                 : undefined;
-    const summary = buildSummary(target, identifiability, derivations, consistency, recoveredValue, dimensional, knownNames, formulaIsSum, encodedAgrees, unsetSentence, magnitudeNames(firedEdges));
-    const refusalSentence = refusals === undefined || recoveredValue !== undefined
+    // A target with no derivation that is still determinable is reached by an
+    // identification whose `from` the known set determines.
+    const viaIdentification = identifiability.verdict === 'exactly-determined' && derivations.length === 0
+        ? identifications.find((ident) => ident.to === target && determinable.has(ident.from))
+        : undefined;
+    const summary = buildSummary(target, identifiability, derivations, consistency, recoveredValue, dimensional, knownNames, formulaIsSum, encodedAgrees, unsetSentence, magnitudeNames(firedEdges), viaIdentification);
+    // A refusal of the point (a validity domain, opposite carrier signs, a formula with no
+    // finite value there) is a bad value and is named with the edge's own reason. An unset
+    // coefficient is not: `unsetSentence` already says it in words (AGENTS law 4).
+    const domainRefusals = (refusals ?? []).filter((r) => r.kind !== 'coefficient-unset');
+    const refusalSentence = domainRefusals.length === 0 || recoveredValue !== undefined
         ? ''
-        : ` No recovered value: ${refusals.map((r) => r.reason).join('; ')}.`;
+        : ` No recovered value: ${domainRefusals.map((r) => r.reason).join('; ')}.`;
     return {
         target,
         known: knownNames,