@real-life/trust-protocol 0.3.2 → 0.5.0

package/dist/trust/star.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"star.js","sourceRoot":"","sources":["../../src/trust/star.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,uEAAuE;AACvE,yEAAyE;AACzE,wEAAwE;AACxE,iEAAiE;AACjE,EAAE;AACF,uEAAuE;AACvE,EAAE;AACF,6DAA6D;AAC7D,uEAAuE;AACvE,sEAAsE;AACtE,0EAA0E;AAC1E,uEAAuE;AACvE,yEAAyE;AACzE,+CAA+C;AAC/C,sEAAsE;AACtE,4CAA4C;AAC5C,EAAE;AACF,uEAAuE;AACvE,oEAAoE;AACpE,qEAAqE;AACrE,sEAAsE;AACtE,0EAA0E;AAC1E,qEAAqE;AACrE,oFAAoF;AACpF,uEAAuE;AACvE,yEAAyE;AACzE,wEAAwE;AACxE,yEAAyE;AACzE,uEAAuE;AACvE,yEAAyE;AACzE,mEAAmE;AACnE,EAAE;AACF,+DAA+D;AAC/D,wEAAwE;AACxE,yEAAyE;AACzE,oEAAoE;AACpE,yEAAyE;AACzE,2EAA2E;AAC3E,sEAAsE;AACtE,sEAAsE;AACtE,wEAAwE;AACxE,yDAAyD;AACzD,wEAAwE;AACxE,2EAA2E;AAC3E,yEAAyE;AACzE,wEAAwE;AACxE,2EAA2E;AAC3E,0EAA0E;AAC1E,4EAA4E;AAC5E,4EAA4E;AAC5E,6EAA6E;AAC7E,kEAAkE;AAClE,0EAA0E;AAC1E,yEAAyE;AACzE,4EAA4E;AAC5E,sEAAsE;AACtE,yEAAyE;AACzE,0DAA0D;AAC1D,2EAA2E;AAC3E,yEAAyE;AACzE,cAAc;AACd,EAAE;AACF,gEAAgE;AAChE,qEAAqE;AACrE,uEAAuE;AACvE,wEAAwE;AACxE,wEAAwE;AACxE,kEAAkE;AAClE,qEAAqE;AACrE,0EAA0E;AAC1E,sEAAsE;AACtE,uEAAuE;AACvE,2EAA2E;AAC3E,uEAAuE;AACvE,wEAAwE;AACxE,yEAAyE;AACzE,yEAAyE;AACzE,0EAA0E;AAC1E,sEAAsE;AACtE,oHAAoH;AACpH,kEAAkE;AAClE,yEAAyE;AACzE,+CAA+C;AAC/C,EAAE;AACF,gCAAgC;AAChC,2EAA2E;AAC3E,uEAAuE;AACvE,2DAA2D;AAC3D,uEAAuE;AACvE,0EAA0E;AAC1E,wEAAwE;AACxE,0EAA0E;AAC1E,qEAAqE;AACrE,uEAAuE;AACvE,yEAAyE;AACzE,wEAAwE;AACxE,oEAAoE;AACpE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,YAAY,CAAA;AAErC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAA;AAClD,OAAO,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAA;AACrC,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,eAAe,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAA;AAEnI,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAA;AAGxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAA;AAErC,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,aAAa,EAAE,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAElH,0EAA0E;AAC1E,MAAM,CAAC,MAAM,SAAS,GAAG,4CAA4C,CAAA;AAErE;2BAC2B;AAC3B,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAA;AAErF,MAAM,EAAE,GAAG,IAAI,WAAW,EAAE,CAAA;AAC5B,MAAM,GAAG,GAAG,CAAC,CAAM,EAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAA;AACxD,MAAM,GAAG,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,CAAA;AAC1E,MAAM,MAAM,GAAG,CAAC,MAA6B,EAAE,GAAY,EAAe,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;AAkC7H,MAAM,MAAM,GAAG,CAAC,KAAW,EAA+B,EAAE,CAAE,KAA+C,CAAC,IAAI,CAAA;AAQlH;;wCAEwC;AACxC,MAAM,UAAU,UAAU,CAAE,KAA4B;IACtD,MAAM,GAAG,GAAgB,EAAE,CAAA;IAC3B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACpF,KAAK,MAAM,GAAG,IAAI,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;YACrD,IAAI,GAAG,CAAC,WAAW,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,OAAO,CAAC,EAAE;gBAAE,SAAQ;YAChF,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAA;YAC9B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,WAAW;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAA;QACpE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,+EAA+E;AAC/E,MAAM,QAAQ,GAAG,CAAC,CAA4B,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,eAAe,CAAA;AAEhH;4DAC4D;AAC5D,MAAM,QAAQ,GAAG,CAAC,KAA4B,EAAE,CAA4B,EAAE,UAAkB,EAAW,EAAE,CAC3G,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;AAEtI;gEACgE;AAChE,MAAM,YAAY,GAAG,IAAI,OAAO,EAA4D,CAAA;AAE5F;;0CAE0C;AAC1C,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,IAAwB,EAAU,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;AAEpF,kDAAkD;AAClD,SAAS,MAAM,CAAQ,GAAmB,EAAE,KAA4B,EAAE,CAAY;IACpF,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QAAC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAA;IAAC,CAAC;IAC/G,IAAI,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IAC7C,IAAI,CAAC,MAAM;QAAE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;IACnE,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC5B,IAAI,CAAC,CAAC,EAAE,CAAC;QAAC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;IAAC,CAAC;IAC1H,OAAO,CAAkC,CAAA;AAC3C,CAAC;AAED;+EAC+E;AAC/E,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAA4B,EAAE,CAAmD,EAAW,EAAE,CACxH,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAA;AAE1H;;;wEAGwE;AACxE,SAAS,gBAAgB,CAAK,KAA4B,EAAE,CAAsB;IAChF,MAAM,GAAG,GAA0B,EAAE,CAAA;IACrC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;QAAE,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACtH,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;uCAEuC;AACvC,MAAM,UAAU,cAAc,CAAE,KAA4B;IAC1D,IAAI,aAAa,GAAwC,IAAI,CAAA;IAC7D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC;QACrD,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY,CAAC,CAAA;YAC3F,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,MAAM;gBAAE,OAAO,CAAC,CAAA;YACzJ,OAAO,GAAG,IAAI,CAAA;YACd,OAAO,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,GAAG,CAAC,CAAC,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAA;QAC7G,CAAC,CAAC,CAAA;QACF,IAAI,OAAO;YAAE,CAAC,aAAa,KAAK,EAAE,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,GAAG,EAAE,MAAM,EAAE,CAAA;IAC1F,CAAC;IACD,OAAO,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,KAAoB,CAAA;AAC3E,CAAC;AAED;;kEAEkE;AAClE,MAAM,UAAU,IAAI,CAAQ,GAAmB,EAAE,KAA4B,EAAE,CAAY,EAAE,MAAc;IACzG,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;IAC1B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IACpE,IAAI,CAAC,CAAC,cAAc,KAAK,IAAI,IAAI,CAAC,CAAC,cAAc,KAAK,MAAM;QAAE,OAAO,KAAK,CAAA;IAC1E,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,CAAA;AACpC,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,SAAS,CAAQ,GAAmB,EAAE,KAA4B;IAChF,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC;YAAE,SAAQ;QAChD,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;QACxC,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,YAAY,IAAI,MAAM,EAAE,CAAC,CAAA;IACzG,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAcD,iFAAiF;AACjF,MAAM,CAAC,KAAK,UAAU,UAAU,CAAE,GAAe,EAAE,CAAkB,EAAE,mBAA2B,CAAC,CAAC,uBAAuB;IACzH,MAAM,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC,CAAA;IACpC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IACnB,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;IACtD,OAAO,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAA;AACnD,CAAC;AAED,+EAA+E;AAC/E,MAAM,CAAC,KAAK,UAAU,aAAa,CAAE,GAAe,EAAE,IAAY,EAAE,MAAc,EAAE,CAAkB,EAAE,SAAiB,EAAE,QAAgB,EAAE,KAAW;IACtJ,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAA;IAC3B,MAAM,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,iBAAiB,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAA;IAC7I,wEAAwE;IACxE,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,aAAa;QAAE,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,kBAAkB,aAAa,QAAQ,CAAC,CAAA;IACxH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,uBAAuB,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IAC1J,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,uBAAuB,EAAE,EAAE,CAAA;AACvJ,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,OAAO,CAAQ,GAAmB;IAChD,OAAO;QACL,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC;QACzC,wEAAwE;QACxE,sEAAsE;QACtE,KAAK,EAAE,CAAC,UAAU,EAAE,eAAe,EAAE,QAAQ,EAAE,QAAQ,CAAC;QACxD,KAAK,CAAC,OAAO,CAAE,GAAG;YAChB,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAA;YACvB,MAAM,GAAG,GAAoB,EAAE,CAAA;YAC/B,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAQ;gBAChD,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;gBAC3C,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC;oBAAE,SAAQ;gBACvC,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;gBAC7C,IAAI,CAAC,MAAM;oBAAE,SAAQ;gBACrB,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAA;gBAClE,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;gBAC1B,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;gBAC5B,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;gBAChF,IAAI,CAAC,MAAM;oBAAE,SAAQ;gBACrB,+EAA+E;gBAC/E,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,WAAW,CAAC,CAAA;gBAC5C,MAAM,QAAQ,GAAoB,EAAE,CAAA;gBACpC,KAAK,MAAM,KAAK,IAAI,MAAM;oBAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;gBAC1H,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAA;YACrJ,CAAC;YACD,OAAO,GAAG,CAAA;QACZ,CAAC;QACD,KAAK,CAAE,KAAK,EAAE,QAAQ;YACpB,IAAI,GAAG,GAAG,KAAoB,CAAA;YAC9B,MAAM,QAAQ,GAAoB,EAAE,CAAA;YACpC,IAAI,QAAQ,GAAG,KAAK,CAAA;YACpB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;gBAC9F,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,SAAS,CAAC,CAAA;gBAC7C,MAAM,KAAK,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAA;gBACrC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,YAAY,KAAK,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,WAAW,KAAK,IAAI,IAAI,KAAK,CAAC,WAAW,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,OAAO,CAAC,EAAE;oBAAE,SAAQ;gBACvM,MAAM,CAAC,GAAc,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;gBAC5C,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAA;gBACtC,+DAA+D;gBAC/D,+DAA+D;gBAC/D,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,MAAM,KAAK,CAAC,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;oBACpG,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC;wBAAE,QAAQ,GAAG,IAAI,CAAA;oBAC9C,SAAQ;gBACV,CAAC;gBACD,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBACxB,MAAM,IAAI,GAAc;oBACtB,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,eAAe;oBACpE,iEAAiE;oBACjE,QAAQ,EAAE,EAAE,GAAG,gBAAgB,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE;iBACrJ,CAAA;gBACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC7F,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,aAAa,EAAE,EAAE,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAA;gBACvF,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;YAC9B,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAA;QAC3C,CAAC;KACF,CAAA;AACH,CAAC;AAED;0CAC0C;AAC1C,MAAM,UAAU,KAAK,CAAQ,GAAmB;IAC9C,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QAC9B,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QAClD,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,KAAK,EAAE,KAAoB,EAAE,CAAA;QAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/E,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,KAAK,EAAE,KAAoB,EAAE,CAAA;QAChD,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;QACrB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QACjE,IAAI,IAAe,CAAA;QACnB,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;YAClC,MAAM,QAAQ,GAA0B,EAAE,CAAA;YAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;oBAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAC3G,IAAI,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAA;QACpI,CAAC;;YAAM,IAAI,GAAG,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAA;QAC5E,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,KAAK,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9G,OAAO,EAAE,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,aAAa,EAAE,EAAE,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAA;IAC/G,CAAC,CAAA;AACH,CAAC;AAgBD;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAE,IAAqB,EAAE,IAAS,EAAE,IAAwD,EAAE,QAAgB,EAAE,MAAc,EAAE,KAAa;IACvK,MAAM,IAAI,GAAa,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAA;IAC/E,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC5B,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;IACjD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAsB,CAAA;IAC5D,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAoB,CAAC,CAAC,CAAC,SAAS,CAAA;IACxG,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA,CAAuB,OAAO;IAC3F,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,eAAe,EAAE,CAAA;IAC9F,IAAI,IAAI;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,eAAe,EAAE,CAAA;IACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC9C,IAAI,IAAI,CAAC,IAAI,IAAI,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,eAAe,EAAE,CAAA;IAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAC1E,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,eAAe,EAAE,CAAA;IACjI,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAqB,EAAE,CAAA;IAC5F,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,CAAA;IACtE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,CAAA;IAC3H,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;AAC3C,CAAC;AAED,4DAA4D;AAC5D,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,MAA4B,EAAE,IAAY,EAA+B,EAAE;IACzG,MAAM,GAAG,GAAgC,EAAE,CAAA;IAC3C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAqB,CAAC,IAAI,CAAC,CAAA;IACtF,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AASD,sFAAsF;AACtF,SAAS,YAAY,CAAE,KAA4B,EAAE,IAAY;IAC/D,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IACnC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC,GAAG,CAAC,WAAW,KAAK,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,UAAU,KAAK,EAAE,CAAC,KAAK,CAAC,YAAY;QAAE,OAAO,IAAI,CAAA;IAC1H,OAAO,EAAE,CAAA;AACX,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAM,EAAE,CAAM,EAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAExE,+CAA+C;AAC/C,MAAM,UAAU,MAAM,CAAQ,GAAmB,EAAE,KAAa;IAC9D,OAAO;QACL,KAAK,EAAE,QAAQ;QACf,gDAAgD;QAChD,MAAM,CAAE,OAAO;YACb,OAAO,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAe,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,YAAY,CAAC,CAAA;QACvF,CAAC;QACD,8DAA8D;QAC9D,KAAK,CAAC,OAAO,CAAE,GAAe,EAAE,GAA2B,EAAE,OAAgB;YAC3E,IAAK,GAAG,CAAC,QAAgD,EAAE,SAAS,KAAK,SAAS;gBAAE,OAAO,MAAM,CAAC,mBAAmB,CAAC,CAAA;YACtH,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;YACnD,IAAI,CAAC,EAAE;gBAAE,OAAO,MAAM,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAA;YAC5D,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAA;YAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACtB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAChC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,MAAM,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAA;YAChF,IAAI,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,OAAO,MAAM,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAA;YACvF,IAAI,GAAG,CAAC,QAAQ,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,MAAM,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAA;YACzG,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACvC,IAAI,CAAC,MAAM;gBAAE,OAAO,MAAM,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAA;YAChE,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAA;YAC5D,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,iBAAiB,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;gBAAE,OAAO,MAAM,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAA;YACjK,MAAM,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,YAAY,EAAE,CAAA;YACpD,iFAAiF;YACjF,MAAM,MAAM,GAAG,CAAC,GAAW,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAA;YACrH,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;YAC7F,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;gBAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,gBAAgB,EAAE,GAAG,EAAE,eAAe,EAAE,CAAA;YAC9H,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAA;YACrD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACnD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;YAClF,qEAAqE;YACrE,MAAM,KAAK,GAAW,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5F,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,iBAAiB,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;YACvH,IAAI,CAAC,IAAI,CAAC,EAAE;gBAAE,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACrC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,SAAS,CAAA;YACjE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAA;QAC3I,CAAC;QACD,mDAAmD;QACnD,KAAK,CAAE,KAAK,EAAE,QAAQ;YACpB,MAAM,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAA;YACxB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,EAAE,KAAK,EAAE,KAAoB,EAAE,CAAA;YAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;YACxC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,KAAK,CAAE,CAAA;YAC7D,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACtB,MAAM,GAAG,GAAG,CAAC,CAAW,EAAE,MAA6B,EAAe,EAAE,CAAC,CAAC;gBACxE,GAAG,KAAK;gBACR,aAAa,EAAE;oBACb,GAAG,KAAK,CAAC,aAAa;oBACtB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;iBACxI;aACF,CAAC,CAAA;YACF,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;gBACf,KAAK,MAAM,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAA;gBACpE,KAAK,SAAS;oBACZ,mEAAmE;oBACnE,iEAAiE;oBACjE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAA;gBAC9I,KAAK,UAAU,CAAC,CAAC,CAAC;oBAChB,MAAM,MAAM,GAAiB,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,oBAAoB,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,cAAc,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;oBACnK,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;gBACrJ,CAAC;YACH,CAAC;QACH,CAAC;KACF,CAAA;AACH,CAAC;AAED;qDACqD;AACrD,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAkB,EAAS,EAAE,CAAC,CAAC;IAC/D,GAAG,CAAC;IACJ,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;IACvC,WAAW,EAAE,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,QAAQ,EAAE,IAAI,EAAE;IACjD,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE;CAC1C,CAAC,CAAA;AAEF,0EAA0E;AAE1E;+DAC+D;AAC/D,MAAM,UAAU,QAAQ,CAAE,KAA4B;IACpD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC;SACjC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI,CAAC;SAC/D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,UAAW,EAAE,CAAC,CAAC;SACnD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAA;AAC5C,CAAC;AAED,yEAAyE;AACzE,MAAM,QAAQ,GAAG,CAAC,KAA4B,EAAE,GAA2B,EAAE,CAAkB,EAAU,EAAE,CACzG,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,SAAS,CAAA;AAO7F,MAAM,CAAC,KAAK,UAAU,UAAU,CAAE,GAAe,EAAE,OAA0B;IAC3E,MAAM,GAAG,GAAe,EAAE,CAAA;IAC1B,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,GAAG,CAAA;IAC/B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAA;IAC3B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QAC5D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAA;YAC7B,IAAI,GAAG,KAAK,IAAI;gBAAE,SAAQ;YAC1B,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACvC,IAAI,CAAC,MAAM;gBAAE,SAAQ;YACrB,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAA;YAC5D,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,iBAAiB,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YACxE,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAC9H,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAE,KAA4B,EAAE,SAAiB,EAAE,MAAkB;IAC/F,IAAI,aAAa,GAAwC,IAAI,CAAA;IAC7D,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9C,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACxF,MAAM,GAAG,GAAG,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,CAAA;QACzD,MAAM,CAAC,GAAG,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,KAAK,CAAC,CAAA;QAC3D,MAAM,GAAG,GAAG,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;QAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,SAAS;YAAE,SAAQ;QACnI,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAClC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,SAAQ;QACjD,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACrD,aAAa,KAAK,EAAE,GAAG,KAAK,CAAC,aAAa,EAAE,CAAA;QAC5C,aAAa,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,GAAG,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IACpJ,CAAC;IACD,OAAO,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,KAAoB,CAAA;AAC3E,CAAC;AAED;yEACyE;AACzE,MAAM,UAAU,WAAW,CAAE,KAA4B,EAAE,CAAoB;IAC7E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;IAChD,KAAK,MAAM,CAAC,IAAI,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,CAAC,mBAAmB,KAAK,IAAI;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAA;QAClE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAAC,CAAC;IAC/D,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;AACxB,CAAC;AAID,yCAAyC;AACzC,MAAM,CAAC,MAAM,IAAI,GAAqC;IACpD,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,SAAS;IACf,GAAG,EAAE,MAAM;IACX,YAAY,EAAE,eAAe;IAC7B,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO;IACrB,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IACzC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM;IACpB,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACvC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;IAChC,OAAO,EAAE,IAAI;IACb,KAAK,CAAC,KAAK,CAAE,GAAG,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAA;QAC3B,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAChF,OAAO,CAAC,MAAM,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAsB,CAAA;IAC9F,CAAC;IACD,OAAO,EAAE,WAAW;IACpB,KAAK,CAAC,KAAK,CAAE,GAAG,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAA;QAC3B,OAAO,cAAc,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,KAA6B,EAAE,CAAC,CAAC,CAAA;IAChH,CAAC;IACD,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAE,IAA4B,CAAC,OAAO;IACxD,KAAK,CAAC,QAAQ,CAAE,GAAG,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAiB,CAAA;QACjC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,eAAe,EAAE,CAAA,CAAG,8BAA8B;QAC1G,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAA;QAC3B,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAC7D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAA;QAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAA;QACrD,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACrF,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM;gBAAE,SAAQ;YAC7B,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAC,MAAK;gBAAC,CAAC;YAC3E,CAAC;QACH,CAAC;QACD,sFAAsF;QACtF,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAA;IAC1E,CAAC;CACF,CAAA","sourcesContent":["// trust/star — the star on the holder (lib Stage 2, PR 4b): star@2 as the\n// registered task star/0.2 (5.1–5.2a), reconciled per recipient (5.4),\n// and the machinery the group star (trust/group-star.ts) shares with it:\n// the sender's salt scope, baseline automaton and in-flight deliveries,\n// and the receiver's assembly per (tuple, salt), on HolderState.\n//\n// Rule numbers: bare four-digit numbers are RLTP-TRU (trust-layer.md).\n//\n// What it registers (through trustModule, trust/mapping.ts):\n//   sweep  trust.star    resume's reconciliation: per contact and live\n//                        relationship, the view against the baseline;\n//                        where they differ, the class is on and the scope\n//                        can issue, one production under the next salt\n//   task   star/0.2      (proof absent) reception: assembly, completion,\n//                        the accepted snapshot\n//   ack    star/0.2      completion of a salt by the verified acks of\n//                        every chunk (5660)\n//\n// The sender (5.4). The view (5610/5620) is the set of (member, anchor\n// head) over the admitted entries, member = the entry id, sorted by\n// member; every recipient gets the same view. A production takes the\n// snapshot, assigns lastSalt + 1, builds the chunks blinded under the\n// tuple's pair secret (KeyProvider.agree on the tuple's rkid), stamps one\n// fresh threadId on every chunk of the salt (entropy thread.id), and\n// commits `lastSalt`, `inflight[salt] = {view, viewDigest, digests, acked: []}` and\n// the outbox items in one transition (5090, 5110); the outbound leaves\n// only after that commit. Chunk retries are the outbox's, byte-identical\n// down to the envelope and the threadId (Delivery 4.2). Completion: the\n// verified ack of a chunk marks it acked in its inflight entry; the last\n// one runs the baseline automaton (5670): s > H sets H = s and S = the\n// view sent under s, s ≤ H changes nothing; the salt and every in-flight\n// salt at or below the new H leave `inflight`. No rollback (5680).\n//\n// Choices this file makes where note and spec leave them open:\n//   - an available delivery contact (5690) is a resume. A divergence is\n//     delivered once per view: no new salt while an in-flight salt above\n//     H carries exactly the current view and none of its chunks has\n//     failed (the outbox retries it byte-identical). A view that changes\n//     again, or a delivery the outbox gives up (failed, its horizon or the\n//     adapter's verdict) leaves the divergence standing, and the next\n//     resume ships the current view under a fresh, higher salt (5680)\n//   - completion counts verified delivery-acks only, never an adapter's\n//     `delivered` report (ports.ts DeliveryReport, 5660)\n//   - superseded salts are not withdrawn from the outbox: their retries\n//     run to the horizon like any item (no trias state says \"superseded\"),\n//     and the receiver refuses them (5150) or answers a cached duplicate\n//   - needing delivery and completing are kept apart: a delivery with a\n//     failed chunk no longer counts as in flight (the next resume issues a\n//     fresh salt), but its inflight entry (view, digests, acked) stays as\n//     long as any of its outbox items exists, so a late ack still completes\n//     it (5660; the automaton then advances on s > H only, 5670). It leaves\n//     when the last of its items has left the outbox (tick's key-retention):\n//     at the tuple's next production and by tick (retainInflight)\n//   - the star goes on every live relationship of the contact (2820), the\n//     active-head tuple of each, lagging ones included (6595); a contact\n//     with no entry yet is a recipient like any other (2760: every contact)\n//   - the scope cannot issue once `exhausted` (set by the commit that\n//     issues 10¹⁸−1, 2600) and nothing is produced; state loss (5100) is\n//     not modelled: a restored state carries its lastSalt\n//   - a production whose key agreement is unavailable (the counterpart key\n//     invalid or the own key not released) is skipped silently and stays\n//     pending\n//\n// The receiver (5.2a). One open assembly per tuple and artifact\n// (Tuple.starIn.assembly); its chunks are kept as {digest, threadId,\n// body}. The checks, in order: the arrival tuple is a live active head\n// (5360); salt above the completed high-water mark (5150) and above the\n// lower bound (5366); not below the open assembly (5340); the MAC under\n// the salt's key (5080); then against the assembly: a higher salt\n// displaces it (5330); seq above the resource limit discards (5365);\n// another threadId (5280), a repeated seq of other bytes (5260), a second\n// last (5270), a seq beyond last (5290) reject the delivery; the same\n// digest again is a repeat, acked, no change (5250). On completion the\n// union must be strictly ascending (5300, 5310). A rejection (the chunk is\n// authenticated: its MAC verified) and a resource-limit discard (5365)\n// both commit as receive.ts TaskDiscarded, disposition `discarded` with\n// reason `rejected` or `resource-limit`: the assembly is dropped and its\n// salt becomes the lower bound, so no later chunk of it is acked and the\n// delivery never completes (5366); the completed hwm stays. Checks before\n// the MAC (salt rules) and a failed MAC are plain refusals that touch\n// nothing, so an unauthenticated chunk can discard no assembly. Every other chunk before completion is acked on its\n// own (Delivery: every chunk is acked); only the completing chunk\n// changes the accepted snapshot, advances hwm (5140, 5350) and announces\n// star.accepted, all in its ack's transaction.\n//\n// Choices on the receiver side:\n//   - the resource limit is a bound on seq: an open assembly holds at most\n//     ASSEMBLY_LIMIT.star = 1024 chunks (≤ 1 048 576 entries); a chunk\n//     with a higher seq discards the assembly (5365, 5366)\n//   - `accepted` keeps the whole assembled union with its salt and the\n//     matches (6160): the entry ids of the holder's other contacts one of\n//     whose held anchors (the entry's anchor head, every relationship's\n//     held head and both ends of every held lineage link, 6390) blinds to\n//     a value in it. When the holder comes to hold new anchors for a\n//     contact (the anchor mapping's acceptance: entry commit, advanced\n//     head, new links), the mapping transition re-matches every accepted\n//     star against them (starBlinds in its preparation, rematchStars in\n//     its apply). Matches only grow: held anchors are never dropped\nimport { iso, jcs } from '../core.js'\nimport type { Json } from '../core.js'\nimport { digestDoc, xRawOfMk } from '../crypto.js'\nimport { seal } from '../delivery.js'\nimport { PLAINTEXT_MAX, blindAnchor, buildStarChunks, starChunkMacOk, starChunkOk, starKeyOf, strictlyAscending } from '../star.js'\nimport type { StarChunk } from '../star.js'\nimport { tupleByRkid } from '../receive.js'\nimport { sha256Hex } from '../sha256.js'\nimport type { Arrival, ReceivedDocument, TaskDiscarded, TaskRefusal } from '../receive.js'\nimport type { AckHandler, Applied, EventDraft, OutboundDraft, PrepareCtx, SweepHandler, TaskHandler } from '../engine.js'\nimport { triasOf } from '../state.js'\nimport type { Assembly, Contact, Dec, HolderState, Relationship, SeqIn, SeqOut, StarPair, TrustClass, Tuple } from '../state.js'\nimport { ADMISSION_BOUND, activeTuple, classOnToward, entryOf, entryRelationships, findContact } from './state.js'\n\n/** The registered task type that carries star@2 (Delivery §4.4, 5640). */\nexport const STAR_TYPE = 'https://real-life.org/trust-tasks/star/0.2'\n\n/** The receiver's resource limit (5365): the highest seq an open assembly\n *  takes, per artifact. */\nexport const ASSEMBLY_LIMIT = Object.freeze({ star: 1024, groupStar: 64, probe: 64 })\n\nconst te = new TextEncoder()\nconst inc = (d: Dec): Dec => (BigInt(d) + 1n).toString()\nconst cmp = (a: string, b: string): number => (a < b ? -1 : a > b ? 1 : 0)\nconst refuse = (reason: TaskRefusal['reason'], ref?: string): TaskRefusal => ({ ok: false, reason, ...(ref ? { ref } : {}) })\n\n// ── the artifact descriptor shared with the group star ─────────────────\n\n/** One reconciled, chunked artifact on a tuple: its scopes and how it\n *  builds and completes. V is a view element, A what a completed\n *  delivery leaves behind on the receiver. */\nexport interface Artifact<V, A> {\n  kind: 'star' | 'groupStar'\n  type: string\n  cls: TrustClass\n  /** the rule a malformed chunk fails */\n  malformedRef: string\n  out (t: Readonly<Tuple>): SeqOut<V>\n  withOut (t: Readonly<Tuple>, o: SeqOut<V>): Tuple\n  inn (t: Readonly<Tuple>): SeqIn<A>\n  withIn (t: Readonly<Tuple>, i: SeqIn<A>): Tuple\n  /** the reconciliation view toward contact `c` on relationship `rel` (sync) */\n  view (state: Readonly<HolderState>, c: Readonly<Contact>, rel: Readonly<Relationship>): V[]\n  /** the view depends on state.contacts alone, the same toward every\n   *  recipient: computed once per contacts record */\n  uniform: boolean\n  /** the chunks of one production */\n  build (ctx: PrepareCtx, p: { shared: Uint8Array, own: string, tuple: Readonly<Tuple>, salt: Dec, view: V[] }): Promise<Json[] | null>\n  chunkOk (chunk: unknown): boolean\n  macOk (ctx: PrepareCtx, p: { shared: Uint8Array, from: string, own: string, salt: Dec, chunk: Json }): Promise<boolean>\n  /** the entries a chunk body carries, in order */\n  entries (body: Json): Json[]\n  /** the completed delivery: its union validated and evaluated */\n  complete (ctx: PrepareCtx, p: { shared: Uint8Array, from: string, own: string, salt: Dec, union: Json[], rel: Readonly<Relationship>, tuple: Readonly<Tuple> }):\n    Promise<{ ok: true, accepted: A, memory?: Record<string, Json> } | { ok: false, ref: string }>\n}\n\ntype Body = { salt: Dec, seq: Dec, last: boolean }\nconst bodyOf = (chunk: Json): Body & Record<string, Json> => (chunk as { body: Body & Record<string, Json> }).body\n\n// ── the sender ─────────────────────────────────────────────────────────\n\n/** One live recipient: a contact and the active-head tuple of one of its\n *  live relationships (2820). */\nexport interface Recipient { contact: Contact, rel: Relationship, tuple: Tuple }\n\n/** Every contact's live relationships, by contact id, then relationship\n *  order; a relationship behind two entries under the one its\n *  verifications go to (2146), once. */\nexport function recipients (state: Readonly<HolderState>): Recipient[] {\n  const out: Recipient[] = []\n  for (const contact of Object.values(state.contacts).sort((a, b) => cmp(a.id, b.id))) {\n    for (const rel of entryRelationships(state, contact)) {\n      if (rel.chainedInto !== null || entryOf(state, rel)?.id !== contact.id) continue\n      const tuple = activeTuple(rel)\n      if (tuple && !tuple.deactivated) out.push({ contact, rel, tuple })\n    }\n  }\n  return out\n}\n\n/** 2600: the scope has issued its maximum, or would exceed the wire domain. */\nconst canIssue = (o: Readonly<SeqOut<unknown>>): boolean => !o.exhausted && BigInt(o.lastSalt) < ADMISSION_BOUND\n\n/** An in-flight salt above H carrying exactly this view, none of whose\n *  chunks has failed: the divergence is being delivered. */\nconst inFlight = (state: Readonly<HolderState>, o: Readonly<SeqOut<unknown>>, viewDigest: string): boolean =>\n  Object.entries(o.inflight).some(([salt, f]) => BigInt(salt) > BigInt(o.hwm) && f.viewDigest === viewDigest && canComplete(state, f))\n\n/** A uniform view, once per contacts record (the record is replaced on\n *  every change of a contact, so the cache cannot go stale). */\nconst uniformViews = new WeakMap<object, Map<string, { view: unknown[], digest: string }>>()\n\n/** The digest of a view: SHA-256 over its JCS form. Views are compared by\n *  it (the baseline's snapshotDigest, an inflight entry's viewDigest),\n *  never re-serialized per comparison. */\nexport const viewDigest = (view: readonly unknown[]): string => sha256Hex(jcs(view))\n\n/** The view toward a recipient and its digest. */\nfunction viewAt<V, A> (art: Artifact<V, A>, state: Readonly<HolderState>, r: Recipient): { view: V[], digest: string } {\n  if (!art.uniform) { const view = art.view(state, r.contact, r.rel); return { view, digest: viewDigest(view) } }\n  let byKind = uniformViews.get(state.contacts)\n  if (!byKind) uniformViews.set(state.contacts, (byKind = new Map()))\n  let v = byKind.get(art.kind)\n  if (!v) { const view = art.view(state, r.contact, r.rel); byKind.set(art.kind, (v = { view, digest: viewDigest(view) })) }\n  return v as { view: V[], digest: string }\n}\n\n/** Whether an in-flight delivery can still complete: every chunk acked,\n *  or still in the outbox and not failed (an ack refers to an outbox item). */\nexport const canComplete = (state: Readonly<HolderState>, f: Readonly<{ digests: string[], acked: string[] }>): boolean =>\n  f.digests.every((d) => f.acked.includes(d) || (Object.hasOwn(state.outbox, d) && triasOf(state.outbox[d]) !== 'failed'))\n\n/** The in-flight deliveries whose completion data is still needed: any\n *  of their outbox items exists, failed ones included — an ack can still\n *  arrive late for it (Delivery §6.1 failed → delivered) and complete the\n *  salt (5660). Whether one still needs delivering is canComplete's. */\nfunction retainedInflight<V> (state: Readonly<HolderState>, o: Readonly<SeqOut<V>>): SeqOut<V>['inflight'] {\n  const out: SeqOut<V>['inflight'] = {}\n  for (const [s, f] of Object.entries(o.inflight)) if (f.digests.some((d) => Object.hasOwn(state.outbox, d))) out[s] = f\n  return out\n}\n\n/** Every tuple's in-flight deliveries of both artifacts pruned to those\n *  whose outbox items are not all gone; tick's retention (the same state\n *  object where nothing is pruned). */\nexport function retainInflight (state: Readonly<HolderState>): HolderState {\n  let relationships: HolderState['relationships'] | null = null\n  for (const rel of Object.values(state.relationships)) {\n    let changed = false\n    const tuples = rel.tuples.map((t) => {\n      const so = retainedInflight(state, t.starOut), go = retainedInflight(state, t.groupStarOut)\n      if (Object.keys(so).length === Object.keys(t.starOut.inflight).length && Object.keys(go).length === Object.keys(t.groupStarOut.inflight).length) return t\n      changed = true\n      return { ...t, starOut: { ...t.starOut, inflight: so }, groupStarOut: { ...t.groupStarOut, inflight: go } }\n    })\n    if (changed) (relationships ??= { ...state.relationships })[rel.id] = { ...rel, tuples }\n  }\n  return relationships ? { ...state, relationships } : state as HolderState\n}\n\n/** Whether the artifact is owed now on this recipient (5690–5720, 5830):\n *  the class on, the scope able to issue, the view diverging from the\n *  baseline (absent: by definition) and not already in flight. */\nexport function owed<V, A> (art: Artifact<V, A>, state: Readonly<HolderState>, r: Recipient, digest: string): boolean {\n  const o = art.out(r.tuple)\n  if (!classOnToward(r.contact, art.cls) || !canIssue(o)) return false\n  if (o.snapshotDigest !== null && o.snapshotDigest === digest) return false\n  return !inFlight(state, o, digest)\n}\n\n/** The sweep's pending keys: one per owed recipient and view. */\nexport function pendingOf<V, A> (art: Artifact<V, A>, state: Readonly<HolderState>): string[] {\n  const keys: string[] = []\n  for (const r of recipients(state)) {\n    if (!classOnToward(r.contact, art.cls)) continue\n    const { digest } = viewAt(art, state, r)\n    if (owed(art, state, r, digest)) keys.push(`${art.kind}|${r.rel.id}|${r.tuple.ownPairLabel}|${digest}`)\n  }\n  return keys\n}\n\n/** A production prepared against a snapshot. */\ninterface Production<V> {\n  relId: string\n  tuple: string\n  contactId: string\n  baseSalt: Dec\n  salt: Dec\n  view: V[]\n  viewDigest: string\n  outbound: OutboundDraft[]\n}\n\n/** A key agreement on the tuple's own rkid with the counterpart key, or null. */\nexport async function pairShared (ctx: PrepareCtx, t: Readonly<Tuple>, peerKeyAgreement: string = t.counterpartKeyAgreement): Promise<Uint8Array | null> {\n  const x = xRawOfMk(peerKeyAgreement)\n  if (!x) return null\n  const a = await ctx.keys.agree(t.rkid, x, ctx.release)\n  return a.status === 'available' ? a.shared : null\n}\n\n/** Seal one chunk as its own document of the salt's thread (Delivery §4.4). */\nexport async function chunkDocument (ctx: PrepareCtx, type: string, issuer: string, t: Readonly<Tuple>, contactId: string, threadId: string, chunk: Json): Promise<OutboundDraft> {\n  const S = ctx.crypto.subtle\n  const doc = { id: ctx.entropy.id('doc.id'), type, issuer, recipient: t.counterpartAnchor, threadId, issuedAt: iso(ctx.when), payload: chunk }\n  // 5190: within the Delivery Contract's plaintext limit, by construction\n  if (te.encode(jcs(doc)).length > PLAINTEXT_MAX) throw new Error(`trust: a ${type} chunk exceeds ${PLAINTEXT_MAX} bytes`)\n  const envelope = await seal(doc, t.counterpartKeyAgreement, { ephSeed: ctx.entropy.bytes('seal.eph', 32), nonce: ctx.entropy.bytes('seal.nonce', 12) }, S)\n  return { digest: await digestDoc(doc, S), envelope, type, threadId, recipient: { contactId, rkid: t.rkid, keyAgreement: t.counterpartKeyAgreement } }\n}\n\n/** The reconciliation sweep of one artifact (5.4, 5730). */\nexport function sweepOf<V, A> (art: Artifact<V, A>): SweepHandler<Production<V>[]> {\n  return {\n    pending: (state) => pendingOf(art, state),\n    // contacts (views, settings), relationships (scopes), groups (the group\n    // star's view) and the outbox (whether a delivery can still complete)\n    reads: ['contacts', 'relationships', 'groups', 'outbox'],\n    async prepare (ctx) {\n      const st = ctx.snapshot\n      const out: Production<V>[] = []\n      for (const r of recipients(st)) {\n        if (!classOnToward(r.contact, art.cls)) continue\n        const { view, digest } = viewAt(art, st, r)\n        if (!owed(art, st, r, digest)) continue\n        const shared = await pairShared(ctx, r.tuple)\n        if (!shared) continue\n        const own = (await ctx.keys.anchorOf(r.tuple.ownPairLabel)).anchor\n        const o = art.out(r.tuple)\n        const salt = inc(o.lastSalt)\n        const chunks = await art.build(ctx, { shared, own, tuple: r.tuple, salt, view })\n        if (!chunks) continue\n        // one salt = one thread: a fresh threadId on every chunk of it (Delivery §4.4)\n        const threadId = ctx.entropy.id('thread.id')\n        const outbound: OutboundDraft[] = []\n        for (const chunk of chunks) outbound.push(await chunkDocument(ctx, art.type, own, r.tuple, r.contact.id, threadId, chunk))\n        out.push({ relId: r.rel.id, tuple: r.tuple.ownPairLabel, contactId: r.contact.id, baseSalt: o.lastSalt, salt, view, viewDigest: digest, outbound })\n      }\n      return out\n    },\n    apply (state, prepared) {\n      let cur = state as HolderState\n      const outbound: OutboundDraft[] = []\n      let deferred = false\n      for (const p of prepared.value) {\n        const rel = Object.hasOwn(cur.relationships, p.relId) ? cur.relationships[p.relId] : undefined\n        const contact = findContact(cur, p.contactId)\n        const tuple = rel && activeTuple(rel)\n        if (!rel || !contact || !tuple || tuple.ownPairLabel !== p.tuple || rel.chainedInto !== null || tuple.deactivated || !contact.relIds.includes(rel.id) || entryOf(cur, rel)?.id !== contact.id) continue\n        const r: Recipient = { contact, rel, tuple }\n        const { digest } = viewAt(art, cur, r)\n        // 5110: the snapshot, the salt and the commit are one step — a\n        // production prepared on another view or salt is not committed\n        if (art.out(tuple).lastSalt !== p.baseSalt || digest !== p.viewDigest || !owed(art, cur, r, digest)) {\n          if (owed(art, cur, r, digest)) deferred = true\n          continue\n        }\n        const o = art.out(tuple)\n        const next: SeqOut<V> = {\n          ...o, lastSalt: p.salt, exhausted: BigInt(p.salt) >= ADMISSION_BOUND,\n          // what no ack can reach any more leaves with the next production\n          inflight: { ...retainedInflight(cur, o), [p.salt]: { view: p.view, viewDigest: p.viewDigest, digests: p.outbound.map((d) => d.digest), acked: [] } },\n        }\n        const tuples = rel.tuples.map((t) => (t.ownPairLabel === p.tuple ? art.withOut(t, next) : t))\n        cur = { ...cur, relationships: { ...cur.relationships, [rel.id]: { ...rel, tuples } } }\n        outbound.push(...p.outbound)\n      }\n      return { state: cur, outbound, deferred }\n    },\n  }\n}\n\n/** Completion of a salt by the verified acks of all its chunks (5660),\n *  then the baseline automaton (5670). */\nexport function ackOf<V, A> (art: Artifact<V, A>): AckHandler {\n  return (state, ref) => {\n    const item = state.outbox[ref]\n    const at = tupleByRkid(state, item.recipient.rkid)\n    if (!at) return { state: state as HolderState }\n    const o = art.out(at.tuple)\n    const hit = Object.entries(o.inflight).find(([, f]) => f.digests.includes(ref))\n    if (!hit) return { state: state as HolderState }\n    const [salt, f] = hit\n    const acked = f.acked.includes(ref) ? f.acked : [...f.acked, ref]\n    let next: SeqOut<V>\n    if (f.digests.every((d) => acked.includes(d))) {\n      const advance = BigInt(salt) > BigInt(o.hwm)\n      const hwm = advance ? salt : o.hwm\n      const inflight: SeqOut<V>['inflight'] = {}\n      for (const [s, x] of Object.entries(o.inflight)) if (s !== salt && BigInt(s) > BigInt(hwm)) inflight[s] = x\n      next = { ...o, hwm, snapshot: advance ? f.view : o.snapshot, snapshotDigest: advance ? f.viewDigest : o.snapshotDigest, inflight }\n    } else next = { ...o, inflight: { ...o.inflight, [salt]: { ...f, acked } } }\n    const tuples = at.rel.tuples.map((t) => (t.ownPairLabel === at.tuple.ownPairLabel ? art.withOut(t, next) : t))\n    return { state: { ...state, relationships: { ...state.relationships, [at.rel.id]: { ...at.rel, tuples } } } }\n  }\n}\n\n// ── the receiver ───────────────────────────────────────────────────────\n\n/** An assembly chunk as held: the document's digest and thread, the body. */\ninterface Held { digest: string, threadId: string, body: { seq: Dec, last: boolean } & Record<string, Json> }\n\n/** What one authenticated chunk does to its tuple's open assembly of one\n *  artifact (5.2a; the probe under 6790 with `probe` as the salt). */\nexport type AssemblyStep =\n  | { kind: 'repeat' }\n  | { kind: 'reject', ref: string }\n  | { kind: 'limit' }\n  | { kind: 'hold', assembly: Assembly }\n  | { kind: 'complete', chunks: Record<string, Json>, last: bigint }\n\n/**\n * The assembly rules after the salt checks and the MAC (5250–5290, 5330,\n * 5365): a higher salt displaces the open assembly; a seq above `limit`\n * is the resource limit; the same digest again a repeat; another thread,\n * a repeated seq of other bytes, a second last or a seq beyond last\n * reject the delivery; otherwise the chunk is held, or completes the\n * assembly with every seq up to last present.\n */\nexport function assemblyStep (open: Assembly | null, salt: Dec, body: { seq: Dec, last: boolean } & Record<string, Json>, threadId: string, digest: string, limit: number): AssemblyStep {\n  const base: Assembly = open && open.salt === salt ? open : { salt, chunks: {} }\n  const seq = BigInt(body.seq)\n  if (seq > BigInt(limit)) return { kind: 'limit' }\n  const held = Object.values(base.chunks) as unknown as Held[]\n  const same = Object.hasOwn(base.chunks, body.seq) ? base.chunks[body.seq] as unknown as Held : undefined\n  if (same && same.digest === digest) return { kind: 'repeat' }                       // 5250\n  if (held.some((h) => h.threadId !== threadId)) return { kind: 'reject', ref: 'RLTP-TRU-5280' }\n  if (same) return { kind: 'reject', ref: 'RLTP-TRU-5260' }\n  const heldLast = held.find((h) => h.body.last)\n  if (body.last && heldLast) return { kind: 'reject', ref: 'RLTP-TRU-5270' }\n  const last = body.last ? seq : heldLast ? BigInt(heldLast.body.seq) : null\n  if (last !== null && (seq > last || held.some((h) => BigInt(h.body.seq) > last))) return { kind: 'reject', ref: 'RLTP-TRU-5290' }\n  const chunks = { ...base.chunks, [body.seq]: { digest, threadId, body } as unknown as Json }\n  if (last === null) return { kind: 'hold', assembly: { salt, chunks } }\n  for (let i = 1n; i <= last; i++) if (!Object.hasOwn(chunks, String(i))) return { kind: 'hold', assembly: { salt, chunks } }\n  return { kind: 'complete', chunks, last }\n}\n\n/** The held bodies of a complete assembly, in seq order. */\nexport const assembledBodies = (chunks: Record<string, Json>, last: bigint): Array<Record<string, Json>> => {\n  const out: Array<Record<string, Json>> = []\n  for (let i = 1n; i <= last; i++) out.push((chunks[String(i)] as unknown as Held).body)\n  return out\n}\n\n/** What stage 8 decided for one chunk. */\ntype ChunkPlan<A> =\n  | { kind: 'hold', relId: string, tuple: string, assembly: Assembly }\n  | { kind: 'repeat' }\n  | { kind: 'discard', relId: string, tuple: string, salt: Dec, reason: 'resource-limit' | 'rejected', ref: string }\n  | { kind: 'complete', relId: string, tuple: string, salt: Dec, accepted: A, memory?: Record<string, Json>, contactId: string }\n\n/** The arrival tuple, if it is the active head of a live relationship (6.4, 5360). */\nfunction arrivalTuple (state: Readonly<HolderState>, rkid: string): { rel: Relationship, tuple: Tuple } | null {\n  const at = tupleByRkid(state, rkid)\n  if (!at || at.tuple.deactivated || at.rel.chainedInto !== null || at.rel.activeHead !== at.tuple.ownPairLabel) return null\n  return at\n}\n\nconst maxDec = (a: Dec, b: Dec): Dec => (BigInt(a) >= BigInt(b) ? a : b)\n\n/** The task handler of one artifact (5.2a). */\nexport function taskOf<V, A> (art: Artifact<V, A>, limit: number): TaskHandler<Json, ChunkPlan<A>> {\n  return {\n    proof: 'absent',\n    // stage 7: the closed chunk schema (5070, 5370)\n    decode (payload) {\n      return art.chunkOk(payload) ? payload as Json : refuse('malformed', art.malformedRef)\n    },\n    // stage 8: the salt rules, the MAC, and the assembly decision\n    async prepare (ctx: PrepareCtx, doc: ReceivedDocument<Json>, arrival: Arrival): Promise<ChunkPlan<A> | TaskRefusal> {\n      if ((doc.ceremony as { enactment?: unknown } | undefined)?.enactment !== undefined) return refuse('validation-failed')\n      const at = arrivalTuple(ctx.snapshot, arrival.rkid)\n      if (!at) return refuse('validation-failed', 'RLTP-TRU-5360')\n      const { rel, tuple: t } = at\n      const inn = art.inn(t)\n      const body = bodyOf(doc.payload)\n      const salt = BigInt(body.salt)\n      if (salt <= BigInt(inn.hwm)) return refuse('validation-failed', 'RLTP-TRU-5150')\n      if (salt <= BigInt(inn.lowerBound)) return refuse('validation-failed', 'RLTP-TRU-5366')\n      if (inn.assembly && salt < BigInt(inn.assembly.salt)) return refuse('validation-failed', 'RLTP-TRU-5340')\n      const shared = await pairShared(ctx, t)\n      if (!shared) return refuse('validation-failed', 'RLTP-TRU-5080')\n      const own = (await ctx.keys.anchorOf(t.ownPairLabel)).anchor\n      if (!(await art.macOk(ctx, { shared, from: t.counterpartAnchor, own, salt: body.salt, chunk: doc.payload }))) return refuse('validation-failed', 'RLTP-TRU-5080')\n      const ids = { relId: rel.id, tuple: t.ownPairLabel }\n      // the chunk is authenticated: a violation rejects the whole delivery (5260–5310)\n      const reject = (ref: string): ChunkPlan<A> => ({ kind: 'discard', ...ids, salt: body.salt, reason: 'rejected', ref })\n      const step = assemblyStep(inn.assembly, body.salt, body, doc.threadId, arrival.digest, limit)\n      if (step.kind === 'limit') return { kind: 'discard', ...ids, salt: body.salt, reason: 'resource-limit', ref: 'RLTP-TRU-5365' }\n      if (step.kind === 'repeat') return { kind: 'repeat' }\n      if (step.kind === 'reject') return reject(step.ref)\n      if (step.kind === 'hold') return { kind: 'hold', ...ids, assembly: step.assembly }\n      // the completing chunk: the union in seq order, validated, evaluated\n      const union: Json[] = assembledBodies(step.chunks, step.last).flatMap((b) => art.entries(b))\n      const done = await art.complete(ctx, { shared, from: t.counterpartAnchor, own, salt: body.salt, union, rel, tuple: t })\n      if (!done.ok) return reject(done.ref)\n      const contactId = entryOf(ctx.snapshot, rel)?.id ?? rel.contactId\n      return { kind: 'complete', ...ids, salt: body.salt, accepted: done.accepted, ...(done.memory ? { memory: done.memory } : {}), contactId }\n    },\n    // stage 9: the decision lands on the same snapshot\n    apply (state, prepared): Applied | TaskRefusal | TaskDiscarded {\n      const p = prepared.value\n      if (p.kind === 'repeat') return { state: state as HolderState }\n      const rel = state.relationships[p.relId]\n      const t = rel.tuples.find((x) => x.ownPairLabel === p.tuple)!\n      const inn = art.inn(t)\n      const put = (i: SeqIn<A>, memory?: Record<string, Json>): HolderState => ({\n        ...state,\n        relationships: {\n          ...state.relationships,\n          [rel.id]: { ...rel, ...(memory ? { memory } : {}), tuples: rel.tuples.map((x) => (x.ownPairLabel === p.tuple ? art.withIn(x, i) : x)) },\n        },\n      })\n      switch (p.kind) {\n        case 'hold': return { state: put({ ...inn, assembly: p.assembly }) }\n        case 'discard':\n          // the resource limit or a rejected delivery: the assembly dropped,\n          // its salt the lower bound (5365, 5366); the completed hwm stays\n          return { discarded: true, reason: p.reason, ref: p.ref, state: put({ ...inn, assembly: null, lowerBound: maxDec(inn.lowerBound, p.salt) }) }\n        case 'complete': {\n          const events: EventDraft[] = [{ type: art.kind === 'star' ? 'star.accepted' : 'groupStar.accepted', contactId: p.contactId, relationshipId: rel.id, salt: p.salt }]\n          return { state: put({ ...inn, hwm: p.salt, assembly: null, accepted: p.accepted }, p.memory ? { ...rel.memory, ...p.memory } : undefined), events }\n        }\n      }\n    },\n  }\n}\n\n/** A tuple with its open assemblies dropped, as its deactivation leaves\n *  it (5360): for chaining and departure (PR 4c). */\nexport const discardAssemblies = (t: Readonly<Tuple>): Tuple => ({\n  ...t,\n  starIn: { ...t.starIn, assembly: null },\n  groupStarIn: { ...t.groupStarIn, assembly: null },\n  probeIn: { ...t.probeIn, assembly: null },\n})\n\n// ── the star ───────────────────────────────────────────────────────────\n\n/** The reconciliation view of 5610/5620: (member, anchor head) of every\n *  admitted entry, member = the entry id, sorted by member. */\nexport function starView (state: Readonly<HolderState>): StarPair[] {\n  return Object.values(state.contacts)\n    .filter((c) => c.status === 'admitted' && c.anchorHead !== null)\n    .map((c) => ({ member: c.id, head: c.anchorHead! }))\n    .sort((a, b) => cmp(a.member, b.member))\n}\n\n/** The entry a tuple's documents come from (2145): the star's sender. */\nconst senderOf = (state: Readonly<HolderState>, rel: Readonly<Relationship>, t: Readonly<Tuple>): string =>\n  findContact(state, t.entryId)?.id ?? findContact(state, rel.contactId)?.id ?? rel.contactId\n\n/** Blinded values of `anchors` under the key of every accepted star, by\n *  `<relId>|<tuple>`, with the salt they were blinded for: the async half\n *  of a re-match (6160), prepared where anchors are about to be held. */\nexport type StarBlinds = Record<string, { salt: Dec, blinds: string[] }>\n\nexport async function starBlinds (ctx: PrepareCtx, anchors: readonly string[]): Promise<StarBlinds> {\n  const out: StarBlinds = {}\n  if (!anchors.length) return out\n  const S = ctx.crypto.subtle\n  for (const rel of Object.values(ctx.snapshot.relationships)) {\n    for (const t of rel.tuples) {\n      const acc = t.starIn.accepted\n      if (acc === null) continue\n      const shared = await pairShared(ctx, t)\n      if (!shared) continue\n      const own = (await ctx.keys.anchorOf(t.ownPairLabel)).anchor\n      const k = await starKeyOf(shared, t.counterpartAnchor, own, acc.salt, S)\n      out[`${rel.id}|${t.ownPairLabel}`] = { salt: acc.salt, blinds: await Promise.all(anchors.map((a) => blindAnchor(k, a, S))) }\n    }\n  }\n  return out\n}\n\n/**\n * The sync half (6160, 6390): `contactId` now holds the anchors `blinds`\n * were prepared for; every accepted star (other than the contact's own)\n * whose stored union carries one of them lists the contact among its\n * matches. Run in the transition that makes the holder hold them (the\n * anchor mapping's acceptance: a new entry, an advanced head, a new link).\n */\nexport function rematchStars (state: Readonly<HolderState>, contactId: string, blinds: StarBlinds): HolderState {\n  let relationships: HolderState['relationships'] | null = null\n  for (const [key, b] of Object.entries(blinds)) {\n    const [relId, label] = [key.slice(0, key.indexOf('|')), key.slice(key.indexOf('|') + 1)]\n    const rel = (relationships ?? state.relationships)[relId]\n    const t = rel?.tuples.find((x) => x.ownPairLabel === label)\n    const acc = t?.starIn.accepted\n    if (!rel || !t || !acc || acc.salt !== b.salt || acc.matches.includes(contactId) || senderOf(state, rel, t) === contactId) continue\n    const union = new Set(acc.blinded)\n    if (!b.blinds.some((x) => union.has(x))) continue\n    const matches = [...acc.matches, contactId].sort(cmp)\n    relationships ??= { ...state.relationships }\n    relationships[relId] = { ...rel, tuples: rel.tuples.map((x) => (x === t ? { ...x, starIn: { ...x.starIn, accepted: { ...acc, matches } } } : x)) }\n  }\n  return relationships ? { ...state, relationships } : state as HolderState\n}\n\n/** Every anchor the holder holds for a contact (6160, 6390): the entry's\n *  head, each relationship's held head, both ends of every held link. */\nexport function heldAnchors (state: Readonly<HolderState>, c: Readonly<Contact>): string[] {\n  const out = new Set<string>()\n  if (c.anchorHead !== null) out.add(c.anchorHead)\n  for (const r of entryRelationships(state, c)) {\n    if (r.heldCounterpartHead !== null) out.add(r.heldCounterpartHead)\n    for (const l of r.links) { out.add(l.prev); out.add(l.next) }\n  }\n  return [...out].sort()\n}\n\ntype StarAccepted = NonNullable<SeqIn<{ salt: Dec, blinded: string[], matches: string[] }>['accepted']>\n\n/** The star as an artifact (5.1–5.4). */\nexport const STAR: Artifact<StarPair, StarAccepted> = {\n  kind: 'star',\n  type: STAR_TYPE,\n  cls: 'star',\n  malformedRef: 'RLTP-TRU-5070',\n  out: (t) => t.starOut,\n  withOut: (t, o) => ({ ...t, starOut: o }),\n  inn: (t) => t.starIn,\n  withIn: (t, i) => ({ ...t, starIn: i }),\n  view: (state) => starView(state),\n  uniform: true,\n  async build (ctx, p) {\n    const S = ctx.crypto.subtle\n    const k = await starKeyOf(p.shared, p.own, p.tuple.counterpartAnchor, p.salt, S)\n    return (await buildStarChunks(k, p.salt, p.view.map((v) => v.head), S)) as unknown as Json[]\n  },\n  chunkOk: starChunkOk,\n  async macOk (ctx, p) {\n    const S = ctx.crypto.subtle\n    return starChunkMacOk(await starKeyOf(p.shared, p.from, p.own, p.salt, S), p.chunk as unknown as StarChunk, S)\n  },\n  entries: (body) => (body as { blinded: Json[] }).blinded,\n  async complete (ctx, p) {\n    const union = p.union as string[]\n    if (!strictlyAscending(union)) return { ok: false, ref: 'RLTP-TRU-5300' }   // 5300 order, 5310 duplicates\n    const S = ctx.crypto.subtle\n    const k = await starKeyOf(p.shared, p.from, p.own, p.salt, S)\n    const inStar = new Set(union)\n    const sender = senderOf(ctx.snapshot, p.rel, p.tuple)\n    const matches: string[] = []\n    for (const c of Object.values(ctx.snapshot.contacts).sort((a, b) => cmp(a.id, b.id))) {\n      if (c.id === sender) continue\n      for (const a of heldAnchors(ctx.snapshot, c)) {\n        if (inStar.has(await blindAnchor(k, a, S))) { matches.push(c.id); break }\n      }\n    }\n    // the whole union is kept: anchors learned later are tested against it (rematchStars)\n    return { ok: true, accepted: { salt: p.salt, blinded: union, matches } }\n  },\n}\n"]}

package/dist/trust/state.d.ts

@@ -0,0 +1,83 @@
+import type { Contact, HolderState, Relationship, Setting, TrustClass, Tuple } from '../state.js';
+/** The deliverable set's bound, 10¹⁸−1 (2050): the wire-integer domain. */
+export declare const ADMISSION_BOUND: bigint;
+/** The five classes, in the table's order (2720). */
+export declare const CLASSES: readonly TrustClass[];
+/** 2760: star and blinded group star go to every contact, the anchor
+ *  mapping to none, sealed group star and profile to the trusted contacts. */
+export declare const classOn: (cls: TrustClass, setting: Setting, isTrusted: boolean) => boolean;
+/** 2020: a trusted contact is one toward which the anchor mapping class is
+ *  on; its default is no contact (2760), so only `on` makes one. */
+export declare const trusted: (c: Readonly<Contact>) => boolean;
+/** Whether `cls` is on toward the contact (2760, 2840). */
+export declare const classOnToward: (c: Readonly<Contact>, cls: TrustClass) => boolean;
+/** The relationship's active-head tuple (6.4). */
+export declare const activeTuple: (r: Readonly<Relationship>) => Tuple | undefined;
+/** A contact by entry id or alias (2140). */
+export declare const findContact: (state: Readonly<HolderState>, id: string) => Contact | undefined;
+/** The entry's own relationships (Contact.relIds), as present in the state. */
+export declare const entryRelationships: (state: Readonly<HolderState>, c: Readonly<Contact>) => Relationship[];
+/**
+ * Whether a relationship lags in its entry (Section 2, 6595): its anchor
+ * head is held in the entry as superseded, the `prev` of a link one of
+ * the entry's relationships holds. `entry` is the entry's relationships,
+ * `r` among them or not. A relationship with no anchor head never lags.
+ */
+export declare const lags: (r: Readonly<Relationship>, entry: readonly Readonly<Relationship>[]) => boolean;
+/** Every tuple's place: the relationship holding the tuple with own pair
+ *  label `label` (deactivated ones included). */
+export declare function tupleByLabel(state: Readonly<HolderState>, label: string): {
+    rel: Relationship;
+    tuple: Tuple;
+} | null;
+/** A live relationship: not chained into another, its active head not deactivated. */
+export declare const liveRel: (r: Readonly<Relationship>) => boolean;
+/**
+ * The entry a relationship's verifications go to (2145): the one its
+ * active tuple's entryId names, by id or alias, else the one its own
+ * identity (contactId) names. Where a relationship stands behind two
+ * entries, this is the appended tuple's (2146).
+ */
+export declare const entryOf: (state: Readonly<HolderState>, rel: Readonly<Relationship>) => Contact | undefined;
+/** The entry's relationships whose verifications go to it (2145): all of
+ *  them, except one that stands behind two entries and feeds the other. */
+export declare const feeding: (state: Readonly<HolderState>, c: Readonly<Contact>) => Relationship[];
+/** The newest of `heads` along `links` (6560): those from which no other
+ *  head is reachable. One where every pair of heads lies on one chain. */
+export declare function newestOf(heads: readonly string[], links: ReadonlyArray<{
+    prev: string;
+    next: string;
+}>): string[];
+/**
+ * The newest anchor heads of a set of relationships (6560): the heads from
+ * which no other head is reachable along the links they hold. One entry's
+ * relationships yield exactly one where the head rule and the binding rule
+ * admitted every merge (6605); a manual merge (6640) may yield more until
+ * its split (2080).
+ */
+export declare function newestHeads(rels: readonly Readonly<Relationship>[]): string[];
+/** What an entry holds as superseded (6540): every prev of a link one of its relationships holds. */
+export declare const supersededIn: (rels: readonly Readonly<Relationship>[]) => Set<string>;
+/** A relationship's verified anchor set (6a.1 rung 2): its self and every anchor of its links. */
+export declare const anchorSet: (r: Readonly<Relationship>) => Set<string>;
+/**
+ * The binding rule (6605), entry against entry: a relationship of the one
+ * and a relationship of the other hold different pre-rotation bindings
+ * for one anchor both hold, or links from one prev to different nexts (a
+ * held link fixes the binding of its prev, 6610). Compared relationship by
+ * relationship, never combined (6610).
+ */
+export declare function conflicts(as: readonly Readonly<Relationship>[], bs: readonly Readonly<Relationship>[]): boolean;
+/** The union of two binding records (6610), each list sorted and distinct. */
+export declare function unionBindings(a: Readonly<Record<string, string[]>>, b: Readonly<Record<string, string[]>>): Record<string, string[]>;
+/**
+ * The head rule (6530, 6540) for relationship `r` against entry `x`
+ * (relationships `xs`): (a) r's anchor head is x's or the lineage r holds
+ * carries x's as a prev, and (b) x does not hold r's anchor head as
+ * superseded, nor r's own entry x's (`ownSuperseded`). For the incoming
+ * relationship the caller passes the links its entry held before the
+ * verified mapping's lineage joined them: only what the committed mapping
+ * newly carries connects (the 6590 rationale; trust/entries.ts).
+ */
+export declare const joins: (r: Readonly<Relationship>, x: Readonly<Contact>, xs: readonly Readonly<Relationship>[], ownSuperseded: ReadonlySet<string>) => boolean;
+//# sourceMappingURL=state.d.ts.map

package/dist/trust/state.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../../src/trust/state.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAEjG,2EAA2E;AAC3E,eAAO,MAAM,eAAe,QAAkB,CAAA;AAE9C,qDAAqD;AACrD,eAAO,MAAM,OAAO,EAAE,SAAS,UAAU,EAAwF,CAAA;AAEjI;8EAC8E;AAC9E,eAAO,MAAM,OAAO,GAAI,KAAK,UAAU,EAAE,SAAS,OAAO,EAAE,WAAW,OAAO,KAAG,OAK/E,CAAA;AAED;oEACoE;AACpE,eAAO,MAAM,OAAO,GAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAG,OAA4C,CAAA;AAE3F,2DAA2D;AAC3D,eAAO,MAAM,aAAa,GAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,KAAK,UAAU,KAAG,OAAoD,CAAA;AAE1H,kDAAkD;AAClD,eAAO,MAAM,WAAW,GAAI,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAG,KAAK,GAAG,SAAkE,CAAA;AAElI,6CAA6C;AAC7C,eAAO,MAAM,WAAW,GAAI,OAAO,QAAQ,CAAC,WAAW,CAAC,EAAE,IAAI,MAAM,KAAG,OAAO,GAAG,SAGhF,CAAA;AAED,+EAA+E;AAC/E,eAAO,MAAM,kBAAkB,GAAI,OAAO,QAAQ,CAAC,WAAW,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAG,YAAY,EACE,CAAA;AAEtG;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,GAAG,QAAQ,CAAC,YAAY,CAAC,EAAE,OAAO,SAAS,QAAQ,CAAC,YAAY,CAAC,EAAE,KAAG,OACiB,CAAA;AAE5G;iDACiD;AACjD,wBAAgB,YAAY,CAAE,KAAK,EAAE,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG;IAAE,GAAG,EAAE,YAAY,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,GAAG,IAAI,CAOrH;AAED,sFAAsF;AACtF,eAAO,MAAM,OAAO,GAAI,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAG,OAGnD,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAI,OAAO,QAAQ,CAAC,WAAW,CAAC,EAAE,KAAK,QAAQ,CAAC,YAAY,CAAC,KAAG,OAAO,GAAG,SAG7F,CAAA;AAED;2EAC2E;AAC3E,eAAO,MAAM,OAAO,GAAI,OAAO,QAAQ,CAAC,WAAW,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAG,YAAY,EACb,CAAA;AAE5E;0EAC0E;AAC1E,wBAAgB,QAAQ,CAAE,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,aAAa,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,MAAM,EAAE,CAelH;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAE,IAAI,EAAE,SAAS,QAAQ,CAAC,YAAY,CAAC,EAAE,GAAG,MAAM,EAAE,CAE9E;AAED,qGAAqG;AACrG,eAAO,MAAM,YAAY,GAAI,MAAM,SAAS,QAAQ,CAAC,YAAY,CAAC,EAAE,KAAG,GAAG,CAAC,MAAM,CACvB,CAAA;AAE1D,kGAAkG;AAClG,eAAO,MAAM,SAAS,GAAI,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAG,GAAG,CAAC,MAAM,CAK/D,CAAA;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAE,EAAE,EAAE,SAAS,QAAQ,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,SAAS,QAAQ,CAAC,YAAY,CAAC,EAAE,GAAG,OAAO,CAYhH;AAED,8EAA8E;AAC9E,wBAAgB,aAAa,CAAE,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAIrI;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,KAAK,GAAI,GAAG,QAAQ,CAAC,YAAY,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,EAAE,IAAI,SAAS,QAAQ,CAAC,YAAY,CAAC,EAAE,EAAE,eAAe,WAAW,CAAC,MAAM,CAAC,KAAG,OAGjE,CAAA"}

package/dist/trust/state.js

@@ -0,0 +1,154 @@
+/** The deliverable set's bound, 10¹⁸−1 (2050): the wire-integer domain. */
+export const ADMISSION_BOUND = 10n ** 18n - 1n;
+/** The five classes, in the table's order (2720). */
+export const CLASSES = Object.freeze(['star', 'groupStar', 'anchorMapping', 'sealedGroupStar', 'profile']);
+/** 2760: star and blinded group star go to every contact, the anchor
+ *  mapping to none, sealed group star and profile to the trusted contacts. */
+export const classOn = (cls, setting, isTrusted) => {
+    if (setting !== 'default')
+        return setting === 'on';
+    if (cls === 'star' || cls === 'groupStar')
+        return true;
+    if (cls === 'anchorMapping')
+        return false;
+    return isTrusted;
+};
+/** 2020: a trusted contact is one toward which the anchor mapping class is
+ *  on; its default is no contact (2760), so only `on` makes one. */
+export const trusted = (c) => c.settings.anchorMapping === 'on';
+/** Whether `cls` is on toward the contact (2760, 2840). */
+export const classOnToward = (c, cls) => classOn(cls, c.settings[cls], trusted(c));
+/** The relationship's active-head tuple (6.4). */
+export const activeTuple = (r) => r.tuples.find((t) => t.ownPairLabel === r.activeHead);
+/** A contact by entry id or alias (2140). */
+export const findContact = (state, id) => {
+    if (Object.hasOwn(state.contacts, id))
+        return state.contacts[id];
+    return Object.values(state.contacts).find((c) => c.aliases.includes(id));
+};
+/** The entry's own relationships (Contact.relIds), as present in the state. */
+export const entryRelationships = (state, c) => c.relIds.filter((id) => Object.hasOwn(state.relationships, id)).map((id) => state.relationships[id]);
+/**
+ * Whether a relationship lags in its entry (Section 2, 6595): its anchor
+ * head is held in the entry as superseded, the `prev` of a link one of
+ * the entry's relationships holds. `entry` is the entry's relationships,
+ * `r` among them or not. A relationship with no anchor head never lags.
+ */
+export const lags = (r, entry) => r.heldCounterpartHead !== null && entry.some((o) => o.links.some((l) => l.prev === r.heldCounterpartHead));
+/** Every tuple's place: the relationship holding the tuple with own pair
+ *  label `label` (deactivated ones included). */
+export function tupleByLabel(state, label) {
+    for (const id of Object.keys(state.relationships).sort()) {
+        const rel = state.relationships[id];
+        const tuple = rel.tuples.find((t) => t.ownPairLabel === label);
+        if (tuple)
+            return { rel, tuple };
+    }
+    return null;
+}
+/** A live relationship: not chained into another, its active head not deactivated. */
+export const liveRel = (r) => {
+    const t = activeTuple(r);
+    return r.chainedInto === null && t !== undefined && !t.deactivated;
+};
+/**
+ * The entry a relationship's verifications go to (2145): the one its
+ * active tuple's entryId names, by id or alias, else the one its own
+ * identity (contactId) names. Where a relationship stands behind two
+ * entries, this is the appended tuple's (2146).
+ */
+export const entryOf = (state, rel) => {
+    const t = activeTuple(rel);
+    return (t && findContact(state, t.entryId)) ?? findContact(state, rel.contactId);
+};
+/** The entry's relationships whose verifications go to it (2145): all of
+ *  them, except one that stands behind two entries and feeds the other. */
+export const feeding = (state, c) => entryRelationships(state, c).filter((r) => entryOf(state, r)?.id === c.id);
+/** The newest of `heads` along `links` (6560): those from which no other
+ *  head is reachable. One where every pair of heads lies on one chain. */
+export function newestOf(heads, links) {
+    const next = new Map();
+    for (const l of links)
+        next.set(l.prev, [...(next.get(l.prev) ?? []), l.next]);
+    const reaches = (from, to) => {
+        const seen = new Set();
+        const todo = [...(next.get(from) ?? [])];
+        while (todo.length) {
+            const n = todo.pop();
+            if (n === to)
+                return true;
+            if (!seen.has(n)) {
+                seen.add(n);
+                todo.push(...(next.get(n) ?? []));
+            }
+        }
+        return false;
+    };
+    const hs = [...new Set(heads)];
+    return hs.filter((h) => !hs.some((o) => o !== h && reaches(h, o)));
+}
+/**
+ * The newest anchor heads of a set of relationships (6560): the heads from
+ * which no other head is reachable along the links they hold. One entry's
+ * relationships yield exactly one where the head rule and the binding rule
+ * admitted every merge (6605); a manual merge (6640) may yield more until
+ * its split (2080).
+ */
+export function newestHeads(rels) {
+    return newestOf(rels.map((r) => r.heldCounterpartHead).filter((h) => h !== null), rels.flatMap((r) => r.links));
+}
+/** What an entry holds as superseded (6540): every prev of a link one of its relationships holds. */
+export const supersededIn = (rels) => new Set(rels.flatMap((r) => r.links.map((l) => l.prev)));
+/** A relationship's verified anchor set (6a.1 rung 2): its self and every anchor of its links. */
+export const anchorSet = (r) => {
+    const out = new Set();
+    if (r.heldCounterpartHead !== null)
+        out.add(r.heldCounterpartHead);
+    for (const l of r.links) {
+        out.add(l.prev);
+        out.add(l.next);
+    }
+    return out;
+};
+/**
+ * The binding rule (6605), entry against entry: a relationship of the one
+ * and a relationship of the other hold different pre-rotation bindings
+ * for one anchor both hold, or links from one prev to different nexts (a
+ * held link fixes the binding of its prev, 6610). Compared relationship by
+ * relationship, never combined (6610).
+ */
+export function conflicts(as, bs) {
+    for (const a of as) {
+        for (const b of bs) {
+            // within one relationship too: a chain holding two bindings for one anchor (6610)
+            if (a.links.some((l) => b.links.some((m) => l.prev === m.prev && l.next !== m.next)))
+                return true;
+            for (const [anchor, commits] of Object.entries(a.bindings)) {
+                const other = Object.hasOwn(b.bindings, anchor) ? b.bindings[anchor] : [];
+                if (new Set([...commits, ...other]).size > 1)
+                    return true;
+            }
+        }
+    }
+    return false;
+}
+/** The union of two binding records (6610), each list sorted and distinct. */
+export function unionBindings(a, b) {
+    const out = {};
+    for (const [k, v] of [...Object.entries(a), ...Object.entries(b)])
+        out[k] = [...new Set([...(out[k] ?? []), ...v])].sort();
+    return out;
+}
+/**
+ * The head rule (6530, 6540) for relationship `r` against entry `x`
+ * (relationships `xs`): (a) r's anchor head is x's or the lineage r holds
+ * carries x's as a prev, and (b) x does not hold r's anchor head as
+ * superseded, nor r's own entry x's (`ownSuperseded`). For the incoming
+ * relationship the caller passes the links its entry held before the
+ * verified mapping's lineage joined them: only what the committed mapping
+ * newly carries connects (the 6590 rationale; trust/entries.ts).
+ */
+export const joins = (r, x, xs, ownSuperseded) => r.heldCounterpartHead !== null && x.anchorHead !== null &&
+    (r.heldCounterpartHead === x.anchorHead || r.links.some((l) => l.prev === x.anchorHead)) &&
+    !supersededIn(xs).has(r.heldCounterpartHead) && !ownSuperseded.has(x.anchorHead);
+//# sourceMappingURL=state.js.map

package/dist/trust/state.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"state.js","sourceRoot":"","sources":["../../src/trust/state.ts"],"names":[],"mappings":"AAUA,2EAA2E;AAC3E,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,IAAI,GAAG,GAAG,EAAE,CAAA;AAE9C,qDAAqD;AACrD,MAAM,CAAC,MAAM,OAAO,GAA0B,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,EAAE,SAAS,CAAC,CAAC,CAAA;AAEjI;8EAC8E;AAC9E,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,GAAe,EAAE,OAAgB,EAAE,SAAkB,EAAW,EAAE;IACxF,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,OAAO,KAAK,IAAI,CAAA;IAClD,IAAI,GAAG,KAAK,MAAM,IAAI,GAAG,KAAK,WAAW;QAAE,OAAO,IAAI,CAAA;IACtD,IAAI,GAAG,KAAK,eAAe;QAAE,OAAO,KAAK,CAAA;IACzC,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;oEACoE;AACpE,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAoB,EAAW,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,KAAK,IAAI,CAAA;AAE3F,2DAA2D;AAC3D,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAoB,EAAE,GAAe,EAAW,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;AAE1H,kDAAkD;AAClD,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAyB,EAAqB,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,UAAU,CAAC,CAAA;AAElI,6CAA6C;AAC7C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAA4B,EAAE,EAAU,EAAuB,EAAE;IAC3F,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAChE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1E,CAAC,CAAA;AAED,+EAA+E;AAC/E,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAA4B,EAAE,CAAoB,EAAkB,EAAE,CACvG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAA;AAEtG;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAyB,EAAE,KAAwC,EAAW,EAAE,CACnG,CAAC,CAAC,mBAAmB,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAA;AAE5G;iDACiD;AACjD,MAAM,UAAU,YAAY,CAAE,KAA4B,EAAE,KAAa;IACvE,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACzD,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,KAAK,CAAC,CAAA;QAC9D,IAAI,KAAK;YAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;IAClC,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,sFAAsF;AACtF,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAyB,EAAW,EAAE;IAC5D,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACxB,OAAO,CAAC,CAAC,WAAW,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,WAAW,CAAA;AACpE,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAA4B,EAAE,GAA2B,EAAuB,EAAE;IACxG,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAA;IAC1B,OAAO,CAAC,CAAC,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,CAAA;AAClF,CAAC,CAAA;AAED;2EAC2E;AAC3E,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAA4B,EAAE,CAAoB,EAAkB,EAAE,CAC5F,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;AAE5E;0EAC0E;AAC1E,MAAM,UAAU,QAAQ,CAAE,KAAwB,EAAE,KAAoD;IACtG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAA;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IAC9E,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAU,EAAW,EAAE;QACpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;QAC9B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACxC,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAG,CAAA;YACrB,IAAI,CAAC,KAAK,EAAE;gBAAE,OAAO,IAAI,CAAA;YACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAAC,CAAC;QACtE,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC,CAAA;IACD,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;IAC9B,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AACpE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAE,IAAuC;IAClE,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;AAC9H,CAAC;AAED,qGAAqG;AACrG,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,IAAuC,EAAe,EAAE,CACnF,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAE1D,kGAAkG;AAClG,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAyB,EAAe,EAAE;IAClE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,IAAI,CAAC,CAAC,mBAAmB,KAAK,IAAI;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAA;IAClE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAAC,CAAC;IAC7D,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAE,EAAqC,EAAE,EAAqC;IACrG,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,kFAAkF;YAClF,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAA;YACjG,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3D,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;gBACzE,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBAAE,OAAO,IAAI,CAAA;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,aAAa,CAAE,CAAqC,EAAE,CAAqC;IACzG,MAAM,GAAG,GAA6B,EAAE,CAAA;IACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IAC1H,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAyB,EAAE,CAAoB,EAAE,EAAqC,EAAE,aAAkC,EAAW,EAAE,CAC3J,CAAC,CAAC,mBAAmB,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI;IACvD,CAAC,CAAC,CAAC,mBAAmB,KAAK,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;IACxF,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA","sourcesContent":["// trust/state — pure reads of the Trust Layer over HolderState (lib Stage 2,\n// PR 4a, 4c): the class resolution of Section 2a, the trusted set (2020),\n// the entry's relationships and anchor head (2145, 6560), lagging (6595),\n// the entry a relationship's verifications go to (2145, 2146) and the\n// head rule and binding rule of the net (6530–6605). No crypto, no engine; views.ts and the trust module read through here,\n// so the two cannot disagree.\n//\n// Rule numbers: bare four-digit numbers are RLTP-TRU (trust-layer.md).\nimport type { Contact, HolderState, Relationship, Setting, TrustClass, Tuple } from '../state.js'\n\n/** The deliverable set's bound, 10¹⁸−1 (2050): the wire-integer domain. */\nexport const ADMISSION_BOUND = 10n ** 18n - 1n\n\n/** The five classes, in the table's order (2720). */\nexport const CLASSES: readonly TrustClass[] = Object.freeze(['star', 'groupStar', 'anchorMapping', 'sealedGroupStar', 'profile'])\n\n/** 2760: star and blinded group star go to every contact, the anchor\n *  mapping to none, sealed group star and profile to the trusted contacts. */\nexport const classOn = (cls: TrustClass, setting: Setting, isTrusted: boolean): boolean => {\n  if (setting !== 'default') return setting === 'on'\n  if (cls === 'star' || cls === 'groupStar') return true\n  if (cls === 'anchorMapping') return false\n  return isTrusted\n}\n\n/** 2020: a trusted contact is one toward which the anchor mapping class is\n *  on; its default is no contact (2760), so only `on` makes one. */\nexport const trusted = (c: Readonly<Contact>): boolean => c.settings.anchorMapping === 'on'\n\n/** Whether `cls` is on toward the contact (2760, 2840). */\nexport const classOnToward = (c: Readonly<Contact>, cls: TrustClass): boolean => classOn(cls, c.settings[cls], trusted(c))\n\n/** The relationship's active-head tuple (6.4). */\nexport const activeTuple = (r: Readonly<Relationship>): Tuple | undefined => r.tuples.find((t) => t.ownPairLabel === r.activeHead)\n\n/** A contact by entry id or alias (2140). */\nexport const findContact = (state: Readonly<HolderState>, id: string): Contact | undefined => {\n  if (Object.hasOwn(state.contacts, id)) return state.contacts[id]\n  return Object.values(state.contacts).find((c) => c.aliases.includes(id))\n}\n\n/** The entry's own relationships (Contact.relIds), as present in the state. */\nexport const entryRelationships = (state: Readonly<HolderState>, c: Readonly<Contact>): Relationship[] =>\n  c.relIds.filter((id) => Object.hasOwn(state.relationships, id)).map((id) => state.relationships[id])\n\n/**\n * Whether a relationship lags in its entry (Section 2, 6595): its anchor\n * head is held in the entry as superseded, the `prev` of a link one of\n * the entry's relationships holds. `entry` is the entry's relationships,\n * `r` among them or not. A relationship with no anchor head never lags.\n */\nexport const lags = (r: Readonly<Relationship>, entry: readonly Readonly<Relationship>[]): boolean =>\n  r.heldCounterpartHead !== null && entry.some((o) => o.links.some((l) => l.prev === r.heldCounterpartHead))\n\n/** Every tuple's place: the relationship holding the tuple with own pair\n *  label `label` (deactivated ones included). */\nexport function tupleByLabel (state: Readonly<HolderState>, label: string): { rel: Relationship, tuple: Tuple } | null {\n  for (const id of Object.keys(state.relationships).sort()) {\n    const rel = state.relationships[id]\n    const tuple = rel.tuples.find((t) => t.ownPairLabel === label)\n    if (tuple) return { rel, tuple }\n  }\n  return null\n}\n\n/** A live relationship: not chained into another, its active head not deactivated. */\nexport const liveRel = (r: Readonly<Relationship>): boolean => {\n  const t = activeTuple(r)\n  return r.chainedInto === null && t !== undefined && !t.deactivated\n}\n\n/**\n * The entry a relationship's verifications go to (2145): the one its\n * active tuple's entryId names, by id or alias, else the one its own\n * identity (contactId) names. Where a relationship stands behind two\n * entries, this is the appended tuple's (2146).\n */\nexport const entryOf = (state: Readonly<HolderState>, rel: Readonly<Relationship>): Contact | undefined => {\n  const t = activeTuple(rel)\n  return (t && findContact(state, t.entryId)) ?? findContact(state, rel.contactId)\n}\n\n/** The entry's relationships whose verifications go to it (2145): all of\n *  them, except one that stands behind two entries and feeds the other. */\nexport const feeding = (state: Readonly<HolderState>, c: Readonly<Contact>): Relationship[] =>\n  entryRelationships(state, c).filter((r) => entryOf(state, r)?.id === c.id)\n\n/** The newest of `heads` along `links` (6560): those from which no other\n *  head is reachable. One where every pair of heads lies on one chain. */\nexport function newestOf (heads: readonly string[], links: ReadonlyArray<{ prev: string, next: string }>): string[] {\n  const next = new Map<string, string[]>()\n  for (const l of links) next.set(l.prev, [...(next.get(l.prev) ?? []), l.next])\n  const reaches = (from: string, to: string): boolean => {\n    const seen = new Set<string>()\n    const todo = [...(next.get(from) ?? [])]\n    while (todo.length) {\n      const n = todo.pop()!\n      if (n === to) return true\n      if (!seen.has(n)) { seen.add(n); todo.push(...(next.get(n) ?? [])) }\n    }\n    return false\n  }\n  const hs = [...new Set(heads)]\n  return hs.filter((h) => !hs.some((o) => o !== h && reaches(h, o)))\n}\n\n/**\n * The newest anchor heads of a set of relationships (6560): the heads from\n * which no other head is reachable along the links they hold. One entry's\n * relationships yield exactly one where the head rule and the binding rule\n * admitted every merge (6605); a manual merge (6640) may yield more until\n * its split (2080).\n */\nexport function newestHeads (rels: readonly Readonly<Relationship>[]): string[] {\n  return newestOf(rels.map((r) => r.heldCounterpartHead).filter((h): h is string => h !== null), rels.flatMap((r) => r.links))\n}\n\n/** What an entry holds as superseded (6540): every prev of a link one of its relationships holds. */\nexport const supersededIn = (rels: readonly Readonly<Relationship>[]): Set<string> =>\n  new Set(rels.flatMap((r) => r.links.map((l) => l.prev)))\n\n/** A relationship's verified anchor set (6a.1 rung 2): its self and every anchor of its links. */\nexport const anchorSet = (r: Readonly<Relationship>): Set<string> => {\n  const out = new Set<string>()\n  if (r.heldCounterpartHead !== null) out.add(r.heldCounterpartHead)\n  for (const l of r.links) { out.add(l.prev); out.add(l.next) }\n  return out\n}\n\n/**\n * The binding rule (6605), entry against entry: a relationship of the one\n * and a relationship of the other hold different pre-rotation bindings\n * for one anchor both hold, or links from one prev to different nexts (a\n * held link fixes the binding of its prev, 6610). Compared relationship by\n * relationship, never combined (6610).\n */\nexport function conflicts (as: readonly Readonly<Relationship>[], bs: readonly Readonly<Relationship>[]): boolean {\n  for (const a of as) {\n    for (const b of bs) {\n      // within one relationship too: a chain holding two bindings for one anchor (6610)\n      if (a.links.some((l) => b.links.some((m) => l.prev === m.prev && l.next !== m.next))) return true\n      for (const [anchor, commits] of Object.entries(a.bindings)) {\n        const other = Object.hasOwn(b.bindings, anchor) ? b.bindings[anchor] : []\n        if (new Set([...commits, ...other]).size > 1) return true\n      }\n    }\n  }\n  return false\n}\n\n/** The union of two binding records (6610), each list sorted and distinct. */\nexport function unionBindings (a: Readonly<Record<string, string[]>>, b: Readonly<Record<string, string[]>>): Record<string, string[]> {\n  const out: Record<string, string[]> = {}\n  for (const [k, v] of [...Object.entries(a), ...Object.entries(b)]) out[k] = [...new Set([...(out[k] ?? []), ...v])].sort()\n  return out\n}\n\n/**\n * The head rule (6530, 6540) for relationship `r` against entry `x`\n * (relationships `xs`): (a) r's anchor head is x's or the lineage r holds\n * carries x's as a prev, and (b) x does not hold r's anchor head as\n * superseded, nor r's own entry x's (`ownSuperseded`). For the incoming\n * relationship the caller passes the links its entry held before the\n * verified mapping's lineage joined them: only what the committed mapping\n * newly carries connects (the 6590 rationale; trust/entries.ts).\n */\nexport const joins = (r: Readonly<Relationship>, x: Readonly<Contact>, xs: readonly Readonly<Relationship>[], ownSuperseded: ReadonlySet<string>): boolean =>\n  r.heldCounterpartHead !== null && x.anchorHead !== null &&\n  (r.heldCounterpartHead === x.anchorHead || r.links.some((l) => l.prev === x.anchorHead)) &&\n  !supersededIn(xs).has(r.heldCounterpartHead) && !ownSuperseded.has(x.anchorHead)\n"]}

package/dist/util-freeze.d.ts

@@ -0,0 +1,3 @@
+/** Freezes an object graph in place and returns it. */
+export declare function freezeDeep<T>(x: T): T;
+//# sourceMappingURL=util-freeze.d.ts.map

package/dist/util-freeze.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"util-freeze.d.ts","sourceRoot":"","sources":["../src/util-freeze.ts"],"names":[],"mappings":"AAEA,uDAAuD;AACvD,wBAAgB,UAAU,CAAC,CAAC,EAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAMtC"}

package/dist/util-freeze.js

@@ -0,0 +1,11 @@
+// util-freeze — deep freezing, shared by the engine and the views.
+/** Freezes an object graph in place and returns it. */
+export function freezeDeep(x) {
+    if (x !== null && typeof x === 'object' && !Object.isFrozen(x)) {
+        Object.freeze(x);
+        for (const v of Object.values(x))
+            freezeDeep(v);
+    }
+    return x;
+}
+//# sourceMappingURL=util-freeze.js.map

package/dist/util-freeze.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util-freeze.js","sourceRoot":"","sources":["../src/util-freeze.ts"],"names":[],"mappings":"AAAA,mEAAmE;AAEnE,uDAAuD;AACvD,MAAM,UAAU,UAAU,CAAK,CAAI;IACjC,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAChB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAW,CAAC;YAAE,UAAU,CAAC,CAAC,CAAC,CAAA;IAC3D,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC","sourcesContent":["// util-freeze — deep freezing, shared by the engine and the views.\n\n/** Freezes an object graph in place and returns it. */\nexport function freezeDeep<T> (x: T): T {\n  if (x !== null && typeof x === 'object' && !Object.isFrozen(x)) {\n    Object.freeze(x)\n    for (const v of Object.values(x as object)) freezeDeep(v)\n  }\n  return x\n}\n"]}