universal-physics-tensor 9.0.0 → 10.0.0

package/dist/atlas/benchmark/stats.js.map

@@ -1 +1 @@
-{"version":3,"file":"stats.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/stats.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,mDAAmD;AACnD,MAAM,CAAC,MAAM,GAAG,GAAG,iBAAiB,CAAC;AAQrC;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,SAAiB,EAAE,CAAS,EAAE,CAAC,GAAG,GAAG;IAClE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,EAAE,CAAC,CAAC;IAC9G,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,KAAK,CAAC,+DAA+D,SAAS,EAAE,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,8EAA8E;IAC9E,wEAAwE;IACxE,OAAO;QACL,KAAK,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACvD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KACxD,CAAC;AACJ,CAAC;AAkBD,yDAAyD;AACzD,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,KAAkB;IACxC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACjD,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9D,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AACvD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAkB,EAAE,CAAC,GAAG,GAAG;IAClE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC;IAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACtE,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,oEAAoE;QACpE,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACjE,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;IACrB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;IAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;IAC1B,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;IAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IACzF,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IACzF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;AACzE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,MAAsC;IAChE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IAC3H,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;YACzB,CAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC;YACd,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC;YACd,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACxD,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;IAClE,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAChC,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC9B,CAAC;AAaD;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,eAAe,GAAG,GAAG;IAClE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,SAAS,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9D,OAAO;QACL,SAAS;QACT,eAAe;QACf,QAAQ;QACR,SAAS;QACT,SAAS,EACP,QAAQ,SAAS,uBAAuB,GAAG,CAAC,eAAe,CAAC,qCAAqC;YACjG,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,SAAS,CAAC,uBAAuB;YAC9F,wCAAwC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,mCAAmC;YAC7F,sEAAsE;KACzE,CAAC;AACJ,CAAC"}
+{"version":3,"file":"stats.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/stats.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,mDAAmD;AACnD,MAAM,CAAC,MAAM,GAAG,GAAG,iBAAiB,CAAC;AAQrC;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,SAAiB,EAAE,CAAS,EAAE,CAAC,GAAG,GAAG;IAClE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,EAAE,CAAC,CAAC;IAC9G,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,KAAK,CAAC,+DAA+D,SAAS,EAAE,CAAC,CAAC;IAC9F,CAAC;IACD,MAAM,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3E,8EAA8E;IAC9E,wEAAwE;IACxE,OAAO;QACL,KAAK,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACvD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KACxD,CAAC;AACJ,CAAC;AAkBD,yDAAyD;AACzD,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACrC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,KAAkB;IACxC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACjD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AACvD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAkB,EAAE,CAAC,GAAG,GAAG;IAClE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC;IAC7B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACtE,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,oEAAoE;QACpE,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACjE,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;IACrB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;IAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;IAC1B,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC;IAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IACzF,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IACzF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;AACzE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,MAAsC;IAChE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IAC3H,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC;YACzB,CAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC;YACd,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC;YACd,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACxD,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;IAClE,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC;IAChC,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC9B,CAAC;AAaD;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,eAAe,GAAG,GAAG;IAClE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,SAAS,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9D,OAAO;QACL,SAAS;QACT,eAAe;QACf,QAAQ;QACR,SAAS;QACT,SAAS,EACP,QAAQ,SAAS,uBAAuB,GAAG,CAAC,eAAe,CAAC,qCAAqC;YACjG,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,SAAS,CAAC,uBAAuB;YAC9F,wCAAwC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,mCAAmC;YAC7F,sEAAsE;KACzE,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Atlas Phase 5, S5.4 — the benchmark's statistics and power report.\n *\n * Design note: `docs/planning/Atlas-Phase-5-Design.md` §8.\n *\n * Every function here is tested against a value computed independently, not\n * against its own output: the Wilson intervals against the plan's textbook\n * values, McNemar against a hand-computed 2×2 table, and κ against a hand-computed\n * confusion matrix. The paired-difference interval (Newcombe's method 10) has no\n * textbook value in the repository; it is tested by properties that pin it to\n * Wilson and to the unpaired square-and-add interval where those must agree.\n *\n * @module atlas/benchmark/stats\n * @internal\n */\n\n/** The two-sided 95% normal quantile. @internal */\nexport const Z95 = 1.959963984540054;\n\n/** A closed interval. @internal */\nexport interface Interval {\n  readonly lower: number;\n  readonly upper: number;\n}\n\n/**\n * Wilson score interval for a binomial proportion.\n *\n * @throws Error when `n` is not a positive integer or `successes` is outside `[0, n]`.\n * @internal\n */\nexport function wilsonInterval(successes: number, n: number, z = Z95): Interval {\n  if (!Number.isInteger(n) || n <= 0) throw new Error(`wilsonInterval: n must be a positive integer, got ${n}`);\n  if (!Number.isInteger(successes) || successes < 0 || successes > n) {\n    throw new Error(`wilsonInterval: successes must be an integer in [0, n], got ${successes}`);\n  }\n  const p = successes / n;\n  const z2 = z * z;\n  const denom = 1 + z2 / n;\n  const centre = (p + z2 / (2 * n)) / denom;\n  const half = (z / denom) * Math.sqrt((p * (1 - p)) / n + z2 / (4 * n * n));\n  // At x = 0 the lower bound, and at x = n the upper bound, are EXACTLY 0 and 1\n  // analytically; the formula reaches them only to within float rounding.\n  return {\n    lower: successes === 0 ? 0 : Math.max(0, centre - half),\n    upper: successes === n ? 1 : Math.min(1, centre + half),\n  };\n}\n\n/** A paired 2×2 table: a = both right, b = only A right, c = only B right, d = both wrong. @internal */\nexport interface PairedTable {\n  readonly a: number;\n  readonly b: number;\n  readonly c: number;\n  readonly d: number;\n}\n\n/** McNemar's test on the discordant cells. @internal */\nexport interface McNemarResult {\n  /** Continuity-corrected χ² = max(0, |b − c| − 1)² / (b + c); 0 when b + c = 0. The correction never goes negative (Edwards 1948). */\n  readonly chiSquared: number;\n  /** Exact two-sided p-value from Binomial(b + c, ½); 1 when b + c = 0. */\n  readonly exactP: number;\n}\n\n/** `ln C(n, k)`, summed; exact enough for the n here. */\nfunction logChoose(n: number, k: number): number {\n  let s = 0;\n  for (let i = 1; i <= k; i++) s += Math.log(n - k + i) - Math.log(i);\n  return s;\n}\n\n/**\n * McNemar's paired test. The EXACT binomial p-value is the one to report at\n * these sample sizes; the χ² is given because readers expect it.\n *\n * @internal\n */\nexport function mcnemar(table: PairedTable): McNemarResult {\n  const n = table.b + table.c;\n  if (n === 0) return { chiSquared: 0, exactP: 1 };\n  const chiSquared = Math.max(0, Math.abs(table.b - table.c) - 1) ** 2 / n;\n  const k = Math.min(table.b, table.c);\n  let tail = 0;\n  for (let i = 0; i <= k; i++) tail += Math.exp(logChoose(n, i) - n * Math.LN2);\n  return { chiSquared, exactP: Math.min(1, 2 * tail) };\n}\n\n/**\n * Newcombe's method 10: a 95% interval for the PAIRED difference in proportions\n * p_A − p_B = (b − c)/n, built from the two marginal Wilson intervals and a\n * correlation correction φ. Pre-registered criterion: the interval for the\n * atlas-minus-baseline difference must exclude zero.\n *\n * Newcombe, Statistics in Medicine 17 (1998) 2635.\n *\n * @internal\n */\nexport function pairedDifferenceInterval(table: PairedTable, z = Z95): Interval & { readonly diff: number } {\n  const { a, b, c, d } = table;\n  const n = a + b + c + d;\n  if (n === 0) throw new Error('pairedDifferenceInterval: empty table');\n  const p1 = (a + b) / n;\n  const p2 = (a + c) / n;\n  const w1 = wilsonInterval(a + b, n, z);\n  const w2 = wilsonInterval(a + c, n, z);\n  const denom = Math.sqrt((a + b) * (c + d) * (a + c) * (b + d));\n  let phi = 0;\n  if (denom > 0) {\n    const cross = a * d - b * c;\n    // Newcombe's continuity adjustment of φ, applied only when ad > bc.\n    phi = (cross > 0 ? Math.max(cross - n / 2, 0) : cross) / denom;\n  }\n  const diff = p1 - p2;\n  const dl1 = p1 - w1.lower;\n  const du1 = w1.upper - p1;\n  const dl2 = p2 - w2.lower;\n  const du2 = w2.upper - p2;\n  const lower = diff - Math.sqrt(Math.max(0, dl1 * dl1 - 2 * phi * dl1 * du2 + du2 * du2));\n  const upper = diff + Math.sqrt(Math.max(0, du1 * du1 - 2 * phi * du1 * dl2 + dl2 * dl2));\n  return { diff, lower: Math.max(-1, lower), upper: Math.min(1, upper) };\n}\n\n/**\n * Cohen's κ for two raters over the same items, from a square confusion matrix\n * (`matrix[i][j]` = items rater 1 put in category i and rater 2 in category j).\n *\n * @returns NaN when chance agreement is 1 (κ is undefined there), never 1.\n * @internal\n */\nexport function cohensKappa(matrix: readonly (readonly number[])[]): number {\n  const k = matrix.length;\n  if (k === 0 || matrix.some((row) => row.length !== k)) throw new Error('cohensKappa: matrix must be square and non-empty');\n  let n = 0;\n  let agree = 0;\n  const rows = new Array<number>(k).fill(0);\n  const cols = new Array<number>(k).fill(0);\n  for (let i = 0; i < k; i++) {\n    for (let j = 0; j < k; j++) {\n      const v = matrix[i]![j]!;\n      n += v;\n      rows[i]! += v;\n      cols[j]! += v;\n      if (i === j) agree += v;\n    }\n  }\n  if (n === 0) throw new Error('cohensKappa: no ratings');\n  const po = agree / n;\n  let pe = 0;\n  for (let i = 0; i < k; i++) pe += (rows[i]! / n) * (cols[i]! / n);\n  if (pe === 1) return Number.NaN;\n  return (po - pe) / (1 - pe);\n}\n\n/** What a frozen set of a given size can and cannot resolve. @internal */\nexport interface PowerReport {\n  readonly nPerClass: number;\n  /** The assumed per-class accuracy the interval is computed at. */\n  readonly assumedAccuracy: number;\n  readonly interval: Interval;\n  /** Half the interval width: differences smaller than about twice this are not resolvable. */\n  readonly halfWidth: number;\n  readonly statement: string;\n}\n\n/**\n * The interval a frozen set of `nPerClass` items per class can afford at an\n * assumed accuracy. This is the \"report the interval it can afford rather than\n * the claim it cannot\" line of ROADMAP Phase 5.\n *\n * @internal\n */\nexport function powerReport(nPerClass: number, assumedAccuracy = 0.8): PowerReport {\n  const successes = Math.round(assumedAccuracy * nPerClass);\n  const interval = wilsonInterval(successes, nPerClass);\n  const halfWidth = (interval.upper - interval.lower) / 2;\n  const pct = (x: number): string => `${(100 * x).toFixed(1)}%`;\n  return {\n    nPerClass,\n    assumedAccuracy,\n    interval,\n    halfWidth,\n    statement:\n      `With ${nPerClass} items per class at ${pct(assumedAccuracy)} accuracy, the 95% Wilson interval ` +\n      `is [${pct(interval.lower)}, ${pct(interval.upper)}] (±${pct(halfWidth)}). Two methods whose ` +\n      `accuracies differ by less than about ${pct(2 * halfWidth)} cannot be separated on this set ` +\n      'by unpaired intervals; the paired McNemar design is what narrows it.',\n  };\n}\n"]}

package/dist/atlas/benchmark/study.js.map

@@ -1 +1 @@
-{"version":3,"file":"study.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/study.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAwB/E,MAAM,cAAc,GAAG,IAAI,GAAG,CAAS,aAAa,CAAC,CAAC;AAEtD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAAC,OAA0B,EAAE,MAA4B;IACrF,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,OAAe,EAAQ,EAAE;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;QAC7C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS;gBAAE,CAAC,CAAC,4CAA4C,CAAC,CAAC;iBAC5E,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;gBAAE,CAAC,CAAC,wBAAwB,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;QAC3F,CAAC;aAAM,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACvC,CAAC,CAAC,4CAA4C,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,OAAO;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;IACxF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAwBD;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,SAAiB,EACjB,OAAmC,EACnC,MAA4B;IAE5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,kBAAkB,SAAS,0DAA0D,CAAC,CAAC;IACzG,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,SAAS,8BAA8B,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACpH,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,MAAM,KAAK,SAAS;YAAE,UAAU,EAAE,CAAC;aAClC,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;YAAE,WAAW,EAAE,CAAC;QACrD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,MAAM,EAAE,CAAC;YACT,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ;gBAAE,aAAa,EAAE,CAAC;YAClD,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ;gBAAE,YAAY,EAAE,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,QAAQ,EAAE,CAAC;YACX,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ;gBAAE,YAAY,EAAE,CAAC;YACjD,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACjC,eAAe,EAAE,CAAC;gBAClB,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS,IAAI,MAAM,CAAC,eAAe,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC;oBACzF,kBAAkB,EAAE,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO;QACL,SAAS;QACT,MAAM;QACN,QAAQ;QACR,eAAe;QACf,wBAAwB,EACtB,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,eAAe,EAAE,QAAQ,CAAC;QACvG,kBAAkB;QAClB,YAAY;QACZ,aAAa;QACb,YAAY;QACZ,WAAW;QACX,UAAU;KACX,CAAC;AACJ,CAAC;AAaD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAkB,EAClB,QAAoC,EACpC,UAAkB,EAClB,QAAoC,EACpC,MAA4B;IAE5B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IAC3D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;IAC7F,MAAM,UAAU,GAAG,CAAC,OAAmC,EAAe,EAAE,CACtE,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9E,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;aACX,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;aACX,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;;YACX,CAAC,EAAE,CAAC;IACX,CAAC;IACD,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IACnD,OAAO;QACL,UAAU;QACV,UAAU;QACV,KAAK;QACL,UAAU;QACV,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC;QACvB,oBAAoB,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;KAC3C,CAAC;AACJ,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,IAAkE,EAClE,MAA4B;IAE5B,MAAM,IAAI,GAAkB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACjC,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;aACpD,CAAC;YACJ,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC;gBACR,aAAa,EAAE,IAAI;gBACnB,OAAO;gBACP,gBAAgB,EAAE,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,CAAC;aAChF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}
+{"version":3,"file":"study.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/study.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAwB/E,MAAM,cAAc,GAAG,IAAI,GAAG,CAAS,aAAa,CAAC,CAAC;AAEtD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAAC,OAA0B,EAAE,MAA4B;IACrF,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,OAAe,EAAQ,EAAE;YAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;QAC7C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,CAAC,CAAC,kCAAkC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS;gBAAE,CAAC,CAAC,4CAA4C,CAAC,CAAC;iBAC5E,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;gBAAE,CAAC,CAAC,wBAAwB,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;QAC3F,CAAC;aAAM,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACvC,CAAC,CAAC,4CAA4C,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,OAAO;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;IACxF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAwBD;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,SAAiB,EACjB,OAAmC,EACnC,MAA4B;IAE5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,kBAAkB,SAAS,0DAA0D,CAAC,CAAC;IACzG,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,SAAS,8BAA8B,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IACpH,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,MAAM,KAAK,SAAS;YAAE,UAAU,EAAE,CAAC;aAClC,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;YAAE,WAAW,EAAE,CAAC;QACrD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,MAAM,EAAE,CAAC;YACT,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ;gBAAE,aAAa,EAAE,CAAC;YAClD,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ;gBAAE,YAAY,EAAE,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,QAAQ,EAAE,CAAC;YACX,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ;gBAAE,YAAY,EAAE,CAAC;YACjD,IAAI,MAAM,EAAE,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACjC,eAAe,EAAE,CAAC;gBAClB,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS,IAAI,MAAM,CAAC,eAAe,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC;oBACzF,kBAAkB,EAAE,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO;QACL,SAAS;QACT,MAAM;QACN,QAAQ;QACR,eAAe;QACf,wBAAwB,EACtB,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,eAAe,EAAE,QAAQ,CAAC;QACvG,kBAAkB;QAClB,YAAY;QACZ,aAAa;QACb,YAAY;QACZ,WAAW;QACX,UAAU;KACX,CAAC;AACJ,CAAC;AAaD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAkB,EAClB,QAAoC,EACpC,UAAkB,EAClB,QAAoC,EACpC,MAA4B;IAE5B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IAC3D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;IAC7F,MAAM,UAAU,GAAG,CAAC,OAAmC,EAAe,EAAE,CACtE,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9E,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAChC,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;aACX,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;aACX,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;;YACX,CAAC,EAAE,CAAC;IACX,CAAC;IACD,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IACnD,OAAO;QACL,UAAU;QACV,UAAU;QACV,KAAK;QACL,UAAU;QACV,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC;QACvB,oBAAoB,EAAE,UAAU,CAAC,KAAK,GAAG,CAAC;KAC3C,CAAC;AACJ,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,IAAkE,EAClE,MAA4B;IAE5B,MAAM,IAAI,GAAkB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACjC,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;aACpD,CAAC;YACJ,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC;gBACR,aAAa,EAAE,IAAI;gBACnB,OAAO;gBACP,gBAAgB,EAAE,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,CAAC;aAChF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["/**\n * Atlas Phase 6, S6.1 — scoring a benchmark condition against the answer key.\n *\n * Design note: `docs/planning/Atlas-Phase-5-Design.md` §9.\n *\n * This module receives the answer key as an ARGUMENT. It never reads the scorer\n * half of the fixture tree itself: the import guard forbids any `src/` path into\n * it. The orchestration script (`scripts/run-atlas-study.mjs`) loads the labels\n * and passes them in.\n *\n * **An empty item set produces NO metrics, not zero metrics.** `scoreCondition`\n * throws on it: a table of zeros and NaNs from an empty set is indistinguishable,\n * at a glance, from a condition that failed everything.\n *\n * @module atlas/benchmark/study\n * @internal\n */\n\nimport { FAILURE_KINDS } from './types.js';\nimport type { FailureKind } from './types.js';\nimport { mcnemar, pairedDifferenceInterval, wilsonInterval } from './stats.js';\nimport type { Interval, McNemarResult } from './stats.js';\n\n/** One condition's answer for one item. @internal */\nexport interface ConditionAnswer {\n  readonly itemId: string;\n  readonly outcome: 'accept' | 'reject' | 'abstain';\n  readonly detectedFailure?: FailureKind;\n}\n\n/** The answer key for one item — scorer-side, never in the public half. @internal */\nexport interface ItemLabel {\n  readonly itemId: string;\n  readonly kind: 'valid' | 'invalid';\n  /** For an invalid item: the failure kind a correct rejection names. */\n  readonly failureKind?: FailureKind;\n}\n\n/** One reason an answer key does not fit its item set. @internal */\nexport interface LabelProblem {\n  readonly id: string;\n  readonly problem: string;\n}\n\nconst KNOWN_FAILURES = new Set<string>(FAILURE_KINDS);\n\n/**\n * Check an answer key against the item ids it must cover: exactly one label per\n * item, no label for an unknown item, a known failure kind on every invalid\n * label and none on a valid one. Takes the key as an ARGUMENT, like everything\n * here, because no `src/` file may read the scorer half.\n *\n * @param itemIds - the ids of the frozen items.\n * @param labels - the answer key.\n * @returns every problem found, labels first in key order, then missing labels\n * in item order; empty means the key fits.\n * @internal\n */\nexport function validateLabels(itemIds: readonly string[], labels: readonly ItemLabel[]): LabelProblem[] {\n  const problems: LabelProblem[] = [];\n  const ids = new Set(itemIds);\n  const seen = new Set<string>();\n  for (const l of labels) {\n    const p = (problem: string): void => {\n      problems.push({ id: l.itemId, problem });\n    };\n    if (seen.has(l.itemId)) p('duplicate label');\n    seen.add(l.itemId);\n    if (!ids.has(l.itemId)) p('label for an item not in the set');\n    if (l.kind === 'invalid') {\n      if (l.failureKind === undefined) p('an invalid label must name its failureKind');\n      else if (!KNOWN_FAILURES.has(l.failureKind)) p(`unknown failureKind '${l.failureKind}'`);\n    } else if (l.failureKind !== undefined) {\n      p('a valid label must not carry a failureKind');\n    }\n  }\n  for (const id of itemIds) if (!seen.has(id)) problems.push({ id, problem: 'no label' });\n  return problems;\n}\n\n/** A condition's metrics on the frozen set. @internal */\nexport interface ConditionMetrics {\n  readonly condition: string;\n  readonly nValid: number;\n  readonly nInvalid: number;\n  /** Invalid items rejected, with its Wilson interval. */\n  readonly invalidRejected: number;\n  readonly invalidRejectionInterval: Interval;\n  /** Of the rejected invalid items, how many named the right failure kind. */\n  readonly kindNamedCorrectly: number;\n  /** Invalid items ACCEPTED: the error the benchmark exists to count. */\n  readonly wrongAccepts: number;\n  /** Valid items accepted. */\n  readonly validAccepted: number;\n  /** Valid items rejected. */\n  readonly falseRejects: number;\n  /** All abstentions, reported and never folded into accuracy. */\n  readonly abstentions: number;\n  /** Items the condition did not answer at all: counted, never dropped. */\n  readonly unanswered: number;\n}\n\n/**\n * Score one condition against the answer key.\n *\n * @throws Error when the key is empty (no measurement exists), or when an answer\n * names an item the key does not contain.\n * @internal\n */\nexport function scoreCondition(\n  condition: string,\n  answers: readonly ConditionAnswer[],\n  labels: readonly ItemLabel[],\n): ConditionMetrics {\n  if (labels.length === 0) {\n    throw new Error(`scoreCondition(${condition}): the answer key is empty — there is nothing to measure`);\n  }\n  const byId = new Map(answers.map((a) => [a.itemId, a]));\n  const labelIds = new Set(labels.map((l) => l.itemId));\n  for (const a of answers) {\n    if (!labelIds.has(a.itemId)) throw new Error(`scoreCondition(${condition}): answer for unknown item ${a.itemId}`);\n  }\n  let nValid = 0;\n  let nInvalid = 0;\n  let invalidRejected = 0;\n  let kindNamedCorrectly = 0;\n  let wrongAccepts = 0;\n  let validAccepted = 0;\n  let falseRejects = 0;\n  let abstentions = 0;\n  let unanswered = 0;\n  for (const label of labels) {\n    const answer = byId.get(label.itemId);\n    if (answer === undefined) unanswered++;\n    else if (answer.outcome === 'abstain') abstentions++;\n    if (label.kind === 'valid') {\n      nValid++;\n      if (answer?.outcome === 'accept') validAccepted++;\n      if (answer?.outcome === 'reject') falseRejects++;\n    } else {\n      nInvalid++;\n      if (answer?.outcome === 'accept') wrongAccepts++;\n      if (answer?.outcome === 'reject') {\n        invalidRejected++;\n        if (answer.detectedFailure !== undefined && answer.detectedFailure === label.failureKind) {\n          kindNamedCorrectly++;\n        }\n      }\n    }\n  }\n  return {\n    condition,\n    nValid,\n    nInvalid,\n    invalidRejected,\n    invalidRejectionInterval:\n      nInvalid === 0 ? { lower: Number.NaN, upper: Number.NaN } : wilsonInterval(invalidRejected, nInvalid),\n    kindNamedCorrectly,\n    wrongAccepts,\n    validAccepted,\n    falseRejects,\n    abstentions,\n    unanswered,\n  };\n}\n\n/** The paired comparison of two conditions' rejection of invalid items. @internal */\nexport interface PairedRejection {\n  readonly conditionA: string;\n  readonly conditionB: string;\n  readonly table: { readonly a: number; readonly b: number; readonly c: number; readonly d: number };\n  readonly difference: Interval & { readonly diff: number };\n  readonly mcnemar: McNemarResult;\n  /** The pre-registered criterion: the interval for A − B excludes zero, above it. */\n  readonly aBetterExcludingZero: boolean;\n}\n\n/**\n * Compare two conditions on the SAME invalid items. An item counts as \"right\"\n * for a condition when it was rejected; an unanswered item is \"wrong\", not dropped.\n *\n * @throws Error when there are no invalid items.\n * @internal\n */\nexport function pairedRejection(\n  conditionA: string,\n  answersA: readonly ConditionAnswer[],\n  conditionB: string,\n  answersB: readonly ConditionAnswer[],\n  labels: readonly ItemLabel[],\n): PairedRejection {\n  const invalid = labels.filter((l) => l.kind === 'invalid');\n  if (invalid.length === 0) throw new Error('pairedRejection: no invalid items to compare on');\n  const rejectedBy = (answers: readonly ConditionAnswer[]): Set<string> =>\n    new Set(answers.filter((x) => x.outcome === 'reject').map((x) => x.itemId));\n  const ra = rejectedBy(answersA);\n  const rb = rejectedBy(answersB);\n  let a = 0;\n  let b = 0;\n  let c = 0;\n  let d = 0;\n  for (const l of invalid) {\n    const x = ra.has(l.itemId);\n    const y = rb.has(l.itemId);\n    if (x && y) a++;\n    else if (x) b++;\n    else if (y) c++;\n    else d++;\n  }\n  const table = { a, b, c, d };\n  const difference = pairedDifferenceInterval(table);\n  return {\n    conditionA,\n    conditionB,\n    table,\n    difference,\n    mcnemar: mcnemar(table),\n    aBetterExcludingZero: difference.lower > 0,\n  };\n}\n\n/** One row of the ablation: a configuration's metrics and its step over the previous one. @internal */\nexport interface AblationRow {\n  readonly configuration: string;\n  readonly metrics: ConditionMetrics;\n  /** Paired rejection of THIS configuration vs the previous one; absent for the first. */\n  readonly stepOverPrevious?: PairedRejection;\n}\n\n/**\n * Score a sequence of named condition runs as an ablation: each row is scored,\n * and each row after the first is compared, paired on the same invalid items,\n * against the row before it — so the table shows what each added layer bought.\n *\n * @internal\n */\nexport function scoreAblation(\n  runs: ReadonlyArray<readonly [string, readonly ConditionAnswer[]]>,\n  labels: readonly ItemLabel[],\n): AblationRow[] {\n  const rows: AblationRow[] = [];\n  for (let i = 0; i < runs.length; i++) {\n    const [name, answers] = runs[i]!;\n    const metrics = scoreCondition(name, answers, labels);\n    if (i === 0) rows.push({ configuration: name, metrics });\n    else {\n      const [prevName, prevAnswers] = runs[i - 1]!;\n      rows.push({\n        configuration: name,\n        metrics,\n        stepOverPrevious: pairedRejection(name, answers, prevName, prevAnswers, labels),\n      });\n    }\n  }\n  return rows;\n}\n"]}

package/dist/atlas/benchmark/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,2EAA2E;AAC3E,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,iBAAiB;IACjB,kBAAkB;IAClB,qBAAqB;IACrB,oBAAoB;IACpB,yBAAyB;IACzB,mBAAmB;IACnB,eAAe;IACf,kBAAkB;CACV,CAAC;AAgBX;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,eAAe,CAAC;AAE/C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAsB;IACjD,WAAW;IACX,QAAQ;IACR,UAAU;IACV,QAAQ;IACR,YAAY;IACZ,cAAc;IACd,eAAe;CAChB,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/atlas/benchmark/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,2EAA2E;AAC3E,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,iBAAiB;IACjB,kBAAkB;IAClB,qBAAqB;IACrB,oBAAoB;IACpB,yBAAyB;IACzB,mBAAmB;IACnB,eAAe;IACf,kBAAkB;CACV,CAAC;AAgBX;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,eAAe,CAAC;AAE/C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAsB;IACjD,WAAW;IACX,QAAQ;IACR,UAAU;IACV,QAAQ;IACR,YAAY;IACZ,cAAc;IACd,eAAe;CAChB,CAAC","sourcesContent":["/**\n * Atlas Phase 5, S5.1 — the invalid-bridge benchmark's item schema.\n *\n * Design note: `docs/planning/Atlas-Phase-5-Design.md` §2.\n *\n * ⚠ **No agent authors a frozen item** (design note §0). This file defines the\n * SHAPE an independent author fills in; it contains no items.\n *\n * @module atlas/benchmark/types\n * @internal\n */\n\nimport type { ExprNode } from '../../dimensional/ast-types.js';\nimport type { Conventions, RegimeInequality, RelationType } from '../types.js';\n\n/** The eight failure kinds, sampled evenly (ROADMAP Phase 5). @internal */\nexport const FAILURE_KINDS = [\n  'omitted-premise',\n  'domain-violation',\n  'convention-mismatch',\n  'notation-collision',\n  'dimensional-coincidence',\n  'non-uniform-limit',\n  'false-inverse',\n  'analogy-promoted',\n] as const;\n\n/** One failure kind. @internal */\nexport type FailureKind = (typeof FAILURE_KINDS)[number];\n\n/**\n * Who wrote an item. Only `'independent'` may be frozen; `'contested-draft'`\n * is what an agent may produce, into `contested/`, and nothing else.\n *\n * @internal\n */\nexport type Authorship = 'independent' | 'contested-draft';\n\n/** Which split an item scores in. @internal */\nexport type BenchmarkSplit = 'in-distribution' | 'held-out';\n\n/**\n * The held-out family. Corrected from the plan's \"first-order relaxation\",\n * which Phase 0 already encodes as `model-first-order` (design note §4).\n *\n * @internal\n */\nexport const HELD_OUT_FAMILY = 'fluid-statics';\n\n/**\n * Markers that identify the held-out family in model ids, dynamics and bridge\n * ids. `tests/atlas/benchmark.test.ts` scans the atlas for them, and proves the\n * scan can fire with the ORIGINAL family's markers as a positive control.\n *\n * @internal\n */\nexport const HELD_OUT_MARKERS: readonly string[] = [\n  'hydrostat',\n  'buoyan',\n  'archimed',\n  'pascal',\n  'barometric',\n  'fluid-static',\n  'fluid statics',\n];\n\n/**\n * One benchmark item, as its PUBLIC half carries it — never the answer. Whether\n * the item is valid, and which failure kind it has, live only in the scorer\n * half (`ItemLabel` in `study.ts`), so a condition that reads the public file\n * cannot read the key.\n *\n * @internal\n */\nexport interface BenchmarkItem {\n  readonly id: string;\n  readonly premises: readonly string[];\n  readonly conclusion: string;\n  readonly claimedRelation: RelationType;\n  readonly family: string;\n  readonly split: BenchmarkSplit;\n  /** The claimed relation as an AST, so the leakage check can run. */\n  readonly expr: ExprNode;\n  /** The id of the item this one renames, when it is a renamed-variable variant. */\n  readonly renamedVariant?: string;\n  readonly authorship: Authorship;\n  /** Where the item came from: an erratum, a documented misconception, a textbook. */\n  readonly source: string;\n\n  // ── Machine fields (S5.2), all OPTIONAL. The atlas condition can decide only\n  // what an item states; an absent field makes its check UNRUN, and an unrun\n  // check can never support an accept. ────────────────────────────────────────\n\n  /** The claim's stated side conditions, as prose. `[]` states \"none\". */\n  readonly sideConditions?: readonly string[];\n  /** Conventions declared by the premises and by the conclusion. */\n  readonly conventions?: {\n    readonly premise?: Conventions;\n    readonly conclusion?: Conventions;\n  };\n  /** When the claim is a CHAIN: the two relations composed to reach `claimedRelation`. */\n  readonly composedFrom?: readonly [RelationType, RelationType];\n  /** The regime the claim is used in: its inequalities and the π-group values at the use site. */\n  readonly regime?: {\n    readonly inequalities: readonly RegimeInequality[];\n    readonly values: Readonly<Record<string, number>>;\n  };\n}\n"]}

package/dist/atlas/bridge-record.d.ts

@@ -2,9 +2,9 @@
  * One catalog bridge, joined to the canonical foreign key and the generated
  * formal reference.
  *
- * The catalog row, the right-hand side, the edges, and the evaluator stay
- * projections of `registerBridge`. This function reads them. It does not
- * store a second copy.
+ * The catalog row, the right-hand side, the edges, and the evaluator are
+ * projections of `data/bridge-catalog.json`. This function reads them. It
+ * does not store a second copy.
  *
  * @module atlas/bridge-record
  */
@@ -14,7 +14,7 @@
  *
  * @internal
  */
-export declare function getBridge(bridgeId: number | string): {
+export declare function catalogBridgeRecord(bridgeId: number | string): {
     id: number;
     entry: import("../index.js").BridgeEquationEntry;
     rhs: import("../index.js").ExprNode | undefined;

package/dist/atlas/bridge-record.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bridge-record.d.ts","sourceRoot":"","sources":["../../src/atlas/bridge-record.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAOH;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;;;;;;;;EAWlD"}
+{"version":3,"file":"bridge-record.d.ts","sourceRoot":"","sources":["../../src/atlas/bridge-record.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAOH;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;;;;;;;;EAW5D"}

package/dist/atlas/bridge-record.js

@@ -2,15 +2,15 @@
  * One catalog bridge, joined to the canonical foreign key and the generated
  * formal reference.
  *
- * The catalog row, the right-hand side, the edges, and the evaluator stay
- * projections of `registerBridge`. This function reads them. It does not
- * store a second copy.
+ * The catalog row, the right-hand side, the edges, and the evaluator are
+ * projections of `data/bridge-catalog.json`. This function reads them. It
+ * does not store a second copy.
  *
  * @module atlas/bridge-record
  */
 import { BRIDGE_EVALUATORS } from '../bridges/evaluators.js';
 import { CANONICAL_EQUATIONS } from '../canonical/registry.js';
-import { getBridge as joinBridge } from '../composition/descriptor.js';
+import { getBridge } from '../composition/descriptor.js';
 import { catalogFormalRef } from './catalog-formal-ref.js';
 /**
  * The joined catalog record, plus the canonical id that restates it and the
@@ -18,8 +18,8 @@ import { catalogFormalRef } from './catalog-formal-ref.js';
  *
  * @internal
  */
-export function getBridge(bridgeId) {
-    const joined = joinBridge(bridgeId);
+export function catalogBridgeRecord(bridgeId) {
+    const joined = getBridge(bridgeId);
     const canonicalId = CANONICAL_EQUATIONS.find((equation) => equation.restatesBridge === String(joined.id))?.id;
     return {
         ...joined,

package/dist/atlas/bridge-record.js.map

@@ -1 +1 @@
-{"version":3,"file":"bridge-record.js","sourceRoot":"","sources":["../../src/atlas/bridge-record.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,SAAS,IAAI,UAAU,EAAE,MAAM,8BAA8B,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,QAAyB;IACjD,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IACpC,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAC1C,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,cAAc,KAAK,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAC5D,EAAE,EAAE,CAAC;IACN,OAAO;QACL,GAAG,MAAM;QACT,WAAW;QACX,SAAS,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;QACtC,SAAS,EAAE,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;KAC5C,CAAC;AACJ,CAAC"}
+{"version":3,"file":"bridge-record.js","sourceRoot":"","sources":["../../src/atlas/bridge-record.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAyB;IAC3D,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAC1C,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,cAAc,KAAK,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAC5D,EAAE,EAAE,CAAC;IACN,OAAO;QACL,GAAG,MAAM;QACT,WAAW;QACX,SAAS,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;QACtC,SAAS,EAAE,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;KAC5C,CAAC;AACJ,CAAC","sourcesContent":["/**\n * One catalog bridge, joined to the canonical foreign key and the generated\n * formal reference.\n *\n * The catalog row, the right-hand side, the edges, and the evaluator are\n * projections of `data/bridge-catalog.json`. This function reads them. It\n * does not store a second copy.\n *\n * @module atlas/bridge-record\n */\n\nimport { BRIDGE_EVALUATORS } from '../bridges/evaluators.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { getBridge } from '../composition/descriptor.js';\nimport { catalogFormalRef } from './catalog-formal-ref.js';\n\n/**\n * The joined catalog record, plus the canonical id that restates it and the\n * generated formal reference.\n *\n * @internal\n */\nexport function catalogBridgeRecord(bridgeId: number | string) {\n  const joined = getBridge(bridgeId);\n  const canonicalId = CANONICAL_EQUATIONS.find(\n    (equation) => equation.restatesBridge === String(joined.id),\n  )?.id;\n  return {\n    ...joined,\n    canonicalId,\n    formalRef: catalogFormalRef(joined.id),\n    evaluator: BRIDGE_EVALUATORS.get(joined.id),\n  };\n}\n"]}

package/dist/atlas/catalog-formal-ref.js.map

@@ -1 +1 @@
-{"version":3,"file":"catalog-formal-ref.js","sourceRoot":"","sources":["../../src/atlas/catalog-formal-ref.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,mEAAmE;AACnE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiC,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAU;IACzC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC;IACxC,MAAM,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC;AACb,CAAC"}
+{"version":3,"file":"catalog-formal-ref.js","sourceRoot":"","sources":["../../src/atlas/catalog-formal-ref.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,mEAAmE;AACnE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiC,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAU;IACzC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC;IACxC,MAAM,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Catalog formal references.\n *\n * The catalog row stores the manifest key. This module asks PhysJS for that\n * key. It does not parse an id out of text, and it does not store an evidence\n * tag.\n *\n * @module atlas/catalog-formal-ref\n */\n\nimport type { FormalRef } from '../relations/types.js';\nimport { catalogEntry } from '../bridges/catalog-load.js';\nimport { physjsFormalRef } from './physjs-ref.js';\n\n/** Memo of the PhysJS reference already built for a catalog id. */\nconst byId = new Map<number, FormalRef | undefined>();\n\n/**\n * The reviewed PhysJS reference for a catalog id, or `undefined` when the\n * row records no manifest key.\n *\n * @internal\n */\nexport function catalogFormalRef(id: number): FormalRef | undefined {\n  if (byId.has(id)) return byId.get(id);\n  const key = catalogEntry(id)?.formalKey;\n  const ref = key === undefined ? undefined : physjsFormalRef(key);\n  byId.set(id, ref);\n  return ref;\n}\n"]}

package/dist/atlas/chain-pipeline.d.ts

@@ -16,7 +16,6 @@
 import type { ExprNode } from '../dimensional/validator.js';
 import type { Dimension } from '../dimensional/types.js';
 import type { BridgeEdge } from '../composition/edge.js';
-import type { CompositionResult } from '../relations/composition-table.js';
 import { type ChainRecord } from '../composition/chain-result.js';
 import { type ChainRegimeMismatch } from '../composition/chain-regime.js';
 /** A chain whose normal form matches a catalog equation. Nothing was written. @internal */
@@ -66,16 +65,6 @@ export declare function governingOf(expr: ExprNode, targetName: string): {
     name: string;
     dim: Dimension;
 }[];
-/**
- * The category claim recorded for two quantity edges.
- *
- * A quantity edge stores a quantity name, not a category object id.
- * This step does not invent that id, so the recorded result is unset
- * even when both edges store a relation. The pair is not dropped.
- *
- * @internal
- */
-export declare function categoryCompositionForChain(first: BridgeEdge, second: BridgeEdge): CompositionResult | undefined;
 /**
  * The orchestrator view of one {@link ChainRecord}.
  *

package/dist/atlas/chain-pipeline.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"chain-pipeline.d.ts","sourceRoot":"","sources":["../../src/atlas/chain-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAIzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAEzD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AAI3E,OAAO,EAGL,KAAK,WAAW,EACjB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAsB,KAAK,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AAK9F,2FAA2F;AAC3F,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,6FAA6F;AAC7F,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,mEAAmE;AACnE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,IAAI,EAAE,6BAA6B,CAAC;IAC7C,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,0FAA0F;AAC1F,MAAM,MAAM,mBAAmB,GAC3B,uBAAuB,GACvB,sBAAsB,GACtB,eAAe,GACf,mBAAmB,GACnB,uBAAuB,CAAC;AAY5B;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,SAAS,CAAA;CAAE,EAAE,CASlG;AAED;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,UAAU,GACjB,iBAAiB,GAAG,SAAS,CAI/B;AAyCD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,WAAW,EACnB,YAAY,GAAE,SAAS,MAAM,EAAO,GACnC,mBAAmB,CAyBrB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,SAAS,mBAAmB,EAAE,CAiD7F"}
+{"version":3,"file":"chain-pipeline.d.ts","sourceRoot":"","sources":["../../src/atlas/chain-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAIzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAKzD,OAAO,EAGL,KAAK,WAAW,EACjB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAsB,KAAK,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AAK9F,2FAA2F;AAC3F,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,6FAA6F;AAC7F,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,mEAAmE;AACnE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,IAAI,EAAE,6BAA6B,CAAC;IAC7C,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,0FAA0F;AAC1F,MAAM,MAAM,mBAAmB,GAC3B,uBAAuB,GACvB,sBAAsB,GACtB,eAAe,GACf,mBAAmB,GACnB,uBAAuB,CAAC;AAY5B;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,SAAS,CAAA;CAAE,EAAE,CASlG;AAyCD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,WAAW,EACnB,YAAY,GAAE,SAAS,MAAM,EAAO,GACnC,mBAAmB,CAyBrB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,SAAS,mBAAmB,EAAE,CAqD7F"}

package/dist/atlas/chain-pipeline.js

@@ -54,21 +54,6 @@ export function governingOf(expr, targetName) {
     vars.sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));
     return vars;
 }
-/**
- * The category claim recorded for two quantity edges.
- *
- * A quantity edge stores a quantity name, not a category object id.
- * This step does not invent that id, so the recorded result is unset
- * even when both edges store a relation. The pair is not dropped.
- *
- * @internal
- */
-export function categoryCompositionForChain(first, second) {
-    const relationsAreStored = first.relation !== undefined && second.relation !== undefined;
-    if (!relationsAreStored)
-        return undefined;
-    return undefined;
-}
 function theoremsFor(edgeIds) {
     return edgeIds.map((id) => {
         const name = physjsTheorem(id);
@@ -172,7 +157,11 @@ export function runChainPipeline(edges) {
             classification,
             theorem: filtered.theorem,
             mismatch: undefined,
-            categoryComposition: categoryCompositionForChain(target.first, target.second),
+            // A quantity edge stores a quantity name, not a category object id, so
+            // no step can state a category claim for the pair. Unset, and the pair
+            // is not dropped. The sentence that a function computed this value is
+            // the record from before it was found to return nothing else.
+            categoryComposition: undefined,
         };
         if (classification.kind === 'confirmation' || classification.kind === 'restatement') {
             records.push(record);

package/dist/atlas/chain-pipeline.js.map

@@ -1 +1 @@
-{"version":3,"file":"chain-pipeline.js","sourceRoot":"","sources":["../../src/atlas/chain-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AAEjE,OAAO,EAAE,iCAAiC,EAAE,MAAM,6BAA6B,CAAC;AAEhF,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAC3D,OAAO,EAAE,mBAAmB,EAAuB,MAAM,mCAAmC,CAAC;AAC7F,OAAO,EACL,aAAa,EACb,iBAAiB,GAElB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAA4B,MAAM,gCAAgC,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,yCAAyC,CAAC;AA+ClF,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,uBAAuB,CAAC,IAAY;IAC3C,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,IAAc,EAAE,UAAkB;IAC5D,MAAM,IAAI,GAAuC,EAAE,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QACvC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7E,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAiB,EACjB,MAAkB;IAElB,MAAM,kBAAkB,GAAG,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,CAAC;IACzF,IAAI,CAAC,kBAAkB;QAAE,OAAO,SAAS,CAAC;IAC1C,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,WAAW,CAAC,OAA0B;IAC7C,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QACxB,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,0DAA0D,EAAE,GAAG,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,cAAc,CAAC,MAAmB;IACzC,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,SAAS,CAAC;IAC5C,MAAM,OAAO,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;IACzD,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAClD,OAAO;YACL,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,SAAS;YAC1C,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACjD,OAAO;YACL,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,WAAW;YAC9C,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC,cAAc;YACpD,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IACD,OAAO;QACL,IAAI;QACJ,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,EAAE,EAAE,MAAM,CAAC,cAAc,CAAC,EAAE;QAC5B,GAAG,OAAO;KACX,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAmB,EACnB,YAAY,GAAsB,EAAE;IAEpC,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAClD,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,SAAS;YAC1C,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACjD,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,WAAW;YAC9C,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC,cAAc;YACpD,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC;IAC1D,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,IAAI,SAAS,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAC/D,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,EAAE;QACF,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,IAAI,EAAE,eAAe,CAAC,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,YAAY,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,iCAAiC,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,UAAU,GAAkB,EAAE,CAAC;IACrC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,gBAAgB,CAC/B,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAClE,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CACpD,CAAC;QACF,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS;QACrC,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACpF,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpD,MAAM,MAAM,GAAgB;YAC1B,OAAO;YACP,cAAc;YACd,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,QAAQ,EAAE,SAAS;YACnB,mBAAmB,EAAE,2BAA2B,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC;SAC9E,CAAC;QACF,IAAI,cAAc,CAAC,IAAI,KAAK,cAAc,IAAI,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACpF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;YACzC,SAAS;QACX,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACtD,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAC1C,CAAC;IACF,MAAM,aAAa,GAA8B,KAAK,CAAC,gBAAgB;SACpE,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,IAAI,EAAE,6BAAsC;QAC5C,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAqB;QAC1D,OAAO,EAAE,GAAG,CAAC,OAAO;KACrB,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7D,OAAO;QACL,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAC3C,iBAAiB,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACvD;QACD,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC/D,GAAG,aAAa;KACjB,CAAC;AACJ,CAAC"}
+{"version":3,"file":"chain-pipeline.js","sourceRoot":"","sources":["../../src/atlas/chain-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AAEjE,OAAO,EAAE,iCAAiC,EAAE,MAAM,6BAA6B,CAAC;AAChF,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAC3D,OAAO,EAAE,mBAAmB,EAAuB,MAAM,mCAAmC,CAAC;AAC7F,OAAO,EACL,aAAa,EACb,iBAAiB,GAElB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAA4B,MAAM,gCAAgC,CAAC;AAC9F,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,yCAAyC,CAAC;AA+ClF,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,uBAAuB,CAAC,IAAY;IAC3C,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACnC,OAAO,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,IAAc,EAAE,UAAkB;IAC5D,MAAM,IAAI,GAAuC,EAAE,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,uBAAuB,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QACvC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7E,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,OAA0B;IAC7C,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QACxB,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,0DAA0D,EAAE,GAAG,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,cAAc,CAAC,MAAmB;IACzC,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,SAAS,CAAC;IAC5C,MAAM,OAAO,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;IACzD,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAClD,OAAO;YACL,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,SAAS;YAC1C,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACjD,OAAO;YACL,IAAI;YACJ,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,WAAW;YAC9C,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC,cAAc;YACpD,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IACD,OAAO;QACL,IAAI;QACJ,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,EAAE,EAAE,MAAM,CAAC,cAAc,CAAC,EAAE;QAC5B,GAAG,OAAO;KACX,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAmB,EACnB,YAAY,GAAsB,EAAE;IAEpC,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;QAClD,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,SAAS;YAC1C,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QACjD,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,WAAW;YAC9C,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC,cAAc;YACpD,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,QAAQ,CAAC;IAC1D,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,IAAI,SAAS,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAC/D,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,EAAE;QACF,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,IAAI,EAAE,eAAe,CAAC,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,YAAY,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,iCAAiC,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,UAAU,GAAkB,EAAE,CAAC;IACrC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,gBAAgB,CAC/B,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,EAClE,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CACpD,CAAC;QACF,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS;QACrC,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACpF,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpD,MAAM,MAAM,GAAgB;YAC1B,OAAO;YACP,cAAc;YACd,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,QAAQ,EAAE,SAAS;YACnB,uEAAuE;YACvE,uEAAuE;YACvE,sEAAsE;YACtE,8DAA8D;YAC9D,mBAAmB,EAAE,SAAS;SAC/B,CAAC;QACF,IAAI,cAAc,CAAC,IAAI,KAAK,cAAc,IAAI,cAAc,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACpF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;YACzC,SAAS;QACX,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,iBAAiB,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACtD,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAC1C,CAAC;IACF,MAAM,aAAa,GAA8B,KAAK,CAAC,gBAAgB;SACpE,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,IAAI,EAAE,6BAAsC;QAC5C,OAAO,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAqB;QAC1D,OAAO,EAAE,GAAG,CAAC,OAAO;KACrB,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7D,OAAO;QACL,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAC3C,iBAAiB,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACvD;QACD,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC/D,GAAG,aAAa;KACjB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Internal bridge-discovery pipeline.\n *\n * Seeds, then seed-filtered symbolic enumeration, the Buckingham filter,\n * the structural classifier, the regime join gate, the chain order,\n * and the proof-target stub.\n * A confirmation reports the catalog id. A restatement reports the\n * pre-declared canonical equation. A regime mismatch is recorded and\n * is not a stub. Any other survivor is a statement skeleton. Nothing\n * is written into the catalog.\n *\n * No command calls this. `discovery.ts` and the probe are not inputs.\n *\n * @module atlas/chain-pipeline\n */\n\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { equals } from '../dimensional/algebra.js';\nimport { CONSTANTS } from '../dimensional/symbolic-constants.js';\nimport type { BridgeEdge } from '../composition/edge.js';\nimport { enumerateCompositionsWithRefusals } from '../composition/enumerate.js';\nimport { buckinghamFilter } from '../composition/buckingham-filter.js';\nimport { matchChain } from '../composition/chain-match.js';\nimport { compareChainEdgeIds, type ChainCandidate } from '../composition/chain-candidate.js';\nimport {\n  chainOrderKey,\n  orderChainRecords,\n  type ChainRecord,\n} from '../composition/chain-result.js';\nimport { joinRegimeMismatch, type ChainRegimeMismatch } from '../composition/chain-regime.js';\nimport { bridgeSeedKeys, physjsTheorem } from './physjs-ref.js';\nimport { emitProofTarget } from './proof-target.js';\nimport { scalarSymbolsFromMathTs } from '../composition/mathts-scalar-symbols.js';\n\n/** A chain whose normal form matches a catalog equation. Nothing was written. @internal */\nexport interface ChainConfirmationRecord {\n  readonly kind: 'confirmation';\n  readonly catalogId: number;\n  readonly edgeIds: readonly string[];\n}\n\n/** A chain the registry pre-declared with `restatesBridge`. Not a new equation. @internal */\nexport interface ChainRestatementRecord {\n  readonly kind: 'restatement';\n  readonly canonicalId: string;\n  readonly restatesBridge: string;\n  readonly edgeIds: readonly string[];\n}\n\n/** A provisional chain, as a Lean statement skeleton. @internal */\nexport interface ChainStubRecord {\n  readonly kind: 'stub';\n  readonly id: string;\n  readonly edgeIds: readonly string[];\n  readonly text: string;\n}\n\n/**\n * A pair the composition table refused.\n *\n * The message is `UndefinedCompositionError`. A dimension mismatch is not\n * this record.\n *\n * @internal\n */\nexport interface ChainCompositionRefusal {\n  readonly kind: 'rejected: composition table';\n  readonly edgeIds: readonly [string, string];\n  readonly message: string;\n}\n\n/** One ordered survivor, a regime rejection, or a composition-table refusal. @internal */\nexport type ChainPipelineResult =\n  | ChainConfirmationRecord\n  | ChainRestatementRecord\n  | ChainStubRecord\n  | ChainRegimeMismatch\n  | ChainCompositionRefusal;\n\nfunction isNumericName(name: string): boolean {\n  return /^\\d+(\\.\\d+)?$/.test(name);\n}\n\nfunction isDimensionlessConstant(name: string): boolean {\n  if (/^\\d*pi$/.test(name)) return true;\n  const registered = CONSTANTS[name];\n  return registered !== undefined && equals(registered.dim, DIMENSIONLESS);\n}\n\n/**\n * Dimensioned leaves of the composed formula, excluding the target name.\n * The names are the MathTS symbol filter. A dimensionless constant is not\n * a governing symbol. The elementary charge is, because its dimension is\n * charge.\n *\n * @internal\n */\nexport function governingOf(expr: ExprNode, targetName: string): { name: string; dim: Dimension }[] {\n  const vars: { name: string; dim: Dimension }[] = [];\n  for (const leaf of scalarSymbolsFromMathTs(expr)) {\n    if (leaf.name === targetName) continue;\n    if (isNumericName(leaf.name) || isDimensionlessConstant(leaf.name)) continue;\n    vars.push(leaf);\n  }\n  vars.sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));\n  return vars;\n}\n\nfunction theoremsFor(edgeIds: readonly string[]): string[] {\n  return edgeIds.map((id) => {\n    const name = physjsTheorem(id);\n    if (name === undefined) {\n      throw new Error(`chain pipeline: manifest copy has no theorem for seed '${id}'`);\n    }\n    return name;\n  });\n}\n\nfunction proofCandidate(record: ChainRecord): ChainCandidate {\n  const kind = chainOrderKey(record);\n  const theorem = record.theorem ?? undefined;\n  const carried = theorem === undefined ? {} : { theorem };\n  if (record.classification.kind === 'confirmation') {\n    return {\n      kind,\n      edgeIds: record.edgeIds,\n      catalogId: record.classification.catalogId,\n      ...carried,\n    };\n  }\n  if (record.classification.kind === 'restatement') {\n    return {\n      kind,\n      edgeIds: record.edgeIds,\n      canonicalId: record.classification.canonicalId,\n      restatesBridge: record.classification.restatesBridge,\n      ...carried,\n    };\n  }\n  return {\n    kind,\n    edgeIds: record.edgeIds,\n    id: record.classification.id,\n    ...carried,\n  };\n}\n\n/**\n * The orchestrator view of one {@link ChainRecord}.\n *\n * A confirmation and a restatement ignore `mismatch`. A provisional\n * record with a mismatch is that rejection. Any other provisional record\n * is a stub whose id and theorem come from the same record the order key\n * reads.\n *\n * @internal\n */\nexport function renderChainRecord(\n  record: ChainRecord,\n  seedTheorems: readonly string[] = [],\n): ChainPipelineResult {\n  if (record.classification.kind === 'confirmation') {\n    return {\n      kind: 'confirmation',\n      catalogId: record.classification.catalogId,\n      edgeIds: record.edgeIds,\n    };\n  }\n  if (record.classification.kind === 'restatement') {\n    return {\n      kind: 'restatement',\n      canonicalId: record.classification.canonicalId,\n      restatesBridge: record.classification.restatesBridge,\n      edgeIds: record.edgeIds,\n    };\n  }\n  if (record.mismatch !== undefined) return record.mismatch;\n  const candidate = proofCandidate(record);\n  const id = candidate.id ?? `chain-${record.edgeIds.join('-')}`;\n  return {\n    kind: 'stub',\n    id,\n    edgeIds: record.edgeIds,\n    text: emitProofTarget({ ...candidate, id }, seedTheorems),\n  };\n}\n\n/**\n * Run the pipeline on `edges`.\n *\n * A manifest key whose derived kind is not `bridge` is not a premise.\n * A chain the Buckingham filter drops is absent. A confirmation or a\n * restatement is not sent to the regime gate. Any other mismatch is\n * `rejected: regime mismatch` and is not a stub. A composition-table\n * refusal is `rejected: composition table` and is not a dimension\n * failure. The catalog array is not modified.\n *\n * @internal\n */\nexport function runChainPipeline(edges: readonly BridgeEdge[]): readonly ChainPipelineResult[] {\n  const seedIds = new Set(bridgeSeedKeys());\n  const found = enumerateCompositionsWithRefusals(edges, { seedIds });\n  const report = found.report;\n  const records: ChainRecord[] = [];\n  const rejections: ChainRecord[] = [];\n  for (const target of report.proofTargets) {\n    const filtered = buckinghamFilter(\n      { name: target.second.target.name, dim: target.second.target.dim },\n      governingOf(target.expr, target.second.target.name),\n    );\n    if (filtered === undefined) continue;\n    const classification = matchChain(target.expr, [target.first.id, target.second.id]);\n    const edgeIds = [target.first.id, target.second.id];\n    const record: ChainRecord = {\n      edgeIds,\n      classification,\n      theorem: filtered.theorem,\n      mismatch: undefined,\n      // A quantity edge stores a quantity name, not a category object id, so\n      // no step can state a category claim for the pair. Unset, and the pair\n      // is not dropped. The sentence that a function computed this value is\n      // the record from before it was found to return nothing else.\n      categoryComposition: undefined,\n    };\n    if (classification.kind === 'confirmation' || classification.kind === 'restatement') {\n      records.push(record);\n      continue;\n    }\n    const mismatch = joinRegimeMismatch(target.first, target.second);\n    if (mismatch !== undefined) {\n      rejections.push({ ...record, mismatch });\n      continue;\n    }\n    records.push(record);\n  }\n  const orderedRejections = [...rejections].sort((a, b) =>\n    compareChainEdgeIds(a.edgeIds, b.edgeIds),\n  );\n  const tableRefusals: ChainCompositionRefusal[] = found.relationRefusals\n    .map((row) => ({\n      kind: 'rejected: composition table' as const,\n      edgeIds: [row.first.id, row.second.id] as [string, string],\n      message: row.message,\n    }))\n    .sort((a, b) => compareChainEdgeIds(a.edgeIds, b.edgeIds));\n  return [\n    ...orderChainRecords(records).map((record) =>\n      renderChainRecord(record, theoremsFor(record.edgeIds)),\n    ),\n    ...orderedRejections.map((record) => renderChainRecord(record)),\n    ...tableRefusals,\n  ];\n}\n"]}

package/dist/atlas/composition-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"composition-table.js","sourceRoot":"","sources":["../../src/atlas/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;GAIG;AACH,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,kBAAkB,GACnB,MAAM,mCAAmC,CAAC"}
+{"version":3,"file":"composition-table.js","sourceRoot":"","sources":["../../src/atlas/composition-table.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;GAIG;AACH,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,kBAAkB,GACnB,MAAM,mCAAmC,CAAC","sourcesContent":["/**\n * Re-export of the composition table. The table lives in\n * `src/relations/composition-table.ts`. These consts are the same bindings.\n *\n * @module atlas/composition-table\n */\n\n/**\n * The composition table, the silent-cell value, and the function that reads a cell.\n *\n * @public\n */\nexport {\n  COMPOSITION_TABLE,\n  composeRelation,\n  NO_COMPOSITE_CLAIM,\n} from '../relations/composition-table.js';\n\n/** What `composeRelation` returns when the chain asserts nothing. @public */\nexport type NoCompositeClaim = import('../relations/composition-table.js').NoCompositeClaim;\n\n/** The result of composing two relations: a relation type, or no composite claim. @public */\nexport type CompositionResult = import('../relations/composition-table.js').CompositionResult;\n"]}

package/dist/atlas/conventions.js.map

@@ -1 +1 @@
-{"version":3,"file":"conventions.js","sourceRoot":"","sources":["../../src/atlas/conventions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC"}
+{"version":3,"file":"conventions.js","sourceRoot":"","sources":["../../src/atlas/conventions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC","sourcesContent":["/**\n * Re-export of the convention comparison. The implementation lives in\n * `src/relations/conventions.ts`.\n *\n * @module atlas/conventions\n */\n\nexport { checkConventions, unknownConventionKeys } from '../relations/conventions.js';\nexport type { ConventionKey } from '../relations/conventions.js';\n"]}

package/dist/atlas/coverage.d.ts

@@ -45,8 +45,8 @@ export declare function summarizeEvidence(evidenceSets: Iterable<ReadonlySet<Evi
  * non-empty, which a machine check produces) while nobody has recorded a
  * `relation` for it at all.
  *
- * - `schema` — the denominator: the 55 catalog rows plus the canonical
- *   registry. The atlas families are NOT in it; they are reported separately,
+ * - `schema` — the denominator: the catalog rows plus the canonical
+ *   registry (the counts are the caller's; this module stores none). The atlas families are NOT in it; they are reported separately,
  *   because a nine-model pilot would otherwise dilute a catalog-wide fraction.
  * - `audited` — a HUMAN set `relation` or `conventions` on the record.
  * - `verified` — a derived evidence tag set is non-empty. Passed IN, never

package/dist/atlas/coverage.js.map

@@ -1 +1 @@
-{"version":3,"file":"coverage.js","sourceRoot":"","sources":["../../src/atlas/coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAG/C,8EAA8E;AAC9E,gFAAgF;AAChF,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAU/C;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,YAAgD;IAEhD,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAGpE,CAAC;IACF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,CAAC;QACb,KAAK,MAAM,GAAG,IAAI,GAAG;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AA8CD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAC7B,aAAwC,EACxC,aAAqB,EACrB,YAA4C;IAE5C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,CAC/D,CAAC,MAAM,CAAC;IACT,OAAO;QACL,MAAM,EAAE,aAAa,CAAC,MAAM;QAC5B,OAAO;QACP,QAAQ,EAAE,aAAa;QACvB,aAAa,EAAE,aAAa,CAAC,MAAM,GAAG,OAAO;QAC7C,KAAK,EAAE;YACL,OAAO,EAAE,YAAY,CAAC,MAAM;YAC5B,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,UAAU,CAAC,CAAC,MAAM;SAC3E;KACF,CAAC;AACJ,CAAC"}
+{"version":3,"file":"coverage.js","sourceRoot":"","sources":["../../src/atlas/coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAG/C,8EAA8E;AAC9E,gFAAgF;AAChF,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAU/C;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,YAAgD;IAEhD,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAGpE,CAAC;IACF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,CAAC;QACb,KAAK,MAAM,GAAG,IAAI,GAAG;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AA8CD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAC7B,aAAwC,EACxC,aAAqB,EACrB,YAA4C;IAE5C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,CAC/D,CAAC,MAAM,CAAC;IACT,OAAO;QACL,MAAM,EAAE,aAAa,CAAC,MAAM;QAC5B,OAAO;QACP,QAAQ,EAAE,aAAa;QACvB,aAAa,EAAE,aAAa,CAAC,MAAM,GAAG,OAAO;QAC7C,KAAK,EAAE;YACL,OAAO,EAAE,YAAY,CAAC,MAAM;YAC5B,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,UAAU,CAAC,CAAC,MAAM;SAC3E;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Atlas Phase 1, S1.3 — evidence coverage, counted BY TAG.\n *\n * Design note `docs/planning/Atlas-Phase-1-Design.md` §3: *\"Any future commit\n * that appears to raise a row's evidence without adding a witness is a bug,\n * and the coverage report is what makes it visible: it reports counts BY TAG,\n * so a jump is legible.\"*\n *\n * A single \"how many records have evidence\" total would hide exactly the\n * movement this report exists to expose — one tag inflating while another\n * drains reads as no change at all. So the report is per tag, every tag is\n * present with an explicit zero, and `records` is reported beside the counts\n * (the counts do not sum to it: a record carries several tags).\n *\n * Pure: no I/O, no catalog import, no caching — every function here takes\n * what it counts as an argument, so it can never disagree with a registry.\n *\n * @module atlas/coverage\n * @internal\n */\n\nimport { ALL_EVIDENCE_TAGS } from './types.js';\nimport type { EvidenceTag } from './types.js';\n\n// Moved to `types.ts`: the derived-tag literals may appear under `src/atlas/`\n// only there and in `derive-evidence.ts`. Re-exported so callers are unchanged.\nexport { ALL_EVIDENCE_TAGS } from './types.js';\n\n/** Counts by tag over a set of records. @internal */\nexport interface EvidenceCoverage {\n  /** How many records were counted. */\n  readonly records: number;\n  /** One entry per `EvidenceTag`, zero included. Counts overlap by design. */\n  readonly byTag: Readonly<Record<EvidenceTag, number>>;\n}\n\n/**\n * Count derived evidence sets by tag.\n *\n * @param evidenceSets - one derived set per record, e.g. the output of\n * `deriveEvidence` mapped over a catalog. Deriving is the caller's job; this\n * function never derives, so it cannot disagree with the derivation.\n * @internal\n */\nexport function summarizeEvidence(\n  evidenceSets: Iterable<ReadonlySet<EvidenceTag>>,\n): EvidenceCoverage {\n  const byTag = Object.fromEntries(ALL_EVIDENCE_TAGS.map((t) => [t, 0])) as Record<\n    EvidenceTag,\n    number\n  >;\n  let records = 0;\n  for (const set of evidenceSets) {\n    records += 1;\n    for (const tag of set) byTag[tag] += 1;\n  }\n  return { records, byTag };\n}\n\n// ─────────────────────────────────────────────────────────────────────────────\n// Overlay coverage — how much of the catalog a HUMAN has audited\n// ─────────────────────────────────────────────────────────────────────────────\n\n/**\n * How much of the catalog carries the Phase 1 overlay.\n *\n * `summarizeEvidence` above answers \"what support do these records have\";\n * this answers the different question \"how much has anyone LOOKED at\". The two\n * must not be conflated: a row can be `verified` (its derived tag set is\n * non-empty, which a machine check produces) while nobody has recorded a\n * `relation` for it at all.\n *\n * - `schema` — the denominator: the catalog rows plus the canonical\n *   registry (the counts are the caller's; this module stores none). The atlas families are NOT in it; they are reported separately,\n *   because a nine-model pilot would otherwise dilute a catalog-wide fraction.\n * - `audited` — a HUMAN set `relation` or `conventions` on the record.\n * - `verified` — a derived evidence tag set is non-empty. Passed IN, never\n *   derived here, for the same reason `summarizeEvidence` never derives.\n * - `notYetAudited` — `schema − audited`, stated rather than left to arithmetic.\n *\n * @internal\n */\nexport interface OverlayCoverage {\n  readonly schema: number;\n  readonly audited: number;\n  readonly verified: number;\n  readonly notYetAudited: number;\n  /** The atlas pilot, reported beside the catalog and never mixed into it. */\n  readonly atlas: { readonly bridges: number; readonly reviewed: number };\n}\n\n/** A record that may carry the Phase 1 overlay. Structural, so this module\n * imports no registry and cannot become a second source of truth. @internal */\nexport interface OverlayBearing {\n  readonly relation?: unknown;\n  readonly conventions?: unknown;\n}\n\n/** An atlas bridge, reduced to the one field this report reads. @internal */\nexport interface ReviewStatusBearing {\n  readonly reviewStatus: 'proposed' | 'reviewed';\n}\n\n/**\n * Count overlay coverage over the catalog rows and canonical entries.\n *\n * Every input is PASSED IN. The module stays pure and importless, so it can\n * never disagree with the registries — the caller states which registries it\n * counted, exactly as `summarizeEvidence` requires its caller to state which\n * evidence sets it derived.\n *\n * @param schemaRecords - the catalog rows and canonical entries, concatenated.\n * @param verifiedCount - how many of them have a non-empty derived tag set.\n * @param atlasBridges - the atlas pilot's bridges, reported separately.\n * @internal\n */\nexport function overlayCoverage(\n  schemaRecords: readonly OverlayBearing[],\n  verifiedCount: number,\n  atlasBridges: readonly ReviewStatusBearing[],\n): OverlayCoverage {\n  const audited = schemaRecords.filter(\n    (r) => r.relation !== undefined || r.conventions !== undefined,\n  ).length;\n  return {\n    schema: schemaRecords.length,\n    audited,\n    verified: verifiedCount,\n    notYetAudited: schemaRecords.length - audited,\n    atlas: {\n      bridges: atlasBridges.length,\n      reviewed: atlasBridges.filter((b) => b.reviewStatus === 'reviewed').length,\n    },\n  };\n}\n"]}

package/dist/atlas/derivation.js.map

@@ -1 +1 @@
-{"version":3,"file":"derivation.js","sourceRoot":"","sources":["../../src/atlas/derivation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAE7E,OAAO,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AA6BvD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAoB,EACpB,QAA6C;IAE7C,OAAO;QACL,GAAG,IAAI;QACP,YAAY,EAAE,qBAAqB,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC;KACnF,CAAC;AACJ,CAAC;AA6BD,2FAA2F;AAC3F,MAAM,OAAO,0BAA2B,SAAQ,KAAK;IAC1C,MAAM,CAAoB;IACnC,YAAY,OAAyB;QACnC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,4BAA4B,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC/B,CAAC;CACF;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,kBAAkB,CAChC,EAAgB,EAChB,KAAiB,EACjB,MAAkB,EAClB,QAA6C;IAE7C,6EAA6E;IAC7E,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI;QACvB,CAAC,OAAO,EAAE,KAAK,CAAC;QAChB,CAAC,QAAQ,EAAE,MAAM,CAAC;KACV,EAAE,CAAC;QACX,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACvC,OAAO;gBACL,IAAI,EAAE,cAAc;gBACpB,MAAM,EAAE,uBAAuB;gBAC/B,MAAM,EACJ,GAAG,KAAK,gBAAgB,CAAC,CAAC,EAAE,yBAAyB;oBACrD,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,YAAY,CAAC,MAAM,qCAAqC;aAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAChD,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,cAAc;YACtB,MAAM,EACJ,IAAI,MAAM,CAAC,EAAE,oBAAoB,KAAK,CAAC,UAAU,iBAAiB;gBAClE,qBAAqB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBACzE,OAAO,KAAK,CAAC,EAAE,oBAAoB;SACtC,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,MAAM,QAAQ,GAAsB,eAAe,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACrF,IAAI,QAAQ,KAAK,kBAAkB,EAAE,CAAC;QACpC,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,kBAAkB;YAC1B,MAAM,EACJ,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,QAAQ,WAAW,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC,QAAQ,IAAI;gBAC7E,kFAAkF;SACrF,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,wEAAwE;IACxE,0EAA0E;IAC1E,0EAA0E;IAC1E,6EAA6E;IAC7E,SAAS;IACT,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxD,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9B,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QACnC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,6EAA6E;IAC7E,4EAA4E;IAC5E,0EAA0E;IAC1E,4DAA4D;IAC5D,MAAM,QAAQ,GAAG;QACf,GAAG,IAAI,GAAG,CAAC;YACT,GAAG,KAAK,CAAC,QAAQ;YACjB,KAAK,CAAC,UAAU;YAChB,GAAG,MAAM,CAAC,QAAQ;YAClB,MAAM,CAAC,UAAU;SAClB,CAAC;KACH,CAAC;IACF,MAAM,KAAK,GAAG,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxD,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,kBAAkB;YAC1B,MAAM,EACJ,IAAI,KAAK,CAAC,EAAE,UAAU,MAAM,CAAC,EAAE,0BAA0B;gBACzD,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,GAAG;SACvC,CAAC;IACJ,CAAC;IAED,OAAO;QACL,IAAI,EAAE,WAAW;QACjB,UAAU,EAAE;YACV,EAAE;YACF,QAAQ;YACR,QAAQ;YACR,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,cAAc,EAAE;gBACd,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,cAAc,EAAE,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;aAChE;YACD,YAAY,EAAE,KAAK;SACpB;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CACvC,EAAgB,EAChB,KAAiB,EACjB,MAAkB,EAClB,QAA6C;IAE7C,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,cAAc;QAAE,MAAM,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC;IACjF,OAAO,MAAM,CAAC,UAAU,CAAC;AAC3B,CAAC"}
+{"version":3,"file":"derivation.js","sourceRoot":"","sources":["../../src/atlas/derivation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAE7E,OAAO,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AA6BvD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAoB,EACpB,QAA6C;IAE7C,OAAO;QACL,GAAG,IAAI;QACP,YAAY,EAAE,qBAAqB,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC;KACnF,CAAC;AACJ,CAAC;AA6BD,2FAA2F;AAC3F,MAAM,OAAO,0BAA2B,SAAQ,KAAK;IAC1C,MAAM,CAAoB;IACnC,YAAY,OAAyB;QACnC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,4BAA4B,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC/B,CAAC;CACF;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,kBAAkB,CAChC,EAAgB,EAChB,KAAiB,EACjB,MAAkB,EAClB,QAA6C;IAE7C,6EAA6E;IAC7E,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI;QACvB,CAAC,OAAO,EAAE,KAAK,CAAC;QAChB,CAAC,QAAQ,EAAE,MAAM,CAAC;KACV,EAAE,CAAC;QACX,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACvC,OAAO;gBACL,IAAI,EAAE,cAAc;gBACpB,MAAM,EAAE,uBAAuB;gBAC/B,MAAM,EACJ,GAAG,KAAK,gBAAgB,CAAC,CAAC,EAAE,yBAAyB;oBACrD,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,YAAY,CAAC,MAAM,qCAAqC;aAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAChD,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,cAAc;YACtB,MAAM,EACJ,IAAI,MAAM,CAAC,EAAE,oBAAoB,KAAK,CAAC,UAAU,iBAAiB;gBAClE,qBAAqB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBACzE,OAAO,KAAK,CAAC,EAAE,oBAAoB;SACtC,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,MAAM,QAAQ,GAAsB,eAAe,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACrF,IAAI,QAAQ,KAAK,kBAAkB,EAAE,CAAC;QACpC,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,kBAAkB;YAC1B,MAAM,EACJ,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,QAAQ,WAAW,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC,QAAQ,IAAI;gBAC7E,kFAAkF;SACrF,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,wEAAwE;IACxE,0EAA0E;IAC1E,0EAA0E;IAC1E,6EAA6E;IAC7E,SAAS;IACT,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxD,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9B,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QACnC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,6EAA6E;IAC7E,4EAA4E;IAC5E,0EAA0E;IAC1E,4DAA4D;IAC5D,MAAM,QAAQ,GAAG;QACf,GAAG,IAAI,GAAG,CAAC;YACT,GAAG,KAAK,CAAC,QAAQ;YACjB,KAAK,CAAC,UAAU;YAChB,GAAG,MAAM,CAAC,QAAQ;YAClB,MAAM,CAAC,UAAU;SAClB,CAAC;KACH,CAAC;IACF,MAAM,KAAK,GAAG,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxD,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC9B,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,kBAAkB;YAC1B,MAAM,EACJ,IAAI,KAAK,CAAC,EAAE,UAAU,MAAM,CAAC,EAAE,0BAA0B;gBACzD,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,GAAG;SACvC,CAAC;IACJ,CAAC;IAED,OAAO;QACL,IAAI,EAAE,WAAW;QACjB,UAAU,EAAE;YACV,EAAE;YACF,QAAQ;YACR,QAAQ;YACR,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,cAAc,EAAE;gBACd,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,cAAc,EAAE,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;aAChE;YACD,YAAY,EAAE,KAAK;SACpB;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CACvC,EAAgB,EAChB,KAAiB,EACjB,MAAkB,EAClB,QAA6C;IAE7C,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC/D,IAAI,MAAM,CAAC,IAAI,KAAK,cAAc;QAAE,MAAM,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC;IACjF,OAAO,MAAM,CAAC,UAAU,CAAC;AAC3B,CAAC","sourcesContent":["/**\n * Atlas Phase 3 — `Derivation` (a hyperedge) and multicategory composition.\n *\n * A `Derivation` is many premises and one conclusion. Composing two of them is\n * the operation design note `docs/planning/Atlas-Phase-3-Design.md` §0 names as\n * the one that can silently produce a false claim, and it states the invariant\n * this module exists to enforce:\n *\n * > A hyperedge composes only when EVERY premise edge is exact, and the\n * > composite's premises are the union of the inputs' premises MINUS the\n * > internal conclusions.\n *\n * Four gates enforce it, and each one is a reason to refuse:\n *\n * 1. **Consumption.** `second` must actually consume `first`'s conclusion. If\n *    it does not, the two are unrelated hyperedges and gluing them would\n *    assert a chain that was never drawn.\n * 2. **Relation.** `composeRelation` decides, exactly as it does for a binary\n *    chain. **A hyperedge cannot launder a pair the binary table refuses**\n *    (§3): if the two relations land on one of the fifty-six\n *    `'no-composite-claim'` cells, the hyperedge carries no claim either. This\n *    is also where \"only exact hyperedges compose\" is enforced — the table's\n *    eight defined cells ARE that set, and re-deciding exactness here with a\n *    second rule would be a second place for it to rot.\n * 3. **Context.** The union over every statement involved must EXIST.\n *    `statementContextUnion` returns a refusal rather than a merge when it\n *    does not, and that refusal propagates: no union, no composite.\n * 4. **Premises.** The composite's premises are `first.premises ∪\n *    second.premises` minus the internal conclusions — here, `first.conclusion`.\n *\n * ## Why the primary API returns a union and does not throw\n *\n * The S3.1 brief says composition \"throws\". The design note (§2) says the\n * refusal \"is the correct output rather than an error\", and requires the\n * result type to make \"these do not compose\" expressible WITHOUT a number or a\n * conclusion attached — mirroring `boundPath`'s no-claim. Both are served\n * here: {@link composeDerivations} returns a discriminated union, and\n * {@link composeDerivationsOrThrow} is a thin strict wrapper for callers that\n * genuinely want a failure. The union is primary because it is the shape a\n * caller cannot misread — a refusal has no `.derivation` to read.\n *\n * Pure: no I/O, no registry reads beyond the map a caller passes in.\n *\n * @module atlas/derivation\n */\n\nimport { composeRelation, NO_COMPOSITE_CLAIM } from './composition-table.js';\nimport type { CompositionResult } from './composition-table.js';\nimport { statementContextUnion } from './statement.js';\nimport type { ContextUnionResult, Statement, StatementId } from './statement.js';\nimport type { RelationType } from './types.js';\n\n/** A `Derivation` id — `'d-noether-energy'`, … . @internal */\nexport type DerivationId = string;\n\n/**\n * Many premises, one conclusion.\n *\n * `contextUnion` is a FIELD rather than a method because it is checked once,\n * at construction, and carried: a record whose premises do not pool is a\n * record that states no claim, and that fact travels with it.\n *\n * @internal\n */\nexport interface Derivation {\n  readonly id: DerivationId;\n  readonly relation: RelationType;\n  readonly premises: readonly StatementId[];\n  readonly conclusion: StatementId;\n  readonly sideConditions: readonly string[];\n  /** CHECKED, never merged. A `'no-union'` here means this record claims nothing. */\n  readonly contextUnion: ContextUnionResult;\n}\n\n/** A `Derivation` without its checked union — what {@link makeDerivation} takes. @internal */\nexport type DerivationSpec = Omit<Derivation, 'contextUnion'>;\n\n/**\n * Build a `Derivation`, checking the context union of its premises AND its\n * conclusion.\n *\n * The conclusion is included deliberately: a conclusion stated in a context\n * incompatible with its own premises is exactly the false claim §0 warns\n * about, and leaving it out would let one through.\n *\n * @throws RangeError via `statementContextUnion` if an id does not resolve.\n * @internal\n */\nexport function makeDerivation(\n  spec: DerivationSpec,\n  registry: ReadonlyMap<StatementId, Statement>,\n): Derivation {\n  return {\n    ...spec,\n    contextUnion: statementContextUnion([...spec.premises, spec.conclusion], registry),\n  };\n}\n\n/** Why two hyperedges do not compose. @internal */\nexport type NoCompositeReason =\n  /** `second` does not consume `first`'s conclusion. */\n  | 'not-consumed'\n  /** The binary composition table refuses the pair of relations. */\n  | 'no-composite-claim'\n  /** The statements involved have no context union. */\n  | 'no-context-union'\n  /** One of the inputs already states no claim of its own. */\n  | 'input-states-no-claim';\n\n/** The composite hyperedge. @internal */\nexport interface CompositeFormed {\n  readonly kind: 'composite';\n  readonly derivation: Derivation;\n}\n\n/** The two hyperedges do NOT compose, and this is why. @internal */\nexport interface CompositeRefused {\n  readonly kind: 'no-composite';\n  readonly reason: NoCompositeReason;\n  readonly detail: string;\n}\n\n/** The result of {@link composeDerivations}. @internal */\nexport type DerivationCompositionResult = CompositeFormed | CompositeRefused;\n\n/** Thrown by {@link composeDerivationsOrThrow}. Carries the refusal verbatim. @internal */\nexport class DerivationCompositionError extends Error {\n  readonly reason: NoCompositeReason;\n  constructor(refusal: CompositeRefused) {\n    super(refusal.detail);\n    this.name = 'DerivationCompositionError';\n    this.reason = refusal.reason;\n  }\n}\n\n/**\n * Compose `first` then `second` into one hyperedge, or refuse and say why.\n *\n * `D1: {A, B} ⊢ C` composed with `D2: {C, E} ⊢ F` yields `{A, B, E} ⊢ F`:\n * `C` is the internal conclusion and leaves the composite's premises.\n *\n * Premise ORDER is `first`'s surviving premises followed by `second`'s, each\n * de-duplicated on first appearance. Stable rather than sorted, so a composite\n * reads in the order the derivation was performed.\n *\n * @param id - the composite's id. Supplied by the caller rather than derived\n *   from the inputs, because a generated id would be a new identifier the\n *   registry does not know about.\n * @internal\n */\nexport function composeDerivations(\n  id: DerivationId,\n  first: Derivation,\n  second: Derivation,\n  registry: ReadonlyMap<StatementId, Statement>,\n): DerivationCompositionResult {\n  // ── Gate 0: an input that claims nothing composes to nothing ──────────────\n  for (const [label, d] of [\n    ['first', first],\n    ['second', second],\n  ] as const) {\n    if (d.contextUnion.kind === 'no-union') {\n      return {\n        kind: 'no-composite',\n        reason: 'input-states-no-claim',\n        detail:\n          `${label} derivation '${d.id}' has no context union ` +\n          `(${d.contextUnion.reason}: ${d.contextUnion.detail}), so it states no claim to compose`,\n      };\n    }\n  }\n\n  // ── Gate 1: `second` must consume `first`'s conclusion ────────────────────\n  if (!second.premises.includes(first.conclusion)) {\n    return {\n      kind: 'no-composite',\n      reason: 'not-consumed',\n      detail:\n        `'${second.id}' does not take '${first.conclusion}' as a premise ` +\n        `(its premises are ${second.premises.map((p) => `'${p}'`).join(', ')}), ` +\n        `so '${first.id}' does not feed it`,\n    };\n  }\n\n  // ── Gate 2: the binary table governs, and a hyperedge cannot launder it ───\n  const relation: CompositionResult = composeRelation(first.relation, second.relation);\n  if (relation === NO_COMPOSITE_CLAIM) {\n    return {\n      kind: 'no-composite',\n      reason: NO_COMPOSITE_CLAIM,\n      detail:\n        `'${first.id}' (${first.relation}) then '${second.id}' (${second.relation}) ` +\n        'composes to no relation; a hyperedge cannot assert what the binary table refuses',\n    };\n  }\n\n  // ── Gate 4 (computed before gate 3 so the union covers the right set) ─────\n  // The composite's premises: the union of the inputs' premises MINUS the\n  // internal conclusions. `first.conclusion` is the only internal one for a\n  // two-input composition; it is removed from BOTH sides, so a premise that\n  // `first` also happened to require does not survive as an input it no longer\n  // needs.\n  const internal = new Set<StatementId>([first.conclusion]);\n  const premises: StatementId[] = [];\n  for (const p of [...first.premises, ...second.premises]) {\n    if (internal.has(p)) continue;\n    if (premises.includes(p)) continue;\n    premises.push(p);\n  }\n\n  // ── Gate 3: the pooled context must exist over EVERY statement involved ───\n  // Every statement, not just the surviving premises: the internal conclusion\n  // is what the two halves meet at, and an incompatibility there is exactly\n  // the one that would vanish from the composite's own field.\n  const involved = [\n    ...new Set([\n      ...first.premises,\n      first.conclusion,\n      ...second.premises,\n      second.conclusion,\n    ]),\n  ];\n  const union = statementContextUnion(involved, registry);\n  if (union.kind === 'no-union') {\n    return {\n      kind: 'no-composite',\n      reason: 'no-context-union',\n      detail:\n        `'${first.id}' and '${second.id}' have no context union ` +\n        `(${union.reason}: ${union.detail})`,\n    };\n  }\n\n  return {\n    kind: 'composite',\n    derivation: {\n      id,\n      relation,\n      premises,\n      conclusion: second.conclusion,\n      sideConditions: [\n        ...new Set([...first.sideConditions, ...second.sideConditions]),\n      ],\n      contextUnion: union,\n    },\n  };\n}\n\n/**\n * {@link composeDerivations}, throwing on refusal.\n *\n * For callers that treat a refusal as a failure. Prefer the union-returning\n * form: a thrown error is easy to catch and discard, and a discarded refusal\n * is how a composite gets used anyway.\n *\n * @throws DerivationCompositionError on any refusal.\n * @internal\n */\nexport function composeDerivationsOrThrow(\n  id: DerivationId,\n  first: Derivation,\n  second: Derivation,\n  registry: ReadonlyMap<StatementId, Statement>,\n): Derivation {\n  const result = composeDerivations(id, first, second, registry);\n  if (result.kind === 'no-composite') throw new DerivationCompositionError(result);\n  return result.derivation;\n}\n"]}

package/dist/atlas/derive-evidence.d.ts

@@ -141,14 +141,16 @@ export interface EvidenceInput {
     readonly conventions?: Conventions;
     readonly counterexamples?: readonly CounterexampleLike[];
     /**
-     * The record's formal reference, read for its fidelity and its kind.
-     * Structural so a caller can pass an `AtlasBridge` directly. A missing kind
-     * cannot be supplied by this function: only `'bridge'` derives
-     * `formally-proved`.
+     * The record's formal reference, read for its fidelity, its kind, and its
+     * axioms. Structural so a caller can pass an `AtlasBridge` directly. A
+     * missing kind cannot be supplied by this function: only `'bridge'` derives
+     * `formally-proved`. An axiom list naming `sorryAx` is a proof with a hole
+     * (Lean exits 0 on `sorry`; TOOLS.md) and derives no proof label.
      */
     readonly formalRef?: {
         readonly fidelity: FormalFidelity;
         readonly kind: FormalRefKind;
+        readonly axioms?: readonly string[];
     };
 }
 /**

package/dist/atlas/derive-evidence.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"derive-evidence.d.ts","sourceRoot":"","sources":["../../src/atlas/derive-evidence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAG1F;;;;;;;;;;GAUG;AACH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,GAAG,cAAc,GAAG,eAAe,CAAC;AAE5E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG,aAAa,CAAC;IACjE,4EAA4E;IAC5E,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,MAAM,WAAW,CAAC,EAAE,CAAC;CACpD;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,sFAAsF;IACtF,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,4BAA4B,CAC1C,MAAM,EAAE,aAAa,EACrB,SAAS,EAAE,aAAa,GAAG,SAAS,GACnC,SAAS,kBAAkB,EAAE,CAqB/B;AAED,8DAA8D;AAC9D,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IAC5C,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAC;IACzD;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE;QAAE,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;KAAE,CAAC;CAC1F;AAED;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,oBAAoB,EAAE,WAAW,CAAC,MAAM,CAAqB,CAAC;AAmB3E;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,aAAa,EACrB,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAAC,GACrC,WAAW,CAAC,WAAW,CAAC,CA6C1B;AAED;;;;;;;;GAQG;AACH,wBAAgB,kCAAkC,CAAC,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,GAAG,OAAO,CAE1F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE;IACxC,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAC;CAC1D,GAAG,aAAa,CAYhB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,iBAAiB,EAC1B,MAAM,EAAE,aAAa,EACrB,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAAC,GACrC,WAAW,CAAC,WAAW,CAAC,CAY1B;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,WAAW,CAAC,WAAW,CAAC,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,CAW5G"}
+{"version":3,"file":"derive-evidence.d.ts","sourceRoot":"","sources":["../../src/atlas/derive-evidence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAG1F;;;;;;;;;;GAUG;AACH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,GAAG,cAAc,GAAG,eAAe,CAAC;AAE5E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG,aAAa,CAAC;IACjE,4EAA4E;IAC5E,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,MAAM,WAAW,CAAC,EAAE,CAAC;CACpD;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,sFAAsF;IACtF,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,4BAA4B,CAC1C,MAAM,EAAE,aAAa,EACrB,SAAS,EAAE,aAAa,GAAG,SAAS,GACnC,SAAS,kBAAkB,EAAE,CAqB/B;AAED,8DAA8D;AAC9D,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IAC5C,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAC;IACzD;;;;;;OAMG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE;QACnB,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;QAClC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;QAC7B,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;KACrC,CAAC;CACH;AAED;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,oBAAoB,EAAE,WAAW,CAAC,MAAM,CAAqB,CAAC;AAsB3E;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,aAAa,EACrB,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAAC,GACrC,WAAW,CAAC,WAAW,CAAC,CAkD1B;AAED;;;;;;;;GAQG;AACH,wBAAgB,kCAAkC,CAAC,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,GAAG,OAAO,CAE1F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE;IACxC,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,kBAAkB,EAAE,CAAC;CAC1D,GAAG,aAAa,CAYhB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,iBAAiB,EAC1B,MAAM,EAAE,aAAa,EACrB,iBAAiB,EAAE,WAAW,CAAC,MAAM,CAAC,GACrC,WAAW,CAAC,WAAW,CAAC,CAY1B;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,SAAS,WAAW,CAAC,WAAW,CAAC,EAAE,GAAG,WAAW,CAAC,WAAW,CAAC,CAW5G"}

package/dist/atlas/derive-evidence.js

@@ -114,6 +114,8 @@ export function counterexamplesWithRejection(record, rejection) {
  * exactly the decision that must never be implicit.
  */
 export const NO_PASSING_WITNESSES = new Set();
+/** The axiom Lean 4 records for a proof that contains `sorry`. */
+const SORRY_AXIOM = 'sorryAx';
 /** The fields `Conventions` may declare. Kept in one place so the check is total. */
 const CONVENTION_FIELDS = [
     'heatWorkSign',
@@ -154,8 +156,11 @@ export function deriveEvidence(record, passingWitnessIds) {
     // records a reference without earning a tag — a proof of the wrong statement
     // proves nothing. A property and a cross-check earn their own labels and do
     // not count as a proved bridge. A reduction, a limit, and a derivation-step
-    // earn neither.
-    if (record.formalRef !== undefined && record.formalRef.fidelity !== 'unreviewed') {
+    // earn neither. A proof resting on `sorryAx` is a hole, not a proof, and
+    // earns none of the three whatever its fidelity says.
+    if (record.formalRef !== undefined &&
+        record.formalRef.fidelity !== 'unreviewed' &&
+        !(record.formalRef.axioms ?? []).includes(SORRY_AXIOM)) {
         if (record.formalRef.kind === 'bridge')
             tags.add('formally-proved');
         else if (record.formalRef.kind === 'property')

package/dist/atlas/derive-evidence.js.map

@@ -1 +1 @@
-{"version":3,"file":"derive-evidence.js","sourceRoot":"","sources":["../../src/atlas/derive-evidence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAoE3D;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,4BAA4B,CAC1C,MAAqB,EACrB,SAAoC;IAEpC,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,IAAI,EAAE,CAAC;IACzC,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACxC,4EAA4E;IAC5E,iFAAiF;IACjF,8EAA8E;IAC9E,2EAA2E;IAC3E,yEAAyE;IACzE,2EAA2E;IAC3E,6DAA6D;IAC7D,MAAM,GAAG,GAAG,aAAa,SAAS,CAAC,IAAI,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAC3B,OAAO,CAAC,CAAC,QAAQ,CAAC,+BAA+B,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IACH,IAAI,aAAa;QAAE,OAAO,GAAG,CAAC;IAC9B,OAAO;QACL,GAAG,GAAG;QACN,EAAE,WAAW,EAAE,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,SAAS,CAAC,IAAI,EAAE,EAAE;KAC1E,CAAC;AACJ,CAAC;AAgBD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAwB,IAAI,GAAG,EAAU,CAAC;AAE3E,qFAAqF;AACrF,MAAM,iBAAiB,GAAG;IACxB,cAAc;IACd,iBAAiB;IACjB,sBAAsB;IACtB,YAAY;IACZ,qBAAqB;CAC4B,CAAC;AAEpD,+FAA+F;AAC/F,SAAS,wBAAwB,CAC/B,WAAoC;IAEpC,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzC,OAAO,iBAAiB,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAqB,EACrB,iBAAsC;IAEtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAe,CAAC;IAEpC,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpF,oEAAoE;IACpE,wEAAwE;IACxE,6EAA6E;IAC7E,8EAA8E;IAC9E,qEAAqE;IACrE,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACjF,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;IAEjF,2EAA2E;IAC3E,6EAA6E;IAC7E,4EAA4E;IAC5E,4EAA4E;IAC5E,gBAAgB;IAChB,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC;QACjF,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;aAC/D,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,KAAK,UAAU;YAAE,IAAI,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;aAC/E,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,KAAK,aAAa;YAAE,IAAI,CAAC,GAAG,CAAC,6BAA6B,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;IAEjF,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,wBAAwB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC9D,IACE,QAAQ,CAAC,MAAM,GAAG,CAAC;QACnB,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAClF,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IACjC,CAAC;IAED,oDAAoD;IACpD,IACE,CAAC,MAAM,CAAC,eAAe,IAAI,EAAE,CAAC,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,KAAK,EAAE,CACzD,EACD,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC1C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kCAAkC,CAAC,IAA8B;IAC/E,OAAO,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;AACjE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAIpC;IACC,MAAM,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9E,MAAM,YAAY,GAChB,SAAS,KAAK,SAAS;QACvB,SAAS,CAAC,MAAM,KAAK,cAAc;QACnC,SAAS,CAAC,QAAQ,KAAK,YAAY;QACnC,SAAS,CAAC,IAAI,KAAK,QAAQ,CAAC;IAC9B,OAAO;QACL,GAAG,CAAC,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,GAAG,CAAC,GAAG,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACvC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,MAAM,UAAU,wBAAwB,CACtC,OAA0B,EAC1B,MAAqB,EACrB,iBAAsC;IAEtC,QAAQ,OAAO,EAAE,CAAC;QAChB,0EAA0E;QAC1E,4EAA4E;QAC5E,mEAAmE;QACnE,KAAK,cAAc;YACjB,OAAO,cAAc,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnD,KAAK,eAAe;YAClB,OAAO,IAAI,GAAG,CAAc,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5C,KAAK,QAAQ;YACX,OAAO,cAAc,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAA0C;IAChF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAAC,4EAA4E,CAAC,CAAC;IACrG,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAA2B,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,UAAU,IAAI,CAAC,KAAK,cAAc,CAAC,CAAC;IACjH,IAAI,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAc,MAAM,CAAC,CAAC;IAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACvE,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC;AACd,CAAC"}
+{"version":3,"file":"derive-evidence.js","sourceRoot":"","sources":["../../src/atlas/derive-evidence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAoE3D;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,4BAA4B,CAC1C,MAAqB,EACrB,SAAoC;IAEpC,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,IAAI,EAAE,CAAC;IACzC,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACxC,4EAA4E;IAC5E,iFAAiF;IACjF,8EAA8E;IAC9E,2EAA2E;IAC3E,yEAAyE;IACzE,2EAA2E;IAC3E,6DAA6D;IAC7D,MAAM,GAAG,GAAG,aAAa,SAAS,CAAC,IAAI,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAC3B,OAAO,CAAC,CAAC,QAAQ,CAAC,+BAA+B,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IACH,IAAI,aAAa;QAAE,OAAO,GAAG,CAAC;IAC9B,OAAO;QACL,GAAG,GAAG;QACN,EAAE,WAAW,EAAE,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,SAAS,CAAC,IAAI,EAAE,EAAE;KAC1E,CAAC;AACJ,CAAC;AAqBD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAwB,IAAI,GAAG,EAAU,CAAC;AAE3E,kEAAkE;AAClE,MAAM,WAAW,GAAG,SAAS,CAAC;AAE9B,qFAAqF;AACrF,MAAM,iBAAiB,GAAG;IACxB,cAAc;IACd,iBAAiB;IACjB,sBAAsB;IACtB,YAAY;IACZ,qBAAqB;CAC4B,CAAC;AAEpD,+FAA+F;AAC/F,SAAS,wBAAwB,CAC/B,WAAoC;IAEpC,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzC,OAAO,iBAAiB,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAqB,EACrB,iBAAsC;IAEtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAe,CAAC;IAEpC,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpF,oEAAoE;IACpE,wEAAwE;IACxE,6EAA6E;IAC7E,8EAA8E;IAC9E,qEAAqE;IACrE,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACjF,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;IAEjF,2EAA2E;IAC3E,6EAA6E;IAC7E,4EAA4E;IAC5E,4EAA4E;IAC5E,yEAAyE;IACzE,sDAAsD;IACtD,IACE,MAAM,CAAC,SAAS,KAAK,SAAS;QAC9B,MAAM,CAAC,SAAS,CAAC,QAAQ,KAAK,YAAY;QAC1C,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,EACtD,CAAC;QACD,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;aAC/D,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,KAAK,UAAU;YAAE,IAAI,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC;aAC/E,IAAI,MAAM,CAAC,SAAS,CAAC,IAAI,KAAK,aAAa;YAAE,IAAI,CAAC,GAAG,CAAC,6BAA6B,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;IAEjF,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,wBAAwB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC9D,IACE,QAAQ,CAAC,MAAM,GAAG,CAAC;QACnB,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAClF,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC;IACjC,CAAC;IAED,oDAAoD;IACpD,IACE,CAAC,MAAM,CAAC,eAAe,IAAI,EAAE,CAAC,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,KAAK,EAAE,CACzD,EACD,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC1C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kCAAkC,CAAC,IAA8B;IAC/E,OAAO,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;AACjE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAIpC;IACC,MAAM,SAAS,GAAG,GAAG,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9E,MAAM,YAAY,GAChB,SAAS,KAAK,SAAS;QACvB,SAAS,CAAC,MAAM,KAAK,cAAc;QACnC,SAAS,CAAC,QAAQ,KAAK,YAAY;QACnC,SAAS,CAAC,IAAI,KAAK,QAAQ,CAAC;IAC9B,OAAO;QACL,GAAG,CAAC,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,GAAG,CAAC,GAAG,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACvC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,MAAM,UAAU,wBAAwB,CACtC,OAA0B,EAC1B,MAAqB,EACrB,iBAAsC;IAEtC,QAAQ,OAAO,EAAE,CAAC;QAChB,0EAA0E;QAC1E,4EAA4E;QAC5E,mEAAmE;QACnE,KAAK,cAAc;YACjB,OAAO,cAAc,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnD,KAAK,eAAe;YAClB,OAAO,IAAI,GAAG,CAAc,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5C,KAAK,QAAQ;YACX,OAAO,cAAc,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAA0C;IAChF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAAC,4EAA4E,CAAC,CAAC;IACrG,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAA2B,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,UAAU,IAAI,CAAC,KAAK,cAAc,CAAC,CAAC;IACjH,IAAI,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAc,MAAM,CAAC,CAAC;IAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACvE,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["/**\n * Atlas Phase 1, S1.3 — evidence tags, DERIVED AT READ TIME.\n *\n * Design note: `docs/planning/Atlas-Phase-1-Design.md` §3 and §4.\n *\n * **The contract of this module: it has no write path.** No record stores an\n * evidence set; every tag is computed from the artifacts a record actually\n * carries, each time it is asked for. A tag is emitted ONLY when the artifact\n * it names is present and passing. There is no default-true tag, no tag\n * derived from another tag, no tag derived from `reviewStatus`, and no tag\n * derived from prose. A record carrying no passing witness derives exactly\n * `{'proposed'}`.\n *\n * ## The empty-set trap (design note §3, Adam A1 RED — confirmed by execution)\n *\n * `convention-checked` is the ONLY rule in the table whose quantifier is\n * universal (`every`). Written as \"`conventions` is present AND every declared\n * field is consumed by a witness\", it hands the tag to a record with ZERO\n * witnesses, because `conventions = {}` declares nothing and `[].every(…)` is\n * vacuously true. {@link deriveEvidence} therefore requires a NON-EMPTY\n * declaration before the universal runs, and\n * `tests/atlas/derive-evidence.test.ts` pins the empty-object case.\n *\n * **The general rule, for anything added here later:** a universal quantifier\n * in a tag derivation must be paired with a non-emptiness check, or the tag is\n * free. The other rules are existentials (`some`), which are false on the\n * empty set and therefore safe.\n *\n * ## What \"passing\" means, and why the caller supplies it\n *\n * `Witness` records an id and the test file that runs it; nothing on the\n * record says whether that test passed. Proving it is a filesystem act (see\n * `tests/atlas/evidence-rule.test.ts`, which matches witness ids against test\n * titles), and this module is pure. So the set of passing witness ids is an\n * ARGUMENT, and it is REQUIRED — {@link NO_PASSING_WITNESSES} must be passed\n * explicitly when nothing is verified.\n *\n * It used to DEFAULT to empty, which sounds conservative and was in fact a\n * defect (Eve E1 RED, confirmed by execution). Defaulting the other way, to\n * \"all\", would have been the free-tag defect above in a second location — but\n * defaulting to empty created the mirror-image failure: a forgotten argument\n * produced an answer identical to a real negative. A catalog-wide check written\n * that way could only ever report \"no row gains evidence\", whatever the rows\n * held, so it could not fail. Requiring the argument makes a vacuous result a\n * STATED choice, and `tests/atlas/coverage.test.ts` now carries a positive\n * control so that a negative result carries information.\n *\n * @module atlas/derive-evidence\n * @internal\n */\n\nimport type { Conventions, EvidenceTag, FormalFidelity, FormalRefKind } from './types.js';\nimport { catalogFormalRef } from './catalog-formal-ref.js';\n\n/**\n * The verdict of `adjudicateBridgeEntry` (`src/bridges/membership.ts`),\n * restated structurally so this module takes no dependency on `src/bridges`\n * (the dependency must run one way — design note §1).\n *\n * `tests/atlas/derive-evidence.test.ts` pins this union against the real\n * `BridgeVerdict` at compile time AND at runtime over the live catalog, so a\n * fourth verdict fails the test rather than silently falling through.\n *\n * @internal\n */\nexport type MembershipVerdict = 'bridge' | 'not-a-bridge' | 'unadjudicated';\n\n/**\n * A witness as this derivation reads it.\n *\n * Structural, not an import of `Witness`, for two reasons that are findings in\n * their own right (both reported to the Lead):\n *\n *  - `Witness.kind` is `'symbolic' | 'numeric' | 'formal'` — there is NO\n *    `'dimensional'` member, so `dimension-checked` has no source on today's\n *    data. The kind is widened here to include `'dimensional'` so the rule is\n *    written once and correctly; it simply never fires until such a witness\n *    exists. Widening it is not inventing evidence: no record carries one.\n *  - `Witness` records no list of the convention fields a check consumes, so\n *    `consumes` is optional here. Absent ⇒ the witness consumes nothing ⇒\n *    `convention-checked` cannot be earned. Conservative by construction.\n *\n * @internal\n */\nexport interface WitnessLike {\n  readonly id: string;\n  readonly kind: 'symbolic' | 'numeric' | 'formal' | 'dimensional';\n  /** Convention fields this check actually consumes, when it declares any. */\n  readonly consumes?: readonly (keyof Conventions)[];\n}\n\n/**\n * A counterexample as this derivation reads it.\n *\n * `Counterexample` (`src/atlas/types.ts`) carries `description` and `witness`\n * and has NO `resolvedBy` field — so on today's data every counterexample is\n * unresolved. `resolvedBy` is read here as an optional property rather than\n * assumed absent, so that adding it later resolves counterexamples without\n * touching this file. This module adds no field to any type.\n *\n * @internal\n */\nexport interface CounterexampleLike {\n  readonly description?: string;\n  readonly witness?: string;\n  /** Present and non-empty ⇒ the counterexample is resolved and does not contradict. */\n  readonly resolvedBy?: string;\n}\n\n/**\n * A rejection as this projection reads it — structural, so this module still\n * imports nothing from `src/bridges`.\n *\n * @internal\n */\nexport interface RejectionLike {\n  readonly beId: number;\n  readonly reason: string;\n}\n\n/**\n * A row's counterexamples INCLUDING the one its rejection constitutes.\n *\n * ROADMAP §7 Phase 1 asks for \"a `RejectedBridgeAdjudication` ⇒ `contradicted`\n * with the counterexample LINKED\". The linking half is what matters and was\n * missing: BE-35 had a counterexample written by hand and earned `contradicted`\n * honestly, while BE-28, BE-29, BE-32 and BE-40 had none — and an earlier rule\n * papered over that by FORCING `contradicted` onto every rejected row, which\n * manufactured a refutation from nothing (Eve E1).\n *\n * This is the linking done properly. The rejection's own `reason` IS the\n * counterexample: a row rejected for being single-regime is refuted AS A BRIDGE\n * by exactly that argument. Projecting it means `contradicted` is then EARNED\n * through the ordinary derivation rather than asserted by a special case.\n *\n * **It is a projection, not a copy.** The reason string is never duplicated into\n * a catalog row; `bridges/rejected.ts` remains its single source, which is what\n * the ROADMAP means by \"cross-linked ... rather than duplicating it\". The caller\n * supplies the rejection, so this module still owns no view of WHICH ids are\n * rejected.\n *\n * @internal\n */\nexport function counterexamplesWithRejection(\n  record: EvidenceInput,\n  rejection: RejectionLike | undefined,\n): readonly CounterexampleLike[] {\n  const own = record.counterexamples ?? [];\n  if (rejection === undefined) return own;\n  // Do not double-count. A row may ALREADY cite the rejection by hand — BE-35\n  // does, with `witness: 'src/bridges/rejected.ts - REJECTED_BRIDGE_ADJUDICATIONS,\n  // beId 35'`. My first predicate matched only the machine key `rejection:<id>`\n  // and so missed it, appending the SAME argument a second time in different\n  // words, which is exactly the duplication the ROADMAP says to avoid. The\n  // predicate therefore accepts either form: the machine key, or any witness\n  // that names the rejection registry together with this beId.\n  const key = `rejection:${rejection.beId}`;\n  const alreadyLinked = own.some((c) => {\n    const w = c.witness ?? '';\n    if (w === key) return true;\n    return w.includes('REJECTED_BRIDGE_ADJUDICATIONS') && w.includes(String(rejection.beId));\n  });\n  if (alreadyLinked) return own;\n  return [\n    ...own,\n    { description: rejection.reason, witness: `rejection:${rejection.beId}` },\n  ];\n}\n\n/** The artifacts a record carries, all optional. @internal */\nexport interface EvidenceInput {\n  readonly witnesses?: readonly WitnessLike[];\n  readonly conventions?: Conventions;\n  readonly counterexamples?: readonly CounterexampleLike[];\n  /**\n   * The record's formal reference, read for its fidelity, its kind, and its\n   * axioms. Structural so a caller can pass an `AtlasBridge` directly. A\n   * missing kind cannot be supplied by this function: only `'bridge'` derives\n   * `formally-proved`. An axiom list naming `sorryAx` is a proof with a hole\n   * (Lean exits 0 on `sorry`; TOOLS.md) and derives no proof label.\n   */\n  readonly formalRef?: {\n    readonly fidelity: FormalFidelity;\n    readonly kind: FormalRefKind;\n    readonly axioms?: readonly string[];\n  };\n}\n\n/**\n * The empty passing set, for a caller that genuinely has nothing marked passing.\n *\n * ⚠ This is EXPORTED and must be passed EXPLICITLY. It used to be a default\n * parameter value, and that was a defect found by post-implementation review\n * (Eve, E1) and confirmed by execution: a record carrying three passing\n * witnesses and a consumed convention derived `{'proposed'}` under the default —\n * byte-identical to an empty record. A caller who simply forgot the argument got\n * an answer indistinguishable from a real negative.\n *\n * That made a catalog-wide check VACUOUS rather than reassuring. \"No row gains\n * evidence\" was the only outcome the call could produce, whatever the rows\n * contained, so the check could not fail and proved nothing. Requiring the\n * argument forces the caller to STATE which witnesses were verified, which is\n * exactly the decision that must never be implicit.\n */\nexport const NO_PASSING_WITNESSES: ReadonlySet<string> = new Set<string>();\n\n/** The axiom Lean 4 records for a proof that contains `sorry`. */\nconst SORRY_AXIOM = 'sorryAx';\n\n/** The fields `Conventions` may declare. Kept in one place so the check is total. */\nconst CONVENTION_FIELDS = [\n  'heatWorkSign',\n  'metricSignature',\n  'fourierNormalization',\n  'unitSystem',\n  'capacitorChargeSign',\n] as const satisfies readonly (keyof Conventions)[];\n\n/** The convention fields a record actually declares (a `undefined` value declares nothing). */\nfunction declaredConventionFields(\n  conventions: Conventions | undefined,\n): readonly (keyof Conventions)[] {\n  if (conventions === undefined) return [];\n  return CONVENTION_FIELDS.filter((field) => conventions[field] !== undefined);\n}\n\n/**\n * Derive the evidence set of one record.\n *\n * @param record - the artifacts the record carries.\n * @param passingWitnessIds - ids of witnesses VERIFIED to pass. REQUIRED: pass\n * {@link NO_PASSING_WITNESSES} explicitly when nothing is verified, so that a\n * vacuous result is a stated choice rather than a forgotten argument.\n * @returns a fresh set; never cached, never stored.\n * @internal\n */\nexport function deriveEvidence(\n  record: EvidenceInput,\n  passingWitnessIds: ReadonlySet<string>,\n): ReadonlySet<EvidenceTag> {\n  const tags = new Set<EvidenceTag>();\n\n  const passing = (record.witnesses ?? []).filter((w) => passingWitnessIds.has(w.id));\n\n  // Existentials over the passing witnesses — false on the empty set.\n  // `symbolically-checked` has exactly ONE derivation: a passing symbolic\n  // witness. Which symbolic witnesses pass is DEFINED by the committed results\n  // artifact (`data/atlas/witness-results.json`, Phase 4 §3) — the caller feeds\n  // it in through `passingWitnessIds` via `artifactPassingWitnessIds`.\n  if (passing.some((w) => w.kind === 'dimensional')) tags.add('dimension-checked');\n  if (passing.some((w) => w.kind === 'symbolic')) tags.add('symbolically-checked');\n\n  // `formally-proved` iff the reference is a reviewed bridge. `'unreviewed'`\n  // records a reference without earning a tag — a proof of the wrong statement\n  // proves nothing. A property and a cross-check earn their own labels and do\n  // not count as a proved bridge. A reduction, a limit, and a derivation-step\n  // earn neither. A proof resting on `sorryAx` is a hole, not a proof, and\n  // earns none of the three whatever its fidelity says.\n  if (\n    record.formalRef !== undefined &&\n    record.formalRef.fidelity !== 'unreviewed' &&\n    !(record.formalRef.axioms ?? []).includes(SORRY_AXIOM)\n  ) {\n    if (record.formalRef.kind === 'bridge') tags.add('formally-proved');\n    else if (record.formalRef.kind === 'property') tags.add('formally-proved-property');\n    else if (record.formalRef.kind === 'cross-check') tags.add('formally-proved-cross-check');\n  }\n  if (passing.some((w) => w.kind === 'numeric')) tags.add('numerically-supported');\n\n  // The ONE universal in the table — guarded by non-emptiness. See §3 above.\n  const declared = declaredConventionFields(record.conventions);\n  if (\n    declared.length > 0 &&\n    declared.every((field) => passing.some((w) => (w.consumes ?? []).includes(field)))\n  ) {\n    tags.add('convention-checked');\n  }\n\n  // Existential: a counterexample with no resolution.\n  if (\n    (record.counterexamples ?? []).some(\n      (c) => c.resolvedBy === undefined || c.resolvedBy === '',\n    )\n  ) {\n    tags.add('contradicted');\n  }\n\n  if (tags.size === 0) tags.add('proposed');\n  return tags;\n}\n\n/**\n * A reviewed bridge whose delimiting counterexample is still unresolved.\n *\n * Both tags stay. This does not clear the counterexample and it does not\n * remove `formally-proved`. Callers that print only the proof tag hide the\n * other one; this is the flag that names the pair.\n *\n * @internal\n */\nexport function provedWithUnresolvedCounterexample(tags: ReadonlySet<EvidenceTag>): boolean {\n  return tags.has('formally-proved') && tags.has('contradicted');\n}\n\n/**\n * The artifacts a catalog row may be judged on.\n *\n * A manifest-checked `lean4-physjs` reference of kind `bridge` is included.\n * {@link deriveEvidence} then lights `formally-proved`. A reduction, a limit,\n * a derivation-step, a property, and a cross-check are left off this input,\n * so those rows keep the grade they had. An unadjudicated verdict still\n * returns `proposed` and does not read this reference.\n *\n * @internal\n */\nexport function catalogEvidenceInput(row: {\n  readonly id?: number;\n  readonly conventions?: Conventions;\n  readonly counterexamples?: readonly CounterexampleLike[];\n}): EvidenceInput {\n  const formalRef = row.id === undefined ? undefined : catalogFormalRef(row.id);\n  const provedBridge =\n    formalRef !== undefined &&\n    formalRef.system === 'lean4-physjs' &&\n    formalRef.fidelity !== 'unreviewed' &&\n    formalRef.kind === 'bridge';\n  return {\n    ...(row.conventions !== undefined ? { conventions: row.conventions } : {}),\n    ...(row.counterexamples !== undefined ? { counterexamples: row.counterexamples } : {}),\n    ...(provedBridge ? { formalRef } : {}),\n  };\n}\n\n/**\n * Derive the evidence set of a catalog row, under the adjudication precedence\n * of design note §4. The verdict is supplied by the caller — it comes from\n * `adjudicateBridgeEntry`, which owns the rejected-id registry\n * (`REJECTED_BRIDGE_IDS`). Reading that registry here would make this file a\n * second source of truth about which ids are rejected.\n *\n * | Verdict | Derives |\n * |---|---|\n * | `'not-a-bridge'` | {@link deriveEvidence} runs normally — see below |\n * | `'unadjudicated'` | `{'proposed'}` only — never a refutation, never support |\n * | `'bridge'` | {@link deriveEvidence} runs normally |\n *\n * ## ⚠ `'not-a-bridge'` no longer forces `'contradicted'` (Eve E1, 2026-09-21)\n *\n * It used to, \"regardless of witnesses\", and that rule — written by me in design\n * note §4 — **violated §3 of the same document.** `contradicted` means THE CLAIM\n * IS REFUTED. `not-a-bridge` means THE ROW IS NOT A REGIME-CROSSING BRIDGE.\n * Those are different assertions about different things, and conflating them made\n * the library report BE-35 as `status: 'established'` and `evidence:\n * {'contradicted'}` in the same breath — from which a reader cannot tell whether\n * the equation is a true in-regime identity the bridge graph ignores, or a\n * refuted statement.\n *\n * Measured when the rule was removed: of the five rejected rows, only **BE-35**\n * carries an actual counterexample, and it derives `{'contradicted'}` NATURALLY\n * through the normal path. **BE-28, BE-29, BE-32 and BE-40 carry none** — the old\n * rule was manufacturing a refutation for four rows with no refuting artifact\n * whatsoever. That is exactly what §3 forbids: a tag is emitted only when the\n * artifact it names is present and passing.\n *\n * Membership already has a single owner — `adjudicateBridgeEntry` — and it does\n * not need restating in the evidence vocabulary. Removing the case leaves each\n * fact with exactly one source, which is what §4 was trying to achieve and this\n * rule was quietly undermining.\n *\n * @internal\n */\nexport function deriveEvidenceForVerdict(\n  verdict: MembershipVerdict,\n  record: EvidenceInput,\n  passingWitnessIds: ReadonlySet<string>,\n): ReadonlySet<EvidenceTag> {\n  switch (verdict) {\n    // 'not-a-bridge' falls through to the normal derivation on purpose: a row\n    // is refuted by a COUNTEREXAMPLE, not by failing a membership test. See the\n    // block comment above for the measurement that forced this change.\n    case 'not-a-bridge':\n      return deriveEvidence(record, passingWitnessIds);\n    case 'unadjudicated':\n      return new Set<EvidenceTag>(['proposed']);\n    case 'bridge':\n      return deriveEvidence(record, passingWitnessIds);\n  }\n}\n\n/**\n * The evidence set of a COMPOSITE claim, derived from its parts' sets: every\n * step of a route and every norm transport it applied\n * (`docs/planning/ADR-transported-norm-composition.md` §4).\n *\n * - A positive tag survives only if EVERY part carries it: a chain is never\n *   better supported than its weakest link, so the composite is the\n *   intersection. `formally-proved` therefore needs a proof of every part; a\n *   transport declaration's set holds at most its numeric or symbolic basis, so\n *   no route through one is formally proved.\n * - `contradicted` survives if ANY part carries it: a refuted part refutes the\n *   chain that rests on it.\n * - With no positive tag left, the composite is `{'proposed'}` (plus\n *   `contradicted` when present). An unwitnessed declaration contributes\n *   `{'proposed'}` and so caps the composite there.\n *\n * @throws RangeError on no parts: a composite of nothing has no evidence to state.\n * @internal\n */\nexport function deriveCompositeEvidence(parts: readonly ReadonlySet<EvidenceTag>[]): ReadonlySet<EvidenceTag> {\n  if (parts.length === 0) {\n    throw new RangeError('deriveCompositeEvidence: a composite of no parts has no evidence to derive');\n  }\n  const positive = (s: ReadonlySet<EvidenceTag>) => [...s].filter((t) => t !== 'proposed' && t !== 'contradicted');\n  let common = new Set(positive(parts[0]!));\n  for (const part of parts.slice(1)) common = new Set(positive(part).filter((t) => common.has(t)));\n  const tags = new Set<EvidenceTag>(common);\n  if (parts.some((p) => p.has('contradicted'))) tags.add('contradicted');\n  if (common.size === 0) tags.add('proposed');\n  return tags;\n}\n"]}

package/dist/atlas/diffusion/bridges-closure.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bridges-closure.d.ts","sourceRoot":"","sources":["../../../src/atlas/diffusion/bridges-closure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAOH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAS/C,iGAAiG;AACjG,eAAO,MAAM,sBAAsB,OAAO,CAAC;AAE3C,iEAAiE;AACjE,eAAO,MAAM,sBAAsB,OAAO,CAAC;AAE3C,+DAA+D;AAC/D,eAAO,MAAM,sBAAsB,KAAK,CAAC;AAEzC,sEAAsE;AACtE,eAAO,MAAM,kBAAkB,IAAI,CAAC;AAwBpC,kFAAkF;AAClF,eAAO,MAAM,yBAAyB,EAAE,WA0DvC,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,EAAE,WA6DpC,CAAC;AAEF;;;;;;;;;GASG;AACH,eAAO,MAAM,0BAA0B,EAAE,WA2ExC,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,EAAE,WAmDnC,CAAC;AAEF,sEAAsE;AACtE,eAAO,MAAM,mBAAmB,EAAE,WAsCjC,CAAC;AAEF,sDAAsD;AACtD,eAAO,MAAM,yBAAyB,EAAE,SAAS,WAAW,EAM3D,CAAC"}
+{"version":3,"file":"bridges-closure.d.ts","sourceRoot":"","sources":["../../../src/atlas/diffusion/bridges-closure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAOH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAS/C,iGAAiG;AACjG,eAAO,MAAM,sBAAsB,OAAO,CAAC;AAE3C,iEAAiE;AACjE,eAAO,MAAM,sBAAsB,OAAO,CAAC;AAE3C,+DAA+D;AAC/D,eAAO,MAAM,sBAAsB,KAAK,CAAC;AAEzC,sEAAsE;AACtE,eAAO,MAAM,kBAAkB,IAAI,CAAC;AAwBpC,kFAAkF;AAClF,eAAO,MAAM,yBAAyB,EAAE,WAyDvC,CAAC;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,EAAE,WA4DpC,CAAC;AAEF;;;;;;;;;GASG;AACH,eAAO,MAAM,0BAA0B,EAAE,WA0ExC,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,EAAE,WAkDnC,CAAC;AAEF,sEAAsE;AACtE,eAAO,MAAM,mBAAmB,EAAE,WAqCjC,CAAC;AAEF,sDAAsD;AACtD,eAAO,MAAM,yBAAyB,EAAE,SAAS,WAAW,EAM3D,CAAC"}

package/dist/atlas/diffusion/bridges-closure.js

@@ -84,7 +84,6 @@ export const BRIDGE_LANGEVIN_DIFFUSION = {
             witness: 'WD4b',
         },
     ],
-    evidence: new Set(['proposed', 'numerically-supported']),
     witnesses: [
         {
             id: 'WD4',
@@ -148,7 +147,6 @@ export const BRIDGE_STOKES_EINSTEIN = {
         },
     ]),
     counterexamples: [],
-    evidence: new Set(['proposed', 'numerically-supported']),
     witnesses: [
         {
             id: 'WD5',
@@ -231,7 +229,6 @@ export const BRIDGE_TELEGRAPH_DIFFUSION = {
             witness: 'WD6b',
         },
     ],
-    evidence: new Set(['proposed', 'numerically-supported']),
     witnesses: [
         {
             id: 'WD6',
@@ -293,7 +290,6 @@ export const BRIDGE_TELEGRAPH_WAVE = {
         { name: 'c', dim: VELOCITY },
     ], [{ group: 'tau · D · q^2', op: '>=', bound: TELEGRAPH_WAVE_MIN_EPS, alias: 'ε = τDq² ≥ 25' }]),
     counterexamples: [],
-    evidence: new Set(['proposed', 'numerically-supported']),
     witnesses: [
         {
             id: 'WD7',
@@ -331,7 +327,6 @@ export const BRIDGE_HEAT_LAPLACE = {
         },
     ]),
     counterexamples: [],
-    evidence: new Set(['proposed', 'numerically-supported']),
     witnesses: [
         {
             id: 'WD8',