@enbox/dwn-sdk-js 0.3.9 → 0.4.1

package/dist/types/src/event-stream/event-emitter-event-log.d.ts

@@ -1,80 +0,0 @@
-import type { KeyValues } from '../types/query-types.js';
-import type { EventLog, EventLogReadOptions, EventLogReadResult, EventLogSubscribeOptions, EventSubscription, MessageEvent, ProgressToken, SubscriptionListener } from '../types/subscriptions.js';
-export interface EventEmitterEventLogConfig {
-    /**
-     * Maximum number of events to retain per tenant.
-     * Oldest events are evicted when the limit is reached.
-     * Defaults to 10_000.
-     */
-    maxEventsPerTenant?: number;
-    /**
-     * An optional error handler in order to be able to react to any errors or warnings.
-     * By default we log errors with `console.error`.
-     */
-    errorHandler?: (error: any) => void;
-}
-/**
- * In-memory implementation of {@link EventLog} backed by `mitt` for in-process
- * pub/sub and a per-tenant `Map<number, StoredEntry>` for persistence with
- * cursor-based reads.
- *
- * Suitable for single-process embedded DWN instances and tests.
- * For multi-node deployments, use a distributed implementation (NATS, Redis, etc.).
- */
-export declare class EventEmitterEventLog implements EventLog {
-    private readonly emitter;
-    private isOpen;
-    private readonly errorHandler;
-    private readonly maxEventsPerTenant;
-    /**
-     * Per-tenant ordered event storage.
-     * Key: tenant DID → Map of seq → StoredEntry.
-     */
-    private readonly tenantLogs;
-    /**
-     * Per-tenant monotonic sequence counter.
-     */
-    private readonly tenantSeqs;
-    /**
-     * Epoch for this EventLog instance. Generated once at construction as a
-     * UUID v4. Changes every restart (correct for in-memory — state is lost).
-     */
-    private readonly epoch;
-    constructor(config?: EventEmitterEventLogConfig);
-    /**
-     * Derives a stable `streamId` for a given tenant. Deterministic — same
-     * tenant always produces the same streamId on any instance.
-     */
-    private getStreamId;
-    /**
-     * Constructs a {@link ProgressToken} from internal state.
-     */
-    private buildToken;
-    /**
-     * Validates a cursor against the current EventLog state. Throws
-     * `DwnError(EventLogProgressGap)` with {@link ProgressGapInfo} metadata
-     * if the cursor cannot be resumed.
-     */
-    private validateCursor;
-    open(): Promise<void>;
-    close(): Promise<void>;
-    emit(tenant: string, event: MessageEvent, indexes: KeyValues, messageCid: string): Promise<ProgressToken | undefined>;
-    read(tenant: string, options?: EventLogReadOptions): Promise<EventLogReadResult>;
-    /**
-     * Parse a position string into an internal sequence number using BigInt
-     * for safe handling of values beyond `Number.MAX_SAFE_INTEGER`.
-     *
-     * The returned `number` is safe for the in-memory EventLog which uses
-     * `Map<number, StoredEntry>` keys — in-memory sequences will never
-     * exceed safe integer range. The BigInt parse validates correctness
-     * before the narrowing conversion.
-     */
-    private static parsePosition;
-    subscribe(tenant: string, id: string, listener: SubscriptionListener, options?: EventLogSubscribeOptions): Promise<EventSubscription>;
-    getReplayBounds(tenant: string): Promise<{
-        oldest: ProgressToken;
-        latest: ProgressToken;
-    } | undefined>;
-    trim(tenant: string, olderThan: number | string): Promise<void>;
-}
-//# sourceMappingURL=event-emitter-event-log.d.ts.map

package/dist/types/src/event-stream/event-emitter-event-log.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"event-emitter-event-log.d.ts","sourceRoot":"","sources":["../../../../src/event-stream/event-emitter-event-log.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EACV,QAAQ,EAER,mBAAmB,EACnB,kBAAkB,EAClB,wBAAwB,EACxB,iBAAiB,EACjB,YAAY,EAGZ,aAAa,EACb,oBAAoB,EACrB,MAAM,2BAA2B,CAAC;AA8BnC,MAAM,WAAW,0BAA0B;IACzC;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAE5B;;;OAGG;IACH,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,IAAI,CAAC;CACrC;AAED;;;;;;;GAOG;AACH,qBAAa,oBAAqB,YAAW,QAAQ;IACnD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAyB;IACjD,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAuF;IACpH,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAS;IAE5C;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoD;IAE/E;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAkC;IAE7D;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;gBAEnB,MAAM,GAAE,0BAA+B;IASnD;;;OAGG;YACW,WAAW;IAQzB;;OAEG;YACW,UAAU;IASxB;;;;OAIG;YACW,cAAc;IA0Cf,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAIrB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAOtB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,SAAS,CAAC;IAwCrH,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE,mBAAwB,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAgDjG;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;IAaf,SAAS,CACpB,MAAM,EAAE,MAAM,EACd,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,oBAAoB,EAC9B,OAAO,CAAC,EAAE,wBAAwB,GACjC,OAAO,CAAC,iBAAiB,CAAC;IA2FhB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,MAAM,EAAE,aAAa,CAAA;KAAE,GAAG,SAAS,CAAC;IAoBtG,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAuB7E"}

package/dist/types/src/handlers/messages-sync.d.ts

@@ -1,83 +0,0 @@
-import type { HandlerDependencies, MethodHandler } from '../types/method-handler.js';
-import type { MessagesSyncMessage, MessagesSyncReply } from '../types/messages-types.js';
-export declare class MessagesSyncHandler implements MethodHandler {
-    private readonly deps;
-    constructor(deps: HandlerDependencies);
-    handle({ tenant, message }: {
-        tenant: string;
-        message: MessagesSyncMessage;
-    }): Promise<MessagesSyncReply>;
-    private handleRoot;
-    private getRootHex;
-    private getIndexedRootHash;
-    private handleSubtree;
-    private handleLeaves;
-    private getSubtreeHash;
-    private getLeaves;
-    private getIndexedSubtreeHash;
-    private getIndexedLeaves;
-    /**
-     * Handle the 'diff' action: the client sends its subtree hashes at a given
-     * depth, and the server compares them against its own tree to compute the
-     * set difference in a single round-trip.
-     *
-     * Response includes:
-     * - `onlyRemote`: messages the server has that the client doesn't, with
-     *   inline data for small payloads.
-     * - `onlyLocal`: bit prefixes where the client has entries the server
-     *   doesn't (client can enumerate its own leaves for these prefixes).
-     */
-    private handleDiff;
-    /**
-     * Walk the server's SMT to the given depth and collect all non-empty
-     * subtree hashes as a `{ prefix: hexHash }` map.
-     */
-    private collectSubtreeHashes;
-    private createProjectionSnapshot;
-    private static getServerLeaves;
-    private static getServerSubtreeHash;
-    private static getIndexedLeavesFromStateIndex;
-    private static getIndexedSubtreeHashFromStateIndex;
-    /**
-     * Get the hex-encoded default hash for a given depth. Lazily cached.
-     */
-    private _defaultHashHexCache?;
-    private getDefaultHashHex;
-    /**
-     * Build diff response entries for the given messageCids.
-     * Reads each message from the MessageStore and, for small RecordsWrite
-     * payloads, inlines the data as base64url.
-     */
-    private buildDiffEntries;
-    private buildProjectedDependencyEntries;
-    private readRecordsDeleteInitialWrite;
-    private static addRecordsInitialWriteDependency;
-    private addProtocolConfigClosureDependencies;
-    private getCachedGoverningProtocolsConfigure;
-    private static addProtocolConfigDependencies;
-    private static addProtocolConfigDependency;
-    private static takeNextUnvisitedProtocol;
-    private static queueUnvisitedProtocols;
-    private static protocolsConfigureUses;
-    private readGoverningProtocolsConfigure;
-    private static recordsWriteProtocolMetadata;
-    private static recordsDeleteRecordId;
-    private static toWireMessage;
-    /**
-     * Read a message and its data from the MessageStore + DataStore by CID.
-     */
-    private readMessageByCid;
-    private static hasEncodedData;
-    private static getProjectionScopes;
-    private withProjectionSnapshot;
-    /**
-     * Read a ReadableStream to completion and return the bytes.
-     */
-    private static streamToBytes;
-    /**
-     * Parse a bit prefix string (e.g. "0110101") into a boolean array.
-     */
-    private static parseBitPrefix;
-    private static authorizeMessagesSync;
-}
-//# sourceMappingURL=messages-sync.d.ts.map

package/dist/types/src/handlers/messages-sync.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"messages-sync.d.ts","sourceRoot":"","sources":["../../../../src/handlers/messages-sync.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AACrF,OAAO,KAAK,EAAsD,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AA2C7I,qBAAa,mBAAoB,YAAW,aAAa;IAE3C,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAAJ,IAAI,EAAE,mBAAmB;IAEzC,MAAM,CAAC,EAClB,MAAM,EACN,OAAO,EACR,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,mBAAmB,CAAA;KAAE,GAAG,OAAO,CAAC,iBAAiB,CAAC;YAgDlE,UAAU;YAYV,UAAU;YAaV,kBAAkB;YAWlB,aAAa;YAcb,YAAY;YAcZ,cAAc;YAad,SAAS;YAaT,qBAAqB;YAQrB,gBAAgB;IAQ9B;;;;;;;;;;OAUG;YACW,UAAU;IA2FxB;;;OAGG;YACW,oBAAoB;YA2CpB,wBAAwB;mBAejB,eAAe;mBAcf,oBAAoB;mBAcpB,8BAA8B;mBAa9B,mCAAmC;IAaxD;;OAEG;IACH,OAAO,CAAC,oBAAoB,CAAC,CAAsB;YACrC,iBAAiB;IAY/B;;;;OAIG;YACW,gBAAgB;YAiChB,+BAA+B;YAkD/B,6BAA6B;mBAkBtB,gCAAgC;YAkBvC,oCAAoC;YAoCpC,oCAAoC;mBAiB7B,6BAA6B;mBAuB7B,2BAA2B;IAkBhD,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAexC,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAYtC,OAAO,CAAC,MAAM,CAAC,sBAAsB;YAcvB,+BAA+B;IAoB7C,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAc3C,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAYpC,OAAO,CAAC,MAAM,CAAC,aAAa;IAK5B;;OAEG;YACW,gBAAgB;IAyC9B,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B,OAAO,CAAC,MAAM,CAAC,mBAAmB;YAWpB,sBAAsB;IAkBpC;;OAEG;mBACkB,aAAa;IAqBlC;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;mBAgBR,qBAAqB;CAuB3C"}

package/dist/types/src/interfaces/messages-sync.d.ts

@@ -1,23 +0,0 @@
-import type { MessageSigner } from '../types/signer.js';
-import type { RecordsProjectionScope } from '../sync/records-projection.js';
-import type { MessagesSyncAction, MessagesSyncMessage } from '../types/messages-types.js';
-import { AbstractMessage } from '../core/abstract-message.js';
-export type MessagesSyncOptions = {
-    signer: MessageSigner;
-    action: MessagesSyncAction;
-    protocol?: string;
-    projectionRootVersion?: string;
-    projectionScopes?: RecordsProjectionScope[];
-    prefix?: string;
-    messageTimestamp?: string;
-    permissionGrantIds?: string[];
-    /** For `action: 'diff'`: client's subtree hashes at `depth`. */
-    hashes?: Record<string, string>;
-    /** For `action: 'diff'`: bit depth at which hashes were computed. */
-    depth?: number;
-};
-export declare class MessagesSync extends AbstractMessage<MessagesSyncMessage> {
-    static parse(message: MessagesSyncMessage): Promise<MessagesSync>;
-    static create(options: MessagesSyncOptions): Promise<MessagesSync>;
-}
-//# sourceMappingURL=messages-sync.d.ts.map

package/dist/types/src/interfaces/messages-sync.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"messages-sync.d.ts","sourceRoot":"","sources":["../../../../src/interfaces/messages-sync.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAC5E,OAAO,KAAK,EAAE,kBAAkB,EAA0B,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAElH,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAS9D,MAAM,MAAM,mBAAmB,GAAG;IAChC,MAAM,EAAG,aAAa,CAAC;IACvB,MAAM,EAAG,kBAAkB,CAAC;IAC5B,QAAQ,CAAC,EAAG,MAAM,CAAC;IACnB,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,gBAAgB,CAAC,EAAE,sBAAsB,EAAE,CAAC;IAC5C,MAAM,CAAC,EAAG,MAAM,CAAC;IACjB,gBAAgB,CAAC,EAAG,MAAM,CAAC;IAC3B,kBAAkB,CAAC,EAAG,MAAM,EAAE,CAAC;IAC/B,gEAAgE;IAChE,MAAM,CAAC,EAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,qEAAqE;IACrE,KAAK,CAAC,EAAG,MAAM,CAAC;CACjB,CAAC;AAEF,qBAAa,YAAa,SAAQ,eAAe,CAAC,mBAAmB,CAAC;WAEhD,KAAK,CAAC,OAAO,EAAE,mBAAmB,GAAG,OAAO,CAAC,YAAY,CAAC;WAqB1D,MAAM,CAAC,OAAO,EAAE,mBAAmB,GAAG,OAAO,CAAC,YAAY,CAAC;CAkChF"}

package/dist/types/src/smt/smt-store-level.d.ts

@@ -1,32 +0,0 @@
-/**
- * LevelDB-backed implementation of SMTNodeStore.
- *
- * Storage layout:
- * - Nodes are stored under the 'nodes' sublevel, keyed by hex-encoded hash
- * - The root hash is stored under the 'meta' sublevel with key 'root'
- * - Node values are JSON-serialized, with Uint8Array fields encoded as hex strings
- *
- * This store wraps a LevelWrapper sublevel provided by the parent (e.g. StateIndexLevel).
- * The parent manages the LevelDB lifecycle; open()/close() here only handle partition setup.
- */
-import type { Hash, SMTNode, SMTNodeStore } from '../types/smt-types.js';
-import type { LevelWrapper } from '../store/level-wrapper.js';
-export declare class SMTStoreLevel implements SMTNodeStore {
-    private readonly db;
-    private nodesPartition;
-    private metaPartition;
-    private initialized;
-    constructor(sublevel: LevelWrapper<string>);
-    open(): Promise<void>;
-    close(): Promise<void>;
-    clear(): Promise<void>;
-    getNode(hash: Hash): Promise<SMTNode | undefined>;
-    putNode(hash: Hash, node: SMTNode): Promise<void>;
-    deleteNode(hash: Hash): Promise<void>;
-    getRoot(): Promise<Hash | undefined>;
-    setRoot(hash: Hash): Promise<void>;
-    private ensureInitialized;
-    private serializeNode;
-    private deserializeNode;
-}
-//# sourceMappingURL=smt-store-level.d.ts.map

package/dist/types/src/smt/smt-store-level.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"smt-store-level.d.ts","sourceRoot":"","sources":["../../../../src/smt/smt-store-level.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAgC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEvG,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAkB9D,qBAAa,aAAc,YAAW,YAAY;IAChD,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAuB;IAC1C,OAAO,CAAC,cAAc,CAAwB;IAC9C,OAAO,CAAC,aAAa,CAAwB;IAC7C,OAAO,CAAC,WAAW,CAAS;gBAEhB,QAAQ,EAAE,YAAY,CAAC,MAAM,CAAC;IAIpC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAMrB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAOtB,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC;IAYjD,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAQjD,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAOrC,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAWpC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAMxC,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,aAAa;IAgBrB,OAAO,CAAC,eAAe;CAiBxB"}

package/dist/types/src/smt/smt-store-memory.d.ts

@@ -1,22 +0,0 @@
-/**
- * In-memory implementation of SMTNodeStore.
- * Useful for tests and lightweight/ephemeral use cases.
- */
-import type { Hash, SMTNode, SMTNodeStore } from '../types/smt-types.js';
-export declare class SMTStoreMemory implements SMTNodeStore {
-    private readonly nodes;
-    private root;
-    open(): Promise<void>;
-    close(): Promise<void>;
-    clear(): Promise<void>;
-    getNode(hash: Hash): Promise<SMTNode | undefined>;
-    putNode(hash: Hash, node: SMTNode): Promise<void>;
-    deleteNode(hash: Hash): Promise<void>;
-    getRoot(): Promise<Hash | undefined>;
-    setRoot(hash: Hash): Promise<void>;
-    /**
-     * Get the number of nodes currently stored (useful for tests).
-     */
-    get size(): number;
-}
-//# sourceMappingURL=smt-store-memory.d.ts.map

package/dist/types/src/smt/smt-store-memory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"smt-store-memory.d.ts","sourceRoot":"","sources":["../../../../src/smt/smt-store-memory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAIzE,qBAAa,cAAe,YAAW,YAAY;IACjD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmC;IACzD,OAAO,CAAC,IAAI,CAAmB;IAEzB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAIrB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAKtB,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,GAAG,SAAS,CAAC;IAIjD,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAIjD,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAIrC,OAAO,IAAI,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAIpC,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAIxC;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF"}

package/dist/types/src/smt/smt-utils.d.ts

@@ -1,58 +0,0 @@
-/**
- * Utility functions for the Sparse Merkle Tree.
- * Uses SHA-256 from multiformats (already a dependency of dwn-sdk-js).
- */
-import type { Hash } from '../types/smt-types.js';
-/** The tree depth — one level per bit of a SHA-256 hash. */
-export declare const SMT_DEPTH = 256;
-/** A constant zero hash (32 bytes of 0x00). */
-export declare const ZERO_HASH: Hash;
-export declare function getDefaultHashes(): Hash[];
-/**
- * Reset the cached default hashes. Only used by tests to verify the
- * uninitialized code path in `getDefaultHashes()`.
- * @internal
- */
-export declare function resetDefaultHashesForTesting(): void;
-/**
- * Initialize the default hashes array. Must be called once before using the SMT.
- * This is async because sha256.digest is async.
- */
-export declare function initDefaultHashes(): Promise<Hash[]>;
-/**
- * Hash two child hashes together: H(left || right).
- * Uses SHA-256 via multiformats.
- */
-export declare function hashChildren(left: Hash, right: Hash): Promise<Hash>;
-/**
- * Hash a leaf node: H(0x00 || keyHash || valueCid_bytes).
- * The 0x00 prefix distinguishes leaf hashes from internal node hashes,
- * preventing second-preimage attacks.
- */
-export declare function hashLeaf(keyHash: Hash, valueCid: string): Promise<Hash>;
-/**
- * Compute SHA-256 of a string (used to hash messageCid into the 256-bit key space).
- */
-export declare function hashKey(key: string): Promise<Hash>;
-/**
- * Extract the bit at a given depth from a 256-bit hash.
- * Depth 0 is the most significant bit of the first byte.
- *
- * @param hash - The 32-byte hash.
- * @param depth - The bit position (0 = MSB of byte 0, 255 = LSB of byte 31).
- * @returns `true` for 1 (right), `false` for 0 (left).
- */
-export declare function getBit(hash: Hash, depth: number): boolean;
-/**
- * Compare two hashes for equality.
- */
-export declare function hashEquals(a: Hash, b: Hash): boolean;
-/**
- * Convert a hash to a hex string for use as a store key.
- */
-export declare function hashToHex(hash: Hash): string;
-/**
- * Convert a hex string back to a Hash.
- */
-export declare function hexToHash(hex: string): Hash;
-//# sourceMappingURL=smt-utils.d.ts.map

package/dist/types/src/smt/smt-utils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"smt-utils.d.ts","sourceRoot":"","sources":["../../../../src/smt/smt-utils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAIlD,4DAA4D;AAC5D,eAAO,MAAM,SAAS,MAAM,CAAC;AAE7B,+CAA+C;AAC/C,eAAO,MAAM,SAAS,EAAE,IAAyB,CAAC;AAalD,wBAAgB,gBAAgB,IAAI,IAAI,EAAE,CAQzC;AAED;;;;GAIG;AACH,wBAAgB,4BAA4B,IAAI,IAAI,CAEnD;AAED;;;GAGG;AACH,wBAAsB,iBAAiB,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,CAczD;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAOzE;AAED;;;;GAIG;AACH,wBAAsB,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAS7E;AAED;;GAEG;AACH,wBAAsB,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAIxD;AAED;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAIzD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAUpD;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAE5C;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAM3C"}

package/dist/types/src/smt/sparse-merkle-tree.d.ts

@@ -1,124 +0,0 @@
-/**
- * Sparse Merkle Tree (SMT) implementation.
- *
- * A 256-level binary trie where:
- * - Keys are SHA-256 hashes of messageCids (uniformly distributed across 2^256 key space)
- * - Leaves store the messageCid value
- * - Internal nodes store H(leftChild || rightChild)
- * - Empty subtrees are represented implicitly via precomputed default hashes
- *
- * Key properties:
- * - Deterministic: the same set of key-value pairs always produces the same root hash
- * - O(log n) insert, delete, and proof operations (practically O(256) worst case)
- * - Supports inclusion and non-inclusion proofs
- * - Root hash provides a fingerprint of the entire set for O(1) comparison
- */
-import type { Hash, SMTDiffResult, SMTNodeStore, SMTProof } from '../types/smt-types.js';
-export declare class SparseMerkleTree {
-    private readonly store;
-    private defaultHashes;
-    constructor(store: SMTNodeStore);
-    /**
-     * Initialize the SMT. Must be called before any operations.
-     * Opens the store and precomputes default hashes.
-     */
-    initialize(): Promise<void>;
-    /**
-     * Close the underlying store.
-     */
-    close(): Promise<void>;
-    /**
-     * Clear all data from the tree.
-     */
-    clear(): Promise<void>;
-    /**
-     * Get the current root hash. Returns the default empty root if no root is set.
-     */
-    getRoot(): Promise<Hash>;
-    /**
-     * Insert a messageCid into the tree.
-     * The key is SHA-256(messageCid), the value is the messageCid string.
-     *
-     * @returns the new root hash after insertion
-     */
-    insert(messageCid: string): Promise<Hash>;
-    /**
-     * Delete a messageCid from the tree.
-     *
-     * @returns the new root hash after deletion
-     */
-    delete(messageCid: string): Promise<Hash>;
-    /**
-     * Check if a messageCid exists in the tree.
-     */
-    has(messageCid: string): Promise<boolean>;
-    /**
-     * Generate a membership proof (inclusion or non-inclusion) for a messageCid.
-     */
-    getProof(messageCid: string): Promise<SMTProof>;
-    /**
-     * Get the hash of a subtree at a given bit prefix.
-     * Used by the sync protocol for tree walking.
-     *
-     * @param prefix - array of booleans representing the path (false=left, true=right)
-     * @returns the hash of the subtree at that prefix
-     */
-    getSubtreeHash(prefix: boolean[]): Promise<Hash>;
-    /**
-     * Get all leaf messageCids under a given prefix.
-     * Used by the sync protocol for tree walking.
-     */
-    getLeaves(prefix: boolean[]): Promise<string[]>;
-    /**
-     * Compute a local diff between this tree and another tree's state,
-     * given access to the other tree instance.
-     *
-     * This is used for same-process diffing (e.g., in tests or local operations).
-     * For remote diffing, the sync protocol exchanges subtree hashes via messages.
-     */
-    diff(other: SparseMerkleTree): Promise<SMTDiffResult>;
-    /**
-     * Recursively insert a leaf into the tree, returning the new hash for the subtree at `depth`.
-     */
-    private insertAtNode;
-    /**
-     * When two leaves collide at the same position in the tree, push them down
-     * until their key paths diverge, creating internal nodes along the way.
-     *
-     * For example, if two leaves share the first 3 bits but diverge at bit 3,
-     * and we're currently at depth 0, we need to create internal nodes at depths
-     * 0, 1, and 2 (where one child is the chain and the other is a default hash),
-     * plus the divergence node at depth 3 where the two leaves split.
-     */
-    private splitLeaves;
-    /**
-     * Recursively delete a key from the tree, returning the new hash for the subtree at `depth`.
-     */
-    private deleteAtNode;
-    /**
-     * Check if a key exists at the given node.
-     */
-    private existsAtNode;
-    /**
-     * Generate a proof for the given key at the given node.
-     */
-    private generateProof;
-    /**
-     * Compute the subtree hash for a leaf that exists above the target prefix depth.
-     * The leaf's effective position is determined by its keyHash bits.
-     */
-    private computeSubtreeHashForLeaf;
-    /**
-     * Check if a leaf's keyHash matches a given prefix.
-     */
-    private leafMatchesPrefix;
-    /**
-     * Collect all leaf messageCids in the subtree rooted at the given hash.
-     */
-    private collectLeaves;
-    /**
-     * Recursively diff two subtrees, collecting leaves that exist only in one or the other.
-     */
-    private diffAtNode;
-}
-//# sourceMappingURL=sparse-merkle-tree.d.ts.map

package/dist/types/src/smt/sparse-merkle-tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sparse-merkle-tree.d.ts","sourceRoot":"","sources":["../../../../src/smt/sparse-merkle-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,aAAa,EAAgC,YAAY,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAIvH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAe;IACrC,OAAO,CAAC,aAAa,CAAU;gBAEnB,KAAK,EAAE,YAAY;IAI/B;;;OAGG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAKjC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAQ9B;;;;;OAKG;IACG,MAAM,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqB/C;;;;OAIG;IACG,MAAM,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAU/C;;OAEG;IACG,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAM/C;;OAEG;IACG,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;IAMrD;;;;;;OAMG;IACG,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAgCtD;;;OAGG;IACG,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAmCrD;;;;;;OAMG;IACG,IAAI,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,aAAa,CAAC;IAkB3D;;OAEG;YACW,YAAY;IAyE1B;;;;;;;;OAQG;YACW,WAAW;IAoEzB;;OAEG;YACW,YAAY;IA6E1B;;OAEG;YACW,YAAY;IA4B1B;;OAEG;YACW,aAAa;IAsC3B;;;OAGG;YACW,yBAAyB;IAiBvC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IASzB;;OAEG;YACW,aAAa;IAqB3B;;OAEG;YACW,UAAU;CA2GzB"}

package/dist/types/src/state-index/state-index-level.d.ts

@@ -1,83 +0,0 @@
-/**
- * LevelDB-backed implementation of the StateIndex interface.
- *
- * Manages per-tenant Sparse Merkle Trees (global + per-protocol sub-trees).
- *
- * All data lives within a single LevelDB instance, partitioned by sublevels:
- *   {tenant}/global/        -> SMT nodes + root for the tenant's global tree
- *   {tenant}/proto/{proto}/ -> SMT nodes + root for a protocol-scoped tree
- *   {tenant}/meta/{cid}     -> JSON(indexes) for reverse lookup during deletion
- */
-import type { Hash } from '../types/smt-types.js';
-import type { KeyValues } from '../types/query-types.js';
-import type { StateIndex } from '../types/state-index.js';
-import { createLevelDatabase } from '../store/level-wrapper.js';
-export type StateIndexLevelConfig = {
-    /**
-     * Must be a directory path (relative or absolute) where LevelDB will store its files,
-     * or in browsers, the name of the IDBDatabase to be opened.
-     */
-    location?: string;
-    createLevelDatabase?: typeof createLevelDatabase;
-};
-export declare class StateIndexLevel implements StateIndex {
-    private readonly config;
-    private db;
-    /**
-     * Cache of per-tenant global SMTs. Lazily populated on first access.
-     * Stores promises to avoid race conditions when multiple concurrent operations
-     * trigger lazy initialization of the same tenant's SMT.
-     */
-    private readonly globalTrees;
-    /**
-     * Cache of per-tenant, per-protocol SMTs. Key format: `{tenant}\x00{protocol}`
-     * Stores promises to avoid race conditions (same reason as globalTrees).
-     */
-    private readonly protocolTrees;
-    constructor(config?: StateIndexLevelConfig);
-    open(): Promise<void>;
-    close(): Promise<void>;
-    clear(): Promise<void>;
-    insert(tenant: string, messageCid: string, indexes: KeyValues): Promise<void>;
-    delete(tenant: string, messageCids: string[]): Promise<void>;
-    getRoot(tenant: string): Promise<Hash>;
-    getProtocolRoot(tenant: string, protocol: string): Promise<Hash>;
-    getSubtreeHash(tenant: string, prefix: boolean[]): Promise<Hash>;
-    getProtocolSubtreeHash(tenant: string, protocol: string, prefix: boolean[]): Promise<Hash>;
-    getLeaves(tenant: string, prefix: boolean[]): Promise<string[]>;
-    getProtocolLeaves(tenant: string, protocol: string, prefix: boolean[]): Promise<string[]>;
-    /**
-     * Get or create the global SMT for a tenant.
-     * Uses a promise-based cache to prevent concurrent callers from racing to
-     * initialize the same tenant's SMT twice.
-     */
-    private getGlobalTree;
-    /**
-     * Get or create a protocol-scoped SMT for a tenant.
-     * Uses a promise-based cache to prevent concurrent callers from racing to
-     * initialize the same tenant's SMT twice.
-     */
-    private getProtocolTree;
-    /**
-     * Create and initialize a new SparseMerkleTree backed by a sublevel chain
-     * within the single LevelDB instance.
-     */
-    private createTree;
-    /**
-     * Store the indexes for a messageCid so we can look up the protocol during deletion.
-     */
-    private storeIndexes;
-    /**
-     * Get the stored indexes for a messageCid.
-     */
-    private getStoredIndexes;
-    /**
-     * Delete the stored indexes for a messageCid.
-     */
-    private deleteStoredIndexes;
-    /**
-     * Get the metadata partition for a tenant.
-     */
-    private getMetaPartition;
-}
-//# sourceMappingURL=state-index-level.d.ts.map

package/dist/types/src/state-index/state-index-level.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"state-index-level.d.ts","sourceRoot":"","sources":["../../../../src/state-index/state-index-level.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAK1D,OAAO,EAAE,mBAAmB,EAAgB,MAAM,2BAA2B,CAAC;AAE9E,MAAM,MAAM,qBAAqB,GAAG;IAClC;;;OAGG;IACH,QAAQ,CAAC,EAAG,MAAM,CAAC;IACnB,mBAAmB,CAAC,EAAG,OAAO,mBAAmB,CAAC;CACnD,CAAC;AAEF,qBAAa,eAAgB,YAAW,UAAU;IAChD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAwB;IAC/C,OAAO,CAAC,EAAE,CAAwB;IAElC;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAqD;IAEjF;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAqD;gBAEvE,MAAM,CAAC,EAAE,qBAAqB;IAQpC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAYrB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAOtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAOtB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAiB7E,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAwB5D,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKtC,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKhE,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAKhE,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAK1F,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAK/D,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAO/F;;;;OAIG;IACH,OAAO,CAAC,aAAa;IAWrB;;;;OAIG;IACH,OAAO,CAAC,eAAe;IAYvB;;;OAGG;YACW,UAAU;IAYxB;;OAEG;YACW,YAAY;IAO1B;;OAEG;YACW,gBAAgB;IAS9B;;OAEG;YACW,mBAAmB;IAKjC;;OAEG;YACW,gBAAgB;CAG/B"}

package/dist/types/src/sync/records-projection.d.ts

@@ -1,98 +0,0 @@
-import type { Hash } from '../types/smt-types.js';
-import type { MessageStore, MessageStoreOptions } from '../types/message-store.js';
-/**
- * Projection-root algorithm for record-primary scoped subsets.
- *
- * This version builds an on-demand SMT over latest Records primary message CIDs
- * selected by protocol plus optional exact protocolPath or context subtree.
- * Dependency records, protocol configs, and record data payloads are not part
- * of this root.
- */
-export declare const RECORDS_PROJECTION_ROOT_VERSION = "records-primary-scope-root-v1";
-/**
- * A Records primary projection scope.
- *
- * `protocolPath` is an exact type-path match. `contextId` is a boundary-aware
- * subtree match: the candidate context must equal the scoped context or start
- * with `${contextId}/`. `protocolPath` and `contextId` are mutually exclusive.
- */
-export type RecordsProjectionScope = {
-    protocol: string;
-    protocolPath?: string;
-    contextId?: string;
-};
-export type RecordsProjectionInput = {
-    tenant: string;
-    messageStore: MessageStore;
-    scopes: readonly [RecordsProjectionScope, ...RecordsProjectionScope[]];
-    options?: MessageStoreOptions;
-};
-export type RecordsProjectionTreeInput = RecordsProjectionInput & {
-    prefix: boolean[];
-};
-export type RecordsProjectionSnapshot = {
-    getRoot(): Promise<Hash>;
-    getRootHex(): Promise<string>;
-    getSubtreeHash(prefix: boolean[]): Promise<Hash>;
-    getLeaves(prefix: boolean[]): Promise<string[]>;
-    close(): Promise<void>;
-};
-export type NormalizedRecordsProjectionScope = {
-    protocol: string;
-} | {
-    protocol: string;
-    protocolPath: string;
-} | {
-    protocol: string;
-    contextId: string;
-};
-/**
- * Computes deterministic on-demand roots for Records projections.
- *
- * The snapshot API performs one store enumeration and serves tree operations
- * from that in-memory view. A future store-level snapshot/high-watermark can be
- * threaded through the `options` input without changing the projection shape.
- */
-export declare class RecordsProjection {
-    /**
-     * Returns the sorted latest Records primary message CIDs covered by a scope union.
-     */
-    static getPrimaryMessageCids({ tenant, messageStore, scopes, options, }: RecordsProjectionInput): Promise<string[]>;
-    /**
-     * Returns the projection root hash.
-     */
-    static getRoot(input: RecordsProjectionInput): Promise<Hash>;
-    /**
-     * Returns the projection root hash encoded as lowercase hex.
-     */
-    static getRootHex(input: RecordsProjectionInput): Promise<string>;
-    /**
-     * Returns the subtree hash for a bit prefix within this projection.
-     */
-    static getSubtreeHash(input: RecordsProjectionTreeInput): Promise<Hash>;
-    /**
-     * Returns the message CIDs under a bit prefix within this projection.
-     */
-    static getLeaves(input: RecordsProjectionTreeInput): Promise<string[]>;
-    /**
-     * Builds an in-memory projection tree from one primary-CID enumeration.
-     */
-    static createSnapshot(input: RecordsProjectionInput): Promise<RecordsProjectionSnapshot>;
-    /**
-     * Normalizes a scope union into sorted, duplicate-free, subsumption-reduced entries.
-     */
-    static normalizeScopes(scopes: readonly [RecordsProjectionScope, ...RecordsProjectionScope[]]): [NormalizedRecordsProjectionScope, ...NormalizedRecordsProjectionScope[]];
-    private static withTree;
-    private static createTree;
-    private static normalizeScope;
-    private static constructFilters;
-    private static requireNonEmptyString;
-    private static scopeKey;
-    private static isProtocolWideScope;
-    private static isContextScope;
-    private static contextIdSubsumes;
-    private static compareScopes;
-    private static scopeRank;
-    private static scopeValue;
-}
-//# sourceMappingURL=records-projection.d.ts.map

package/dist/types/src/sync/records-projection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"records-projection.d.ts","sourceRoot":"","sources":["../../../../src/sync/records-projection.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAWnF;;;;;;;GAOG;AACH,eAAO,MAAM,+BAA+B,kCAAkC,CAAC;AAE/E;;;;;;GAMG;AACH,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,sBAAsB,GAAG;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,YAAY,CAAC;IAC3B,MAAM,EAAE,SAAS,CAAC,sBAAsB,EAAE,GAAG,sBAAsB,EAAE,CAAC,CAAC;IACvE,OAAO,CAAC,EAAE,mBAAmB,CAAC;CAC/B,CAAC;AAEF,MAAM,MAAM,0BAA0B,GAAG,sBAAsB,GAAG;IAChE,MAAM,EAAE,OAAO,EAAE,CAAC;CACnB,CAAC;AAEF,MAAM,MAAM,yBAAyB,GAAG;IACtC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACzB,UAAU,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9B,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACjD,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAChD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,gCAAgC,GAAG;IAC7C,QAAQ,EAAE,MAAM,CAAC;CAClB,GAAG;IACF,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;CACtB,GAAG;IACF,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAEF;;;;;;GAMG;AACH,qBAAa,iBAAiB;IAE5B;;OAEG;WACiB,qBAAqB,CAAC,EACxC,MAAM,EACN,YAAY,EACZ,MAAM,EACN,OAAO,GACR,EAAE,sBAAsB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAc7C;;OAEG;WACiB,OAAO,CAAC,KAAK,EAAE,sBAAsB,GAAG,OAAO,CAAC,IAAI,CAAC;IAIzE;;OAEG;WACiB,UAAU,CAAC,KAAK,EAAE,sBAAsB,GAAG,OAAO,CAAC,MAAM,CAAC;IAI9E;;OAEG;WACiB,cAAc,CAAC,KAAK,EAAE,0BAA0B,GAAG,OAAO,CAAC,IAAI,CAAC;IAIpF;;OAEG;WACiB,SAAS,CAAC,KAAK,EAAE,0BAA0B,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAInF;;OAEG;WACiB,cAAc,CAAC,KAAK,EAAE,sBAAsB,GAAG,OAAO,CAAC,yBAAyB,CAAC;IAWrG;;OAEG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,CAAC,sBAAsB,EAAE,GAAG,sBAAsB,EAAE,CAAC,GACrE,CAAC,gCAAgC,EAAE,GAAG,gCAAgC,EAAE,CAAC;mBAuCvD,QAAQ;mBAaR,UAAU;IAiB/B,OAAO,CAAC,MAAM,CAAC,cAAc;IAwB7B,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAyB/B,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAQpC,OAAO,CAAC,MAAM,CAAC,QAAQ;IAYvB,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAMlC,OAAO,CAAC,MAAM,CAAC,cAAc;IAM7B,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAKhC,OAAO,CAAC,MAAM,CAAC,aAAa;IAkB5B,OAAO,CAAC,MAAM,CAAC,SAAS;IAMxB,OAAO,CAAC,MAAM,CAAC,UAAU;CAK1B"}