@mikeargento/bitgraph-player 0.1.0

package/dist/evaluate.js

@@ -0,0 +1,177 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+import { kleeneAll, kleeneAny, kleeneNot } from "./logic.js";
+import { compare } from "./order.js";
+import { basisTier, meetsFloor } from "./types.js";
+function positionOf(proof) {
+    const out = { proofHash: proof.proofHash };
+    if (proof.epochId !== undefined)
+        out["epochId"] = proof.epochId;
+    out["chainId"] = proof.chainId;
+    if (proof.counter !== undefined)
+        out["counter"] = proof.counter;
+    if (proof.slotCounter !== undefined)
+        out["slotCounter"] = proof.slotCounter;
+    return out;
+}
+/**
+ * Classify a role for predicate purposes.
+ *   resolved          -> use the recording
+ *   definitely-absent -> optional and absent: closed-world FALSE material
+ *   undetermined      -> everything else, with the reason
+ */
+function classify(ctx, role) {
+    const res = ctx.resolutions.get(role);
+    if (res === undefined) {
+        return { kind: "undetermined", reason: `role "${role}" is not declared in the cast` };
+    }
+    switch (res.kind) {
+        case "resolved":
+            return { kind: "resolved", proof: res.proof };
+        case "absent":
+            return res.optional
+                ? { kind: "definitely-absent" }
+                : {
+                    kind: "undetermined",
+                    reason: `required role "${role}" has no verified recording in the bundle`,
+                };
+        case "ambiguous":
+            return {
+                kind: "undetermined",
+                reason: `role "${role}" matches ${res.matchCount} recordings and no "at" pin selects one`,
+            };
+        case "invalid":
+            return { kind: "undetermined", reason: `role "${role}": ${res.reason}` };
+    }
+}
+function record(ctx, step) {
+    ctx.steps.push(step);
+    return step.result;
+}
+function evalExists(ctx, role) {
+    const c = classify(ctx, role);
+    const claim = `exists(${role})`;
+    if (c.kind === "resolved") {
+        return record(ctx, {
+            claim,
+            result: "TRUE",
+            because: { recording: positionOf(c.proof) },
+        });
+    }
+    if (c.kind === "definitely-absent") {
+        return record(ctx, {
+            claim,
+            result: "FALSE",
+            because: {
+                reason: `no verified recording of the declared digest is in the bundle; definite absence within the declared closed world`,
+            },
+        });
+    }
+    return record(ctx, { claim, result: "UNDETERMINED", because: { reason: c.reason } });
+}
+/** Shared body of before/after: asks whether `x` precedes `y`. */
+function evalPrecedes(ctx, claim, x, y) {
+    const cx = classify(ctx, x);
+    const cy = classify(ctx, y);
+    for (const [role, c] of [
+        [x, cx],
+        [y, cy],
+    ]) {
+        if (c.kind === "undetermined") {
+            return record(ctx, {
+                claim,
+                result: "UNDETERMINED",
+                because: { reason: c.reason, role },
+            });
+        }
+    }
+    if (cx.kind === "definitely-absent" || cy.kind === "definitely-absent") {
+        const absent = cx.kind === "definitely-absent" ? x : y;
+        return record(ctx, {
+            claim,
+            result: "FALSE",
+            because: {
+                reason: `role "${absent}" is definitely absent within the declared closed world; no ordering claim about it can hold`,
+            },
+        });
+    }
+    const a = cx.proof;
+    const b = cy.proof;
+    const order = compare(a, b, ctx.audit);
+    const because = {
+        a: positionOf(a),
+        b: positionOf(b),
+        relation: order.relation,
+        detail: order.detail,
+    };
+    if (order.relation === "same") {
+        return record(ctx, { claim, result: "FALSE", because });
+    }
+    if (order.relation === "unordered") {
+        return record(ctx, { claim, result: "UNDETERMINED", because });
+    }
+    const basis = order.basis;
+    // The tier the specific answer rests on — carried by the adapter, not
+    // recomputed from the basis family (lineage coverage can downgrade it).
+    const tier = order.tier ?? basisTier(basis);
+    because["weaker"] = order.weaker;
+    because["assumptionDependent"] = order.assumptionDependent;
+    if (!meetsFloor(tier, ctx.rule.requires.ordering)) {
+        because["floor"] = ctx.rule.requires.ordering;
+        return record(ctx, {
+            claim,
+            result: "UNDETERMINED",
+            basis,
+            evidenceTier: tier,
+            because: {
+                ...because,
+                reason: `ordering evidence ("${basis}", tier "${tier}") is below the rule's declared floor ("${ctx.rule.requires.ordering}")`,
+            },
+        });
+    }
+    ctx.usedTiers.add(tier);
+    return record(ctx, {
+        claim,
+        result: order.relation === "before" ? "TRUE" : "FALSE",
+        basis,
+        evidenceTier: tier,
+        because,
+    });
+}
+function evalClaim(ctx, claim) {
+    if ("exists" in claim)
+        return evalExists(ctx, claim.exists);
+    if ("before" in claim) {
+        const [x, y] = claim.before;
+        return evalPrecedes(ctx, `before(${x}, ${y})`, x, y);
+    }
+    if ("after" in claim) {
+        const [x, y] = claim.after;
+        // after(x, y) holds exactly when y precedes x.
+        return evalPrecedes(ctx, `after(${x}, ${y})`, y, x);
+    }
+    if ("between" in claim) {
+        const [subject, lower, upper] = claim.between;
+        // between(x, a, b) := after(x, a) AND before(x, b), recorded as two steps.
+        const afterPart = evalPrecedes(ctx, `between(${subject}, ${lower}, ${upper}): after(${subject}, ${lower})`, lower, subject);
+        const beforePart = evalPrecedes(ctx, `between(${subject}, ${lower}, ${upper}): before(${subject}, ${upper})`, subject, upper);
+        return kleeneAll([afterPart, beforePart]);
+    }
+    if ("all" in claim)
+        return kleeneAll(claim.all.map((c) => evalClaim(ctx, c)));
+    if ("any" in claim)
+        return kleeneAny(claim.any.map((c) => evalClaim(ctx, c)));
+    return kleeneNot(evalClaim(ctx, claim.not));
+}
+export function evaluate(rule, resolutions, audit) {
+    const ctx = { rule, resolutions, audit, steps: [], usedTiers: new Set() };
+    const result = evalClaim(ctx, rule.claim);
+    const evaluation = { result, steps: ctx.steps };
+    if (ctx.usedTiers.has("assumption-dependent")) {
+        evaluation.weakestEvidence = "assumption-dependent";
+    }
+    else if (ctx.usedTiers.has("hash-linked")) {
+        evaluation.weakestEvidence = "hash-linked";
+    }
+    return evaluation;
+}
+//# sourceMappingURL=evaluate.js.map

package/dist/evaluate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluate.js","sourceRoot":"","sources":["../src/evaluate.ts"],"names":[],"mappings":"AAAA,qFAAqF;AAwBrF,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAyBnD,SAAS,UAAU,CAAC,KAAoB;IACtC,MAAM,GAAG,GAA4B,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC;IACpE,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,GAAG,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAChE,GAAG,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC/B,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,GAAG,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAChE,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS;QAAE,GAAG,CAAC,aAAa,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC;IAC5E,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CACf,GAAQ,EACR,IAAY;IAKZ,MAAM,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,IAAI,+BAA+B,EAAE,CAAC;IACxF,CAAC;IACD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,UAAU;YACb,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;QAChD,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC,QAAQ;gBACjB,CAAC,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE;gBAC/B,CAAC,CAAC;oBACE,IAAI,EAAE,cAAc;oBACpB,MAAM,EAAE,kBAAkB,IAAI,2CAA2C;iBAC1E,CAAC;QACR,KAAK,WAAW;YACd,OAAO;gBACL,IAAI,EAAE,cAAc;gBACpB,MAAM,EAAE,SAAS,IAAI,aAAa,GAAG,CAAC,UAAU,yCAAyC;aAC1F,CAAC;QACJ,KAAK,SAAS;YACZ,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,SAAS,IAAI,MAAM,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;IAC7E,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,GAAQ,EAAE,IAAiB;IACzC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,MAAM,CAAC;AACrB,CAAC;AAED,SAAS,UAAU,CAAC,GAAQ,EAAE,IAAY;IACxC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,UAAU,IAAI,GAAG,CAAC;IAChC,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC1B,OAAO,MAAM,CAAC,GAAG,EAAE;YACjB,KAAK;YACL,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;SAC5C,CAAC,CAAC;IACL,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACnC,OAAO,MAAM,CAAC,GAAG,EAAE;YACjB,KAAK;YACL,MAAM,EAAE,OAAO;YACf,OAAO,EAAE;gBACP,MAAM,EAAE,kHAAkH;aAC3H;SACF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AACvF,CAAC;AAED,kEAAkE;AAClE,SAAS,YAAY,CAAC,GAAQ,EAAE,KAAa,EAAE,CAAS,EAAE,CAAS;IACjE,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAE5B,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI;QACtB,CAAC,CAAC,EAAE,EAAE,CAAC;QACP,CAAC,CAAC,EAAE,EAAE,CAAC;KACC,EAAE,CAAC;QACX,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YAC9B,OAAO,MAAM,CAAC,GAAG,EAAE;gBACjB,KAAK;gBACL,MAAM,EAAE,cAAc;gBACtB,OAAO,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE;aACpC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,IAAI,EAAE,CAAC,IAAI,KAAK,mBAAmB,IAAI,EAAE,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACvE,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC,GAAG,EAAE;YACjB,KAAK;YACL,MAAM,EAAE,OAAO;YACf,OAAO,EAAE;gBACP,MAAM,EAAE,SAAS,MAAM,8FAA8F;aACtH;SACF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,GAAI,EAAiD,CAAC,KAAK,CAAC;IACnE,MAAM,CAAC,GAAI,EAAiD,CAAC,KAAK,CAAC;IACnE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,OAAO,GAA4B;QACvC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAChB,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAChB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,MAAM,EAAE,KAAK,CAAC,MAAM;KACrB,CAAC;IAEF,IAAI,KAAK,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,KAAK,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;QACnC,OAAO,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,KAAwC,CAAC;IAC7D,sEAAsE;IACtE,wEAAwE;IACxE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACjC,OAAO,CAAC,qBAAqB,CAAC,GAAG,KAAK,CAAC,mBAAmB,CAAC;IAE3D,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClD,OAAO,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAC9C,OAAO,MAAM,CAAC,GAAG,EAAE;YACjB,KAAK;YACL,MAAM,EAAE,cAAc;YACtB,KAAK;YACL,YAAY,EAAE,IAAI;YAClB,OAAO,EAAE;gBACP,GAAG,OAAO;gBACV,MAAM,EAAE,uBAAuB,KAAK,YAAY,IAAI,2CAA2C,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,IAAI;aAC9H;SACF,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,OAAO,MAAM,CAAC,GAAG,EAAE;QACjB,KAAK;QACL,MAAM,EAAE,KAAK,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO;QACtD,KAAK;QACL,YAAY,EAAE,IAAI;QAClB,OAAO;KACR,CAAC,CAAC;AACL,CAAC;AAED,SAAS,SAAS,CAAC,GAAQ,EAAE,KAAY;IACvC,IAAI,QAAQ,IAAI,KAAK;QAAE,OAAO,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5D,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,OAAO,YAAY,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,EAAE,CAAC;QACrB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QAC3B,+CAA+C;QAC/C,OAAO,YAAY,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;QAC9C,2EAA2E;QAC3E,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,EAAE,WAAW,OAAO,KAAK,KAAK,KAAK,KAAK,YAAY,OAAO,KAAK,KAAK,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5H,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,EAAE,WAAW,OAAO,KAAK,KAAK,KAAK,KAAK,aAAa,OAAO,KAAK,KAAK,GAAG,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC9H,OAAO,SAAS,CAAC,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,KAAK,IAAI,KAAK;QAAE,OAAO,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,IAAI,KAAK,IAAI,KAAK;QAAE,OAAO,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,SAAS,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,QAAQ,CACtB,IAAU,EACV,WAAoC,EACpC,KAAkB;IAElB,MAAM,GAAG,GAAQ,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IAC/E,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAe,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC5D,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,sBAAsB,CAAC,EAAE,CAAC;QAC9C,UAAU,CAAC,eAAe,GAAG,sBAAsB,CAAC;IACtD,CAAC;SAAM,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;QAC5C,UAAU,CAAC,eAAe,GAAG,aAAa,CAAC;IAC7C,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,22 @@
+/**
+ * @mikeargento/bitgraph-player
+ *
+ * Deterministic evaluation of causal rules over BitGraph proof bundles.
+ *
+ *   BitGraph records. Player executes.
+ *
+ * Player is a pure function over `runAudit()`'s output: same rule, same
+ * bundle, same verdict, on anyone's machine, with no network access at
+ * evaluation time. It decides; it does not enforce — no field in the rule
+ * format is capable of causing an action.
+ */
+export type { CastEntry, CastPin, Claim, DeclaredEntry, DerivedStep, EvidenceTier, OrderBasis, OrderResult, Resolution, Rule, ThreeValued, Verdict, } from "./types.js";
+export { basisTier, meetsFloor } from "./types.js";
+export { parseRule, normalizeDigest, RuleError } from "./rule.js";
+export { resolveCast, resolveRole } from "./cast.js";
+export { compare } from "./order.js";
+export { kleeneAll, kleeneAny, kleeneNot } from "./logic.js";
+export { evaluate } from "./evaluate.js";
+export type { Evaluation } from "./evaluate.js";
+export { buildVerdict, serializeVerdict, playerVersion } from "./verdict.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;GAWG;AAEH,YAAY,EACV,SAAS,EACT,OAAO,EACP,KAAK,EACL,aAAa,EACb,WAAW,EACX,YAAY,EACZ,UAAU,EACV,WAAW,EACX,UAAU,EACV,IAAI,EACJ,WAAW,EACX,OAAO,GACR,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAEnD,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,YAAY,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC"}

package/dist/index.js

@@ -0,0 +1,9 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+export { basisTier, meetsFloor } from "./types.js";
+export { parseRule, normalizeDigest, RuleError } from "./rule.js";
+export { resolveCast, resolveRole } from "./cast.js";
+export { compare } from "./order.js";
+export { kleeneAll, kleeneAny, kleeneNot } from "./logic.js";
+export { evaluate } from "./evaluate.js";
+export { buildVerdict, serializeVerdict, playerVersion } from "./verdict.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,qFAAqF;AA6BrF,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAEnD,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC"}

package/dist/logic.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Strong Kleene three-valued connectives.
+ *
+ *   all: FALSE if any FALSE; else UNDETERMINED if any UNDETERMINED; else TRUE
+ *   any: TRUE  if any TRUE;  else UNDETERMINED if any UNDETERMINED; else FALSE
+ *   not: TRUE <-> FALSE; UNDETERMINED stays UNDETERMINED
+ *
+ * UNDETERMINED is not a nuisance value: it is the honest answer wherever
+ * the evidence does not decide, and these tables are what keep it from
+ * being laundered into FALSE by composition.
+ */
+import type { ThreeValued } from "./types.js";
+export declare function kleeneNot(v: ThreeValued): ThreeValued;
+export declare function kleeneAll(values: readonly ThreeValued[]): ThreeValued;
+export declare function kleeneAny(values: readonly ThreeValued[]): ThreeValued;
+//# sourceMappingURL=logic.d.ts.map

package/dist/logic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logic.d.ts","sourceRoot":"","sources":["../src/logic.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,wBAAgB,SAAS,CAAC,CAAC,EAAE,WAAW,GAAG,WAAW,CAIrD;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,GAAG,WAAW,CAOrE;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,GAAG,WAAW,CAOrE"}

package/dist/logic.js

@@ -0,0 +1,29 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+export function kleeneNot(v) {
+    if (v === "TRUE")
+        return "FALSE";
+    if (v === "FALSE")
+        return "TRUE";
+    return "UNDETERMINED";
+}
+export function kleeneAll(values) {
+    let sawUndetermined = false;
+    for (const v of values) {
+        if (v === "FALSE")
+            return "FALSE";
+        if (v === "UNDETERMINED")
+            sawUndetermined = true;
+    }
+    return sawUndetermined ? "UNDETERMINED" : "TRUE";
+}
+export function kleeneAny(values) {
+    let sawUndetermined = false;
+    for (const v of values) {
+        if (v === "TRUE")
+            return "TRUE";
+        if (v === "UNDETERMINED")
+            sawUndetermined = true;
+    }
+    return sawUndetermined ? "UNDETERMINED" : "FALSE";
+}
+//# sourceMappingURL=logic.js.map

package/dist/logic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logic.js","sourceRoot":"","sources":["../src/logic.ts"],"names":[],"mappings":"AAAA,qFAAqF;AAgBrF,MAAM,UAAU,SAAS,CAAC,CAAc;IACtC,IAAI,CAAC,KAAK,MAAM;QAAE,OAAO,OAAO,CAAC;IACjC,IAAI,CAAC,KAAK,OAAO;QAAE,OAAO,MAAM,CAAC;IACjC,OAAO,cAAc,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,MAA8B;IACtD,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC;QAClC,IAAI,CAAC,KAAK,cAAc;YAAE,eAAe,GAAG,IAAI,CAAC;IACnD,CAAC;IACD,OAAO,eAAe,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,MAA8B;IACtD,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC;QAChC,IAAI,CAAC,KAAK,cAAc;YAAE,eAAe,GAAG,IAAI,CAAC;IACnD,CAAC;IACD,OAAO,eAAe,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC;AACpD,CAAC"}

package/dist/order.d.ts

@@ -0,0 +1,50 @@
+/**
+ * The ordering adapter. Player does not reimplement causal reconstruction —
+ * `bitgraph-audit` already computes it — this module carries audit's
+ * answers into a single compare(a, b) without flattening their evidence
+ * classes, and without asserting anything the specific pair of recordings
+ * is not actually covered by.
+ *
+ * An artifact's position is its COMMIT position. At the slot the digest is
+ * not bound yet, so the slot cannot be the position of the artifact.
+ *
+ * Within a partition (signer key, epochId, chainId):
+ *   - "chain-link": a DIRECTED prevB64 path connects the two recordings
+ *     through observed proofs. The path itself decides the direction; a
+ *     path contradicting the counters is an anomaly and answers nothing.
+ *     Undirected co-membership in a component is NOT chain-link evidence:
+ *     two fork branches share a component without any path between them.
+ *   - "counter-order": no path, but both commit counters parse under the
+ *     canonical strict-decimal grammar. Rests on counter discipline.
+ *
+ * Across epochs:
+ *   - "epoch-lineage": a chain of hard epochLink edges whose observed
+ *     predecessor/via proofs cover THIS pair. Successor-side coverage is
+ *     by signer key: a proof signed by the successor key cannot predate
+ *     that key's creation at epoch init, which the link proves happened
+ *     after the referenced predecessor existed. Predecessor-side coverage
+ *     is a directed path to (or identity with) the referenced predecessor
+ *     — hash-linked — or a strictly smaller parseable counter, which
+ *     downgrades the whole answer to the assumption-dependent tier.
+ *   - "anchor-bounds": strict block separation between verified segment
+ *     bounds; always assumption-dependent (anchor freshness). If BOTH
+ *     directions satisfy strict separation the evidence is contradictory
+ *     and answers nothing.
+ * Epoch pairs supported by neither are concurrent-or-unordered, and the
+ * honest answer is "unordered", never a coin flip.
+ */
+import type { AuditResult, ObservedProof } from "@mikeargento/bitgraph-audit";
+import type { OrderResult } from "./types.js";
+/**
+ * Canonical strict-decimal counter grammar, mirroring audit's own
+ * parseCounter. Every other spelling BigInt would accept ("", "0x10",
+ * "-3", " 7 ") is NO counter evidence, exactly as audit treats it.
+ */
+export declare function parseCounter(value: string | undefined): bigint | undefined;
+/**
+ * Compare two resolved recordings. Pure over the AuditResult; no network,
+ * no clock. The returned tier is what the answer actually rests on and is
+ * what the evidence floor gates.
+ */
+export declare function compare(a: ObservedProof, b: ObservedProof, audit: AuditResult): OrderResult;
+//# sourceMappingURL=order.d.ts.map

package/dist/order.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"order.d.ts","sourceRoot":"","sources":["../src/order.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EACV,WAAW,EAEX,aAAa,EAGd,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EAAgB,WAAW,EAAE,MAAM,YAAY,CAAC;AAE5D;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,CAG1E;AA2LD;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,WAAW,GAAG,WAAW,CAoI3F"}

package/dist/order.js

@@ -0,0 +1,290 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+/**
+ * Canonical strict-decimal counter grammar, mirroring audit's own
+ * parseCounter. Every other spelling BigInt would accept ("", "0x10",
+ * "-3", " 7 ") is NO counter evidence, exactly as audit treats it.
+ */
+export function parseCounter(value) {
+    if (value === undefined || value.length === 0 || !/^[0-9]+$/.test(value))
+        return undefined;
+    return BigInt(value);
+}
+function unordered(detail) {
+    return { relation: "unordered", assumptionDependent: false, weaker: false, detail };
+}
+function partitionOf(audit, proofHash) {
+    return audit.reconstruction.partitions.find((p) => p.memberProofHashes.includes(proofHash));
+}
+function segmentOf(audit, proofHash) {
+    return audit.temporal.segments.find((s) => s.memberProofHashes.includes(proofHash));
+}
+function proofsByHash(audit) {
+    return new Map(audit.ingest.proofs.map((p) => [p.proofHash, p]));
+}
+/**
+ * True when `ancestor` lies on the directed prevB64 chain above
+ * `descendant`, walking only proofs observed in the bundle and confined to
+ * one partition. Identity does not count.
+ */
+function isDirectedAncestor(ancestor, descendant, partition, byChainHash) {
+    const members = new Set(partition.memberProofHashes);
+    const visited = new Set();
+    let current = descendant;
+    while (current !== undefined) {
+        const prev = current.prevB64;
+        if (prev === undefined)
+            return false;
+        const parent = byChainHash.get(prev);
+        if (parent === undefined || !members.has(parent.proofHash))
+            return false;
+        if (visited.has(parent.proofHash))
+            return false; // cycle guard
+        visited.add(parent.proofHash);
+        if (parent.proofHash === ancestor.proofHash)
+            return true;
+        current = parent;
+    }
+    return false;
+}
+function chainHashIndex(audit, partition) {
+    const byHash = proofsByHash(audit);
+    const index = new Map();
+    for (const memberHash of partition.memberProofHashes) {
+        const proof = byHash.get(memberHash);
+        if (proof !== undefined)
+            index.set(proof.chainHash, proof);
+    }
+    return index;
+}
+// ---------------------------------------------------------------------------
+// Epoch lineage at recording granularity
+// ---------------------------------------------------------------------------
+/**
+ * Try to prove `a` precedes `b` through a chain of hard epochLink edges.
+ *
+ * A usable first edge references an observed predecessor proof P in a's
+ * own partition, with a covering P (identity, directed path, or strictly
+ * smaller parseable counter — the last downgrades the tier). Every
+ * subsequent edge must be anchored in the partition the previous edge's
+ * via proof belongs to; reaching b's partition completes the proof, since
+ * any proof of that partition postdates its key's creation at init.
+ */
+function lineagePrecedes(a, partA, b, partB, audit) {
+    const byHash = proofsByHash(audit);
+    const edges = audit.reconstruction.epochRelationships.edges.filter((e) => e.hardEdge && e.predecessorProofHash !== undefined);
+    const partitionKeyOf = (p) => JSON.stringify(p.key);
+    const partitionByProofHash = (hash) => partitionOf(audit, hash);
+    const queue = [];
+    const chainIndexA = chainHashIndex(audit, partA);
+    const ca = parseCounter(a.counter);
+    for (const edge of edges) {
+        const pred = byHash.get(edge.predecessorProofHash);
+        if (pred === undefined)
+            continue;
+        const predPartition = partitionByProofHash(pred.proofHash);
+        if (predPartition !== partA)
+            continue;
+        let hopTier;
+        if (pred.proofHash === a.proofHash || isDirectedAncestor(a, pred, partA, chainIndexA)) {
+            hopTier = "hash-linked";
+        }
+        else {
+            const cp = parseCounter(pred.counter);
+            if (ca !== undefined && cp !== undefined && ca < cp)
+                hopTier = "assumption-dependent";
+        }
+        if (hopTier === undefined)
+            continue;
+        const viaPartition = partitionByProofHash(edge.viaProofHash);
+        if (viaPartition === undefined)
+            continue;
+        queue.push({ partitionKey: partitionKeyOf(viaPartition), tier: hopTier });
+    }
+    // BFS over subsequent hops. Later hops are free of counter assumptions:
+    // the next edge's predecessor proof is signed by the current partition's
+    // key, so it postdates that key's creation.
+    const bestTierByPartition = new Map();
+    const targetKey = partitionKeyOf(partB);
+    let best;
+    while (queue.length > 0) {
+        const state = queue.shift();
+        const seen = bestTierByPartition.get(state.partitionKey);
+        if (seen === "hash-linked" || seen === state.tier)
+            continue;
+        if (seen === undefined || state.tier === "hash-linked") {
+            bestTierByPartition.set(state.partitionKey, state.tier);
+        }
+        if (state.partitionKey === targetKey) {
+            if (best === undefined || state.tier === "hash-linked")
+                best = state.tier;
+            if (best === "hash-linked")
+                break;
+            continue;
+        }
+        for (const edge of edges) {
+            const pred = byHash.get(edge.predecessorProofHash);
+            if (pred === undefined)
+                continue;
+            const predPartition = partitionByProofHash(pred.proofHash);
+            if (predPartition === undefined || partitionKeyOf(predPartition) !== state.partitionKey) {
+                continue;
+            }
+            const viaPartition = partitionByProofHash(edge.viaProofHash);
+            if (viaPartition === undefined)
+                continue;
+            queue.push({ partitionKey: partitionKeyOf(viaPartition), tier: state.tier });
+        }
+    }
+    return best === undefined ? undefined : { tier: best };
+}
+// ---------------------------------------------------------------------------
+// Anchor bounds
+// ---------------------------------------------------------------------------
+/**
+ * Strict precedence between two one-sided anchor bounds. Equality proves
+ * nothing: A precedes the anchor COMMIT that consumed block N, B follows
+ * the MINING of block N, and the gap between mining and commit is exactly
+ * where the two could swap.
+ */
+function boundsStrictlyOrdered(upper, lower) {
+    if (upper.blockNumber !== undefined && lower.blockNumber !== undefined) {
+        return BigInt(upper.blockNumber) < BigInt(lower.blockNumber);
+    }
+    // Verified witness timestamps; Ethereum block timestamps are strictly
+    // increasing, so strict timestamp inequality is strict block inequality.
+    return upper.timestamp < lower.timestamp;
+}
+function anchorPrecedes(firstSegment, secondSegment) {
+    let best;
+    for (const upper of firstSegment.upperBounds) {
+        for (const lower of secondSegment.lowerBounds) {
+            if (!boundsStrictlyOrdered(upper, lower))
+                continue;
+            const weaker = upper.weaker || lower.weaker;
+            if (best === undefined || (best.weaker && !weaker)) {
+                best = { weaker, upper, lower };
+            }
+        }
+    }
+    return best;
+}
+function describeBound(bound) {
+    return bound.blockNumber !== undefined ? `block ${bound.blockNumber}` : `t=${bound.timestamp}`;
+}
+// ---------------------------------------------------------------------------
+// compare
+// ---------------------------------------------------------------------------
+/**
+ * Compare two resolved recordings. Pure over the AuditResult; no network,
+ * no clock. The returned tier is what the answer actually rests on and is
+ * what the evidence floor gates.
+ */
+export function compare(a, b, audit) {
+    if (a.proofHash === b.proofHash) {
+        return {
+            relation: "same",
+            assumptionDependent: false,
+            weaker: false,
+            detail: "both roles resolved to the identical recording",
+        };
+    }
+    const partA = partitionOf(audit, a.proofHash);
+    const partB = partitionOf(audit, b.proofHash);
+    if (partA === undefined || partB === undefined) {
+        return unordered("at least one recording is observed-but-unchained (no counter or epochId): it holds no causal position to compare");
+    }
+    // -------------------------------------------------------------------
+    // Same partition: a directed prevB64 path decides; counters corroborate
+    // or, absent a path, carry the answer at the weaker tier.
+    // -------------------------------------------------------------------
+    if (partA === partB) {
+        const chainIndex = chainHashIndex(audit, partA);
+        const aBeforeB = isDirectedAncestor(a, b, partA, chainIndex);
+        const bBeforeA = isDirectedAncestor(b, a, partA, chainIndex);
+        const ca = parseCounter(a.counter);
+        const cb = parseCounter(b.counter);
+        if (aBeforeB && bBeforeA) {
+            return unordered("prevB64 links form a cycle between these recordings: an anomaly, not an order");
+        }
+        if (aBeforeB || bBeforeA) {
+            const relation = aBeforeB ? "before" : "after";
+            // A verified path contradicted by the counters is an anomaly:
+            // both cannot be honest, so neither answers.
+            if (ca !== undefined && cb !== undefined && (aBeforeB ? ca >= cb : cb >= ca)) {
+                return unordered("a verified prevB64 path contradicts the commit counters: an anomaly, not an order");
+            }
+            return {
+                relation,
+                basis: "chain-link",
+                tier: "hash-linked",
+                assumptionDependent: false,
+                weaker: false,
+                detail: `a directed prevB64 path through observed proofs connects the recordings; the path decides the direction`,
+            };
+        }
+        if (ca === undefined || cb === undefined) {
+            return unordered("no prevB64 path connects the recordings and at least one carries no parseable strict-decimal commit counter");
+        }
+        if (ca === cb) {
+            return unordered("two distinct recordings claim the same commit counter in one partition: an anomaly, not an order");
+        }
+        return {
+            relation: ca < cb ? "before" : "after",
+            basis: "counter-order",
+            tier: "assumption-dependent",
+            assumptionDependent: true,
+            weaker: true,
+            detail: `no prevB64 path in the bundle connects the recordings; commit counters ${a.counter} vs ${b.counter} rest on the authority's counter discipline`,
+        };
+    }
+    // -------------------------------------------------------------------
+    // Different partitions. Counters are never comparable across
+    // partitions; order can only come through covered epoch lineage or
+    // anchor bounds.
+    // -------------------------------------------------------------------
+    if (a.epochId !== undefined && b.epochId !== undefined && a.epochId === b.epochId) {
+        return unordered("same epochId under a different signer key or chain: counters are not comparable and no cross-partition evidence orders them");
+    }
+    const lineageForward = lineagePrecedes(a, partA, b, partB, audit);
+    const lineageBackward = lineagePrecedes(b, partB, a, partA, audit);
+    if (lineageForward !== undefined && lineageBackward !== undefined) {
+        return unordered("epochLink lineage evidence runs in both directions between these recordings: contradictory, an anomaly, not an order");
+    }
+    const lineage = lineageForward ?? lineageBackward;
+    if (lineage !== undefined) {
+        const relation = lineageForward !== undefined ? "before" : "after";
+        const assumptionDependent = lineage.tier === "assumption-dependent";
+        return {
+            relation,
+            basis: "epoch-lineage",
+            tier: lineage.tier,
+            assumptionDependent,
+            weaker: assumptionDependent,
+            detail: assumptionDependent
+                ? "hard epochLink succession covers this pair, with the predecessor-side coverage resting on counter discipline"
+                : "hard epochLink succession covers this pair: the earlier recording precedes the referenced predecessor by hash links, and the later one is signed by a key created after it",
+        };
+    }
+    const segA = segmentOf(audit, a.proofHash);
+    const segB = segmentOf(audit, b.proofHash);
+    if (segA !== undefined && segB !== undefined) {
+        const forward = anchorPrecedes(segA, segB);
+        const backward = anchorPrecedes(segB, segA);
+        if (forward !== undefined && backward !== undefined) {
+            return unordered("anchor bounds satisfy strict precedence in both directions: contradictory evidence, an anomaly, not an order");
+        }
+        const hit = forward ?? backward;
+        if (hit !== undefined) {
+            return {
+                relation: forward !== undefined ? "before" : "after",
+                basis: "anchor-bounds",
+                tier: "assumption-dependent",
+                assumptionDependent: true,
+                weaker: hit.weaker,
+                detail: `not-after anchor ${describeBound(hit.upper)} strictly precedes not-before anchor ${describeBound(hit.lower)}; rests on the anchor-freshness assumption`,
+            };
+        }
+    }
+    return unordered(`epochs ${a.epochId ?? "(none)"} and ${b.epochId ?? "(none)"} are concurrent-or-unordered for this pair: no covering lineage and no strict anchor-bound separation`);
+}
+//# sourceMappingURL=order.js.map

package/dist/order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"order.js","sourceRoot":"","sources":["../src/order.ts"],"names":[],"mappings":"AAAA,qFAAqF;AA+CrF;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAAyB;IACpD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3F,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,SAAS,CAAC,MAAc;IAC/B,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,mBAAmB,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AACtF,CAAC;AAED,SAAS,WAAW,CAAC,KAAkB,EAAE,SAAiB;IACxD,OAAO,KAAK,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED,SAAS,SAAS,CAAC,KAAkB,EAAE,SAAiB;IACtD,OAAO,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,SAAS,YAAY,CAAC,KAAkB;IACtC,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CACzB,QAAuB,EACvB,UAAyB,EACzB,SAAyB,EACzB,WAAuC;IAEvC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,OAAO,GAA8B,UAAU,CAAC;IACpD,OAAO,OAAO,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC;QACzE,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,cAAc;QAC/D,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,SAAS,KAAK,QAAQ,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QACzD,OAAO,GAAG,MAAM,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CAAC,KAAkB,EAAE,SAAyB;IACnE,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC/C,KAAK,MAAM,UAAU,IAAI,SAAS,CAAC,iBAAiB,EAAE,CAAC;QACrD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,yCAAyC;AACzC,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,SAAS,eAAe,CACtB,CAAgB,EAChB,KAAqB,EACrB,CAAgB,EAChB,KAAqB,EACrB,KAAkB;IAElB,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,CAAC,cAAc,CAAC,kBAAkB,CAAC,KAAK,CAAC,MAAM,CAChE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,oBAAoB,KAAK,SAAS,CAC1D,CAAC;IACF,MAAM,cAAc,GAAG,CAAC,CAAiB,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5E,MAAM,oBAAoB,GAAG,CAAC,IAAY,EAA8B,EAAE,CACxE,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAO3B,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,oBAA8B,CAAC,CAAC;QAC7D,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,MAAM,aAAa,GAAG,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3D,IAAI,aAAa,KAAK,KAAK;YAAE,SAAS;QACtC,IAAI,OAAiC,CAAC;QACtC,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,IAAI,kBAAkB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC,EAAE,CAAC;YACtF,OAAO,GAAG,aAAa,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,GAAG,sBAAsB,CAAC;QACxF,CAAC;QACD,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS;QACpC,MAAM,YAAY,GAAG,oBAAoB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7D,IAAI,YAAY,KAAK,SAAS;YAAE,SAAS;QACzC,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,cAAc,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED,wEAAwE;IACxE,yEAAyE;IACzE,4CAA4C;IAC5C,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC5D,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACxC,IAAI,IAA8B,CAAC;IACnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAW,CAAC;QACrC,MAAM,IAAI,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACzD,IAAI,IAAI,KAAK,aAAa,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI;YAAE,SAAS;QAC5D,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACvD,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,KAAK,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACrC,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa;gBAAE,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YAC1E,IAAI,IAAI,KAAK,aAAa;gBAAE,MAAM;YAClC,SAAS;QACX,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,oBAA8B,CAAC,CAAC;YAC7D,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YACjC,MAAM,aAAa,GAAG,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3D,IAAI,aAAa,KAAK,SAAS,IAAI,cAAc,CAAC,aAAa,CAAC,KAAK,KAAK,CAAC,YAAY,EAAE,CAAC;gBACxF,SAAS;YACX,CAAC;YACD,MAAM,YAAY,GAAG,oBAAoB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7D,IAAI,YAAY,KAAK,SAAS;gBAAE,SAAS;YACzC,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,cAAc,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACzD,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,KAAmB,EAAE,KAAmB;IACrE,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACvE,OAAO,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC/D,CAAC;IACD,sEAAsE;IACtE,yEAAyE;IACzE,OAAO,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;AAC3C,CAAC;AAED,SAAS,cAAc,CACrB,YAA6B,EAC7B,aAA8B;IAE9B,IAAI,IAA+E,CAAC;IACpF,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,WAAW,EAAE,CAAC;YAC9C,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC;gBAAE,SAAS;YACnD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;YAC5C,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnD,IAAI,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,KAAmB;IACxC,OAAO,KAAK,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,SAAS,EAAE,CAAC;AACjG,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,CAAgB,EAAE,CAAgB,EAAE,KAAkB;IAC5E,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;QAChC,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,mBAAmB,EAAE,KAAK;YAC1B,MAAM,EAAE,KAAK;YACb,MAAM,EAAE,gDAAgD;SACzD,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAE9C,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/C,OAAO,SAAS,CACd,kHAAkH,CACnH,CAAC;IACJ,CAAC;IAED,sEAAsE;IACtE,wEAAwE;IACxE,0DAA0D;IAC1D,sEAAsE;IACtE,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;QACpB,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QAC7D,MAAM,QAAQ,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAEnC,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC,+EAA+E,CAAC,CAAC;QACpG,CAAC;QACD,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAE,QAAkB,CAAC,CAAC,CAAE,OAAiB,CAAC;YACrE,8DAA8D;YAC9D,6CAA6C;YAC7C,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC7E,OAAO,SAAS,CACd,mFAAmF,CACpF,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,QAAQ;gBACR,KAAK,EAAE,YAAY;gBACnB,IAAI,EAAE,aAAa;gBACnB,mBAAmB,EAAE,KAAK;gBAC1B,MAAM,EAAE,KAAK;gBACb,MAAM,EAAE,yGAAyG;aAClH,CAAC;QACJ,CAAC;QAED,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACzC,OAAO,SAAS,CACd,6GAA6G,CAC9G,CAAC;QACJ,CAAC;QACD,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACd,OAAO,SAAS,CACd,kGAAkG,CACnG,CAAC;QACJ,CAAC;QACD,OAAO;YACL,QAAQ,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO;YACtC,KAAK,EAAE,eAAe;YACtB,IAAI,EAAE,sBAAsB;YAC5B,mBAAmB,EAAE,IAAI;YACzB,MAAM,EAAE,IAAI;YACZ,MAAM,EAAE,0EAA0E,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,OAAO,6CAA6C;SACzJ,CAAC;IACJ,CAAC;IAED,sEAAsE;IACtE,6DAA6D;IAC7D,mEAAmE;IACnE,iBAAiB;IACjB,sEAAsE;IACtE,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QAClF,OAAO,SAAS,CACd,6HAA6H,CAC9H,CAAC;IACJ,CAAC;IAED,MAAM,cAAc,GAAG,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnE,IAAI,cAAc,KAAK,SAAS,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QAClE,OAAO,SAAS,CACd,sHAAsH,CACvH,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAG,cAAc,IAAI,eAAe,CAAC;IAClD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAE,QAAkB,CAAC,CAAC,CAAE,OAAiB,CAAC;QACzF,MAAM,mBAAmB,GAAG,OAAO,CAAC,IAAI,KAAK,sBAAsB,CAAC;QACpE,OAAO;YACL,QAAQ;YACR,KAAK,EAAE,eAAe;YACtB,IAAI,EAAE,OAAO,CAAC,IAAI;YAClB,mBAAmB;YACnB,MAAM,EAAE,mBAAmB;YAC3B,MAAM,EAAE,mBAAmB;gBACzB,CAAC,CAAC,8GAA8G;gBAChH,CAAC,CAAC,4KAA4K;SACjL,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YACpD,OAAO,SAAS,CACd,8GAA8G,CAC/G,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC;QAChC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,OAAO;gBACL,QAAQ,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO;gBACpD,KAAK,EAAE,eAAe;gBACtB,IAAI,EAAE,sBAAsB;gBAC5B,mBAAmB,EAAE,IAAI;gBACzB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,MAAM,EAAE,oBAAoB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,wCAAwC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,4CAA4C;aACjK,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CACd,UAAU,CAAC,CAAC,OAAO,IAAI,QAAQ,QAAQ,CAAC,CAAC,OAAO,IAAI,QAAQ,uGAAuG,CACpK,CAAC;AACJ,CAAC"}