@did-btcr2/method 0.37.0 → 0.39.0

package/dist/esm/core/aggregation/cohort.js

@@ -1,316 +0,0 @@
-import { getNetwork } from '@did-btcr2/bitcoin';
-import { canonicalHash, canonicalize, hash } from '@did-btcr2/common';
-import { BTCR2MerkleTree } from '@did-btcr2/smt';
-import { schnorr } from '@noble/curves/secp256k1.js';
-import { concatBytes, hexToBytes, randomBytes } from '@noble/hashes/utils';
-import { p2tr } from '@scure/btc-signer';
-import { keyAggExport, keyAggregate, sortKeys } from '@scure/btc-signer/musig2';
-import { AggregationCohortError } from './errors.js';
-import { DEFAULT_FUNDING_MODEL, buildRecoveryLeaves, resolveFallbackThreshold } from './recovery-policy.js';
-/**
- * Represents an Aggregation Cohort: a set of Aggregation Participants who
- * submitted cryptographic material to an Aggregation Service to coordinate
- * signing of a shared n-of-n MuSig2 Bitcoin transaction.
- *
- * This is a pure data class: it holds cohort state and provides computation
- * helpers (key aggregation, CAS Announcement building, SMT tree building).
- * It performs no I/O and emits no messages. Both AggregationService and
- * AggregationParticipant create their own AggregationCohort instances to
- * track their respective views of the cohort state.
- *
- * @class AggregationCohort
- */
-export class AggregationCohort {
-    /** Unique identifier for the cohort. */
-    id;
-    /** DID of the Aggregation Service managing this cohort. */
-    serviceDid;
-    /** Minimum number of participants required to finalize the cohort. */
-    minParticipants;
-    /** Network on which the cohort operates (mainnet, mutinynet, etc.). */
-    network;
-    /** Type of beacon used in the cohort: 'CASBeacon' or 'SMTBeacon'. */
-    beaconType;
-    /** List of participant DIDs that have been accepted into the cohort. */
-    participants = [];
-    /**
-     * Mapping from participant DID to their compressed secp256k1 public key.
-     * Distinct from {@link cohortKeys} (which is sorted per BIP-327): this lets
-     * callers look up a participant's key without knowing their position in the
-     * sorted array. Populated by the service at `acceptParticipant` time.
-     */
-    participantKeys = new Map();
-    /** Sorted list of cohort participants' compressed public keys. */
-    #cohortKeys = [];
-    /**
-     * BIP-341 TapTweak scalar: `taggedHash("TapTweak", internalPubkey || tapMerkleRoot)`.
-     * The beacon output is an internal key (the MuSig2 aggregate) plus a script
-     * tree (the recovery leaves), so the tweak commits to the tree's Merkle root.
-     * The MuSig2 signing session applies this as an x-only tweak; a value that does
-     * not match the root the funded address was derived from silently yields an
-     * invalid key-path signature.
-     */
-    tapTweak = new Uint8Array();
-    /** The n-of-n MuSig2 aggregate internal key, x-only (32 bytes), set by computeBeaconAddress(). */
-    internalKey = new Uint8Array();
-    /** BIP-341 Taproot Merkle root of the recovery script tree, set by computeBeaconAddress(). */
-    tapMerkleRoot = new Uint8Array();
-    /** Operator recovery key, x-only (32 bytes). Used to build the CSV recovery leaf. */
-    recoveryKey;
-    /** Relative-timelock (BIP-68 nSequence) before the recovery leaf is spendable. */
-    recoverySequence;
-    /** Funding model governing the recovery leaves (default 'operator-funded'). */
-    fundingModel;
-    /**
-     * Advertised k of the k-of-n fallback leaf, or undefined to default to n-1 at
-     * address computation. Read the resolved value via {@link effectiveFallbackThreshold}.
-     */
-    fallbackThreshold;
-    /** The Taproot beacon address: key path is the MuSig2 aggregate, script path is fallback + recovery. */
-    beaconAddress = '';
-    /** Pending DID updates submitted by participants, keyed by DID. */
-    pendingUpdates = new Map();
-    /**
-     * Participant DIDs that explicitly declined to submit an update this round
-     * (cooperative non-inclusion). A decliner is absent from the CAS Announcement
-     * Map and carries a non-inclusion leaf in the SMT, yet still signs. Kept
-     * disjoint from {@link pendingUpdates} so CAS correctness holds by construction.
-     */
-    nonIncluded = new Set();
-    /** CAS Beacon Announcement Map (DID to updateHash), set by buildCASAnnouncement(). */
-    casAnnouncement;
-    /** Per-participant SMT proofs, set by buildSMTTree(). */
-    smtProofs;
-    /** Signal bytes (32 bytes) for OP_RETURN: SHA-256 of CAS announcement OR SMT root. */
-    signalBytes;
-    /** Set of participant DIDs that have approved the aggregated data. */
-    validationAcks = new Set();
-    /** Set of participant DIDs that have rejected the aggregated data. */
-    validationRejections = new Set();
-    constructor({ id, minParticipants, serviceDid, network, beaconType, recoveryKey, recoverySequence, fundingModel, fallbackThreshold }) {
-        this.id = id || crypto.randomUUID();
-        // `?? 2` (not `|| 2`) so a deliberately-passed 0 is preserved rather than
-        // silently coerced; the service rejects an invalid count at createCohort.
-        this.minParticipants = minParticipants ?? 2;
-        this.serviceDid = serviceDid || '';
-        this.network = network;
-        this.beaconType = beaconType || 'CASBeacon';
-        this.recoveryKey = recoveryKey;
-        this.recoverySequence = recoverySequence;
-        this.fundingModel = fundingModel ?? DEFAULT_FUNDING_MODEL;
-        this.fallbackThreshold = fallbackThreshold;
-    }
-    /** Sorted cohort keys (sorted on assignment per BIP-327). */
-    get cohortKeys() {
-        return this.#cohortKeys;
-    }
-    set cohortKeys(keys) {
-        this.#cohortKeys = sortKeys(keys);
-    }
-    /**
-     * The resolved k of the k-of-n fallback leaf: the advertised
-     * {@link fallbackThreshold}, or n-1 (floored at 1) when unadvertised, where n is
-     * the current cohort size. This is the value the beacon address commits to and
-     * the spend builders must reproduce. Returns 0 before any cohort keys are set.
-     */
-    get effectiveFallbackThreshold() {
-        if (this.#cohortKeys.length === 0)
-            return 0;
-        return resolveFallbackThreshold(this.fallbackThreshold, this.#cohortKeys.length);
-    }
-    /**
-     * Computes the Taproot beacon address from the cohort keys and recovery params.
-     *
-     * The output's key path is the n-of-n MuSig2 aggregate of the cohort keys; its
-     * script path is the recovery tree (a CSV recovery leaf so a missing signer
-     * cannot permanently lock the UTXO). Sets `internalKey`, `tapMerkleRoot`, and
-     * the `tapTweak` the MuSig2 session must apply for the key-path spend.
-     *
-     * The tweak is derived from the Merkle root the address was built with (read
-     * back from the payment), never recomputed by hand, so the MuSig2 key-path
-     * signature is guaranteed to validate against the funded address.
-     */
-    computeBeaconAddress() {
-        if (this.#cohortKeys.length === 0) {
-            throw new AggregationCohortError('Cannot compute beacon address: no cohort keys.', 'NO_COHORT_KEYS', { cohortId: this.id });
-        }
-        if (!this.recoveryKey || this.recoveryKey.length === 0 || this.recoverySequence === undefined) {
-            throw new AggregationCohortError('Cannot compute beacon address: missing recovery key or sequence.', 'NO_RECOVERY_PARAMS', { cohortId: this.id });
-        }
-        const keyAggContext = keyAggregate(this.#cohortKeys);
-        const aggPubkey = keyAggExport(keyAggContext);
-        // The beacon output commits to the script tree (k-of-n fallback leaf + CSV
-        // recovery leaf) alongside the MuSig2 internal key. Derive the address for
-        // the cohort's network. Without the network arg p2tr defaults to mainnet, so
-        // a mutinynet/signet/regtest cohort would otherwise advertise a `bc1p...`
-        // address that no participant can fund.
-        const leaves = buildRecoveryLeaves(this.fundingModel, {
-            recoveryKey: this.recoveryKey,
-            recoverySequence: this.recoverySequence,
-            cohortKeys: this.#cohortKeys,
-            fallbackThreshold: resolveFallbackThreshold(this.fallbackThreshold, this.#cohortKeys.length),
-        });
-        // allowUnknownOutputs: the CSV recovery leaf is a custom script, not one of
-        // p2tr's recognized templates (tr_ns/tr_ms), so the template check must be
-        // waived. The leaf hash (and thus the address) is computed from the raw
-        // script bytes regardless.
-        const payment = p2tr(aggPubkey, leaves, getNetwork(this.network), true);
-        // BIP-341: the key-path tweak commits to the script tree's Merkle root.
-        // taggedHash("TapTweak", internalPubkey || tapMerkleRoot). Use the root the
-        // library committed to (payment.tapMerkleRoot) so the tweak matches the
-        // funded address byte-for-byte.
-        this.internalKey = aggPubkey;
-        this.tapMerkleRoot = payment.tapMerkleRoot;
-        this.tapTweak = schnorr.utils.taggedHash('TapTweak', concatBytes(aggPubkey, payment.tapMerkleRoot));
-        if (!payment.address) {
-            throw new AggregationCohortError('Failed to compute Taproot address', 'BEACON_ADDRESS_ERROR', { cohortId: this.id });
-        }
-        this.beaconAddress = payment.address;
-        return payment.address;
-    }
-    /**
-     * Validates that the participant's key is in the cohort and the beacon address
-     * matches the locally-computed one. Used by participants to verify cohort ready
-     * messages from the service.
-     */
-    validateMembership(participantPkHex, cohortKeysHex, expectedBeaconAddress) {
-        if (!cohortKeysHex.includes(participantPkHex)) {
-            throw new AggregationCohortError(`Participant key not found in cohort ${this.id}.`, 'COHORT_VALIDATION_ERROR', { cohortId: this.id, participantPkHex });
-        }
-        this.cohortKeys = cohortKeysHex.map(k => hexToBytes(k));
-        const computed = this.computeBeaconAddress();
-        if (computed !== expectedBeaconAddress) {
-            throw new AggregationCohortError(`Computed beacon address ${computed} does not match expected ${expectedBeaconAddress}.`, 'BEACON_ADDRESS_MISMATCH', { cohortId: this.id, computed, expected: expectedBeaconAddress });
-        }
-    }
-    /**
-     * Returns the position of a participant's public key in the sorted
-     * {@link cohortKeys} array, or -1 if the participant is not in the cohort.
-     * Required by MuSig2 partial-sig verification which indexes by signer position.
-     */
-    indexOfParticipant(did) {
-        const pk = this.participantKeys.get(did);
-        if (!pk)
-            return -1;
-        return this.#cohortKeys.findIndex(k => k.length === pk.length && k.every((b, i) => b === pk[i]));
-    }
-    addUpdate(participantDid, signedUpdate) {
-        if (!this.participants.includes(participantDid)) {
-            throw new AggregationCohortError(`Participant ${participantDid} is not in cohort ${this.id}.`, 'UNKNOWN_PARTICIPANT', { cohortId: this.id, participantDid });
-        }
-        this.pendingUpdates.set(participantDid, signedUpdate);
-    }
-    /**
-     * Record that a participant declined to submit an update this round
-     * (cooperative non-inclusion). The member stays in the cohort and still signs.
-     */
-    addNonInclusion(participantDid) {
-        if (!this.participants.includes(participantDid)) {
-            throw new AggregationCohortError(`Participant ${participantDid} is not in cohort ${this.id}.`, 'UNKNOWN_PARTICIPANT', { cohortId: this.id, participantDid });
-        }
-        // A DID cannot both submit and decline. The service guards re-submission, but
-        // keep the invariant local so the response gate and builders stay consistent.
-        if (this.pendingUpdates.has(participantDid)) {
-            throw new AggregationCohortError(`Participant ${participantDid} already submitted an update; cannot also decline.`, 'CONFLICTING_RESPONSE', { cohortId: this.id, participantDid });
-        }
-        this.nonIncluded.add(participantDid);
-    }
-    hasAllUpdates() {
-        return this.pendingUpdates.size === this.participants.length;
-    }
-    /**
-     * True when every participant has responded for this round, either with an
-     * update or with an explicit non-inclusion. This is the aggregation gate when
-     * non-inclusion is in play; it generalizes {@link hasAllUpdates} the same way
-     * {@link hasAllValidationResponses} generalizes a unanimous ack.
-     */
-    hasAllResponses() {
-        return this.pendingUpdates.size + this.nonIncluded.size === this.participants.length;
-    }
-    /**
-     * Builds a CAS Announcement Map from collected updates.
-     * Maps each participant DID to base64url canonical hash of their signed update.
-     * Computes signal bytes as SHA-256 of canonicalized announcement.
-     *
-     * Members who declined (cooperative non-inclusion) are naturally absent from
-     * the map: the body iterates {@link pendingUpdates}, which never holds a
-     * decliner. Absence from the map is exactly the CAS non-inclusion signal.
-     */
-    buildCASAnnouncement() {
-        if (!this.hasAllResponses()) {
-            throw new AggregationCohortError('Cannot build CAS Announcement: not all participants have responded.', 'INCOMPLETE_RESPONSES', { cohortId: this.id, updates: this.pendingUpdates.size, declined: this.nonIncluded.size, total: this.participants.length });
-        }
-        const announcement = {};
-        for (const [did, signedUpdate] of this.pendingUpdates) {
-            announcement[did] = canonicalHash(signedUpdate);
-        }
-        this.casAnnouncement = announcement;
-        this.signalBytes = hash(canonicalize(announcement));
-        return announcement;
-    }
-    /**
-     * Builds an SMT tree with one leaf per participant.
-     *
-     * A member who submitted an update gets an inclusion leaf
-     * (SHA-256(SHA-256(nonce) || SHA-256(update))); a member who declined gets a
-     * non-inclusion leaf (SHA-256(SHA-256(nonce)), the `signedUpdate` entry field
-     * omitted). The cohort mints each member's nonce and returns it inside that
-     * member's serialized proof, so a decliner can self-validate its own
-     * non-inclusion slot and the resolver can recompute the leaf. Stores
-     * per-participant proofs and the SMT root as signalBytes.
-     */
-    buildSMTTree() {
-        if (!this.hasAllResponses()) {
-            throw new AggregationCohortError('Cannot build SMT tree: not all participants have responded.', 'INCOMPLETE_RESPONSES', { cohortId: this.id, updates: this.pendingUpdates.size, declined: this.nonIncluded.size, total: this.participants.length });
-        }
-        const tree = new BTCR2MerkleTree();
-        const entries = [];
-        const encoder = new TextEncoder();
-        // Slot every participant: an inclusion leaf for submitters, a non-inclusion
-        // leaf (signedUpdate omitted) for decliners.
-        for (const did of this.participants) {
-            const nonce = randomBytes(32);
-            const signedUpdate = this.pendingUpdates.get(did);
-            if (signedUpdate) {
-                entries.push({ did, nonce, signedUpdate: encoder.encode(canonicalize(signedUpdate)) });
-            }
-            else {
-                entries.push({ did, nonce });
-            }
-        }
-        tree.addEntries(entries);
-        tree.finalize();
-        this.signalBytes = tree.rootHash;
-        this.smtProofs = new Map();
-        for (const did of this.participants) {
-            this.smtProofs.set(did, tree.proof(did));
-        }
-        return this.smtProofs;
-    }
-    addValidation(participantDid, approved) {
-        if (!this.participants.includes(participantDid)) {
-            throw new AggregationCohortError(`Unknown participant ${participantDid} in cohort ${this.id}.`, 'UNKNOWN_PARTICIPANT', { cohortId: this.id, participantDid });
-        }
-        if (approved) {
-            this.validationAcks.add(participantDid);
-        }
-        else {
-            this.validationRejections.add(participantDid);
-        }
-    }
-    /**
-     * True when every participant has either approved or rejected the aggregated data.
-     */
-    hasAllValidationResponses() {
-        return this.validationAcks.size + this.validationRejections.size === this.participants.length;
-    }
-    /**
-     * True when all participants approved. Note: differs from {@link hasAllValidationResponses},
-     * this returns false if any participant rejected, even if all responses are in.
-     */
-    isFullyValidated() {
-        return this.validationRejections.size === 0
-            && this.validationAcks.size === this.participants.length;
-    }
-}
-//# sourceMappingURL=cohort.js.map

package/dist/esm/core/aggregation/cohort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cohort.js","sourceRoot":"","sources":["../../../../src/core/aggregation/cohort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAGtE,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAEhF,OAAO,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AAkB5G;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,iBAAiB;IAC5B,wCAAwC;IACxC,EAAE,CAAS;IAEX,2DAA2D;IAC3D,UAAU,CAAS;IAEnB,sEAAsE;IACtE,eAAe,CAAS;IAExB,uEAAuE;IACvE,OAAO,CAAS;IAEhB,qEAAqE;IACrE,UAAU,CAAS;IAEnB,wEAAwE;IACxE,YAAY,GAAkB,EAAE,CAAC;IAEjC;;;;;OAKG;IACH,eAAe,GAA4B,IAAI,GAAG,EAAE,CAAC;IAErD,kEAAkE;IAClE,WAAW,GAAsB,EAAE,CAAC;IAEpC;;;;;;;OAOG;IACH,QAAQ,GAAe,IAAI,UAAU,EAAE,CAAC;IAExC,kGAAkG;IAClG,WAAW,GAAe,IAAI,UAAU,EAAE,CAAC;IAE3C,8FAA8F;IAC9F,aAAa,GAAe,IAAI,UAAU,EAAE,CAAC;IAE7C,qFAAqF;IACrF,WAAW,CAAc;IAEzB,kFAAkF;IAClF,gBAAgB,CAAU;IAE1B,+EAA+E;IAC/E,YAAY,CAAe;IAE3B;;;OAGG;IACH,iBAAiB,CAAU;IAE3B,wGAAwG;IACxG,aAAa,GAAW,EAAE,CAAC;IAE3B,mEAAmE;IACnE,cAAc,GAAmC,IAAI,GAAG,EAAE,CAAC;IAE3D;;;;;OAKG;IACH,WAAW,GAAgB,IAAI,GAAG,EAAE,CAAC;IAErC,sFAAsF;IACtF,eAAe,CAAmB;IAElC,yDAAyD;IACzD,SAAS,CAAmC;IAE5C,sFAAsF;IACtF,WAAW,CAAc;IAEzB,sEAAsE;IACtE,cAAc,GAAgB,IAAI,GAAG,EAAE,CAAC;IAExC,sEAAsE;IACtE,oBAAoB,GAAgB,IAAI,GAAG,EAAE,CAAC;IAE9C,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,gBAAgB,EAAE,YAAY,EAAE,iBAAiB,EAA2B;QAC3J,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACpC,0EAA0E;QAC1E,0EAA0E;QAC1E,IAAI,CAAC,eAAe,GAAG,eAAe,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,EAAE,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,WAAW,CAAC;QAC5C,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,YAAY,IAAI,qBAAqB,CAAC;QAC1D,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;IAC7C,CAAC;IAED,6DAA6D;IAC7D,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,IAAI,UAAU,CAAC,IAAuB;QACpC,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;;;OAKG;IACH,IAAW,0BAA0B;QACnC,IAAG,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAC3C,OAAO,wBAAwB,CAAC,IAAI,CAAC,iBAAiB,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IACnF,CAAC;IAED;;;;;;;;;;;OAWG;IACI,oBAAoB;QACzB,IAAG,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,sBAAsB,CAC9B,gDAAgD,EAChD,gBAAgB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CACxC,CAAC;QACJ,CAAC;QACD,IAAG,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;YAC7F,MAAM,IAAI,sBAAsB,CAC9B,kEAAkE,EAClE,oBAAoB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CAC5C,CAAC;QACJ,CAAC;QACD,MAAM,aAAa,GAAG,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;QAE9C,2EAA2E;QAC3E,2EAA2E;QAC3E,6EAA6E;QAC7E,0EAA0E;QAC1E,wCAAwC;QACxC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE;YACpD,WAAW,EAAS,IAAI,CAAC,WAAW;YACpC,gBAAgB,EAAI,IAAI,CAAC,gBAAgB;YACzC,UAAU,EAAU,IAAI,CAAC,WAAW;YACpC,iBAAiB,EAAG,wBAAwB,CAAC,IAAI,CAAC,iBAAiB,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;SAC9F,CAAC,CAAC;QACH,4EAA4E;QAC5E,2EAA2E;QAC3E,wEAAwE;QACxE,2BAA2B;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;QAExE,wEAAwE;QACxE,4EAA4E;QAC5E,wEAAwE;QACxE,gCAAgC;QAChC,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;QAC3C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;QAEpG,IAAG,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,IAAI,sBAAsB,CAC9B,mCAAmC,EACnC,sBAAsB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CAC9C,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,OAAO,CAAC;QACrC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CACvB,gBAAwB,EACxB,aAA4B,EAC5B,qBAA6B;QAE7B,IAAG,CAAC,aAAa,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC;YAC7C,MAAM,IAAI,sBAAsB,CAC9B,uCAAuC,IAAI,CAAC,EAAE,GAAG,EACjD,yBAAyB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE,CACnE,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC7C,IAAG,QAAQ,KAAK,qBAAqB,EAAE,CAAC;YACtC,MAAM,IAAI,sBAAsB,CAC9B,2BAA2B,QAAQ,4BAA4B,qBAAqB,GAAG,EACvF,yBAAyB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CAC5F,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,GAAW;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzC,IAAG,CAAC,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC;QAClB,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CACpC,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CACzD,CAAC;IACJ,CAAC;IAEM,SAAS,CAAC,cAAsB,EAAE,YAA+B;QACtE,IAAG,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,sBAAsB,CAC9B,eAAe,cAAc,qBAAqB,IAAI,CAAC,EAAE,GAAG,EAC5D,qBAAqB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,CAC7D,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACI,eAAe,CAAC,cAAsB;QAC3C,IAAG,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,sBAAsB,CAC9B,eAAe,cAAc,qBAAqB,IAAI,CAAC,EAAE,GAAG,EAC5D,qBAAqB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,CAC7D,CAAC;QACJ,CAAC;QACD,8EAA8E;QAC9E,8EAA8E;QAC9E,IAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,sBAAsB,CAC9B,eAAe,cAAc,oDAAoD,EACjF,sBAAsB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,CAC9D,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACvC,CAAC;IAEM,aAAa;QAClB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAC/D,CAAC;IAED;;;;;OAKG;IACI,eAAe;QACpB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACvF,CAAC;IAED;;;;;;;;OAQG;IACI,oBAAoB;QACzB,IAAG,CAAC,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,sBAAsB,CAC9B,qEAAqE,EACrE,sBAAsB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CACnJ,CAAC;QACJ,CAAC;QACD,MAAM,YAAY,GAAoB,EAAE,CAAC;QACzC,KAAI,MAAM,CAAC,GAAG,EAAE,YAAY,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACrD,YAAY,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,eAAe,GAAG,YAAY,CAAC;QACpC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;QACpD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;OAUG;IACI,YAAY;QACjB,IAAG,CAAC,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,sBAAsB,CAC9B,6DAA6D,EAC7D,sBAAsB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CACnJ,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,eAAe,EAAE,CAAC;QACnC,MAAM,OAAO,GAAgB,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAElC,4EAA4E;QAC5E,6CAA6C;QAC7C,KAAI,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;YAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClD,IAAG,YAAY,EAAE,CAAC;gBAChB,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;YACzF,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEhB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,KAAI,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAEM,aAAa,CAAC,cAAsB,EAAE,QAAiB;QAC5D,IAAG,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,sBAAsB,CAC9B,uBAAuB,cAAc,cAAc,IAAI,CAAC,EAAE,GAAG,EAC7D,qBAAqB,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,CAC7D,CAAC;QACJ,CAAC;QACD,IAAG,QAAQ,EAAE,CAAC;YACZ,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED;;OAEG;IACI,yBAAyB;QAC9B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAChG,CAAC;IAED;;;OAGG;IACI,gBAAgB;QACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,KAAK,CAAC;eACtC,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAC7D,CAAC;CACF"}

package/dist/esm/core/aggregation/conditions.js

@@ -1,102 +0,0 @@
-/**
- * Cohort conditions: the constraints an Aggregation Service advertises for a
- * cohort (did:btcr2 spec, "Step 1: Create Aggregation Cohort"). See ADR 039.
- *
- * The spec frames these as an optional menu ("the Aggregation Service can define
- * conditions such as ..."), so only `beaconType` and `minParticipants` are
- * required here; every other condition is optional and, when absent, means
- * unconstrained.
- *
- * Enforcement is staged (ADR 039): `beaconType` and the participant bounds are
- * enforced by the state machine now; DIDs-per-participant, timing/cadence, and
- * the pending-update trigger are modeled and advertised here but enforced when
- * the multi-cohort (AGG-4) and non-inclusion (AGG-5) tracks land. The two cost
- * conditions are advertised metadata only - the protocol performs no payment or
- * settlement (consistent with ADR 008).
- */
-import { MAX_RECOVERY_SEQUENCE } from './recovery-policy.js';
-/** Beacon types that support aggregation (singleton is single-party only, per ADR 037). */
-export const KNOWN_BEACON_TYPES = ['CASBeacon', 'SMTBeacon'];
-/** Funding models an operator may advertise. Only 'operator-funded' is implemented (ADR 042). */
-export const KNOWN_FUNDING_MODELS = ['operator-funded', 'participant-funded'];
-/** Validate an optional [min, max] integer pair. */
-function checkPair(problems, label, min, max) {
-    if (min !== undefined && (!Number.isInteger(min) || min < 0)) {
-        problems.push(`min${label} must be an integer >= 0`);
-    }
-    if (max !== undefined && (!Number.isInteger(max) || max < 0)) {
-        problems.push(`max${label} must be an integer >= 0`);
-    }
-    if (min !== undefined && max !== undefined && Number.isInteger(min) && Number.isInteger(max) && max < min) {
-        problems.push(`max${label} must be >= min${label}`);
-    }
-}
-/** Validate an optional advertised cost. */
-function checkCost(problems, label, cost) {
-    if (cost === undefined)
-        return;
-    if (typeof cost.amount !== 'number' || !Number.isFinite(cost.amount) || cost.amount < 0) {
-        problems.push(`${label}.amount must be a finite number >= 0`);
-    }
-    if (typeof cost.unit !== 'string' || cost.unit.length === 0) {
-        problems.push(`${label}.unit must be a non-empty string`);
-    }
-    if (cost.basis !== undefined && cost.basis !== 'per-did' && cost.basis !== 'per-participant') {
-        problems.push(`${label}.basis must be 'per-did' or 'per-participant'`);
-    }
-}
-/**
- * Validate a set of cohort conditions. Returns a list of human-readable problems
- * (empty when valid) so the caller can decide how to surface them. Used by
- * `createCohort()` to fail fast instead of discovering invalidity at finalize.
- */
-export function validateCohortConditions(c) {
-    const problems = [];
-    if (!KNOWN_BEACON_TYPES.includes(c.beaconType)) {
-        problems.push(`beaconType must be one of ${KNOWN_BEACON_TYPES.join(', ')}`);
-    }
-    if (!Number.isInteger(c.minParticipants) || c.minParticipants < 1) {
-        problems.push('minParticipants must be an integer >= 1');
-    }
-    if (c.maxParticipants !== undefined) {
-        if (!Number.isInteger(c.maxParticipants) || c.maxParticipants < 1) {
-            problems.push('maxParticipants must be an integer >= 1');
-        }
-        else if (Number.isInteger(c.minParticipants) && c.maxParticipants < c.minParticipants) {
-            problems.push('maxParticipants must be >= minParticipants');
-        }
-    }
-    checkPair(problems, 'DidsPerParticipant', c.minDidsPerParticipant, c.maxDidsPerParticipant);
-    checkPair(problems, 'SecondsBetweenAnnouncements', c.minSecondsBetweenAnnouncements, c.maxSecondsBetweenAnnouncements);
-    if (c.pendingUpdateTrigger !== undefined && (!Number.isInteger(c.pendingUpdateTrigger) || c.pendingUpdateTrigger < 1)) {
-        problems.push('pendingUpdateTrigger must be an integer >= 1');
-    }
-    // Fallback threshold (k of the k-of-n fallback leaf). Optional; when advertised
-    // it must be a positive integer and cannot exceed maxParticipants (the binding
-    // upper bound against the actual cohort size n is checked at keygen, where n is
-    // known). See ADR 042.
-    if (c.fallbackThreshold !== undefined) {
-        if (!Number.isInteger(c.fallbackThreshold) || c.fallbackThreshold < 1) {
-            problems.push('fallbackThreshold must be an integer >= 1');
-        }
-        else if (c.maxParticipants !== undefined && Number.isInteger(c.maxParticipants) && c.fallbackThreshold > c.maxParticipants) {
-            problems.push('fallbackThreshold must be <= maxParticipants');
-        }
-    }
-    checkCost(problems, 'costOfEnrollment', c.costOfEnrollment);
-    checkCost(problems, 'costPerAnnouncement', c.costPerAnnouncement);
-    // Recovery params: the beacon output's CSV recovery leaf. Required so a
-    // missing signer can never permanently lock the funded UTXO (ADR 042). The
-    // key is an x-only (32-byte) Schnorr public key, carried as 64 hex chars.
-    if (typeof c.recoveryKey !== 'string' || !/^[0-9a-fA-F]{64}$/.test(c.recoveryKey)) {
-        problems.push('recoveryKey must be a 64-character hex string (x-only public key)');
-    }
-    if (!Number.isInteger(c.recoverySequence) || c.recoverySequence < 1 || c.recoverySequence > MAX_RECOVERY_SEQUENCE) {
-        problems.push(`recoverySequence must be a block-based BIP-68 relative timelock in [1, ${MAX_RECOVERY_SEQUENCE}]`);
-    }
-    if (c.fundingModel !== undefined && !KNOWN_FUNDING_MODELS.includes(c.fundingModel)) {
-        problems.push(`fundingModel must be one of ${KNOWN_FUNDING_MODELS.join(', ')}`);
-    }
-    return problems;
-}
-//# sourceMappingURL=conditions.js.map

package/dist/esm/core/aggregation/conditions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"conditions.js","sourceRoot":"","sources":["../../../../src/core/aggregation/conditions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAE7D,2FAA2F;AAC3F,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,WAAW,EAAE,WAAW,CAAU,CAAC;AAEtE,iGAAiG;AACjG,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,iBAAiB,EAAE,oBAAoB,CAAU,CAAC;AA8DvF,oDAAoD;AACpD,SAAS,SAAS,CAAC,QAAkB,EAAE,KAAa,EAAE,GAAY,EAAE,GAAY;IAC9E,IAAG,GAAG,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5D,QAAQ,CAAC,IAAI,CAAC,MAAM,KAAK,0BAA0B,CAAC,CAAC;IACvD,CAAC;IACD,IAAG,GAAG,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5D,QAAQ,CAAC,IAAI,CAAC,MAAM,KAAK,0BAA0B,CAAC,CAAC;IACvD,CAAC;IACD,IAAG,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;QACzG,QAAQ,CAAC,IAAI,CAAC,MAAM,KAAK,kBAAkB,KAAK,EAAE,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,4CAA4C;AAC5C,SAAS,SAAS,CAAC,QAAkB,EAAE,KAAa,EAAE,IAAiB;IACrE,IAAG,IAAI,KAAK,SAAS;QAAE,OAAO;IAC9B,IAAG,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvF,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,sCAAsC,CAAC,CAAC;IAChE,CAAC;IACD,IAAG,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,kCAAkC,CAAC,CAAC;IAC5D,CAAC;IACD,IAAG,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,iBAAiB,EAAE,CAAC;QAC5F,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,+CAA+C,CAAC,CAAC;IACzE,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CAAC,CAAmB;IAC1D,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAG,CAAE,kBAAwC,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;QACrE,QAAQ,CAAC,IAAI,CAAC,6BAA6B,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,IAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;QACjE,QAAQ,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;IAC3D,CAAC;IACD,IAAG,CAAC,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;QACnC,IAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;YACjE,QAAQ,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QAC3D,CAAC;aAAM,IAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC;YACvF,QAAQ,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,SAAS,CAAC,QAAQ,EAAE,oBAAoB,EAAE,CAAC,CAAC,qBAAqB,EAAE,CAAC,CAAC,qBAAqB,CAAC,CAAC;IAC5F,SAAS,CAAC,QAAQ,EAAE,6BAA6B,EAAE,CAAC,CAAC,8BAA8B,EAAE,CAAC,CAAC,8BAA8B,CAAC,CAAC;IAEvH,IAAG,CAAC,CAAC,oBAAoB,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,oBAAoB,GAAG,CAAC,CAAC,EAAE,CAAC;QACrH,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;IAChE,CAAC;IAED,gFAAgF;IAChF,+EAA+E;IAC/E,gFAAgF;IAChF,uBAAuB;IACvB,IAAG,CAAC,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;QACrC,IAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YACrE,QAAQ,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;QAC7D,CAAC;aAAM,IAAG,CAAC,CAAC,eAAe,KAAK,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC;YAC5H,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED,SAAS,CAAC,QAAQ,EAAE,kBAAkB,EAAE,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAC5D,SAAS,CAAC,QAAQ,EAAE,qBAAqB,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC;IAElE,wEAAwE;IACxE,2EAA2E;IAC3E,0EAA0E;IAC1E,IAAG,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC;QACjF,QAAQ,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;IACrF,CAAC;IACD,IAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,GAAG,CAAC,IAAI,CAAC,CAAC,gBAAgB,GAAG,qBAAqB,EAAE,CAAC;QACjH,QAAQ,CAAC,IAAI,CAAC,0EAA0E,qBAAqB,GAAG,CAAC,CAAC;IACpH,CAAC;IACD,IAAG,CAAC,CAAC,YAAY,KAAK,SAAS,IAAI,CAAE,oBAA0C,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;QACzG,QAAQ,CAAC,IAAI,CAAC,+BAA+B,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClF,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/esm/core/aggregation/errors.js

@@ -1,22 +0,0 @@
-import { MethodError } from '@did-btcr2/common';
-export class AggregationServiceError extends MethodError {
-    constructor(message, type = 'AggregationServiceError', data) {
-        super(message, type, data);
-    }
-}
-export class AggregationParticipantError extends MethodError {
-    constructor(message, type = 'AggregationParticipantError', data) {
-        super(message, type, data);
-    }
-}
-export class AggregationCohortError extends MethodError {
-    constructor(message, type = 'AggregationCohortError', data) {
-        super(message, type, data);
-    }
-}
-export class SigningSessionError extends MethodError {
-    constructor(message, type = 'SigningSessionError', data) {
-        super(message, type, data);
-    }
-}
-//# sourceMappingURL=errors.js.map

package/dist/esm/core/aggregation/errors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"errors.js","sourceRoot":"","sources":["../../../../src/core/aggregation/errors.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD,MAAM,OAAO,uBAAwB,SAAQ,WAAW;IACtD,YAAY,OAAe,EAAE,OAAe,yBAAyB,EAAE,IAA0B;QAC/F,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;CACF;AAED,MAAM,OAAO,2BAA4B,SAAQ,WAAW;IAC1D,YAAY,OAAe,EAAE,OAAe,6BAA6B,EAAE,IAA0B;QACnG,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;CACF;AAED,MAAM,OAAO,sBAAuB,SAAQ,WAAW;IACrD,YAAY,OAAe,EAAE,OAAe,wBAAwB,EAAE,IAA0B;QAC9F,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;CACF;AAED,MAAM,OAAO,mBAAoB,SAAQ,WAAW;IAClD,YAAY,OAAe,EAAE,OAAe,qBAAqB,EAAE,IAA0B;QAC3F,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;CACF"}

package/dist/esm/core/aggregation/fallback-spend.js

@@ -1,132 +0,0 @@
-/**
- * Fallback spend builder for aggregate beacon outputs.
- *
- * An aggregate beacon UTXO is a Taproot output whose key path is the cohort's
- * n-of-n MuSig2 aggregate key and whose script path carries a k-of-n fallback
- * leaf (`p2tr_ms` CHECKSIGADD) plus a CSV recovery leaf (see
- * {@link ./recovery-policy.ts} and ADR 042). When the optimistic n-of-n key path
- * stalls (a missing or defecting signer), the cohort can still push the SAME
- * announcement transaction through the fallback leaf with any k members'
- * signatures, instead of abandoning the round or waiting out the recovery
- * timelock.
- *
- * Unlike the MuSig2 key path, the fallback is a plain k-of-n script-path spend:
- * each signer produces a standalone BIP-340 signature over the script-path
- * sighash (no nonce round), and the coordinator assembles k of them into the
- * witness. The coordinator never holds a participant secret - it injects the
- * collected signatures and finalizes.
- *
- * This module is pure with respect to the network: it takes the beacon
- * transaction, the cohort and recovery parameters, the spent output, and the
- * collected signatures, and returns a finalized {@link Transaction}.
- * Broadcasting is the caller's concern.
- */
-import { getNetwork } from '@did-btcr2/bitcoin';
-import { schnorr } from '@noble/curves/secp256k1.js';
-import { SigHash, p2tr } from '@scure/btc-signer';
-import { keyAggExport, keyAggregate, sortKeys } from '@scure/btc-signer/musig2';
-import { AggregationCohortError } from './errors.js';
-import { DEFAULT_FUNDING_MODEL, TAPROOT_LEAF_VERSION, buildFallbackLeaf, buildRecoveryLeaves, resolveFallbackThreshold, tapLeafHash, } from './recovery-policy.js';
-function bytesEqual(a, b) {
-    return a.length === b.length && a.every((x, i) => x === b[i]);
-}
-/**
- * Compute the BIP-341 script-path sighash a cohort member must sign to authorize
- * the fallback spend. The leaf is the k-of-n fallback leaf; signers produce a
- * standalone BIP-340 signature over this digest with SIGHASH_DEFAULT.
- */
-export function fallbackSighash(tx, inputIndex, prevOutScript, prevOutValue, fallbackLeafScript) {
-    return tx.preimageWitnessV1(inputIndex, [prevOutScript], SigHash.DEFAULT, [prevOutValue], undefined, fallbackLeafScript, TAPROOT_LEAF_VERSION);
-}
-/**
- * Assemble and finalize a k-of-n fallback spend of an aggregate beacon UTXO.
- *
- * Reconstructs the funded Taproot output (MuSig2 internal key + fallback/recovery
- * script tree), verifies each collected signature against the script-path
- * sighash and a cohort key, injects exactly k distinct valid signatures into the
- * fallback leaf, and finalizes the witness. The returned transaction is the same
- * announcement the optimistic path would have produced, signed via the script
- * path instead of the key path.
- *
- * @throws {AggregationCohortError} when there are no cohort keys, the spent
- * script does not match the reconstructed tree output, or fewer than k valid
- * distinct signatures were supplied.
- */
-export function buildFallbackSpend(params) {
-    const { pendingTx, cohortKeys, recoveryKey, recoverySequence, fundingModel, network, prevOutScript, prevOutValue, signatures, } = params;
-    const inputIndex = params.inputIndex ?? 0;
-    if (cohortKeys.length === 0) {
-        throw new AggregationCohortError('Cannot build fallback spend: no cohort keys.', 'NO_COHORT_KEYS');
-    }
-    // Resolve k the same way the cohort did, so the reconstructed leaf matches.
-    const fallbackThreshold = resolveFallbackThreshold(params.fallbackThreshold, cohortKeys.length);
-    // Reconstruct the funded output the same way the cohort derived its address.
-    const internalKey = keyAggExport(keyAggregate(sortKeys(cohortKeys)));
-    const leaves = buildRecoveryLeaves(fundingModel ?? DEFAULT_FUNDING_MODEL, {
-        recoveryKey, recoverySequence, cohortKeys, fallbackThreshold,
-    });
-    const net = getNetwork(network);
-    // allowUnknownOutputs: the CSV recovery leaf is a custom script (see cohort.ts).
-    const payment = p2tr(internalKey, leaves, net, true);
-    // The output we are spending must be the cohort's funded beacon output; if the
-    // reconstructed tree script differs, the witness would not match the chain.
-    if (!bytesEqual(payment.script, prevOutScript)) {
-        throw new AggregationCohortError('Reconstructed beacon output script does not match the spent prevout script.', 'PREVOUT_SCRIPT_MISMATCH');
-    }
-    const fallbackLeaf = buildFallbackLeaf({ cohortKeys, fallbackThreshold });
-    // Locate the fallback leaf's tapLeafScript entry: each entry is
-    // [controlBlock, script || leafVersion]; strip the trailing version byte to
-    // compare the script.
-    const leafEntry = payment.tapLeafScript?.find(([, scriptVer]) => {
-        const script = scriptVer.slice(0, scriptVer.length - 1);
-        return bytesEqual(script, fallbackLeaf);
-    });
-    if (!leafEntry) {
-        throw new AggregationCohortError('Could not locate the fallback leaf in the reconstructed beacon output.', 'FALLBACK_LEAF_NOT_FOUND');
-    }
-    // Validate the collected signatures against the script-path sighash. The leaf
-    // is keyed by x-only cohort keys, so a valid signature must verify against one
-    // of them. Keep only distinct, valid signatures (first occurrence per key).
-    const cohortXOnly = sortKeys(cohortKeys).map(k => k.slice(1));
-    const tx = pendingTx;
-    const sighash = fallbackSighash(tx, inputIndex, prevOutScript, prevOutValue, fallbackLeaf);
-    const leafHash = tapLeafHash(fallbackLeaf);
-    const accepted = new Map(); // x-only hex to signature
-    for (const { pubKey, signature } of signatures) {
-        if (pubKey.length !== 32 || signature.length !== 64)
-            continue;
-        const isCohortKey = cohortXOnly.some(k => bytesEqual(k, pubKey));
-        if (!isCohortKey)
-            continue;
-        const hex = Array.from(pubKey, b => b.toString(16).padStart(2, '0')).join('');
-        if (accepted.has(hex))
-            continue;
-        let ok = false;
-        try {
-            ok = schnorr.verify(signature, sighash, pubKey);
-        }
-        catch {
-            ok = false;
-        }
-        if (ok)
-            accepted.set(hex, signature);
-    }
-    if (accepted.size < fallbackThreshold) {
-        throw new AggregationCohortError(`Not enough valid fallback signatures: have ${accepted.size}, need ${fallbackThreshold}.`, 'NOT_ENOUGH_FALLBACK_SIGNATURES', { have: accepted.size, need: fallbackThreshold });
-    }
-    // A k-of-n CHECKSIGADD leaf demands EXACTLY k satisfied signatures (the final
-    // <k> NUMEQUAL fails if the running count differs), so inject exactly k.
-    const chosen = cohortXOnly
-        .filter(k => accepted.has(Array.from(k, b => b.toString(16).padStart(2, '0')).join('')))
-        .slice(0, fallbackThreshold);
-    tx.updateInput(inputIndex, {
-        tapLeafScript: [leafEntry],
-        tapScriptSig: chosen.map(pubKey => {
-            const hex = Array.from(pubKey, b => b.toString(16).padStart(2, '0')).join('');
-            return [{ pubKey, leafHash }, accepted.get(hex)];
-        }),
-    });
-    tx.finalize();
-    return tx;
-}
-//# sourceMappingURL=fallback-spend.js.map

package/dist/esm/core/aggregation/fallback-spend.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fallback-spend.js","sourceRoot":"","sources":["../../../../src/core/aggregation/fallback-spend.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAErD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAChF,OAAO,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EACL,qBAAqB,EACrB,oBAAoB,EACpB,iBAAiB,EACjB,mBAAmB,EACnB,wBAAwB,EACxB,WAAW,GACZ,MAAM,sBAAsB,CAAC;AAmD9B,SAAS,UAAU,CAAC,CAAa,EAAE,CAAa;IAC9C,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC7B,EAAe,EACf,UAAkB,EAClB,aAAyB,EACzB,YAAoB,EACpB,kBAA8B;IAE9B,OAAO,EAAE,CAAC,iBAAiB,CACzB,UAAU,EACV,CAAE,aAAa,CAAE,EACjB,OAAO,CAAC,OAAO,EACf,CAAE,YAAY,CAAE,EAChB,SAAS,EACT,kBAAkB,EAClB,oBAAoB,CACrB,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAA2B;IAC5D,MAAM,EACJ,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,gBAAgB,EACpD,YAAY,EAAE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,UAAU,GAC/D,GAAG,MAAM,CAAC;IACX,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC;IAE1C,IAAG,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,sBAAsB,CAC9B,8CAA8C,EAC9C,gBAAgB,CACjB,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,MAAM,iBAAiB,GAAG,wBAAwB,CAAC,MAAM,CAAC,iBAAiB,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IAEhG,6EAA6E;IAC7E,MAAM,WAAW,GAAG,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,mBAAmB,CAAC,YAAY,IAAI,qBAAqB,EAAE;QACxE,WAAW,EAAE,gBAAgB,EAAE,UAAU,EAAE,iBAAiB;KAC7D,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAChC,iFAAiF;IACjF,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAErD,+EAA+E;IAC/E,4EAA4E;IAC5E,IAAG,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,sBAAsB,CAC9B,6EAA6E,EAC7E,yBAAyB,CAC1B,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,iBAAiB,CAAC,EAAE,UAAU,EAAE,iBAAiB,EAAE,CAAC,CAAC;IAC1E,gEAAgE;IAChE,4EAA4E;IAC5E,sBAAsB;IACtB,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAE,AAAD,EAAG,SAAS,CAAE,EAAE,EAAE;QAChE,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxD,OAAO,UAAU,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IACH,IAAG,CAAC,SAAS,EAAE,CAAC;QACd,MAAM,IAAI,sBAAsB,CAC9B,wEAAwE,EACxE,yBAAyB,CAC1B,CAAC;IACJ,CAAC;IAED,8EAA8E;IAC9E,+EAA+E;IAC/E,4EAA4E;IAC5E,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,EAAE,GAAG,SAAS,CAAC;IACrB,MAAM,OAAO,GAAG,eAAe,CAAC,EAAE,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;IAE3F,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAC,0BAA0B;IAC1E,KAAI,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,UAAU,EAAE,CAAC;QAC9C,IAAG,MAAM,CAAC,MAAM,KAAK,EAAE,IAAI,SAAS,CAAC,MAAM,KAAK,EAAE;YAAE,SAAS;QAC7D,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QACjE,IAAG,CAAC,WAAW;YAAE,SAAS;QAC1B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9E,IAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC/B,IAAI,EAAE,GAAG,KAAK,CAAC;QACf,IAAI,CAAC;YAAC,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,EAAE,GAAG,KAAK,CAAC;QAAC,CAAC;QAC9E,IAAG,EAAE;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;IACtC,CAAC;IAED,IAAG,QAAQ,CAAC,IAAI,GAAG,iBAAiB,EAAE,CAAC;QACrC,MAAM,IAAI,sBAAsB,CAC9B,8CAA8C,QAAQ,CAAC,IAAI,UAAU,iBAAiB,GAAG,EACzF,gCAAgC,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,iBAAiB,EAAE,CACnF,CAAC;IACJ,CAAC;IAED,8EAA8E;IAC9E,yEAAyE;IACzE,MAAM,MAAM,GAAG,WAAW;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;SACvF,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAE/B,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE;QACzB,aAAa,EAAG,CAAE,SAAS,CAAE;QAC7B,YAAY,EAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YAClC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9E,OAAO,CAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,CAAE,CAAC;QACtD,CAAC,CAAC;KACH,CAAC,CAAC;IACH,EAAE,CAAC,QAAQ,EAAE,CAAC;IACd,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/esm/core/aggregation/logger.js

@@ -1,15 +0,0 @@
-/** Console-backed logger. Default for runners and transports. */
-export const CONSOLE_LOGGER = {
-    debug: (msg, ...args) => console.debug(msg, ...args),
-    info: (msg, ...args) => console.info(msg, ...args),
-    warn: (msg, ...args) => console.warn(msg, ...args),
-    error: (msg, ...args) => console.error(msg, ...args),
-};
-/** No-op logger. Useful for tests and production environments with own logging pipeline. */
-export const SILENT_LOGGER = {
-    debug: () => { },
-    info: () => { },
-    warn: () => { },
-    error: () => { },
-};
-//# sourceMappingURL=logger.js.map

package/dist/esm/core/aggregation/logger.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"logger.js","sourceRoot":"","sources":["../../../../src/core/aggregation/logger.ts"],"names":[],"mappings":"AAkBA,iEAAiE;AACjE,MAAM,CAAC,MAAM,cAAc,GAAW;IACpC,KAAK,EAAG,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;IACrD,IAAI,EAAI,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;IACpD,IAAI,EAAI,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;IACpD,KAAK,EAAG,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;CACtD,CAAC;AAEF,4FAA4F;AAC5F,MAAM,CAAC,MAAM,aAAa,GAAW;IACnC,KAAK,EAAG,GAAG,EAAE,GAAE,CAAC;IAChB,IAAI,EAAI,GAAG,EAAE,GAAE,CAAC;IAChB,IAAI,EAAI,GAAG,EAAE,GAAE,CAAC;IAChB,KAAK,EAAG,GAAG,EAAE,GAAE,CAAC;CACjB,CAAC"}