@antseed/cli 0.1.179 → 0.1.180

package/dist/proxy/telemetry.js.map

@@ -1 +1 @@
-{"version":3,"file":"telemetry.js","sourceRoot":"","sources":["../../src/proxy/telemetry.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAA;AACrE,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAA;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,oBAAoB,CAAA;AAE5D,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;AAoCjC,MAAM,WAAW,GAAgB;IAC/B,WAAW,EAAE,CAAC;IACd,gBAAgB,EAAE,CAAC;IACnB,iBAAiB,EAAE,CAAC;IACpB,YAAY,EAAE,CAAC;IACf,WAAW,EAAE,CAAC;CACf,CAAA;AAED,SAAS,gBAAgB,CAAC,KAAc;IACtC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACxC,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,4EAA4E;IAC5E,wEAAwE;IACxE,0EAA0E;IAC1E,4EAA4E;IAC5E,yDAAyD;IACzD,MAAM,SAAS,GAAG,YAAY,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;IAEhD,MAAM,KAAK,GAAG,KAAgC,CAAA;IAC9C,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAA;IAClG,IAAI,KAAK,GAAG,gBAAgB,CAC1B,KAAK,CAAC,WAAW;WACd,KAAK,CAAC,YAAY;WAClB,KAAK,CAAC,YAAY;WAClB,KAAK,CAAC,aAAa;WACnB,KAAK,CAAC,iBAAiB;WACvB,KAAK,CAAC,kBAAkB;WACxB,KAAK,CAAC,2BAA2B;WACjC,KAAK,CAAC,uBAAuB,CACjC,CAAA;IACD,IAAI,MAAM,GAAG,gBAAgB,CAC3B,KAAK,CAAC,YAAY;WACf,KAAK,CAAC,aAAa;WACnB,KAAK,CAAC,gBAAgB;WACtB,KAAK,CAAC,iBAAiB;WACvB,KAAK,CAAC,kBAAkB;WACxB,KAAK,CAAC,sBAAsB,CAChC,CAAA;IAED,wEAAwE;IACxE,0EAA0E;IAC1E,0DAA0D;IAC1D,IAAI,SAAS,CAAC,WAAW,GAAG,CAAC;QAAE,KAAK,GAAG,SAAS,CAAC,WAAW,CAAA;IAC5D,IAAI,SAAS,CAAC,YAAY,GAAG,CAAC;QAAE,MAAM,GAAG,SAAS,CAAC,YAAY,CAAA;IAE/D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,GAAG,KAAK,CAAA;QAChB,CAAC;aAAM,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACvD,MAAM,GAAG,KAAK,GAAG,KAAK,CAAA;QACxB,CAAC;aAAM,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;YACxD,KAAK,GAAG,KAAK,GAAG,MAAM,CAAA;QACxB,CAAC;IACH,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,iBAAiB,EAAE,KAAK,CAAC,CAAA;IACtE,OAAO;QACL,WAAW,EAAE,KAAK;QAClB,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,iBAAiB,CAAC;QACxD,iBAAiB;QACjB,YAAY,EAAE,MAAM;QACpB,WAAW,EAAE,KAAK,GAAG,MAAM;KAC5B,CAAA;AACH,CAAC;AAED,kGAAkG;AAClG,MAAM,wBAAwB,GAAG,CAAC,CAAA;AAElC,SAAS,uBAAuB,CAAC,UAAkB,EAAE,WAAmB;IACtE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAA;IAC/F,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAA;IACjG,OAAO;QACL,WAAW;QACX,gBAAgB,EAAE,WAAW;QAC7B,iBAAiB,EAAE,CAAC;QACpB,YAAY;QACZ,WAAW,EAAE,WAAW,GAAG,YAAY;QACvC,MAAM,EAAE,WAAW;KACpB,CAAA;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAgB;IACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IAC9B,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,iBAAiB,GAAG,CAAC,CAAA;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QAC3B,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,SAAQ;QAE1C,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,QAAQ;YAAE,SAAQ;QAE1D,IAAI,MAA+B,CAAA;QACnC,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAA4B,CAAA;QACzD,CAAC;QAAC,MAAM,CAAC;YACP,SAAQ;QACV,CAAC;QAED,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAClD,IAAI,WAAW,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAChC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,CAAC,CAAA;YAC5D,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC,CAAA;YAC/D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,CAAC,CAAA;YAC5D,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,WAAW,CAAC,iBAAiB,CAAC,CAAA;QAChF,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAA;QAC9B,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAE,OAAmC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QACtI,IAAI,YAAY,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACjC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,WAAW,CAAC,CAAA;YAC7D,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC,YAAY,CAAC,CAAA;YAChE,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,WAAW,CAAC,CAAA;YAC7D,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAAC,iBAAiB,CAAC,CAAA;QACjF,CAAC;IACH,CAAC;IAED,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;QACrB,WAAW,GAAG,WAAW,GAAG,YAAY,CAAA;IAC1C,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAA;IACvD,OAAO;QACL,WAAW;QACX,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAAC;QACnD,iBAAiB,EAAE,MAAM;QACzB,YAAY;QACZ,WAAW;KACZ,CAAA;AACH,CAAC;AAED,SAAS,cAAc,CAAC,IAAgB;IACtC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAA4B,CAAA;QAC1E,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAC7C,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,MAAM,CAAA;QACf,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAA;QAC9B,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,gBAAgB,CAAE,OAAmC,CAAC,KAAK,CAAC,CAAA;YAC3E,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBAC3B,OAAO,MAAM,CAAA;YACf,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAA;QAC5B,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,gBAAgB,CAAE,MAAkC,CAAC,KAAK,CAAC,CAAA;YAC1E,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBAC3B,OAAO,MAAM,CAAA;YACf,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAA;IACpB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,WAAW,CAAA;IACpB,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAc;IAC1C,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;AAC3E,CAAC;AAED,SAAS,qBAAqB,CAC5B,OAA+B,EAC/B,IAAY,EACZ,KAAc;IAEd,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAA;IAC1C,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAChC,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,OAA+B,EAAE,YAAsB;IACrF,OAAO,CAAC,mBAAmB,CAAC,GAAG,YAAY,CAAC,MAAM,CAAA;IAClD,IAAI,YAAY,CAAC,aAAa,EAAE,CAAC;QAC/B,OAAO,CAAC,wBAAwB,CAAC,GAAG,YAAY,CAAC,aAAa,CAAA;IAChE,CAAC;IACD,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,OAAO,CAAC,0BAA0B,CAAC,GAAG,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACxE,CAAC;AACH,CAAC;AAQD,SAAS,kBAAkB,CAAC,IAAc,EAAE,QAAgB,EAAE,OAAsB;IAClF,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC,CAAA;IACxD,IAAI,eAAe,EAAE,CAAC;QACpB,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAChF,IAAI,cAAc,EAAE,CAAC;YACnB,OAAO;gBACL,kBAAkB,EAAE,oBAAoB,CAAC,cAAc,CAAC,kBAAkB,CAAC;gBAC3E,mBAAmB,EAAE,oBAAoB,CAAC,cAAc,CAAC,mBAAmB,CAAC;gBAC7E,wBAAwB,EAAE,oBAAoB,CAAC,cAAc,CAAC,wBAAwB,CAAC;aACxF,CAAA;QACH,CAAC;QACD,OAAO;YACL,kBAAkB,EAAE,oBAAoB,CAAC,eAAe,CAAC,QAAQ,CAAC,kBAAkB,CAAC;YACrF,mBAAmB,EAAE,oBAAoB,CAAC,eAAe,CAAC,QAAQ,CAAC,mBAAmB,CAAC;YACvF,wBAAwB,EAAE,oBAAoB,CAAC,eAAe,CAAC,QAAQ,CAAC,wBAAwB,CAAC;SAClG,CAAA;IACH,CAAC;IAED,OAAO;QACL,kBAAkB,EAAE,oBAAoB,CAAC,IAAI,CAAC,yBAAyB,CAAC;QACxE,mBAAmB,EAAE,oBAAoB,CAAC,IAAI,CAAC,0BAA0B,CAAC;QAC1E,wBAAwB,EAAE,oBAAoB,CAAC,IAAI,CAAC,+BAA+B,CAAC;KACrF,CAAA;AACH,CAAC;AAED,MAAM,UAAU,wBAAwB,CACtC,OAA8B,EAC9B,eAAuC,EACvC,YAAwB,EACxB,YAAsB;IAEtB,MAAM,QAAQ,GAAG,mBAAmB,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;IAC3D,MAAM,OAAO,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAA;IAChD,MAAM,OAAO,GAAG,kBAAkB,CAAC,YAAY,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;IACnE,MAAM,WAAW,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAA;IAEzE,MAAM,aAAa,GAAG,WAAW,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QAC7D,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC;QAC7B,CAAC,CAAC,cAAc,CAAC,YAAY,CAAC,CAAA;IAEhC,IAAI,KAAwB,CAAA;IAC5B,IAAI,aAAa,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,GAAG,EAAE,GAAG,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,CAAA;IAC/C,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,uBAAuB,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;IAC3E,CAAC;IAED,IAAI,gBAAgB,GAAkB,IAAI,CAAA;IAC1C,IACE,OAAO,CAAC,kBAAkB,KAAK,IAAI;QACnC,OAAO,CAAC,mBAAmB,KAAK,IAAI;QACpC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC3C,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,mBAAmB,CAAC,EAC5C,CAAC;QACD,0EAA0E;QAC1E,2CAA2C;QAC3C,MAAM,mBAAmB,GAAG,OAAO,CAAC,wBAAwB,IAAI,OAAO,CAAC,kBAAkB,CAAA;QAC1F,gBAAgB,GAAG,CACjB,KAAK,CAAC,gBAAgB,GAAG,OAAO,CAAC,kBAAkB;cACjD,KAAK,CAAC,iBAAiB,GAAG,mBAAmB;cAC7C,KAAK,CAAC,YAAY,GAAG,OAAO,CAAC,mBAAmB,CACnD,GAAG,SAAS,CAAA;IACf,CAAC;IAED,OAAO;QACL,KAAK;QACL,OAAO,EAAE;YACP,QAAQ;YACR,OAAO;YACP,kBAAkB,EAAE,OAAO,CAAC,kBAAkB;YAC9C,mBAAmB,EAAE,OAAO,CAAC,mBAAmB;YAChD,wBAAwB,EAAE,OAAO,CAAC,wBAAwB;SAC3D;QACD,gBAAgB;KACjB,CAAA;AACH,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,eAAuC,EACvC,YAAsB,EACtB,SAA4B,EAC5B,SAAiB,EACjB,SAAiB;IAEjB,MAAM,OAAO,GAA2B,EAAE,GAAG,eAAe,EAAE,CAAA;IAC9D,OAAO,CAAC,sBAAsB,CAAC,GAAG,SAAS,CAAA;IAC3C,OAAO,CAAC,sBAAsB,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC5E,sBAAsB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IAC7C,qBAAqB,CAAC,OAAO,EAAE,2BAA2B,EAAE,YAAY,CAAC,eAAe,CAAC,CAAA;IACzF,qBAAqB,CAAC,OAAO,EAAE,6BAA6B,EAAE,YAAY,CAAC,WAAW,CAAC,CAAA;IACvF,qBAAqB,CAAC,OAAO,EAAE,gCAAgC,EAAE,YAAY,CAAC,cAAc,CAAC,CAAA;IAC7F,OAAO,CAAC,oBAAoB,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAA;IAC1D,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC9B,OAAO,CAAC,mBAAmB,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,OAAO,CAAA;IAC1D,CAAC;IACD,qBAAqB,CAAC,OAAO,EAAE,iCAAiC,EAAE,SAAS,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAA;IACvG,qBAAqB,CAAC,OAAO,EAAE,kCAAkC,EAAE,SAAS,CAAC,OAAO,CAAC,mBAAmB,CAAC,CAAA;IACzG,qBAAqB,CAAC,OAAO,EAAE,wCAAwC,EAAE,SAAS,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAA;IACpH,OAAO,CAAC,wBAAwB,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1D,OAAO,CAAC,wBAAwB,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;IACvE,OAAO,CAAC,+BAA+B,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;IACpF,OAAO,CAAC,yBAAyB,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAA;IACzE,OAAO,CAAC,wBAAwB,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;IACvE,IAAI,SAAS,CAAC,gBAAgB,KAAK,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,gBAAgB,CAAC,EAAE,CAAC;QACvF,OAAO,CAAC,8BAA8B,CAAC,GAAG,SAAS,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IACjF,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,eAAuC,EACvC,YAAsB,EACtB,SAAiB;IAEjB,MAAM,OAAO,GAA2B,EAAE,GAAG,eAAe,EAAE,CAAA;IAC9D,OAAO,CAAC,sBAAsB,CAAC,GAAG,SAAS,CAAA;IAC3C,sBAAsB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IAC7C,OAAO,OAAO,CAAA;AAChB,CAAC"}
+{"version":3,"file":"telemetry.js","sourceRoot":"","sources":["../../src/proxy/telemetry.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAA;AACrE,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAA;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,oBAAoB,CAAA;AAE5D,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;AAoCjC,MAAM,WAAW,GAAgB;IAC/B,WAAW,EAAE,CAAC;IACd,gBAAgB,EAAE,CAAC;IACnB,iBAAiB,EAAE,CAAC;IACpB,YAAY,EAAE,CAAC;IACf,WAAW,EAAE,CAAC;CACf,CAAA;AAED,SAAS,gBAAgB,CAAC,KAAc;IACtC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACxC,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,4EAA4E;IAC5E,wEAAwE;IACxE,0EAA0E;IAC1E,4EAA4E;IAC5E,yDAAyD;IACzD,MAAM,SAAS,GAAG,YAAY,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;IAEhD,MAAM,KAAK,GAAG,KAAgC,CAAA;IAC9C,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAA;IAClG,IAAI,KAAK,GAAG,gBAAgB,CAC1B,KAAK,CAAC,WAAW;WACd,KAAK,CAAC,YAAY;WAClB,KAAK,CAAC,YAAY;WAClB,KAAK,CAAC,aAAa;WACnB,KAAK,CAAC,iBAAiB;WACvB,KAAK,CAAC,kBAAkB;WACxB,KAAK,CAAC,2BAA2B;WACjC,KAAK,CAAC,uBAAuB,CACjC,CAAA;IACD,IAAI,MAAM,GAAG,gBAAgB,CAC3B,KAAK,CAAC,YAAY;WACf,KAAK,CAAC,aAAa;WACnB,KAAK,CAAC,gBAAgB;WACtB,KAAK,CAAC,iBAAiB;WACvB,KAAK,CAAC,kBAAkB;WACxB,KAAK,CAAC,sBAAsB,CAChC,CAAA;IAED,wEAAwE;IACxE,0EAA0E;IAC1E,0DAA0D;IAC1D,IAAI,SAAS,CAAC,WAAW,GAAG,CAAC;QAAE,KAAK,GAAG,SAAS,CAAC,WAAW,CAAA;IAC5D,IAAI,SAAS,CAAC,YAAY,GAAG,CAAC;QAAE,MAAM,GAAG,SAAS,CAAC,YAAY,CAAA;IAE/D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,GAAG,KAAK,CAAA;QAChB,CAAC;aAAM,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACvD,MAAM,GAAG,KAAK,GAAG,KAAK,CAAA;QACxB,CAAC;aAAM,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;YACxD,KAAK,GAAG,KAAK,GAAG,MAAM,CAAA;QACxB,CAAC;IACH,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,iBAAiB,EAAE,KAAK,CAAC,CAAA;IACtE,OAAO;QACL,WAAW,EAAE,KAAK;QAClB,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,iBAAiB,CAAC;QACxD,iBAAiB;QACjB,YAAY,EAAE,MAAM;QACpB,WAAW,EAAE,KAAK,GAAG,MAAM;KAC5B,CAAA;AACH,CAAC;AAED,kGAAkG;AAClG,MAAM,wBAAwB,GAAG,CAAC,CAAA;AAElC,SAAS,uBAAuB,CAAC,UAAkB,EAAE,WAAmB;IACtE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAA;IAC/F,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAA;IACjG,OAAO;QACL,WAAW;QACX,gBAAgB,EAAE,WAAW;QAC7B,iBAAiB,EAAE,CAAC;QACpB,YAAY;QACZ,WAAW,EAAE,WAAW,GAAG,YAAY;QACvC,MAAM,EAAE,WAAW;KACpB,CAAA;AACH,CAAC;AAED,SAAS,aAAa,CAAC,IAAgB;IACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IAC9B,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,iBAAiB,GAAG,CAAC,CAAA;IAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QAC3B,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,SAAQ;QAE1C,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;QACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,QAAQ;YAAE,SAAQ;QAE1D,IAAI,MAA+B,CAAA;QACnC,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAA4B,CAAA;QACzD,CAAC;QAAC,MAAM,CAAC;YACP,SAAQ;QACV,CAAC;QAED,MAAM,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAClD,IAAI,WAAW,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAChC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,CAAC,CAAA;YAC5D,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC,CAAA;YAC/D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,CAAC,CAAA;YAC5D,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,WAAW,CAAC,iBAAiB,CAAC,CAAA;QAChF,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAA;QAC9B,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAE,OAAmC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QACtI,IAAI,YAAY,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACjC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,WAAW,CAAC,CAAA;YAC7D,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC,YAAY,CAAC,CAAA;YAChE,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,WAAW,CAAC,CAAA;YAC7D,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,YAAY,CAAC,iBAAiB,CAAC,CAAA;QACjF,CAAC;IACH,CAAC;IAED,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;QACrB,WAAW,GAAG,WAAW,GAAG,YAAY,CAAA;IAC1C,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAA;IACvD,OAAO;QACL,WAAW;QACX,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAAC;QACnD,iBAAiB,EAAE,MAAM;QACzB,YAAY;QACZ,WAAW;KACZ,CAAA;AACH,CAAC;AAED,SAAS,cAAc,CAAC,IAAgB;IACtC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAA4B,CAAA;QAC1E,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAC7C,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,MAAM,CAAA;QACf,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAA;QAC9B,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,gBAAgB,CAAE,OAAmC,CAAC,KAAK,CAAC,CAAA;YAC3E,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBAC3B,OAAO,MAAM,CAAA;YACf,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAA;QAC5B,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,gBAAgB,CAAE,MAAkC,CAAC,KAAK,CAAC,CAAA;YAC1E,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBAC3B,OAAO,MAAM,CAAA;YACf,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAA;IACpB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,WAAW,CAAA;IACpB,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAc;IAC1C,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;AAC3E,CAAC;AAED,SAAS,qBAAqB,CAC5B,OAA+B,EAC/B,IAAY,EACZ,KAAc;IAEd,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAA;IAC1C,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAChC,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,OAA+B,EAAE,YAAsB;IACrF,OAAO,CAAC,mBAAmB,CAAC,GAAG,YAAY,CAAC,MAAM,CAAA;IAClD,IAAI,YAAY,CAAC,aAAa,EAAE,CAAC;QAC/B,OAAO,CAAC,wBAAwB,CAAC,GAAG,YAAY,CAAC,aAAa,CAAA;IAChE,CAAC;IACD,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,OAAO,CAAC,0BAA0B,CAAC,GAAG,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACxE,CAAC;AACH,CAAC;AAQD,SAAS,iBAAiB,CAAC,OAA+B,EAAE,OAAwB;IAClF,qBAAqB,CAAC,OAAO,EAAE,iCAAiC,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAA;IAC7F,qBAAqB,CAAC,OAAO,EAAE,kCAAkC,EAAE,OAAO,CAAC,mBAAmB,CAAC,CAAA;IAC/F,qBAAqB,CAAC,OAAO,EAAE,wCAAwC,EAAE,OAAO,CAAC,wBAAwB,CAAC,CAAA;AAC5G,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAc,EAAE,QAAgB,EAAE,OAAsB;IAClF,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC,CAAA;IACxD,IAAI,eAAe,EAAE,CAAC;QACpB,MAAM,cAAc,GAAG,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAChF,IAAI,cAAc,EAAE,CAAC;YACnB,OAAO;gBACL,kBAAkB,EAAE,oBAAoB,CAAC,cAAc,CAAC,kBAAkB,CAAC;gBAC3E,mBAAmB,EAAE,oBAAoB,CAAC,cAAc,CAAC,mBAAmB,CAAC;gBAC7E,wBAAwB,EAAE,oBAAoB,CAAC,cAAc,CAAC,wBAAwB,CAAC;aACxF,CAAA;QACH,CAAC;QACD,OAAO;YACL,kBAAkB,EAAE,oBAAoB,CAAC,eAAe,CAAC,QAAQ,CAAC,kBAAkB,CAAC;YACrF,mBAAmB,EAAE,oBAAoB,CAAC,eAAe,CAAC,QAAQ,CAAC,mBAAmB,CAAC;YACvF,wBAAwB,EAAE,oBAAoB,CAAC,eAAe,CAAC,QAAQ,CAAC,wBAAwB,CAAC;SAClG,CAAA;IACH,CAAC;IAED,OAAO;QACL,kBAAkB,EAAE,oBAAoB,CAAC,IAAI,CAAC,yBAAyB,CAAC;QACxE,mBAAmB,EAAE,oBAAoB,CAAC,IAAI,CAAC,0BAA0B,CAAC;QAC1E,wBAAwB,EAAE,oBAAoB,CAAC,IAAI,CAAC,+BAA+B,CAAC;KACrF,CAAA;AACH,CAAC;AAED,MAAM,UAAU,wBAAwB,CACtC,OAA8B,EAC9B,eAAuC,EACvC,YAAwB,EACxB,YAAsB;IAEtB,MAAM,QAAQ,GAAG,mBAAmB,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;IAC3D,MAAM,OAAO,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAA;IAChD,MAAM,OAAO,GAAG,kBAAkB,CAAC,YAAY,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;IACnE,MAAM,WAAW,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAA;IAEzE,MAAM,aAAa,GAAG,WAAW,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QAC7D,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC;QAC7B,CAAC,CAAC,cAAc,CAAC,YAAY,CAAC,CAAA;IAEhC,IAAI,KAAwB,CAAA;IAC5B,IAAI,aAAa,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,GAAG,EAAE,GAAG,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,CAAA;IAC/C,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,uBAAuB,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;IAC3E,CAAC;IAED,IAAI,gBAAgB,GAAkB,IAAI,CAAA;IAC1C,IACE,OAAO,CAAC,kBAAkB,KAAK,IAAI;QACnC,OAAO,CAAC,mBAAmB,KAAK,IAAI;QACpC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC3C,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,mBAAmB,CAAC,EAC5C,CAAC;QACD,0EAA0E;QAC1E,2CAA2C;QAC3C,MAAM,mBAAmB,GAAG,OAAO,CAAC,wBAAwB,IAAI,OAAO,CAAC,kBAAkB,CAAA;QAC1F,gBAAgB,GAAG,CACjB,KAAK,CAAC,gBAAgB,GAAG,OAAO,CAAC,kBAAkB;cACjD,KAAK,CAAC,iBAAiB,GAAG,mBAAmB;cAC7C,KAAK,CAAC,YAAY,GAAG,OAAO,CAAC,mBAAmB,CACnD,GAAG,SAAS,CAAA;IACf,CAAC;IAED,OAAO;QACL,KAAK;QACL,OAAO,EAAE;YACP,QAAQ;YACR,OAAO;YACP,kBAAkB,EAAE,OAAO,CAAC,kBAAkB;YAC9C,mBAAmB,EAAE,OAAO,CAAC,mBAAmB;YAChD,wBAAwB,EAAE,OAAO,CAAC,wBAAwB;SAC3D;QACD,gBAAgB;KACjB,CAAA;AACH,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,eAAuC,EACvC,YAAsB,EACtB,SAA4B,EAC5B,SAAiB,EACjB,SAAiB;IAEjB,MAAM,OAAO,GAA2B,EAAE,GAAG,eAAe,EAAE,CAAA;IAC9D,OAAO,CAAC,sBAAsB,CAAC,GAAG,SAAS,CAAA;IAC3C,OAAO,CAAC,sBAAsB,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC5E,sBAAsB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IAC7C,qBAAqB,CAAC,OAAO,EAAE,2BAA2B,EAAE,YAAY,CAAC,eAAe,CAAC,CAAA;IACzF,qBAAqB,CAAC,OAAO,EAAE,6BAA6B,EAAE,YAAY,CAAC,WAAW,CAAC,CAAA;IACvF,qBAAqB,CAAC,OAAO,EAAE,gCAAgC,EAAE,YAAY,CAAC,cAAc,CAAC,CAAA;IAC7F,OAAO,CAAC,oBAAoB,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAA;IAC1D,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC9B,OAAO,CAAC,mBAAmB,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC,OAAO,CAAA;IAC1D,CAAC;IACD,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,CAAA;IAC7C,OAAO,CAAC,wBAAwB,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1D,OAAO,CAAC,wBAAwB,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;IACvE,OAAO,CAAC,+BAA+B,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;IACpF,OAAO,CAAC,yBAAyB,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAA;IACzE,OAAO,CAAC,wBAAwB,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;IACvE,IAAI,SAAS,CAAC,gBAAgB,KAAK,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,gBAAgB,CAAC,EAAE,CAAC;QACvF,OAAO,CAAC,8BAA8B,CAAC,GAAG,SAAS,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IACjF,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,2GAA2G;AAC3G,MAAM,UAAU,6BAA6B,CAC3C,eAAuC,EACvC,YAAsB,EACtB,OAA8B;IAE9B,MAAM,OAAO,GAA2B,EAAE,GAAG,eAAe,EAAE,CAAA;IAC9D,OAAO,CAAC,sBAAsB,CAAC,GAAG,OAAO,CAAC,SAAS,CAAA;IACnD,sBAAsB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;IAC7C,iBAAiB,CAAC,OAAO,EAAE,kBAAkB,CAAC,YAAY,EAAE,mBAAmB,CAAC,YAAY,EAAE,OAAO,CAAC,EAAE,uBAAuB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IAC1I,OAAO,OAAO,CAAA;AAChB,CAAC"}

package/dist/routing-policy/policy.d.ts

@@ -0,0 +1,149 @@
+/**
+ * A routing policy says which sellers may serve a request and how the
+ * eligible ones are ranked. Policies are set at several levels (gateway
+ * default, workspace, member, API key, preset) and combined with
+ * `narrowPolicy`: a lower level can only restrict what the level above it
+ * allows, never widen it.
+ *
+ * The gateway resolves the effective policy for each request and hands it to
+ * the buyer in `ROUTING_POLICY_HEADER`, authenticated by
+ * `GATEWAY_CONTROL_HEADER`. The buyer narrows it under its own config (hard
+ * limits, plus routing preferences for automatic routing; see
+ * `proxy/route-policy.ts`), so a request can never escape the buyer's
+ * configuration either.
+ */
+export declare const ROUTING_POLICY_HEADER = "x-antseed-routing-policy";
+/** Shared secret proving the routing policy came from the local gateway. */
+export declare const GATEWAY_CONTROL_HEADER = "x-antseed-gateway-auth";
+/** File, relative to the data dir, holding the gateway↔buyer control secret. */
+export declare const GATEWAY_CONTROL_SECRET_FILE = "gateway/buyer-control.secret";
+/** Overrides the secret file, e.g. when the buyer and gateway run in separate containers. */
+export declare const GATEWAY_CONTROL_SECRET_ENV = "ANTSEED_GATEWAY_CONTROL_SECRET";
+export type RoutingSort = 'balanced' | 'price' | 'latency' | 'trust';
+export interface RoutingPolicy {
+    /** Only these sellers may serve. Undefined means any seller; an empty list means none. */
+    allowedPeerIds?: string[];
+    /** These sellers never serve. */
+    blockedPeerIds?: string[];
+    /**
+     * Saved peer lists (ids), by reference, so editing a list changes every
+     * policy that uses it. Allowed lists add their members to the allowed
+     * sellers (the allow list exists once either field is set); blocked lists
+     * add theirs to the blocked ones. The gateway expands them with
+     * `expandPeerLists` before routing; the buyer refuses policies that still
+     * carry them.
+     */
+    allowedPeerLists?: string[];
+    blockedPeerLists?: string[];
+    /**
+     * Further allow specs a seller must also match, each read like
+     * `allowedPeerIds` ∪ `allowedPeerLists` (an AND of ORs). `narrowPolicy`
+     * produces them when it combines allow specs that reference peer lists, so
+     * a lower level adding a list can never widen the level above it.
+     * `expandPeerLists` intersects them into `allowedPeerIds`.
+     */
+    allowedPeerGroups?: AllowGroup[];
+    /** Minimum trust score, 0–100. */
+    minTrustScore?: number;
+    /** Minimum reputation, 0–100. */
+    minReputation?: number;
+    /** Only sellers whose responses pass a verifier (e.g. TEE attestation). */
+    requireVerified?: boolean;
+    /**
+     * Only sellers advertising the TEE verifier capability. A capability check,
+     * not a verification result, so it works whether or not this buyer runs
+     * verification.
+     */
+    requireTee?: boolean;
+    /** Price caps; a seller over any cap is not eligible. */
+    maxInputUsdPerMillion?: number;
+    maxOutputUsdPerMillion?: number;
+    maxCachedInputUsdPerMillion?: number;
+    maxImageUsdPerImage?: number;
+    /** Rank free sellers first among the eligible ones. */
+    preferFreePeers?: boolean;
+    /** How eligible sellers are ordered. Defaults to 'balanced'. */
+    sort?: RoutingSort;
+    /**
+     * Only these models (service ids, without a `peer@` prefix), matched with
+     * `sameRoutingModel`. Undefined means any model.
+     */
+    allowedModels?: string[];
+    /**
+     * Ordered sellers to try first per model (a fallback chain). Sellers that
+     * the rest of the policy excludes are skipped; after the chain the normal
+     * ranking continues unless `strict` is set on the entry. Keys are matched
+     * with `sameRoutingModel`.
+     */
+    modelRoutes?: Record<string, ModelRoute>;
+}
+/** One allow spec: a seller matches when it is in `peerIds` or in any of `peerLists`. */
+export interface AllowGroup {
+    peerIds?: string[];
+    peerLists?: string[];
+}
+export interface ModelRoute {
+    peerIds: string[];
+    /** Only the listed sellers may serve this model. */
+    strict?: boolean;
+}
+/** The service part of a model id: `peer@model` → `model`. */
+export declare function modelServiceId(model: string): string;
+/**
+ * The key every policy model comparison uses (gateway `allowedModels`, the
+ * buyer's allow check, per-model routes), the same canonical key the buyer
+ * routes by: a pinned `peer@model` counts as its service, case and cosmetic
+ * variants (`GPT-5.6`, `gpt-56`, vendor paths, release dates) collapse.
+ */
+export declare function policyModelKey(model: string): string;
+/** Whether two model ids name the same model for routing-policy purposes. */
+export declare function sameRoutingModel(a: string, b: string): boolean;
+/** The policy's route for a model, by exact key first, then by `sameRoutingModel`. */
+export declare function findModelRoute(policy: RoutingPolicy | null | undefined, model: string | null | undefined): ModelRoute | null;
+export declare function normalizePeerId(peerId: string): string;
+/**
+ * Combines a parent policy with a child's. Restrictions accumulate (allow
+ * specs intersect as sets of sellers, peer lists included, block lists
+ * union, minimums take the higher value, caps the lower, `requireVerified`
+ * and `requireTee` are sticky); ranking
+ * preferences (`sort`, `preferFreePeers`, non-strict per-model routes) take
+ * the child's value when it sets one. A strict parent route stays strict and
+ * can only lose sellers.
+ */
+export declare function narrowPolicy(parent: RoutingPolicy, child: RoutingPolicy | null | undefined): RoutingPolicy;
+export declare function normalizePolicy(policy: RoutingPolicy): RoutingPolicy;
+/**
+ * Replaces peer list references with the lists' current members. A list that
+ * no longer exists contributes no sellers, so an allow list made only of
+ * deleted lists lets no seller serve (it never widens to "any seller").
+ * Expand each level before `narrowPolicy`, so allow lists intersect as sets
+ * of sellers rather than as list ids.
+ */
+export declare function expandPeerLists(policy: RoutingPolicy, listPeers: (listId: string) => readonly string[] | null): RoutingPolicy;
+/**
+ * The policy without settings that change nothing: the default sort, flags
+ * set to false, an empty route map. A policy that is empty after this routes
+ * exactly like no policy at all, so the gateway does not send it.
+ */
+export declare function meaningfulPolicy(policy: RoutingPolicy): RoutingPolicy;
+/**
+ * Fields where `sent` asked for more than `effective` (the policy after
+ * narrowing `sent` under every level above it) allows: sellers or models the
+ * levels above do not allow, a looser minimum or price cap, a requirement
+ * turned off, a model route that lost sellers. Both must have their peer
+ * lists expanded. Settings `sent` leaves out never count.
+ */
+export declare function narrowedFields(sent: RoutingPolicy, effective: RoutingPolicy): string[];
+/** Whether the policy lets this seller serve at all (allow and block lists only). */
+export declare function policyAllowsPeer(policy: RoutingPolicy, peerId: string): boolean;
+/**
+ * The `allowedModels` check shared by the gateway and the buyer. A pinned
+ * `peer@model` is judged by its service; with an allow list, no model at all
+ * is refused rather than routed to anything.
+ */
+export declare function policyAllowsModel(policy: RoutingPolicy | null | undefined, model: string | null | undefined): boolean;
+export declare function encodePolicyHeader(policy: RoutingPolicy): string;
+/** Returns null for a malformed header; callers must then reject the request rather than route unrestricted. */
+export declare function decodePolicyHeader(value: string): RoutingPolicy | null;
+export declare function isRoutingPolicy(value: unknown): value is RoutingPolicy;
+//# sourceMappingURL=policy.d.ts.map

package/dist/routing-policy/policy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"policy.d.ts","sourceRoot":"","sources":["../../src/routing-policy/policy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,eAAO,MAAM,qBAAqB,6BAA6B,CAAA;AAC/D,4EAA4E;AAC5E,eAAO,MAAM,sBAAsB,2BAA2B,CAAA;AAC9D,gFAAgF;AAChF,eAAO,MAAM,2BAA2B,iCAAiC,CAAA;AACzE,6FAA6F;AAC7F,eAAO,MAAM,0BAA0B,mCAAmC,CAAA;AAE1E,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,OAAO,GAAG,SAAS,GAAG,OAAO,CAAA;AAEpE,MAAM,WAAW,aAAa;IAC5B,0FAA0F;IAC1F,cAAc,CAAC,EAAE,MAAM,EAAE,CAAA;IACzB,iCAAiC;IACjC,cAAc,CAAC,EAAE,MAAM,EAAE,CAAA;IACzB;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAA;IAC3B,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAA;IAC3B;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,UAAU,EAAE,CAAA;IAChC,kCAAkC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,iCAAiC;IACjC,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,2EAA2E;IAC3E,eAAe,CAAC,EAAE,OAAO,CAAA;IACzB;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,yDAAyD;IACzD,qBAAqB,CAAC,EAAE,MAAM,CAAA;IAC9B,sBAAsB,CAAC,EAAE,MAAM,CAAA;IAC/B,2BAA2B,CAAC,EAAE,MAAM,CAAA;IACpC,mBAAmB,CAAC,EAAE,MAAM,CAAA;IAC5B,uDAAuD;IACvD,eAAe,CAAC,EAAE,OAAO,CAAA;IACzB,gEAAgE;IAChE,IAAI,CAAC,EAAE,WAAW,CAAA;IAClB;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,EAAE,CAAA;IACxB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;CACzC;AAED,yFAAyF;AACzF,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;CACrB;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,EAAE,CAAA;IACjB,oDAAoD;IACpD,MAAM,CAAC,EAAE,OAAO,CAAA;CACjB;AAED,8DAA8D;AAC9D,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAIpD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGpD;AAED,6EAA6E;AAC7E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAG9D;AAED,sFAAsF;AACtF,wBAAgB,cAAc,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,UAAU,GAAG,IAAI,CAU5H;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEtD;AAgJD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,GAAG,IAAI,GAAG,SAAS,GAAG,aAAa,CAsB1G;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,aAAa,GAAG,aAAa,CAwBpE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,SAAS,MAAM,EAAE,GAAG,IAAI,GAAG,aAAa,CAc7H;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,aAAa,GAAG,aAAa,CAQrE;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,GAAG,MAAM,EAAE,CA8BtF;AAED,qFAAqF;AACrF,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAO/E;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,aAAa,GAAG,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,OAAO,CAIrH;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,aAAa,GAAG,MAAM,CAEhE;AAED,gHAAgH;AAChH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI,CAUtE;AAUD,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,aAAa,CA+BtE"}

package/dist/routing-policy/policy.js

@@ -0,0 +1,450 @@
+/**
+ * A routing policy says which sellers may serve a request and how the
+ * eligible ones are ranked. Policies are set at several levels (gateway
+ * default, workspace, member, API key, preset) and combined with
+ * `narrowPolicy`: a lower level can only restrict what the level above it
+ * allows, never widen it.
+ *
+ * The gateway resolves the effective policy for each request and hands it to
+ * the buyer in `ROUTING_POLICY_HEADER`, authenticated by
+ * `GATEWAY_CONTROL_HEADER`. The buyer narrows it under its own config (hard
+ * limits, plus routing preferences for automatic routing; see
+ * `proxy/route-policy.ts`), so a request can never escape the buyer's
+ * configuration either.
+ */
+import { canonicalModelKey } from '@antseed/node/model-identity';
+export const ROUTING_POLICY_HEADER = 'x-antseed-routing-policy';
+/** Shared secret proving the routing policy came from the local gateway. */
+export const GATEWAY_CONTROL_HEADER = 'x-antseed-gateway-auth';
+/** File, relative to the data dir, holding the gateway↔buyer control secret. */
+export const GATEWAY_CONTROL_SECRET_FILE = 'gateway/buyer-control.secret';
+/** Overrides the secret file, e.g. when the buyer and gateway run in separate containers. */
+export const GATEWAY_CONTROL_SECRET_ENV = 'ANTSEED_GATEWAY_CONTROL_SECRET';
+/** The service part of a model id: `peer@model` → `model`. */
+export function modelServiceId(model) {
+    const trimmed = model.trim();
+    const at = trimmed.indexOf('@');
+    return at > 0 ? trimmed.slice(at + 1) : trimmed;
+}
+/**
+ * The key every policy model comparison uses (gateway `allowedModels`, the
+ * buyer's allow check, per-model routes), the same canonical key the buyer
+ * routes by: a pinned `peer@model` counts as its service, case and cosmetic
+ * variants (`GPT-5.6`, `gpt-56`, vendor paths, release dates) collapse.
+ */
+export function policyModelKey(model) {
+    const service = modelServiceId(model);
+    return canonicalModelKey(service) || service.toLowerCase();
+}
+/** Whether two model ids name the same model for routing-policy purposes. */
+export function sameRoutingModel(a, b) {
+    const key = policyModelKey(a);
+    return key !== '' && key === policyModelKey(b);
+}
+/** The policy's route for a model, by exact key first, then by `sameRoutingModel`. */
+export function findModelRoute(policy, model) {
+    if (!policy?.modelRoutes || !model)
+        return null;
+    const exact = policy.modelRoutes[model];
+    if (exact)
+        return exact;
+    const wanted = policyModelKey(model);
+    if (!wanted)
+        return null;
+    for (const [key, route] of Object.entries(policy.modelRoutes)) {
+        if (policyModelKey(key) === wanted)
+            return route;
+    }
+    return null;
+}
+export function normalizePeerId(peerId) {
+    return peerId.trim().toLowerCase().replace(/^0x/, '');
+}
+function normalizeList(values) {
+    if (values === undefined)
+        return undefined;
+    return [...new Set(values.map(normalizePeerId).filter((value) => value.length > 0))];
+}
+function intersect(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    const right = new Set(b);
+    return a.filter((value) => right.has(value));
+}
+function union(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    return [...new Set([...a, ...b])];
+}
+function maxOf(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    return Math.max(a, b);
+}
+function minOf(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    return Math.min(a, b);
+}
+function normalizeListIds(values) {
+    if (values === undefined)
+        return undefined;
+    return [...new Set(values.map((value) => value.trim()).filter((value) => value.length > 0))];
+}
+function intersectModels(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    const right = new Set(b.map(policyModelKey));
+    return a.filter((model) => right.has(policyModelKey(model)));
+}
+function normalizeModels(values) {
+    if (values === undefined)
+        return undefined;
+    const seen = new Set();
+    const result = [];
+    for (const value of values) {
+        const model = value.trim();
+        const key = policyModelKey(model);
+        if (!model || seen.has(key))
+            continue;
+        seen.add(key);
+        result.push(model);
+    }
+    return result;
+}
+/** A policy's allow specs as groups that must all match; empty when any seller may serve. */
+function allowGroupsOf(policy) {
+    const groups = (policy.allowedPeerGroups ?? []).map((group) => ({ peerIds: group.peerIds ?? [], peerLists: group.peerLists ?? [] }));
+    if (policy.allowedPeerIds !== undefined || policy.allowedPeerLists !== undefined) {
+        groups.unshift({ peerIds: policy.allowedPeerIds ?? [], peerLists: policy.allowedPeerLists ?? [] });
+    }
+    return groups;
+}
+function isSubset(a, b) {
+    const right = new Set(b);
+    return a.every((value) => right.has(value));
+}
+/**
+ * Combines allow specs as one set per level: a seller must be allowed by
+ * every level (its ids or its lists). Groups without lists intersect at once;
+ * groups with lists stay separate until `expandPeerLists` knows their
+ * members. A group that contains another one adds nothing and is dropped.
+ */
+function combineAllowSpecs(groups) {
+    if (groups.length === 0)
+        return {};
+    let idsOnly;
+    const withLists = [];
+    for (const group of groups) {
+        if (group.peerLists.length === 0)
+            idsOnly = intersect(idsOnly, group.peerIds);
+        else
+            withLists.push(group);
+    }
+    const all = idsOnly === undefined ? withLists : [{ peerIds: idsOnly, peerLists: [] }, ...withLists];
+    const within = (a, b) => isSubset(a.peerIds, b.peerIds) && isSubset(a.peerLists, b.peerLists);
+    let kept = [];
+    for (const group of all) {
+        if (kept.some((other) => within(other, group)))
+            continue;
+        kept = [...kept.filter((other) => !within(group, other)), group];
+    }
+    const [first, ...rest] = kept;
+    const result = {};
+    if (first.peerIds.length > 0 || first.peerLists.length === 0)
+        result.allowedPeerIds = first.peerIds;
+    if (first.peerLists.length > 0)
+        result.allowedPeerLists = first.peerLists;
+    if (rest.length > 0) {
+        result.allowedPeerGroups = rest.map((group) => ({
+            ...(group.peerIds.length > 0 ? { peerIds: group.peerIds } : {}),
+            peerLists: group.peerLists,
+        }));
+    }
+    return result;
+}
+/**
+ * A child's route for a model under the parent's. Under a strict parent the
+ * result stays strict and may only name the parent's sellers (the child's
+ * order, or the parent's list when the child names none); otherwise the
+ * child's chain replaces the parent's.
+ */
+function narrowRoute(parent, child) {
+    if (!parent.strict)
+        return { peerIds: [...child.peerIds], ...(child.strict ? { strict: true } : {}) };
+    if (child.peerIds.length === 0)
+        return { peerIds: [...parent.peerIds], strict: true };
+    const allowed = new Set(parent.peerIds);
+    return { peerIds: child.peerIds.filter((peerId) => allowed.has(peerId)), strict: true };
+}
+/** Merges route maps by model (`policyModelKey`), keeping the first spelling of each key. */
+function narrowModelRoutes(parent, child) {
+    if (!child)
+        return parent && Object.keys(parent).length > 0 ? parent : undefined;
+    const result = { ...(parent ?? {}) };
+    const keys = new Map(Object.keys(result).map((model) => [policyModelKey(model), model]));
+    for (const [model, route] of Object.entries(child)) {
+        const key = policyModelKey(model);
+        const existing = keys.get(key);
+        if (existing === undefined) {
+            keys.set(key, model);
+            result[model] = route;
+        }
+        else {
+            result[existing] = narrowRoute(result[existing], route);
+        }
+    }
+    return Object.keys(result).length > 0 ? result : undefined;
+}
+/**
+ * Combines a parent policy with a child's. Restrictions accumulate (allow
+ * specs intersect as sets of sellers, peer lists included, block lists
+ * union, minimums take the higher value, caps the lower, `requireVerified`
+ * and `requireTee` are sticky); ranking
+ * preferences (`sort`, `preferFreePeers`, non-strict per-model routes) take
+ * the child's value when it sets one. A strict parent route stays strict and
+ * can only lose sellers.
+ */
+export function narrowPolicy(parent, child) {
+    if (!child)
+        return normalizePolicy(parent);
+    const p = normalizePolicy(parent);
+    const c = normalizePolicy(child);
+    const result = {
+        ...combineAllowSpecs([...allowGroupsOf(p), ...allowGroupsOf(c)]),
+        blockedPeerIds: union(p.blockedPeerIds, c.blockedPeerIds),
+        blockedPeerLists: union(p.blockedPeerLists, c.blockedPeerLists),
+        minTrustScore: maxOf(p.minTrustScore, c.minTrustScore),
+        minReputation: maxOf(p.minReputation, c.minReputation),
+        requireVerified: p.requireVerified || c.requireVerified ? true : undefined,
+        requireTee: p.requireTee || c.requireTee ? true : undefined,
+        maxInputUsdPerMillion: minOf(p.maxInputUsdPerMillion, c.maxInputUsdPerMillion),
+        maxOutputUsdPerMillion: minOf(p.maxOutputUsdPerMillion, c.maxOutputUsdPerMillion),
+        maxCachedInputUsdPerMillion: minOf(p.maxCachedInputUsdPerMillion, c.maxCachedInputUsdPerMillion),
+        maxImageUsdPerImage: minOf(p.maxImageUsdPerImage, c.maxImageUsdPerImage),
+        preferFreePeers: c.preferFreePeers ?? p.preferFreePeers,
+        sort: c.sort ?? p.sort,
+        allowedModels: intersectModels(p.allowedModels, c.allowedModels),
+        modelRoutes: narrowModelRoutes(p.modelRoutes, c.modelRoutes),
+    };
+    return stripUndefined(result);
+}
+export function normalizePolicy(policy) {
+    // Keys naming the same model (`GPT-X`, `gpt-x`) collapse into the first,
+    // combined like a parent and child route so a strict entry never loosens.
+    let modelRoutes;
+    if (policy.modelRoutes) {
+        for (const [rawModel, route] of Object.entries(policy.modelRoutes)) {
+            const model = rawModel.trim();
+            if (!model)
+                continue;
+            const normalized = { peerIds: normalizeList(route.peerIds) ?? [], ...(route.strict ? { strict: true } : {}) };
+            modelRoutes = narrowModelRoutes(modelRoutes, { [model]: normalized });
+        }
+    }
+    return stripUndefined({
+        ...policy,
+        allowedModels: normalizeModels(policy.allowedModels),
+        allowedPeerIds: normalizeList(policy.allowedPeerIds),
+        blockedPeerIds: normalizeList(policy.blockedPeerIds),
+        allowedPeerLists: normalizeListIds(policy.allowedPeerLists),
+        blockedPeerLists: normalizeListIds(policy.blockedPeerLists),
+        allowedPeerGroups: policy.allowedPeerGroups?.length
+            ? policy.allowedPeerGroups.map((group) => stripUndefined({ peerIds: normalizeList(group.peerIds), peerLists: normalizeListIds(group.peerLists) }))
+            : undefined,
+        modelRoutes,
+    });
+}
+/**
+ * Replaces peer list references with the lists' current members. A list that
+ * no longer exists contributes no sellers, so an allow list made only of
+ * deleted lists lets no seller serve (it never widens to "any seller").
+ * Expand each level before `narrowPolicy`, so allow lists intersect as sets
+ * of sellers rather than as list ids.
+ */
+export function expandPeerLists(policy, listPeers) {
+    const { allowedPeerLists, blockedPeerLists, allowedPeerGroups, ...rest } = policy;
+    if (allowedPeerLists === undefined && blockedPeerLists === undefined && allowedPeerGroups === undefined)
+        return normalizePolicy(rest);
+    const members = (ids) => ids.flatMap((id) => listPeers(id) ?? []);
+    const expanded = { ...rest };
+    let allowed;
+    for (const group of allowGroupsOf(policy)) {
+        allowed = intersect(allowed, normalizeList([...group.peerIds, ...members(group.peerLists)]));
+    }
+    if (allowed !== undefined)
+        expanded.allowedPeerIds = allowed;
+    if (blockedPeerLists !== undefined && blockedPeerLists.length > 0) {
+        expanded.blockedPeerIds = [...(rest.blockedPeerIds ?? []), ...members(blockedPeerLists)];
+    }
+    return normalizePolicy(expanded);
+}
+/**
+ * The policy without settings that change nothing: the default sort, flags
+ * set to false, an empty route map. A policy that is empty after this routes
+ * exactly like no policy at all, so the gateway does not send it.
+ */
+export function meaningfulPolicy(policy) {
+    const result = normalizePolicy(policy);
+    if (result.sort === 'balanced')
+        delete result.sort;
+    if (result.preferFreePeers === false)
+        delete result.preferFreePeers;
+    if (result.requireVerified === false)
+        delete result.requireVerified;
+    if (result.requireTee === false)
+        delete result.requireTee;
+    if (result.modelRoutes && Object.keys(result.modelRoutes).length === 0)
+        delete result.modelRoutes;
+    return result;
+}
+/**
+ * Fields where `sent` asked for more than `effective` (the policy after
+ * narrowing `sent` under every level above it) allows: sellers or models the
+ * levels above do not allow, a looser minimum or price cap, a requirement
+ * turned off, a model route that lost sellers. Both must have their peer
+ * lists expanded. Settings `sent` leaves out never count.
+ */
+export function narrowedFields(sent, effective) {
+    const fields = [];
+    if (sent.allowedPeerIds !== undefined) {
+        const allowed = effective.allowedPeerIds;
+        if (allowed !== undefined && !isSubset(normalizeList(sent.allowedPeerIds), allowed))
+            fields.push('allowedPeerIds');
+    }
+    if (sent.allowedModels !== undefined && effective.allowedModels !== undefined) {
+        const allowed = new Set(effective.allowedModels.map(policyModelKey));
+        if (sent.allowedModels.some((model) => !allowed.has(policyModelKey(model))))
+            fields.push('allowedModels');
+    }
+    for (const field of ['minTrustScore', 'minReputation']) {
+        if (sent[field] !== undefined && (effective[field] ?? 0) > sent[field])
+            fields.push(field);
+    }
+    for (const field of ['maxInputUsdPerMillion', 'maxOutputUsdPerMillion', 'maxCachedInputUsdPerMillion', 'maxImageUsdPerImage']) {
+        if (sent[field] !== undefined && effective[field] !== undefined && effective[field] < sent[field])
+            fields.push(field);
+    }
+    for (const field of ['requireVerified', 'requireTee']) {
+        if (sent[field] === false && effective[field] === true)
+            fields.push(field);
+    }
+    if (sent.modelRoutes) {
+        for (const [model, route] of Object.entries(sent.modelRoutes)) {
+            const actual = findModelRoute(effective, model);
+            const peers = normalizeList(route.peerIds) ?? [];
+            if (!actual || (route.strict && !actual.strict) || actual.peerIds.length !== peers.length || !isSubset(peers, actual.peerIds)) {
+                fields.push('modelRoutes');
+                break;
+            }
+        }
+    }
+    return fields;
+}
+/** Whether the policy lets this seller serve at all (allow and block lists only). */
+export function policyAllowsPeer(policy, peerId) {
+    const id = normalizePeerId(peerId);
+    if (policy.blockedPeerIds?.some((blocked) => normalizePeerId(blocked) === id))
+        return false;
+    if (policy.allowedPeerIds && !policy.allowedPeerIds.some((allowed) => normalizePeerId(allowed) === id))
+        return false;
+    // Unexpanded list references cannot be checked here; only listed ids count.
+    if (policy.allowedPeerGroups?.some((group) => !group.peerIds?.some((allowed) => normalizePeerId(allowed) === id)))
+        return false;
+    return true;
+}
+/**
+ * The `allowedModels` check shared by the gateway and the buyer. A pinned
+ * `peer@model` is judged by its service; with an allow list, no model at all
+ * is refused rather than routed to anything.
+ */
+export function policyAllowsModel(policy, model) {
+    if (!policy?.allowedModels)
+        return true;
+    if (!model)
+        return false;
+    return policy.allowedModels.some((allowed) => sameRoutingModel(allowed, model));
+}
+export function encodePolicyHeader(policy) {
+    return Buffer.from(JSON.stringify(stripUndefined(policy)), 'utf8').toString('base64url');
+}
+/** Returns null for a malformed header; callers must then reject the request rather than route unrestricted. */
+export function decodePolicyHeader(value) {
+    try {
+        const parsed = JSON.parse(Buffer.from(value, 'base64url').toString('utf8'));
+        if (!isRoutingPolicy(parsed))
+            return null;
+        // The buyer cannot resolve list ids; refuse rather than ignore a restriction.
+        if (parsed.allowedPeerLists !== undefined || parsed.blockedPeerLists !== undefined || parsed.allowedPeerGroups !== undefined)
+            return null;
+        return normalizePolicy(parsed);
+    }
+    catch {
+        return null;
+    }
+}
+function isStringArray(value) {
+    return Array.isArray(value) && value.every((item) => typeof item === 'string');
+}
+function isOptionalNumber(value) {
+    return value === undefined || (typeof value === 'number' && Number.isFinite(value) && value >= 0);
+}
+export function isRoutingPolicy(value) {
+    if (!value || typeof value !== 'object' || Array.isArray(value))
+        return false;
+    const policy = value;
+    const lists = ['allowedPeerIds', 'blockedPeerIds', 'allowedPeerLists', 'blockedPeerLists', 'allowedModels'];
+    if (lists.some((key) => policy[key] !== undefined && !isStringArray(policy[key])))
+        return false;
+    const numbers = ['minTrustScore', 'minReputation', 'maxInputUsdPerMillion', 'maxOutputUsdPerMillion', 'maxCachedInputUsdPerMillion', 'maxImageUsdPerImage'];
+    if (numbers.some((key) => !isOptionalNumber(policy[key])))
+        return false;
+    const flags = ['requireVerified', 'requireTee', 'preferFreePeers'];
+    if (flags.some((key) => policy[key] !== undefined && typeof policy[key] !== 'boolean'))
+        return false;
+    if (policy['sort'] !== undefined && !['balanced', 'price', 'latency', 'trust'].includes(policy['sort']))
+        return false;
+    const groups = policy['allowedPeerGroups'];
+    if (groups !== undefined) {
+        if (!Array.isArray(groups))
+            return false;
+        for (const group of groups) {
+            if (!group || typeof group !== 'object' || Array.isArray(group))
+                return false;
+            const entry = group;
+            if (entry['peerIds'] !== undefined && !isStringArray(entry['peerIds']))
+                return false;
+            if (entry['peerLists'] !== undefined && !isStringArray(entry['peerLists']))
+                return false;
+        }
+    }
+    const routes = policy['modelRoutes'];
+    if (routes !== undefined) {
+        if (!routes || typeof routes !== 'object' || Array.isArray(routes))
+            return false;
+        for (const route of Object.values(routes)) {
+            if (!route || typeof route !== 'object')
+                return false;
+            const entry = route;
+            if (!isStringArray(entry['peerIds']))
+                return false;
+            if (entry['strict'] !== undefined && typeof entry['strict'] !== 'boolean')
+                return false;
+        }
+    }
+    return true;
+}
+function stripUndefined(value) {
+    return Object.fromEntries(Object.entries(value).filter(([, entry]) => entry !== undefined));
+}
+//# sourceMappingURL=policy.js.map