crypto-aio 0.0.3 → 0.2.0

package/dist/core/observe/scanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scanner.js","sourceRoot":"","sources":["../../../src/core/observe/scanner.ts"],"names":[],"mappings":";;;AAAA,mDAAoF;AAEpF,2CAA4E;AAK5E,wDAA4E;AAE5E,yCAA6C;AAkF7C,MAAM,YAAY,GAAG,CAAC,KAAc,EAAW,EAAE,CAC/C,OAAO,KAAK,KAAK,QAAQ;IACvB,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;IAClB,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,OAAQ,KAAgC,CAAC,QAAQ,KAAK,QAAQ;QAC9D,OAAQ,KAAgC,CAAC,QAAQ,KAAK,QAAQ,CAAC;AAErE,SAAS,YAAY,CAAC,MAAgC,EAAE,OAA6B;IACnF,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO;IACjC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;QAC/C,MAAM,OAAO,CAAC,0BAA0B,CAAC,CAAC;IAC5C,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IACrC,IACE,SAAS,KAAK,SAAS;QACvB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;QAE7E,MAAM,OAAO,CAAC,sDAAsD,CAAC,CAAC;IACxE,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACjF,MAAM,OAAO,CAAC,2DAA2D,CAAC,CAAC;AAC/E,CAAC;AAED,SAAS,aAAa,CAAC,OAAuB;IAC5C,MAAM,OAAO,GAAG,CAAC,OAAe,EAAE,EAAE,CAClC,IAAI,mBAAW,CAAC,gBAAgB,EAAE,WAAW,OAAO,EAAE,CAAC,CAAC;IAC1D,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,OAAO,CAAC;IACvE,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACtC,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QACzD,MAAM,OAAO,CAAC,sCAAsC,CAAC,CAAC;IACxD,IAAI,CAAC,IAAA,oBAAY,EAAC,SAAS,CAAC;QAC1B,MAAM,OAAO,CAAC,mDAAmD,CAAC,CAAC;IACrE,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,GAAG,EAAE,CAAC;QACpF,MAAM,OAAO,CAAC,uDAAuD,CAAC,CAAC;IACzE,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,MAAM;QAC3D,MAAM,OAAO,CAAC,gCAAgC,CAAC,CAAC;IAClD,IACE,WAAW,KAAK,SAAS;QACzB,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC,CAAC;QAEvD,MAAM,OAAO,CAAC,wCAAwC,CAAC,CAAC;IAC1D,IACE,cAAc,KAAK,SAAS;QAC5B,CAAC,OAAO,cAAc,KAAK,QAAQ;YACjC,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC;YAChC,cAAc,IAAI,CAAC,CAAC;QAEtB,MAAM,OAAO,CAAC,uDAAuD,CAAC,CAAC;AAC3E,CAAC;AAED,oFAAoF;AACpF,SAAS,QAAQ,CAAC,MAAkB;IAClC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC;IACzE,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,UAAU,CAAC,CAAa,EAAE,CAAa;IAC9C,OAAO,CACL,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QACrB,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QACjB,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM;QACnC,CAAC,CAAC,MAAM,CAAC,KAAK,CACZ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAC3E,CACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAa,OAAO;IAEC;IACA;IAFnB,YACmB,IAAiB,EACjB,OAAuB;QADvB,SAAI,GAAJ,IAAI,CAAa;QACjB,YAAO,GAAP,OAAO,CAAgB;QAExC,aAAa,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IAEO,KAAK,CAAC,CAAC,GAAG;QAChB,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;QAChC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;QACrC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACzF,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;QAC1E,uFAAuF;QACvF,IAAI,MAA0B,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC;QAC9E,MAAM,GAAG,GAAG,GAAG,EAAE,CACf,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,OAAO;YAC3B,CAAC,CAAC,MAAM,CAAC,kBAAkB,EAAE;YAC7B,CAAC,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,OAAO,GAAG,MAAM,EAAE,OAAO,IAAI,IAAI,CAAC;QACtC,IAAI,MAAM,GAAG,MAAM,EAAE,MAAM,CAAC;QAC5B,0FAA0F;QAC1F,IAAI,SAAS,GAAG,MAAM,KAAK,IAAI,CAAC;QAChC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;YACxB,IAAI,IAAsB,CAAC;YAC3B,IAAI,CAAC;gBACH,MAAM,KAAK;oBACT,OAAO;oBACP,MAAM;oBACN,SAAS;oBACT,MAAM;oBACN,MAAM,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;iBACvC,CAAC;gBACF,MAAM,KAAK,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;gBACzD,IAAI,MAAM,EAAE,CAAC;oBACX,IAAI,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;oBAChF,IAAI,CAAC,SAAS,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;wBAC1C,2EAA2E;wBAC3E,kEAAkE;wBAClE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC3D,IAAI,MAAM;4BAAE,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,CAAC;;4BACtC,OAAO,GAAG,SAAS,CAAC;oBAC3B,CAAC;oBACD,SAAS,GAAG,OAAO,KAAK,SAAS,CAAC;oBAClC,IAAI;wBACF,OAAO,KAAK,WAAW;4BACrB,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;4BACnD,CAAC,CAAC,OAAO,CAAC;gBAChB,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,0EAA0E;gBAC1E,IAAI,MAAM,EAAE,OAAO;oBAAE,OAAO;gBAC5B,IAAI,CAAC,IAAA,wBAAgB,EAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS;oBAAE,MAAM,KAAK,CAAC;YAChE,CAAC;YACD,IAAI,MAAM,EAAE,OAAO;gBAAE,OAAO;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC5C,CAAC;gBAAC,MAAM,CAAC;oBACP,OAAO;gBACT,CAAC;gBACD,SAAS;YACX,CAAC;YACD,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;YAC7B,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,IAAI,MAAiC,CAAC;YACtC,yEAAyE;YACzE,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,MAAM,YAAY,GAAG,KAAK,IAAmB,EAAE;gBAC7C,IAAI,CAAC;oBACH,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC5D,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,MAAM,QAAQ,GAAG,IAAA,wBAAgB,EAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;oBAC7D,mFAAmF;oBACnF,2EAA2E;oBAC3E,MAAM,OAAO,GAAG,QAAQ,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;oBAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBACjE,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;wBAChD,IAAI,CAAC,QAAQ;4BAAE,SAAS,GAAG,IAAI,CAAC;wBAChC,MAAM,KAAK,CAAC;oBACd,CAAC;oBACD,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;gBAC3B,CAAC;gBACD,MAAM,GAAG,IAAI,CAAC;gBACd,KAAK,GAAG,IAAI,CAAC;gBACb,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC,CAAC;YACF,MAAM;gBACJ,GAAG,KAAK;gBACR,qEAAqE;gBACrE,GAAG,EAAE,GAAG,EAAE,CACR,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;oBAClD,MAAM,GAAG,SAAS,CAAC;oBACnB,MAAM,KAAK,CAAC;gBACd,CAAC,CAAC,CAAC;aACN,CAAC;YACF,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,kBAAU,CAClB,oBAAoB,EACpB,8DAA8D,CAC/D,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,8FAA8F;IACtF,KAAK,CAAC,UAAU,CAAC,OAAuB;QAC9C,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;QACxD,IAAI,SAAS,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACtE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QACtC,OAAO;YACL,GAAG,CAAC,SAAS;gBACX,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;gBAC5E,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,MAAM;gBACR,CAAC,CAAC;oBACE,MAAM,EAAE,MAAM,OAAO,CAAC,GAAG,CACvB,MAAM,CAAC,GAAG,CACR,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CACtE,CACF;iBACF;gBACH,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,aAAa,CACzB,MAAc,EACd,GAAW;QAEX,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,IAAI,KAAK,IAAI,EAAE;YAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAC9D,IAAI,KAAK,GAAG,EAAE,GAAG,GAAG;YAAE,OAAO,SAAS,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxE,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,OAAO,MAAM,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IACzE,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,UAAU,CACtB,MAAc,EACd,MAAc,EACd,KAAa,EACb,IAAa;QAEb,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3D,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC;gBACjE,OAAO,SAAS,CAAC;YACnB,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,MAAM,CAClB,MAAc,EACd,IAA2B;QAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QACjF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACrF,OAAO,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;IACnD,CAAC;IAEO,KAAK,CAAC,SAAS,CACrB,MAAc,EACd,MAAkB,EAClB,GAAW;QAEX,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;QAClC,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,SAAS,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM;YAAE,OAAO,SAAS,CAAC;QAC9B,IAAI,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,UAAU,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7D,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACxD,uFAAuF;YACvF,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;QACvD,CAAC;QACD,MAAM,YAAY,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7E,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC1C,MAAM,CAAC,cAAc,EAAE;YACvB,MAAM,CAAC,kBAAkB,EAAE;SAC5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAC9B,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAA,uBAAa,EAAC,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAC7E,CAAC;QACF,MAAM,UAAU,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO;YACL,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE;YACtE,IAAI,EAAE;gBACJ,GAAG,UAAU;gBACb,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;aAChE;SACF,CAAC;IACJ,CAAC;IAED;;;;;;;;;;OAUG;IACK,KAAK,CAAC,YAAY,CACxB,MAAc,EACd,MAAkB;QAElB,IAAI,MAAM,CAAC,MAAM,GAAG,EAAE;YAAE,OAAO,WAAW,CAAC;QAC3C,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;YAAE,OAAO,SAAS,CAAC;QACnD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,WAAW,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/C,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3D,IAAI,CAAC,SAAS;gBAAE,OAAO,SAAS,CAAC;YACjC,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;gBAAE,SAAS;YAC5C,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,WAAW,CAAC;YAChC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACjE,OAAO,SAAS,CAAC;YACnB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAC9B,MAAM,EACN,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAC/C,CAAC;YACF,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,OAAO;gBACL,KAAK,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACxE,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE;aACzD,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACnE,MAAM,IAAI,kBAAU,CAClB,wBAAwB,EACxB,sCAAsC,MAAM,CAAC,MAAM,4BAA4B,IAAI,CAAC,OAAO,CAAC,SAAS,gCAAgC,CACtI,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,SAAS,CACrB,MAAc,EACd,OAA8B,EAC9B,QAAqB;QAErB,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC5D,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;QACzD,CAAC;QACD,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACxC,OAAO,CAAC,MAAM,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC;IAC/E,CAAC;IAED,oFAAoF;IAC5E,KAAK,CAAC,SAAS,CAAC,MAAc;QACpC,OAAO,IAAA,wBAAW,EAChB,MAAM,CAAC,SAAS,EAChB,MAAM,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,CACpD,CAAC;IACJ,CAAC;IAED,iEAAiE;IACzD,IAAI,CAAC,KAAoB;QAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE;gBACrC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;gBAC9B,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;gBACjC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE;aACtC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE;gBACxC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;gBAC9B,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;gBACjC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;gBACpC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM;aAC9B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF;AAxTD,0BAwTC","sourcesContent":["import { toBlock, toTransaction, type MappingContext } from '../blockchain/mapping';\nimport type { BlockSource, ScanFilter } from '../driver/types';\nimport { ConfigError, StateError, isCryptoAioError } from '../errors/error';\nimport type { EventBus } from '../events/bus';\nimport type { AssetRef } from '../model/asset';\nimport type { Block, Transaction } from '../model/transaction';\nimport type { CursorStore, ScanCursor } from '../store/types';\nimport { isStaleView, type StaleViewSource } from '../transport/stale-view';\nimport type { Clock } from '../util/clock';\nimport { storableText } from '../util/names';\n\nexport interface ScannerOptions {\n  /** Durable name of this consumer's position (namespaced per container, chain and network). */\n  readonly cursorKey: string;\n  /**\n   * Where a NEW cursor starts; ignored when a stored cursor exists. Default `'latest'`. The\n   * new cursor also retains the `reorgWindow` blocks below the start, so a rollback within\n   * the first window can name blocks that were never delivered, and the replay that follows\n   * can start below `from`.\n   */\n  readonly from?: 'latest' | bigint;\n  /**\n   * `'final'` emits finalized blocks only; a rollback can then still come from a provider\n   * inconsistency. `'head'` follows the tip and may roll back within the window.\n   * Default `'head'`. The mode is not stored with the cursor: resuming a head-mode cursor in\n   * final mode keeps the unfinalized blocks it already delivered.\n   */\n  readonly mode?: 'final' | 'head';\n  /** Passed to the driver's block source; each entry is resolved on this chain and network. */\n  readonly filter?: {\n    readonly addresses?: readonly string[];\n    readonly assets?: readonly (AssetRef | string)[];\n  };\n  /** Blocks retained for rollback detection (default: the network's reorgWindow). */\n  readonly reorgWindow?: number;\n  readonly pollIntervalMs?: number;\n  /**\n   * Stops the scan, also while it waits for new blocks. `iterator.return()` only takes effect\n   * once a pending `next()` settles, so an idle scanner is stopped with this signal.\n   */\n  readonly signal?: AbortSignal;\n}\n\nexport interface Checkpoint {\n  readonly height: bigint;\n  readonly hash: string;\n}\n\n/** A scan event without its `ack()`: a delivered block, or a rollback to a checkpoint. */\nexport type ScanEventBody =\n  | {\n      readonly type: 'block';\n      readonly block: Block;\n      readonly transactions: readonly Transaction[];\n    }\n  | {\n      readonly type: 'rollback';\n      readonly to: Checkpoint;\n      readonly removed: readonly Checkpoint[];\n    };\n\nexport type ScanEvent = ScanEventBody & { ack(): Promise<void> };\n\nexport interface ScannerDeps {\n  readonly load: () => Promise<{\n    readonly mapping: MappingContext;\n    readonly blocks: BlockSource;\n    /** The verified height watermark and lag tolerance behind the stale-view guard. */\n    readonly transport: StaleViewSource;\n  }>;\n  readonly cursors: CursorStore;\n  readonly events: EventBus;\n  readonly clock: Clock;\n  readonly namespace: string;\n  readonly defaults: { readonly reorgWindow: number; readonly pollIntervalMs: number };\n}\n\ninterface Step {\n  readonly event: ScanEventBody;\n  readonly next: ScanCursor;\n}\n\n/** What one iteration of a scan reads through. */\ninterface Source {\n  readonly mapping: MappingContext;\n  readonly blocks: BlockSource;\n  readonly transport: StaleViewSource;\n  readonly window: number;\n  readonly filter: ScanFilter | undefined;\n}\n\nconst isAssetInput = (value: unknown): boolean =>\n  typeof value === 'string'\n    ? value.length > 0\n    : typeof value === 'object' &&\n      value !== null &&\n      typeof (value as { standard?: unknown }).standard === 'string' &&\n      typeof (value as { contract?: unknown }).contract === 'string';\n\nfunction assertFilter(filter: ScannerOptions['filter'], invalid: (m: string) => Error) {\n  if (filter === undefined) return;\n  if (typeof filter !== 'object' || filter === null)\n    throw invalid('filter must be an object');\n  const { addresses, assets } = filter;\n  if (\n    addresses !== undefined &&\n    (!Array.isArray(addresses) || !addresses.every((a) => typeof a === 'string'))\n  )\n    throw invalid('filter.addresses must be an array of address strings');\n  if (assets !== undefined && (!Array.isArray(assets) || !assets.every(isAssetInput)))\n    throw invalid('filter.assets must be an array of asset refs or asset ids');\n}\n\nfunction assertOptions(options: ScannerOptions): void {\n  const invalid = (message: string) =>\n    new ConfigError('CONFIG_INVALID', `scanner ${message}`);\n  const { cursorKey, from, mode, reorgWindow, pollIntervalMs } = options;\n  assertFilter(options.filter, invalid);\n  if (typeof cursorKey !== 'string' || cursorKey.length === 0)\n    throw invalid('cursorKey must be a non-empty string');\n  if (!storableText(cursorKey))\n    throw invalid('cursorKey must be well-formed text without U+0000');\n  if (from !== undefined && from !== 'latest' && (typeof from !== 'bigint' || from < 0n))\n    throw invalid(\"from must be 'latest' or a non-negative bigint height\");\n  if (mode !== undefined && mode !== 'final' && mode !== 'head')\n    throw invalid(\"mode must be 'final' or 'head'\");\n  if (\n    reorgWindow !== undefined &&\n    (!Number.isSafeInteger(reorgWindow) || reorgWindow < 1)\n  )\n    throw invalid('reorgWindow must be a positive integer');\n  if (\n    pollIntervalMs !== undefined &&\n    (typeof pollIntervalMs !== 'number' ||\n      !Number.isFinite(pollIntervalMs) ||\n      pollIntervalMs <= 0)\n  )\n    throw invalid('pollIntervalMs must be a finite number greater than 0');\n}\n\n/** The cursor's window; a reset checkpoint stored without one is its own window. */\nfunction windowOf(cursor: ScanCursor): readonly Checkpoint[] {\n  if (cursor.recent.length > 0 || cursor.height < 0n) return cursor.recent;\n  return [{ height: cursor.height, hash: cursor.hash }];\n}\n\nfunction sameCursor(a: ScanCursor, b: ScanCursor): boolean {\n  return (\n    a.height === b.height &&\n    a.hash === b.hash &&\n    a.recent.length === b.recent.length &&\n    a.recent.every(\n      (r, i) => r.height === b.recent[i]?.height && r.hash === b.recent[i]?.hash,\n    )\n  );\n}\n\n/**\n * Reorg-aware, at-least-once block scanner. Each event's `ack()` commits the\n * cursor (compare-and-set on its version, so two scanners sharing a `cursorKey` never both\n * commit the same advance); asking for the next event first throws `INVALID_TRANSITION`.\n * A view that cannot decide (stale, or missing a block) never causes a rollback: the\n * scanner waits a poll interval and looks again, as it does after a retryable provider error.\n *\n * A cursor stopped by `SCANNER_REORG_TOO_DEEP` is reset explicitly: scan under a new\n * `cursorKey`, or `put` a checkpoint `{ height, hash, recent }` for its key through the\n * `CursorStore`. A checkpoint without `recent` is validated on its own block, and its\n * window is then refilled from the chain below that block.\n */\nexport class Scanner implements AsyncIterable<ScanEvent> {\n  constructor(\n    private readonly deps: ScannerDeps,\n    private readonly options: ScannerOptions,\n  ) {\n    assertOptions(options);\n  }\n\n  [Symbol.asyncIterator](): AsyncIterator<ScanEvent> {\n    return this.run();\n  }\n\n  private async *run(): AsyncGenerator<ScanEvent> {\n    const { signal } = this.options;\n    const { mapping, blocks, transport } = await this.deps.load();\n    const reader = mapping.driver.reader;\n    const { chain, network } = mapping.selection;\n    const key = `${this.deps.namespace}:${chain.id}:${network.id}:${this.options.cursorKey}`;\n    const window = this.options.reorgWindow ?? this.deps.defaults.reorgWindow;\n    // Resolved inside the loop, so a transient failure resolving filter.assets is retried.\n    let source: Source | undefined;\n    const poll = this.options.pollIntervalMs ?? this.deps.defaults.pollIntervalMs;\n    const tip = () =>\n      this.options.mode === 'final'\n        ? reader.getFinalizedHeight()\n        : reader.getBlockHeight();\n    const stored = await this.deps.cursors.get(key);\n    let version = stored?.version ?? null;\n    let cursor = stored?.cursor;\n    // A stored cursor is re-validated against the canonical chain before anything is emitted.\n    let validated = stored === null;\n    while (!signal?.aborted) {\n      let step: Step | undefined;\n      try {\n        source ??= {\n          mapping,\n          blocks,\n          transport,\n          window,\n          filter: await this.scanFilter(mapping),\n        };\n        cursor ??= await this.initialCursor(source, await tip());\n        if (cursor) {\n          let verdict = validated ? 'canonical' : await this.findRollback(source, cursor);\n          if (!validated && verdict === 'canonical') {\n            // A short window (a reset checkpoint) is refilled from the chain below the\n            // validated block, so a reorg within the window still rolls back.\n            const recent = await this.refill(source, windowOf(cursor));\n            if (recent) cursor = { ...cursor, recent };\n            else verdict = undefined;\n          }\n          validated = verdict !== undefined;\n          step =\n            verdict === 'canonical'\n              ? await this.nextBlock(source, cursor, await tip())\n              : verdict;\n        }\n      } catch (error) {\n        // Like `watch`: a transient provider failure is retried on the next poll.\n        if (signal?.aborted) return;\n        if (!isCryptoAioError(error) || !error.retryable) throw error;\n      }\n      if (signal?.aborted) return;\n      if (!step) {\n        try {\n          await this.deps.clock.sleep(poll, signal);\n        } catch {\n          return;\n        }\n        continue;\n      }\n      const { event, next } = step;\n      let acked = false;\n      let commit: Promise<void> | undefined;\n      // Set once one of our puts for this event ended without a known outcome.\n      let uncertain = false;\n      const commitCursor = async (): Promise<void> => {\n        try {\n          version = await this.deps.cursors.put(key, next, version);\n        } catch (error) {\n          const conflict = isCryptoAioError(error, 'VERSION_CONFLICT');\n          // A conflict may be our own put having landed only after one ended unseen (or when\n          // the store says so); a first-try conflict is another scanner on this key.\n          const recheck = conflict && (uncertain || error.ambiguous);\n          const stored = recheck ? await this.deps.cursors.get(key) : null;\n          if (!stored || !sameCursor(stored.cursor, next)) {\n            if (!conflict) uncertain = true;\n            throw error;\n          }\n          version = stored.version;\n        }\n        cursor = next;\n        acked = true;\n        this.emit(event);\n      };\n      yield {\n        ...event,\n        // Concurrent calls share one commit; a failed commit can be retried.\n        ack: () =>\n          (commit ??= commitCursor().catch((error: unknown) => {\n            commit = undefined;\n            throw error;\n          })),\n      };\n      if (!acked) {\n        throw new StateError(\n          'INVALID_TRANSITION',\n          'ack() the previous scan event before requesting the next one',\n        );\n      }\n    }\n  }\n\n  /** Normalizes the filter on this chain and network (the driver's codec and asset service). */\n  private async scanFilter(mapping: MappingContext): Promise<ScanFilter | undefined> {\n    const { addresses, assets } = this.options.filter ?? {};\n    if (addresses === undefined && assets === undefined) return undefined;\n    const { selection, driver } = mapping;\n    return {\n      ...(addresses\n        ? { addresses: addresses.map((a) => driver.address.normalize(a).canonical) }\n        : {}),\n      ...(assets\n        ? {\n            assets: await Promise.all(\n              assets.map(\n                async (a) => (await mapping.assets.resolve(selection, driver, a)).ref,\n              ),\n            ),\n          }\n        : {}),\n    };\n  }\n\n  /**\n   * A new cursor sits just below the start height and retains the `window` blocks beneath\n   * it, so a reorg early in the scan is still resolvable. `undefined` (wait) while the\n   * chain's tip for this mode is below the start's parent, or its blocks are not visible\n   * as one consistent chain yet.\n   */\n  private async initialCursor(\n    source: Source,\n    tip: bigint,\n  ): Promise<ScanCursor | undefined> {\n    const from = this.options.from ?? 'latest';\n    const start = from === 'latest' ? tip : from;\n    if (start <= 0n) return { height: -1n, hash: '', recent: [] };\n    if (start - 1n > tip) return undefined;\n    const recent = await this.loadWindow(source, start - 1n, source.window);\n    const top = recent?.[recent.length - 1];\n    return recent && top && { height: top.height, hash: top.hash, recent };\n  }\n\n  /**\n   * Up to `count` checkpoints ending at `height`, oldest first, read down the parent links;\n   * with `hash`, the block at `height` must have it. `undefined` (wait) when a block is not\n   * visible or the links do not hold.\n   */\n  private async loadWindow(\n    source: Source,\n    height: bigint,\n    count: number,\n    hash?: string,\n  ): Promise<Checkpoint[] | undefined> {\n    const loaded: Checkpoint[] = [];\n    let expected = hash;\n    for (let h = height; h >= 0n && loaded.length < count; h--) {\n      const header = await source.blocks.header(h);\n      if (!header || (expected !== undefined && header.hash !== expected))\n        return undefined;\n      loaded.unshift({ height: header.height, hash: header.hash });\n      expected = header.parentHash;\n    }\n    return loaded;\n  }\n\n  /**\n   * Extends a window that a rollback trimmed back down to `window` entries from the chain,\n   * which is canonical at and below the common ancestor. `undefined` (wait) on a gap.\n   */\n  private async refill(\n    source: Source,\n    kept: readonly Checkpoint[],\n  ): Promise<readonly Checkpoint[] | undefined> {\n    const oldest = kept[0];\n    if (!oldest || kept.length >= source.window || oldest.height === 0n) return kept;\n    const missing = source.window - kept.length;\n    const below = await this.loadWindow(source, oldest.height, missing + 1, oldest.hash);\n    return below && [...below.slice(0, -1), ...kept];\n  }\n\n  private async nextBlock(\n    source: Source,\n    cursor: ScanCursor,\n    tip: bigint,\n  ): Promise<Step | undefined> {\n    const height = cursor.height + 1n;\n    if (height > tip) return undefined;\n    const header = await source.blocks.header(height);\n    if (!header) return undefined;\n    if (cursor.height >= 0n && header.parentHash !== cursor.hash) {\n      const verdict = await this.findRollback(source, cursor);\n      // The cursor's block is still canonical, so the two reads disagreed: look again later.\n      return verdict === 'canonical' ? undefined : verdict;\n    }\n    const transactions = await source.blocks.transactions(header, source.filter);\n    const reader = source.mapping.driver.reader;\n    const [head, finalized] = await Promise.all([\n      reader.getBlockHeight(),\n      reader.getFinalizedHeight(),\n    ]);\n    const mapped = await Promise.all(\n      transactions.map((tx) => toTransaction(source.mapping, tx, head, finalized)),\n    );\n    const checkpoint = { height: header.height, hash: header.hash };\n    return {\n      event: { type: 'block', block: toBlock(header), transactions: mapped },\n      next: {\n        ...checkpoint,\n        recent: [...windowOf(cursor), checkpoint].slice(-source.window),\n      },\n    };\n  }\n\n  /**\n   * Walks the retained window newest-first to the common ancestor with the canonical chain.\n   * Returns `'canonical'` when the cursor's own block still is, a rollback step when an older\n   * block is, and `undefined` when this view cannot decide: it is stale, or it does not show\n   * a block yet (absence is never divergence). Throws `SCANNER_REORG_TOO_DEEP` only when\n   * every retained block is visible and none is canonical. The rolled-back cursor's window\n   * is refilled from the chain below the ancestor. A rollback or TOO_DEEP verdict of this\n   * header walk stands only once the proof quorum confirms it, so one endpoint serving a\n   * fork never rolls a cursor back. Only verdicts are confirmed: a block's transactions\n   * are still read from the one endpoint that serves them.\n   */\n  private async findRollback(\n    source: Source,\n    cursor: ScanCursor,\n  ): Promise<Step | 'canonical' | undefined> {\n    if (cursor.height < 0n) return 'canonical';\n    if (await this.staleView(source)) return undefined;\n    const window = windowOf(cursor);\n    const newestFirst = [...window].reverse();\n    for (const [i, entry] of newestFirst.entries()) {\n      const canonical = await source.blocks.header(entry.height);\n      if (!canonical) return undefined;\n      if (canonical.hash !== entry.hash) continue;\n      if (i === 0) return 'canonical';\n      if (!(await this.confirmed(source, newestFirst.slice(0, i), entry)))\n        return undefined;\n      const recent = await this.refill(\n        source,\n        window.filter((r) => r.height <= entry.height),\n      );\n      if (!recent) return undefined;\n      return {\n        event: { type: 'rollback', to: entry, removed: newestFirst.slice(0, i) },\n        next: { height: entry.height, hash: entry.hash, recent },\n      };\n    }\n    if (!(await this.confirmed(source, newestFirst))) return undefined;\n    throw new StateError(\n      'SCANNER_REORG_TOO_DEEP',\n      `the chain diverged deeper than the ${source.window}-block window of cursor '${this.options.cursorKey}'; reset the cursor explicitly`,\n    );\n  }\n\n  /**\n   * Whether the quorum-served hashes confirm a verdict: every `removed` block has been\n   * replaced at its height, and `ancestor` (when given) is still canonical. No block at a\n   * height decides nothing (`false`); a quorum that disagrees throws a retryable error,\n   * which the scan loop also treats as \"look again later\".\n   */\n  private async confirmed(\n    source: Source,\n    removed: readonly Checkpoint[],\n    ancestor?: Checkpoint,\n  ): Promise<boolean> {\n    const { proofs } = source.mapping.driver;\n    for (const entry of removed) {\n      const hash = await proofs.blockHash(entry.height, 'latest');\n      if (hash === null || hash === entry.hash) return false;\n    }\n    if (ancestor === undefined) return true;\n    return (await proofs.blockHash(ancestor.height, 'latest')) === ancestor.hash;\n  }\n\n  /** The monitor's stale-view guard (`isStaleView`): a stale view decides nothing. */\n  private async staleView(source: Source): Promise<boolean> {\n    return isStaleView(\n      source.transport,\n      await source.mapping.driver.reader.getBlockHeight(),\n    );\n  }\n\n  /** Operational data only: never addresses, amounts or hashes. */\n  private emit(event: ScanEventBody): void {\n    if (event.type === 'block') {\n      this.deps.events.emit('scanner.block', {\n        namespace: this.deps.namespace,\n        cursorKey: this.options.cursorKey,\n        height: event.block.height.toString(),\n      });\n    } else {\n      this.deps.events.emit('scanner.rollback', {\n        namespace: this.deps.namespace,\n        cursorKey: this.options.cursorKey,\n        toHeight: event.to.height.toString(),\n        removed: event.removed.length,\n      });\n    }\n  }\n}\n"]}

package/dist/core/ordering/reservations.d.ts

@@ -0,0 +1,16 @@
+import { type OperationRecord } from '../store/types';
+/**
+ * Inputs held by live Operations: their reservation, unsigned payload and every Attempt.
+ * Coin selection excludes them, so two Operations of a wallet never pick the same coin.
+ */
+export declare function reservedInputs(operations: readonly OperationRecord[], exceptId?: string): string[];
+/** The live Operation that may still consume the wallet's current seqno (TON is strictly serial). */
+export declare function seqnoHolder(operations: readonly OperationRecord[], exceptId?: string): OperationRecord | undefined;
+/**
+ * The lowest nonce still reserved by a live, not-yet-included Operation. Included
+ * nonces are already consumed on chain, so counting them would mask a gap above them.
+ */
+export declare function lowestOutstandingNonce(operations: readonly OperationRecord[]): {
+    nonce: bigint;
+    operationId: string;
+} | undefined;

package/dist/core/ordering/reservations.js

@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reservedInputs = reservedInputs;
+exports.seqnoHolder = seqnoHolder;
+exports.lowestOutstandingNonce = lowestOutstandingNonce;
+const types_1 = require("../store/types");
+/**
+ * Inputs held by live Operations: their reservation, unsigned payload and every Attempt.
+ * Coin selection excludes them, so two Operations of a wallet never pick the same coin.
+ */
+function reservedInputs(operations, exceptId) {
+    const inputs = new Set();
+    for (const op of operations) {
+        if (op.id === exceptId || (0, types_1.isTerminal)(op.state))
+            continue;
+        if (op.reservation?.kind === 'inputs')
+            for (const input of op.reservation.inputs)
+                inputs.add(input);
+        if (op.unsigned?.ordering.kind === 'inputs')
+            for (const input of op.unsigned.ordering.inputs)
+                inputs.add(input);
+        for (const attempt of op.attempts) {
+            if (attempt.ordering.kind === 'inputs')
+                for (const input of attempt.ordering.inputs)
+                    inputs.add(input);
+        }
+    }
+    return [...inputs].sort();
+}
+/** The live Operation that may still consume the wallet's current seqno (TON is strictly serial). */
+function seqnoHolder(operations, exceptId) {
+    return operations.find((op) => op.id !== exceptId &&
+        !(0, types_1.isTerminal)(op.state) &&
+        op.state !== 'included' &&
+        op.reservation?.kind === 'seqno');
+}
+/**
+ * The lowest nonce still reserved by a live, not-yet-included Operation. Included
+ * nonces are already consumed on chain, so counting them would mask a gap above them.
+ */
+function lowestOutstandingNonce(operations) {
+    let lowest;
+    for (const op of operations) {
+        if ((0, types_1.isTerminal)(op.state) || op.state === 'included')
+            continue;
+        if (op.reservation?.kind !== 'nonce')
+            continue;
+        if (!lowest || op.reservation.nonce < lowest.nonce)
+            lowest = { nonce: op.reservation.nonce, operationId: op.id };
+    }
+    return lowest;
+}
+//# sourceMappingURL=reservations.js.map

package/dist/core/ordering/reservations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reservations.js","sourceRoot":"","sources":["../../../src/core/ordering/reservations.ts"],"names":[],"mappings":";;AAMA,wCAiBC;AAGD,kCAWC;AAMD,wDAWC;AAtDD,0CAAkE;AAElE;;;GAGG;AACH,SAAgB,cAAc,CAC5B,UAAsC,EACtC,QAAiB;IAEjB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,EAAE,CAAC,EAAE,KAAK,QAAQ,IAAI,IAAA,kBAAU,EAAC,EAAE,CAAC,KAAK,CAAC;YAAE,SAAS;QACzD,IAAI,EAAE,CAAC,WAAW,EAAE,IAAI,KAAK,QAAQ;YACnC,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/D,IAAI,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,KAAK,QAAQ;YACzC,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM;gBAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrE,KAAK,MAAM,OAAO,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ;gBACpC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM;oBAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED,qGAAqG;AACrG,SAAgB,WAAW,CACzB,UAAsC,EACtC,QAAiB;IAEjB,OAAO,UAAU,CAAC,IAAI,CACpB,CAAC,EAAE,EAAE,EAAE,CACL,EAAE,CAAC,EAAE,KAAK,QAAQ;QAClB,CAAC,IAAA,kBAAU,EAAC,EAAE,CAAC,KAAK,CAAC;QACrB,EAAE,CAAC,KAAK,KAAK,UAAU;QACvB,EAAE,CAAC,WAAW,EAAE,IAAI,KAAK,OAAO,CACnC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,sBAAsB,CACpC,UAAsC;IAEtC,IAAI,MAA0D,CAAC;IAC/D,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,IAAA,kBAAU,EAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,KAAK,UAAU;YAAE,SAAS;QAC9D,IAAI,EAAE,CAAC,WAAW,EAAE,IAAI,KAAK,OAAO;YAAE,SAAS;QAC/C,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,WAAW,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK;YAChD,MAAM,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;IACjE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import { isTerminal, type OperationRecord } from '../store/types';\n\n/**\n * Inputs held by live Operations: their reservation, unsigned payload and every Attempt.\n * Coin selection excludes them, so two Operations of a wallet never pick the same coin.\n */\nexport function reservedInputs(\n  operations: readonly OperationRecord[],\n  exceptId?: string,\n): string[] {\n  const inputs = new Set<string>();\n  for (const op of operations) {\n    if (op.id === exceptId || isTerminal(op.state)) continue;\n    if (op.reservation?.kind === 'inputs')\n      for (const input of op.reservation.inputs) inputs.add(input);\n    if (op.unsigned?.ordering.kind === 'inputs')\n      for (const input of op.unsigned.ordering.inputs) inputs.add(input);\n    for (const attempt of op.attempts) {\n      if (attempt.ordering.kind === 'inputs')\n        for (const input of attempt.ordering.inputs) inputs.add(input);\n    }\n  }\n  return [...inputs].sort();\n}\n\n/** The live Operation that may still consume the wallet's current seqno (TON is strictly serial). */\nexport function seqnoHolder(\n  operations: readonly OperationRecord[],\n  exceptId?: string,\n): OperationRecord | undefined {\n  return operations.find(\n    (op) =>\n      op.id !== exceptId &&\n      !isTerminal(op.state) &&\n      op.state !== 'included' &&\n      op.reservation?.kind === 'seqno',\n  );\n}\n\n/**\n * The lowest nonce still reserved by a live, not-yet-included Operation. Included\n * nonces are already consumed on chain, so counting them would mask a gap above them.\n */\nexport function lowestOutstandingNonce(\n  operations: readonly OperationRecord[],\n): { nonce: bigint; operationId: string } | undefined {\n  let lowest: { nonce: bigint; operationId: string } | undefined;\n  for (const op of operations) {\n    if (isTerminal(op.state) || op.state === 'included') continue;\n    if (op.reservation?.kind !== 'nonce') continue;\n    if (!lowest || op.reservation.nonce < lowest.nonce)\n      lowest = { nonce: op.reservation.nonce, operationId: op.id };\n  }\n  return lowest;\n}\n"]}

package/dist/core/ordering/sequence.d.ts

@@ -0,0 +1,61 @@
+import type { Lease, LockManager, SequenceStore } from '../store/types';
+import type { Clock } from '../util/clock';
+export declare function sequenceKey(namespace: string, chain: string, network: string, address: string): string;
+/** A held lease that can be renewed; renewal failure means another worker took over. */
+export declare class LeaseHandle {
+    #private;
+    private readonly locks;
+    private readonly ttlMs;
+    constructor(locks: LockManager, ttlMs: number, lease: Lease);
+    get current(): Lease;
+    renew(): Promise<void>;
+}
+export interface SequenceCoordinatorDeps {
+    readonly locks: LockManager;
+    readonly sequences: SequenceStore;
+    readonly clock: Clock;
+    readonly owner: string;
+    readonly leaseMs: number;
+    /** How long to wait for a busy address before failing with SEQUENCE_BUSY (default: leaseMs). */
+    readonly acquireTimeoutMs?: number;
+    /**
+     * Observes a failed best-effort lease release (the lease then lapses by its TTL).
+     * Its own failure is ignored. Log only the error code: messages may carry store detail.
+     */
+    onReleaseError?(error: unknown): void;
+}
+export declare class SequenceCoordinator {
+    #private;
+    private readonly deps;
+    constructor(deps: SequenceCoordinatorDeps);
+    /**
+     * Runs `fn` while holding the address lease for `key`, then releases it.
+     *
+     * Not re-entrant: a nested `withLease` on the same key waits like any other caller.
+     * It fails with SEQUENCE_BUSY after `acquireTimeoutMs`, or, when that is not shorter
+     * than `leaseMs`, it can outlive the outer lease, take it over and fence the outer
+     * caller. Code that already holds the lease must pass its `LeaseHandle` down instead.
+     * The lease is not renewed automatically; long callbacks call `lease.renew()`.
+     * `options.acquireTimeoutMs` overrides the wait for this call (`0`: a single try).
+     */
+    withLease<T>(key: string, fn: (lease: LeaseHandle) => Promise<T>, signal?: AbortSignal, options?: {
+        readonly acquireTimeoutMs?: number;
+    }): Promise<T>;
+    allocate(lease: LeaseHandle, key: string, chainPending: bigint): Promise<bigint>;
+    /**
+     * Returns a reserved value for reuse. Only legal while no valid signed bytes exist for
+     * it. Precondition: called at most once per allocation, by the Operation holding the
+     * value, after its terminal CAS or after a failure before its reservation was persisted.
+     * Releasing a value that is at or above `next`, or already released, is a no-op.
+     */
+    release(lease: LeaseHandle, key: string, value: bigint): Promise<void>;
+    /**
+     * Nonce reconciliation: returns to `released` every value in [chainPending, next) that is
+     * neither released already nor in `reserved`, and returns those values (ascending). It
+     * never touches a value below `chainPending` (the chain consumed it) or at or above
+     * `next` (never allocated). The caller holds `lease` and reads `reserved` (the values live
+     * Operations hold) under it, so no allocation can interleave; nothing is written when
+     * there is nothing to reclaim.
+     */
+    reclaim(lease: LeaseHandle, key: string, chainPending: bigint, reserved: readonly bigint[]): Promise<bigint[]>;
+}

package/dist/core/ordering/sequence.js

@@ -0,0 +1,155 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SequenceCoordinator = exports.LeaseHandle = void 0;
+exports.sequenceKey = sequenceKey;
+const error_1 = require("../errors/error");
+function sequenceKey(namespace, chain, network, address) {
+    return `seq:${namespace}:${chain}:${network}:${address}`;
+}
+const byValue = (a, b) => (a < b ? -1 : a > b ? 1 : 0);
+/** A held lease that can be renewed; renewal failure means another worker took over. */
+class LeaseHandle {
+    locks;
+    ttlMs;
+    #lease;
+    constructor(locks, ttlMs, lease) {
+        this.locks = locks;
+        this.ttlMs = ttlMs;
+        this.#lease = lease;
+    }
+    get current() {
+        return this.#lease;
+    }
+    async renew() {
+        const renewed = await this.locks.renew(this.#lease, this.ttlMs);
+        if (!renewed)
+            throw new error_1.StateError('FENCING', 'the address lease was lost to another worker');
+        this.#lease = renewed;
+    }
+}
+exports.LeaseHandle = LeaseHandle;
+/**
+ * Lease tokens increase per key only, so a lease for another key cannot fence this one.
+ * Messages omit the key: it embeds the wallet address, and error messages reach logs.
+ */
+function fenceFor(lease, key) {
+    const { key: leased, token } = lease.current;
+    if (leased !== key) {
+        throw new error_1.StateError('FENCING', 'a lease for another address cannot write this sequence');
+    }
+    return token;
+}
+class SequenceCoordinator {
+    deps;
+    constructor(deps) {
+        this.deps = deps;
+    }
+    /**
+     * Runs `fn` while holding the address lease for `key`, then releases it.
+     *
+     * Not re-entrant: a nested `withLease` on the same key waits like any other caller.
+     * It fails with SEQUENCE_BUSY after `acquireTimeoutMs`, or, when that is not shorter
+     * than `leaseMs`, it can outlive the outer lease, take it over and fence the outer
+     * caller. Code that already holds the lease must pass its `LeaseHandle` down instead.
+     * The lease is not renewed automatically; long callbacks call `lease.renew()`.
+     * `options.acquireTimeoutMs` overrides the wait for this call (`0`: a single try).
+     */
+    async withLease(key, fn, signal, options = {}) {
+        signal?.throwIfAborted();
+        const deadline = this.deps.clock.now() +
+            (options.acquireTimeoutMs ?? this.deps.acquireTimeoutMs ?? this.deps.leaseMs);
+        let lease = await this.deps.locks.acquire(key, this.deps.owner, this.deps.leaseMs);
+        while (!lease) {
+            if (this.deps.clock.now() >= deadline) {
+                throw new error_1.StateError('SEQUENCE_BUSY', 'the address lease is held by another operation', { retryable: true });
+            }
+            await this.deps.clock.sleep(25, signal);
+            lease = await this.deps.locks.acquire(key, this.deps.owner, this.deps.leaseMs);
+        }
+        const handle = new LeaseHandle(this.deps.locks, this.deps.leaseMs, lease);
+        try {
+            return await fn(handle);
+        }
+        finally {
+            // Best effort: a failed release must not replace the callback's outcome (for
+            // example a completed broadcast). The lease then lapses by its TTL, and fencing
+            // still guards every write.
+            await this.#release(handle.current);
+        }
+    }
+    /**
+     * A release that throws, synchronously or not, is reported and absorbed, and so
+     * is the observer's own failure, including an async observer's rejection.
+     */
+    async #release(lease) {
+        try {
+            await this.deps.locks.release(lease);
+        }
+        catch (error) {
+            try {
+                const observed = this.deps.onReleaseError?.(error);
+                if (typeof observed?.then === 'function') {
+                    Promise.resolve(observed).catch(() => undefined);
+                }
+            }
+            catch {
+                // An observer failure must not replace the outcome either.
+            }
+        }
+    }
+    async allocate(lease, key, chainPending) {
+        const fence = fenceFor(lease, key);
+        const state = await this.deps.sequences.get(key);
+        const released = [...(state?.released ?? [])]
+            .filter((n) => n >= chainPending)
+            .sort(byValue);
+        const floor = state && state.next > chainPending ? state.next : chainPending;
+        const pick = released[0] ?? floor;
+        const next = pick >= floor ? pick + 1n : floor;
+        await this.deps.sequences.put(key, { next, released: released.filter((n) => n !== pick), fence }, state?.version ?? null);
+        return pick;
+    }
+    /**
+     * Returns a reserved value for reuse. Only legal while no valid signed bytes exist for
+     * it. Precondition: called at most once per allocation, by the Operation holding the
+     * value, after its terminal CAS or after a failure before its reservation was persisted.
+     * Releasing a value that is at or above `next`, or already released, is a no-op.
+     */
+    async release(lease, key, value) {
+        const fence = fenceFor(lease, key);
+        const state = await this.deps.sequences.get(key);
+        if (!state || value >= state.next || state.released.includes(value))
+            return;
+        await this.deps.sequences.put(key, { next: state.next, released: [...state.released, value].sort(byValue), fence }, state.version);
+    }
+    /**
+     * Nonce reconciliation: returns to `released` every value in [chainPending, next) that is
+     * neither released already nor in `reserved`, and returns those values (ascending). It
+     * never touches a value below `chainPending` (the chain consumed it) or at or above
+     * `next` (never allocated). The caller holds `lease` and reads `reserved` (the values live
+     * Operations hold) under it, so no allocation can interleave; nothing is written when
+     * there is nothing to reclaim.
+     */
+    async reclaim(lease, key, chainPending, reserved) {
+        const fence = fenceFor(lease, key);
+        const state = await this.deps.sequences.get(key);
+        if (!state)
+            return [];
+        const held = new Set([...state.released, ...reserved]);
+        const reclaimed = [];
+        for (let value = chainPending; value < state.next; value++) {
+            if (!held.has(value))
+                reclaimed.push(value);
+        }
+        if (reclaimed.length === 0)
+            return [];
+        await this.deps.sequences.put(key, {
+            next: state.next,
+            released: [...state.released, ...reclaimed].sort(byValue),
+            fence,
+        }, state.version);
+        return reclaimed;
+    }
+}
+exports.SequenceCoordinator = SequenceCoordinator;
+//# sourceMappingURL=sequence.js.map

package/dist/core/ordering/sequence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequence.js","sourceRoot":"","sources":["../../../src/core/ordering/sequence.ts"],"names":[],"mappings":";;;AAIA,kCAOC;AAXD,2CAA6C;AAI7C,SAAgB,WAAW,CACzB,SAAiB,EACjB,KAAa,EACb,OAAe,EACf,OAAe;IAEf,OAAO,OAAO,SAAS,IAAI,KAAK,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;AAC3D,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE/E,wFAAwF;AACxF,MAAa,WAAW;IAIH;IACA;IAJnB,MAAM,CAAQ;IAEd,YACmB,KAAkB,EAClB,KAAa,EAC9B,KAAY;QAFK,UAAK,GAAL,KAAK,CAAa;QAClB,UAAK,GAAL,KAAK,CAAQ;QAG9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,IAAI,CAAC,OAAO;YACV,MAAM,IAAI,kBAAU,CAAC,SAAS,EAAE,8CAA8C,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;IACxB,CAAC;CACF;AArBD,kCAqBC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,KAAkB,EAAE,GAAW;IAC/C,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC;IAC7C,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,kBAAU,CAClB,SAAS,EACT,wDAAwD,CACzD,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAiBD,MAAa,mBAAmB;IACD;IAA7B,YAA6B,IAA6B;QAA7B,SAAI,GAAJ,IAAI,CAAyB;IAAG,CAAC;IAE9D;;;;;;;;;OASG;IACH,KAAK,CAAC,SAAS,CACb,GAAW,EACX,EAAsC,EACtC,MAAoB,EACpB,UAAkD,EAAE;QAEpD,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,MAAM,QAAQ,GACZ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;YACrB,CAAC,OAAO,CAAC,gBAAgB,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChF,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnF,OAAO,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;gBACtC,MAAM,IAAI,kBAAU,CAClB,eAAe,EACf,gDAAgD,EAChD,EAAE,SAAS,EAAE,IAAI,EAAE,CACpB,CAAC;YACJ,CAAC;YACD,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YACxC,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjF,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1E,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;gBAAS,CAAC;YACT,6EAA6E;YAC7E,gFAAgF;YAChF,4BAA4B;YAC5B,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,QAAQ,CAAC,KAAY;QACzB,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAY,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC5D,IAAI,OAAQ,QAAsC,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;oBACxE,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,2DAA2D;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAkB,EAAE,GAAW,EAAE,YAAoB;QAClE,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,YAAY,CAAC;aAChC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjB,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC;QAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/C,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAC3B,GAAG,EACH,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAC7D,KAAK,EAAE,OAAO,IAAI,IAAI,CACvB,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO,CAAC,KAAkB,EAAE,GAAW,EAAE,KAAa;QAC1D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO;QAC5E,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAC3B,GAAG,EACH,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,EAC/E,KAAK,CAAC,OAAO,CACd,CAAC;IACJ,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,OAAO,CACX,KAAkB,EAClB,GAAW,EACX,YAAoB,EACpB,QAA2B;QAE3B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,KAAK,GAAG,YAAY,EAAE,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACtC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAC3B,GAAG,EACH;YACE,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACzD,KAAK;SACN,EACD,KAAK,CAAC,OAAO,CACd,CAAC;QACF,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AArID,kDAqIC","sourcesContent":["import { StateError } from '../errors/error';\nimport type { Lease, LockManager, SequenceStore } from '../store/types';\nimport type { Clock } from '../util/clock';\n\nexport function sequenceKey(\n  namespace: string,\n  chain: string,\n  network: string,\n  address: string,\n): string {\n  return `seq:${namespace}:${chain}:${network}:${address}`;\n}\n\nconst byValue = (a: bigint, b: bigint): number => (a < b ? -1 : a > b ? 1 : 0);\n\n/** A held lease that can be renewed; renewal failure means another worker took over. */\nexport class LeaseHandle {\n  #lease: Lease;\n\n  constructor(\n    private readonly locks: LockManager,\n    private readonly ttlMs: number,\n    lease: Lease,\n  ) {\n    this.#lease = lease;\n  }\n\n  get current(): Lease {\n    return this.#lease;\n  }\n\n  async renew(): Promise<void> {\n    const renewed = await this.locks.renew(this.#lease, this.ttlMs);\n    if (!renewed)\n      throw new StateError('FENCING', 'the address lease was lost to another worker');\n    this.#lease = renewed;\n  }\n}\n\n/**\n * Lease tokens increase per key only, so a lease for another key cannot fence this one.\n * Messages omit the key: it embeds the wallet address, and error messages reach logs.\n */\nfunction fenceFor(lease: LeaseHandle, key: string): bigint {\n  const { key: leased, token } = lease.current;\n  if (leased !== key) {\n    throw new StateError(\n      'FENCING',\n      'a lease for another address cannot write this sequence',\n    );\n  }\n  return token;\n}\n\nexport interface SequenceCoordinatorDeps {\n  readonly locks: LockManager;\n  readonly sequences: SequenceStore;\n  readonly clock: Clock;\n  readonly owner: string;\n  readonly leaseMs: number;\n  /** How long to wait for a busy address before failing with SEQUENCE_BUSY (default: leaseMs). */\n  readonly acquireTimeoutMs?: number;\n  /**\n   * Observes a failed best-effort lease release (the lease then lapses by its TTL).\n   * Its own failure is ignored. Log only the error code: messages may carry store detail.\n   */\n  onReleaseError?(error: unknown): void;\n}\n\nexport class SequenceCoordinator {\n  constructor(private readonly deps: SequenceCoordinatorDeps) {}\n\n  /**\n   * Runs `fn` while holding the address lease for `key`, then releases it.\n   *\n   * Not re-entrant: a nested `withLease` on the same key waits like any other caller.\n   * It fails with SEQUENCE_BUSY after `acquireTimeoutMs`, or, when that is not shorter\n   * than `leaseMs`, it can outlive the outer lease, take it over and fence the outer\n   * caller. Code that already holds the lease must pass its `LeaseHandle` down instead.\n   * The lease is not renewed automatically; long callbacks call `lease.renew()`.\n   * `options.acquireTimeoutMs` overrides the wait for this call (`0`: a single try).\n   */\n  async withLease<T>(\n    key: string,\n    fn: (lease: LeaseHandle) => Promise<T>,\n    signal?: AbortSignal,\n    options: { readonly acquireTimeoutMs?: number } = {},\n  ): Promise<T> {\n    signal?.throwIfAborted();\n    const deadline =\n      this.deps.clock.now() +\n      (options.acquireTimeoutMs ?? this.deps.acquireTimeoutMs ?? this.deps.leaseMs);\n    let lease = await this.deps.locks.acquire(key, this.deps.owner, this.deps.leaseMs);\n    while (!lease) {\n      if (this.deps.clock.now() >= deadline) {\n        throw new StateError(\n          'SEQUENCE_BUSY',\n          'the address lease is held by another operation',\n          { retryable: true },\n        );\n      }\n      await this.deps.clock.sleep(25, signal);\n      lease = await this.deps.locks.acquire(key, this.deps.owner, this.deps.leaseMs);\n    }\n    const handle = new LeaseHandle(this.deps.locks, this.deps.leaseMs, lease);\n    try {\n      return await fn(handle);\n    } finally {\n      // Best effort: a failed release must not replace the callback's outcome (for\n      // example a completed broadcast). The lease then lapses by its TTL, and fencing\n      // still guards every write.\n      await this.#release(handle.current);\n    }\n  }\n\n  /**\n   * A release that throws, synchronously or not, is reported and absorbed, and so\n   * is the observer's own failure, including an async observer's rejection.\n   */\n  async #release(lease: Lease): Promise<void> {\n    try {\n      await this.deps.locks.release(lease);\n    } catch (error) {\n      try {\n        const observed: unknown = this.deps.onReleaseError?.(error);\n        if (typeof (observed as { then?: unknown } | null)?.then === 'function') {\n          Promise.resolve(observed).catch(() => undefined);\n        }\n      } catch {\n        // An observer failure must not replace the outcome either.\n      }\n    }\n  }\n\n  async allocate(lease: LeaseHandle, key: string, chainPending: bigint): Promise<bigint> {\n    const fence = fenceFor(lease, key);\n    const state = await this.deps.sequences.get(key);\n    const released = [...(state?.released ?? [])]\n      .filter((n) => n >= chainPending)\n      .sort(byValue);\n    const floor = state && state.next > chainPending ? state.next : chainPending;\n    const pick = released[0] ?? floor;\n    const next = pick >= floor ? pick + 1n : floor;\n    await this.deps.sequences.put(\n      key,\n      { next, released: released.filter((n) => n !== pick), fence },\n      state?.version ?? null,\n    );\n    return pick;\n  }\n\n  /**\n   * Returns a reserved value for reuse. Only legal while no valid signed bytes exist for\n   * it. Precondition: called at most once per allocation, by the Operation holding the\n   * value, after its terminal CAS or after a failure before its reservation was persisted.\n   * Releasing a value that is at or above `next`, or already released, is a no-op.\n   */\n  async release(lease: LeaseHandle, key: string, value: bigint): Promise<void> {\n    const fence = fenceFor(lease, key);\n    const state = await this.deps.sequences.get(key);\n    if (!state || value >= state.next || state.released.includes(value)) return;\n    await this.deps.sequences.put(\n      key,\n      { next: state.next, released: [...state.released, value].sort(byValue), fence },\n      state.version,\n    );\n  }\n\n  /**\n   * Nonce reconciliation: returns to `released` every value in [chainPending, next) that is\n   * neither released already nor in `reserved`, and returns those values (ascending). It\n   * never touches a value below `chainPending` (the chain consumed it) or at or above\n   * `next` (never allocated). The caller holds `lease` and reads `reserved` (the values live\n   * Operations hold) under it, so no allocation can interleave; nothing is written when\n   * there is nothing to reclaim.\n   */\n  async reclaim(\n    lease: LeaseHandle,\n    key: string,\n    chainPending: bigint,\n    reserved: readonly bigint[],\n  ): Promise<bigint[]> {\n    const fence = fenceFor(lease, key);\n    const state = await this.deps.sequences.get(key);\n    if (!state) return [];\n    const held = new Set([...state.released, ...reserved]);\n    const reclaimed: bigint[] = [];\n    for (let value = chainPending; value < state.next; value++) {\n      if (!held.has(value)) reclaimed.push(value);\n    }\n    if (reclaimed.length === 0) return [];\n    await this.deps.sequences.put(\n      key,\n      {\n        next: state.next,\n        released: [...state.released, ...reclaimed].sort(byValue),\n        fence,\n      },\n      state.version,\n    );\n    return reclaimed;\n  }\n}\n"]}

package/dist/core/registry/adapters.d.ts

@@ -0,0 +1,10 @@
+import type { AdapterManifest, DriverFactory } from '../driver/types';
+export declare class AdapterCatalog {
+    #private;
+    register(manifest: AdapterManifest): void;
+    /** Manifests for a chain in registration order; the first is the family default. */
+    forChain(chainId: string): AdapterManifest[];
+    get(chainId: string, library: string): AdapterManifest | undefined;
+    load(manifest: AdapterManifest): Promise<DriverFactory>;
+    clone(): AdapterCatalog;
+}

package/dist/core/registry/adapters.js

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AdapterCatalog = void 0;
+const error_1 = require("../errors/error");
+const keyOf = (m) => `${m.family}/${m.library}`;
+function dependencyError(manifest, error) {
+    const code = error?.code;
+    if (code !== 'MODULE_NOT_FOUND' && code !== 'ERR_MODULE_NOT_FOUND')
+        return error;
+    const message = error instanceof Error ? error.message : String(error);
+    const deps = manifest.peerDependencies.filter((d) => message.includes(`'${d.name}'`) || message.includes(`"${d.name}"`));
+    // Only a missing peer dependency is the user's to install. Any other missing module
+    // (the adapter's own file, a broken build) keeps its own error.
+    if (deps.length === 0)
+        return error;
+    const install = deps.map((d) => `${d.name}@${d.range}`).join(' ');
+    return new error_1.ConfigError('DEPENDENCY_MISSING', `library '${manifest.library}' (${manifest.family}) needs ${deps.map((d) => d.name).join(', ')}; install it: npm i ${install}`, { cause: error, details: { packages: deps.map((d) => d.name) } });
+}
+class AdapterCatalog {
+    #manifests = new Map();
+    #loaded = new Map();
+    register(manifest) {
+        const key = keyOf(manifest);
+        if (this.#manifests.has(key)) {
+            throw new error_1.ConfigError('CONFIG_INVALID', `adapter '${key}' is already registered`);
+        }
+        this.#manifests.set(key, manifest);
+    }
+    /** Manifests for a chain in registration order; the first is the family default. */
+    forChain(chainId) {
+        return [...this.#manifests.values()].filter((m) => m.chains.includes(chainId));
+    }
+    get(chainId, library) {
+        return this.forChain(chainId).find((m) => m.library === library);
+    }
+    load(manifest) {
+        const key = keyOf(manifest);
+        let pending = this.#loaded.get(key);
+        if (!pending) {
+            pending = manifest.load().catch((error) => {
+                this.#loaded.delete(key);
+                throw dependencyError(manifest, error);
+            });
+            this.#loaded.set(key, pending);
+        }
+        return pending;
+    }
+    clone() {
+        const copy = new AdapterCatalog();
+        for (const [key, manifest] of this.#manifests)
+            copy.#manifests.set(key, manifest);
+        return copy;
+    }
+}
+exports.AdapterCatalog = AdapterCatalog;
+//# sourceMappingURL=adapters.js.map

package/dist/core/registry/adapters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adapters.js","sourceRoot":"","sources":["../../../src/core/registry/adapters.ts"],"names":[],"mappings":";;;AACA,2CAA8C;AAE9C,MAAM,KAAK,GAAG,CAAC,CAAkB,EAAU,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;AAEzE,SAAS,eAAe,CAAC,QAAyB,EAAE,KAAc;IAChE,MAAM,IAAI,GAAI,KAAmC,EAAE,IAAI,CAAC;IACxD,IAAI,IAAI,KAAK,kBAAkB,IAAI,IAAI,KAAK,sBAAsB;QAAE,OAAO,KAAK,CAAC;IACjF,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAC3C,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAC1E,CAAC;IACF,oFAAoF;IACpF,gEAAgE;IAChE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClE,OAAO,IAAI,mBAAW,CACpB,oBAAoB,EACpB,YAAY,QAAQ,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,WAAW,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,uBAAuB,OAAO,EAAE,EAC9H,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CACjE,CAAC;AACJ,CAAC;AAED,MAAa,cAAc;IAChB,UAAU,GAAG,IAAI,GAAG,EAA2B,CAAC;IAChD,OAAO,GAAG,IAAI,GAAG,EAAkC,CAAC;IAE7D,QAAQ,CAAC,QAAyB;QAChC,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,mBAAW,CAAC,gBAAgB,EAAE,YAAY,GAAG,yBAAyB,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC;IAED,oFAAoF;IACpF,QAAQ,CAAC,OAAe;QACtB,OAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,GAAG,CAAC,OAAe,EAAE,OAAe;QAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,CAAC,QAAyB;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC5B,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;gBACjD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,MAAM,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAvCD,wCAuCC","sourcesContent":["import type { AdapterManifest, DriverFactory } from '../driver/types';\nimport { ConfigError } from '../errors/error';\n\nconst keyOf = (m: AdapterManifest): string => `${m.family}/${m.library}`;\n\nfunction dependencyError(manifest: AdapterManifest, error: unknown): unknown {\n  const code = (error as { code?: unknown } | null)?.code;\n  if (code !== 'MODULE_NOT_FOUND' && code !== 'ERR_MODULE_NOT_FOUND') return error;\n  const message = error instanceof Error ? error.message : String(error);\n  const deps = manifest.peerDependencies.filter(\n    (d) => message.includes(`'${d.name}'`) || message.includes(`\"${d.name}\"`),\n  );\n  // Only a missing peer dependency is the user's to install. Any other missing module\n  // (the adapter's own file, a broken build) keeps its own error.\n  if (deps.length === 0) return error;\n  const install = deps.map((d) => `${d.name}@${d.range}`).join(' ');\n  return new ConfigError(\n    'DEPENDENCY_MISSING',\n    `library '${manifest.library}' (${manifest.family}) needs ${deps.map((d) => d.name).join(', ')}; install it: npm i ${install}`,\n    { cause: error, details: { packages: deps.map((d) => d.name) } },\n  );\n}\n\nexport class AdapterCatalog {\n  readonly #manifests = new Map<string, AdapterManifest>();\n  readonly #loaded = new Map<string, Promise<DriverFactory>>();\n\n  register(manifest: AdapterManifest): void {\n    const key = keyOf(manifest);\n    if (this.#manifests.has(key)) {\n      throw new ConfigError('CONFIG_INVALID', `adapter '${key}' is already registered`);\n    }\n    this.#manifests.set(key, manifest);\n  }\n\n  /** Manifests for a chain in registration order; the first is the family default. */\n  forChain(chainId: string): AdapterManifest[] {\n    return [...this.#manifests.values()].filter((m) => m.chains.includes(chainId));\n  }\n\n  get(chainId: string, library: string): AdapterManifest | undefined {\n    return this.forChain(chainId).find((m) => m.library === library);\n  }\n\n  load(manifest: AdapterManifest): Promise<DriverFactory> {\n    const key = keyOf(manifest);\n    let pending = this.#loaded.get(key);\n    if (!pending) {\n      pending = manifest.load().catch((error: unknown) => {\n        this.#loaded.delete(key);\n        throw dependencyError(manifest, error);\n      });\n      this.#loaded.set(key, pending);\n    }\n    return pending;\n  }\n\n  clone(): AdapterCatalog {\n    const copy = new AdapterCatalog();\n    for (const [key, manifest] of this.#manifests) copy.#manifests.set(key, manifest);\n    return copy;\n  }\n}\n"]}

package/dist/core/registry/assets.d.ts

@@ -0,0 +1,18 @@
+import { type AssetId, type AssetInfo, type AssetMetadata, type AssetRef } from '../model/asset';
+import type { ChainInfo } from '../model/chain';
+export interface AssetRegistration {
+    readonly chain: string;
+    readonly network: string;
+    readonly ref: AssetRef;
+    readonly metadata: AssetMetadata;
+    readonly aliases?: readonly string[];
+}
+export declare class AssetCatalog {
+    #private;
+    register(registration: AssetRegistration): AssetInfo;
+    registerNative(chain: ChainInfo): void;
+    get(id: AssetId): AssetInfo | undefined;
+    native(chain: string, network: string): AssetInfo;
+    resolveAlias(chain: string, network: string, alias: string): AssetInfo;
+    clone(): AssetCatalog;
+}

package/dist/core/registry/assets.js

@@ -0,0 +1,90 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AssetCatalog = void 0;
+const error_1 = require("../errors/error");
+const asset_1 = require("../model/asset");
+const names_1 = require("../util/names");
+const ALIAS = /^[A-Z0-9._-]{1,32}$/;
+class AssetCatalog {
+    #byId = new Map();
+    #aliases = new Map();
+    register(registration) {
+        const id = (0, asset_1.assetId)(registration.chain, registration.network, registration.ref);
+        const problem = (0, asset_1.metadataProblem)(registration.metadata);
+        if (problem)
+            throw new error_1.ConfigError('CONFIG_INVALID', `asset '${id}': ${problem}`);
+        const existing = this.#byId.get(id);
+        if (existing &&
+            (existing.metadata.symbol !== registration.metadata.symbol ||
+                existing.metadata.decimals !== registration.metadata.decimals)) {
+            throw new error_1.ConfigError('CONFIG_INVALID', `asset '${id}' is already registered with different metadata`);
+        }
+        const scopeKey = `${registration.chain}:${registration.network}`;
+        const scope = this.#aliases.get(scopeKey) ?? new Map();
+        const aliases = (registration.aliases ?? []).map((alias) => {
+            const normalized = alias.trim().toUpperCase();
+            if (!ALIAS.test(normalized)) {
+                throw new error_1.ConfigError('CONFIG_INVALID', `invalid asset alias '${alias}'`);
+            }
+            const owner = scope.get(normalized);
+            if (owner && owner !== id) {
+                throw new error_1.ConfigError('CONFIG_INVALID', `alias '${normalized}' on ${scopeKey} already refers to '${owner}'`);
+            }
+            return normalized;
+        });
+        const info = existing ??
+            Object.freeze({
+                id,
+                chain: registration.chain,
+                network: registration.network,
+                ref: registration.ref,
+                metadata: Object.freeze({ ...registration.metadata }),
+            });
+        this.#byId.set(id, info);
+        for (const alias of aliases)
+            scope.set(alias, id);
+        this.#aliases.set(scopeKey, scope);
+        return info;
+    }
+    registerNative(chain) {
+        for (const network of Object.keys(chain.networks)) {
+            this.register({
+                chain: chain.id,
+                network,
+                ref: 'native',
+                metadata: chain.nativeAsset,
+                aliases: [chain.nativeAsset.symbol],
+            });
+        }
+    }
+    get(id) {
+        return this.#byId.get(id);
+    }
+    native(chain, network) {
+        const info = this.#byId.get((0, asset_1.assetId)(chain, network, 'native'));
+        if (!info) {
+            throw new error_1.ValidationError('ASSET_RESOLUTION', `no native asset registered for ${chain}:${network}`);
+        }
+        return info;
+    }
+    resolveAlias(chain, network, alias) {
+        const scopeKey = `${chain}:${network}`;
+        const scope = this.#aliases.get(scopeKey);
+        const id = scope?.get(alias.trim().toUpperCase());
+        const info = id ? this.#byId.get(id) : undefined;
+        if (!info) {
+            throw new error_1.ValidationError('ASSET_RESOLUTION', (0, names_1.unknownName)(`asset alias on ${scopeKey}`, scope?.keys() ?? []));
+        }
+        return info;
+    }
+    clone() {
+        const copy = new AssetCatalog();
+        for (const [id, info] of this.#byId)
+            copy.#byId.set(id, info);
+        for (const [key, scope] of this.#aliases)
+            copy.#aliases.set(key, new Map(scope));
+        return copy;
+    }
+}
+exports.AssetCatalog = AssetCatalog;
+//# sourceMappingURL=assets.js.map

package/dist/core/registry/assets.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assets.js","sourceRoot":"","sources":["../../../src/core/registry/assets.ts"],"names":[],"mappings":";;;AAAA,2CAA+D;AAC/D,0CAOwB;AAExB,yCAA4C;AAU5C,MAAM,KAAK,GAAG,qBAAqB,CAAC;AAEpC,MAAa,YAAY;IACd,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IACtC,QAAQ,GAAG,IAAI,GAAG,EAAgC,CAAC;IAE5D,QAAQ,CAAC,YAA+B;QACtC,MAAM,EAAE,GAAG,IAAA,eAAO,EAAC,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC;QAC/E,MAAM,OAAO,GAAG,IAAA,uBAAe,EAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,OAAO;YAAE,MAAM,IAAI,mBAAW,CAAC,gBAAgB,EAAE,UAAU,EAAE,MAAM,OAAO,EAAE,CAAC,CAAC;QAClF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IACE,QAAQ;YACR,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,KAAK,YAAY,CAAC,QAAQ,CAAC,MAAM;gBACxD,QAAQ,CAAC,QAAQ,CAAC,QAAQ,KAAK,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAChE,CAAC;YACD,MAAM,IAAI,mBAAW,CACnB,gBAAgB,EAChB,UAAU,EAAE,iDAAiD,CAC9D,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,YAAY,CAAC,KAAK,IAAI,YAAY,CAAC,OAAO,EAAE,CAAC;QACjE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAmB,CAAC;QACxE,MAAM,OAAO,GAAG,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACzD,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,mBAAW,CAAC,gBAAgB,EAAE,wBAAwB,KAAK,GAAG,CAAC,CAAC;YAC5E,CAAC;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACpC,IAAI,KAAK,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC;gBAC1B,MAAM,IAAI,mBAAW,CACnB,gBAAgB,EAChB,UAAU,UAAU,QAAQ,QAAQ,uBAAuB,KAAK,GAAG,CACpE,CAAC;YACJ,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,GACR,QAAQ;YACR,MAAM,CAAC,MAAM,CAAC;gBACZ,EAAE;gBACF,KAAK,EAAE,YAAY,CAAC,KAAK;gBACzB,OAAO,EAAE,YAAY,CAAC,OAAO;gBAC7B,GAAG,EAAE,YAAY,CAAC,GAAG;gBACrB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC;aACtD,CAAC,CAAC;QACL,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,OAAO;YAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,cAAc,CAAC,KAAgB;QAC7B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,QAAQ,CAAC;gBACZ,KAAK,EAAE,KAAK,CAAC,EAAE;gBACf,OAAO;gBACP,GAAG,EAAE,QAAQ;gBACb,QAAQ,EAAE,KAAK,CAAC,WAAW;gBAC3B,OAAO,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;aACpC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,GAAG,CAAC,EAAW;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,KAAa,EAAE,OAAe;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAA,eAAO,EAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,uBAAe,CACvB,kBAAkB,EAClB,kCAAkC,KAAK,IAAI,OAAO,EAAE,CACrD,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,YAAY,CAAC,KAAa,EAAE,OAAe,EAAE,KAAa;QACxD,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,OAAO,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,uBAAe,CACvB,kBAAkB,EAClB,IAAA,mBAAW,EAAC,kBAAkB,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAC/D,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,YAAY,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAjGD,oCAiGC","sourcesContent":["import { ConfigError, ValidationError } from '../errors/error';\nimport {\n  assetId,\n  metadataProblem,\n  type AssetId,\n  type AssetInfo,\n  type AssetMetadata,\n  type AssetRef,\n} from '../model/asset';\nimport type { ChainInfo } from '../model/chain';\nimport { unknownName } from '../util/names';\n\nexport interface AssetRegistration {\n  readonly chain: string;\n  readonly network: string;\n  readonly ref: AssetRef;\n  readonly metadata: AssetMetadata;\n  readonly aliases?: readonly string[];\n}\n\nconst ALIAS = /^[A-Z0-9._-]{1,32}$/;\n\nexport class AssetCatalog {\n  readonly #byId = new Map<AssetId, AssetInfo>();\n  readonly #aliases = new Map<string, Map<string, AssetId>>();\n\n  register(registration: AssetRegistration): AssetInfo {\n    const id = assetId(registration.chain, registration.network, registration.ref);\n    const problem = metadataProblem(registration.metadata);\n    if (problem) throw new ConfigError('CONFIG_INVALID', `asset '${id}': ${problem}`);\n    const existing = this.#byId.get(id);\n    if (\n      existing &&\n      (existing.metadata.symbol !== registration.metadata.symbol ||\n        existing.metadata.decimals !== registration.metadata.decimals)\n    ) {\n      throw new ConfigError(\n        'CONFIG_INVALID',\n        `asset '${id}' is already registered with different metadata`,\n      );\n    }\n    const scopeKey = `${registration.chain}:${registration.network}`;\n    const scope = this.#aliases.get(scopeKey) ?? new Map<string, AssetId>();\n    const aliases = (registration.aliases ?? []).map((alias) => {\n      const normalized = alias.trim().toUpperCase();\n      if (!ALIAS.test(normalized)) {\n        throw new ConfigError('CONFIG_INVALID', `invalid asset alias '${alias}'`);\n      }\n      const owner = scope.get(normalized);\n      if (owner && owner !== id) {\n        throw new ConfigError(\n          'CONFIG_INVALID',\n          `alias '${normalized}' on ${scopeKey} already refers to '${owner}'`,\n        );\n      }\n      return normalized;\n    });\n    const info: AssetInfo =\n      existing ??\n      Object.freeze({\n        id,\n        chain: registration.chain,\n        network: registration.network,\n        ref: registration.ref,\n        metadata: Object.freeze({ ...registration.metadata }),\n      });\n    this.#byId.set(id, info);\n    for (const alias of aliases) scope.set(alias, id);\n    this.#aliases.set(scopeKey, scope);\n    return info;\n  }\n\n  registerNative(chain: ChainInfo): void {\n    for (const network of Object.keys(chain.networks)) {\n      this.register({\n        chain: chain.id,\n        network,\n        ref: 'native',\n        metadata: chain.nativeAsset,\n        aliases: [chain.nativeAsset.symbol],\n      });\n    }\n  }\n\n  get(id: AssetId): AssetInfo | undefined {\n    return this.#byId.get(id);\n  }\n\n  native(chain: string, network: string): AssetInfo {\n    const info = this.#byId.get(assetId(chain, network, 'native'));\n    if (!info) {\n      throw new ValidationError(\n        'ASSET_RESOLUTION',\n        `no native asset registered for ${chain}:${network}`,\n      );\n    }\n    return info;\n  }\n\n  resolveAlias(chain: string, network: string, alias: string): AssetInfo {\n    const scopeKey = `${chain}:${network}`;\n    const scope = this.#aliases.get(scopeKey);\n    const id = scope?.get(alias.trim().toUpperCase());\n    const info = id ? this.#byId.get(id) : undefined;\n    if (!info) {\n      throw new ValidationError(\n        'ASSET_RESOLUTION',\n        unknownName(`asset alias on ${scopeKey}`, scope?.keys() ?? []),\n      );\n    }\n    return info;\n  }\n\n  clone(): AssetCatalog {\n    const copy = new AssetCatalog();\n    for (const [id, info] of this.#byId) copy.#byId.set(id, info);\n    for (const [key, scope] of this.#aliases) copy.#aliases.set(key, new Map(scope));\n    return copy;\n  }\n}\n"]}

package/dist/core/registry/chains.d.ts

@@ -0,0 +1,10 @@
+import type { ChainInfo, NetworkInfo } from '../model/chain';
+export declare class ChainCatalog {
+    #private;
+    register(chain: ChainInfo): void;
+    has(id: string): boolean;
+    get(id: string): ChainInfo;
+    list(): ChainInfo[];
+    network(chainId: string, networkId: string): NetworkInfo;
+    clone(): ChainCatalog;
+}