@directive-run/core 1.21.0 → 1.23.0

package/dist/chunk-KGTBTGOY.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/plugins/audit-ledger/sink.ts","../src/plugins/audit-ledger/hash.ts","../src/plugins/audit-ledger/predicate-redact.ts","../src/plugins/audit-ledger/types.ts","../src/plugins/audit-ledger/verify.ts","../src/plugins/audit-ledger/index.ts"],"names":["parseRangeBound","v","t","matchesFilter","entry","filter","a","b","start","end","memorySink","opts","capacity","entries","truncateHandler","dropped","limit","out","i","e","n","path","opts2","id","tombstoneFactory","count","handler","LEDGER_INTERNAL_TOKEN","freezeEntry","key","clause","syncHash","hashObject","hashForEntry","replaceAtPath","root","dottedPath","value","segs","part","m","m2","cur","seg","lastSeg","redactWhenSpec","spec","capturePII","piiTaggedFacts","cloned","walkPredicate","factPath","op","_operand","operandPath","HASH_ALGO","verify","sink","erasedSeqsSet","prevHash","prevEntry","entryIsTombstone","prevIsTombstone","candidates","forged","tombstoneEntry","result","createAuditLedger","userRedact","seq","lastHashCache","system","unobserve","whenSpecCache","whenSourceCache","refreshWhenSpecCache","inspect","constraints","mergedDefs","c","def","whenFn","refreshPIITags","meta","tagged","redactValue","redactClauses","clauses","mutated","inner","emit","partial","finalEntry","onEvent","event","whenSpec","whenSourceHash","emittingTruncate","attach","sys","droppedSeq","droppedCount","detach","plugin","type","snapshot","from","to","stripInternal","clone","stripInternalAll","needsClone","snap","erasedAt","tombstone","filterShape","markerEntry"],"mappings":"wEAiBA,SAASA,CAAAA,CAAgBC,CAAAA,CAAmC,CAC1D,GAAIA,CAAAA,YAAa,KAAM,OAAOA,CAAAA,CAAE,OAAA,EAAQ,CACxC,GAAI,OAAOA,GAAM,QAAA,CAAU,CACzB,GAAI,CAAC,MAAA,CAAO,QAAA,CAASA,CAAC,CAAA,CACpB,MAAM,IAAI,KAAA,CACR,8FACF,CAAA,CAGF,OAAOA,CACT,CACA,GAAI,OAAOA,CAAAA,EAAM,QAAA,CAAU,CACzB,IAAMC,CAAAA,CAAI,IAAA,CAAK,KAAA,CAAMD,CAAC,CAAA,CACtB,GAAI,CAAC,MAAA,CAAO,QAAA,CAASC,CAAC,CAAA,CACpB,MAAM,IAAI,KAAA,CACR,CAAA,gDAAA,EAAmDD,CAAC,CAAA,qCAAA,CACtD,CAAA,CAGF,OAAOC,CACT,CACA,MAAM,IAAI,KAAA,CACR,uFACF,CACF,CAEO,SAASC,EAAcC,CAAAA,CAAmBC,CAAAA,CAA8B,CAC7E,GAAIA,CAAAA,CAAO,IAAA,EAEL,EADU,KAAA,CAAM,OAAA,CAAQA,CAAAA,CAAO,IAAI,CAAA,CAAIA,CAAAA,CAAO,IAAA,CAAO,CAACA,CAAAA,CAAO,IAAI,CAAA,EAC1D,QAAA,CAASD,CAAAA,CAAM,IAAI,EAAG,OAAO,MAAA,CAE1C,GAAIC,CAAAA,CAAO,QAAA,GAAa,MAAA,CAEtB,GAAID,CAAAA,CAAM,IAAA,GAAS,aAAA,CAAA,CACjB,GAAIA,CAAAA,CAAM,GAAA,GAAQC,CAAAA,CAAO,SAAU,OAAO,MAAA,CAAA,KAAA,GACjCD,CAAAA,CAAM,IAAA,GAAS,yBAAA,CAAA,CACxB,GAAIA,CAAAA,CAAM,IAAA,GAASC,CAAAA,CAAO,QAAA,CAAU,OAAO,MAAA,CAAA,KAE3C,OAAO,MAAA,CAGX,GAAIA,CAAAA,CAAO,YAAA,GAAiB,MAAA,GACtBD,CAAAA,CAAM,IAAA,GAAS,qBAAA,EACfA,EAAM,YAAA,GAAiBC,CAAAA,CAAO,YAAA,CAAA,CAAc,OAAO,MAAA,CAEzD,GAAIA,EAAO,cAAA,CAAgB,CACzB,GAAM,CAACC,CAAAA,CAAGC,CAAC,CAAA,CAAIF,CAAAA,CAAO,cAAA,CAChBG,CAAAA,CAAQR,CAAAA,CAAgBM,CAAC,CAAA,CACzBG,CAAAA,CAAMT,EAAgBO,CAAC,CAAA,CAC7B,GAAIH,CAAAA,CAAM,EAAA,CAAKI,CAAAA,EAASJ,EAAM,EAAA,CAAKK,CAAAA,CAAK,OAAO,MACjD,CAEA,OAAO,KACT,CAOO,SAASC,CAAAA,CAAWC,CAAAA,CAA8B,EAAC,CAAoB,CAC5E,IAAMC,CAAAA,CAAWD,CAAAA,CAAK,QAAA,EAAY,GAAA,CAC9BE,CAAAA,CAAwB,GACxBC,CAAAA,CAEO,IAAA,CAwEX,OAtE8B,CAC5B,KAAA,CAAMV,CAAAA,CAAO,CACX,GAAIS,CAAAA,CAAQ,MAAA,EAAUD,CAAAA,CAAU,CAM9B,IAAMG,EAAUF,CAAAA,CAAQ,CAAC,CAAA,CACzBC,CAAAA,GAAkBC,CAAAA,CAAQ,GAAA,CAAK,CAAC,CAAA,CAChCF,CAAAA,CAAQ,KAAA,GACV,CAIA,IAHAA,CAAAA,CAAQ,KAAKT,CAAK,CAAA,CAGXS,CAAAA,CAAQ,MAAA,CAASD,CAAAA,EACtBC,CAAAA,CAAQ,KAAA,GAEZ,CAAA,CACA,KAAA,CAAMR,CAAAA,CAAQ,CACZ,IAAMW,CAAAA,CAAQX,EAAO,KAAA,EAAS,GAAA,CACxBY,CAAAA,CAAoB,EAAC,CAC3B,IAAA,IAASC,CAAAA,CAAIL,CAAAA,CAAQ,MAAA,CAAS,CAAA,CAAGK,CAAAA,EAAK,CAAA,CAAGA,CAAAA,EAAAA,CAAK,CAC5C,IAAMC,CAAAA,CAAIN,CAAAA,CAAQK,CAAC,CAAA,CACnB,GAAIf,CAAAA,CAAcgB,EAAGd,CAAM,CAAA,GACzBY,CAAAA,CAAI,IAAA,CAAKE,CAAC,CAAA,CACNF,EAAI,MAAA,EAAUD,CAAAA,CAAAA,CAAO,KAE7B,CAEA,OAAOC,CACT,CAAA,CACA,MAAA,CAAOG,CAAAA,CAAG,CACR,IAAMZ,CAAAA,CAAQ,IAAA,CAAK,GAAA,CAAI,EAAGK,CAAAA,CAAQ,MAAA,CAASO,CAAC,CAAA,CAE5C,OAAOP,CAAAA,CAAQ,MAAML,CAAK,CAC5B,CAAA,CACA,OAAA,CAAQa,CAAAA,CAAMC,CAAAA,CAAQ,EAAC,CAAG,CACxB,OAAO,IAAA,CAAK,KAAA,CAAM,CAAE,QAAA,CAAUD,CAAAA,CAAM,KAAA,CAAOC,CAAAA,CAAM,KAAM,CAAC,CAC1D,CAAA,CACA,cAAcC,CAAAA,CAAID,CAAAA,CAAQ,EAAC,CAAG,CAC5B,OAAO,KAAK,KAAA,CAAM,CAAE,YAAA,CAAcC,CAAAA,CAAI,KAAA,CAAOD,CAAAA,CAAM,KAAM,CAAC,CAC5D,CAAA,CACA,MAAA,EAAS,CACP,OAAO,CAAE,OAAA,CAAST,CAAAA,CAAQ,KAAA,EAAM,CAAG,UAAA,CAAY,IAAA,CAAK,GAAA,EAAM,CAC5D,CAAA,CACA,KAAA,EAAQ,CACNA,CAAAA,CAAU,GACZ,CAAA,CACA,OAAA,EAAU,CACRA,CAAAA,CAAU,EAAC,CACXC,CAAAA,CAAkB,KACpB,CAAA,CACA,KAAA,CAAMT,CAAAA,CAAQmB,CAAAA,CAAkB,CAC9B,IAAIC,CAAAA,CAAQ,CAAA,CACZ,IAAA,IAASP,CAAAA,CAAI,CAAA,CAAGA,CAAAA,CAAIL,CAAAA,CAAQ,MAAA,CAAQK,IAAK,CACvC,IAAMC,CAAAA,CAAIN,CAAAA,CAAQK,CAAC,CAAA,CACff,EAAcgB,CAAAA,CAAGd,CAAM,CAAA,GACzBQ,CAAAA,CAAQK,CAAC,CAAA,CAAIM,EAAiBL,CAAC,CAAA,CAC/BM,CAAAA,EAAAA,EAEJ,CAEA,OAAOA,CACT,CAAA,CACA,UAAA,CAAWC,CAAAA,CAAS,CAClBZ,CAAAA,CAAkBY,EACpB,CACF,CAGF,CCzHO,IAAMC,CAAAA,CAAuC,MAAA,CAClD,iCACF,CAAA,CAOO,SAASC,EAAYxB,CAAAA,CAA+B,CACzD,IAAA,IAAWyB,CAAAA,IAAO,MAAA,CAAO,IAAA,CAAKzB,CAAK,CAAA,CAAG,CACpC,IAAMH,CAAAA,CAAKG,CAAAA,CAA6CyB,CAAG,CAAA,CAC3D,GAAI5B,CAAAA,GAAM,IAAA,EAAQ,OAAOA,CAAAA,EAAM,QAAA,CAAU,CACvC,GAAI,KAAA,CAAM,OAAA,CAAQA,CAAC,CAAA,EAAK4B,CAAAA,GAAQ,aAAA,CAC9B,QAAWC,CAAAA,IAAU7B,CAAAA,CACf6B,CAAAA,GAAW,IAAA,EAAQ,OAAOA,CAAAA,EAAW,UACvC,MAAA,CAAO,MAAA,CAAOA,CAAM,CAAA,CAI1B,MAAA,CAAO,MAAA,CAAO7B,CAAC,EACjB,CACF,CACA,OAAA,MAAA,CAAO,MAAA,CAAOG,CAAK,CAAA,CAEZA,CACT,CAuBA,SAAS2B,CAAAA,CAAS3B,CAAAA,CAA2B,CAG3C,OAAO4B,CAAAA,CAAW5B,CAAK,CACzB,CAUO,SAAS6B,CAAAA,CAAa7B,CAAAA,CAA2B,CACtD,GAAQA,CAAAA,CAAM,QAAA,GACP,QAAA,CACH,OAAO2B,CAAAA,CAAS3B,CAAK,CAAA,CAErB,MAAM,IAAI,KAAA,CACR,CAAA,4CAAA,EAA+C,MAAA,CAAQA,CAAAA,CAAgC,QAAQ,CAAC,CAAA,eAAA,EAAkBA,CAAAA,CAAM,GAAG,CAAA,4DAAA,CAC7H,CAEN,CCnFA,SAAS8B,CAAAA,CACPC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACM,CACN,GAAIF,IAAS,IAAA,EAAQ,OAAOA,CAAAA,EAAS,QAAA,CAAU,OAG/C,IAAMG,CAAAA,CAA+B,EAAC,CACtC,IAAA,IAAWC,CAAAA,IAAQH,CAAAA,CAAW,KAAA,CAAM,GAAG,EAAG,CACxC,GAAI,CAACG,CAAAA,CAAM,SAEX,IAAMC,EAAID,CAAAA,CAAK,KAAA,CAAM,iBAAiB,CAAA,CACtC,GAAIC,CAAAA,CAAG,CACLF,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAOE,CAAAA,CAAE,CAAC,CAAC,CAAC,CAAA,CAClBA,CAAAA,CAAE,CAAC,CAAA,EAAGF,CAAAA,CAAK,IAAA,CAAKE,CAAAA,CAAE,CAAC,CAAA,CAAE,OAAA,CAAQ,KAAA,CAAO,EAAE,CAAC,CAAA,CAC3C,QACF,CAEA,IAAMC,CAAAA,CAAKF,CAAAA,CAAK,KAAA,CAAM,wBAAwB,EAC9C,GAAIE,CAAAA,CAAI,CACNH,CAAAA,CAAK,IAAA,CAAKG,CAAAA,CAAG,CAAC,CAAE,CAAA,CAChBH,CAAAA,CAAK,IAAA,CAAK,MAAA,CAAOG,CAAAA,CAAG,CAAC,CAAC,CAAC,CAAA,CACnBA,CAAAA,CAAG,CAAC,CAAA,EAAGH,CAAAA,CAAK,IAAA,CAAKG,CAAAA,CAAG,CAAC,CAAA,CAAE,OAAA,CAAQ,KAAA,CAAO,EAAE,CAAC,EAC7C,QACF,CACAH,CAAAA,CAAK,IAAA,CAAKC,CAAI,EAChB,CAEA,IAAIG,CAAAA,CAAeP,CAAAA,CACnB,IAAA,IAAS,CAAA,CAAI,CAAA,CAAG,CAAA,CAAIG,EAAK,MAAA,CAAS,CAAA,CAAG,CAAA,EAAA,CAAK,CACxC,IAAMK,CAAAA,CAAML,EAAK,CAAC,CAAA,CAClB,GAAII,CAAAA,GAAQ,IAAA,EAAQ,OAAOA,GAAQ,QAAA,CAAU,OAC7CA,CAAAA,CAAOA,CAAAA,CAAyCC,CAAG,EACrD,CACA,GAAID,CAAAA,GAAQ,IAAA,EAAQ,OAAOA,CAAAA,EAAQ,QAAA,CAAU,OAC7C,IAAME,CAAAA,CAAUN,CAAAA,CAAKA,CAAAA,CAAK,MAAA,CAAS,CAAC,CAAA,CAChCM,IAAY,MAAA,GACfF,CAAAA,CAAyCE,CAAO,CAAA,CAAIP,CAAAA,EACvD,CAQO,SAASQ,CAAAA,CACdC,CAAAA,CACAC,CAAAA,CACAC,CAAAA,CACS,CAET,GADID,CAAAA,EAAcC,CAAAA,CAAe,IAAA,GAAS,CAAA,EACtCF,CAAAA,GAAS,IAAA,EAAQ,OAAOA,CAAAA,EAAS,SAAU,OAAOA,CAAAA,CAKtD,IAAIG,CAAAA,CACJ,GAAI,CACFA,EAAS,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,SAAA,CAAUH,CAAI,CAAC,EAC1C,CAAA,KAAQ,CAEN,OAAOA,CACT,CAEA,OAAAI,CAAAA,CAAcD,CAAAA,CAAQ,CACpB,QAAA,CAASE,CAAAA,CAAUC,CAAAA,CAAIC,CAAAA,CAAUC,CAAAA,CAAa,CACvCN,CAAAA,CAAe,GAAA,CAAIG,CAAQ,CAAA,EAEhCjB,CAAAA,CAAce,CAAAA,CAAQK,CAAAA,CAAa,YAAY,EAEjD,CAAA,CACA,OAAA,CAAQH,CAAAA,CAAU,CACXH,CAAAA,CAAe,IAAIG,CAAQ,CAAA,EAEhCjB,CAAAA,CAAce,CAAAA,CAAQE,CAAAA,CAAU,YAAY,EAC9C,CACF,CAAC,CAAA,CAEMF,CACT,CCnFO,IAAMM,CAAAA,CAAY,SCJlB,SAASC,CAAAA,CACdC,CAAAA,CACA9C,CAAAA,CACc,CAKd,GAAIA,GAAM,MAAA,GAAW,IAAA,CACnB,MAAM,IAAI,KAAA,CACR,yIACF,EAGF,GAAM,CAAE,OAAA,CAAAE,CAAQ,CAAA,CAAI4C,CAAAA,CAAK,MAAA,EAAO,CAChC,GAAI5C,CAAAA,CAAQ,MAAA,GAAW,CAAA,CACrB,OAAO,CAAE,MAAO,IAAA,CAAM,UAAA,CAAY,CAAE,CAAA,CAqBtC,IAAM6C,CAAAA,CAAgB,IAAI,GAAA,CACtBC,CAAAA,CAA0B,IAAA,CAC9B,IAAA,IAAS,CAAA,CAAI,CAAA,CAAG,EAAI9C,CAAAA,CAAQ,MAAA,CAAQ,CAAA,EAAA,CAAK,CACvC,IAAMT,CAAAA,CAAQS,CAAAA,CAAQ,CAAC,CAAA,CACvB,GAAIT,CAAAA,CAAM,QAAA,GAAauD,CAAAA,CAAU,CAK/B,IAAMC,CAAAA,CAAY,CAAA,CAAI,CAAA,CAAI/C,CAAAA,CAAQ,CAAA,CAAI,CAAC,EAAK,IAAA,CACtCgD,CAAAA,CAAmBzD,CAAAA,CAAM,IAAA,GAAS,qBAAA,CAClC0D,CAAAA,CAAkBF,GAAW,IAAA,GAAS,qBAAA,CAE5C,GAAIC,CAAAA,EAAoBC,CAAAA,CAAiB,CAGvC,IAAMC,CAAAA,CAA2B,EAAC,CAC9BF,CAAAA,EAAkBE,CAAAA,CAAW,IAAA,CAAK3D,CAAK,EACvC0D,CAAAA,EAAmBF,CAAAA,GAAc,IAAA,EACnCG,CAAAA,CAAW,IAAA,CAAKH,CAAS,CAAA,CAE3B,IAAMI,CAAAA,CAASD,CAAAA,CAAW,IAAA,CACvB5C,CAAAA,EACEA,CAAAA,CAA4C,UAAA,GAC7CQ,CACJ,CAAA,CACA,GAAIqC,CAAAA,CACF,OAAO,CACL,KAAA,CAAO,KAAA,CACP,QAAA,CAAU,CAAA,CACV,YAAA,CAAcL,CAAAA,EAAY,WAAA,CAC1B,UAAA,CAAYvD,CAAAA,CAAM,UAAY,WAAA,CAC9B,KAAA,CAAO4D,CAAAA,CACP,MAAA,CACE,yKACJ,CAAA,CAKF,IAAMC,CAAAA,CAAiBJ,CAAAA,CAAmBzD,CAAAA,CAAQwD,CAAAA,CAClDF,CAAAA,CAAc,GAAA,CAAIO,EAAe,GAAG,CAAA,CACpCN,CAAAA,CAAW1B,CAAAA,CAAa7B,CAAK,CAAA,CAE7B,QACF,CAEA,OAAO,CACL,KAAA,CAAO,KAAA,CACP,QAAA,CAAU,CAAA,CACV,aAAcuD,CAAAA,EAAY,WAAA,CAC1B,UAAA,CAAYvD,CAAAA,CAAM,QAAA,EAAY,WAAA,CAC9B,KAAA,CAAAA,CACF,CACF,CACAuD,CAAAA,CAAW1B,CAAAA,CAAa7B,CAAK,EAC/B,CAEA,IAAM8D,CAAAA,CAIF,CACF,KAAA,CAAO,IAAA,CACP,UAAA,CAAYrD,CAAAA,CAAQ,MACtB,CAAA,CACA,OAAI6C,CAAAA,CAAc,IAAA,CAAO,CAAA,GACvBQ,CAAAA,CAAO,WAAa,CAAC,GAAGR,CAAa,CAAA,CAAE,IAAA,CAAK,CAACpD,EAAGC,CAAAA,GAAMD,CAAAA,CAAIC,CAAC,CAAA,CAAA,CAGtD2D,CACT,CC/BO,SAASC,EAAAA,CAAkBxD,CAAAA,CAA2B,EAAC,CAAgB,CAC5E,IAAM8C,CAAAA,CAAO9C,CAAAA,CAAK,IAAA,EAAQD,CAAAA,EAAW,CAC/BqC,CAAAA,CAAapC,CAAAA,CAAK,UAAA,EAAc,MAChCyD,CAAAA,CAAazD,CAAAA,CAAK,MAAA,CAEpB0D,CAAAA,CAAM,CAAA,CACNC,CAAAA,CAA+B,IAAA,CAE/BC,CAAAA,CAAsC,IAAA,CACtCC,CAAAA,CAAiC,IAAA,CAQ/BC,CAAAA,CAAgB,IAAI,GAAA,CAcpBC,EAAkB,IAAI,GAAA,CAGtB1B,GAAAA,CAAiB,IAAI,GAAA,CAE3B,SAAS2B,CAAAA,EAA6B,CAGpC,GAFAF,CAAAA,CAAc,KAAA,EAAM,CACpBC,CAAAA,CAAgB,KAAA,GACZ,CAAA,CAACH,CAAAA,CACL,GAAI,CACF,IAAMK,CAAAA,CACJL,EASA,OAAA,CACF,GAAI,OAAOK,CAAAA,EAAY,UAAA,CAAY,OAEnC,IAAMC,CAAAA,CADaD,CAAAA,EAAQ,EACK,WAAA,EAAe,EAAC,CAG1CE,CAAAA,CACJP,CAAAA,CAKA,SAAA,EAAW,iBAAA,CACb,IAAA,IAAWQ,CAAAA,IAAKF,CAAAA,CACd,GAAIE,EAAE,QAAA,GAAa,KAAA,CAAA,CAGjBN,CAAAA,CAAc,GAAA,CACZM,CAAAA,CAAE,EAAA,CACFlC,EACEkC,CAAAA,CAAE,QAAA,CACFhC,CAAAA,CACAC,GACF,CACF,CAAA,CAAA,KACK,CAML,IAAMgC,CAAAA,CAAMF,CAAAA,GAAaC,CAAAA,CAAE,EAAE,CAAA,CACvBE,CAAAA,CACJD,CAAAA,EAAO,OAAOA,CAAAA,CAAI,IAAA,EAAS,UAAA,CAAaA,CAAAA,CAAI,IAAA,CAAO,OACjDC,CAAAA,CACFP,CAAAA,CAAgB,GAAA,CAAIK,CAAAA,CAAE,EAAA,CAAI/C,CAAAA,CAAW,OAAOiD,CAAM,CAAC,CAAC,CAAA,CAC3CF,CAAAA,CAAE,IAAA,GAAS,QAAa,OAAOA,CAAAA,CAAE,IAAA,EAAS,UAAA,CACnDL,CAAAA,CAAgB,GAAA,CAAIK,CAAAA,CAAE,EAAA,CAAI/C,CAAAA,CAAW,MAAA,CAAO+C,CAAAA,CAAE,IAAI,CAAC,CAAC,EAMpDL,CAAAA,CAAgB,GAAA,CAAIK,CAAAA,CAAE,EAAA,CAAI/C,CAAAA,CAAW,YAAY,CAAC,EAEtD,CAEJ,CAAA,KAAQ,CAER,CACF,CAEA,SAASkD,GAAuB,CAE9B,GADAlC,GAAAA,CAAe,KAAA,EAAM,CACjB,EAAAD,CAAAA,EAAc,CAACwB,CAAAA,CAAAA,CACnB,GAAI,CACF,IAAMY,CAAAA,CACJZ,CAAAA,CACA,KACF,GAAI,CAACY,CAAAA,EAAQ,OAAOA,CAAAA,CAAK,KAAA,EAAU,WAAY,OAC/C,IAAMC,CAAAA,CAASD,CAAAA,CAAK,KAAA,CAAM,KAAK,GAAK,EAAC,CACrC,IAAA,IAAW3C,CAAAA,IAAK4C,CAAAA,CACdpC,GAAAA,CAAe,GAAA,CAAIR,CAAAA,CAAE,EAAE,EAE3B,CAAA,KAAQ,CAER,CACF,CAEA,SAAS6C,CAAAA,CAAYlC,CAAAA,CAAkBd,CAAAA,CAAyB,CAC9D,OAAIU,CAAAA,CAAmBV,EACnBW,GAAAA,CAAe,GAAA,CAAIG,CAAQ,CAAA,CAAU,YAAA,CAElCd,CACT,CAEA,SAASiD,CAAAA,CACPC,CAAAA,CAC4B,CAE5B,GADI,CAACA,CAAAA,EACDxC,CAAAA,EAAcC,GAAAA,CAAe,IAAA,GAAS,CAAA,CAAG,OAAOuC,CAAAA,CACpD,IAAIC,EAAU,KAAA,CACRvE,CAAAA,CAAsBsE,CAAAA,CAAQ,GAAA,CAAKR,CAAAA,EAAM,CAC7C,GAAI/B,GAAAA,CAAe,GAAA,CAAI+B,CAAAA,CAAE,IAAI,CAAA,CAC3B,OAAAS,EAAU,IAAA,CACH,CAAE,GAAGT,CAAAA,CAAG,MAAA,CAAQ,YAAa,CAAA,CAGtC,GAAIA,CAAAA,CAAE,QAAA,CAAU,CACd,IAAMU,CAAAA,CAAQH,CAAAA,CAAcP,EAAE,QAAQ,CAAA,CACtC,GAAIU,CAAAA,GAAUV,CAAAA,CAAE,QAAA,CACd,OAAAS,CAAAA,CAAU,IAAA,CACH,CAAE,GAAGT,CAAAA,CAAG,QAAA,CAAUU,CAAM,CAEnC,CAEA,OAAOV,CACT,CAAC,CAAA,CAED,OAAOS,CAAAA,CAAUvE,CAAAA,CAAMsE,CACzB,CAaA,SAASG,CAAAA,CAAKC,CAAAA,CAA8C,CAC1D,IAAMvF,CAAAA,CAAQ,CACZ,GAAGuF,CAAAA,CACH,GAAA,CAAKtB,CAAAA,EAAAA,CACL,GAAI,IAAA,CAAK,GAAA,EAAI,CACb,QAAA,CAAUC,CAAAA,CACV,QAAA,CAAUf,EACV,aAAA,CAAe,CACjB,CAAA,CAEMqC,CAAAA,CAAaxB,CAAAA,CAAaA,CAAAA,CAAWhE,CAAK,CAAA,CAAIA,CAAAA,CACpD,OAAAwB,CAAAA,CAAYgE,CAAU,CAAA,CACtBnC,CAAAA,CAAK,MAAMmC,CAAU,CAAA,CAKrBtB,CAAAA,CAAgBrC,CAAAA,CAAa2D,CAAU,CAAA,CAEhCA,CACT,CAEA,SAASC,CAAAA,CAAQC,CAAAA,CAA+B,CAC9C,OAAQA,EAAM,IAAA,EACZ,KAAK,qBAAA,CAAuB,CAC1B,IAAMC,CAAAA,CAAWtB,CAAAA,CAAc,GAAA,CAAIqB,CAAAA,CAAM,EAAE,CAAA,CACrCE,CAAAA,CAAiBtB,CAAAA,CAAgB,IAAIoB,CAAAA,CAAM,EAAE,CAAA,CAC7CH,CAAAA,CAAmC,CACvC,IAAA,CAAM,sBACN,YAAA,CAAcG,CAAAA,CAAM,EAAA,CACpB,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,YAAaR,CAAAA,CAAcQ,CAAAA,CAAM,WAAW,CAC9C,CAAA,CACIC,CAAAA,GAAa,MAAA,CACfJ,CAAAA,CAAQ,QAAA,CAAWI,CAAAA,CACVC,CAAAA,GAAmB,MAAA,GAI5BL,CAAAA,CAAQ,UAAA,CAAa,CACnB,IAAA,CAAM,UAAA,CACN,UAAA,CAAYK,CACd,CAAA,CAAA,CAEFN,CAAAA,CAAKC,CAAO,CAAA,CACZ,KACF,CACA,KAAK,aAAA,CACHD,CAAAA,CAAK,CACH,KAAM,aAAA,CACN,GAAA,CAAKI,CAAAA,CAAM,GAAA,CACX,KAAA,CAAOT,CAAAA,CAAYS,CAAAA,CAAM,GAAA,CAAKA,CAAAA,CAAM,IAAI,CAAA,CACxC,IAAA,CAAMT,CAAAA,CAAYS,CAAAA,CAAM,IAAKA,CAAAA,CAAM,IAAI,CACzC,CAAC,CAAA,CACD,MACF,KAAK,yBAAA,CACCA,CAAAA,CAAM,IAAA,GAAS,SAAA,CACjBJ,CAAAA,CAAK,CACH,KAAM,yBAAA,CACN,SAAA,CAAW,SAAA,CACX,UAAA,CAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,CAAAA,CAAM,aAAA,CACrB,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,OAAA,CAASA,CAAAA,CAAM,OACjB,CAAC,CAAA,CAEDJ,CAAAA,CAAK,CACH,IAAA,CAAM,yBAAA,CACN,UAAW,WAAA,CACX,UAAA,CAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,CAAAA,CAAM,cACrB,MAAA,CAAQA,CAAAA,CAAM,MAAA,CACd,IAAA,CAAMA,CAAAA,CAAM,IAAA,CACZ,QAAA,CAAUT,CAAAA,CAAYS,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,QAAQ,CAAA,CAChD,MAAA,CAAQT,EAAYS,CAAAA,CAAM,IAAA,CAAMA,CAAAA,CAAM,MAAM,CAC9C,CAAC,EAEH,MACF,KAAK,mBAAA,CACHJ,CAAAA,CAAK,CACH,IAAA,CAAM,oBACN,UAAA,CAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,CAAAA,CAAM,aAAA,CACrB,QAAA,CAAUA,CAAAA,CAAM,QAClB,CAAC,CAAA,CACD,MACF,KAAK,gBAAA,CACHJ,EAAK,CACH,IAAA,CAAM,gBAAA,CACN,UAAA,CAAYI,CAAAA,CAAM,QAAA,CAClB,aAAA,CAAeA,CAAAA,CAAM,aAAA,CACrB,KAAA,CAAO,MAAA,CAAOA,CAAAA,CAAM,KAAK,CAC3B,CAAC,CAAA,CACD,MACF,KAAK,aAAA,CACL,KAAK,cAAA,CACL,KAAK,aAAA,CACL,KAAK,gBAAA,CACHJ,CAAAA,CAAK,CAAE,IAAA,CAAMI,CAAAA,CAAM,IAAK,CAAC,CAAA,CACzB,MACF,KAAK,eAAA,CACL,KAAK,gBAQHJ,CAAAA,CAAK,CACH,IAAA,CAAMI,CAAAA,CAAM,IAAA,CACZ,QAAA,CAAUA,EAAM,EAAA,CAChB,QAAA,CAAUA,CAAAA,CAAM,QAClB,CAAC,CAAA,CACD,MACF,KAAK,cAAA,CACHJ,CAAAA,CAAK,CACH,IAAA,CAAM,cAAA,CACN,QAAA,CAAUI,EAAM,EAAA,CAChB,QAAA,CAAUA,CAAAA,CAAM,QAAA,CAChB,KAAA,CAAOA,CAAAA,CAAM,MACb,KAAA,CACEA,CAAAA,CAAM,KAAA,YAAiB,KAAA,CACnBA,CAAAA,CAAM,KAAA,CAAM,QACZ,MAAA,CAAOA,CAAAA,CAAM,KAAK,CAC1B,CAAC,CAAA,CACD,MAOJ,CACF,CAOA,IAAIG,CAAAA,CAAmB,KAAA,CAEvB,SAASC,CAAAA,CAAOC,CAAAA,CAAiC,CAC/C5B,CAAAA,CAAS4B,CAAAA,CACTjB,CAAAA,GACAP,CAAAA,EAAqB,CACrBH,CAAAA,CAAY2B,CAAAA,CAAI,OAAA,CAAQN,CAAO,EAK/BpC,CAAAA,CAAK,UAAA,GAAa,CAAC2C,CAAAA,CAAYC,CAAAA,GAAiB,CAC9C,GAAI,CAAAJ,CAAAA,CACJ,CAAAA,CAAAA,CAAmB,IAAA,CACnB,GAAI,CACFP,EAAK,CACH,IAAA,CAAM,kBAAA,CACN,UAAA,CAAAU,CAAAA,CACA,YAAA,CAAAC,CACF,CAAC,EACH,CAAA,OAAE,CACAJ,CAAAA,CAAmB,MACrB,CAAA,CACF,CAAC,EACH,CAEA,SAASK,CAAAA,EAAe,CAClB9B,CAAAA,GACFA,CAAAA,EAAU,CACVA,CAAAA,CAAY,IAAA,CAAA,CAEdD,CAAAA,CAAS,IAAA,CACTE,CAAAA,CAAc,KAAA,GACdC,CAAAA,CAAgB,KAAA,EAAM,CACtB1B,GAAAA,CAAe,KAAA,GACjB,CAEA,IAAMuD,CAAAA,CAA+B,CACnC,IAAA,CAAM,cAAA,CACN,MAAA,CAAOJ,EAAK,CACVD,CAAAA,CAAOC,CAA2B,EACpC,CAAA,CACA,MAAA,EAAS,CAGH3B,CAAAA,GACFA,CAAAA,EAAU,CACVA,CAAAA,CAAY,IAAA,EAEhB,CAAA,CACA,SAAA,EAAY,CACV8B,CAAAA,GACF,CAAA,CACA,oBAAA,CAAqBE,CAAAA,CAAMjF,CAAAA,CAAI,CACzBiF,CAAAA,GAAS,YAAA,EAAc7B,CAAAA,EAAqB,CAAA,CAC5C6B,CAAAA,GAAS,YAAA,EAAgBA,IAAS,UAAA,EAAcA,CAAAA,GAAS,QAAA,GAG3DtB,CAAAA,GAGJ,CAAA,CACA,kBAAA,CAAmBsB,CAAAA,CAAMjF,CAAAA,CAAI,CAGvBiF,CAAAA,GAAS,YAAA,EAAc7B,CAAAA,GAE7B,EACA,sBAAA,CAAuB6B,CAAAA,CAAMjF,CAAAA,CAAI,CAC3BiF,CAAAA,GAAS,YAAA,EAAc7B,IAE7B,CAAA,CACA,UAAA,CAAW8B,CAAAA,CAAU,CAInBf,CAAAA,CAAK,CACH,IAAA,CAAM,iBAAA,CACN,UAAA,CAAYe,CAAAA,CAAS,EAAA,CACrB,OAAA,CAASA,CAAAA,CAAS,OACpB,CAAC,EACH,CAAA,CACA,iBAAA,CAAkBC,CAAAA,CAAMC,CAAAA,CAAI,CAE1BjB,CAAAA,CAAK,CACH,IAAA,CAAM,yBAAA,CACN,IAAA,CAAAgB,CAAAA,CACA,EAAA,CAAAC,CACF,CAAC,EACH,CACF,CAAA,CAQA,SAASC,CAAAA,CAAcxG,EAA+B,CACpD,GACGA,CAAAA,CAAgD,UAAA,GAAe,MAAA,CAEhE,OAAOA,CAAAA,CAET,IAAMyG,CAAAA,CAAQ,CAAE,GAAGzG,CAAM,CAAA,CACzB,OAAA,OAAOyG,EAAM,UAAA,CAENA,CACT,CAEA,SAASC,CAAAA,CACPjG,CAAAA,CACuB,CAGvB,IAAIkG,CAAAA,CAAa,KAAA,CACjB,IAAA,IAAW5F,CAAAA,IAAKN,CAAAA,CACd,GACGM,CAAAA,CAA4C,UAAA,GAAe,MAAA,CAC5D,CACA4F,CAAAA,CAAa,IAAA,CACb,KACF,CAEF,OAAKA,CAAAA,CAIElG,CAAAA,CAAQ,GAAA,CAAI+F,CAAa,CAAA,CAHvB/F,CAIX,CAEA,OAAO,CACL,MAAA,CAAA0F,CAAAA,CACA,KAAA,CAAO,CAAClG,CAAAA,CAAS,EAAC,GAAMyG,CAAAA,CAAiBrD,CAAAA,CAAK,KAAA,CAAMpD,CAAM,CAAC,CAAA,CAC3D,MAAA,CAASe,CAAAA,EAAM0F,CAAAA,CAAiBrD,CAAAA,CAAK,MAAA,CAAOrC,CAAC,CAAC,CAAA,CAC9C,OAAA,CAAS,CAACC,CAAAA,CAAMC,CAAAA,GAAUwF,EAAiBrD,CAAAA,CAAK,OAAA,CAAQpC,CAAAA,CAAMC,CAAK,CAAC,CAAA,CACpE,cAAe,CAACC,CAAAA,CAAID,CAAAA,GAClBwF,CAAAA,CAAiBrD,CAAAA,CAAK,aAAA,CAAclC,EAAID,CAAK,CAAC,CAAA,CAChD,MAAA,CAAQ,IAAM,CACZ,IAAM0F,CAAAA,CAAOvD,CAAAA,CAAK,MAAA,EAAO,CAEzB,OAAO,CACL,OAAA,CAASqD,EAAiBE,CAAAA,CAAK,OAAO,CAAA,CACtC,UAAA,CAAYA,CAAAA,CAAK,UACnB,CACF,CAAA,CACA,MAAA,CAAOrG,CAAAA,CAA2C,CAChD,OAAO6C,CAAAA,CAAYC,CAAAA,CAAM9C,CAAI,CAC/B,CAAA,CACA,KAAA,CAAMN,CAAAA,CAAQ,CAGZ,IAAM4G,CAAAA,CAAW,IAAA,CAAK,GAAA,EAAI,CACtBxF,CAAAA,CAAQ,CAAA,CAuCZ,GAtCI,OAAOgC,EAAK,KAAA,EAAU,UAAA,GACxBhC,CAAAA,CAAQgC,CAAAA,CAAK,KAAA,CAAMpD,CAAAA,CAASc,GAAM,CAUhC,IAAM+F,CAAAA,CAAY,CAChB,GAAA,CAAK/F,CAAAA,CAAE,IACP,EAAA,CAAIA,CAAAA,CAAE,EAAA,CACN,IAAA,CAAM,qBAAA,CACN,QAAA,CAAUA,CAAAA,CAAE,QAAA,CACZ,QAAA,CAAUA,CAAAA,CAAE,QAAA,CACZ,aAAA,CACGA,CAAAA,CACE,aAAA,EAAiB,EACtB,YAAA,CAAcA,CAAAA,CAAE,IAAA,CAChB,QAAA,CAAA8F,CAAAA,CACA,UAAA,CAAYtF,CACd,CAAA,CAMA,OAAAC,CAAAA,CAAYsF,CAAS,CAAA,CAEdA,CACT,CAAC,GAMCzF,CAAAA,GAAU,CAAA,CACZ,OAAO,CAAE,MAAA,CAAQ,CAAA,CAAG,WAAA,CAAa,IAAK,CAAA,CAMxC,IAAM0F,CAAAA,CAAc,CAClB,QAAA,CAAU9G,CAAAA,CAAO,WAAa,MAAA,CAC9B,YAAA,CAAcA,CAAAA,CAAO,YAAA,GAAiB,MAAA,CACtC,IAAA,CAAMA,EAAO,IAAA,CACb,cAAA,CACEA,CAAAA,CAAO,cAAA,GAAmB,MAAA,CACrB,SAAA,CACD,MACR,CAAA,CAGM+G,CAAAA,CAAc1B,CAAAA,CAAK,CACvB,IAAA,CAAM,uBAAA,CACN,UAAA,CAAY1D,CAAAA,CAAW3B,CAAM,CAAA,CAC7B,WAAA,CAAA8G,CAAAA,CACA,MAAA,CAAQ1F,CACV,CAAC,CAAA,CAED,OAAO,CAAE,MAAA,CAAQA,CAAAA,CAAO,WAAA,CAAA2F,CAAY,CACtC,CAAA,CACA,KAAA,EAAQ,CACN3D,CAAAA,CAAK,KAAA,EAAM,CACXY,EAAM,CAAA,CACNC,CAAAA,CAAgB,KAClB,CAAA,CACA,OAAA,EAAU,CACRgC,CAAAA,EAAO,CACP7C,CAAAA,CAAK,OAAA,GACP,CACF,CACF","file":"chunk-KGTBTGOY.js","sourcesContent":["/**\n * `memorySink()` — bounded ring-buffer implementation of\n * `AuditLedgerSink`. Drops the oldest entry past `capacity`\n * (default 10,000), exposes a truncation hook so the ledger plugin\n * can emit a `system.truncated` marker before the shift, and\n * supports in-place tombstone erasure for GDPR Art. 17.\n *\n * Pure storage layer — no hash chain awareness, no PII redaction.\n * The plugin in `./index.ts` owns those concerns and routes them\n * through this sink via `write()` / `erase()`.\n */\n\nimport type { AuditEntry, AuditLedgerSink, QueryFilter } from \"./types.js\";\n\nconst DEFAULT_MEMORY_CAPACITY = 10_000;\nconst DEFAULT_QUERY_LIMIT = 1000;\n\nfunction parseRangeBound(v: string | number | Date): number {\n  if (v instanceof Date) return v.getTime();\n  if (typeof v === \"number\") {\n    if (!Number.isFinite(v)) {\n      throw new Error(\n        \"[Directive] audit-ledger: changedBetween bound must be a finite number, ISO string, or Date.\",\n      );\n    }\n\n    return v;\n  }\n  if (typeof v === \"string\") {\n    const t = Date.parse(v);\n    if (!Number.isFinite(t)) {\n      throw new Error(\n        `[Directive] audit-ledger: changedBetween bound \"${v}\" is not a parseable ISO date string.`,\n      );\n    }\n\n    return t;\n  }\n  throw new Error(\n    \"[Directive] audit-ledger: changedBetween bound must be a number, ISO string, or Date.\",\n  );\n}\n\nexport function matchesFilter(entry: AuditEntry, filter: QueryFilter): boolean {\n  if (filter.kind) {\n    const kinds = Array.isArray(filter.kind) ? filter.kind : [filter.kind];\n    if (!kinds.includes(entry.kind)) return false;\n  }\n  if (filter.factPath !== undefined) {\n    // Exact match — no LIKE wildcards. (SEC M2)\n    if (entry.kind === \"fact.change\") {\n      if (entry.key !== filter.factPath) return false;\n    } else if (entry.kind === \"resolver.write.rejected\") {\n      if (entry.fact !== filter.factPath) return false;\n    } else {\n      return false;\n    }\n  }\n  if (filter.constraintId !== undefined) {\n    if (entry.kind !== \"constraint.evaluate\") return false;\n    if (entry.constraintId !== filter.constraintId) return false;\n  }\n  if (filter.changedBetween) {\n    const [a, b] = filter.changedBetween;\n    const start = parseRangeBound(a);\n    const end = parseRangeBound(b);\n    if (entry.ts < start || entry.ts > end) return false;\n  }\n\n  return true;\n}\n\n/**\n * In-memory bounded ring-buffer sink. Drops oldest entries past\n * `capacity` (default 10,000). Use this as the default sink for dev,\n * tests, and StackBlitz demos.\n */\nexport function memorySink(opts: { capacity?: number } = {}): AuditLedgerSink {\n  const capacity = opts.capacity ?? DEFAULT_MEMORY_CAPACITY;\n  let entries: AuditEntry[] = [];\n  let truncateHandler:\n    | ((droppedSeq: number, droppedCount: number) => void)\n    | null = null;\n\n  const sink: AuditLedgerSink = {\n    write(entry) {\n      if (entries.length >= capacity) {\n        // (M23) About to overflow — notify the owner BEFORE the shift\n        // so the dropped seq is still known. The handler may push an\n        // entry of its own (a truncation marker), which will itself\n        // push us over capacity; we shift one for one until we're back\n        // at capacity (handlers must be O(1) writers — typically one).\n        const dropped = entries[0]!;\n        truncateHandler?.(dropped.seq, 1);\n        entries.shift();\n      }\n      entries.push(entry);\n      // If the handler wrote a marker (entries.length now > capacity),\n      // drop one more from the head to keep us at capacity exactly.\n      while (entries.length > capacity) {\n        entries.shift();\n      }\n    },\n    query(filter) {\n      const limit = filter.limit ?? DEFAULT_QUERY_LIMIT;\n      const out: AuditEntry[] = [];\n      for (let i = entries.length - 1; i >= 0; i--) {\n        const e = entries[i]!;\n        if (matchesFilter(e, filter)) {\n          out.push(e);\n          if (out.length >= limit) break;\n        }\n      }\n\n      return out;\n    },\n    recent(n) {\n      const start = Math.max(0, entries.length - n);\n\n      return entries.slice(start);\n    },\n    forFact(path, opts2 = {}) {\n      return this.query({ factPath: path, limit: opts2.limit });\n    },\n    forConstraint(id, opts2 = {}) {\n      return this.query({ constraintId: id, limit: opts2.limit });\n    },\n    toJSON() {\n      return { entries: entries.slice(), capturedAt: Date.now() };\n    },\n    clear() {\n      entries = [];\n    },\n    destroy() {\n      entries = [];\n      truncateHandler = null;\n    },\n    erase(filter, tombstoneFactory) {\n      let count = 0;\n      for (let i = 0; i < entries.length; i++) {\n        const e = entries[i]!;\n        if (matchesFilter(e, filter)) {\n          entries[i] = tombstoneFactory(e);\n          count++;\n        }\n      }\n\n      return count;\n    },\n    onTruncate(handler) {\n      truncateHandler = handler;\n    },\n  };\n\n  return sink;\n}\n","/**\n * Hash chain primitives — canonicalization, djb2 dispatch, depth-2\n * freeze, and the in-module tombstone sentinel.\n *\n * `LEDGER_INTERNAL_TOKEN` is the heart of the tombstone-forgery defense\n * (N7). It MUST live in this single file and MUST NOT be re-exported\n * from the folder's public surface (`./index.ts`). The only external\n * surface that touches it is `verify()` and the tombstone factory in\n * `index.ts`, both of which import it directly from this module.\n *\n * Hash chain: each entry stores `prevHash` — the djb2 (`hashObject`)\n * hash of the previous entry's stable-stringified payload. Tampering\n * with any entry's payload breaks the next entry's `prevHash` link —\n * visible in `verify()`. v1 ships sync djb2 only; `verify({ strong: true })`\n * is reserved for v2 (SHA-256) and throws today.\n */\n\nimport { hashObject } from \"../../utils/utils.js\";\nimport type { AuditEntry } from \"./types.js\";\n\n/**\n * Private sentinel stamped onto tombstone entries by {@link createAuditLedger.erase}.\n * Never exported from the folder's barrel, never serialized — `verify()`\n * checks for it before accepting a `system.entry-erased` entry as a\n * legitimate chain break.\n *\n * (N7) Without this, a caller holding a raw `AuditLedgerSink` reference\n * could write `{ kind: \"system.entry-erased\", … }` directly into the\n * sink to mask real tampering as legitimate erasure. The sentinel\n * raises the bar so only the in-process ledger plugin (which lives in\n * this folder's closure) can mint a valid tombstone.\n *\n * @internal — DO NOT re-export from `./index.ts` or `./types.ts`.\n */\nexport const LEDGER_INTERNAL_TOKEN: unique symbol = Symbol(\n  \"directive.audit-ledger.internal\",\n);\n\n/**\n * Depth-2 freeze: freeze the entry, freeze each top-level value, and\n * freeze each clause in `whenExplain`. Cycle-safe + cheap; prevents\n * in-process payload mutation that would forge the chain. (C3)\n */\nexport function freezeEntry(entry: AuditEntry): AuditEntry {\n  for (const key of Object.keys(entry)) {\n    const v = (entry as unknown as Record<string, unknown>)[key];\n    if (v !== null && typeof v === \"object\") {\n      if (Array.isArray(v) && key === \"whenExplain\") {\n        for (const clause of v) {\n          if (clause !== null && typeof clause === \"object\") {\n            Object.freeze(clause);\n          }\n        }\n      }\n      Object.freeze(v);\n    }\n  }\n  Object.freeze(entry);\n\n  return entry;\n}\n\n// ============================================================================\n// Hash chain — canonicalization\n// ============================================================================\n//\n// `syncHash(entry)` calls `hashObject(entry)` which calls\n// `stableStringify(entry)` — every entry shape (seq, ts, kind, prevHash,\n// hashAlgo, ...payload) is canonicalized via key-sorted JSON, then\n// djb2-hashed to a 32-bit hex string.\n//\n//   - Fast, sync, isomorphic Node/Bun/Deno/browser.\n//   - Tamper-DETECTION against accidental + light adversarial probing.\n//   - Collision-prone against a determined attacker, by design (32 bits).\n//\n// Any future change to the canonicalization or hash function breaks\n// existing exports, so each entry carries `hashAlgo: \"djb2-1\"`. Verifiers\n// must check that tag matches what they expect.\n//\n// `verify({ strong: true })` is reserved for v2 (SHA-256 chain via Web\n// Crypto). It throws today — there is no silent fallback. v1 ships sync\n// djb2 only.\n\nfunction syncHash(entry: AuditEntry): string {\n  // stableStringify guarantees same hash across runtimes regardless of\n  // key insertion order (architecture review #11, security review C1).\n  return hashObject(entry);\n}\n\n/**\n * Dispatch to the right hash function based on the entry's `hashAlgo`\n * discriminator. v1 has a single arm (`djb2-1`); the switch is in\n * place so v2 can add `\"sha256-1\"` without touching call sites. (N5)\n *\n * v2 promise: when SHA-256 lands, this becomes `case \"sha256-1\": return\n * await asyncSha256(entry);` — verify() will become async accordingly.\n */\nexport function hashForEntry(entry: AuditEntry): string {\n  switch (entry.hashAlgo) {\n    case \"djb2-1\":\n      return syncHash(entry);\n    default:\n      throw new Error(\n        `[Directive] audit-ledger: unknown hashAlgo \"${String((entry as { hashAlgo: unknown }).hashAlgo)}\" on entry seq=${entry.seq}. Cannot verify chain integrity. Known algorithms: \"djb2-1\".`,\n      );\n  }\n}\n","/**\n * PII operand redaction for cached predicate specs.\n *\n * Cached `whenSpec` operand pointers (e.g. `{ email: { $eq:\n * \"alice@x.com\" } }`) flow into every `constraint.evaluate` entry —\n * without scrubbing, the email would land in the audit trail in\n * plaintext on every evaluation. (C2)\n *\n * `redactWhenSpec` deep-clones the spec, walks it via `walkPredicate`,\n * and replaces operand values at PII-tagged fact paths with\n * `\"[redacted]\"`. Best-effort: if the spec contains anything\n * non-JSON-serialisable, we return the original (the caller has\n * already snapshotted the reference).\n */\n\nimport { walkPredicate } from \"../../core/predicate.js\";\n\n/**\n * Navigate `root` to `dottedPath` (`foo.bar.$eq`, `foo[0].value`) and\n * replace the value at the leaf. Used by `redactWhenSpec` to scrub\n * PII operands in cached predicate specs. Best-effort: silently no-ops\n * if the path doesn't resolve (caller already cloned the spec).\n */\nfunction replaceAtPath(\n  root: unknown,\n  dottedPath: string,\n  value: unknown,\n): void {\n  if (root === null || typeof root !== \"object\") return;\n  // Split on \".\" but treat \"[N]\" segments as array indices.\n  // E.g. \"[0].value\" → [\"[0]\", \"value\"], \"foo.bar[1]\" → [\"foo\", \"bar[1]\"].\n  const segs: Array<string | number> = [];\n  for (const part of dottedPath.split(\".\")) {\n    if (!part) continue;\n    // Pull leading `[N]` if present.\n    const m = part.match(/^\\[(\\d+)\\](.*)$/);\n    if (m) {\n      segs.push(Number(m[1]));\n      if (m[2]) segs.push(m[2].replace(/^\\./, \"\"));\n      continue;\n    }\n    // Trailing `[N]` on the segment.\n    const m2 = part.match(/^([^[]+)\\[(\\d+)\\](.*)$/);\n    if (m2) {\n      segs.push(m2[1]!);\n      segs.push(Number(m2[2]));\n      if (m2[3]) segs.push(m2[3].replace(/^\\./, \"\"));\n      continue;\n    }\n    segs.push(part);\n  }\n\n  let cur: unknown = root;\n  for (let i = 0; i < segs.length - 1; i++) {\n    const seg = segs[i]!;\n    if (cur === null || typeof cur !== \"object\") return;\n    cur = (cur as Record<string | number, unknown>)[seg];\n  }\n  if (cur === null || typeof cur !== \"object\") return;\n  const lastSeg = segs[segs.length - 1];\n  if (lastSeg === undefined) return;\n  (cur as Record<string | number, unknown>)[lastSeg] = value;\n}\n\n/**\n * Walk a predicate spec and replace operands at PII-tagged fact paths\n * with `\"[redacted]\"`. Returns the input as-is when redaction is\n * disabled (`capturePII: true`) or no PII tags are registered;\n * otherwise returns a deep clone with the leaf values rewritten. (C2)\n */\nexport function redactWhenSpec(\n  spec: unknown,\n  capturePII: boolean,\n  piiTaggedFacts: ReadonlySet<string>,\n): unknown {\n  if (capturePII || piiTaggedFacts.size === 0) return spec;\n  if (spec === null || typeof spec !== \"object\") return spec;\n\n  // Deep-clone so we don't mutate the user's source predicate. JSON\n  // round-trip handles plain objects + arrays cheaply; predicates are\n  // already JSON-safe (validatePredicate enforces this).\n  let cloned: unknown;\n  try {\n    cloned = JSON.parse(JSON.stringify(spec));\n  } catch {\n    // Spec contained something non-serializable; bail rather than crash.\n    return spec;\n  }\n\n  walkPredicate(cloned, {\n    operator(factPath, op, _operand, operandPath) {\n      if (!piiTaggedFacts.has(factPath)) return;\n      // Navigate cloned tree to operandPath and replace value.\n      replaceAtPath(cloned, operandPath, \"[redacted]\");\n      void op;\n    },\n    literal(factPath) {\n      if (!piiTaggedFacts.has(factPath)) return;\n      // Replace bare-value leaf at this factPath.\n      replaceAtPath(cloned, factPath, \"[redacted]\");\n    },\n  });\n\n  return cloned;\n}\n","/**\n * Audit-ledger type definitions — entry shapes, sink interface, query\n * filter, verify result, and plugin options. Pure types + the two\n * schema-version constants (`HASH_ALGO`, `SCHEMA_VERSION`) that are\n * referenced by the entry shape.\n *\n * Kept free of runtime imports so the hash/freeze/sink modules can pull\n * types from here without a cycle.\n */\n\nimport type { ModuleSchema, Plugin } from \"../../core/types.js\";\nimport type {\n  ClauseResult,\n  FactPredicate,\n} from \"../../core/types/predicate.js\";\n\n// ============================================================================\n// Version stamps\n// ============================================================================\n\n/** Hash algorithm tag — bumped if canonicalization or hash function changes. */\nexport const HASH_ALGO = \"djb2-1\" as const;\n\n/**\n * Entry schema version. Bumped if `AuditEntry` field shape changes in\n * a way that breaks back-compat parsers. Persisted on every entry so\n * exports remain self-describing across library upgrades. (F-5)\n */\nexport const SCHEMA_VERSION = 1 as const;\n\n// ============================================================================\n// AuditEntry types\n// ============================================================================\n\nexport type AuditEntryKind =\n  | \"constraint.evaluate\"\n  | \"resolver.write.rejected\"\n  | \"fact.change\"\n  | \"resolver.complete\"\n  | \"resolver.error\"\n  | \"source.attach\"\n  | \"source.detach\"\n  | \"source.error\"\n  | \"system.init\"\n  | \"system.start\"\n  | \"system.stop\"\n  | \"system.destroy\"\n  | \"system.snapshot\"\n  | \"system.history.navigate\"\n  | \"system.truncated\"\n  | \"system.entry-erased\"\n  | \"system.subject-erased\";\n\n/**\n * Internal sentinel symbol type. The actual symbol VALUE lives in\n * `hash.ts` and is never exported from this folder's public surface —\n * but the TYPE must be referenceable here so `AuditEntryBase` can\n * declare the optional `__internal` field.\n *\n * We use `symbol` rather than `typeof LEDGER_INTERNAL_TOKEN` because\n * importing the symbol value into types.ts would either re-export it\n * (defeating the defense) or create a circular import. The runtime\n * check in `verify()` compares against the actual symbol reference.\n */\ntype LedgerInternalSentinel = symbol;\n\ninterface AuditEntryBase {\n  /** Monotonic sequence number, starting at 0. */\n  readonly seq: number;\n  /** Wall-clock timestamp (ms epoch). */\n  readonly ts: number;\n  /** Discriminator. */\n  readonly kind: AuditEntryKind;\n  /** Hash of the previous entry's full payload. null on the genesis entry. */\n  readonly prevHash: string | null;\n  /**\n   * Hash algorithm tag identifying the canonicalization + hash\n   * function in use. Bumped if the algorithm or canonical form\n   * changes, so exports remain verifiable across versions.\n   */\n  readonly hashAlgo: typeof HASH_ALGO;\n  /**\n   * Entry schema version — bumped if any `AuditEntry` field shape\n   * changes in a way that breaks back-compat. Pair with `hashAlgo`\n   * when migrating older exports. (F-5)\n   */\n  readonly schemaVersion: typeof SCHEMA_VERSION;\n  /**\n   * Private sentinel — present (and equal to the in-module token) only\n   * on legitimate tombstones minted by `ledger.erase()`. Filtered out\n   * of all public read paths (`query`, `recent`, `toJSON`, etc.) so\n   * consumers never see or copy it. (N7)\n   *\n   * NOT serialized. NOT exported. Forging this from outside the module\n   * is impossible without the symbol reference; `verify()` rejects any\n   * `system.entry-erased` entry that lacks it.\n   *\n   * @internal\n   */\n  readonly __internal?: LedgerInternalSentinel;\n}\n\nexport type AuditEntry =\n  | (AuditEntryBase & {\n      kind: \"constraint.evaluate\";\n      constraintId: string;\n      active: boolean;\n      /** Cached at ledger start from `system.inspect().constraints[].whenSpec`. Refreshed on `register()`/`assign()`/`unregister()`. May be undefined for function-form constraints (see `whenSource`). PII operands redacted unless `capturePII: true`. */\n      whenSpec?: FactPredicate<unknown>;\n      whenExplain?: readonly ClauseResult[];\n      /**\n       * For function-form constraints (no `whenSpec`), a tamper-evident\n       * identity for the function. We DO NOT capture the raw source —\n       * closures routinely reference secrets, API keys, or PII (e.g.\n       * `if (apiKey === \"sk-live-xxx\")`) and a preview would leak them\n       * into the audit log. Instead, we capture a djb2 hash of the\n       * stringified function (`hashObject(String(fn))`). Auditors can\n       * detect \"the function changed between deploys\" by comparing\n       * hashes across entries, without ever seeing the function body.\n       *\n       * Informational only — NOT replayable. (N5, M22)\n       */\n      whenSource?: { kind: \"function\"; sourceHash: string };\n    })\n  | (AuditEntryBase & {\n      kind: \"resolver.write.rejected\";\n      rejection: \"rejection\" | \"summary\";\n      resolverId: string;\n      requirementId: string;\n      reason: string;\n      fact?: string;\n      expected?: unknown;\n      actual?: unknown;\n      dropped?: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"fact.change\";\n      key: string;\n      prior: unknown;\n      next: unknown;\n    })\n  | (AuditEntryBase & {\n      kind: \"resolver.complete\";\n      resolverId: string;\n      requirementId: string;\n      duration: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"resolver.error\";\n      resolverId: string;\n      requirementId: string;\n      error: string;\n    })\n  | (AuditEntryBase & {\n      kind: \"source.attach\" | \"source.detach\";\n      sourceId: string;\n      moduleId: string;\n    })\n  | (AuditEntryBase & {\n      kind: \"source.error\";\n      sourceId: string;\n      moduleId: string;\n      /**\n       * `phase: \"runtime\"` (RFC 0008) flags errors the source reported\n       * mid-flight via the `reportError` callback `attach` receives as\n       * its second argument — distinct from lifecycle `\"attach\"` /\n       * `\"cleanup\"` failures.\n       */\n      phase: \"attach\" | \"cleanup\" | \"runtime\";\n      /**\n       * Truncated error message — capped at a fixed length by the source\n       * manager before it reaches the ledger. Source authors who embed\n       * payloads in error messages get a bounded leak surface rather than\n       * an unbounded one. Pair with the matching `source.attach` /\n       * `source.detach` entries for full lifecycle context.\n       */\n      error: string;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.init\" | \"system.start\" | \"system.stop\" | \"system.destroy\";\n    })\n  | (AuditEntryBase & {\n      kind: \"system.snapshot\";\n      snapshotId: number;\n      trigger: string;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.history.navigate\";\n      from: number;\n      to: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.truncated\";\n      droppedSeq: number;\n      droppedCount: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.entry-erased\";\n      originalKind: AuditEntryKind;\n      erasedAt: number;\n    })\n  | (AuditEntryBase & {\n      kind: \"system.subject-erased\";\n      /**\n       * djb2 hash of the filter (via `hashObject(filter)`). PII-safe —\n       * the raw filter values never land in the ledger. Pair with\n       * `filterShape` to see which filter fields were used. (N2)\n       */\n      filterHash: string;\n      /**\n       * Stripped-values shape of the filter — captures WHICH fields were\n       * present without recording their values. (N2)\n       */\n      filterShape: {\n        factPath: boolean;\n        constraintId: boolean;\n        kind: AuditEntryKind | readonly AuditEntryKind[] | undefined;\n        changedBetween: \"[range]\" | undefined;\n      };\n      erased: number;\n    });\n\n// ============================================================================\n// Sink interface\n// ============================================================================\n\nexport interface QueryFilter {\n  /** Exact-match fact path. */\n  factPath?: string;\n  /** Filter by constraint id. */\n  constraintId?: string;\n  /** Filter by entry kind. */\n  kind?: AuditEntryKind | readonly AuditEntryKind[];\n  /** Time range as `[startMs, endMs]`, ISO strings, or epoch numbers. */\n  changedBetween?: [string | number | Date, string | number | Date];\n  /** Maximum entries returned. Default 1000. */\n  limit?: number;\n}\n\n/**\n * Verify result — chain valid OR a break with full context for tamper visualization.\n *\n * Erased entries (via `ledger.erase()`) appear as legitimate chain breaks —\n * `verify()` reports them in `erasedSeqs` and continues the walk from the\n * tombstone's own hash. Real tamper still surfaces as `valid: false`.\n *\n * Forged tombstones (a caller writes `kind: \"system.entry-erased\"`\n * directly via `sink.write()` to mask tamper as erasure) are detected:\n * legitimate tombstones carry an in-module sentinel that forgeries\n * cannot mint, so `verify()` reports them as tamper. (N7)\n */\nexport type VerifyResult =\n  | {\n      valid: true;\n      entryCount: number;\n      /**\n       * Seq numbers of entries legitimately broken by `erase()`\n       * tombstones. NOT timestamps — each entry pairs this seq with\n       * the per-entry `system.entry-erased.erasedAt` (ms epoch) for\n       * the timestamp. Empty unless the chain contains erasures.\n       * (N1 + M1; renamed from `erasedAt` in R3)\n       */\n      erasedSeqs?: number[];\n    }\n  | {\n      valid: false;\n      brokenAt: number;\n      expectedHash: string;\n      actualHash: string;\n      entry: AuditEntry;\n      /**\n       * Human-readable reason for the break — populated for cases\n       * where the cause is more specific than \"hash mismatch\" (e.g.\n       * tombstone forgery detected via missing sentinel).\n       */\n      reason?: string;\n    };\n\nexport interface AuditLedgerSink {\n  write(entry: AuditEntry): void;\n  query(filter: QueryFilter): readonly AuditEntry[];\n  recent(n: number): readonly AuditEntry[];\n  forFact(path: string, opts?: { limit?: number }): readonly AuditEntry[];\n  forConstraint(id: string, opts?: { limit?: number }): readonly AuditEntry[];\n  toJSON(): { entries: readonly AuditEntry[]; capturedAt: number };\n  clear(): void;\n  destroy(): void;\n  /**\n   * Replace matching entries with marker entries IN PLACE (preserving seq +\n   * prevHash so the hash chain still verifies — the marker is a\n   * tombstone in chain terms; the chain break is what makes erasure\n   * visible to `verify()`). v1 implementation matches on the same\n   * `QueryFilter` shape used by `query()`. Returns the count of entries\n   * replaced.\n   *\n   * WARNING: erases only from this sink. Any external copies (toJSON\n   * exports, downstream pipelines) must be erased separately.\n   */\n  erase?(\n    filter: QueryFilter,\n    markerEntryFactory: (e: AuditEntry) => AuditEntry,\n  ): number;\n  /**\n   * Optional hook fired by the sink BEFORE shifting the oldest entry\n   * out of a bounded ring buffer. The ledger plugin uses this to emit\n   * a `system.truncated` marker so an auditor sees that the log was\n   * truncated and where. (M23)\n   */\n  onTruncate?(\n    handler: (droppedSeq: number, droppedCount: number) => void,\n  ): void;\n}\n\n// ============================================================================\n// Plugin options + public API surface\n// ============================================================================\n\nexport interface AuditLedgerOptions {\n  /** Sink to write entries to. Default: in-memory ring buffer (capacity 10k). */\n  sink?: AuditLedgerSink;\n  /**\n   * Whether to capture raw fact values (`prior`/`next` on fact.change,\n   * `actual` in whenExplain). Default `false` — PII-tagged facts are\n   * redacted by default. Set `true` to opt out of redaction.\n   */\n  capturePII?: boolean;\n  /**\n   * Optional caller-supplied redactor. Runs AFTER the default\n   * pii-tag-based redaction. Useful for additional sanitization.\n   */\n  redact?: (entry: AuditEntry) => AuditEntry;\n}\n\nexport interface AuditLedger {\n  /** The plugin to pass to `createSystem({ plugins: [...] })`. */\n  readonly plugin: Plugin<ModuleSchema>;\n  /** Query entries matching the filter. */\n  query(filter?: QueryFilter): readonly AuditEntry[];\n  /** Most recent N entries (chronological). */\n  recent(n: number): readonly AuditEntry[];\n  /** All entries that touch this fact path (exact match). */\n  forFact(path: string, opts?: { limit?: number }): readonly AuditEntry[];\n  /** All entries for this constraint id. */\n  forConstraint(id: string, opts?: { limit?: number }): readonly AuditEntry[];\n  /** Full ledger snapshot for export / serialization. */\n  toJSON(): { entries: readonly AuditEntry[]; capturedAt: number };\n  /**\n   * Walk the hash chain genesis → tip. Returns `{ valid: true }` iff\n   * every entry's `prevHash` matches the (sync, djb2-based) hash of\n   * the previous entry. On break, returns the index of the first\n   * broken link plus the expected vs actual hashes — feed into a\n   * \"TAMPERED\" visualization.\n   *\n   * Erased entries (via `ledger.erase()`) appear as legitimate chain\n   * breaks — `verify()` reports them in `erasedSeqs` and continues\n   * the walk from the tombstone's actual hash. Real tamper still\n   * surfaces as `valid: false`. (N1 + M1)\n   *\n   * Forged tombstones — `kind: \"system.entry-erased\"` entries written\n   * directly via `sink.write()` to mask tamper — are detected as\n   * forgery. Legitimate tombstones carry an in-module sentinel that\n   * forgeries cannot mint. (N7)\n   *\n   * v1 ships sync djb2 only. `verify({ strong: true })` is reserved\n   * for v2 (SHA-256) and THROWS today — there is no silent fallback.\n   * Call `verify()` (no args) for tamper detection.\n   */\n  verify(opts?: { strong?: boolean }): VerifyResult;\n  /**\n   * Per-subject erasure (GDPR Art. 17 stub). Replaces matching entries\n   * in this sink with `system.entry-erased` tombstones (preserving\n   * seq + prevHash so verify() can resync), then appends a chained\n   * `system.subject-erased` marker entry that summarises the erasure.\n   *\n   * Returns `{ erased, markerEntry }` — `markerEntry` is the chained\n   * `system.subject-erased` summary (the N per-entry tombstones live\n   * in the sink, not on the return value). (M7)\n   *\n   * When `erased === 0` (filter matched nothing), `markerEntry` is\n   * `null` and no marker is emitted into the chain — avoids polluting\n   * the audit trail with empty \"erased: 0\" records. (MAJOR-3)\n   *\n   * WARNING: v1 erases only from THIS sink. External copies (toJSON\n   * exports, downstream pipelines, persisted backups) must be erased\n   * separately. (C8)\n   */\n  erase(filter: QueryFilter): {\n    erased: number;\n    markerEntry: AuditEntry | null;\n  };\n  /** Empty the sink. */\n  clear(): void;\n  /** Unsubscribe + drop the sink. */\n  destroy(): void;\n}\n","/**\n * `verify()` — walk the hash chain genesis → tip, surfacing the first\n * broken link (or accepting it as a legitimate erasure tombstone).\n *\n * Erased entries appear as legitimate breaks — their payload changed\n * so the NEXT entry's `prevHash` no longer matches. `verify()`\n * recognises a `system.entry-erased` entry bearing the in-module\n * sentinel and resyncs the walk from the tombstone's own hash.\n *\n * Forged tombstones — `kind: \"system.entry-erased\"` written directly\n * via `sink.write()` to mask real tamper — lack the sentinel and are\n * reported as `valid: false` with a `reason` describing the forgery. (N7)\n */\n\nimport { LEDGER_INTERNAL_TOKEN, hashForEntry } from \"./hash.js\";\nimport type { AuditEntry, AuditLedgerSink, VerifyResult } from \"./types.js\";\n\nexport function verify(\n  sink: AuditLedgerSink,\n  opts?: { strong?: boolean },\n): VerifyResult {\n  // (C1) v1 ships sync djb2 only. Strong (SHA-256) verify is\n  // reserved for v2 and must NOT silently no-op — the previous\n  // implementation returned `{ valid: true }` regardless of the\n  // chain's actual state, which lied to callers.\n  if (opts?.strong === true) {\n    throw new Error(\n      \"[Directive] verify({ strong: true }) is reserved for v2 — v1 ships sync djb2 chain only. Use verify() (sync) for tamper detection.\",\n    );\n  }\n\n  const { entries } = sink.toJSON();\n  if (entries.length === 0) {\n    return { valid: true, entryCount: 0 };\n  }\n\n  // Sync walk — catches anything the djb2 chain would see.\n  // (N1 + M1) Erased-entry tombstones (kind: \"system.entry-erased\")\n  // legitimately break the chain — the tombstone's payload differs\n  // from the original entry it replaced, so the NEXT entry's\n  // prevHash no longer matches. When we detect a break whose\n  // PREVIOUS entry is a tombstone (or the broken entry itself is\n  // one), record the seq and resync the walk from the tombstone's\n  // own hash.\n  //\n  // (N7) Only tombstones bearing the internal sentinel are\n  // recognised. A forged tombstone — `kind: \"system.entry-erased\"`\n  // written directly via `sink.write()` to mask real tamper —\n  // lacks the in-module symbol and is reported as tamper.\n  //\n  // Use a Set to dedupe — adjacent tombstones can otherwise be\n  // recorded twice (once when the tombstone itself is the broken\n  // entry, once when the next iteration sees its predecessor was\n  // also a tombstone).\n  const erasedSeqsSet = new Set<number>();\n  let prevHash: string | null = null;\n  for (let i = 0; i < entries.length; i++) {\n    const entry = entries[i]!;\n    if (entry.prevHash !== prevHash) {\n      // Legitimate break? Either:\n      //   (a) the entry itself is the tombstone, or\n      //   (b) the previous entry was the tombstone whose payload\n      //       was rewritten by erase().\n      const prevEntry = i > 0 ? entries[i - 1]! : null;\n      const entryIsTombstone = entry.kind === \"system.entry-erased\";\n      const prevIsTombstone = prevEntry?.kind === \"system.entry-erased\";\n\n      if (entryIsTombstone || prevIsTombstone) {\n        // (N7) Verify the SENTINEL on whichever entry(ies) claim\n        // tombstone status. Missing sentinel ⇒ forgery ⇒ tamper.\n        const candidates: AuditEntry[] = [];\n        if (entryIsTombstone) candidates.push(entry);\n        if (prevIsTombstone && prevEntry !== null) {\n          candidates.push(prevEntry);\n        }\n        const forged = candidates.find(\n          (e) =>\n            (e as AuditEntry & { __internal?: unknown }).__internal !==\n            LEDGER_INTERNAL_TOKEN,\n        );\n        if (forged) {\n          return {\n            valid: false,\n            brokenAt: i,\n            expectedHash: prevHash ?? \"<genesis>\",\n            actualHash: entry.prevHash ?? \"<genesis>\",\n            entry: forged,\n            reason:\n              \"tombstone forgery detected — missing internal sentinel. A 'system.entry-erased' entry was written via sink.write() rather than ledger.erase(); rejected as tamper.\",\n          };\n        }\n        // Legitimate erasure — record the tombstone's seq and\n        // resync the walk by hashing this entry as our new pointer\n        // for the next iteration.\n        const tombstoneEntry = entryIsTombstone ? entry : prevEntry!;\n        erasedSeqsSet.add(tombstoneEntry.seq);\n        prevHash = hashForEntry(entry);\n\n        continue;\n      }\n\n      return {\n        valid: false,\n        brokenAt: i,\n        expectedHash: prevHash ?? \"<genesis>\",\n        actualHash: entry.prevHash ?? \"<genesis>\",\n        entry,\n      };\n    }\n    prevHash = hashForEntry(entry);\n  }\n\n  const result: {\n    valid: true;\n    entryCount: number;\n    erasedSeqs?: number[];\n  } = {\n    valid: true,\n    entryCount: entries.length,\n  };\n  if (erasedSeqsSet.size > 0) {\n    result.erasedSeqs = [...erasedSeqsSet].sort((a, b) => a - b);\n  }\n\n  return result;\n}\n","/**\n * createAuditLedger — append-only, queryable, hash-chained\n * (djb2; SHA-256 reserved for v2) audit of every state change. For\n * forensics and \"show me why this user got that decision.\"\n *\n * Captures (per observation event):\n *\n *   - `constraint.evaluate` → { whenSpec, whenExplain, active, whenSource? }\n *   - `resolver.write.rejected` (rejection + summary kinds)\n *   - `fact.change` → { key, prior, next }\n *   - `resolver.complete` → { resolverId, requirementId, duration }\n *   - `system.init` / `system.start` / `system.stop` / `system.destroy`\n *   - `system.snapshot` / `system.history.navigate` (lifecycle markers)\n *   - `system.truncated` (ring-buffer overflow marker)\n *   - `system.entry-erased` / `system.subject-erased` (GDPR Art.17 stub)\n *\n * PII redaction: by default, fact keys whose meta carries the `pii`\n * tag (via `system.meta.byTag(\"pii\")`) have their values replaced with\n * `\"[redacted]\"` in `whenExplain.actual`, `fact.change.prior`,\n * `fact.change.next`, and the cached `whenSpec` operands. Opt out with\n * `capturePII: true`.\n *\n * Folder layout:\n *   types.ts            — public type surface + version stamps\n *   hash.ts             — djb2 dispatch + freeze helper + INTERNAL TOKEN\n *   sink.ts             — memorySink() ring buffer\n *   predicate-redact.ts — PII-aware redactWhenSpec\n *   verify.ts           — tombstone-aware chain walk\n *   index.ts (this)     — createAuditLedger factory + plugin wiring\n */\n\nimport type {\n  ModuleSchema,\n  ObservationEvent,\n  Plugin,\n  System,\n} from \"../../core/types.js\";\nimport type {\n  ClauseResult,\n  FactPredicate,\n} from \"../../core/types/predicate.js\";\nimport { hashObject } from \"../../utils/utils.js\";\nimport { LEDGER_INTERNAL_TOKEN, freezeEntry, hashForEntry } from \"./hash.js\";\nimport { redactWhenSpec } from \"./predicate-redact.js\";\nimport { memorySink } from \"./sink.js\";\nimport type {\n  AuditEntry,\n  AuditLedger,\n  AuditLedgerOptions,\n  VerifyResult,\n} from \"./types.js\";\nimport { HASH_ALGO, SCHEMA_VERSION } from \"./types.js\";\nimport { verify as verifyChain } from \"./verify.js\";\n\n// Re-export the public surface. `LEDGER_INTERNAL_TOKEN` is intentionally\n// NOT included — the tombstone-forgery defense depends on its\n// unguessability from outside this folder. (N7)\nexport { memorySink } from \"./sink.js\";\nexport type {\n  AuditEntry,\n  AuditEntryKind,\n  AuditLedger,\n  AuditLedgerOptions,\n  AuditLedgerSink,\n  QueryFilter,\n  VerifyResult,\n} from \"./types.js\";\n\n/**\n * Create an audit ledger that subscribes to the given system's\n * observation stream. Returns a `Plugin` to install + a query/verify\n * API for the ledger.\n *\n * @example\n * ```ts\n * import { createAuditLedger } from \"@directive-run/core/plugins\";\n *\n * const ledger = createAuditLedger();\n * const system = createSystem({ module, plugins: [ledger.plugin] });\n * system.start();\n *\n * // Six months later — auditor asks \"what changed cart-total in March?\"\n * ledger.query({\n *   factPath: \"cartTotal\",\n *   changedBetween: [\"2026-03-01\", \"2026-04-01\"],\n * });\n *\n * // Verify nobody tampered with the ledger\n * const verdict = await ledger.verify();\n * if (!verdict.valid) {\n *   console.error(\"Tamper at entry\", verdict.brokenAt);\n * }\n * ```\n */\nexport function createAuditLedger(opts: AuditLedgerOptions = {}): AuditLedger {\n  const sink = opts.sink ?? memorySink();\n  const capturePII = opts.capturePII ?? false;\n  const userRedact = opts.redact;\n\n  let seq = 0;\n  let lastHashCache: string | null = null; // Cache hash of last-written entry payload\n\n  let system: System<ModuleSchema> | null = null;\n  let unobserve: (() => void) | null = null;\n\n  /**\n   * Cache of constraint.id → whenSpec (snapshotted at start, refreshed\n   * on register/assign/unregister). Spec is already PII-redacted at\n   * cache time, so the operand pointer that flows into every\n   * `constraint.evaluate` entry can never leak. (C2)\n   */\n  const whenSpecCache = new Map<string, FactPredicate<unknown>>();\n\n  /**\n   * Cache of constraint.id → sourceHash for function-form constraints.\n   * (N5, M22)\n   *\n   * We hash the stringified function rather than store any preview of\n   * its source. Closures frequently reference secrets in scope\n   * (`apiKey`, `dbPassword`, customer PII pulled from outer state) and\n   * a preview would land those in the audit trail in plaintext. The\n   * hash is a tamper-evident identity — auditors can verify \"this\n   * constraint's source has not changed across these entries\" without\n   * ever seeing the source itself.\n   */\n  const whenSourceCache = new Map<string, string>();\n\n  /** Cache of PII-tagged fact paths. */\n  const piiTaggedFacts = new Set<string>();\n\n  function refreshWhenSpecCache(): void {\n    whenSpecCache.clear();\n    whenSourceCache.clear();\n    if (!system) return;\n    try {\n      const inspect = (\n        system as {\n          inspect?: () => {\n            constraints?: Array<{\n              id: string;\n              whenSpec?: unknown;\n              when?: unknown;\n            }>;\n          };\n        }\n      ).inspect;\n      if (typeof inspect !== \"function\") return;\n      const inspection = inspect();\n      const constraints = inspection?.constraints ?? [];\n      // Best-effort access to merged constraint defs for function-form\n      // source capture. Not exposed via the public type; we feature-detect.\n      const mergedDefs = (\n        system as {\n          $internal?: {\n            mergedConstraints?: Record<string, { when?: unknown }>;\n          };\n        }\n      ).$internal?.mergedConstraints;\n      for (const c of constraints) {\n        if (c.whenSpec !== undefined) {\n          // Redact PII operands at cache time so the cached pointer\n          // flowing into evaluate entries is already safe. (C2)\n          whenSpecCache.set(\n            c.id,\n            redactWhenSpec(\n              c.whenSpec,\n              capturePII,\n              piiTaggedFacts,\n            ) as FactPredicate<unknown>,\n          );\n        } else {\n          // No whenSpec means function-form `when:` (or no when at\n          // all). Capture a HASH of the function source rather than\n          // the source itself — closures may reference secrets in\n          // scope, and any preview would leak them into the audit\n          // trail. (N5, M22)\n          const def = mergedDefs?.[c.id];\n          const whenFn =\n            def && typeof def.when === \"function\" ? def.when : undefined;\n          if (whenFn) {\n            whenSourceCache.set(c.id, hashObject(String(whenFn)));\n          } else if (c.when !== undefined && typeof c.when === \"function\") {\n            whenSourceCache.set(c.id, hashObject(String(c.when)));\n          } else {\n            // Function-form constraint we couldn't reach the source\n            // of. Mark it so audit entries still surface the form.\n            // We hash the marker string for consistency with the\n            // sourceHash field shape.\n            whenSourceCache.set(c.id, hashObject(\"[function]\"));\n          }\n        }\n      }\n    } catch {\n      // System not yet ready — skip silently.\n    }\n  }\n\n  function refreshPIITags(): void {\n    piiTaggedFacts.clear();\n    if (capturePII || !system) return;\n    try {\n      const meta = (\n        system as { meta?: { byTag?: (tag: string) => Array<{ id: string }> } }\n      ).meta;\n      if (!meta || typeof meta.byTag !== \"function\") return;\n      const tagged = meta.byTag(\"pii\") ?? [];\n      for (const m of tagged) {\n        piiTaggedFacts.add(m.id);\n      }\n    } catch {\n      // No meta accessor — skip.\n    }\n  }\n\n  function redactValue(factPath: string, value: unknown): unknown {\n    if (capturePII) return value;\n    if (piiTaggedFacts.has(factPath)) return \"[redacted]\";\n\n    return value;\n  }\n\n  function redactClauses(\n    clauses: ClauseResult[] | undefined,\n  ): ClauseResult[] | undefined {\n    if (!clauses) return clauses;\n    if (capturePII || piiTaggedFacts.size === 0) return clauses;\n    let mutated = false;\n    const out: ClauseResult[] = clauses.map((c) => {\n      if (piiTaggedFacts.has(c.path)) {\n        mutated = true;\n        return { ...c, actual: \"[redacted]\" };\n      }\n      // Recurse into combinator children.\n      if (c.children) {\n        const inner = redactClauses(c.children);\n        if (inner !== c.children) {\n          mutated = true;\n          return { ...c, children: inner };\n        }\n      }\n\n      return c;\n    });\n\n    return mutated ? out : clauses;\n  }\n\n  /**\n   * `partial` is the entry-specific payload (no seq/ts/prevHash). It's\n   * typed as `Record<string, unknown>` because TS's distributed Omit\n   * over the AuditEntry discriminated union doesn't compose cleanly;\n   * runtime construction is safe because each call site passes a\n   * known-shape literal.\n   *\n   * Entries are deeply-frozen at write time (depth 2 — top-level\n   * values + whenExplain clauses) so that downstream consumers cannot\n   * mutate payloads in place and forge the chain. (C3)\n   */\n  function emit(partial: Record<string, unknown>): AuditEntry {\n    const entry = {\n      ...partial,\n      seq: seq++,\n      ts: Date.now(),\n      prevHash: lastHashCache,\n      hashAlgo: HASH_ALGO,\n      schemaVersion: SCHEMA_VERSION,\n    } as AuditEntry;\n\n    const finalEntry = userRedact ? userRedact(entry) : entry;\n    freezeEntry(finalEntry);\n    sink.write(finalEntry);\n\n    // Sync hash of this entry — stashed as the next entry's prevHash.\n    // Whole entry is hashed (including its own prevHash field) so\n    // verify() can rebuild the chain deterministically.\n    lastHashCache = hashForEntry(finalEntry);\n\n    return finalEntry;\n  }\n\n  function onEvent(event: ObservationEvent): void {\n    switch (event.type) {\n      case \"constraint.evaluate\": {\n        const whenSpec = whenSpecCache.get(event.id);\n        const whenSourceHash = whenSourceCache.get(event.id);\n        const partial: Record<string, unknown> = {\n          kind: \"constraint.evaluate\",\n          constraintId: event.id,\n          active: event.active,\n          whenExplain: redactClauses(event.whenExplain),\n        };\n        if (whenSpec !== undefined) {\n          partial.whenSpec = whenSpec;\n        } else if (whenSourceHash !== undefined) {\n          // Function-form constraint — sourceHash is informational and\n          // NOT replayable. We deliberately do NOT include any source\n          // preview because closures may reference secrets in scope. (N5, M22)\n          partial.whenSource = {\n            kind: \"function\",\n            sourceHash: whenSourceHash,\n          };\n        }\n        emit(partial);\n        break;\n      }\n      case \"fact.change\":\n        emit({\n          kind: \"fact.change\",\n          key: event.key,\n          prior: redactValue(event.key, event.prev),\n          next: redactValue(event.key, event.next),\n        });\n        break;\n      case \"resolver.write.rejected\":\n        if (event.kind === \"summary\") {\n          emit({\n            kind: \"resolver.write.rejected\",\n            rejection: \"summary\",\n            resolverId: event.resolver,\n            requirementId: event.requirementId,\n            reason: event.reason,\n            dropped: event.dropped,\n          });\n        } else {\n          emit({\n            kind: \"resolver.write.rejected\",\n            rejection: \"rejection\",\n            resolverId: event.resolver,\n            requirementId: event.requirementId,\n            reason: event.reason,\n            fact: event.fact,\n            expected: redactValue(event.fact, event.expected),\n            actual: redactValue(event.fact, event.actual),\n          });\n        }\n        break;\n      case \"resolver.complete\":\n        emit({\n          kind: \"resolver.complete\",\n          resolverId: event.resolver,\n          requirementId: event.requirementId,\n          duration: event.duration,\n        });\n        break;\n      case \"resolver.error\":\n        emit({\n          kind: \"resolver.error\",\n          resolverId: event.resolver,\n          requirementId: event.requirementId,\n          error: String(event.error),\n        });\n        break;\n      case \"system.init\":\n      case \"system.start\":\n      case \"system.stop\":\n      case \"system.destroy\":\n        emit({ kind: event.type });\n        break;\n      case \"source.attach\":\n      case \"source.detach\":\n        // Source attach/detach captures the privilege-change posture:\n        // a runtime-registered source is a new ingestion endpoint, an\n        // attach/detach pair bounds the period during which fact mutations\n        // could have originated from this source. `source.publish` is\n        // DELIBERATELY NOT captured — high-volume sources would blow up\n        // the ledger; the resulting fact.change entries already encode the\n        // outcome and remain queryable.\n        emit({\n          kind: event.type,\n          sourceId: event.id,\n          moduleId: event.moduleId,\n        });\n        break;\n      case \"source.error\":\n        emit({\n          kind: \"source.error\",\n          sourceId: event.id,\n          moduleId: event.moduleId,\n          phase: event.phase,\n          error:\n            event.error instanceof Error\n              ? event.error.message\n              : String(event.error),\n        });\n        break;\n      default:\n        // Other observation events ignored in v1 (derivation.compute,\n        // requirement.created/met/canceled, effect.run/error,\n        // reconcile.start/end, source.publish). They're available via\n        // .observe() directly if a consumer wants them.\n        break;\n    }\n  }\n\n  /**\n   * Re-entrance guard for the truncation handler. The marker entry is\n   * itself a write that may trigger another shift; without this we'd\n   * recurse and overflow. (M23)\n   */\n  let emittingTruncate = false;\n\n  function attach(sys: System<ModuleSchema>): void {\n    system = sys;\n    refreshPIITags();\n    refreshWhenSpecCache();\n    unobserve = sys.observe(onEvent);\n    // Wire up the truncation marker — fires BEFORE the sink drops the\n    // oldest entry, so the dropped seq is still known. The guard\n    // prevents the marker's own write from recursing back through the\n    // capacity overflow path. (M23)\n    sink.onTruncate?.((droppedSeq, droppedCount) => {\n      if (emittingTruncate) return;\n      emittingTruncate = true;\n      try {\n        emit({\n          kind: \"system.truncated\",\n          droppedSeq,\n          droppedCount,\n        });\n      } finally {\n        emittingTruncate = false;\n      }\n    });\n  }\n\n  function detach(): void {\n    if (unobserve) {\n      unobserve();\n      unobserve = null;\n    }\n    system = null;\n    whenSpecCache.clear();\n    whenSourceCache.clear();\n    piiTaggedFacts.clear();\n  }\n\n  const plugin: Plugin<ModuleSchema> = {\n    name: \"audit-ledger\",\n    onInit(sys) {\n      attach(sys as System<ModuleSchema>);\n    },\n    onStop() {\n      // Keep the sink populated so query() works after stop, but\n      // drop the subscription to avoid leaks.\n      if (unobserve) {\n        unobserve();\n        unobserve = null;\n      }\n    },\n    onDestroy() {\n      detach();\n    },\n    onDefinitionRegister(type, id) {\n      if (type === \"constraint\") refreshWhenSpecCache();\n      if (type === \"constraint\" || type === \"resolver\" || type === \"effect\") {\n        // Re-pull PII tags too — a dynamically-registered fact (rare)\n        // could have brought new meta.\n        refreshPIITags();\n      }\n      void id;\n    },\n    onDefinitionAssign(type, id) {\n      // (C4) Constraint assigned a new spec — refresh the cache so the\n      // NEXT evaluate emits the new whenSpec, not the stale one.\n      if (type === \"constraint\") refreshWhenSpecCache();\n      void id;\n    },\n    onDefinitionUnregister(type, id) {\n      if (type === \"constraint\") refreshWhenSpecCache();\n      void id;\n    },\n    onSnapshot(snapshot) {\n      // (M9) Capture history snapshot as a lifecycle marker. Snapshot\n      // contents (facts) are NOT included to keep the entry small and\n      // avoid duplicating PII through a different channel.\n      emit({\n        kind: \"system.snapshot\",\n        snapshotId: snapshot.id,\n        trigger: snapshot.trigger,\n      });\n    },\n    onHistoryNavigate(from, to) {\n      // (M9) Capture time-travel navigation as a lifecycle marker.\n      emit({\n        kind: \"system.history.navigate\",\n        from,\n        to,\n      });\n    },\n  };\n\n  /**\n   * Strip the internal sentinel from an entry before it reaches a\n   * public read path. Returns a shallow clone with `__internal`\n   * removed — keeps the (frozen) live entry intact for verify() while\n   * making sure consumers never see the symbol. (N7)\n   */\n  function stripInternal(entry: AuditEntry): AuditEntry {\n    if (\n      (entry as AuditEntry & { __internal?: unknown }).__internal === undefined\n    ) {\n      return entry;\n    }\n    const clone = { ...entry } as AuditEntry & { __internal?: unknown };\n    delete clone.__internal;\n\n    return clone as AuditEntry;\n  }\n\n  function stripInternalAll(\n    entries: readonly AuditEntry[],\n  ): readonly AuditEntry[] {\n    // Avoid allocating a new array unless at least one entry carries\n    // the sentinel — the common case (no tombstones) is a no-op.\n    let needsClone = false;\n    for (const e of entries) {\n      if (\n        (e as AuditEntry & { __internal?: unknown }).__internal !== undefined\n      ) {\n        needsClone = true;\n        break;\n      }\n    }\n    if (!needsClone) {\n      return entries;\n    }\n\n    return entries.map(stripInternal);\n  }\n\n  return {\n    plugin,\n    query: (filter = {}) => stripInternalAll(sink.query(filter)),\n    recent: (n) => stripInternalAll(sink.recent(n)),\n    forFact: (path, opts2) => stripInternalAll(sink.forFact(path, opts2)),\n    forConstraint: (id, opts2) =>\n      stripInternalAll(sink.forConstraint(id, opts2)),\n    toJSON: () => {\n      const snap = sink.toJSON();\n\n      return {\n        entries: stripInternalAll(snap.entries),\n        capturedAt: snap.capturedAt,\n      };\n    },\n    verify(opts?: { strong?: boolean }): VerifyResult {\n      return verifyChain(sink, opts);\n    },\n    erase(filter) {\n      // (C8) Replace matching entries with tombstones IN PLACE, keeping\n      // seq + prevHash + hashAlgo so verify() can resync the chain.\n      const erasedAt = Date.now();\n      let count = 0;\n      if (typeof sink.erase === \"function\") {\n        count = sink.erase(filter, (e) => {\n          // Build a tombstone preserving the immutable chain fields.\n          // Carry SCHEMA_VERSION from the original so a fresh tombstone\n          // doesn't claim to be at a newer schema than the entry it\n          // replaced. (F-5)\n          //\n          // (N7) Stamp the in-module sentinel so `verify()` can tell\n          // this tombstone apart from a forgery written via\n          // `sink.write({ kind: \"system.entry-erased\", … })`. The\n          // sentinel is stripped from every public read path.\n          const tombstone = {\n            seq: e.seq,\n            ts: e.ts,\n            kind: \"system.entry-erased\" as const,\n            prevHash: e.prevHash,\n            hashAlgo: e.hashAlgo,\n            schemaVersion:\n              (e as AuditEntry & { schemaVersion?: typeof SCHEMA_VERSION })\n                .schemaVersion ?? SCHEMA_VERSION,\n            originalKind: e.kind,\n            erasedAt,\n            __internal: LEDGER_INTERNAL_TOKEN,\n          } as AuditEntry;\n          // CAUTION: replacing the payload changes the entry's hash —\n          // which means the NEXT entry's prevHash will no longer match.\n          // verify() recognises `system.entry-erased` as a legitimate\n          // chain break and reports it in `erasedSeqs` rather than as\n          // tamper. (N1 + M1)\n          freezeEntry(tombstone);\n\n          return tombstone;\n        });\n      }\n      // (MAJOR-3) Skip the `system.subject-erased` marker when nothing\n      // matched the filter — emitting an \"erased: 0\" marker pollutes\n      // the chain with noise and confuses auditors looking for real\n      // erasures.\n      if (count === 0) {\n        return { erased: 0, markerEntry: null };\n      }\n      // (N2) Don't store the raw filter — PII can land in the values\n      // (e.g. `factPath: \"alice@x.com\"`). Capture a hash + a shape\n      // descriptor so an auditor sees WHICH fields were used without\n      // exposing the values.\n      const filterShape = {\n        factPath: filter.factPath !== undefined,\n        constraintId: filter.constraintId !== undefined,\n        kind: filter.kind,\n        changedBetween:\n          filter.changedBetween !== undefined\n            ? (\"[range]\" as const)\n            : undefined,\n      };\n      // Emit a single chained `system.subject-erased` marker — recorded\n      // AFTER the erasure so auditors see what was removed and why.\n      const markerEntry = emit({\n        kind: \"system.subject-erased\",\n        filterHash: hashObject(filter),\n        filterShape,\n        erased: count,\n      });\n\n      return { erased: count, markerEntry };\n    },\n    clear() {\n      sink.clear();\n      seq = 0;\n      lastHashCache = null;\n    },\n    destroy() {\n      detach();\n      sink.destroy();\n    },\n  };\n}\n"]}

package/dist/chunk-M5PEB553.cjs

@@ -1,3 +0,0 @@
-'use strict';var chunkGACC2DMS_cjs=require('./chunk-GACC2DMS.cjs'),chunkGKMJ7NMP_cjs=require('./chunk-GKMJ7NMP.cjs'),chunkGBCWXTXW_cjs=require('./chunk-GBCWXTXW.cjs');var qe=class extends Error{constructor(A,v,q,m,k=true){super(A);this.source=v;this.sourceId=q;this.context=m;this.recoverable=k;this.name="DirectiveError";}};function It(){return {create(f){return f}}}function Pt(){return {create(f){return f}}}function qt(f){return f}function Tt(f){return f}function Gt(f){return f._mode==="single"}function Jt(f){return f._mode==="namespaced"}function me(f){if(!f)return;let a=Object.assign(Object.create(null),f);return Array.isArray(a.tags)&&Object.freeze(a.tags),Object.freeze(a)}function Yt(f){return typeof f=="object"&&f!==null&&Object.hasOwn(f,"compute")&&typeof f.compute=="function"}function At(f){return typeof f=="boolean"?{enabled:f,maxSnapshots:100}:{enabled:true,maxSnapshots:f.maxSnapshots??100,redactSnapshot:f.redactSnapshot}}function nt(f){let{historyOption:a,facts:A,store:v,onSnapshot:q,onHistoryChange:m}=f,{enabled:k,maxSnapshots:$,redactSnapshot:W}=At(a),P=[],j=-1,G=1,O=false,p=false,y=[],E=null,z=-1;function T(){return v.toObject()}function x(){let K=T();if(W)try{K=W(K);}catch(L){console.warn("[Directive] history.redactSnapshot threw, snapshot stored raw",{error:L});}try{return structuredClone(K)}catch{try{return JSON.parse(JSON.stringify(K))}catch{return {...K}}}}function Y(K){if(!chunkGBCWXTXW_cjs.f(K)){console.error("[Directive] Potential prototype pollution detected in snapshot data, skipping restore");return}v.batch(()=>{for(let[L,V]of Object.entries(K)){if(L==="__proto__"||L==="constructor"||L==="prototype"){console.warn(`[Directive] Skipping dangerous key "${L}" during fact restoration`);continue}A[L]=V;}});}return {get isEnabled(){return k},get isRestoring(){return p},get isPaused(){return O},get snapshots(){return [...P]},get currentIndex(){return j},takeSnapshot(K){if(!k||O)return {id:-1,timestamp:Date.now(),facts:{},trigger:K};let L={id:G++,timestamp:Date.now(),facts:x(),trigger:K};for(j<P.length-1&&P.splice(j+1),P.push(L),j=P.length-1;P.length>$;)P.shift(),j--;return q?.(L),L},restore(K){if(k){O=true,p=true;try{Y(K.facts);}finally{O=false,p=false;}}},goBack(K=1){if(!k||P.length===0)return;let L=j,V=j,s=y.find(d=>j>d.startIndex&&j<=d.endIndex);if(s)V=s.startIndex;else if(y.find(C=>j===C.startIndex)){let C=y.find(H=>H.endIndex<j&&j-H.endIndex<=K);V=C?C.startIndex:Math.max(0,j-K);}else V=Math.max(0,j-K);if(L===V)return;j=V;let u=P[j];u&&(this.restore(u),m?.(L,V));},goForward(K=1){if(!k||P.length===0)return;let L=j,V=j,s=y.find(d=>j>=d.startIndex&&j<d.endIndex);if(s?V=s.endIndex:V=Math.min(P.length-1,j+K),L===V)return;j=V;let u=P[j];u&&(this.restore(u),m?.(L,V));},goTo(K){if(!k)return;let L=P.findIndex(u=>u.id===K);if(L===-1){console.warn(`[Directive] Snapshot ${K} not found`);return}let V=j;j=L;let s=P[j];s&&(this.restore(s),m?.(V,L));},replay(){if(!k||P.length===0)return;j=0;let K=P[0];K&&this.restore(K);},export(){return JSON.stringify({version:1,snapshots:P,currentIndex:j})},import(K){if(k)try{let L=JSON.parse(K);if(typeof L!="object"||L===null)throw new Error("[Directive] Invalid history data: expected object");if(L.version!==1)throw new Error(`[Directive] Unsupported history export version: ${L.version}`);if(!Array.isArray(L.snapshots))throw new Error("[Directive] Invalid history data: snapshots must be an array");if(typeof L.currentIndex!="number")throw new Error("Invalid history data: currentIndex must be a number");for(let s of L.snapshots){if(typeof s!="object"||s===null)throw new Error("[Directive] Invalid snapshot: expected object");if(typeof s.id!="number"||typeof s.timestamp!="number"||typeof s.trigger!="string"||typeof s.facts!="object")throw new Error("Invalid snapshot structure");if(!chunkGBCWXTXW_cjs.f(s.facts))throw new Error("[Directive] Invalid fact data: potential prototype pollution detected in nested objects")}P.length=0,P.push(...L.snapshots),j=L.currentIndex;let V=P[j];V&&this.restore(V);}catch(L){console.error("[Directive] Failed to import history data:",L);}},beginChangeset(K){k&&(E=K,z=j);},endChangeset(){!k||E===null||(j>z&&y.push({label:E,startIndex:z,endIndex:j}),E=null,z=-1);},pause(){O=true;},resume(){O=false;}}}function rt(){let f={id:-1,timestamp:0,facts:{},trigger:""};return {isEnabled:false,isRestoring:false,isPaused:false,snapshots:[],currentIndex:-1,takeSnapshot:()=>f,restore:()=>{},goBack:()=>{},goForward:()=>{},goTo:()=>{},replay:()=>{},export:()=>"{}",import:()=>{},beginChangeset:()=>{},endChangeset:()=>{},pause:()=>{},resume:()=>{}}}var ot=new WeakMap;function Ot(f,a){if(a)return a(f);let A=ot.get(f);if(A!==void 0)return A;let{type:v,...q}=f,m=chunkGBCWXTXW_cjs.e(q),k=`${v}:${m}`;return ot.set(f,k),k}function We(f,a,A){return {requirement:f,id:Ot(f,A),fromConstraint:a}}function sn(f){return a=>({type:f,...a})}function an(f,a){return f.type===a}function cn(f){return a=>a.type===f}var Ee=class f{map=new Map;add(a){this.map.has(a.id)||this.map.set(a.id,a);}remove(a){return this.map.delete(a)}has(a){return this.map.has(a)}get(a){return this.map.get(a)}all(){return [...this.map.values()]}ids(){return [...this.map.keys()]}get size(){return this.map.size}clear(){this.map.clear();}clone(){let a=new f;for(let A of this.map.values())a.add(A);return a}diff(a){let A=[],v=[];for(let q of this.map.values())a.has(q.id)||A.push(q);for(let q of a.map.values())this.map.has(q.id)||v.push(q);return {added:A,removed:v}}};var jt=5e3;function it(f){let{definitions:a,facts:A,requirementKeys:v={},defaultTimeout:q=jt,onEvaluate:m,onError:k}=f,$=new Map;function W(t,r){if(!r||typeof r.when=="function")return;let i=r.when;if(chunkGBCWXTXW_cjs.a&&(r.async&&console.warn(`[Directive] constraint "${t}": data \`when\` is always sync; \`async: true\` will be ignored`),r.deps&&console.warn(`[Directive] constraint "${t}": data \`when\` cannot be combined with explicit \`deps\` \u2014 deps are tracked automatically`)),r.deps&&(r.deps=void 0),P(i))throw new Error(`[Directive] constraint "${t}": $changed is effects-only \u2014 constraint when has no prev snapshot. Move the change-detection to an effect, or use a boolean derivation as a synthetic prev.`);if(i===null||typeof i!="object")throw new Error(`[Directive] memoizePredicate: predicate must be a plain object or array; got ${typeof i}`);chunkGBCWXTXW_cjs.a&&chunkGACC2DMS_cjs.j(i)&&console.warn(`[Directive] constraint '${t}': data spec has no operators, combinators, or clauses \u2014 looks like a config object passed by mistake. Either pass a predicate like { phase: 'red' } or a function.`),chunkGBCWXTXW_cjs.b(i);let I=chunkGACC2DMS_cjs.q(i);r.when=chunkGBCWXTXW_cjs.c("constraint",t,w=>I(w)),$.set(t,i),r.async&&(r.async=false);}function P(t){let r=false;return chunkGACC2DMS_cjs.i(t,{operator(i,I){I==="$changed"&&(r=true);},strayOperatorKey(i){i==="$changed"&&(r=true);}}),r}for(let t of Object.keys(a))W(t,a[t]);let j=new Map,G=new Set,O=new Set,p=new Map,y=new Map,E=new Set,z=new Map,T=new Map,x=false,Y=new Set,oe=new Set,K=new Map,L=[],V=new Map;function s(t,r){a[t]&&(K.has(t)||K.set(t,new Set),K.get(t).add(r));}function u(){K.clear();for(let[t,r]of Object.entries(a))if(r.after)for(let i of r.after)s(i,t);}function d(t,r,i,I,w){if(i.has(t))return;if(I.has(t)){let Q=r.indexOf(t),te=[...r.slice(Q),t].join(" \u2192 ");throw new Error(`[Directive] Constraint cycle detected: ${te}. Remove one of the \`after\` dependencies to break the cycle.`)}I.add(t),r.push(t);let X=a[t];if(X?.after)for(let Q of X.after)a[Q]&&d(Q,r,i,I,w);r.pop(),I.delete(t),i.add(t),w.push(t);}function C(){let t=new Set,r=new Set,i=[];for(let I of Object.keys(a))d(I,[],t,r,i);L=i,V=new Map(L.map((I,w)=>[I,w]));}C(),u();function H(){for(let[t,r]of Object.entries(a))if(r.after)for(let i of r.after)a[i]||console.warn(`[Directive] Constraint "${t}" references unknown constraint "${i}" in \`after\`. This dependency will be ignored. Check for typos or ensure the constraint exists.`);}chunkGBCWXTXW_cjs.a&&H();function J(t,r){return r.async!==void 0?r.async:!!O.has(t)}function ae(t){let r=a[t];if(!r)throw new Error(`[Directive] Unknown constraint: ${t}`);let i=J(t,r);i&&O.add(t);let I={id:t,priority:r.priority??0,isAsync:i,lastResult:null,isEvaluating:false,error:null,lastResolvedAt:null,after:r.after??[],hitCount:0,lastActiveAt:null};return j.set(t,I),I}function ne(t){return j.get(t)??ae(t)}function fe(t,r){if(t.size!==r.size||t.size===0)return  false;for(let i of r)if(!t.has(i))return  false;return  true}function S(t,r){for(let i of r){let I=y.get(i);I&&(I.delete(t),I.size===0&&y.delete(i));}}function c(t,r){for(let i of r)y.has(i)||y.set(i,new Set),y.get(i).add(t);}function M(t){let r=p.get(t);r&&(S(t,r),p.delete(t));}function F(t){K.delete(t);for(let r of K.values())r.delete(t);}function Z(t,r){let i=p.get(t)??new Set;fe(i,r)||(S(t,i),c(t,r),p.set(t,r));}function re(t,r){let i=r.when;if(r.deps)return z.set(t,new Set(r.deps)),i(A);let I=chunkGKMJ7NMP_cjs.h(()=>i(A));return z.set(t,I.deps),I.value}function de(t,r,i){r.lastResult=i,i&&(r.hitCount++,r.lastActiveAt=Date.now()),r.isEvaluating=false,m?.(t,i);}function pe(t,r,i){r.error=i instanceof Error?i:new Error(String(i)),r.lastResult=false,r.isEvaluating=false,k?.(t,i);}function ye(t,r,i){return O.add(t),r.isAsync=true,chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] Constraint "${t}" returned a Promise but was not marked as async. Add \`async: true\` to the constraint definition to avoid this warning and improve performance.`),i.then(I=>(de(t,r,I),I)).catch(I=>(pe(t,r,I),false))}function se(t){let r=a[t];if(!r)return  false;let i=ne(t);i.isEvaluating=true,i.error=null;try{let I=re(t,r);return I instanceof Promise?ye(t,i,I):(de(t,i,I),I)}catch(I){return pe(t,i,I),false}}async function he(t){let r=a[t];if(!r)return  false;let i=ne(t),I=r.timeout??q;if(i.isEvaluating=true,i.error=null,r.deps?.length){let w=new Set(r.deps);Z(t,w),z.set(t,w);}try{let w=r.when(A),X=await chunkGBCWXTXW_cjs.d(w,I,`Constraint "${t}" timed out after ${I}ms`);return i.lastResult=X,X&&(i.hitCount++,i.lastActiveAt=Date.now()),i.isEvaluating=!1,m?.(t,X),X}catch(w){return i.error=w instanceof Error?w:new Error(String(w)),i.lastResult=false,i.isEvaluating=false,k?.(t,w),false}}let we=10;function Re(t,r){if(t==null)return [];if(Array.isArray(t)){let i=t.filter(I=>I!=null);return chunkGBCWXTXW_cjs.a&&i.length>we&&r&&console.warn(`[Directive] Constraint "${r}" produced ${i.length} requirements. Consider splitting into multiple constraints for better performance.`),i}return [t]}function Se(t){let r=a[t];if(!r)return {requirements:[],deps:new Set};let i=r.require;if(typeof i=="function"){let{value:w,deps:X}=chunkGKMJ7NMP_cjs.h(()=>i(A));return {requirements:Re(w,t),deps:X}}return {requirements:Re(i,t),deps:new Set}}function ke(t,r){if(r.size===0)return;let i=p.get(t)??new Set;for(let I of r)i.add(I);c(t,r),p.set(t,i);}let ve=null;function Ae(){return ve||(ve=Object.keys(a).sort((t,r)=>{let i=ne(t),w=ne(r).priority-i.priority;if(w!==0)return w;let X=V.get(t)??0,Q=V.get(r)??0;return X-Q})),ve}for(let t of Object.keys(a))ae(t);function be(t){for(let[r,i]of Object.entries(t))i.async&&!i.deps&&console.warn(`[Directive] Async constraint "${r}" has no \`deps\` declared. Auto-tracking cannot work across async boundaries. Add \`deps: ["key1", "key2"]\` to enable dependency tracking.`);}chunkGBCWXTXW_cjs.a&&be(a);function _(t){return !a[t]||G.has(t)||oe.has(t)?true:Y.has(t)}function ce(t){let r=j.get(t);if(!r||r.after.length===0)return  true;for(let i of r.after)if(!_(i))return  false;return  true}function ge(t){let r=z.get(t);r!==void 0&&Z(t,r),oe.add(t),T.set(t,[]);}function Be(t,r,i){if(r!==void 0){let I=new Set(r);for(let w of i)I.add(w);Z(t,I);}else ke(t,i);}function l(t,r,i){if(r.length===0){T.set(t,[]);return}let I=r.map(w=>We(w,t,v[w.type]));for(let w of I)i.add(w);T.set(t,I);}function h(t,r){for(let i of t)r.add(i);}function D(t,r,i){if(G.has(t))return;if(!r){ge(t);return}oe.delete(t);let I=z.get(t),w,X;try{let Q=Se(t);w=Q.requirements,X=Q.deps;}catch(Q){k?.(t,Q),ge(t);return}Be(t,I,X),l(t,w,i);}function B(t,r){let i=[],I=[];for(let w of t){if(ce(w)){I.push(w);continue}i.push(w);let X=T.get(w);X&&h(X,r);}return {blocked:i,ready:I}}function N(t,r){let i=[];for(let I of t){let w=se(I);if(w instanceof Promise){i.push({id:I,promise:w});continue}D(I,w,r);}return i}async function U(t,r){let i=await Promise.all(t.map(async({id:I,promise:w})=>({id:I,active:await w})));for(let{id:I,active:w}of i)D(I,w,r);}async function e(t,r){let{blocked:i,ready:I}=B(t,r);if(I.length===0)return i;let w=[],X=[];for(let te of I)ne(te).isAsync?X.push(te):w.push(te);let Q=N(w,r);if(Q.length>0&&await U(Q,r),X.length>0){let te=X.map(ee=>({id:ee,promise:he(ee)}));await U(te,r);}return i}function n(t,r){for(let i of t){let I=y.get(i);if(I)for(let w of I)G.has(w)||r.add(w);}}function o(t){for(let r of E)G.has(r)||t.add(r);E.clear();}function b(t){let r=new Set;return n(t,r),o(r),r}function g(t,r,i){for(let I of t){if(r.has(I))continue;let w=T.get(I);w&&h(w,i);}}return {async evaluate(t){let r=new Ee;oe.clear();let i=Ae(),I=G.size===0?i:i.filter(te=>!G.has(te)),w;if(!x||!t||t.size===0)w=I,x=true;else {let te=b(t);w=[...te],g(I,te,r);}let X=w,Q=w.length+1;for(;X.length>0&&Q>0;){let te=X.length;if(X=await e(X,r),X.length===te)break;Q--;}return r.all()},getState(t){return j.get(t)},getDependencies(t){return p.get(t)},getAllStates(){return [...j.values()]},disable(t){if(!j.has(t)){console.warn(`[Directive] constraints.disable("${t}") \u2014 no such constraint`);return}G.add(t),ve=null,T.delete(t),M(t),z.delete(t);},enable(t){if(!j.has(t)){console.warn(`[Directive] constraints.enable("${t}") \u2014 no such constraint`);return}G.delete(t),ve=null,E.add(t);},isDisabled(t){return G.has(t)},invalidate(t){let r=y.get(t);if(r)for(let i of r)E.add(i);},markResolved(t){Y.add(t);let r=j.get(t);r&&(r.lastResolvedAt=Date.now());let i=K.get(t);if(i)for(let I of i)E.add(I);},isResolved(t){return Y.has(t)},registerDefinitions(t){let r=false;for(let[i,I]of Object.entries(t))a[i]=I,W(i,a[i]),ae(i),E.add(i),I.after?.length&&(r=true);ve=null,r&&C(),u();},assignDefinition(t,r){if(!a[t])throw new Error(`[Directive] Cannot assign constraint "${t}" \u2014 it does not exist. Use register() to create it.`);a[t]=r,$.delete(t),W(t,a[t]),ae(t),E.add(t),ve=null,C(),u();},unregisterDefinition(t){a[t]&&(delete a[t],j.delete(t),G.delete(t),O.delete(t),E.delete(t),oe.delete(t),Y.delete(t),T.delete(t),z.delete(t),M(t),F(t),ve=null,C(),u());},async callOne(t,r){if(!a[t])throw new Error(`[Directive] Cannot call constraint "${t}" \u2014 it does not exist.`);if(G.has(t))return [];let I=ne(t),w;if(I.isAsync)w=await he(t);else {let te=se(t);w=te instanceof Promise?await te:te;}if(!w)return [];let{requirements:X}=Se(t);if(X.length===0)return [];let Q=[];for(let te of X){let ee=r?{...te,...r}:te;Q.push(We(ee,t,v[ee.type]));}return Q},setRequirementKey(t,r){v[t]=r;},removeRequirementKey(t){delete v[t];},getWhenSpec(t){return $.get(t)},explainWhen(t){let r=$.get(t);if(r)return chunkGACC2DMS_cjs.p(r,A)}}}function st(f){let{definitions:a,facts:A,onCompute:v,onInvalidate:q,onError:m}=f,k=3,$=new Map;function W(S,c){if(typeof c!="object"||c===null||!Object.hasOwn(c,"compute"))return;let M=c,F=M.compute,Z;if(typeof F=="function")Z=F;else if(chunkGACC2DMS_cjs.k(F))chunkGBCWXTXW_cjs.b(F),Z=re=>chunkGACC2DMS_cjs.s(F,re);else if(typeof F=="object"&&F!==null){chunkGBCWXTXW_cjs.b(F);let re=chunkGACC2DMS_cjs.q(F);Z=chunkGBCWXTXW_cjs.c("derivation",S,de=>re(de));}else if(F!==void 0)throw new Error(`[Directive] memoizePredicate: predicate must be a plain object or array; got ${typeof F}`);if(Z){a[S]=Z;let re=me(M.meta);re&&$.set(S,re);}}for(let[S,c]of Object.entries(a))W(S,c);let P=new Map,j=new Map,G=new Map,O=new Map,p=0,y=new Set,E=false,z=100,T;function x(S,c){let M=P.has(S)?O:G,F=M.get(S);F?.delete(c),F&&F.size===0&&M.delete(S);}function Y(S,c){let M=a[S]?O:G,F=M.get(S);F||(F=new Set,M.set(S,F)),F.add(c);}function oe(S){let c=P.get(S);if(c)for(let M of c.dependencies)x(M,S);}function K(S){let c=O.get(S);if(c){p++;try{for(let M of c)ne(M);}finally{p--;}O.delete(S);}}function L(S){delete a[S],P.delete(S),j.delete(S),y.delete(S),$.delete(S);}function V(S){if(!a[S])throw new Error(`[Directive] Unknown derivation: ${S}`);let M={id:S,compute:()=>u(S),cachedValue:void 0,dependencies:new Set,isStale:true,isComputing:false,stableRunCount:0,depsStable:false};return P.set(S,M),M}function s(S){return P.get(S)??V(S)}function u(S){let c=s(S),M=a[S];if(!M)throw new Error(`[Directive] Unknown derivation: ${S}`);if(c.isComputing)throw new Error(`[Directive] Circular dependency detected in derivation: ${S}`);c.isComputing=true;try{let F=c.cachedValue,Z,re;if(c.depsStable&&c.dependencies.size>0)Z=M(A,T),re=c.dependencies;else {let de=chunkGKMJ7NMP_cjs.h(()=>M(A,T));Z=de.value,re=de.deps,c.dependencies.size>0&&d(re,c.dependencies)?(c.stableRunCount++,c.stableRunCount>=k&&(c.depsStable=!0)):c.stableRunCount=0;}return c.cachedValue=Z,c.isStale=!1,C(S,re),v&&v(S,Z,F,[...re]),Z}catch(F){throw m?.(S,F),F}finally{c.isComputing=false;}}function d(S,c){if(S.size!==c.size)return  false;for(let M of c)if(!S.has(M))return  false;return  true}function C(S,c){let M=s(S),F=M.dependencies;if(!d(F,c)){for(let Z of F)x(Z,S);for(let Z of c)Y(Z,S);M.dependencies=c;}}function H(S){for(let c of S){let M=j.get(c);if(M)for(let F of M)F();}}function J(){if(!(p>0||E)){E=true;try{let S=0;for(;y.size>0;){if(++S>z){let M=[...y];throw y.clear(),new Error(`[Directive] Infinite derivation notification loop detected after ${z} iterations. Remaining: ${M.join(", ")}. This usually means a derivation listener is mutating facts that re-trigger the same derivation.`)}let c=[...y];y.clear(),H(c);}}finally{E=false;}}}function ae(S,c){let M=O.get(S);if(M)for(let F of M)c.push(F);}function ne(S,c=new Set){let M=[S];for(;M.length>0;){let F=M.pop();if(c.has(F))continue;c.add(F);let Z=P.get(F);!Z||Z.isStale||(Z.isStale=true,Z.depsStable=false,Z.stableRunCount=0,q?.(F),y.add(F),ae(F,M));}}return T=new Proxy({},{get(S,c){if(typeof c=="symbol"||chunkGKMJ7NMP_cjs.k.has(c)||!a[c])return;chunkGKMJ7NMP_cjs.j(c);let M=s(c);return M.isStale&&u(c),M.cachedValue},set(){return  false},deleteProperty(){return  false},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}}),{get(S){let c=s(S);return c.isStale&&u(S),c.cachedValue},isStale(S){return P.get(S)?.isStale??true},invalidate(S){let c=G.get(S);if(!c)return;p++;let M=new Set;try{for(let F of c)ne(F,M);}finally{p--,J();}},invalidateMany(S){p++;let c=new Set;try{for(let M of S){let F=G.get(M);if(F)for(let Z of F)ne(Z,c);}}finally{p--,J();}},invalidateAll(){p++;try{for(let S of P.values())S.isStale||(S.isStale=!0,S.depsStable=!1,S.stableRunCount=0,y.add(S.id));}finally{p--,J();}},subscribe(S,c){for(let M of S){let F=M;j.has(F)||j.set(F,new Set),j.get(F).add(c);}return ()=>{for(let M of S){let F=M,Z=j.get(F);Z?.delete(c),Z&&Z.size===0&&j.delete(F);}}},getProxy(){return T},getDependencies(S){return s(S).dependencies},registerDefinitions(S){for(let[c,M]of Object.entries(S))typeof M=="function"?a[c]=M:W(c,M),V(c);},assignDefinition(S,c){if(!a[S])throw new Error(`[Directive] Cannot assign derivation "${S}" \u2014 it does not exist. Use register() to create it.`);typeof c=="function"?(a[S]=c,$.delete(S)):($.delete(S),W(S,c));let M=P.get(S);M&&(M.isStale=true,M.depsStable=false,M.stableRunCount=0,y.add(S)),J();},unregisterDefinition(S){a[S]&&(oe(S),K(S),L(S),J());},getMeta(S){return $.get(S)},callOne(S){if(!a[S])throw new Error(`[Directive] Cannot call derivation "${S}" \u2014 it does not exist.`);return u(S)}}}var $t=3;function at(f){let{definitions:a,facts:A,store:v,onRun:q,onError:m}=f,k=new Map,$=null,W=false,P=new Map;function j(s){let u=a[s];if(!u)throw new Error(`[Directive] Unknown effect: ${s}`);P.delete(s);let d=null,C=false;if(u.deps)d=new Set(u.deps),C=true;else if(u.on!==void 0){if(!chunkGACC2DMS_cjs.h(u.on))throw new Error(`[Directive] effect on must be a FactPredicate spec; got ${typeof u.on}`);if(u.on===null||typeof u.on!="object")throw new Error(`[Directive] memoizePredicate: predicate must be a plain object or array; got ${typeof u.on}`);chunkGBCWXTXW_cjs.b(u.on),d=chunkGACC2DMS_cjs.r(u.on),C=true;let J=chunkGACC2DMS_cjs.q(u.on);P.set(s,chunkGBCWXTXW_cjs.c("effect",s,(ae,ne)=>J(ae,ne)));}let H={id:s,enabled:true,hasExplicitDeps:C,dependencies:d,cleanup:null,stableRunCount:0,depsStable:false};return k.set(s,H),H}function G(s){return k.get(s)??j(s)}function O(){return v.toObject()}function p(s){s.depsStable=false,s.stableRunCount=0;}function y(s,u){for(let d of s)if(u.has(d))return  true;return  false}function E(s,u){let d=G(s);if(!d.enabled)return  false;if(d.dependencies){if(!y(d.dependencies,u))return  false;d.depsStable&&p(d);let C=P.get(s);if(C){let H=O();return C(H,$??void 0)}return  true}return  true}function z(s){if(s.cleanup){try{s.cleanup();}catch(u){m?.(s.id,u),console.error(`[Directive] Effect "${s.id}" cleanup threw an error:`,u);}s.cleanup=null;}}function T(s,u){if(typeof u=="function")if(W)try{u();}catch(d){m?.(s.id,d),console.error(`[Directive] Effect "${s.id}" cleanup threw an error:`,d);}else s.cleanup=u;}async function x(s,u){let d;if(v.batch(()=>{d=u.run(A,$);}),d instanceof Promise){let C=await d;T(s,C);}else T(s,d);}function Y(s,u){if(s.size!==u.size)return  false;for(let d of u)if(!s.has(d))return  false;return  true}function oe(s,u){if(!(s.dependencies&&Y(s.dependencies,u))){p(s);return}s.stableRunCount++,s.stableRunCount>=$t&&(s.depsStable=true);}async function K(s,u){if(s.depsStable&&s.dependencies){await x(s,u);return}let d,C=chunkGKMJ7NMP_cjs.h(()=>(v.batch(()=>{d=u.run(A,$);}),d)),H=C.deps,J=C.value;J instanceof Promise&&(J=await J),T(s,J),oe(s,H),s.dependencies=H.size>0?H:null;}async function L(s){let u=G(s),d=a[s];if(!(!u.enabled||!d)){z(u),q?.(s,u.dependencies?[...u.dependencies]:[]);try{u.hasExplicitDeps?await x(u,d):await K(u,d);}catch(C){m?.(s,C),console.error(`[Directive] Effect "${s}" threw an error:`,C),u.hasExplicitDeps||p(u);}}}for(let s of Object.keys(a))j(s);return {async runEffects(s){let u=[];for(let d of Object.keys(a))E(d,s)&&u.push(d);await Promise.all(u.map(L)),$=O();},async runAll(){let s=Object.keys(a);await Promise.all(s.map(u=>{let d=G(u);return d.enabled?(p(d),L(u)):Promise.resolve()})),$=O();},disable(s){let u=G(s);u.enabled=false;},enable(s){let u=G(s);u.enabled=true;},isEnabled(s){return G(s).enabled},cleanupAll(){W=true;for(let s of k.values())z(s);},registerDefinitions(s){for(let[u,d]of Object.entries(s))a[u]=d,j(u);},assignDefinition(s,u){if(!a[s])throw new Error(`[Directive] Cannot assign effect "${s}" \u2014 it does not exist. Use register() to create it.`);let d=k.get(s);d&&z(d),a[s]=u,j(s);},unregisterDefinition(s){if(!a[s])return;let u=k.get(s);u&&z(u),delete a[s],k.delete(s),P.delete(s);},async callOne(s){let u=a[s];if(!u)throw new Error(`[Directive] Cannot call effect "${s}" \u2014 it does not exist.`);let d=G(s);if(d.enabled){z(d),q?.(s,d.dependencies?[...d.dependencies]:[]);try{let C;if(v.batch(()=>{C=u.run(A,$);}),C instanceof Promise){let H=await C;T(d,H);}else T(d,C);}catch(C){m?.(s,C),console.error(`[Directive] Effect "${s}" threw an error:`,C);}}}}}function Ft(f={}){let{delayMs:a=1e3,maxRetries:A=3,backoffMultiplier:v=2,maxDelayMs:q=3e4}=f,m=new Map;function k($){let W=a*v**($-1);return Math.min(W,q)}return {scheduleRetry($,W,P,j,G){if(j>A)return null;let O=k(j),p={source:$,sourceId:W,context:P,attempt:j,nextRetryTime:Date.now()+O,callback:G};return m.set(W,p),p},getPendingRetries(){return Array.from(m.values())},processDueRetries(){let $=Date.now(),W=[];for(let[P,j]of m)j.nextRetryTime<=$&&(W.push(j),m.delete(P));return W},cancelRetry($){m.delete($);},clearAll(){m.clear();}}}var Bt={constraint:"skip",resolver:"skip",effect:"skip",derivation:"skip",system:"throw"};function ct(f={}){let{config:a={},onError:A,onRecovery:v}=f,q=[],m=100,k=Ft(a.retryLater),$=new Map,W=1e3;function P(y,E,z,T){if(z instanceof qe)return z;let x=z instanceof Error?z.message:String(z),Y=y!=="system";return new qe(x,y,E,T,Y)}function j(y,E,z){let T=(()=>{switch(y){case "constraint":return a.onConstraintError;case "resolver":return a.onResolverError;case "effect":return a.onEffectError;case "derivation":return a.onDerivationError;default:return}})();if(typeof T=="function"){try{let x=T(z,E);if(typeof x=="string")return x}catch(x){console.error("[Directive] Error in error handler callback:",x);}return "skip"}return typeof T=="string"?T:Bt[y]}function G(y){q.push(y),q.length>m&&q.shift();try{A?.(y);}catch(E){console.error("[Directive] Error in onError callback:",E);}try{a.onError?.(y);}catch(E){console.error("[Directive] Error in config.onError callback:",E);}}function O(y,E,z){let T=($.get(E)??0)+1;if($.set(E,T),$.size>W){let Y=$.keys().next().value;Y!==void 0&&$.delete(Y);}return k.scheduleRetry(y,E,z,T)?"retry-later":($.delete(E),typeof process<"u"&&process.env?.NODE_ENV!=="production"&&console.warn(`[Directive] ${y} "${E}" exceeded max retry-later attempts. Skipping.`),"skip")}return {handleError(y,E,z,T){let x=P(y,E,z,T);G(x);let Y=j(y,E,z instanceof Error?z:new Error(String(z)));Y==="retry-later"&&(Y=O(y,E,T));try{v?.(x,Y);}catch(oe){console.error("[Directive] Error in onRecovery callback:",oe);}if(Y==="throw")throw x;return Y},getLastError(){return q[q.length-1]??null},getAllErrors(){return [...q]},clearErrors(){q.length=0;},getRetryLaterManager(){return k},processDueRetries(){return k.processDueRetries()},clearRetryAttempts(y){$.delete(y),k.cancelRetry(y);}}}function Kt(f,a=100){try{return JSON.stringify(f)?.slice(0,a)??String(f)}catch{return "[circular or non-serializable]"}}function _t(f){let{schema:a,onChange:A,onBatch:v}=f,m=Object.keys(a).length===0,k=f.validate??chunkGBCWXTXW_cjs.a,$=f.strictKeys??(chunkGBCWXTXW_cjs.a&&!m),W=f.redactErrors??false,P=new Map,j=new Set,G=new Map,O=new Set,p=0,y=[],E=new Set,z=false,T=[],x=100;function Y(c){return c!==null&&typeof c=="object"&&"safeParse"in c&&typeof c.safeParse=="function"&&"_def"in c&&"parse"in c&&typeof c.parse=="function"}function oe(c){let M=c;if(M._typeName)return M._typeName;if(Y(c)){let F=c._def;if(F?.typeName)return F.typeName.replace(/^Zod/,"").toLowerCase()}return "unknown"}function K(c){return W?"[redacted]":Kt(c)}function L(c){return c===null?"null":Array.isArray(c)?"array":typeof c}function V(c,M,F){let Z=F.safeParse(M);if(Z.success)return;let re=L(M),de=K(M),pe=Z.error?.message??Z.error?.issues?.[0]?.message??"Validation failed",ye=oe(F);throw new Error(`[Directive] Validation failed for "${c}": expected ${ye}, got ${re} ${de}. ${pe}`)}function s(c){if(typeof c._lastFailedIndex=="number"&&c._lastFailedIndex>=0){let M=` (element at index ${c._lastFailedIndex} failed)`;return c._lastFailedIndex=-1,M}return ""}function u(c,M,F){let Z=F._validators;if(!Z||!Array.isArray(Z)||Z.length===0)return;let re=F._typeName??"unknown";for(let de=0;de<Z.length;de++){let pe=Z[de];if(typeof pe!="function"||pe(M))continue;let ye=L(M),se=K(M),he=s(F),we=de===0?"":` (validator ${de+1} failed)`;throw new Error(`[Directive] Validation failed for "${c}": expected ${re}, got ${ye} ${se}${we}${he}`)}}function d(c){if($)throw new Error(`[Directive] Unknown fact key: "${c}". Key not defined in schema.`);console.warn(`[Directive] Unknown fact key: "${c}"`);}function C(c,M){if(!k)return;let F=a[c];if(!F){d(c);return}if(Y(F)){V(c,M,F);return}u(c,M,F);}function H(c){G.get(c)?.forEach(M=>M());}function J(){O.forEach(c=>c());}function ae(c,M,F){if(z){T.push({key:c,value:M,prev:F});return}z=true;try{A?.(c,M,F),H(c),J(),ne(". A listener is repeatedly mutating facts that re-trigger notifications");}finally{z=false;}}function ne(c){let M=0;for(;T.length>0;){if(++M>x)throw T.length=0,new Error(`[Directive] Infinite notification loop detected after ${x} iterations${c}.`);let F=[...T];T.length=0;for(let Z of F)A?.(Z.key,Z.value,Z.prev),H(Z.key);J();}}function fe(){if(!(p>0)){if(v&&y.length>0&&v([...y]),E.size>0){z=true;try{for(let c of E)H(c);J(),ne(" during flush");}finally{z=false;}}y.length=0,E.clear();}}let S={get(c){return chunkGKMJ7NMP_cjs.j(c),P.get(c)},has(c){return chunkGKMJ7NMP_cjs.j(c),P.has(c)},set(c,M){chunkGBCWXTXW_cjs.a&&C(c,M);let F=P.get(c);Object.is(F,M)||(P.set(c,M),j.add(c),p>0?(y.push({key:c,value:M,prev:F,type:"set"}),E.add(c)):ae(c,M,F));},delete(c){let M=P.get(c);P.delete(c),j.delete(c),p>0?(y.push({key:c,value:void 0,prev:M,type:"delete"}),E.add(c)):ae(c,void 0,M);},batch(c){p++;try{c();}finally{p--,fe();}},subscribe(c,M){for(let F of c){let Z=F;G.has(Z)||G.set(Z,new Set),G.get(Z).add(M);}return ()=>{for(let F of c){let Z=G.get(F);Z&&(Z.delete(M),Z.size===0&&G.delete(F));}}},subscribeAll(c){return O.add(c),()=>O.delete(c)},toObject(){let c={};for(let M of j)P.has(M)&&(c[M]=P.get(M));return c}};return S.destroy=()=>{G.clear(),O.clear();},S.registerKeys=c=>{for(let M of Object.keys(c))chunkGKMJ7NMP_cjs.k.has(M)||(a[M]=c[M],j.add(M));},S}var ze=new WeakMap;function ut(f,a,A=a){return new Proxy(f,{get(v,q){if(typeof q=="string"&&chunkGKMJ7NMP_cjs.k.has(q))return;if(q===Symbol.for("nodejs.util.inspect.custom"))return ()=>v;let m=Reflect.get(v,q);if(typeof q=="symbol"||typeof m!="object"||m===null)return m;if(ze.has(m))return ze.get(m);let k=ut(m,a,`${A}.${String(q)}`);return ze.set(m,k),k},set(v,q,m){return typeof q!="symbol"&&console.warn(`[Directive] Nested mutation on "facts.${A}.${String(q)}" will not trigger reactivity. Use: facts.${a} = { ...facts.${a}, ... }`),Reflect.set(v,q,m)}})}function Wt(f,a){let A=()=>({get:q=>chunkGKMJ7NMP_cjs.i(()=>f.get(q)),has:q=>chunkGKMJ7NMP_cjs.i(()=>f.has(q))});return new Proxy({},{get(q,m){if(typeof m=="symbol")return m===Symbol.for("nodejs.util.inspect.custom")?()=>chunkGKMJ7NMP_cjs.i(()=>f.toObject()):void 0;if(chunkGKMJ7NMP_cjs.k.has(m))return;if(m==="$store")return f;if(m==="$snapshot")return A;let k=f.get(m);return chunkGBCWXTXW_cjs.a&&k!==null&&typeof k=="object"?ut(k,m):k},set(q,m,k){if(typeof m=="symbol"||m==="$store"||m==="$snapshot"||chunkGKMJ7NMP_cjs.k.has(m))return  false;if(chunkGBCWXTXW_cjs.a){let $=chunkGKMJ7NMP_cjs.l(k);$&&chunkGKMJ7NMP_cjs.m(m,$);}return f.set(m,k),true},deleteProperty(q,m){return typeof m=="symbol"||m==="$store"||m==="$snapshot"||chunkGKMJ7NMP_cjs.k.has(m)?false:(f.delete(m),true)},has(q,m){return m==="$store"||m==="$snapshot"?true:typeof m=="symbol"||chunkGKMJ7NMP_cjs.k.has(m)?false:f.has(m)},ownKeys(){return Object.keys(a)},getOwnPropertyDescriptor(q,m){if(!(typeof m=="string"&&chunkGKMJ7NMP_cjs.k.has(m)))return m==="$store"||m==="$snapshot"?{configurable:true,enumerable:false,writable:false}:{configurable:true,enumerable:true,writable:true}},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}})}function dt(f){let a=_t(f),A=Wt(a,f.schema);return {store:a,facts:A}}function lt(){let f=[];function a(m,k,$){if(m)try{return m()}catch(W){console.error("[Directive] Plugin error:",{plugin:k,hook:$,error:W});return}}async function A(m,k,$){if(m)try{return await m()}catch(W){console.error("[Directive] Plugin error:",{plugin:k,hook:$,error:W});return}}function v(m){return (...k)=>{let $=[...f];for(let W of $)a(()=>W[m]?.(...k),W.name,m);}}return {register(m){f.some(k=>k.name===m.name)&&(console.warn(`[Directive] Plugin "${m.name}" is already registered, replacing...`),this.unregister(m.name)),f.push(m);},unregister(m){let k=f.findIndex($=>$.name===m);k!==-1&&f.splice(k,1);},getPlugins(){return [...f]},async emitInit(m){let k=new WeakSet;for(let $=0;$<100;$++){let W=f.filter(P=>!k.has(P));if(W.length===0)break;for(let P of W){k.add(P);let j=typeof performance<"u"?performance.now():Date.now();await A(()=>P.onInit?.(m)??Promise.resolve(),P.name,"onInit");let G=(typeof performance<"u"?performance.now():Date.now())-j;G>100&&console.warn("[Directive] slow plugin onInit",{plugin:P.name,hook:"onInit",pass:$,durationMs:Math.round(G)});}}},emitStart:v("onStart"),emitStop:v("onStop"),emitDestroy:v("onDestroy"),emitFactSet:v("onFactSet"),emitFactDelete:v("onFactDelete"),emitFactsBatch:v("onFactsBatch"),emitDerivationCompute:v("onDerivationCompute"),emitDerivationInvalidate:v("onDerivationInvalidate"),emitReconcileStart:v("onReconcileStart"),emitReconcileEnd:v("onReconcileEnd"),emitConstraintEvaluate:v("onConstraintEvaluate"),emitConstraintError:v("onConstraintError"),emitRequirementCreated:v("onRequirementCreated"),emitRequirementMet:v("onRequirementMet"),emitRequirementCanceled:v("onRequirementCanceled"),emitResolverStart:v("onResolverStart"),emitResolverComplete:v("onResolverComplete"),emitResolverError:v("onResolverError"),emitResolverRetry:v("onResolverRetry"),emitResolverCancel:v("onResolverCancel"),emitResolverWriteRejected:v("onResolverWriteRejected"),emitEffectRun:v("onEffectRun"),emitEffectError:v("onEffectError"),emitSourceAttach:v("onSourceAttach"),emitSourcePublish:v("onSourcePublish"),emitSourceDrop:v("onSourceDrop"),emitSourceDetach:v("onSourceDetach"),emitSourceError:v("onSourceError"),emitGuardrailBlocked:v("onGuardrailBlocked"),emitSnapshot:v("onSnapshot"),emitHistoryNavigate:v("onHistoryNavigate"),emitError:v("onError"),emitErrorRecovery:v("onErrorRecovery"),emitDefinitionRegister:v("onDefinitionRegister"),emitDefinitionAssign:v("onDefinitionAssign"),emitDefinitionUnregister:v("onDefinitionUnregister"),emitDefinitionCall:v("onDefinitionCall"),emitTraceComplete:v("onTraceComplete")}}var ft={attempts:1,backoff:"none",initialDelay:100,maxDelay:3e4},gt={enabled:false,windowMs:50};function zt(f,a){if(!a||a==="none")return f;if(a==="full")return Math.floor(Math.random()*f);if(a==="equal"){let A=f/2;return Math.floor(A+Math.random()*A)}if(typeof a=="object"&&"maxMs"in a){let A=Number.isFinite(a.maxMs)&&a.maxMs>0?a.maxMs:0;return f+Math.floor(Math.random()*A)}return f}function Nt(f,a){let{backoff:A,initialDelay:v=100,maxDelay:q=3e4}=f,m;switch(A){case "none":m=v;break;case "linear":m=v*a;break;case "exponential":m=v*2**(a-1);break;default:m=v;}let k=Math.min(m,q),$=zt(k,f.jitter);return Math.max(1,$)}function Ht(f){if(chunkGBCWXTXW_cjs.a)for(let[a,A]of Object.entries(f)){if(!A.resolve&&!A.resolveBatch&&!A.resolveBatchWithResults)throw new Error(`[Directive] Resolver "${a}" must define either resolve() or resolveBatch(). Add one of these methods to handle requirements.`);if(!(!A.batch?.enabled||A.resolveBatch||A.resolveBatchWithResults))if(A.resolve)console.warn(`[Directive] Resolver "${a}" has batch.enabled but no resolveBatch(). Falling back to individual resolve() calls. Add resolveBatch() for true bulk operations.`);else throw new Error(`[Directive] Resolver "${a}" has batch.enabled=true but no resolve(), resolveBatch(), or resolveBatchWithResults() method.`)}}function mt(f){let{definitions:a,facts:A,store:v,getConstraintBinding:q,onStart:m,onComplete:k,onError:$,onRetry:W,onCancel:P,onClobber:j,onClobberSuppressed:G,onResolutionComplete:O,onRequeue:p}=f;Ht(a);let y=new Map,E=new Map,z=1e3,T=new Map,x=new Map,Y=new Map,oe=0,K=new Map,L=1e3;function V(){if(E.size>z){let l=E.size-z,h=E.keys();for(let D=0;D<l;D++){let B=h.next().value;B&&E.delete(B);}}}function s(l){return typeof l=="object"&&l!==null&&"requirement"in l&&typeof l.requirement=="string"}function u(l){return typeof l=="object"&&l!==null&&"requirement"in l&&typeof l.requirement=="function"}function d(l,h){return s(l)?h.type===l.requirement:u(l)?l.requirement(h):false}function C(l,h){let D=K.get(l);if(!D)return null;K.delete(l),K.set(l,D);for(let B of D){let N=a[B];if(N&&d(N,h))return B}return null}function H(l,h){if(!K.has(l)){if(K.size>=L){let D=K.keys().next().value;D!==void 0&&K.delete(D);}K.set(l,new Set);}K.get(l).add(h);}function J(l){let h=l.type,D=C(h,l);if(D)return D;for(let[B,N]of Object.entries(a))if(d(N,l))return H(h,B),B;return null}function ae(l){if(!q||!l||!l.fromConstraint)return null;let h=q(l.fromConstraint);return !h||h.fields.length===0?null:h}function ne(l,h,D,B,N){let U=A,e=new Set(l.fields),n=10,o=0,b=false,g=new Map;for(let r of e){let i=D?D[r]:U[r];g.set(r,i);}let R=new Set;function t(r){return R.has(r)?false:Object.is(U[r],g.get(r))?true:(R.add(r),o++,o<=n?B&&B(r,g.get(r),U[r]):b||(b=true,N&&N(o-n)),h.abort(),false)}return new Proxy(A,{get(r,i,I){return Reflect.get(A,i,I)},set(r,i,I,w){if(typeof i!="string"||!e.has(i))return Reflect.set(A,i,I);if(!t(i))return  true;let X=g.get(i);g.set(i,I);let Q=Reflect.set(A,i,I);return Q||g.set(i,X),Q},deleteProperty(r,i){if(typeof i!="string"||!e.has(i))return Reflect.deleteProperty(A,i);if(!t(i))return  true;let I=g.get(i);g.set(i,void 0);let w=Reflect.deleteProperty(A,i);return w||g.set(i,I),w},has(r,i){return Reflect.has(A,i)},ownKeys(){return Reflect.ownKeys(A)},getOwnPropertyDescriptor(r,i){return Reflect.getOwnPropertyDescriptor(A,i)}})}function fe(l,h,D,B,N,U){return {facts:D&&B?ne(D,B,N,j&&U?(b,g,R)=>{let{resolverId:t,requirements:r}=U;for(let i of r)j(t,i,b,g,R);}:void 0,G&&U?b=>{let{resolverId:g,requirements:R}=U;for(let t of R)G(g,t,b);}:void 0):A,signal:l,snapshot:()=>A.$snapshot(),requeue:()=>{if(p)for(let b of h)p(b);}}}async function S(l,h,D,B){let N=l instanceof Error?l:new Error(String(l));if(B.signal.aborted)return {action:"abort",error:N};if(D.shouldRetry&&!D.shouldRetry(N,h))return {action:"break",error:N};if(h<D.attempts){if(B.signal.aborted)return {action:"abort",error:N};let U=Nt(D,h);if(await new Promise(e=>{let n=setTimeout(e,U),o=()=>{clearTimeout(n),e();};B.signal.addEventListener("abort",o,{once:true});}),B.signal.aborted)return {action:"abort",error:N}}return {action:"continue",error:N}}async function c(l,h,D,B,N,U){if(!l.resolve)return;let e=ae(D),n;v.batch(()=>{n=l.resolve(D.requirement,fe(B,[D.id],e,N,U,{resolverId:h,requirements:[D]}));});let o=l.timeout;if(o&&o>0){await chunkGBCWXTXW_cjs.d(n,o,`Resolver "${h}" timed out after ${o}ms`);return}await n;}function M(l,h,D){let B=Date.now()-D;E.set(h.id,{state:"success",requirementId:h.id,completedAt:Date.now(),duration:B}),V(),k?.(l,h,B);}function F(l,h,D,B){E.set(h.id,{state:"error",requirementId:h.id,error:D,failedAt:Date.now(),attempts:B}),V(),$?.(l,h,D);}function Z(l,h,D){let B=y.get(l);B&&(B.attempt=h,B.status={state:"running",requirementId:l,startedAt:D,attempt:h});}async function re(l,h,D,B,N){let U=await S(l,h,D,B);return U.action==="continue"&&h<D.attempts&&N(h+1),{lastError:U.error,shouldContinue:U.action==="continue"}}async function de(l,h,D,B){let N=a[l];if(!N)return;let U={...ft,...N.retry},e=null,n=y.get(h.id)?.startedAt??Date.now();for(let o=1;o<=U.attempts;o++){if(D.signal.aborted)return;Z(h.id,o,n);try{await c(N,l,h,D.signal,D,B),M(l,h,n);return}catch(b){let g=await re(b,o,U,D,R=>W?.(l,h,R));if(e=g.lastError,!g.shouldContinue)break}}F(l,h,e,U.attempts);}async function pe(l,h,D){return h&&h>0?chunkGBCWXTXW_cjs.d(l,h,D):l}async function ye(l,h,D,B,N,U,e,n){let o;v.batch(()=>{o=l.resolveBatchWithResults(B,N);});let b=await pe(o,U,`Batch resolver "${h}" timed out after ${U}ms`);if(b.length!==D.length)throw new Error(`[Directive] Batch resolver "${h}" returned ${b.length} results but expected ${D.length}. Results array must match input order.`);let g=false;for(let R=0;R<D.length;R++){let t=D[R],r=b[R];if(r.success){M(h,t,e);continue}g=true;let i=r.error??new Error("Batch item failed");E.set(t.id,{state:"error",requirementId:t.id,error:i,failedAt:Date.now(),attempts:n}),$?.(h,t,i);}return !g||D.some((R,t)=>b[t]?.success)?"done":"retry"}async function se(l,h,D,B,N,U,e){let n;v.batch(()=>{n=l.resolveBatch(B,N);}),await pe(n,U,`Batch resolver "${h}" timed out after ${U}ms`);for(let o of D)M(h,o,e);}function he(l,h,D,B){for(let N of h)F(l,N,D,B);}async function we(l,h){await Promise.all(h.map(D=>{let B=new AbortController;return de(l,D,B)}));}async function Re(l,h,D,B,N,U,e,n,o){let b=null;if(D.length>0){let t=D[0];D.every(i=>i.fromConstraint===t.fromConstraint)&&(b=ae(t));}let g=fe(B,D.map(t=>t.id),b,N,o,{resolverId:h,requirements:D}),R=D.map(t=>t.requirement);return l.resolveBatchWithResults?ye(l,h,D,R,g,U,e,n):(await se(l,h,D,R,g,U,e),"done")}function Se(l,h,D){for(let B of h)W?.(l,B,D);}async function ke(l,h,D,B,N,U,e){let n=e??new AbortController,o=Date.now(),b=null;for(let g=1;g<=B.attempts;g++){if(n.signal.aborted)return null;try{if(await Re(l,h,D,n.signal,n,N,o,g,U)==="done")return null}catch(R){let t=await re(R,g,B,n,r=>Se(h,D,r));if(b=t.lastError,!t.shouldContinue)break}}return b}async function ve(l,h,D){let B=a[l];if(!B)return;if(!B.resolveBatch&&!B.resolveBatchWithResults){await we(l,h);return}let N={...ft,...B.retry},e={...gt,...B.batch}.timeoutMs??B.timeout,n=`batch-${oe++}`,o=new AbortController,b={resolverId:l,controller:o,requirementIds:new Set(h.map(R=>R.id))};x.set(n,b);for(let R of h){let t=Y.get(R.id);t||(t=new Set,Y.set(R.id,t)),t.add(n);}let g=null;try{g=await ke(B,l,h,N,e,D,o);}finally{x.delete(n);for(let R of h){let t=Y.get(R.id);t&&(t.delete(n),t.size===0&&Y.delete(R.id));}}g&&he(l,h,g,N.attempts);}let Ae=1e4;function be(l){l.timer&&(clearTimeout(l.timer),l.timer=null);}function _(l){return T.has(l)||T.set(l,{resolverId:l,requirements:[],baselines:[],timer:null}),T.get(l)}function ce(l,h,D){let B=a[l];if(!B)return;let N={...gt,...B.batch},U=_(l),e=N.maxSize||Ae;if(U.requirements.length>=e&&(be(U),ge(l)),U.requirements.push(h),U.baselines.push(D),N.maxSize&&U.requirements.length>=N.maxSize){be(U),ge(l);return}be(U),U.timer=setTimeout(()=>{ge(l);},N.windowMs);}function ge(l){let h=T.get(l);if(!h||h.requirements.length===0)return;let D=[...h.requirements],B;for(let N=h.baselines.length-1;N>=0;N--){let U=h.baselines[N];if(U!==void 0){B=U;break}}h.requirements=[],h.baselines=[],h.timer=null,ve(l,D,B).then(()=>{O?.();});}return {resolve(l,h){if(y.has(l.id))return;let D=J(l.requirement);if(!D){chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] No resolver found for requirement type "${l.requirement.type}" (id: ${l.id})`);return}let B=a[D];if(!B)return;if(B.batch?.enabled){ce(D,l,h?.factsBaseline);return}let N=new AbortController,U=Date.now(),e={requirementId:l.id,resolverId:D,controller:N,startedAt:U,attempt:1,status:{state:"pending",requirementId:l.id,startedAt:U},originalRequirement:l};y.set(l.id,e),m?.(D,l),de(D,l,N,h?.factsBaseline).finally(()=>{y.delete(l.id)&&O?.();});},cancel(l){let h=y.get(l);if(h){h.controller.abort(),y.delete(l),E.set(l,{state:"canceled",requirementId:l,canceledAt:Date.now()}),V(),P?.(h.resolverId,h.originalRequirement);return}for(let B of T.values()){let N=B.requirements.findIndex(U=>U.id===l);if(N!==-1){let[U]=B.requirements.splice(N,1);B.baselines.splice(N,1),E.set(l,{state:"canceled",requirementId:l,canceledAt:Date.now()}),V(),U&&P?.(B.resolverId,U);return}}let D=Y.get(l);if(D&&D.size>0){let B=Array.from(D),N=[];for(let U of B){let e=x.get(U);if(e){e.controller.abort();for(let n of e.requirementIds){E.set(n,{state:"canceled",requirementId:n,canceledAt:Date.now()});let o=Y.get(n);o&&(o.delete(U),o.size===0&&Y.delete(n)),N.push({resolverId:e.resolverId,reqId:n});}x.delete(U);}}V();for(let U of N)P?.(U.resolverId,{id:U.reqId});}},detach(l){y.delete(l);},cancelAll(){let l=[...y.keys()];for(let h of l)this.cancel(h);for(let h of T.values()){h.timer&&clearTimeout(h.timer);for(let D of h.requirements)E.set(D.id,{state:"canceled",requirementId:D.id,canceledAt:Date.now()}),P?.(h.resolverId,D);}T.clear();for(let[,h]of x){h.controller.abort();for(let D of h.requirementIds)E.set(D,{state:"canceled",requirementId:D,canceledAt:Date.now()}),P?.(h.resolverId,{id:D});}x.clear(),Y.clear(),V();},getStatus(l){let h=y.get(l);if(h)return h.status;let D=E.get(l);return D||{state:"idle"}},getInflight(){return [...y.keys()]},getInflightInfo(){return [...y.values()].map(l=>({id:l.requirementId,resolverId:l.resolverId,startedAt:l.startedAt}))},getInflightCount(){return y.size},isResolving(l){return y.has(l)},processBatches(){for(let l of T.keys())ge(l);},hasPendingBatches(){for(let l of T.values())if(l.requirements.length>0)return  true;return  false},registerDefinitions(l){for(let[h,D]of Object.entries(l))a[h]=D;K.clear();},assignDefinition(l,h){if(!a[l])throw new Error(`[Directive] Cannot assign resolver "${l}" \u2014 it does not exist. Use register() to create it.`);a[l]=h,K.clear();},unregisterDefinition(l){if(!a[l])return;for(let[D,B]of y)B.resolverId===l&&(B.controller.abort(),y.delete(D),E.set(D,{state:"canceled",requirementId:D,canceledAt:Date.now()}),P?.(l,B.originalRequirement));let h=T.get(l);if(h){h.timer&&clearTimeout(h.timer);for(let D of h.requirements)E.set(D.id,{state:"canceled",requirementId:D.id,canceledAt:Date.now()}),P?.(l,D);T.delete(l);}delete a[l],K.clear(),V();},async callOne(l,h){let D=a[l];if(!D)throw new Error(`[Directive] Cannot call resolver "${l}" \u2014 it does not exist.`);let B=new AbortController,N=fe(B.signal,[]);if(D.resolve){let U;v.batch(()=>{U=D.resolve(h,N);}),await U;}},destroy(){this.cancelAll(),E.clear(),K.clear();}}}function pt(f){return f.length<=256?f:`${f.slice(0,256)}\u2026[${f.length-256} chars truncated]`}var yt=5e3;function vt(f){return f===void 0?yt:f===Number.POSITIVE_INFINITY?f:!Number.isFinite(f)||f<=0?yt:Math.floor(f)}async function ht(f,a,A){if(a===Number.POSITIVE_INFINITY)return await f;let v=false,q=null,m=new Promise($=>{q=setTimeout(()=>{v=true,A(),$(void 0);},a);}),k=f.catch($=>{if(!v)throw $});try{return await Promise.race([k,m])}finally{q&&clearTimeout(q);}}function Te(){return {publishCount:0,lastPublishAt:null,dropCount:0,lastDropReason:null,lastDropAt:null,errorCount:0,lastError:null,attachedAt:null,detachedAt:null}}function St(f={},a={},A={}){let v=new Map;for(let[O,p]of Object.entries(f))v.set(O,{def:p,moduleId:a[O]??"<unknown>"});let q=[],m="idle",k=null,$=new Set,W=new Map;function P(O,p,y){let E=W.get(O)??Te();E.errorCount+=1,E.lastError={phase:p,message:pt(y.message),at:Date.now()},W.set(O,E);}function j(O,p,y,E){P(O,y,E);let z=E.message.length<=256?E:Object.assign(new Error(pt(E.message)),{name:E.name,stack:E.stack});A.onError?.(O,p,y,z);}function G(O,p,y){let E={id:O,moduleId:p.moduleId,unsubscribe:()=>{},detached:false};W.has(O)||W.set(O,Te());let z=(x,Y)=>{if(E.detached)return;let oe=y(O,p.moduleId,x,Y),K=W.get(O);if(!K)return;let L=Date.now();oe.accepted?(K.publishCount+=1,K.lastPublishAt=L,A.onPublish?.(O,p.moduleId,x)):(K.dropCount+=1,K.lastDropReason=oe.reason,K.lastDropAt=L,A.onDrop?.(O,p.moduleId,x,oe.reason));},T;if(p.def.coalesce==="lastWriteWins"){let x=new Map,Y=false;T=(oe,K)=>{if(!E.detached){if(x.has(oe)){let L=W.get(O);L&&(L.dropCount+=1,L.lastDropReason="coalesced",L.lastDropAt=Date.now()),A.onDrop?.(O,p.moduleId,oe,"coalesced");}x.set(oe,K),Y||(Y=true,queueMicrotask(()=>{if(Y=false,E.detached){x.clear();return}let L=Array.from(x);x.clear();for(let[V,s]of L)z(V,s);}));}};}else T=z;try{let x=K=>{if(E.detached)return;let L=K instanceof Error?K:new Error(String(K));j(O,p.moduleId,"runtime",L);},Y=p.def.attach(T,x);if(typeof Y!="function"){let K=Y!==null&&typeof Y=="object"&&typeof Y.then=="function",L=new Error(K?`[Directive] Module "${p.moduleId}" \u2192 Source "${O}" attach() returned a Promise. attach() must be synchronous; rewrite as \`attach: (publish) => { ... return () => unsubscribe(); }\`. Do any async work inside the subscription's own internals \u2014 the cleanup function must be registered immediately so \`system.stop()\` can tear the source down.`:`[Directive] Module "${p.moduleId}" \u2192 Source "${O}" did not return an unsubscribe function from attach(). Every source must return a cleanup function (e.g. \`return () => undefined\`) so the system can tear it down at stop(). If the source needs no teardown, return \`() => undefined\`, not \`undefined\`.`);console.error(L),j(O,p.moduleId,"attach",L);return}E.unsubscribe=Y,q.push(E),$.add(O);let oe=W.get(O);oe&&(oe.attachedAt=Date.now(),oe.detachedAt=null),A.onAttach?.(O,p.moduleId);}catch(x){let Y=x instanceof Error?x:new Error(String(x));console.error(`[Directive] Module "${p.moduleId}" \u2192 Source "${O}" attach() threw:`,Y),j(O,p.moduleId,"attach",Y);}}return {registerDefinitions(O,p){for(let[y,E]of Object.entries(p)){if(m==="attached"&&$.has(y)){for(let z=0;z<q.length;z++){let T=q[z];if(!T||T.detached||T.id!==y)continue;T.detached=true,A.onDetach?.(T.id,T.moduleId);let x=W.get(T.id)??Te();x.detachedAt=Date.now(),W.set(T.id,x);try{T.unsubscribe();}catch(Y){let oe=Y instanceof Error?Y:new Error(String(Y));console.error(`[Directive] Module "${T.moduleId}" \u2192 Source "${T.id}" unsubscribe threw during re-registration:`,oe),j(T.id,T.moduleId,"cleanup",oe);}q.splice(z,1);break}$.delete(y);}v.set(y,{def:E,moduleId:O}),m==="attached"&&k&&!$.has(y)&&G(y,{def:E,moduleId:O},k);}},attachAll(O){q=[],$=new Set,W.clear(),k=O,m="attached";for(let[p,y]of v)G(p,y,O);},cleanupAll(){if(m==="attached"){m="stopped";for(let O=q.length-1;O>=0;O--){let p=q[O];if(!p||p.detached)continue;p.detached=true,A.onDetach?.(p.id,p.moduleId);let y=W.get(p.id)??Te();y.detachedAt=Date.now(),W.set(p.id,y);try{p.unsubscribe();}catch(E){let z=E instanceof Error?E:new Error(String(E));console.error(`[Directive] Module "${p.moduleId}" \u2192 Source "${p.id}" unsubscribe threw:`,z),j(p.id,p.moduleId,"cleanup",z);}}q=[],$=new Set,k=null;}},async cleanupAllAsync(){if(m==="attached"){m="stopped";for(let O=q.length-1;O>=0;O--){let p=q[O];if(!p||p.detached)continue;p.detached=true,A.onDetach?.(p.id,p.moduleId);let y=W.get(p.id)??Te();y.detachedAt=Date.now(),W.set(p.id,y);let E=v.get(p.id)?.def,z=vt(E?.evictTimeoutMs);try{await ht(Promise.resolve(p.unsubscribe()),z,()=>{let T=new Error(`[Directive] Module "${p.moduleId}" \u2192 Source "${p.id}" unsubscribe exceeded ${z}ms timeout; abandoning to unblock teardown.`);console.error(T.message),j(p.id,p.moduleId,"cleanup",T);});}catch(T){let x=T instanceof Error?T:new Error(String(T));console.error(`[Directive] Module "${p.moduleId}" \u2192 Source "${p.id}" unsubscribe threw:`,x),j(p.id,p.moduleId,"cleanup",x);}}q=[],$=new Set,k=null;}},async evictAll(){if(m==="attached")for(let O of q){if(O.detached)continue;let p=v.get(O.id)?.def;if(!p?.onEvict)continue;let y=vt(p.evictTimeoutMs);try{await ht(Promise.resolve(p.onEvict()),y,()=>{let E=new Error(`[Directive] Module "${O.moduleId}" \u2192 Source "${O.id}" onEvict exceeded ${y}ms timeout; abandoning so downstream sources still get evicted.`);console.error(E.message),j(O.id,O.moduleId,"runtime",E);});}catch(E){let z=E instanceof Error?E:new Error(String(E));console.error(`[Directive] Module "${O.moduleId}" \u2192 Source "${O.id}" onEvict threw:`,z),j(O.id,O.moduleId,"runtime",z);}}},attachedCount(){return q.filter(O=>!O.detached).length},listDefinitions(){let O=[];for(let[p,y]of v){let E=W.get(p)??Te();O.push({id:p,moduleId:y.moduleId,meta:y.def.meta,attached:$.has(p),publishCount:E.publishCount,lastPublishAt:E.lastPublishAt,dropCount:E.dropCount,lastDropReason:E.lastDropReason,lastDropAt:E.lastDropAt,errorCount:E.errorCount,lastError:E.lastError,attachedAt:E.attachedAt,detachedAt:E.detachedAt});}return O}}}function bt(f){let{mergedDerive:a,getDerivation:A,definitions:v}=f,q={register:(m,k)=>v.register("derivation",m,k),assign:(m,k)=>v.assign("derivation",m,k),unregister:m=>v.unregister("derivation",m),call:m=>v.call("derivation",m),isDynamic:m=>v.isDynamic("derivation",m),listDynamic:()=>v.listDynamic("derivation")};return new Proxy({},{get(m,k){if(typeof k!="symbol"&&!chunkGKMJ7NMP_cjs.k.has(k)){if(k in q)return q[k];if(k in a)return A(k)}},has(m,k){return typeof k=="symbol"||chunkGKMJ7NMP_cjs.k.has(k)?false:k in a||k in q},ownKeys(){return Object.keys(a)},getOwnPropertyDescriptor(m,k){if(typeof k!="symbol"&&!chunkGKMJ7NMP_cjs.k.has(k)&&(k in a||k in q))return {configurable:true,enumerable:true}},set(){return  false},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}})}function Rt(f){let{mergedEvents:a,dispatchEvent:A}=f;return new Proxy({},{get(v,q){if(typeof q!="symbol"&&!chunkGKMJ7NMP_cjs.k.has(q))return m=>{A(q,m);}},has(v,q){return typeof q=="symbol"||chunkGKMJ7NMP_cjs.k.has(q)?false:q in a},ownKeys(){return Object.keys(a)},getOwnPropertyDescriptor(v,q){if(typeof q!="symbol"&&!chunkGKMJ7NMP_cjs.k.has(q)&&q in a)return {configurable:true,enumerable:true}},set(){return  false},defineProperty(){return  false},getPrototypeOf(){return null},setPrototypeOf(){return  false}})}var Lt=new Set(["register","assign","unregister","call","isDynamic","listDynamic"]);function Dt(f){let{mergedConstraints:a,mergedResolvers:A,mergedDerive:v,mergedEffects:q,constraintsManager:m,resolversManager:k,derivationsManager:$,effectsManager:W,pluginManager:P,getState:j,scheduleReconcile:G,maxDeferredRegistrations:O}=f,p={constraints:new Set,resolvers:new Set,derivations:new Set,effects:new Set},y={constraints:new Map,resolvers:new Map,derivations:new Map,effects:new Map},E=[];function z(s){if(Lt.has(s))throw new Error(`[Directive] Derivation ID "${s}" conflicts with a reserved derive method name.`)}let T={constraint:{label:"Constraint",mergedMap:a,manager:m,dynamicSet:p.constraints,originalsMap:y.constraints,reconciles:true},resolver:{label:"Resolver",mergedMap:A,manager:k,dynamicSet:p.resolvers,originalsMap:y.resolvers,reconciles:true},derivation:{label:"Derivation",mergedMap:v,manager:$,dynamicSet:p.derivations,originalsMap:y.derivations,reconciles:false,validateId:z},effect:{label:"Effect",mergedMap:q,manager:W,dynamicSet:p.effects,originalsMap:y.effects,reconciles:false}};function x(s){if(typeof s!="string"||s.length===0)throw new Error(`[Directive] Definition ID must be a non-empty string. Received: ${String(s)}`);if(chunkGKMJ7NMP_cjs.k.has(s))throw new Error(`[Directive] Security: Definition ID "${s}" is a blocked property.`);if(s.includes("::"))throw new Error(`[Directive] Definition ID "${s}" cannot contain "::". This separator is reserved for namespacing.`)}function Y(s,u,d){let C=T[s];if(C.validateId?.(u),u in C.mergedMap)throw new Error(`[Directive] ${C.label} "${u}" already exists. Use assign() to override.`);if(s!=="derivation"){let H=d;H.meta&&(H.meta=me(H.meta));}C.mergedMap[u]=d,C.manager.registerDefinitions({[u]:d}),C.dynamicSet.add(u),P.emitDefinitionRegister(s,u,d),C.reconciles&&G();}function oe(s,u,d){let C=T[s];if(C.validateId?.(u),!(u in C.mergedMap))throw new Error(`[Directive] ${C.label} "${u}" does not exist. Use register() to create it.`);if(s!=="derivation"){let J=d;J.meta&&(J.meta=me(J.meta));}let H=C.mergedMap[u];C.manager.assignDefinition(u,d),C.originalsMap.set(u,H),C.mergedMap[u]=d,P.emitDefinitionAssign(s,u,d,H),C.reconciles&&G();}function K(s,u){let d=T[s];if(!d.dynamicSet.has(u)){chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] Cannot unregister static ${s} "${u}". Only dynamically registered ${s}s can be removed.`);return}d.manager.unregisterDefinition(u),delete d.mergedMap[u],d.dynamicSet.delete(u),d.originalsMap.delete(u),P.emitDefinitionUnregister(s,u),d.reconciles&&G();}function L(){if(E.length===0)return;let s=E.splice(0);for(let u of s)try{switch(u.op){case "register":Y(u.type,u.id,u.def);break;case "assign":oe(u.type,u.id,u.def);break;case "unregister":K(u.type,u.id);break}}catch(d){chunkGBCWXTXW_cjs.a&&console.error(`[Directive] Error in deferred ${u.op} for ${u.type} "${u.id}":`,d);}}function V(s,u,d,C){let{isDestroyed:H,isReconciling:J}=j();if(H)throw new Error(`[Directive] Cannot ${s} ${u} "${d}" on a destroyed system.`);if(x(d),J){if(E.length>=O)throw new Error(`[Directive] Too many deferred registrations (max ${O}). Avoid calling register/assign/unregister in resolver or effect callbacks during reconciliation.`);s==="unregister"?E.push({op:s,type:u,id:d}):E.push({op:s,type:u,id:d,def:C});return}switch(s){case "register":Y(u,d,C);break;case "assign":oe(u,d,C);break;case "unregister":K(u,d);break}}return {register(s,u,d){V("register",s,u,d);},assign(s,u,d){V("assign",s,u,d);},unregister(s,u){V("unregister",s,u);},call(s,u,d){let{isDestroyed:C}=j();if(C)throw new Error(`[Directive] Cannot call ${s} "${u}" on a destroyed system.`);switch(x(u),P.emitDefinitionCall(s,u,d),s){case "constraint":return m.callOne(u,d);case "resolver":return k.callOne(u,d);case "derivation":return $.callOne(u);case "effect":return W.callOne(u)}},isDynamic(s,u){switch(s){case "constraint":return p.constraints.has(u);case "resolver":return p.resolvers.has(u);case "derivation":return p.derivations.has(u);case "effect":return p.effects.has(u)}},listDynamic(s){switch(s){case "constraint":return [...p.constraints];case "resolver":return [...p.resolvers];case "derivation":return [...p.derivations];case "effect":return [...p.effects]}},flushDeferred:L,getOriginal(s,u){let C={constraint:y.constraints,resolver:y.resolvers,derivation:y.derivations,effect:y.effects}[s];if(C)return C.get(u)},restoreOriginal(s,u){let C={constraint:y.constraints,resolver:y.resolvers,derivation:y.derivations,effect:y.effects}[s];if(!C||!C.has(u))return  false;let H=C.get(u);return V("assign",s,u,H),C.delete(u),true},destroy(){E.length=0,p.constraints.clear(),p.resolvers.clear(),p.derivations.clear(),p.effects.clear(),y.constraints.clear(),y.resolvers.clear(),y.derivations.clear(),y.effects.clear();}}}function wt(f){let{traceConfig:a,pluginManager:A,resolverMetaLookup:v}=f;if(!(a===true||typeof a=="object"&&a!==null))return {enabled:false,recordFactChange(){},startRun(){return 0},currentTrace:null,getEntries(){return null},attributeResolverStart(){},recordResolverComplete(){},recordResolverError(){},decrementInflight(){},finalizeCurrentRun(){},drainPendingChanges(){},destroy(){}};let m=(typeof a=="object"&&a!==null?a.maxRuns:void 0)??100,k=[],$=new Map,W=0,P=null,j=[],G=new Map,O=new Map,p=new Map,y=null,E=0,z=0,T={count:0,totalDuration:0,avgDuration:0,maxDuration:0,avgResolverCount:0,totalResolverCount:0,avgFactChangeCount:0,totalFactChangeCount:0};function x(d){let C=$.get(d);if(C&&C.status==="pending"){C.status="settled";let H=p.get(d);C.duration=H!==void 0?performance.now()-H:Date.now()-C.timestamp,p.delete(d),O.delete(d),C.causalChain=K(C),L(C),z++,A.emitTraceComplete(C);}}function Y(d){let C=G.get(d);if(G.delete(d),C!==void 0){let H=(O.get(C)??1)-1;H<=0?x(C):O.set(C,H);}}function oe(){let d=k.shift();if(d&&($.delete(d.id),p.delete(d.id),d.status==="pending")){O.delete(d.id);for(let[C,H]of G)H===d.id&&G.delete(C);}}function K(d){let C=[];for(let H of d.factChanges)C.push(`${H.key} changed`);for(let H of d.derivationsRecomputed)C.push(`${H.id} recomputed`);for(let H of d.constraintsHit)C.push(`${H.id} constraint hit`);for(let H of d.requirementsAdded)C.push(`${H.type} requirement added`);for(let H of d.resolversCompleted)C.push(`${H.resolver} resolved (${H.duration.toFixed(0)}ms)`);for(let H of d.resolversErrored)C.push(`${H.resolver} errored`);for(let H of d.effectsRun)C.push(`${H.id} effect ran`);return C.join(" \u2192 ")}function L(d){T.count++,T.totalDuration+=d.duration,T.avgDuration=T.totalDuration/T.count,d.duration>T.maxDuration&&(T.maxDuration=d.duration);let C=d.resolversStarted.length;T.totalResolverCount+=C,T.avgResolverCount=T.totalResolverCount/T.count;let H=d.factChanges.length;T.totalFactChangeCount+=H,T.avgFactChangeCount=T.totalFactChangeCount/T.count;let J=[];T.count>3&&d.duration>T.avgDuration*5&&J.push(`Duration ${d.duration.toFixed(0)}ms is 5x+ above average (${T.avgDuration.toFixed(0)}ms)`),d.resolversErrored.length>0&&J.push(`${d.resolversErrored.length} resolver(s) errored`),J.length>0&&(d.anomalies=J);}function V(d){k.push(d),$.set(d.id,d),k.length>m&&oe(),z++;}function s(d){return d.factChanges.length>0||d.constraintsHit.length>0||d.requirementsAdded.length>0||d.effectsRun.length>0}return {enabled:true,get currentTrace(){return P},set currentTrace(d){P=d;},recordFactChange(d,C,H){j.push({key:d,oldValue:C,newValue:H});},startRun(){let d=performance.now(),C=++W;return p.set(C,d),P={id:C,timestamp:Date.now(),duration:0,status:"pending",factChanges:j.splice(0),derivationsRecomputed:[],constraintsHit:[],requirementsAdded:[],requirementsRemoved:[],resolversStarted:[],resolversCompleted:[],resolversErrored:[],effectsRun:[],effectErrors:[]},d},getEntries(){return (!y||E!==z)&&(y=[...k],E=z),y},attributeResolverStart(d){P&&G.set(d,P.id);},recordResolverComplete(d,C,H){let J=G.get(d);if(J!==void 0){let ae=$.get(J);ae&&ae.resolversCompleted.push({resolver:C,requirementId:d,duration:H,meta:v?.(C)});}},recordResolverError(d,C,H){let J=G.get(d);if(J!==void 0){let ae=$.get(J);ae&&ae.resolversErrored.push({resolver:C,requirementId:d,error:H,meta:v?.(C)});}},decrementInflight(d){Y(d);},finalizeCurrentRun(d){if(!P)return;if(P.duration=performance.now()-d,!s(P)){p.delete(P.id),P=null;return}let C=P.resolversStarted.length;C===0?(P.status="settled",P.causalChain=K(P),L(P),V(P),A.emitTraceComplete(P)):(P.status="pending",V(P),O.set(P.id,C)),P=null;},drainPendingChanges(){j.length=0;},destroy(){k.length=0,$.clear(),G.clear(),O.clear(),p.clear(),j.length=0,P=null,y=null;}}}function kt(f,a){for(let[A,v]of Object.entries(f)){if(typeof v!="object"||v===null)continue;let q=Object.hasOwn(v,"handler"),m=Object.hasOwn(v,"patch");if(q&&m&&chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] event "${A}": both \`handler\` and \`patch\` provided \u2014 using \`handler\` (patch is ignored).`),q){let k=v;if(f[A]=k.handler,k.meta){let $=me(k.meta);$&&a.set(A,$);}continue}if(m){let k=v,$=k.patch;if(chunkGBCWXTXW_cjs.b($),f[A]=(W,P)=>chunkGACC2DMS_cjs.v($,W,P??{}),k.meta){let W=me(k.meta);W&&a.set(A,W);}}}}function sr(f){let a=Object.create(null),A=Object.create(null),v=Object.create(null),q=Object.create(null),m=Object.create(null),k=Object.create(null),$=Object.create(null),W=Object.create(null),P=new Map,j=new Map,G=new Map,O=new Map,p=new Map;for(let e of f.modules){let n=(b,g)=>{if(b)for(let R of Object.keys(b)){if(chunkGKMJ7NMP_cjs.k.has(R))throw new Error(`[Directive] Security: Module "${e.id}" has dangerous key "${R}" in ${g}. This could indicate a prototype pollution attempt.`);if(g==="schema"&&R.startsWith("$"))throw new Error(`[Directive] Module "${e.id}" has schema key "${R}" starting with "$". Keys starting with $ are reserved for internal accessors ($store, $snapshot).`)}};n(e.schema,"schema"),n(e.events,"events"),n(e.derive,"derive"),n(e.effects,"effects"),n(e.sources,"sources"),n(e.constraints,"constraints"),n(e.resolvers,"resolvers");for(let b of Object.keys(e.schema)){let g=G.get(b);if(g)throw new Error(`[Directive] Schema collision: Fact "${b}" is defined in both module "${g}" and "${e.id}". Use namespacing (e.g., "${e.id}::${b}") or merge into one module.`);G.set(b,e.id);}let o=(b,g)=>{if(b)for(let R of Object.keys(b)){let t=O.get(R);if(t&&t!==e.id)throw new Error(`[Directive] Definition collision: ${g} "${R}" is defined in both module "${t}" and "${e.id}". Use namespacing or rename to avoid conflicts.`);O.set(R,e.id);}};o(e.derive,"derivation"),o(e.effects,"effect"),o(e.sources,"source"),o(e.constraints,"constraint"),o(e.resolvers,"resolver"),o(e.events,"event"),Object.assign(a,e.schema),e.events&&(kt(e.events,j),Object.assign(A,e.events)),e.derive&&Object.assign(v,e.derive),e.effects&&Object.assign(q,e.effects);{let b=e.sources;if(b){Object.assign(m,b);for(let g of Object.keys(b))k[g]=e.id;}}if(e.constraints&&Object.assign($,e.constraints),e.resolvers){Object.assign(W,e.resolvers);for(let b of Object.keys(e.resolvers))p.set(b,e);}if(e.meta){let b=me(e.meta);b&&P.set(e.id,b);}}for(let e of Object.values($))e.meta&&(e.meta=me(e.meta));for(let e of Object.values(W))e.meta&&(e.meta=me(e.meta));for(let e of Object.values(q)){let n=e;n.meta&&(n.meta=me(n.meta));}for(let e of Object.values(a)){let n=e;n._meta&&(n._meta=me(n._meta));}let y=null;if(f.modules.some(e=>e.history?.snapshotEvents)){y=new Set;for(let e of f.modules){let n=e;if(n.history?.snapshotEvents)for(let o of n.history.snapshotEvents)y.add(o);else if(n.events)for(let o of Object.keys(n.events))y.add(o);}}let z=0,T=false;if(chunkGBCWXTXW_cjs.a){let e=new Set(Object.keys(v));for(let n of Object.keys(a))e.has(n)&&console.warn(`[Directive] "${n}" exists as both a fact and a derivation. This may cause unexpected dependency tracking behavior.`);}let x=lt();for(let e of f.plugins??[])x.register(e);let Y=x.getPlugins().length>0,oe=0,K=x.register.bind(x),L=x.unregister.bind(x);x.register=e=>{K(e),Y=true;},x.unregister=e=>{L(e),Y=x.getPlugins().length>0;};let V=()=>Y,s=ct({config:f.errorBoundary,onError:e=>x.emitError(e),onRecovery:(e,n)=>x.emitErrorRecovery(e,n)}),u=null,d=()=>{},C=()=>{},H=null,J=wt({traceConfig:f.trace,pluginManager:x,resolverMetaLookup:e=>W[e]?.meta}),ae=J.enabled,{store:ne,facts:fe}=dt({schema:a,onChange:(e,n,o)=>{x.emitFactSet(e,n,o),d(e),ae&&J.recordFactChange(String(e),o,n),!H?.isRestoring&&(z===0&&(T=true),_.changedKeys.add(e),ge());},onBatch:e=>{x.emitFactsBatch(e);let n=[];for(let o of e)n.push(o.key);if(ae)for(let o of e)J.recordFactChange(o.key,o.prev,o.type==="delete"?void 0:o.value);if(C(n),!H?.isRestoring){z===0&&(T=true);for(let o of e)_.changedKeys.add(o.key);ge();}}}),S=st({definitions:v,facts:fe,onCompute:(e,n,o,b)=>{V()&&x.emitDerivationCompute(e,n,b),J.currentTrace&&J.currentTrace.derivationsRecomputed.push({id:e,deps:b?[...b]:[],oldValue:o,newValue:n,meta:S.getMeta(e)});},onInvalidate:e=>{V()&&x.emitDerivationInvalidate(e);},onError:(e,n)=>{s.handleError("derivation",e,n)==="retry"&&S.invalidate(e);}});d=e=>S.invalidate(e),C=e=>S.invalidateMany(e);let c=at({definitions:q,facts:fe,store:ne,onRun:(e,n)=>{V()&&x.emitEffectRun(e),J.currentTrace&&J.currentTrace.effectsRun.push({id:e,triggeredBy:n,meta:q[e]?.meta});},onError:(e,n)=>{let o=s.handleError("effect",e,n);V()&&x.emitEffectError(e,n),J.currentTrace&&J.currentTrace.effectErrors.push({id:e,error:String(n),meta:q[e]?.meta}),o==="disable"&&c.disable(e),o==="retry"&&(_.changedKeys.add("*"),ge());}}),M=St(m,k,{onAttach:(e,n)=>{V()&&x.emitSourceAttach(e,n);},onPublish:(e,n,o)=>{V()&&x.emitSourcePublish(e,n,o);},onDrop:(e,n,o,b)=>{V()&&x.emitSourceDrop(e,n,o,b);},onDetach:(e,n)=>{V()&&x.emitSourceDetach(e,n);},onError:(e,n,o,b)=>{V()&&x.emitSourceError(e,n,o,b);}});function F(e){if(Array.isArray(e)){let n=e;return o=>chunkGACC2DMS_cjs.u(n,o)}return e}let Z=Object.create(null);for(let e of Object.values(W))e.key&&typeof e.requirement=="string"&&(Z[e.requirement]=F(e.key));let re=it({definitions:$,facts:fe,requirementKeys:Z,onEvaluate:(e,n)=>{if(V()){let o=re.explainWhen(e);x.emitConstraintEvaluate(e,n,o);}},onError:(e,n)=>{let o=s.handleError("constraint",e,n);V()&&x.emitConstraintError(e,n),o==="disable"&&re.disable(e);}});function de(e){for(let n of Object.values(e))n.key&&typeof n.requirement=="string"&&re.setRequirementKey(n.requirement,F(n.key));}function pe(e){let n=$[e];if(!n?.owns||n.owns.length===0)return;let o=re.getState(e);if(o?.isAsync||n.async){chunkGBCWXTXW_cjs.a&&(o?.isAsync&&!n.async?console.warn(`[Directive] constraint '${e}': owns binding disabled because when() returned a Promise \u2014 convert to a synchronous when, mark the constraint async: true and accept the binding being off, or use a data-form when (always sync).`):console.warn(`[Directive] Constraint "${e}" has \`owns\` but is async. Binding is disabled \u2014 async constraints cannot be bound.`));return}return {fields:n.owns}}let ye=new Set,se=mt({definitions:W,facts:fe,store:ne,getConstraintBinding:pe,onStart:(e,n)=>{V()&&x.emitResolverStart(e,n);},onComplete:(e,n,o)=>{s.clearRetryAttempts(e),V()&&(x.emitResolverComplete(e,n,o),x.emitRequirementMet(n,e)),re.markResolved(n.fromConstraint),ae&&(J.recordResolverComplete(n.id,e,o),J.decrementInflight(n.id));},onError:(e,n,o)=>{let b=s.handleError("resolver",e,o,n);if(V()&&x.emitResolverError(e,n,o),b==="disable"&&re.disable(n.fromConstraint),b==="retry"&&(_.previousRequirements.remove(n.id),ge()),b==="retry-later"){let r=s.getRetryLaterManager().getPendingRetries().find(i=>i.sourceId===e);r&&!r.callback&&(r.callback=()=>{ge();});}ae&&(J.recordResolverError(n.id,e,String(o)),J.decrementInflight(n.id));let g=p.get(e),R=g?.hooks?.onResolverError;if(R){let t=o instanceof Error?o:new Error(String(o));try{R(t,n.requirement,{facts:fe});}catch(r){console.error(`[Directive] onResolverError hook for module "${g?.id}" threw:`,r);}}},onRetry:(e,n,o)=>x.emitResolverRetry(e,n,o),onCancel:(e,n)=>{x.emitResolverCancel(e,n),x.emitRequirementCanceled(n),ae&&J.decrementInflight(n.id);},onClobber:(e,n,o,b,g)=>{V()&&x.emitResolverWriteRejected({kind:"rejection",resolver:e,req:n,reason:"clobbered",fact:o,expected:b,actual:g});},onClobberSuppressed:(e,n,o)=>{V()&&x.emitResolverWriteRejected({kind:"summary",resolver:e,req:n,reason:"clobbered",dropped:o});},onResolutionComplete:()=>{ke(),ge();},onRequeue:e=>{ye.add(e);}}),he=new Set;function we(){for(let e of he)e();}let Re=f.history?nt({historyOption:f.history,facts:fe,store:ne,onSnapshot:e=>{x.emitSnapshot(e),we();},onHistoryChange:(e,n)=>{x.emitHistoryNavigate(e,n),we();}}):rt();H=Re;let Se=new Set;function ke(){for(let e of Se)e();}let ve=50,Ae=100,be=0,_={isRunning:false,isReconciling:false,reconcileScheduled:false,isInitializing:false,isInitialized:false,isReady:false,isDestroyed:false,isEvicting:false,changedKeys:new Set,previousRequirements:new Ee,readyPromise:null,readyResolve:null},ce=Dt({mergedConstraints:$,mergedResolvers:W,mergedDerive:v,mergedEffects:q,constraintsManager:re,resolversManager:se,derivationsManager:S,effectsManager:c,pluginManager:x,getState:()=>_,scheduleReconcile:ge,maxDeferredRegistrations:Ae});function ge(){!_.isRunning||_.reconcileScheduled||_.isInitializing||(_.reconcileScheduled=true,ke(),queueMicrotask(()=>{_.reconcileScheduled=false,_.isRunning&&!_.isInitializing&&Be().catch(e=>{chunkGBCWXTXW_cjs.a&&console.error("[Directive] Unexpected error in reconcile:",e);});}));}async function Be(){if(_.isReconciling)return;if(be++,be>ve){chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] Reconcile loop exceeded ${ve} iterations. This usually means resolvers are creating circular requirement chains. Check that resolvers aren't mutating facts that re-trigger their own constraints.`),ae&&J.drainPendingChanges(),_.previousRequirements=new Ee,be=0;return}_.isReconciling=true,ke();let e=ae?J.startRun():0,n=J.currentTrace;if(n)for(let o of n.factChanges){let b=a[o.key];o.meta=b?._meta;}try{if(_.changedKeys.size>0){if(y===null||T){let w=_.changedKeys,X=w.size<=5?`facts-changed:${[...w].join(",")}`:`facts-changed:${[...w].slice(0,5).join(",")}+${w.size-5}more`;Re.takeSnapshot(X);}T=!1;}let o=fe.$snapshot();x.emitReconcileStart(o),await c.runEffects(_.changedKeys);let b=new Set(_.changedKeys);_.changedKeys.clear();let g=await re.evaluate(b),R=new Ee;for(let w of g)R.add(w),x.emitRequirementCreated(w);if(n){let w=new Set(g.map(X=>X.fromConstraint));for(let X of w){let Q=re.getState(X);if(Q){let te=re.getDependencies(X);n.constraintsHit.push({id:X,priority:Q.priority,deps:te?[...te]:[],meta:$[X]?.meta});}}}let{added:t,removed:r}=R.diff(_.previousRequirements);if(n){for(let w of t)n.requirementsAdded.push({id:w.id,type:w.requirement.type,fromConstraint:w.fromConstraint});for(let w of r)n.requirementsRemoved.push({id:w.id,type:w.requirement.type,fromConstraint:w.fromConstraint});}for(let w of r)(w.fromConstraint?pe(w.fromConstraint):void 0)?se.detach(w.id):se.cancel(w.id);let i;if(t.length>0){let w=new Set;for(let X of t){if(!X.fromConstraint)continue;let Q=pe(X.fromConstraint);if(Q)for(let te of Q.fields)w.add(te);}if(w.size>0){i=Object.create(null);for(let X of w)i[X]=ne.get(X);}}for(let w of t)se.resolve(w,{factsBaseline:i});if(n){let w=se.getInflightInfo(),X=new Map(w.map(Q=>[Q.id,Q]));for(let Q of t){let ee=X.get(Q.id)?.resolverId??"unknown";n.resolversStarted.push({resolver:ee,requirementId:Q.id,meta:W[ee]?.meta}),J.attributeResolverStart(Q.id);}}if(_.previousRequirements=R,ye.size>0){for(let w of ye)_.previousRequirements.remove(w);ye.clear(),ge();}let I=se.getInflightInfo();if(f.plugins&&f.plugins.length>0){let w=r.length>0?new Map(I.map(Q=>[Q.id,Q.resolverId])):void 0,X={unmet:g.filter(Q=>!se.isResolving(Q.id)),inflight:I,completed:[],canceled:r.map(Q=>({id:Q.id,resolverId:w?.get(Q.id)??"unknown"}))};x.emitReconcileEnd(X);}_.isReady||(_.isReady=!0,_.readyResolve&&(_.readyResolve(),_.readyResolve=null));}finally{ae&&J.finalizeCurrentRun(e),_.isReconciling=false,ce.flushDeferred(),be=0,_.changedKeys.size>0&&ge(),ke();}}function l(e,n){let o=A[e];if(o){z++,(y===null||y.has(e))&&(T=true);try{ne.batch(()=>{o(fe,{type:e,...n});});}finally{z--;}}else chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] Unknown event type "${e}". No handler is registered for this event. Available events: ${Object.keys(A).join(", ")||"(none)"}`);}let h=bt({mergedDerive:v,getDerivation:e=>S.get(e),definitions:ce}),D=Rt({mergedEvents:A,dispatchEvent:l});function B(){let e=[];for(let[n,o]of P)e.push({type:"module",id:n,meta:o});for(let n of Object.keys(a)){let o=a[n]?._meta;o&&e.push({type:"fact",id:n,meta:o});}for(let[n,o]of j)e.push({type:"event",id:n,meta:o});for(let[n,o]of Object.entries($))o.meta&&e.push({type:"constraint",id:n,meta:o.meta});for(let[n,o]of Object.entries(W))o.meta&&e.push({type:"resolver",id:n,meta:o.meta});for(let[n,o]of Object.entries(q)){let b=o.meta;b&&e.push({type:"effect",id:n,meta:b});}for(let n of Object.keys(v)){let o=S.getMeta(n);o&&e.push({type:"derivation",id:n,meta:o});}return e}let N={facts:fe,history:Re.isEnabled?Re:null,derive:h,events:D,constraints:{disable:e=>re.disable(e),enable:e=>re.enable(e),isDisabled:e=>re.isDisabled(e),register:(e,n)=>{ce.register("constraint",e,n);},assign:(e,n)=>{ce.assign("constraint",e,n);},unregister:e=>{ce.unregister("constraint",e);},call:(e,n)=>ce.call("constraint",e,n),isDynamic:e=>ce.isDynamic("constraint",e),listDynamic:()=>ce.listDynamic("constraint")},effects:{disable:e=>c.disable(e),enable:e=>c.enable(e),isEnabled:e=>c.isEnabled(e),register:(e,n)=>{ce.register("effect",e,n);},assign:(e,n)=>{ce.assign("effect",e,n);},unregister:e=>{ce.unregister("effect",e);},call:e=>ce.call("effect",e),isDynamic:e=>ce.isDynamic("effect",e),listDynamic:()=>ce.listDynamic("effect")},resolvers:{register:(e,n)=>{ce.register("resolver",e,n),de({[e]:n});},assign:(e,n)=>{ce.assign("resolver",e,n),de({[e]:n});},unregister:e=>{let n=W[e];n?.key&&typeof n.requirement=="string"&&re.removeRequirementKey(n.requirement),ce.unregister("resolver",e);},call:(e,n)=>ce.call("resolver",e,n),isDynamic:e=>ce.isDynamic("resolver",e),listDynamic:()=>ce.listDynamic("resolver")},get trace(){return J.getEntries()},meta:{module(e){return P.get(e)},fact(e){return a[e]?._meta},event(e){return j.get(e)},constraint(e){return $[e]?.meta},resolver(e){return W[e]?.meta},effect(e){return q[e]?.meta},derivation(e){return S.getMeta(e)},byCategory(e){return B().filter(n=>n.meta.category===e)},byTag(e){return B().filter(n=>n.meta.tags?.includes(e))}},notify:{guardrailBlocked(e,n,o,b,g){if(_.isDestroyed||!V()||oe>=4)return;if(!x.getPlugins().some(t=>t.name===e)){chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] system.notify.guardrailBlocked called with unknown plugin "${e}". Event dropped.`);return}oe+=1;try{x.emitGuardrailBlocked(e,n,o,b,g);}finally{oe-=1;}}},observe(e){if(x.getPlugins().filter(g=>g.name.startsWith("__observer_")).length>=100)return chunkGBCWXTXW_cjs.a&&console.warn("[Directive] Maximum observer limit (100) reached. Call the unsubscribe function returned by observe() to clean up."),()=>{};let o=`__observer_${Date.now()}_${Math.random().toString(36).slice(2)}`,b={name:o,onInit:()=>e({type:"system.init"}),onStart:()=>e({type:"system.start"}),onStop:()=>e({type:"system.stop"}),onDestroy:()=>e({type:"system.destroy"}),onFactSet:(g,R,t)=>e({type:"fact.change",key:g,prev:t,next:R}),onConstraintEvaluate:(g,R,t)=>{e(t?{type:"constraint.evaluate",id:g,active:R,whenExplain:t}:{type:"constraint.evaluate",id:g,active:R});},onConstraintError:(g,R)=>e({type:"constraint.error",id:g,error:R}),onRequirementCreated:g=>e({type:"requirement.created",id:g.id,requirementType:g.requirement.type}),onRequirementMet:(g,R)=>e({type:"requirement.met",id:g.id,byResolver:R}),onRequirementCanceled:g=>e({type:"requirement.canceled",id:g.id}),onResolverStart:(g,R)=>e({type:"resolver.start",resolver:g,requirementId:R.id}),onResolverComplete:(g,R,t)=>e({type:"resolver.complete",resolver:g,requirementId:R.id,duration:t}),onResolverError:(g,R,t)=>e({type:"resolver.error",resolver:g,requirementId:R.id,error:t}),onResolverWriteRejected:g=>{if(g.kind==="summary"){e({type:"resolver.write.rejected",kind:"summary",resolver:g.resolver,requirementId:g.req.id,reason:g.reason,dropped:g.dropped});return}e({type:"resolver.write.rejected",kind:"rejection",resolver:g.resolver,requirementId:g.req.id,reason:g.reason,fact:g.fact,expected:g.expected,actual:g.actual});},onEffectRun:g=>e({type:"effect.run",id:g}),onEffectError:(g,R)=>e({type:"effect.error",id:g,error:R}),onSourceAttach:(g,R)=>e({type:"source.attach",id:g,moduleId:R}),onSourcePublish:(g,R,t)=>e({type:"source.publish",id:g,moduleId:R,eventName:t}),onSourceDrop:(g,R,t,r)=>e({type:"source.drop",id:g,moduleId:R,eventName:t,reason:r}),onSourceDetach:(g,R)=>e({type:"source.detach",id:g,moduleId:R}),onSourceError:(g,R,t,r)=>e({type:"source.error",id:g,moduleId:R,phase:t,error:r}),onGuardrailBlocked:(g,R,t,r,i)=>e({type:"guardrail.blocked",plugin:g,key:R,kind:t,count:r,...i!==void 0?{category:i}:{}}),onDerivationCompute:(g,R)=>e({type:"derivation.compute",id:g,value:R}),onReconcileStart:()=>e({type:"reconcile.start"}),onReconcileEnd:g=>{let R=g;e({type:"reconcile.end",resolversCompleted:Array.isArray(R.completed)?R.completed.length:0,resolversCanceled:Array.isArray(R.canceled)?R.canceled.length:0});}};return x.register(b),()=>x.unregister(o)},initialize(){if(!_.isInitialized){_.isInitializing=true;for(let e of f.modules)e.init&&ne.batch(()=>{e.init(fe);});f.onAfterModuleInit&&ne.batch(()=>{f.onAfterModuleInit();}),_.isInitializing=false,_.isInitialized=true;for(let e of Object.keys(v))S.get(e);}},start(){if(!_.isRunning){if(_.isEvicting){chunkGBCWXTXW_cjs.a&&console.warn("[Directive] system.start() called during evict() \u2014 ignored. Re-create the system after destroyAsync() resolves.");return}if(_.isDestroyed){chunkGBCWXTXW_cjs.a&&console.warn("[Directive] system.start() called after destroy \u2014 ignored. Systems are not reusable; create a new one.");return}_.isInitialized||this.initialize(),_.isRunning=true;for(let e of f.modules)e.hooks?.onStart?.(N);if(M.attachAll((e,n,o,b)=>_.isDestroyed?{accepted:false,reason:"post-destroy"}:_.isRunning?typeof o!="string"||o.length===0?{accepted:false,reason:"invalid-event-name"}:chunkGKMJ7NMP_cjs.k.has(o)?{accepted:false,reason:"blocked-event-name"}:(l(o,b??{}),{accepted:true}):{accepted:false,reason:"post-stop"}),x.emitStart(N),f.errorBoundary?.retryLater&&!u){let e=Math.max(f.errorBoundary.retryLater.delayMs??1e3,250);u=setInterval(()=>{let n=s.processDueRetries();for(let o of n)o.callback?o.callback():ge();},Math.min(e,500));}ge();}},stop(){if(_.isRunning){_.isRunning=false,u!==null&&(clearInterval(u),u=null),s.getRetryLaterManager().clearAll(),se.cancelAll(),M.cleanupAll(),c.cleanupAll();for(let e of f.modules)e.hooks?.onStop?.(N);x.emitStop(N);}},destroy(){_.isDestroyed||(this.stop(),_.isDestroyed=true,ne.destroy?.(),se.destroy(),s.clearErrors(),Se.clear(),he.clear(),J.destroy(),ce.destroy(),P.clear(),j.clear(),ye.clear(),x.emitDestroy(N));},async stopAsync(){if(_.isRunning){_.isRunning=false,u!==null&&(clearInterval(u),u=null),s.getRetryLaterManager().clearAll(),se.cancelAll(),await M.cleanupAllAsync(),c.cleanupAll();for(let e of f.modules)e.hooks?.onStop?.(N);x.emitStop(N);}},async destroyAsync(){_.isDestroyed||(await this.stopAsync(),_.isDestroyed=true,ne.destroy?.(),se.destroy(),s.clearErrors(),Se.clear(),he.clear(),J.destroy(),ce.destroy(),P.clear(),j.clear(),ye.clear(),x.emitDestroy(N));},async evict(e){if(_.isEvicting||_.isDestroyed)return;_.isEvicting=true;let n=()=>(async()=>{await M.evictAll(),await this.destroyAsync();})().finally(()=>{_.isEvicting=false;});if(e!==void 0&&e-Date.now()<=0){n().catch(()=>{});return}let o=n();if(e===void 0){await o;return}let b=e-Date.now();o.catch(()=>{}),await Promise.race([o,new Promise(g=>setTimeout(g,b))]);},dispatch(e){chunkGKMJ7NMP_cjs.k.has(e.type)||l(e.type,e);},read(e){return S.get(e)},subscribe(e,n){let o=[],b=[];for(let R of e)R in v?o.push(R):R in a?b.push(R):chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] subscribe: unknown key "${R}"`);let g=[];return o.length>0&&g.push(S.subscribe(o,n)),b.length>0&&g.push(ne.subscribe(b,n)),()=>{for(let R of g)R();}},watch(e,n,o){let b=o?.equalityFn?(R,t)=>o.equalityFn(R,t):(R,t)=>Object.is(R,t);if(e in v){let R=S.get(e);return S.subscribe([e],()=>{let t=S.get(e);if(!b(t,R)){let r=R;R=t,n(t,r);}})}chunkGBCWXTXW_cjs.a&&(e in a||console.warn(`[Directive] watch: unknown key "${e}"`));let g=ne.get(e);return ne.subscribe([e],()=>{let R=ne.get(e);if(!b(R,g)){let t=g;g=R,n(R,t);}})},when(e,n){return new Promise((o,b)=>{let g=ne.toObject();if(e(g)){o();return}let R,t,r=()=>{R?.(),t!==void 0&&clearTimeout(t);};R=ne.subscribeAll(()=>{let i=ne.toObject();e(i)&&(r(),o());}),n?.timeout!==void 0&&n.timeout>0&&(t=setTimeout(()=>{r(),b(new Error(`[Directive] when: timed out after ${n.timeout}ms`));},n.timeout));})},inspect(){return {unmet:_.previousRequirements.all(),inflight:se.getInflightInfo(),facts:Object.keys(a).map(e=>({key:e,meta:a[e]?._meta})),events:Object.keys(A).map(e=>({name:e,meta:j.get(e)})),constraints:re.getAllStates().map(e=>{let n=re.getWhenSpec(e.id),o=$[e.id],b=o?.owns&&o.owns.length>0?o.owns:void 0;return {id:e.id,active:e.lastResult??false,disabled:re.isDisabled(e.id),priority:e.priority,hitCount:e.hitCount,lastActiveAt:e.lastActiveAt,meta:o?.meta,...n?{whenSpec:n}:{},...b?{owns:b}:{}}}),resolvers:Object.fromEntries(se.getInflight().map(e=>[e,se.getStatus(e)])),resolverDefs:Object.entries(W).map(([e,n])=>({id:e,requirement:typeof n.requirement=="string"?n.requirement:"(predicate)",meta:n.meta})),effects:Object.entries(q).map(([e,n])=>({id:e,meta:n.meta})),sources:M.listDefinitions().map(e=>({id:e.id,moduleId:e.moduleId,meta:e.meta,attached:e.attached,attachedAt:e.attachedAt,detachedAt:e.detachedAt,publishCount:e.publishCount,lastPublishAt:e.lastPublishAt,dropCount:e.dropCount,lastDropReason:e.lastDropReason,lastDropAt:e.lastDropAt,errorCount:e.errorCount,lastError:e.lastError})),attachedSourceCount:M.attachedCount(),derivations:Object.keys(v).map(e=>({id:e,meta:S.getMeta(e)})),modules:f.modules.map(e=>({id:e.id,meta:P.get(e.id)})),traceEnabled:ae,...ae?{trace:structuredClone(J.getEntries()??[])}:{}}},explain(e){let o=_.previousRequirements.all().find(ee=>ee.id===e);if(!o)return null;let b=re.getState(o.fromConstraint),g=se.getStatus(e),R={},t=re.getDependencies(o.fromConstraint);if(t)for(let ee of t)R[ee]=ne.get(ee);else for(let[ee,le]of Object.entries(ne.toObject()))R[ee]=le;let r=$[o.fromConstraint],i=r?.meta?.label??o.fromConstraint,I=[`Requirement "${o.requirement.type}" (id: ${o.id})`,`\u251C\u2500 Produced by constraint: ${i}`,`\u251C\u2500 Constraint priority: ${b?.priority??0}`,`\u251C\u2500 Constraint active: ${b?.lastResult??"unknown"}`,`\u251C\u2500 Resolver status: ${g.state}`];r?.meta?.description&&I.push(`\u251C\u2500 Description: ${r.meta.description}`);let w=re.explainWhen(o.fromConstraint),X=(ee,le,Ce)=>{let Oe=Ce?"\u2514\u2500":"\u251C\u2500",xe=ee.pass?"\u2713":"\u2717";if(ee.children){if(ee.op==="$not"){let _e=ee.pass?" (child failed)":" (child passed)";I.push(`${le}${Oe} ${xe} $not${_e}`);}else I.push(`${le}${Oe} ${xe} ${ee.op} (${ee.actual}/${ee.expected})`);let Ct=`${le}${Ce?"   ":"\u2502  "}`;ee.children.forEach((_e,xt)=>{X(_e,Ct,xt===ee.children.length-1);});return}let Et=typeof ee.expected=="object"?JSON.stringify(ee.expected):String(ee.expected),Mt=ee.actual===void 0?"undefined":typeof ee.actual=="object"?JSON.stringify(ee.actual):String(ee.actual);I.push(`${le}${Oe} ${xe} ${ee.path} ${ee.op} ${Et} (actual: ${Mt})`);};w&&w.length>0&&(I.push("\u251C\u2500 Predicate clauses:"),w.forEach((ee,le)=>{X(ee,"\u2502  ",le===w.length-1);}));let Q=Object.entries(o.requirement).filter(([ee])=>ee!=="type").map(([ee,le])=>`${ee}=${JSON.stringify(le)}`).join(", ");Q&&I.push(`\u251C\u2500 Requirement payload: { ${Q} }`);let te=Object.entries(R).slice(0,10);return te.length>0&&(I.push("\u2514\u2500 Relevant facts:"),te.forEach(([ee,le],Ce)=>{let Oe=Ce===te.length-1?"   \u2514\u2500":"   \u251C\u2500",xe=typeof le=="object"?JSON.stringify(le):String(le);I.push(`${Oe} ${ee} = ${xe.slice(0,50)}${xe.length>50?"...":""}`);})),I.join(`
-`)},getOriginal(e,n){return ce.getOriginal(e,n)},restoreOriginal(e,n){return ce.restoreOriginal(e,n)},async settle(e=5e3){let n=()=>se.getInflightCount()===0&&!_.isReconciling&&!_.reconcileScheduled&&!se.hasPendingBatches();if(se.hasPendingBatches()&&se.processBatches(),await new Promise(o=>queueMicrotask(o)),!n())return new Promise((o,b)=>{let g=false,R=()=>{g||(g=true,clearTimeout(t),r());},t=setTimeout(()=>{R();let i=[],I=se.getInflightInfo();I.length>0&&i.push(`${I.length} resolvers inflight: ${I.map(X=>X.resolverId).join(", ")}`),_.isReconciling&&i.push("reconciliation in progress"),_.reconcileScheduled&&i.push("reconcile scheduled");let w=_.previousRequirements.all();w.length>0&&i.push(`${w.length} unmet requirements: ${w.map(X=>X.requirement.type).join(", ")}`),b(new Error(`[Directive] settle() timed out after ${e}ms. ${i.join("; ")}`));},e),r=this.onSettledChange(()=>{se.hasPendingBatches()&&se.processBatches(),queueMicrotask(()=>{!g&&n()&&(R(),o());});});})},getSnapshot(){return {facts:ne.toObject(),version:1}},getDistributableSnapshot(e={}){let{includeDerivations:n,excludeDerivations:o,includeFacts:b,ttlSeconds:g,metadata:R,includeVersion:t}=e,r={},i=Object.keys(v),I=new Set(i),w;if(n){if(w=n.filter(te=>I.has(te)),chunkGBCWXTXW_cjs.a){let te=n.filter(ee=>!I.has(ee));te.length>0&&console.warn(`[Directive] getDistributableSnapshot: Unknown derivation keys ignored: ${te.join(", ")}. Available: ${i.join(", ")||"(none)"}`);}}else w=i;if(o){let te=new Set(o);w=w.filter(ee=>!te.has(ee));}for(let te of w)try{r[te]=S.get(te);}catch(ee){chunkGBCWXTXW_cjs.a&&console.warn(`[Directive] getDistributableSnapshot: Skipping derivation "${te}" due to error:`,ee);}if(b&&b.length>0){let te=ne.toObject(),ee=Object.keys(te);if(chunkGBCWXTXW_cjs.a){let le=b.filter(Ce=>!(Ce in te));le.length>0&&console.warn(`[Directive] getDistributableSnapshot: Unknown fact keys ignored: ${le.join(", ")}. Available: ${ee.join(", ")||"(none)"}`);}for(let le of b)le in te&&(r[le]=te[le]);}let X=Date.now(),Q={data:r,createdAt:X};return g!==void 0&&g>0&&(Q.expiresAt=X+g*1e3),t&&(Q.version=chunkGBCWXTXW_cjs.h(r)),R&&(Q.metadata=R),Q},watchDistributableSnapshot(e,n){let{includeDerivations:o,excludeDerivations:b}=e,g=Object.keys(v),R;if(o?R=o.filter(i=>g.includes(i)):R=g,b){let i=new Set(b);R=R.filter(I=>!i.has(I));}if(R.length===0)return chunkGBCWXTXW_cjs.a&&console.warn("[Directive] watchDistributableSnapshot: No derivations to watch. Callback will never be called."),()=>{};let r=this.getDistributableSnapshot({...e,includeVersion:true}).version;return S.subscribe(R,()=>{let i=this.getDistributableSnapshot({...e,includeVersion:true});i.version!==r&&(r=i.version,n(i));})},restore(e){if(!e||typeof e!="object")throw new Error("[Directive] restore() requires a valid snapshot object");if(!e.facts||typeof e.facts!="object")throw new Error("[Directive] restore() snapshot must have a facts object");if(!chunkGBCWXTXW_cjs.f(e))throw new Error("[Directive] restore() rejected: snapshot contains potentially dangerous keys (__proto__, constructor, or prototype). This may indicate a prototype pollution attack.");ne.batch(()=>{for(let[n,o]of Object.entries(e.facts))chunkGKMJ7NMP_cjs.k.has(n)||ne.set(n,o);});},onSettledChange(e){return Se.add(e),()=>{Se.delete(e);}},onHistoryChange(e){return he.add(e),()=>{he.delete(e);}},batch(e){ne.batch(e);},get isSettled(){return se.getInflightCount()===0&&!se.hasPendingBatches()&&!_.isReconciling&&!_.reconcileScheduled},get isRunning(){return _.isRunning},get isInitialized(){return _.isInitialized},get isReady(){return _.isReady},whenReady(){return _.isReady?Promise.resolve():_.isRunning?(_.readyPromise||(_.readyPromise=new Promise(e=>{_.readyResolve=e;})),_.readyPromise):Promise.reject(new Error("[Directive] whenReady() called before start(). Call system.start() first, then await system.whenReady()."))}};function U(e){if(_.isReconciling)throw new Error(`[Directive] Cannot register module "${e.id}" during reconciliation. Wait for the current reconciliation cycle to complete.`);if(_.isDestroyed)throw new Error(`[Directive] Cannot register module "${e.id}" on a destroyed system.`);let n=(o,b)=>{if(o)for(let g of Object.keys(o)){if(chunkGKMJ7NMP_cjs.k.has(g))throw new Error(`[Directive] Security: Module "${e.id}" has dangerous key "${g}" in ${b}.`);if(b==="schema"&&g.startsWith("$"))throw new Error(`[Directive] Module "${e.id}" has schema key "${g}" starting with "$". Keys starting with $ are reserved for internal accessors ($store, $snapshot).`)}};n(e.schema,"schema"),n(e.events,"events"),n(e.derive,"derive"),n(e.effects,"effects"),n(e.sources,"sources"),n(e.constraints,"constraints"),n(e.resolvers,"resolvers");for(let o of Object.keys(e.schema))if(o in a)throw new Error(`[Directive] Schema collision: Fact "${o}" already exists. Cannot register module "${e.id}".`);if(chunkGBCWXTXW_cjs.a&&e.derive){let o=new Set(Object.keys(a));for(let b of Object.keys(e.derive))o.has(b)&&console.warn(`[Directive] "${b}" exists as both a fact and a derivation after registering module "${e.id}".`);}if(e.history?.snapshotEvents){y===null&&(y=new Set(Object.keys(A)));for(let o of e.history.snapshotEvents)y.add(o);}else if(y!==null&&e.events)for(let o of Object.keys(e.events))y.add(o);Object.assign(a,e.schema);for(let o of Object.values(e.schema)){let b=o;b._meta&&(b._meta=me(b._meta));}if(e.events&&(kt(e.events,j),Object.assign(A,e.events)),e.derive&&(Object.assign(v,e.derive),S.registerDefinitions(e.derive)),e.effects){for(let o of Object.values(e.effects)){let b=o;b.meta&&(b.meta=me(b.meta));}Object.assign(q,e.effects),c.registerDefinitions(e.effects);}if(e.sources){Object.assign(m,e.sources);for(let o of Object.keys(e.sources))k[o]=e.id;for(let[o,b]of Object.entries(e.sources)){let g=b.meta;x.emitDefinitionRegister("source",o,{moduleId:e.id,...g!==void 0?{meta:g}:{}});}M.registerDefinitions(e.id,e.sources);}if(e.constraints){for(let o of Object.values(e.constraints)){let b=o;b.meta&&(b.meta=me(b.meta));}Object.assign($,e.constraints),re.registerDefinitions(e.constraints);}if(e.resolvers){for(let o of Object.values(e.resolvers)){let b=o;b.meta&&(b.meta=me(b.meta));}Object.assign(W,e.resolvers);for(let o of Object.keys(e.resolvers))p.set(o,e);se.registerDefinitions(e.resolvers),de(e.resolvers);}if(ne.registerKeys(e.schema),e.meta){let o=me(e.meta);o&&P.set(e.id,o);}f.modules.push(e),e.init&&ne.batch(()=>{e.init(fe);}),e.hooks?.onInit?.(N),_.isRunning&&(e.hooks?.onStart?.(N),ge());}N.registerModule=U,x.emitInit(N).catch(e=>{console.error("[Directive] Plugin emitInit failure",{error:e});});for(let e of f.modules)e.hooks?.onInit?.(N);return N}exports.A=sr;exports.a=Yt;exports.b=qe;exports.c=It;exports.d=Pt;exports.e=qt;exports.f=Tt;exports.g=Gt;exports.h=Jt;exports.i=nt;exports.j=rt;exports.k=Ot;exports.l=sn;exports.m=an;exports.n=cn;exports.o=Ee;exports.p=it;exports.q=st;exports.r=at;exports.s=Ft;exports.t=ct;exports.u=_t;exports.v=Wt;exports.w=dt;exports.x=lt;exports.y=mt;exports.z=St;//# sourceMappingURL=chunk-M5PEB553.cjs.map
-//# sourceMappingURL=chunk-M5PEB553.cjs.map