universal-physics-tensor 9.0.0 → 10.0.0

package/dist/composition/compose.js.map

@@ -1 +1 @@
-{"version":3,"file":"compose.js","sourceRoot":"","sources":["../../src/composition/compose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAI3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EACL,qBAAqB,EACrB,yBAAyB,EACzB,wBAAwB,EACxB,yBAAyB,GAC1B,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,0EAA0E;AAC1E,+EAA+E;AAC/E,kEAAkE;AAClE,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACxF,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAG/D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,gBAAgB,CACvB,IAA4C,EAC5C,KAAuB,EACvB,MAAwB;IAExB,MAAM,cAAc,GAAG,GAAG,KAAK,CAAC,cAAc,SAAS,MAAM,CAAC,cAAc,EAAE,CAAC;IAC/E,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACjC,2EAA2E;QAC3E,6CAA6C;QAC7C,MAAM,EAAE,GAAI,KAAkE,CAAC,OAAO,CAAC;QACvF,MAAM,EAAE,GAAI,MAAmE,CAAC,OAAO,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;AAClC,CAAC;AAgBD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAsC;IACzE;QACE,IAAI,EAAE,qBAAqB;QAC3B,EAAE,EAAE,aAAa;QACjB,SAAS,EACP,+DAA+D;YAC/D,2DAA2D;YAC3D,2DAA2D;YAC3D,+DAA+D;YAC/D,gDAAgD;QAClD,QAAQ,EAAE,qDAAqD;KAChE;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,+DAA+D;YAC/D,oEAAoE;YACpE,oEAAoE;YACpE,sEAAsE;YACtE,mEAAmE;YACnE,wEAAwE;YACxE,wEAAwE;YACxE,gEAAgE;YAChE,kDAAkD;QACpD,QAAQ,EAAE,iDAAiD;KAC5D;IACD;QACE,IAAI,EAAE,+BAA+B;QACrC,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,sDAAsD;YACtD,uEAAuE;YACvE,mEAAmE;YACnE,wEAAwE;YACxE,oEAAoE;YACpE,yEAAyE;YACzE,2EAA2E;YAC3E,0EAA0E;YAC1E,4CAA4C;QAC9C,QAAQ,EAAE,uDAAuD;KAClE;CACF,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,gBAAuD,EACvD,MAAM,GAAsC,wBAAwB;IAEpE,MAAM,YAAY,GAAuB,EAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,GAAG;QAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,EAAE,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,MAAM;YAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;IACxF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;IACxF,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CACtE,CAAC;IAEF,MAAM,MAAM,GAA4H,EAAE,CAAC;IAC3I,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,MAAM,CAAC,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,MAAM,CAAC,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,MAAM,CAAC,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC;AAChB,CAAC;AAoBD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAElC;IACF,kEAAkE;IAClE,mEAAmE;IACnE,iEAAiE;IACjE,iCAAiC,EAAE;QACjC;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,QAAQ;YACjB,SAAS,EACP,gEAAgE;gBAChE,6DAA6D;gBAC7D,gDAAgD;SACnD;KACF;CACF,CAAC;AAEF,MAAM,eAAe,GAAmC;IACtD,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,CAAC;IACd,oBAAoB,EAAE,CAAC;CACxB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,CAAiB,EACjB,CAAiB;IAEjB,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAcD,SAAS,YAAY,CACnB,KAAiB,EACjB,MAAkB,EAClB,eAAkD;IAElD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjC,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;QACpD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC/C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;gBAC1B,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,IAAI,wBAAwB,CAChC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,oBAAoB;QAC5D,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,OAAO;aACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC,wCAAwC,CACxD,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAe,EAAE,KAAgB;IACvE,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAiB,EACjB,MAAkB,EAClB,IAAI,GAAmB,EAAE;IAEzB,MAAM,eAAe,GAAG;QACtB,GAAG,wBAAwB;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC;KAChC,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,GAAG,YAAY,CAClD,KAAK,EACL,MAAM,EACN,eAAe,CAChB,CAAC;IAEF,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,uBAAuB;YAC/D,cAAc,KAAK,CAAC,MAAM,CAAC,IAAI,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;YACjE,OAAO,QAAQ,CAAC,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CACpD,CAAC;IACJ,CAAC;IACD,MAAM,aAAa,GACjB,iBAAiB,KAAK,IAAI;QACxB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAEzD,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;IAEtE,qEAAqE;IACrE,qEAAqE;IACrE,kEAAkE;IAClE,kEAAkE;IAClE,iEAAiE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,cAAc,GAAG;QACrB,GAAG,IAAI,GAAG,CACR,gBAAgB;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACtB;KACF,CAAC;IACF,MAAM,UAAU,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAC/C,MAAM,YAAY,GAAuB;QACvC,GAAG,CAAC,yBAAyB,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;KACxB,CAAC;IACF,MAAM,SAAS,GAA2B,EAAE,CAAC,CAAC,uCAAuC;IACrF,MAAM,gBAAgB,GAAuB,EAAE,CAAC;IAChD,IAAI,cAAc,GAAe,CAAC,GAAG,gBAAgB,CAAC,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,sBAAsB,IAAI,YAAY;gBAChE,6BAA6B,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBAC5D,sBAAsB,gBAAgB;qBACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,6CAA6C;gBAC1D,qDAAqD;gBACrD,+DAA+D,CAClE,CAAC;QACJ,CAAC;QACD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,OAAO,KAAK,QAAQ;YAAE,SAAS,CAAC,iCAAiC;QACvE,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC;QACvC,IACE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAC9C,CAAC;YACD,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,0BAA0B,OAAO,IAAI;gBAC/D,gEAAgE,CACnE,CAAC;QACJ,CAAC;QACD,cAAc,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAChE,CAAC;QACF,SAAS,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED;;6EAEyE;IACzE,MAAM,iBAAiB,GAAG,CACxB,MAA8B,EAC9B,YAAoB,EACI,EAAE;QAC1B,MAAM,EAAE,GAA2B,EAAE,GAAG,MAAM,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5D,EAAE,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/B,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;QACrB,CAAC;QACD,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC;QACjD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG;QACrB,WAAW,EACT,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,sBAAsB;YAClD,GAAG,QAAQ,CAAC,IAAI,MAAM,MAAM,CAAC,MAAM,CAAC,WAAW,GAAG;QACpD,iEAAiE;QACjE,iEAAiE;QACjE,kEAAkE;QAClE,gEAAgE;QAChE,iEAAiE;QACjE,SAAS,EAAE,CAAC,MAA8B,EAAW,EAAE;YACrD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;QAC1E,CAAC;KACF,CAAC;IAEF,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAEvC,6EAA6E;IAC7E,yEAAyE;IACzE,0EAA0E;IAC1E,sEAAsE;IACtE,oEAAoE;IACpE,0EAA0E;IAC1E,kEAAkE;IAClE,sEAAsE;IACtE,qEAAqE;IACrE,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,IAAI,eAAe,GAGf,EAAE,CAAC;IACP,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,kBAAkB,EAAE,CAAC;YACrC,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sCAAsC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAI;gBAC7D,IAAI,KAAK,CAAC,EAAE,kBAAkB,MAAM,CAAC,QAAQ,CAAC,IAAI,IAAI;gBACtD,IAAI,MAAM,CAAC,EAAE,2CAA2C;gBACxD,6CAA6C,CAChD,CAAC;QACJ,CAAC;QACD,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;YAClC,+DAA+D;YAC/D,yEAAyE;YACzE,wEAAwE;YACxE,gEAAgE;YAChE,yEAAyE;YACzE,sEAAsE;YACtE,uEAAuE;YACvE,WAAW;YACX,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sDAAsD;gBACtD,mEAAmE;gBACnE,iFAAiF,CACpF,CAAC;QACJ,CAAC;QACD,0EAA0E;QAC1E,sEAAsE;QACtE,wEAAwE;QACxE,0EAA0E;QAC1E,yEAAyE;QACzE,2EAA2E;QAC3E,wEAAwE;QACxE,iCAAiC;QACjC,MAAM,MAAM,GACV,gBAAgB,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC;YAClE,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE;YACjD,CAAC,CAAC,EAAE,CAAC;QACT,eAAe,GAAG;YAChB,QAAQ,EAAE,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;YACtE,mBAAmB,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnE,CAAC;IACJ,CAAC;IAED,OAAO;QACL,EAAE;QACF,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ;QACtE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,EAAE;QACzC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,cAAc,CAAC;QAC9C,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;QAC9D,MAAM,EAAE,cAAc;QACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,oBAAoB,CAC5B,GAAG,EAAE,4CAA4C;oBAC/C,IAAI,cAAc,CAAC,WAAW,GAAG,CACpC,CAAC;YACJ,CAAC;YACD,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,oBAAoB,CAC5B,GAAG,EAAE,4CAA4C;oBAC/C,IAAI,cAAc,CAAC,WAAW,GAAG,CACpC,CAAC;YACJ,CAAC;YACD,OAAO,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACtC,CAAC;QACD,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,MAAM,MAAM,CAAC,QAAQ,EAAE;QAClD,GAAG,CAAC,iBAAiB,KAAK,IAAI;YAC5B,CAAC,CAAC,EAAE,kBAAkB,EAAE,iBAAiB,EAAE;YAC3C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAC7B,CAAC,CAAC,EAAE,qBAAqB,EAAE,gBAAgB,EAAE;YAC7C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,eAAe;KACnB,CAAC;AACJ,CAAC"}
+{"version":3,"file":"compose.js","sourceRoot":"","sources":["../../src/composition/compose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAIvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,yBAAyB,EACzB,wBAAwB,EACxB,yBAAyB,GAC1B,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,0EAA0E;AAC1E,+EAA+E;AAC/E,kEAAkE;AAClE,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACxF,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,gBAAgB,CACvB,IAA4C,EAC5C,KAAuB,EACvB,MAAwB;IAExB,MAAM,cAAc,GAAG,GAAG,KAAK,CAAC,cAAc,SAAS,MAAM,CAAC,cAAc,EAAE,CAAC;IAC/E,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACjC,2EAA2E;QAC3E,6CAA6C;QAC7C,MAAM,EAAE,GAAI,KAAkE,CAAC,OAAO,CAAC;QACvF,MAAM,EAAE,GAAI,MAAmE,CAAC,OAAO,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;AAClC,CAAC;AAgBD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAsC;IACzE;QACE,IAAI,EAAE,qBAAqB;QAC3B,EAAE,EAAE,aAAa;QACjB,SAAS,EACP,+DAA+D;YAC/D,2DAA2D;YAC3D,2DAA2D;YAC3D,+DAA+D;YAC/D,gDAAgD;QAClD,QAAQ,EAAE,qDAAqD;KAChE;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,+DAA+D;YAC/D,oEAAoE;YACpE,oEAAoE;YACpE,sEAAsE;YACtE,mEAAmE;YACnE,wEAAwE;YACxE,wEAAwE;YACxE,gEAAgE;YAChE,kDAAkD;QACpD,QAAQ,EAAE,iDAAiD;KAC5D;IACD;QACE,IAAI,EAAE,+BAA+B;QACrC,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,sDAAsD;YACtD,uEAAuE;YACvE,mEAAmE;YACnE,wEAAwE;YACxE,oEAAoE;YACpE,yEAAyE;YACzE,2EAA2E;YAC3E,0EAA0E;YAC1E,4CAA4C;QAC9C,QAAQ,EAAE,uDAAuD;KAClE;CACF,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,gBAAuD,EACvD,MAAM,GAAsC,wBAAwB;IAEpE,MAAM,YAAY,GAAuB,EAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,GAAG;QAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,EAAE,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,MAAM;YAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,2EAA2E;IAC3E,2EAA2E;IAC3E,kEAAkE;IAClE,0EAA0E;IAC1E,2DAA2D;IAC3D,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAkD,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAClH,CAAC;QACF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAE,CAAC;IACxD,CAAC;IACD,OAAO,kBAAkB,CAAC,MAAM,EAAE,uBAAuB,IAAI,GAAG,CAAC,CAAC;AACpE,CAAC;AAoBD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAElC;AACF,0EAA0E;AAC1E,2EAA2E;AAC3E,0EAA0E;AAC1E,wEAAwE;AACxE,sEAAsE;AACtE,2EAA2E;AAC3E,4EAA4E;AAC5E,oCAAoC;CACrC,CAAC;AAEF,MAAM,eAAe,GAAmC;IACtD,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,CAAC;IACd,oBAAoB,EAAE,CAAC;CACxB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,CAAiB,EACjB,CAAiB;IAEjB,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAcD,SAAS,YAAY,CACnB,KAAiB,EACjB,MAAkB,EAClB,eAAkD;IAOlD,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACpD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC/C,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;gBAC1B,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,IAAI,wBAAwB,CAChC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,oBAAoB;QAC5D,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,OAAO;aACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC,wCAAwC,CACxD,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAe,EAAE,KAAgB;IACvE,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAiB,EACjB,MAAkB,EAClB,IAAI,GAAmB,EAAE;IAEzB,MAAM,eAAe,GAAG;QACtB,GAAG,wBAAwB;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC;KAChC,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,aAAa,EAAE,iBAAiB,EAAE,GAAG,YAAY,CACxE,KAAK,EACL,MAAM,EACN,eAAe,CAChB,CAAC;IAEF,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,uBAAuB;YAC/D,cAAc,KAAK,CAAC,MAAM,CAAC,IAAI,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;YACjE,OAAO,QAAQ,CAAC,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CACpD,CAAC;IACJ,CAAC;IACD,MAAM,aAAa,GACjB,iBAAiB,KAAK,IAAI;QACxB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAEzD,sEAAsE;IACtE,0EAA0E;IAC1E,2EAA2E;IAC3E,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC;IAE9E,qEAAqE;IACrE,qEAAqE;IACrE,kEAAkE;IAClE,kEAAkE;IAClE,iEAAiE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,cAAc,GAAG;QACrB,GAAG,IAAI,GAAG,CACR,gBAAgB;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACtB;KACF,CAAC;IACF,MAAM,UAAU,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAC/C,MAAM,YAAY,GAAuB;QACvC,GAAG,CAAC,yBAAyB,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;KACxB,CAAC;IACF,MAAM,SAAS,GAA2B,EAAE,CAAC,CAAC,uCAAuC;IACrF,MAAM,gBAAgB,GAAuB,EAAE,CAAC;IAChD,IAAI,cAAc,GAAe,CAAC,GAAG,gBAAgB,CAAC,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,sBAAsB,IAAI,YAAY;gBAChE,6BAA6B,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBAC5D,sBAAsB,gBAAgB;qBACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,6CAA6C;gBAC1D,qDAAqD;gBACrD,+DAA+D,CAClE,CAAC;QACJ,CAAC;QACD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,OAAO,KAAK,QAAQ;YAAE,SAAS,CAAC,iCAAiC;QACvE,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC;QACvC,IACE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAC9C,CAAC;YACD,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,0BAA0B,OAAO,IAAI;gBAC/D,gEAAgE,CACnE,CAAC;QACJ,CAAC;QACD,cAAc,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAChE,CAAC;QACF,SAAS,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED;;6EAEyE;IACzE,MAAM,iBAAiB,GAAG,CACxB,MAA8B,EAC9B,YAAoB,EACI,EAAE;QAC1B,MAAM,EAAE,GAA2B,EAAE,GAAG,MAAM,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5D,EAAE,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/B,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;QACrB,CAAC;QACD,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC;QACjD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG;QACrB,WAAW,EACT,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,sBAAsB;YAClD,GAAG,QAAQ,CAAC,IAAI,MAAM,MAAM,CAAC,MAAM,CAAC,WAAW,GAAG;QACpD,iEAAiE;QACjE,iEAAiE;QACjE,kEAAkE;QAClE,gEAAgE;QAChE,iEAAiE;QACjE,SAAS,EAAE,CAAC,MAA8B,EAAW,EAAE;YACrD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;QAC1E,CAAC;KACF,CAAC;IAEF,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAEvC,6EAA6E;IAC7E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,kEAAkE;IAClE,sEAAsE;IACtE,qEAAqE;IACrE,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,IAAI,eAAe,GAGf,EAAE,CAAC;IACP,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,kBAAkB,EAAE,CAAC;YACrC,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sCAAsC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAI;gBAC7D,IAAI,KAAK,CAAC,EAAE,kBAAkB,MAAM,CAAC,QAAQ,CAAC,IAAI,IAAI;gBACtD,IAAI,MAAM,CAAC,EAAE,2CAA2C;gBACxD,6CAA6C,CAChD,CAAC;QACJ,CAAC;QACD,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;YAClC,+DAA+D;YAC/D,yEAAyE;YACzE,wEAAwE;YACxE,gEAAgE;YAChE,yEAAyE;YACzE,sEAAsE;YACtE,uEAAuE;YACvE,WAAW;YACX,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sDAAsD;gBACtD,mEAAmE;gBACnE,iFAAiF,CACpF,CAAC;QACJ,CAAC;QACD,0EAA0E;QAC1E,sEAAsE;QACtE,wEAAwE;QACxE,0EAA0E;QAC1E,yEAAyE;QACzE,2EAA2E;QAC3E,wEAAwE;QACxE,iCAAiC;QACjC,MAAM,MAAM,GACV,gBAAgB,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC;YAClE,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE;YACjD,CAAC,CAAC,EAAE,CAAC;QACT,eAAe,GAAG;YAChB,QAAQ,EAAE,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;YACtE,mBAAmB,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnE,CAAC;IACJ,CAAC;IAED,OAAO;QACL,EAAE;QACF,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ;QACtE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,EAAE;QACzC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,cAAc,CAAC;QAC9C,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;QAC9D,MAAM,EAAE,cAAc;QACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,oBAAoB,CAC5B,GAAG,EAAE,4CAA4C;oBAC/C,IAAI,cAAc,CAAC,WAAW,GAAG,CACpC,CAAC;YACJ,CAAC;YACD,kEAAkE;YAClE,uEAAuE;YACvE,0DAA0D;YAC1D,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,oBAAoB,CAC5B,GAAG,EAAE,4CAA4C;oBAC/C,IAAI,cAAc,CAAC,WAAW,GAAG,CACpC,CAAC;YACJ,CAAC;YACD,oBAAoB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,OAAO,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACtC,CAAC;QACD,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,MAAM,MAAM,CAAC,QAAQ,EAAE;QAClD,GAAG,CAAC,iBAAiB,KAAK,IAAI;YAC5B,CAAC,CAAC,EAAE,kBAAkB,EAAE,iBAAiB,EAAE;YAC3C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAC7B,CAAC,CAAC,EAAE,qBAAqB,EAAE,gBAAgB,EAAE;YAC7C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,eAAe;QAClB,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,CAAC;KACpF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,SAAS,aAAa,CACpB,KAAiB,EACjB,MAAkB,EAClB,QAAkB,EAClB,aAAqB,EACrB,cAAmC,EACnC,SAA2C;IAE3C,MAAM,GAAG,GAOL,EAAE,CAAC;IAEP,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9D,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,iCAAiC;gBACzE,cAAc,KAAK,CAAC,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,eAAe;gBAC3E,0DAA0D,CAC7D,CAAC;QACJ,CAAC;QACD,IAAI,CAAC;YACH,GAAG,CAAC,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7D,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,8EAA8E;YAC9E,6DAA6D;YAC7D,MAAM,IAAI,yBAAyB,CAAC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,KAAM,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACrE,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK,CAAC,gBAAgB,KAAK,IAAI,IAAI,MAAM,CAAC,gBAAgB,KAAK,IAAI;QAAE,GAAG,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAErG,mEAAmE;IACnE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IACzE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAE/G,MAAM,IAAI,GAAG;QACX,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;QAC3B,GAAG,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;KAClE,CAAC;IACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC;IAE3C,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChF,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,gBAAgB,CAAC;IACzG,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,CAAC;QACtE,IAAI,eAAe,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IAC1D,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,cAAc,GAAG,OAAO,CAAC;IAElE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,MAAM,UAAU,GAAG,CAAC,QAAgB,EAAE,IAAuB,EAAQ,EAAE;QACrE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/D,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;QAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC/F,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;QACpE,IAAI,eAAe,CAAC,QAAQ,CAAC;YAAE,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAC7B,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;SACpB,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAU,CAAC;SAClF,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CACzC,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC;IAErD,IACE,KAAK,CAAC,QAAQ,KAAK,SAAS;QAC5B,MAAM,CAAC,QAAQ,KAAK,SAAS;QAC7B,aAAa,KAAK,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;QACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QACnF,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9G,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Composition graph — the composition operator (v0.8.0 T2/T4, per\n * docs/planning/v0.8.0-Design.md §3 + r2 deltas).\n *\n * `composeEdges(first, second)` pipes `first`'s output quantity into a\n * matching source of `second`, producing a NEW `BridgeEdge` (design\n * D-2 — composition closes over the edge type, so chains nest\n * arbitrarily). Defined iff:\n *\n *   1. `first.target` matches one of `second.sources` — by canonical\n *      name, or via an explicit {@link QuantityIdentification} (the\n *      reviewable physics judgments, e.g. \"the Hawking temperature IS\n *      the temperature in Landauer's bound\");\n *   2. the junction dimensions are EXACTLY equal (the dimension-functor\n *      check — ℤ⁷ integer-vector equality via the dimensional\n *      calculus's `equals`);\n *   3. domains conjoin THROUGH the pipe (design D-5): the composed\n *      domain checks `first`'s domain on the outer inputs and\n *      `second`'s domain on the piped intermediate value. This\n *      evaluates `first.evaluate` inside the predicate — acceptable\n *      for scalar closed forms.\n *\n * Confidence demotes: `min(first, second)` on\n * established > speculative > highly-speculative. Composition never\n * launders credibility (improvement-plan confidence algebra).\n *\n * Operator is named `composeEdges` (NOT `compose`) — `compose` is the\n * public v0.7 Cell factory in `src/core/cell.ts` (Adam A-1).\n *\n * @module composition/compose\n */\n\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { BridgeEdge, EdgeConfidence } from './edge.js';\nimport type { Quantity, RegimeAttributes } from './quantity.js';\nimport { regimeAttributesOf } from './quantity.js';\nimport { AXES } from './axes.js';\nimport { conventionFactor } from '../dimensional/unit-convention.js';\nimport {\n  assertCoefficientSet,\n  CompositionAliasError,\n  CompositionDimensionError,\n  CompositionJunctionError,\n  UndefinedCompositionError,\n} from './edge.js';\nimport { DomainViolationError } from '../bridges/evaluation-errors.js';\nimport { substitute } from './expr-subst.js';\nimport { monomialExponents } from './formula-shape.js';\n// Atlas Phase 1 overlay. The composition table is a leaf module (pure, no\n// registry reads, no import from `src/composition/`), so this does not close a\n// cycle — same rule as the type-only atlas import in `./edge.ts`.\nimport { composeRelation, NO_COMPOSITE_CLAIM } from '../relations/composition-table.js';\nimport { checkConventions } from '../relations/conventions.js';\nimport { intersectRegimes } from '../relations/regime.js';\nimport type { Conventions, Regime, RelationContract, RelationType } from '../relations/types.js';\n\n/**\n * The `RelationContract` a composed edge carries, given the composite TYPE the\n * table returned and the two operand contracts.\n *\n * Only four types can be returned by the table (`derivation`,\n * `exact-equivalence`, `restriction`, `coarse-graining`); the other four appear\n * only as operands. `exact-equivalence` is produced by exactly one cell —\n * `exact-equivalence ∘ exact-equivalence` — so both operands are guaranteed to\n * carry the `inverse` its contract requires, and the composed inverse undoes\n * the second map first.\n *\n * NOT composed here: an `ApproximationBound`. `coarse-graining ∘\n * coarse-graining` accumulates error through `composeBounds`\n * (`src/atlas/error-algebra.ts`), which the implementation plan wires in as a\n * SEPARATE task behind this same guard. Until then the composite states its\n * type and no bound — it does not restate either operand's bound, which would\n * be a narrower error claim than the chain supports.\n *\n * @internal\n */\nfunction composedContract(\n  type: Exclude<RelationType, 'approximation'>,\n  first: RelationContract,\n  second: RelationContract,\n): RelationContract {\n  const transformation = `${first.transformation} then ${second.transformation}`;\n  if (type === 'exact-equivalence') {\n    // Guarded by the table: only exact ∘ exact yields exact, and that contract\n    // makes `inverse` REQUIRED on both operands.\n    const fi = (first as Extract<RelationContract, { type: 'exact-equivalence' }>).inverse;\n    const si = (second as Extract<RelationContract, { type: 'exact-equivalence' }>).inverse;\n    return { type, transformation, inverse: `${si} then ${fi}` };\n  }\n  return { type, transformation };\n}\n\n/**\n * A reviewable quantity-identification judgment: the assertion that\n * the quantity named `from` (an edge's target) IS the quantity named\n * `to` (another edge's source), with the physics rationale on record.\n *\n * @public\n */\nexport interface QuantityIdentification {\n  readonly from: string;\n  readonly to: string;\n  readonly rationale: string;\n  readonly citation?: string;\n}\n\n/**\n * Registered identifications (v0.8.0 CT-1). Each entry is a physics\n * judgment intended for review — see CONTRIBUTING.md.\n *\n * @public\n */\nexport const QUANTITY_IDENTIFICATIONS: readonly QuantityIdentification[] = [\n  {\n    from: 'hawking-temperature',\n    to: 'temperature',\n    rationale:\n      'The Hawking temperature of a black-hole horizon is a genuine ' +\n      'thermodynamic temperature — the temperature appearing in ' +\n      \"Landauer's bound for erasure at the horizon. This is the \" +\n      'standard identification underlying black-hole thermodynamics ' +\n      '(the horizon radiates as a black body at T_H).',\n    citation: 'Hawking 1975 CMP 43:199; Bekenstein 1973 PRD 7:2333',\n  },\n  {\n    from: 'de-broglie-wavelength',\n    to: 'compton-wavelength',\n    rationale:\n      'The de Broglie wavelength λ = h/p and the Compton wavelength ' +\n      'λ_C = h/(mc) are the SAME matter-wavelength quantity of a massive ' +\n      'particle; the Compton wavelength is its value in the relativistic ' +\n      'limit p = mc (v → c). They are equal only in that limit, but at the ' +\n      'composition graph’s quantity-KIND resolution they name one node. ' +\n      'Folded ONTO compton-wavelength (not the reverse) because that node is ' +\n      'anchor-determinable (ℏ/mc from a mass) and carries the sourced atomic ' +\n      'scale the magnitude gate needs; de-broglie’s own form needs a ' +\n      'momentum the single-mass anchor does not supply.',\n    citation: 'de Broglie 1924; Compton 1923 Phys. Rev. 21:483',\n  },\n  {\n    from: 'thermal-de-broglie-wavelength',\n    to: 'thermal-wavelength',\n    rationale:\n      'The catalog names the thermal de Broglie wavelength ' +\n      'λ_T = √(2πℏ²/(m k_B T)) `thermal-de-broglie-wavelength` (BE-11 Zurek ' +\n      'decoherence, BE-12 Caldeira–Leggett coherence length), while the ' +\n      'canonical L-layer law `CE-thermal-de-broglie` names the SAME physical ' +\n      'quantity `thermal-wavelength`. They are one node. Folded ONTO the ' +\n      'canonical `thermal-wavelength` (anchor-determinable: √(2πℏ²/(m k_B T)) ' +\n      'from a mass + temperature), reconnecting BE-11 — an ESTABLISHED bridge — ' +\n      'to standard physics (surfaced by the bridges-vs-canonical map; the link ' +\n      'was hidden purely by the name divergence).',\n    citation: 'de Broglie 1924; standard statistical mechanics (λ_T)',\n  },\n];\n\n/**\n * Effective regime attributes for a candidate NAME, resolved through the\n * `QUANTITY_IDENTIFICATIONS` fold — the SINGLE shared implementation every\n * attribute consumer must use (Eve r3 #2 mandate; the discovery-hardening\n * Phase-2 axis-compatibility gate is the first). `attributesByName` is the\n * REGISTRY-only source (never canonical per-equation stamps — Option-A,\n * audit adjudication F1): callers supply it (production: every centralized\n * `Quantity.attributes`; tests: an injected fixture map), this function only\n * does the fold resolution.\n *\n * Candidate names are already fold-canonicalized (the `to` side of an\n * identification); this additionally pulls in every `from` contributor that\n * folds ONTO `name` and, per axis, unions their stated value with `name`'s\n * own. Where contributors DISAGREE on an axis, the axis counts as UNSTATED\n * (conflict → abstain) rather than picking a side — the fold-conflict rule.\n *\n * @internal\n */\nexport function effectiveAttributes(\n  name: string,\n  attributesByName: ReadonlyMap<string, RegimeAttributes>,\n  idents: readonly QuantityIdentification[] = QUANTITY_IDENTIFICATIONS,\n): RegimeAttributes {\n  const contributors: RegimeAttributes[] = [];\n  const own = attributesByName.get(name);\n  if (own) contributors.push(own);\n  for (const id of idents) {\n    if (id.to !== name) continue;\n    const folded = attributesByName.get(id.from);\n    if (folded) contributors.push(folded);\n  }\n\n  // One-value-agrees, zero-or-conflicting-values-abstain, per REGISTRY axis.\n  // The fold reads `AXES`, so an axis the registry carries is folded here: a\n  // hand list once named scale, force and information only, and the\n  // discrimination audit then measured symmetry, topology and statistics as\n  // `checked: 0` whatever the data said (9.0.0 audit §4 C2).\n  const folded: Record<string, string> = {};\n  for (const { name } of AXES) {\n    const values = new Set(\n      contributors.map((c) => (c as Readonly<Record<string, string | undefined>>)[name]).filter((v) => v !== undefined),\n    );\n    if (values.size === 1) folded[name] = [...values][0]!;\n  }\n  return regimeAttributesOf(folded, `effectiveAttributes(${name})`);\n}\n\n/**\n * A recorded aliasing judgment for one duplicate source name in a\n * composition (v0.11 Option D). `'shared'` = one input deliberately\n * feeds both slots (e.g. ST-2: one M is both the lens and the r_s\n * source). `renameSecond` = split the collision: the SECOND operand's\n * quantity is renamed, and the composed evaluator remaps the renamed\n * input key back to the operand's internal name (vet A-4 — without the\n * remap the rename is a no-op).\n *\n * @public\n */\nexport interface AliasDisposition {\n  readonly name: string;\n  readonly treatAs: 'shared' | { readonly renameSecond: string };\n  readonly rationale: string;\n  readonly citation?: string;\n}\n\n/**\n * Registered alias dispositions, keyed by composed id\n * (`first.id>>second.id`) — judgments live in reviewable registry\n * data, mirroring {@link QUANTITY_IDENTIFICATIONS} (vet A-6.2).\n *\n * @public\n */\nexport const SOURCE_ALIAS_DISPOSITIONS: Readonly<\n  Record<string, readonly AliasDisposition[]>\n> = {\n  // Empty. The one entry this table held, `law-schwarzschild-radius>>be-51`\n  // (\"ST-2\": one M is both the lens and the r_s source), keyed a composition\n  // no call can reach: the law's target `schwarzschild-radius` matches none\n  // of be-51's sources (`mass`, `impact-parameter`) by name or registered\n  // identification, so `composeEdges` throws `CompositionJunctionError`\n  // before the alias gate runs. The judgment was never applied. Retracted in\n  // the 9.0.0 audit (§4 C8); `tests/composition/compose.test.ts` now requires\n  // every key here to reach the gate.\n};\n\nconst CONFIDENCE_RANK: Record<EdgeConfidence, number> = {\n  established: 2,\n  speculative: 1,\n  'highly-speculative': 0,\n};\n\n/**\n * Confidence demotion: the min of the two grades on the ordering\n * established > speculative > highly-speculative.\n *\n * @public\n */\nexport function minConfidence(\n  a: EdgeConfidence,\n  b: EdgeConfidence,\n): EdgeConfidence {\n  return CONFIDENCE_RANK[a] <= CONFIDENCE_RANK[b] ? a : b;\n}\n\n/** Options for {@link composeEdges}. @public */\nexport interface ComposeOptions {\n  /** Extra identifications, consulted after the registered ones. */\n  readonly identifications?: readonly QuantityIdentification[];\n  /**\n   * Alias dispositions for duplicate source names (v0.11 Option D);\n   * consulted after {@link SOURCE_ALIAS_DISPOSITIONS} entries for the\n   * composed id.\n   */\n  readonly aliases?: readonly AliasDisposition[];\n}\n\nfunction findJunction(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  identifications: readonly QuantityIdentification[],\n): {\n  junction: BridgeEdge['sources'][number];\n  /** Position in `second.sources`: the slot the pipe fills. One slot, even when the same object sits twice. */\n  index: number;\n  viaIdentification: QuantityIdentification | null;\n} {\n  for (const [index, src] of second.sources.entries()) {\n    if (src.name === first.target.name) {\n      return { junction: src, index, viaIdentification: null };\n    }\n  }\n  for (const ident of identifications) {\n    if (ident.from !== first.target.name) continue;\n    for (const [index, src] of second.sources.entries()) {\n      if (src.name === ident.to) {\n        return { junction: src, index, viaIdentification: ident };\n      }\n    }\n  }\n  throw new CompositionJunctionError(\n    `Cannot compose ${first.id} -> ${second.id}: target quantity ` +\n      `'${first.target.name}' matches none of [${second.sources\n        .map((s) => `'${s.name}'`)\n        .join(', ')}] by name or registered identification`,\n  );\n}\n\n/**\n * The two sides of a composition pipe have the same dimension.\n *\n * This is the check `composeEdges` already applied: `equals` on the seven\n * SI bases, including that function's exponent tolerance. A mismatch is\n * still {@link CompositionDimensionError}.\n *\n * @internal\n */\nexport function junctionDimensionsMatch(left: Dimension, right: Dimension): boolean {\n  return equals(left, right);\n}\n\n/**\n * Compose two edges into a new edge (sequential composition through a\n * shared quantity). See module docs for the definedness conditions.\n *\n * The composed edge's `sources` are `first.sources` followed by\n * `second`'s remaining (non-junction) sources; `kind` is `'law'` only\n * when both operands are laws; `beId` is null (a derived relation has\n * no single catalog row).\n *\n * @public\n */\nexport function composeEdges(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  opts: ComposeOptions = {},\n): BridgeEdge {\n  const identifications = [\n    ...QUANTITY_IDENTIFICATIONS,\n    ...(opts.identifications ?? []),\n  ];\n  const { junction, index: junctionIndex, viaIdentification } = findJunction(\n    first,\n    second,\n    identifications,\n  );\n\n  if (!junctionDimensionsMatch(first.target.dim, junction.dim)) {\n    throw new CompositionDimensionError(\n      `Cannot compose ${first.id} -> ${second.id}: junction dimension ` +\n        `mismatch — ${first.target.name} is ${format(first.target.dim)} ` +\n        `but ${junction.name} is ${format(junction.dim)}`,\n    );\n  }\n  const junctionScale =\n    viaIdentification === null\n      ? 1\n      : conventionFactor(first.target.name, junction.name);\n\n  // The pipe fills ONE slot of `second.sources`, the one `findJunction`\n  // returned. Removal by object identity would also drop a second slot that\n  // holds the same `Quantity` object, which a `shared` disposition produces.\n  const remainingSources = second.sources.filter((_, i) => i !== junctionIndex);\n\n  // v0.11 Option D (namespacing gate): pure name-collision rule across\n  // operands. Intra-operand duplicates (e.g. ['mass','mass'] inherited\n  // from a prior 'shared' disposition) are exempt by construction —\n  // only names present in BOTH first.sources and second's remaining\n  // sources are collisions, and each needs a recorded disposition.\n  const firstNames = new Set(first.sources.map((s) => s.name));\n  const collisionNames = [\n    ...new Set(\n      remainingSources\n        .filter((s) => firstNames.has(s.name))\n        .map((s) => s.name),\n    ),\n  ];\n  const composedId = `${first.id}>>${second.id}`;\n  const dispositions: AliasDisposition[] = [\n    ...(SOURCE_ALIAS_DISPOSITIONS[composedId] ?? []),\n    ...(opts.aliases ?? []),\n  ];\n  const renameMap: Record<string, string> = {}; // renamed key -> operand-internal name\n  const dispositionsUsed: AliasDisposition[] = [];\n  let finalRemaining: Quantity[] = [...remainingSources];\n  for (const name of collisionNames) {\n    const d = dispositions.find((x) => x.name === name);\n    if (!d) {\n      throw new CompositionAliasError(\n        `Cannot compose ${composedId}: source quantity '${name}' appears ` +\n          `in BOTH operands (first: [${[...firstNames].join(', ')}]; ` +\n          `second remaining: [${remainingSources\n            .map((s) => s.name)\n            .join(', ')}]). Same name does not imply same physical ` +\n          `quantity — record an AliasDisposition ('shared' or ` +\n          `{renameSecond}) in SOURCE_ALIAS_DISPOSITIONS or opts.aliases.`,\n      );\n    }\n    dispositionsUsed.push(d);\n    if (d.treatAs === 'shared') continue; // one input key feeds both slots\n    const renamed = d.treatAs.renameSecond;\n    if (\n      firstNames.has(renamed) ||\n      second.sources.some((s) => s.name === renamed)\n    ) {\n      throw new CompositionAliasError(\n        `Cannot compose ${composedId}: renameSecond target '${renamed}' ` +\n          `collides with an existing source name of an operand (vet A-4).`,\n      );\n    }\n    finalRemaining = finalRemaining.map((s) =>\n      s.name === name ? { ...s, name: renamed, symbol: s.symbol } : s,\n    );\n    renameMap[renamed] = name;\n  }\n\n  /** Build the second operand's input map: remap renamed keys back to\n   *  the operand-internal names (shadowing the first operand's value\n   *  for that name — vet A-4's required remap), then pipe the junction. */\n  const buildSecondInputs = (\n    inputs: Record<string, number>,\n    intermediate: number,\n  ): Record<string, number> => {\n    const si: Record<string, number> = { ...inputs };\n    for (const [renamed, original] of Object.entries(renameMap)) {\n      si[original] = inputs[renamed];\n      delete si[renamed];\n    }\n    si[junction.name] = intermediate * junctionScale;\n    return si;\n  };\n\n  const composedDomain = {\n    description:\n      `(${first.domain.description}) AND, on the piped ` +\n      `${junction.name}, (${second.domain.description})`,\n    // Standalone domain queries evaluate `first` to obtain the piped\n    // intermediate (design D-5; acceptable for scalar closed forms).\n    // The composed `evaluate` below does NOT call this predicate — it\n    // computes the intermediate once and checks both domains inline\n    // (v0.8.0 punch-list: removed the double evaluation of `first`).\n    predicate: (inputs: Record<string, number>): boolean => {\n      if (!first.domain.predicate(inputs)) return false;\n      const intermediate = first.evaluate(inputs);\n      return second.domain.predicate(buildSecondInputs(inputs, intermediate));\n    },\n  };\n\n  const id = `${first.id}>>${second.id}`;\n\n  // ── Atlas Phase 1 (S1.2b): the relation overlay, and NOTHING else. ────────\n  // Entered only when BOTH operands carry a `relation`. An operand with no\n  // relation skips this block, and the composed edge then has no `relation`\n  // key. The catalog edges that carry one are the catalog's `relation` rows\n  // (`tests/composition/relation-refusal.test.ts` lists them); they stay.\n  // When both operands carry a relation, a silent table cell throws\n  // `UndefinedCompositionError`. The approximation cell throws the same\n  // error, because an edge relation carries no norm transport and this\n  // layer does not invent a bound. `enumerateCompositionsWithRefusals`\n  // records that throw on its own list. A dimension or junction failure\n  // is a different error and is not that list.\n  let relationOverlay: Pick<\n    BridgeEdge,\n    'relation' | 'relationDerivedFrom' | 'conventions'\n  > = {};\n  if (first.relation !== undefined && second.relation !== undefined) {\n    const composite = composeRelation(first.relation.type, second.relation.type);\n    if (composite === NO_COMPOSITE_CLAIM) {\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the composition table ` +\n          `asserts no composite relation for '${first.relation.type}' ` +\n          `(${first.id}) followed by '${second.relation.type}' ` +\n          `(${second.id}). This is silence, not refutation — see ` +\n          `docs/planning/Atlas-Phase-1-Design.md §2.2.`,\n      );\n    }\n    if (composite === 'approximation') {\n      // Reachable since the table's one widening: approximation then\n      // exact-equivalence (docs/planning/ADR-transported-norm-composition.md).\n      // An `approximation` contract REQUIRES an `ApproximationBound`, and the\n      // composed bound exists only when the exact map declares a norm\n      // transport. A `RelationContract` on an edge carries none, so this layer\n      // cannot compose the bound and must refuse rather than fabricate one.\n      // The atlas route layer (`boundPath`) is where a declared transport is\n      // applied.\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the composition table ` +\n          `returned 'approximation', which requires a composed ` +\n          `ApproximationBound; an edge relation declares no norm transport, ` +\n          `so no bound is composed here (the atlas boundPath applies declared transports).`,\n      );\n    }\n    // Conventions carry forward only when the operands do not CONTRADICT each\n    // other. `checkConventions` treats an undeclared key as unknown, so a\n    // silent operand never blocks the carry-forward; a genuine disagreement\n    // does, and then the composite declares no conventions at all rather than\n    // picking one operand's choice over the other's. One rule, not a per-key\n    // filter: a chain built across a sign disagreement has no single first-law\n    // convention to state, and stating one would be a claim about the chain\n    // that neither operand supports.\n    const merged: Conventions =\n      checkConventions(first.conventions, second.conventions).length === 0\n        ? { ...first.conventions, ...second.conventions }\n        : {};\n    relationOverlay = {\n      relation: composedContract(composite, first.relation, second.relation),\n      relationDerivedFrom: [first.id, second.id],\n      ...(Object.keys(merged).length > 0 ? { conventions: merged } : {}),\n    };\n  }\n\n  return {\n    id,\n    beId: null,\n    kind: first.kind === 'law' && second.kind === 'law' ? 'law' : 'bridge',\n    label: `${first.label} ∘ ${second.label}`,\n    sources: [...first.sources, ...finalRemaining],\n    target: second.target,\n    confidence: minConfidence(first.confidence, second.confidence),\n    domain: composedDomain,\n    evaluate: (inputs) => {\n      if (!first.domain.predicate(inputs)) {\n        throw new DomainViolationError(\n          `${id}: inputs violate composed validity domain ` +\n            `(${composedDomain.description})`,\n        );\n      }\n      // Each operand's unset-coefficient gate is the one `evaluateEdge`\n      // applies to a primitive edge; an operand's monomial times an absent 1\n      // must not reach the caller as a number through the pipe.\n      assertCoefficientSet(first, inputs);\n      const intermediate = first.evaluate(inputs);\n      const pipedInputs = buildSecondInputs(inputs, intermediate);\n      if (!second.domain.predicate(pipedInputs)) {\n        throw new DomainViolationError(\n          `${id}: inputs violate composed validity domain ` +\n            `(${composedDomain.description})`,\n        );\n      }\n      assertCoefficientSet(second, pipedInputs);\n      return second.evaluate(pipedInputs);\n    },\n    citation: `${first.citation} | ${second.citation}`,\n    ...(viaIdentification !== null\n      ? { identificationUsed: viaIdentification }\n      : {}),\n    ...(dispositionsUsed.length > 0\n      ? { aliasDispositionsUsed: dispositionsUsed }\n      : {}),\n    ...relationOverlay,\n    ...carriedClaims(first, second, junction, junctionScale, finalRemaining, renameMap),\n  };\n}\n\n/**\n * The claims a composed edge carries from its operands (9.0.0 audit §4 C5).\n * A composed edge that dropped them answered differently from its operands:\n * the regime gate abstained on every chain longer than two, an unset\n * coefficient became a number, an even input lost its magnitude reading,\n * a count became a Buckingham governor, and an alias key stopped working.\n *\n * - `regime`: the one an operand states; two of one family intersect\n *   (`intersectRegimes`, which also refuses conflicting group definitions);\n *   two of different families refuse with `UndefinedCompositionError`, since\n *   this layer does not state where a cross-family chain applies.\n * - `coefficientUnset`: either operand's. `evaluateEdge` then refuses the\n *   composite; a bound group lifts a primitive entry only, because the group\n *   row is keyed by the entry id, so a composite with an unset operand is\n *   refused by `evaluateEdge` whatever is bound (its own `evaluate` applies\n *   each operand's gate and does lift the operand whose group is bound).\n * - `evenInputs`, `aliases`: the first operand's, plus the second's for its\n *   remaining sources under their composed names. The piped junction is not\n *   an input and is dropped. An alias key that two quantities would share is\n *   carried for neither.\n * - `formulaFactors`: the second operand's for its remaining sources, exact.\n *   The first operand's counts enter through the pipe with their exponent\n *   times the junction's exponent in the second's monomial, so they are\n *   carried only when `second.symbolic` is a monomial that states it.\n * - `symbolic`: the second's form with the junction leaf replaced by the\n *   first's, when both exist, the junction carries no convention factor, no\n *   source was renamed, the leaf occurs, and the result validates to the\n *   target dimension. Otherwise absent, as on a numeric-only edge.\n */\nfunction carriedClaims(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  junction: Quantity,\n  junctionScale: number,\n  finalRemaining: readonly Quantity[],\n  renameMap: Readonly<Record<string, string>>,\n): Pick<BridgeEdge, 'regime' | 'coefficientUnset' | 'evenInputs' | 'formulaFactors' | 'aliases' | 'symbolic'> {\n  const out: {\n    regime?: Regime;\n    coefficientUnset?: boolean;\n    evenInputs?: readonly string[];\n    formulaFactors?: Readonly<Record<string, number>>;\n    aliases?: Readonly<Record<string, readonly string[]>>;\n    symbolic?: ExprNode;\n  } = {};\n\n  if (first.regime !== undefined && second.regime !== undefined) {\n    if (first.regime.family !== second.regime.family) {\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the regimes are of different ` +\n          `families ('${first.regime.family}', '${second.regime.family}'), and this ` +\n          `layer does not state where a cross-family chain applies.`,\n      );\n    }\n    try {\n      out.regime = intersectRegimes(first.regime, second.regime);\n    } catch (e) {\n      // Conflicting definitions of one group name: the composite has no regime this\n      // layer can state, the same refusal as a cross-family chain.\n      throw new UndefinedCompositionError(`Cannot compose ${first.id} -> ${second.id}: ${(e as Error).message}`);\n    }\n  } else if (first.regime !== undefined || second.regime !== undefined) {\n    out.regime = first.regime ?? second.regime;\n  }\n\n  if (first.coefficientUnset === true || second.coefficientUnset === true) out.coefficientUnset = true;\n\n  // Operand-internal name → the name the composite exposes it under.\n  const composedName = new Map(Object.entries(renameMap).map(([renamed, original]) => [original, renamed]));\n  const exposed = (name: string): string => composedName.get(name) ?? name;\n  const remainingNames = new Set(finalRemaining.map((s) => s.name));\n  const secondRemaining = (name: string): boolean => name !== junction.name && remainingNames.has(exposed(name));\n\n  const even = [\n    ...(first.evenInputs ?? []),\n    ...(second.evenInputs ?? []).filter(secondRemaining).map(exposed),\n  ];\n  if (even.length > 0) out.evenInputs = even;\n\n  const factors: Record<string, number> = {};\n  const junctionExponent = monomialExponents(second.symbolic)?.get(junction.name);\n  if (first.formulaFactors !== undefined && junctionExponent !== undefined) {\n    for (const [name, exp] of Object.entries(first.formulaFactors)) factors[name] = exp * junctionExponent;\n  }\n  for (const [name, exp] of Object.entries(second.formulaFactors ?? {})) {\n    if (secondRemaining(name)) factors[exposed(name)] = exp;\n  }\n  if (Object.keys(factors).length > 0) out.formulaFactors = factors;\n\n  const aliasOwner = new Map<string, string>();\n  const shared = new Set<string>();\n  const aliases: Record<string, string[]> = {};\n  const addAliases = (quantity: string, keys: readonly string[]): void => {\n    for (const key of keys) {\n      const owner = aliasOwner.get(key);\n      if (owner !== undefined && owner !== quantity) shared.add(key);\n      aliasOwner.set(key, quantity);\n      (aliases[quantity] ??= []).push(key);\n    }\n  };\n  for (const [quantity, keys] of Object.entries(first.aliases ?? {})) addAliases(quantity, keys);\n  for (const [quantity, keys] of Object.entries(second.aliases ?? {})) {\n    if (secondRemaining(quantity)) addAliases(exposed(quantity), keys);\n  }\n  const kept = Object.fromEntries(\n    Object.entries(aliases)\n      .map(([quantity, keys]) => [quantity, keys.filter((k) => !shared.has(k))] as const)\n      .filter(([, keys]) => keys.length > 0),\n  );\n  if (Object.keys(kept).length > 0) out.aliases = kept;\n\n  if (\n    first.symbolic !== undefined &&\n    second.symbolic !== undefined &&\n    junctionScale === 1 &&\n    Object.keys(renameMap).length === 0\n  ) {\n    const { expr, count } = substitute(second.symbolic, junction.name, first.symbolic);\n    const v = count > 0 ? validate(expr) : undefined;\n    if (v !== undefined && v.ok && v.inferredDimension !== null && equals(v.inferredDimension, second.target.dim)) {\n      out.symbolic = expr;\n    }\n  }\n\n  return out;\n}\n"]}

package/dist/composition/composition-recovery.js.map

@@ -1 +1 @@
-{"version":3,"file":"composition-recovery.js","sourceRoot":"","sources":["../../src/composition/composition-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,wBAAwB,EAAE,MAAM,uBAAuB,CAAC;AAyBlF,SAAS,OAAO,CAAC,IAA6B;IAC5C,OAAO,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAK,GAA0B,aAAa;IAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzF,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,SAAU,CAAC;KAClC,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAA8B,EAAE,CAAC;IAC5C,MAAM,IAAI,GAA6B,EAAE,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBAAE,SAAS;YACrC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,YAAY,wBAAwB;oBAAE,SAAS;gBACxD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACvD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM;oBAAE,SAAS;gBACpC,IAAI,CAAC,IAAI,CAAC;oBACR,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,QAAQ,EAAE,MAAM,CAAC,EAAE;oBACnB,WAAW,EAAE,KAAK,CAAC,EAAE;oBACrB,cAAc,EAAE,UAAU;iBAC3B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAChC,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzB,CAAC"}
+{"version":3,"file":"composition-recovery.js","sourceRoot":"","sources":["../../src/composition/composition-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,wBAAwB,EAAE,MAAM,uBAAuB,CAAC;AAyBlF,SAAS,OAAO,CAAC,IAA6B;IAC5C,OAAO,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAK,GAA0B,aAAa;IAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzF,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,SAAU,CAAC;KAClC,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAA8B,EAAE,CAAC;IAC5C,MAAM,IAAI,GAA6B,EAAE,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBAAE,SAAS;YACrC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,YAAY,wBAAwB;oBAAE,SAAS;gBACxD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACvD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM;oBAAE,SAAS;gBACpC,IAAI,CAAC,IAAI,CAAC;oBACR,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,QAAQ,EAAE,MAAM,CAAC,EAAE;oBACnB,WAAW,EAAE,KAAK,CAAC,EAAE;oBACrB,cAAc,EAAE,UAAU;iBAC3B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAChC,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzB,CAAC","sourcesContent":["/**\n * Composition-derived recovery.\n *\n * Single-bridge linkage asks whether one bridge RHS is a canonical equation.\n * This asks the same question of a chain of two edges that both carry a\n * symbolic form. The comparison is `normalForm`: the same relation up to a\n * dimensionless factor. Dimensionful cancellation is not applied, so an\n * unsimplified chain is not rewritten into a simpler formula.\n *\n * A chain is never `restates-canonical`. That label is the F4 guard on one\n * bridge the registry already names. A chain is a derivation, and a\n * structural match is `recovers`.\n *\n * @module composition/composition-recovery\n * @internal\n */\n\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { composeSymbolic, SymbolicCompositionError } from './compose-symbolic.js';\nimport type { BridgeEdge } from './edge.js';\n\n/** One ordered pair of edges that composed. @internal */\nexport interface CompositionRecoveryPair {\n  readonly firstId: string;\n  readonly secondId: string;\n}\n\n/**\n * A chain whose normal form equals a canonical scalar AST.\n * `classification` is always `recovers`.\n * @internal\n */\nexport interface CompositionRecoveryHit extends CompositionRecoveryPair {\n  readonly canonicalId: string;\n  readonly classification: 'recovers';\n}\n\n/** The chains that were searched, and the ones that matched. @internal */\nexport interface CompositionRecoveryScan {\n  readonly pairs: readonly CompositionRecoveryPair[];\n  readonly hits: readonly CompositionRecoveryHit[];\n}\n\nfunction pairKey(pair: CompositionRecoveryPair): string {\n  return `${pair.firstId}\\0${pair.secondId}`;\n}\n\n/**\n * Search two-edge symbolic chains against the canonical registry.\n *\n * The default edge list is the catalog graph. A caller may pass a shorter\n * list; the canonical side stays the registry. Pairs that cannot compose\n * are not examined. Order is by edge id, then canonical id.\n *\n * @internal\n */\nexport function scanCompositionRecovery(\n  edges: readonly BridgeEdge[] = CATALOG_GRAPH,\n): CompositionRecoveryScan {\n  const symbolic = edges.filter((edge) => edge.symbolic !== undefined);\n  const canons = CANONICAL_EQUATIONS.filter((ce) => ce.scalarAst !== undefined).map((ce) => ({\n    id: ce.id,\n    normal: normalForm(ce.scalarAst!),\n  }));\n\n  const pairs: CompositionRecoveryPair[] = [];\n  const hits: CompositionRecoveryHit[] = [];\n\n  for (const first of symbolic) {\n    for (const second of symbolic) {\n      if (first.id === second.id) continue;\n      let expr;\n      try {\n        expr = composeSymbolic(first, second).expr;\n      } catch (error) {\n        if (error instanceof SymbolicCompositionError) continue;\n        throw error;\n      }\n      pairs.push({ firstId: first.id, secondId: second.id });\n      const form = normalForm(expr);\n      for (const canon of canons) {\n        if (form !== canon.normal) continue;\n        hits.push({\n          firstId: first.id,\n          secondId: second.id,\n          canonicalId: canon.id,\n          classification: 'recovers',\n        });\n      }\n    }\n  }\n\n  pairs.sort((a, b) => (pairKey(a) < pairKey(b) ? -1 : pairKey(a) > pairKey(b) ? 1 : 0));\n  hits.sort((a, b) => {\n    const byPair = pairKey(a) < pairKey(b) ? -1 : pairKey(a) > pairKey(b) ? 1 : 0;\n    if (byPair !== 0) return byPair;\n    return a.canonicalId < b.canonicalId ? -1 : a.canonicalId > b.canonicalId ? 1 : 0;\n  });\n  return { pairs, hits };\n}\n"]}

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

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

package/dist/composition/consequence.js

@@ -48,13 +48,22 @@ export function classifyProposal(proposal, canonical = CANONICAL_EQUATIONS) {
  */
 export function describeDerivedClaim(proposal, canonical = CANONICAL_EQUATIONS) {
     const { identification, sourceEquationIds, solvedFor } = proposal.derivedFrom;
+    // `deriveProposedBridges` resolves the first source id for the smaller
+    // endpoint name and the second for the larger, so each id's target is known
+    // even when the source is a catalog bridge the canonical registry does not
+    // hold (then `canonical.find` is undefined; the sentence once printed
+    // "equals ? (undefined)" there, 9.0.0 audit §7 T1).
+    const [t0, t1] = [identification.a, identification.b].sort();
+    const endpointOf = (id) => (id === sourceEquationIds[0] ? t0 : t1);
     const sources = sourceEquationIds
         .map((id) => canonical.find((e) => e.id === id))
         .filter((e) => e !== undefined);
     const home = sources.find((e) => e.dimensional.governing.some((g) => g.name === solvedFor)) ?? sources[0];
-    const other = sources.find((e) => e !== home);
-    const homeTarget = home?.dimensional.target.name ?? '?';
-    const otherTarget = other?.dimensional.target.name ?? '?';
+    const homeId = home?.id ?? sourceEquationIds[0];
+    const otherId = sourceEquationIds.find((id) => id !== homeId) ?? sourceEquationIds[1];
+    const other = sources.find((e) => e.id === otherId);
+    const homeTarget = home?.dimensional.target.name ?? endpointOf(homeId);
+    const otherTarget = other?.dimensional.target.name ?? endpointOf(otherId);
     const derivedNF = normalForm(proposal.scalarAst);
     const sameTarget = canonical.filter((e) => e.scalarAst && e.dimensional.target.name === proposal.target.name);
     const sameGov = sameTarget.filter((e) => sameGoverning(e.dimensional.governing, proposal.governing));
@@ -65,9 +74,9 @@ export function describeDerivedClaim(proposal, canonical = CANONICAL_EQUATIONS)
         tested: false,
         symbol: {
             name: solvedFor,
-            fromEquation: home?.id ?? sourceEquationIds[0],
-            meaning: `${solvedFor} is the ${solvedFor} of ${home?.id} (${home?.name}): the ${solvedFor} for which ` +
-                `${homeTarget} equals ${otherTarget} (${other?.id}) — an equal-${identification.dim} scale; ` +
+            fromEquation: homeId,
+            meaning: `${solvedFor} is the ${solvedFor} of ${homeId}${home !== undefined ? ` (${home.name})` : ''}: the ${solvedFor} for which ` +
+                `${homeTarget} equals ${otherTarget} (${otherId}) — an equal-${identification.dim} scale; ` +
                 `the ${otherTarget} side is not given a ${solvedFor}`,
         },
         assumptions: sources.map((e) => ({ equation: e.id, assumptions: [...e.assumptions] })),

package/dist/composition/consequence.js.map

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

package/dist/composition/consistency.js.map

@@ -1 +1 @@
-{"version":3,"file":"consistency.js","sourceRoot":"","sources":["../../src/composition/consistency.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAEzC;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,CAAa,EACb,CAAa,EACb,MAA8B;IAE9B,OAAO,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC3D,CAAC"}
+{"version":3,"file":"consistency.js","sourceRoot":"","sources":["../../src/composition/consistency.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAEzC;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,CAAa,EACb,CAAa,EACb,MAA8B;IAE9B,OAAO,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC3D,CAAC","sourcesContent":["/**\n * Composition graph — shared-source consistency relations (v0.8.0\n * CT-2, per docs/planning/v0.8.0-Design.md §2).\n *\n * `consistencyRatio` is a PARALLEL graph operation, honestly distinct\n * from sequential composition: two edges that share source quantities\n * are evaluated on the same inputs and their quotient taken. When the\n * shared quantities cancel algebraically (as G, M, c do between BE-51\n * lensing and BE-52 perihelion precession), the ratio is a\n * parameter-free consistency relation — varying the shared inputs must\n * leave it invariant.\n *\n * @module composition/consistency\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { evaluateEdge } from './edge.js';\n\n/**\n * Domain-checked quotient `a(inputs) / b(inputs)` of two edges sharing\n * source quantities. Throws {@link DomainViolationError} if either\n * edge's validity domain rejects the inputs.\n *\n * @public\n */\nexport function consistencyRatio(\n  a: BridgeEdge,\n  b: BridgeEdge,\n  inputs: Record<string, number>,\n): number {\n  return evaluateEdge(a, inputs) / evaluateEdge(b, inputs);\n}\n"]}

package/dist/composition/descriptor.d.ts

@@ -25,7 +25,7 @@ import type { BridgeEdge } from './edge.js';
 import type { ExprNode } from '../dimensional/validator.js';
 /** One bridge, joined across the catalog's three id-keyed registries. */
 interface BridgeDescriptor {
-    /** Catalog id (11–54). */
+    /** Catalog id (the range is the catalog's; NOTES.md records it). */
     readonly id: number;
     /** Catalog metadata (from `BRIDGE_EQUATIONS`). */
     readonly entry: BridgeEquationEntry;

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

@@ -1 +1 @@
-{"version":3,"file":"descriptor.d.ts","sourceRoot":"","sources":["../../src/composition/descriptor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EAAoB,KAAK,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAGjF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,yEAAyE;AACzE,UAAU,gBAAgB;IACxB,0BAA0B;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,kDAAkD;IAClD,QAAQ,CAAC,KAAK,EAAE,mBAAmB,CAAC;IACpC,iFAAiF;IACjF,QAAQ,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,CAAC;IACnC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;CACvC;AAsBD;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAe,CAAC;AAErF;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,gBAAgB,CASrE"}
+{"version":3,"file":"descriptor.d.ts","sourceRoot":"","sources":["../../src/composition/descriptor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EAAoB,KAAK,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAGjF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAE5D,yEAAyE;AACzE,UAAU,gBAAgB;IACxB,oEAAoE;IACpE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,kDAAkD;IAClD,QAAQ,CAAC,KAAK,EAAE,mBAAmB,CAAC;IACpC,iFAAiF;IACjF,QAAQ,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,CAAC;IACnC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;CACvC;AAsBD;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAe,CAAC;AAErF;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,gBAAgB,CASrE"}

package/dist/composition/descriptor.js.map

@@ -1 +1 @@
-{"version":3,"file":"descriptor.js","sourceRoot":"","sources":["../../src/composition/descriptor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EAAE,gBAAgB,EAA4B,MAAM,qBAAqB,CAAC;AACjF,OAAO,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC7E,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAoBnD,MAAM,WAAW,GAA0C,CAAC,GAAG,EAAE;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAClB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;YACd,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,KAAK;YACL,GAAG,EAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE;SACrC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC,EAAE,CAAC;AAEL;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAA0C,WAAW,CAAC;AAErF;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,QAAyB;IACjD,MAAM,EAAE,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACnC,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,MAAM,IAAI,UAAU,CAClB,2CAA2C,EAAE,QAAQ,EAAE,IAAI,CAC5D,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}
+{"version":3,"file":"descriptor.js","sourceRoot":"","sources":["../../src/composition/descriptor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EAAE,gBAAgB,EAA4B,MAAM,qBAAqB,CAAC;AACjF,OAAO,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC7E,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAoBnD,MAAM,WAAW,GAA0C,CAAC,GAAG,EAAE;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAClB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;YACd,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,KAAK;YACL,GAAG,EAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE;SACrC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC,EAAE,CAAC;AAEL;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAA0C,WAAW,CAAC;AAErF;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,QAAyB;IACjD,MAAM,EAAE,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACnC,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpB,MAAM,IAAI,UAAU,CAClB,2CAA2C,EAAE,QAAQ,EAAE,IAAI,CAC5D,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC","sourcesContent":["/**\n * Unified per-bridge descriptor — one lookup that JOINS the catalog's three\n * id-keyed registries so a consumer reads a single object instead of\n * cross-referencing three hand-maintained sources:\n *\n *   1. `BRIDGE_EQUATIONS`   — catalog metadata (status, refs, signature, …)\n *   2. `BRIDGE_RHS_BY_ID`   — faithful right-hand-side AST (where encoded)\n *   3. `CATALOG_GRAPH`      — composition-graph edge(s) keyed by `beId`\n *\n * This is a DERIVED facade, not a fourth source of truth: every field still\n * lives in its home registry. The point is anti-drift — the failure mode behind\n * the stale `DATA_CONFRONTED = {23,36}` set and the `6.075e-12` value was the\n * registries silently disagreeing. They are now (a) reachable through one\n * accessor and (b) cross-checked by one guard\n * (`tests/bridges/descriptor-consistency.test.ts`), so a future id that exists\n * in one registry but not another fails loudly instead of drifting.\n *\n * The join lives here, beside `catalog-graph.ts`, because `composition/` owns\n * the graph and already imports `bridges/`. `bridges/` does not import it back.\n *\n * @module composition/descriptor\n */\nimport { BRIDGE_EQUATIONS, type BridgeEquationEntry } from '../bridges/index.js';\nimport { BRIDGE_RHS_BY_ID, parseBridgeId } from '../bridges/rhs-registry.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport type { BridgeEdge } from './edge.js';\nimport type { ExprNode } from '../dimensional/validator.js';\n\n/** One bridge, joined across the catalog's three id-keyed registries. */\ninterface BridgeDescriptor {\n  /** Catalog id (the range is the catalog's; NOTES.md records it). */\n  readonly id: number;\n  /** Catalog metadata (from `BRIDGE_EQUATIONS`). */\n  readonly entry: BridgeEquationEntry;\n  /** Faithful RHS AST (from `BRIDGE_RHS_BY_ID`), or `undefined` if not encoded. */\n  readonly rhs: ExprNode | undefined;\n  /**\n   * Composition-graph edges carrying this `beId` (from `CATALOG_GRAPH`).\n   * Usually one; a few bridges have several (e.g. BE-42 + BE-42-via-rs).\n   * Empty when the bridge has no graph edge.\n   */\n  readonly edges: readonly BridgeEdge[];\n}\n\nconst DESCRIPTORS: ReadonlyMap<number, BridgeDescriptor> = (() => {\n  const edgesById = new Map<number, BridgeEdge[]>();\n  for (const e of CATALOG_GRAPH) {\n    if (e.beId === null) continue;\n    const list = edgesById.get(e.beId);\n    if (list) list.push(e);\n    else edgesById.set(e.beId, [e]);\n  }\n  const m = new Map<number, BridgeDescriptor>();\n  for (const entry of BRIDGE_EQUATIONS) {\n    m.set(entry.id, {\n      id: entry.id,\n      entry,\n      rhs: BRIDGE_RHS_BY_ID.get(entry.id),\n      edges: edgesById.get(entry.id) ?? [],\n    });\n  }\n  return m;\n})();\n\n/**\n * Every bridge descriptor, keyed by catalog id. The single joined view of the\n * three registries.\n *\n * @internal\n */\nexport const BRIDGE_DESCRIPTORS: ReadonlyMap<number, BridgeDescriptor> = DESCRIPTORS;\n\n/**\n * Look up one bridge by id (a number, `'42'`, or `'BE-42'` — case-insensitive).\n * Returns the joined descriptor (metadata + RHS + edges). Throws if the id is\n * unparseable or not catalogued.\n *\n * @internal\n */\nexport function getBridge(bridgeId: number | string): BridgeDescriptor {\n  const id = parseBridgeId(bridgeId);\n  const d = DESCRIPTORS.get(id);\n  if (d === undefined) {\n    throw new RangeError(\n      `getBridge: no catalogued bridge with id ${id} (BE-${id}).`,\n    );\n  }\n  return d;\n}\n"]}

package/dist/composition/dimension-adjacency.js.map

@@ -1 +1 @@
-{"version":3,"file":"dimension-adjacency.js","sourceRoot":"","sources":["../../src/composition/dimension-adjacency.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAY3D;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,UAAwE,EACxE,aAA6C;IAE7C,MAAM,UAAU,GAAG,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA8B,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAS,CAAC,2BAA2B;QACvF,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,SAAS,CAAC,uCAAuC;QACnF,MAAM,UAAU,GAAG,UAAU;aAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;aACnC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACf,IAAI,EAAE,CAAC;QACV,IAAI,UAAU,CAAC,MAAM;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxE,CAAC"}
+{"version":3,"file":"dimension-adjacency.js","sourceRoot":"","sources":["../../src/composition/dimension-adjacency.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAY3D;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,UAAwE,EACxE,aAA6C;IAE7C,MAAM,UAAU,GAAG,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA8B,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAS,CAAC,2BAA2B;QACvF,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,SAAS,CAAC,uCAAuC;QACnF,MAAM,UAAU,GAAG,UAAU;aAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;aACnC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACf,IAAI,EAAE,CAAC;QACV,IAAI,UAAU,CAAC,MAAM;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxE,CAAC","sourcesContent":["/**\n * Dimension-adjacency — a review surface for quantities that are absent from a\n * reference vocabulary BY NAME but match a reference quantity BY DIMENSION.\n *\n * Name-based graph linkage misses connections hidden by a name divergence (e.g.\n * the catalog's `thermal-de-broglie-wavelength` vs the canonical L-layer's\n * `thermal-wavelength` — the same physical quantity). This sweep surfaces such\n * candidates so a reviewer can spot true aliases and registry gaps.\n *\n * It is strictly a **review surface, never an auto-merge**: same dimension does\n * NOT imply same quantity (`effective-mass` ≠ `mass`, every dimensionless\n * coupling shares `[dimensionless]`), so dimensionless quantities are excluded\n * and the output is for human adjudication only.\n *\n * @module composition/dimension-adjacency\n */\n\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals, format } from '../dimensional/algebra.js';\n\n/** A name-divergent quantity and the reference quantities it dimension-matches. */\nexport interface DimensionAdjacency {\n  /** The quantity name (absent from the reference vocabulary). */\n  readonly name: string;\n  /** Its formatted dimension. */\n  readonly dim: string;\n  /** Reference quantities of the SAME dimension — candidates for review. */\n  readonly candidates: readonly string[];\n}\n\n/**\n * For every distinct quantity whose `name` is absent from `referenceDims` but\n * whose `dim` matches ≥1 reference quantity (dimensionless excluded), list the\n * same-dimension reference candidates. Sorted by quantity name; candidates\n * sorted. A review surface — same dimension ≠ same quantity.\n *\n * @public\n */\nexport function dimensionAdjacency(\n  quantities: Iterable<{ readonly name: string; readonly dim: Dimension }>,\n  referenceDims: ReadonlyMap<string, Dimension>,\n): DimensionAdjacency[] {\n  const refEntries = [...referenceDims.entries()];\n  const out = new Map<string, DimensionAdjacency>();\n  for (const q of quantities) {\n    if (out.has(q.name) || referenceDims.has(q.name)) continue; // dedupe + name-match skip\n    if (equals(q.dim, DIMENSIONLESS)) continue; // too generic to be a useful candidate\n    const candidates = refEntries\n      .filter(([, d]) => equals(d, q.dim))\n      .map(([n]) => n)\n      .sort();\n    if (candidates.length) out.set(q.name, { name: q.name, dim: format(q.dim), candidates });\n  }\n  return [...out.values()].sort((a, b) => a.name.localeCompare(b.name));\n}\n"]}

package/dist/composition/discovery.d.ts

@@ -3,7 +3,8 @@
  * (Direction 2).
  *
  * `proposeLinkCandidates` surfaces cross-cluster quantity pairs that share a
- * dimension (132 → 36 → ~3) and hands the raw coincidences to a human. This
+ * dimension and hands the raw coincidences to a human (the counts at a given
+ * catalog are measured by the tests and recorded in NOTES.md). This
  * module closes the loop: it HYPOTHESIZES each candidate identification
  * `a ≡ b` and tests it with the machinery that already exists —
  *
@@ -61,13 +62,16 @@ export interface VettedCandidate {
      */
     readonly unlocksFromAnchor: readonly string[];
     /**
-     * Retrodiction over the graph WITH the hypothesized identification stays
-     * all-consistent (introduces no numerical contradiction in the
-     * anchor-reachable subgraph). The strong filter.
+     * Retrodiction over the graph WITH the hypothesized identification creates
+     * no numerical contradiction in the anchor-reachable subgraph. The strong
+     * filter. A node whose routes already disagree in the base graph is the
+     * graph's finding (`retrodict` reports it) and does not make a candidate
+     * inconsistent; only a disagreement the hypothesis CREATES does.
      */
     readonly numericallyConsistent: boolean;
-    /** Nodes that became inconsistent under the identification (the
-     *  falsification, when `numericallyConsistent` is false). Sorted. */
+    /** Nodes that became inconsistent under the identification and were not
+     *  inconsistent in the base graph (the falsification, when
+     *  `numericallyConsistent` is false). Sorted. */
     readonly inconsistentNodes: readonly string[];
     /**
      * Orders of magnitude between the representative values of a and b
@@ -171,7 +175,7 @@ export interface DiscoveryOptions {
     readonly identifications?: readonly QuantityIdentification[];
     /**
      * Max orders of magnitude two identified quantities may differ before the
-     * identification is falsified as a `magnitude-clash`. Default 3 — generous
+     * identification is falsified as a `magnitude-clash`. Default {@link DEFAULT_MAX_ORDERS_OF_MAGNITUDE} — generous
      * enough for O(1) dimensionless prefactors and unit-convention slack, strict
      * enough to kill the scale-clash decoys.
      */
@@ -196,6 +200,12 @@ export interface DiscoveryOptions {
  * @internal
  */
 export declare const ANCHOR_DEFAULT: Readonly<Record<string, number>>;
+/**
+ * The magnitude-clash threshold when the caller gives none: how many orders of magnitude two
+ * identified quantities may differ. Exported so the CLI states the default it runs with.
+ * @internal
+ */
+export declare const DEFAULT_MAX_ORDERS_OF_MAGNITUDE = 3;
 /**
  * Candidate-invariant state for the discovery funnel — everything in
  * `vetLinkCandidate` that depends only on `(edges, opts)`, not on the specific
@@ -227,11 +237,11 @@ export interface DiscoveryContext {
     /** `forwardClosure(edges, anchor, baseIdents)` — base determinable set. */
     readonly closureBase: ReadonlySet<string>;
     /**
-     * Retrodiction of the anchor with no hypothesized identification.
-     * An identification of two quantities outside {@link closureBase} cannot
-     * fire, so that candidate's numeric report is this one.
+     * The targets the retrodiction of the anchor finds inconsistent with no
+     * hypothesized identification (empty when the base is consistent). An
+     * identification of two quantities outside {@link closureBase} cannot fire,
+     * so that candidate's numeric report is this one.
      */
-    readonly baseNumericallyConsistent: boolean;
     readonly baseInconsistentNodes: readonly string[];
 }
 /** Resolve options and compute the candidate-invariant discovery state once.

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

@@ -1 +1 @@
-{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAG1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAYtE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;yEACqE;IACrE,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IAC7F,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AAkCD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AA+BnF;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;OAIG;IACH,QAAQ,CAAC,yBAAyB,EAAE,OAAO,CAAC;IAC5C,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CA8BlB;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CA6MjB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAmBnB"}
+{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAG1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAYtE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IAC7F,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AAkCD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CA6BlB;AA8DD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CA+MjB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAmBnB"}

package/dist/composition/discovery.js

@@ -3,7 +3,8 @@
  * (Direction 2).
  *
  * `proposeLinkCandidates` surfaces cross-cluster quantity pairs that share a
- * dimension (132 → 36 → ~3) and hands the raw coincidences to a human. This
+ * dimension and hands the raw coincidences to a human (the counts at a given
+ * catalog are measured by the tests and recorded in NOTES.md). This
  * module closes the loop: it HYPOTHESIZES each candidate identification
  * `a ≡ b` and tests it with the machinery that already exists —
  *
@@ -34,8 +35,8 @@
  */
 import { QUANTITY_IDENTIFICATIONS, effectiveAttributes } from './compose.js';
 import { GATE_AXES } from './axes.js';
-import { forwardClosure } from './identifiability.js';
-import { retrodict, forwardEvaluate } from './retrodiction.js';
+import { classifyIdentifiability, forwardClosure } from './identifiability.js';
+import { retrodict, retrodictNode, forwardEvaluate } from './retrodiction.js';
 import { proposeLinkCandidates } from './bridge-analysis.js';
 import { M_SUN_KG } from '../core/constants.js';
 import { REPRESENTATIVE_VALUES } from './representative-values.js';
@@ -118,6 +119,12 @@ function quantityComponents(edges, idents) {
  * @internal
  */
 export const ANCHOR_DEFAULT = { mass: M_SUN_KG };
+/**
+ * The magnitude-clash threshold when the caller gives none: how many orders of magnitude two
+ * identified quantities may differ. Exported so the CLI states the default it runs with.
+ * @internal
+ */
+export const DEFAULT_MAX_ORDERS_OF_MAGNITUDE = 3;
 /**
  * Factor every anchor input is multiplied by to probe whether a magnitude ratio
  * depends on the anchor at all (persona finding L3). Three decades moves any
@@ -159,7 +166,7 @@ export function buildDiscoveryContext(edges, opts) {
         groundTruth,
         anchor,
         repVals: opts.representativeValues ?? REPRESENTATIVE_VALUES,
-        maxOrders: opts.maxOrdersOfMagnitude ?? 3,
+        maxOrders: opts.maxOrdersOfMagnitude ?? DEFAULT_MAX_ORDERS_OF_MAGNITUDE,
         attributesByName: opts.quantityAttributes ?? REGISTRY_ATTRIBUTES_BY_NAME,
         // Candidate-invariant: the anchor's forward evaluation, the base component
         // partition, and the base forward closure all depend only on (edges, opts).
@@ -167,13 +174,63 @@ export function buildDiscoveryContext(edges, opts) {
         anchorValuesProbe: forwardEvaluate(edges, Object.fromEntries(Object.entries(groundTruth).map(([k, v]) => [k, v * ANCHOR_PROBE_FACTOR])), baseIdents),
         comps: quantityComponents(edges, baseIdents),
         closureBase: forwardClosure(edges, anchor, baseIdents),
-        baseNumericallyConsistent: baseReport.allConsistent,
         baseInconsistentNodes: baseReport.results
             .filter((r) => r.outcome === 'inconsistent')
             .map((r) => r.target)
             .sort(),
     };
 }
+/**
+ * The quantities whose value can depend on one of `seeds`: the seeds, every
+ * `to` of an identification from the set, and every target of an edge with a
+ * source in the set, to a fixed point. An over-approximation (an edge that
+ * does not fire still lists its target), which is the safe side: a target
+ * left out would keep its base retrodiction unexamined.
+ */
+function dependents(edges, seeds, idents) {
+    const set = new Set(seeds);
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const id of idents) {
+            if (set.has(id.from) && !set.has(id.to)) {
+                set.add(id.to);
+                changed = true;
+            }
+        }
+        for (const e of edges) {
+            if (set.has(e.target.name))
+                continue;
+            if (e.sources.some((s) => set.has(s.name))) {
+                set.add(e.target.name);
+                changed = true;
+            }
+        }
+    }
+    return set;
+}
+/**
+ * The nodes the hypothesis `a ≡ b` makes inconsistent that the base graph did
+ * not already have: inconsistent(hypothesis) minus inconsistent(base). Only a
+ * node downstream of `a` or `b` can change, so only those nodes are
+ * classified and retrodicted, with the same over-determined rule and the
+ * same tolerance `retrodict` applies to the whole graph. Sorted.
+ */
+function newInconsistencies(edges, groundTruth, anchor, candidate, withHyp, baseInconsistentNodes) {
+    const base = new Set(baseInconsistentNodes);
+    const nodes = [];
+    for (const target of [...dependents(edges, [candidate.a, candidate.b], withHyp)].sort()) {
+        if (base.has(target))
+            continue;
+        const classified = classifyIdentifiability(edges, anchor, target, { identifications: withHyp });
+        if (classified.verdict !== 'over-determined')
+            continue;
+        const result = retrodictNode(edges, groundTruth, target, { identifications: withHyp });
+        if (result.outcome === 'inconsistent')
+            nodes.push(target);
+    }
+    return nodes;
+}
 /**
  * Vet one link candidate by hypothesizing the identification a≡b and
  * measuring its structural and numerical consequences. See module docs.
@@ -192,7 +249,7 @@ export function vetLinkCandidate(edges, candidate, opts = {}) {
  * @internal
  */
 export function vetInContext(edges, candidate, ctx) {
-    const { baseIdents, groundTruth, anchor, repVals, maxOrders, anchorValues, anchorValuesProbe, comps, closureBase, attributesByName, baseNumericallyConsistent, baseInconsistentNodes, } = ctx;
+    const { baseIdents, groundTruth, anchor, repVals, maxOrders, anchorValues, anchorValuesProbe, comps, closureBase, attributesByName, baseInconsistentNodes, } = ctx;
     // Magnitude gate: an INDEPENDENT falsifier the single-anchor graph can't make.
     // Only fires when both endpoints have a representative value; abstains (and
     // never false-rejects) otherwise. A value comes from the sourced static table
@@ -288,26 +345,29 @@ export function vetInContext(edges, candidate, ctx) {
     const mergesComponents = comps.has(candidate.a) &&
         comps.has(candidate.b) &&
         comps.get(candidate.a) !== comps.get(candidate.b);
+    // Neither endpoint in the anchor closure means the identification cannot
+    // fire: `forwardClosure` copies a value across `a ≡ b` only from a
+    // determinable side. The hypothesis closure is then the base closure, and no
+    // value in the graph moves, so neither closure nor retrodiction is recomputed
+    // (9.0.0 audit §4 C9: 4004 of 4196 catalog candidates are this case).
+    const touchesClosure = closureBase.has(candidate.a) || closureBase.has(candidate.b);
     // Closure unlock: forward closure from the anchor, with vs without. The base
     // closure is candidate-invariant (ctx); only the hypothesis closure is fresh.
-    const closureHyp = forwardClosure(edges, anchor, withHyp);
+    const closureHyp = touchesClosure ? forwardClosure(edges, anchor, withHyp) : closureBase;
     const unlocksFromAnchor = [...closureHyp]
         .filter((q) => !closureBase.has(q))
         .sort();
-    // Numeric: retrodiction must stay all-consistent under the hypothesis.
-    // Neither endpoint in the anchor closure means the identification cannot
-    // fire, so the report is the base one. A copy, because a caller may sort it.
-    const touchesClosure = closureBase.has(candidate.a) || closureBase.has(candidate.b);
-    const report = touchesClosure
-        ? retrodict(edges, groundTruth, { identifications: withHyp })
-        : undefined;
-    const numericallyConsistent = report === undefined ? baseNumericallyConsistent : report.allConsistent;
-    const inconsistentNodes = report === undefined
-        ? [...baseInconsistentNodes]
-        : report.results
-            .filter((r) => r.outcome === 'inconsistent')
-            .map((r) => r.target)
-            .sort();
+    // Numeric: the hypothesis must not CREATE a disagreement. A node whose
+    // routes already disagree in the base graph is the graph's finding
+    // (`retrodict` reports it), not this candidate's, so the attribution is
+    // inconsistent(hypothesis) minus inconsistent(base) (9.0.0 audit §4 C4).
+    // Only a target downstream of `a` or `b` can change under the hypothesis;
+    // every other target's retrodiction is the base one, so only those targets
+    // are retrodicted (§4 C9).
+    const inconsistentNodes = touchesClosure
+        ? newInconsistencies(edges, groundTruth, anchor, candidate, withHyp, baseInconsistentNodes)
+        : [];
+    const numericallyConsistent = inconsistentNodes.length === 0;
     // Verdict precedence: a magnitude clash is the most decisive, most
     // interpretable falsification, checked before the graph contradiction;
     // the regime-label prior (axis-clash) is weaker than both numeric