@enbox/dwn-server 0.0.1

package/dist/esm/src/lib/json-rpc.d.ts

@@ -0,0 +1,54 @@
+export type JsonRpcId = string | number | null;
+export type JsonRpcVersion = '2.0';
+export interface JsonRpcRequest {
+    jsonrpc: JsonRpcVersion;
+    id?: JsonRpcId;
+    method: string;
+    params?: any;
+    /** JSON RPC Subscription Extension Parameters */
+    subscription?: {
+        id: JsonRpcId;
+    };
+}
+export interface JsonRpcError {
+    code: JsonRpcErrorCodes;
+    message: string;
+    data?: any;
+}
+export interface JsonRpcSubscription {
+    /** JSON RPC Id of the Subscription Request */
+    id: JsonRpcId;
+    close: () => Promise<void>;
+}
+export declare enum JsonRpcErrorCodes {
+    InvalidRequest = -32600,
+    MethodNotFound = -32601,
+    InvalidParams = -32602,
+    InternalError = -32603,
+    ParseError = -32700,
+    /** App defined error equivalent to HTTP Status 400 */
+    BadRequest = -50400,
+    /** App defined error equivalent to HTTP Status 401 */
+    Unauthorized = -50401,
+    /** App defined error equivalent to HTTP Status 403 */
+    Forbidden = -50403
+}
+export type JsonRpcResponse = JsonRpcSuccessResponse | JsonRpcErrorResponse;
+export interface JsonRpcSuccessResponse {
+    jsonrpc: JsonRpcVersion;
+    id: JsonRpcId;
+    result: any;
+    error?: never;
+}
+export interface JsonRpcErrorResponse {
+    jsonrpc: JsonRpcVersion;
+    id: JsonRpcId;
+    result?: never;
+    error: JsonRpcError;
+}
+export declare const createJsonRpcErrorResponse: (id: JsonRpcId, code: JsonRpcErrorCodes, message: string, data?: any) => JsonRpcErrorResponse;
+export declare const createJsonRpcNotification: (method: string, params?: any) => JsonRpcRequest;
+export declare const createJsonRpcSubscriptionRequest: (id: JsonRpcId, method: string, params?: any, subscriptionId?: JsonRpcId) => JsonRpcRequest;
+export declare const createJsonRpcRequest: (id: JsonRpcId, method: string, params?: any) => JsonRpcRequest;
+export declare const createJsonRpcSuccessResponse: (id: JsonRpcId, result?: any) => JsonRpcSuccessResponse;
+//# sourceMappingURL=json-rpc.d.ts.map

package/dist/esm/src/lib/json-rpc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-rpc.d.ts","sourceRoot":"","sources":["../../../../src/lib/json-rpc.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAC/C,MAAM,MAAM,cAAc,GAAG,KAAK,CAAC;AAEnC,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,cAAc,CAAC;IACxB,EAAE,CAAC,EAAE,SAAS,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,GAAG,CAAC;IACb,iDAAiD;IACjD,YAAY,CAAC,EAAE;QACb,EAAE,EAAE,SAAS,CAAA;KACd,CAAC;CACH;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,iBAAiB,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,GAAG,CAAC;CACZ;AAED,MAAM,WAAW,mBAAmB;IAClC,8CAA8C;IAC9C,EAAE,EAAE,SAAS,CAAC;IACd,KAAK,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;CAC5B;AAED,oBAAY,iBAAiB;IAE3B,cAAc,SAAS;IACvB,cAAc,SAAS;IACvB,aAAa,SAAS;IACtB,aAAa,SAAS;IACtB,UAAU,SAAS;IAEnB,sDAAsD;IACtD,UAAU,SAAS;IACnB,sDAAsD;IACtD,YAAY,SAAS;IACrB,sDAAsD;IACtD,SAAS,SAAS;CACnB;AAED,MAAM,MAAM,eAAe,GAAG,sBAAsB,GAAG,oBAAoB,CAAC;AAE5E,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,cAAc,CAAC;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,MAAM,EAAE,GAAG,CAAC;IACZ,KAAK,CAAC,EAAE,KAAK,CAAC;CACf;AAED,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,cAAc,CAAC;IACxB,EAAE,EAAE,SAAS,CAAC;IACd,MAAM,CAAC,EAAE,KAAK,CAAC;IACf,KAAK,EAAE,YAAY,CAAC;CACrB;AAED,eAAO,MAAM,0BAA0B,OACjC,SAAS,QACP,iBAAiB,WACd,MAAM,SACR,GAAG,KACT,oBAUF,CAAC;AAEF,eAAO,MAAM,yBAAyB,WAC5B,MAAM,WACL,GAAG,KACX,cAMF,CAAC;AAEF,eAAO,MAAM,gCAAgC,OACvC,SAAS,UACL,MAAM,WACL,GAAG,mBACK,SAAS,KACzB,cAUF,CAAA;AAED,eAAO,MAAM,oBAAoB,OAC3B,SAAS,UACL,MAAM,WACL,GAAG,KACX,cAOF,CAAC;AAEF,eAAO,MAAM,4BAA4B,OACnC,SAAS,WACJ,GAAG,KACX,sBAMF,CAAC"}

package/dist/esm/src/lib/json-rpc.js

@@ -0,0 +1,60 @@
+export var JsonRpcErrorCodes;
+(function (JsonRpcErrorCodes) {
+    // JSON-RPC 2.0 pre-defined errors
+    JsonRpcErrorCodes[JsonRpcErrorCodes["InvalidRequest"] = -32600] = "InvalidRequest";
+    JsonRpcErrorCodes[JsonRpcErrorCodes["MethodNotFound"] = -32601] = "MethodNotFound";
+    JsonRpcErrorCodes[JsonRpcErrorCodes["InvalidParams"] = -32602] = "InvalidParams";
+    JsonRpcErrorCodes[JsonRpcErrorCodes["InternalError"] = -32603] = "InternalError";
+    JsonRpcErrorCodes[JsonRpcErrorCodes["ParseError"] = -32700] = "ParseError";
+    /** App defined error equivalent to HTTP Status 400 */
+    JsonRpcErrorCodes[JsonRpcErrorCodes["BadRequest"] = -50400] = "BadRequest";
+    /** App defined error equivalent to HTTP Status 401 */
+    JsonRpcErrorCodes[JsonRpcErrorCodes["Unauthorized"] = -50401] = "Unauthorized";
+    /** App defined error equivalent to HTTP Status 403 */
+    JsonRpcErrorCodes[JsonRpcErrorCodes["Forbidden"] = -50403] = "Forbidden";
+})(JsonRpcErrorCodes || (JsonRpcErrorCodes = {}));
+export const createJsonRpcErrorResponse = (id, code, message, data) => {
+    const error = { code, message };
+    if (data != undefined) {
+        error.data = data;
+    }
+    return {
+        jsonrpc: '2.0',
+        id,
+        error,
+    };
+};
+export const createJsonRpcNotification = (method, params) => {
+    return {
+        jsonrpc: '2.0',
+        method,
+        params,
+    };
+};
+export const createJsonRpcSubscriptionRequest = (id, method, params, subscriptionId) => {
+    return {
+        jsonrpc: '2.0',
+        id,
+        method,
+        params,
+        subscription: {
+            id: subscriptionId,
+        }
+    };
+};
+export const createJsonRpcRequest = (id, method, params) => {
+    return {
+        jsonrpc: '2.0',
+        id,
+        method,
+        params,
+    };
+};
+export const createJsonRpcSuccessResponse = (id, result) => {
+    return {
+        jsonrpc: '2.0',
+        id,
+        result: result ?? null,
+    };
+};
+//# sourceMappingURL=json-rpc.js.map

package/dist/esm/src/lib/json-rpc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-rpc.js","sourceRoot":"","sources":["../../../../src/lib/json-rpc.ts"],"names":[],"mappings":"AA0BA,MAAM,CAAN,IAAY,iBAcX;AAdD,WAAY,iBAAiB;IAC3B,kCAAkC;IAClC,kFAAuB,CAAA;IACvB,kFAAuB,CAAA;IACvB,gFAAsB,CAAA;IACtB,gFAAsB,CAAA;IACtB,0EAAmB,CAAA;IAEnB,sDAAsD;IACtD,0EAAmB,CAAA;IACnB,sDAAsD;IACtD,8EAAqB,CAAA;IACrB,sDAAsD;IACtD,wEAAkB,CAAA;AACpB,CAAC,EAdW,iBAAiB,KAAjB,iBAAiB,QAc5B;AAkBD,MAAM,CAAC,MAAM,0BAA0B,GAAG,CACxC,EAAa,EACb,IAAuB,EACvB,OAAe,EACf,IAAU,EACY,EAAE;IACxB,MAAM,KAAK,GAAiB,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC9C,IAAI,IAAI,IAAI,SAAS,EAAE,CAAC;QACtB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;IACpB,CAAC;IACD,OAAO;QACL,OAAO,EAAE,KAAK;QACd,EAAE;QACF,KAAK;KACN,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,yBAAyB,GAAG,CACvC,MAAc,EACd,MAAY,EACI,EAAE;IAClB,OAAO;QACL,OAAO,EAAE,KAAK;QACd,MAAM;QACN,MAAM;KACP,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAC9C,EAAa,EACb,MAAc,EACd,MAAY,EACZ,cAA0B,EACV,EAAE;IAClB,OAAO;QACL,OAAO,EAAE,KAAK;QACd,EAAE;QACF,MAAM;QACN,MAAM;QACN,YAAY,EAAE;YACZ,EAAE,EAAE,cAAc;SACnB;KACF,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,EAAa,EACb,MAAc,EACd,MAAY,EACI,EAAE;IAClB,OAAO;QACL,OAAO,EAAE,KAAK;QACd,EAAE;QACF,MAAM;QACN,MAAM;KACP,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAC1C,EAAa,EACb,MAAY,EACY,EAAE;IAC1B,OAAO;QACL,OAAO,EAAE,KAAK;QACd,EAAE;QACF,MAAM,EAAE,MAAM,IAAI,IAAI;KACvB,CAAC;AACJ,CAAC,CAAC"}

package/dist/esm/src/main.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=main.d.ts.map

package/dist/esm/src/main.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.d.ts","sourceRoot":"","sources":["../../../src/main.ts"],"names":[],"mappings":""}

package/dist/esm/src/main.js

@@ -0,0 +1,11 @@
+#!/usr/bin/env node
+// node.js 18 and earlier, needs globalThis.crypto polyfill. needed for dwn-sdk-js
+import { webcrypto } from 'node:crypto';
+import { DwnServer } from './dwn-server.js';
+if (!globalThis.crypto) {
+    // @ts-ignore
+    globalThis.crypto = webcrypto;
+}
+const dwnServer = new DwnServer();
+await dwnServer.start();
+//# sourceMappingURL=main.js.map

package/dist/esm/src/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sourceRoot":"","sources":["../../../src/main.ts"],"names":[],"mappings":";AACA,kFAAkF;AAClF,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;IACvB,aAAa;IACb,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC;AAChC,CAAC;AAED,MAAM,SAAS,GAAG,IAAI,SAAS,EAAE,CAAC;AAElC,MAAM,SAAS,CAAC,KAAK,EAAE,CAAC"}

package/dist/esm/src/metrics.d.ts

@@ -0,0 +1,4 @@
+import { Counter, Histogram } from 'prom-client';
+export declare const requestCounter: Counter<"error" | "method" | "status">;
+export declare const responseHistogram: Histogram<"route" | "code">;
+//# sourceMappingURL=metrics.d.ts.map

package/dist/esm/src/metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.d.ts","sourceRoot":"","sources":["../../../src/metrics.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAEjD,eAAO,MAAM,cAAc,wCAIzB,CAAC;AAEH,eAAO,MAAM,iBAAiB,6BAK5B,CAAC"}

package/dist/esm/src/metrics.js

@@ -0,0 +1,13 @@
+import { Counter, Histogram } from 'prom-client';
+export const requestCounter = new Counter({
+    name: 'dwn_requests_total',
+    help: 'all dwn requests processed',
+    labelNames: ['method', 'status', 'error'],
+});
+export const responseHistogram = new Histogram({
+    name: 'http_response',
+    help: 'response histogram',
+    buckets: [0.005, 0.01, 0.025, 0.05, 0.1, 0.25, 0.5, 1, 2.5, 5, 10],
+    labelNames: ['route', 'code'],
+});
+//# sourceMappingURL=metrics.js.map

package/dist/esm/src/metrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.js","sourceRoot":"","sources":["../../../src/metrics.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAEjD,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,OAAO,CAAC;IACxC,IAAI,EAAE,oBAAoB;IAC1B,IAAI,EAAE,4BAA4B;IAClC,UAAU,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC;CAC1C,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,SAAS,CAAC;IAC7C,IAAI,EAAE,eAAe;IACrB,IAAI,EAAE,oBAAoB;IAC1B,OAAO,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;IAClE,UAAU,EAAE,CAAC,OAAO,EAAE,MAAM,CAAC;CAC9B,CAAC,CAAC"}

package/dist/esm/src/plugin-loader.d.ts

@@ -0,0 +1,10 @@
+/**
+ * A utility class for dynamically loading plugins from file paths.
+ */
+export declare class PluginLoader {
+    /**
+     * Dynamically loads a plugin from a file path by invoking the argument-less constructor of the default exported class.
+     */
+    static loadPlugin<T>(filePath: string): Promise<T>;
+}
+//# sourceMappingURL=plugin-loader.d.ts.map

package/dist/esm/src/plugin-loader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"plugin-loader.d.ts","sourceRoot":"","sources":["../../../src/plugin-loader.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,YAAY;IACvB;;OAEG;WACiB,UAAU,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;CAShE"}

package/dist/esm/src/plugin-loader.js

@@ -0,0 +1,19 @@
+/**
+ * A utility class for dynamically loading plugins from file paths.
+ */
+export class PluginLoader {
+    /**
+     * Dynamically loads a plugin from a file path by invoking the argument-less constructor of the default exported class.
+     */
+    static async loadPlugin(filePath) {
+        try {
+            const module = await import(filePath);
+            const instance = new module.default();
+            return instance;
+        }
+        catch (error) {
+            throw new Error(`Failed to load component at ${filePath}: ${error.message}`);
+        }
+    }
+}
+//# sourceMappingURL=plugin-loader.js.map

package/dist/esm/src/plugin-loader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plugin-loader.js","sourceRoot":"","sources":["../../../src/plugin-loader.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,YAAY;IACvB;;OAEG;IACI,MAAM,CAAC,KAAK,CAAC,UAAU,CAAI,QAAgB;QAChD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtC,MAAM,QAAQ,GAAM,IAAI,MAAM,CAAC,OAAO,EAAO,CAAC;YAC9C,OAAO,QAAQ,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,+BAA+B,QAAQ,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;CACF"}

package/dist/esm/src/process-handlers.d.ts

@@ -0,0 +1,11 @@
+import type { DwnServer } from './dwn-server.js';
+export declare const gracefulShutdown: (dwnServer: DwnServer) => Promise<void>;
+export type ProcessHandlers = {
+    unhandledRejectionHandler: (reason: any, promise: Promise<any>) => void;
+    uncaughtExceptionHandler: (err: Error) => void;
+    sigintHandler: () => Promise<void>;
+    sigtermHandler: () => Promise<void>;
+};
+export declare const setProcessHandlers: (dwnServer: DwnServer) => ProcessHandlers;
+export declare const removeProcessHandlers: (handlers: ProcessHandlers) => void;
+//# sourceMappingURL=process-handlers.d.ts.map

package/dist/esm/src/process-handlers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-handlers.d.ts","sourceRoot":"","sources":["../../../src/process-handlers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,eAAO,MAAM,gBAAgB,cAAqB,SAAS,KAAG,OAAO,CAAC,IAAI,CAIzE,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,yBAAyB,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;IACxE,wBAAwB,EAAE,CAAC,GAAG,EAAE,KAAK,KAAK,IAAI,CAAC;IAC/C,aAAa,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IACnC,cAAc,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAA;CACpC,CAAC;AAEF,eAAO,MAAM,kBAAkB,cAAe,SAAS,KAAG,eAmCzD,CAAC;AAEF,eAAO,MAAM,qBAAqB,aAAc,eAAe,KAAG,IAYjE,CAAC"}

package/dist/esm/src/process-handlers.js

@@ -0,0 +1,40 @@
+export const gracefulShutdown = async (dwnServer) => {
+    await dwnServer.stop();
+    console.log('http server stopped.. exiting');
+    process.exit(0);
+};
+export const setProcessHandlers = (dwnServer) => {
+    const unhandledRejectionHandler = (reason, promise) => {
+        console.error(`Unhandled promise rejection. Reason: ${reason}. Promise: ${JSON.stringify(promise)}`);
+    };
+    const uncaughtExceptionHandler = (err) => {
+        console.error('Uncaught exception:', err.stack || err);
+    };
+    const sigintHandler = async () => {
+        console.log('exit signal received [SIGINT]. starting graceful shutdown');
+        await gracefulShutdown(dwnServer);
+    };
+    const sigtermHandler = async () => {
+        console.log('exit signal received [SIGTERM]. starting graceful shutdown');
+        await gracefulShutdown(dwnServer);
+    };
+    process.on('unhandledRejection', unhandledRejectionHandler);
+    process.on('uncaughtException', uncaughtExceptionHandler);
+    process.on('SIGINT', sigintHandler);
+    process.on('SIGTERM', sigtermHandler);
+    // Store handlers to be able to remove them later
+    return {
+        unhandledRejectionHandler,
+        uncaughtExceptionHandler,
+        sigintHandler,
+        sigtermHandler
+    };
+};
+export const removeProcessHandlers = (handlers) => {
+    const { unhandledRejectionHandler, uncaughtExceptionHandler, sigintHandler, sigtermHandler } = handlers;
+    process.removeListener('unhandledRejection', unhandledRejectionHandler);
+    process.removeListener('uncaughtException', uncaughtExceptionHandler);
+    process.removeListener('SIGINT', sigintHandler);
+    process.removeListener('SIGTERM', sigtermHandler);
+};
+//# sourceMappingURL=process-handlers.js.map

package/dist/esm/src/process-handlers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"process-handlers.js","sourceRoot":"","sources":["../../../src/process-handlers.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,gBAAgB,GAAG,KAAK,EAAE,SAAoB,EAAiB,EAAE;IAC5E,MAAM,SAAS,CAAC,IAAI,EAAE,CAAC;IACvB,OAAO,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAC;IAC7C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AASF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,SAAoB,EAAmB,EAAE;IAC1E,MAAM,yBAAyB,GAAG,CAAC,MAAW,EAAE,OAAqB,EAAQ,EAAE;QAC7E,OAAO,CAAC,KAAK,CACX,wCAAwC,MAAM,cAAc,IAAI,CAAC,SAAS,CACxE,OAAO,CACR,EAAE,CACJ,CAAC;IACJ,CAAC,CAAC;IAEF,MAAM,wBAAwB,GAAG,CAAC,GAAU,EAAQ,EAAE;QACpD,OAAO,CAAC,KAAK,CAAC,qBAAqB,EAAE,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,KAAK,IAAmB,EAAE;QAC9C,OAAO,CAAC,GAAG,CAAC,2DAA2D,CAAC,CAAC;QACzE,MAAM,gBAAgB,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG,KAAK,IAAmB,EAAE;QAC/C,OAAO,CAAC,GAAG,CAAC,4DAA4D,CAAC,CAAC;QAC1E,MAAM,gBAAgB,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC,CAAC;IAEF,OAAO,CAAC,EAAE,CAAC,oBAAoB,EAAE,yBAAyB,CAAC,CAAC;IAC5D,OAAO,CAAC,EAAE,CAAC,mBAAmB,EAAE,wBAAwB,CAAC,CAAC;IAC1D,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IACpC,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAEtC,iDAAiD;IACjD,OAAO;QACL,yBAAyB;QACzB,wBAAwB;QACxB,aAAa;QACb,cAAc;KACf,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,QAAyB,EAAQ,EAAE;IACvE,MAAM,EACJ,yBAAyB,EACzB,wBAAwB,EACxB,aAAa,EACb,cAAc,EACf,GAAG,QAAQ,CAAC;IAEb,OAAO,CAAC,cAAc,CAAC,oBAAoB,EAAE,yBAAyB,CAAC,CAAC;IACxE,OAAO,CAAC,cAAc,CAAC,mBAAmB,EAAE,wBAAwB,CAAC,CAAC;IACtE,OAAO,CAAC,cAAc,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAChD,OAAO,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;AACpD,CAAC,CAAC"}

package/dist/esm/src/registration/proof-of-work-manager.d.ts

@@ -0,0 +1,93 @@
+import type { ProofOfWorkChallengeModel } from "./proof-of-work-types.js";
+/**
+ * Manages proof-of-work challenge difficulty and lifecycle based on solve rate.
+ * Can have multiple instances each having their own desired solve rate and difficulty.
+ */
+export declare class ProofOfWorkManager {
+    static readonly defaultMaximumAllowedHashValue = "000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF";
+    private challengeNonces;
+    private proofOfWorkOfLastMinute;
+    private challengeSeed?;
+    private difficultyIncreaseMultiplier;
+    private currentMaximumAllowedHashValueAsBigInt;
+    private initialMaximumAllowedHashValueAsBigInt;
+    private desiredSolveCountPerMinute;
+    /**
+     * How often the challenge nonce is refreshed.
+     */
+    challengeRefreshFrequencyInSeconds: number;
+    /**
+     * How often the difficulty is reevaluated.
+     */
+    difficultyReevaluationFrequencyInSeconds: number;
+    /**
+     * The current maximum allowed hash value.
+     */
+    get currentMaximumAllowedHashValue(): bigint;
+    /**
+     * The current proof-of-work solve rate.
+     */
+    get currentSolveCountPerMinute(): number;
+    private constructor();
+    /**
+     * Creates a new ProofOfWorkManager instance.
+     * @param input.difficultyIncreaseMultiplier How fast to increase difficulty when solve rate is higher than desired. Must be >= 1.
+     *   Defaults to 1 which means if the solve rate is 2x the desired solve rate, the difficulty will increase by 2x.
+     *   If set to 2, it means if the solve rate is 2x the desired solve rate, the difficulty will increase by 4x.
+     * @param input.challengeRefreshFrequencyInSeconds How often the challenge nonce is refreshed. Defaults to 10 minutes.
+     * @param input.difficultyReevaluationFrequencyInSeconds How often the difficulty is reevaluated. Defaults to 10 seconds.
+     */
+    static create(input: {
+        desiredSolveCountPerMinute: number;
+        autoStart: boolean;
+        initialMaximumAllowedHashValue?: string;
+        difficultyIncreaseMultiplier?: number;
+        challengeSeed?: string;
+        challengeRefreshFrequencyInSeconds?: number;
+        difficultyReevaluationFrequencyInSeconds?: number;
+    }): Promise<ProofOfWorkManager>;
+    /**
+     * Starts the proof-of-work manager by starting the challenge nonce and difficulty refresh timers.
+     */
+    start(): void;
+    getProofOfWorkChallenge(): ProofOfWorkChallengeModel;
+    /**
+     * Verifies the proof-of-work meets the difficulty requirement.
+     */
+    verifyProofOfWork(proofOfWork: {
+        challengeNonce: string;
+        responseNonce: string;
+        requestData: string;
+    }): Promise<void>;
+    /**
+     * Records a successful proof-of-work.
+     * Exposed for testing purposes.
+     */
+    recordProofOfWork(proofOfWorkId: string): Promise<void>;
+    private periodicallyRefreshChallengeNonce;
+    private periodicallyRefreshProofOfWorkDifficulty;
+    private removeProofOfWorkOlderThanOneMinute;
+    private refreshChallengeNonce;
+    /**
+     * Refreshes the difficulty by changing the max hash value.
+     * The higher the number, the easier. Scale 1 (hardest) to 2^256 (easiest), represented in HEX.
+     *
+     * If solve rate rate is higher than expected, the difficulty will increase rapidly.
+     * If solve rate is lower than expected, the difficulty will decrease gradually.
+     * The difficulty will never be lower than the initial difficulty.
+     */
+    private refreshMaximumAllowedHashValue;
+    /**
+     * Only used by refreshMaximumAllowedHashValue() to reduce the challenge difficulty gradually.
+     */
+    private hashValueIncrementPerEvaluation;
+    /**
+     * Verifies that the supplied string is a HEX string.
+     */
+    static isHexString(str: string): boolean;
+    /**
+     * Converts a BigInt to a 256 bit HEX string with padded preceding zeros (64 characters).
+     */
+    private static bigIntToHexString;
+}
+//# sourceMappingURL=proof-of-work-manager.d.ts.map

package/dist/esm/src/registration/proof-of-work-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proof-of-work-manager.d.ts","sourceRoot":"","sources":["../../../../src/registration/proof-of-work-manager.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,0BAA0B,CAAC;AAG1E;;;GAGG;AACH,qBAAa,kBAAkB;IAE7B,gBAAuB,8BAA8B,sEAAsE;IAG3H,OAAO,CAAC,eAAe,CAIrB;IAIF,OAAO,CAAC,uBAAuB,CAAkC;IAGjE,OAAO,CAAC,aAAa,CAAC,CAAS;IAC/B,OAAO,CAAC,4BAA4B,CAAS;IAC7C,OAAO,CAAC,sCAAsC,CAAS;IACvD,OAAO,CAAC,sCAAsC,CAAS;IACvD,OAAO,CAAC,0BAA0B,CAAS;IAE3C;;OAEG;IACI,kCAAkC,EAAE,MAAM,CAAC;IAElD;;OAEG;IACI,wCAAwC,EAAE,MAAM,CAAC;IAExD;;OAEG;IACH,IAAW,8BAA8B,IAAI,MAAM,CAElD;IAED;;OAEG;IACH,IAAW,0BAA0B,IAAI,MAAM,CAE9C;IAED,OAAO;IAoBP;;;;;;;OAOG;WACiB,MAAM,CAAC,KAAK,EAAE;QAChC,0BAA0B,EAAE,MAAM,CAAC;QACnC,SAAS,EAAE,OAAO,CAAC;QACnB,8BAA8B,CAAC,EAAE,MAAM,CAAC;QACxC,4BAA4B,CAAC,EAAE,MAAM,CAAC;QACtC,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,kCAAkC,CAAC,EAAE,MAAM,CAAC;QAC5C,wCAAwC,CAAC,EAAE,MAAM,CAAA;KAClD,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAwB/B;;OAEG;IACI,KAAK,IAAI,IAAI;IAKb,uBAAuB,IAAI,yBAAyB;IAO3D;;OAEG;IACU,iBAAiB,CAAC,WAAW,EAAE;QAC1C,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,WAAW,EAAE,MAAM,CAAC;KACrB,GAAG,OAAO,CAAC,IAAI,CAAC;IAkCjB;;;OAGG;IACU,iBAAiB,CAAC,aAAa,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIpE,OAAO,CAAC,iCAAiC;IAUzC,OAAO,CAAC,wCAAwC;IAUhD,OAAO,CAAC,mCAAmC;IAS3C,OAAO,CAAC,qBAAqB;IAoB7B;;;;;;;OAOG;YACW,8BAA8B;IAyD5C;;OAEG;IACH,OAAO,CAAC,+BAA+B,CAAa;IAEpD;;OAEG;WACW,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAK/C;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;CAQjC"}

package/dist/esm/src/registration/proof-of-work-manager.js

@@ -0,0 +1,243 @@
+import { DwnServerError, DwnServerErrorCode } from "../dwn-error.js";
+import { ProofOfWork } from "./proof-of-work.js";
+/**
+ * Manages proof-of-work challenge difficulty and lifecycle based on solve rate.
+ * Can have multiple instances each having their own desired solve rate and difficulty.
+ */
+export class ProofOfWorkManager {
+    // Takes from seconds to ~1 minute to solve on an M1 MacBook.
+    static defaultMaximumAllowedHashValue = '000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF';
+    // Challenge nonces that can be used for proof-of-work.
+    challengeNonces;
+    // There is opportunity to improve implementation here.
+    // TODO: https://github.com/TBD54566975/dwn-server/issues/101
+    proofOfWorkOfLastMinute = new Map(); // proofOfWorkId -> timestamp of proof-of-work
+    // Seed to generate the challenge nonce from, this allows all DWN instances in a cluster to generate the same challenge.
+    challengeSeed;
+    difficultyIncreaseMultiplier;
+    currentMaximumAllowedHashValueAsBigInt;
+    initialMaximumAllowedHashValueAsBigInt;
+    desiredSolveCountPerMinute;
+    /**
+     * How often the challenge nonce is refreshed.
+     */
+    challengeRefreshFrequencyInSeconds;
+    /**
+     * How often the difficulty is reevaluated.
+     */
+    difficultyReevaluationFrequencyInSeconds;
+    /**
+     * The current maximum allowed hash value.
+     */
+    get currentMaximumAllowedHashValue() {
+        return this.currentMaximumAllowedHashValueAsBigInt;
+    }
+    /**
+     * The current proof-of-work solve rate.
+     */
+    get currentSolveCountPerMinute() {
+        return this.proofOfWorkOfLastMinute.size;
+    }
+    constructor(input) {
+        const { desiredSolveCountPerMinute, initialMaximumAllowedHashValue } = input;
+        this.challengeSeed = input.challengeSeed;
+        this.challengeNonces = { currentChallengeNonce: ProofOfWork.generateNonce() };
+        this.currentMaximumAllowedHashValueAsBigInt = BigInt(`0x${initialMaximumAllowedHashValue}`);
+        this.initialMaximumAllowedHashValueAsBigInt = BigInt(`0x${initialMaximumAllowedHashValue}`);
+        this.desiredSolveCountPerMinute = desiredSolveCountPerMinute;
+        this.difficultyIncreaseMultiplier = input.difficultyIncreaseMultiplier;
+        this.challengeRefreshFrequencyInSeconds = input.challengeRefreshFrequencyInSeconds;
+        this.difficultyReevaluationFrequencyInSeconds = input.difficultyReevaluationFrequencyInSeconds;
+    }
+    /**
+     * Creates a new ProofOfWorkManager instance.
+     * @param input.difficultyIncreaseMultiplier How fast to increase difficulty when solve rate is higher than desired. Must be >= 1.
+     *   Defaults to 1 which means if the solve rate is 2x the desired solve rate, the difficulty will increase by 2x.
+     *   If set to 2, it means if the solve rate is 2x the desired solve rate, the difficulty will increase by 4x.
+     * @param input.challengeRefreshFrequencyInSeconds How often the challenge nonce is refreshed. Defaults to 10 minutes.
+     * @param input.difficultyReevaluationFrequencyInSeconds How often the difficulty is reevaluated. Defaults to 10 seconds.
+     */
+    static async create(input) {
+        const { desiredSolveCountPerMinute } = input;
+        const initialMaximumAllowedHashValue = input.initialMaximumAllowedHashValue ?? ProofOfWorkManager.defaultMaximumAllowedHashValue;
+        const difficultyIncreaseMultiplier = input.difficultyIncreaseMultiplier ?? 1; // 1x default
+        const challengeRefreshFrequencyInSeconds = input.challengeRefreshFrequencyInSeconds ?? 10 * 60; // 10 minutes default
+        const difficultyReevaluationFrequencyInSeconds = input.difficultyReevaluationFrequencyInSeconds ?? 10; // 10 seconds default
+        const proofOfWorkManager = new ProofOfWorkManager({
+            desiredSolveCountPerMinute,
+            initialMaximumAllowedHashValue,
+            difficultyIncreaseMultiplier,
+            challengeSeed: input.challengeSeed,
+            challengeRefreshFrequencyInSeconds,
+            difficultyReevaluationFrequencyInSeconds
+        });
+        if (input.autoStart) {
+            proofOfWorkManager.start();
+        }
+        return proofOfWorkManager;
+    }
+    /**
+     * Starts the proof-of-work manager by starting the challenge nonce and difficulty refresh timers.
+     */
+    start() {
+        this.periodicallyRefreshChallengeNonce();
+        this.periodicallyRefreshProofOfWorkDifficulty();
+    }
+    getProofOfWorkChallenge() {
+        return {
+            challengeNonce: this.challengeNonces.currentChallengeNonce,
+            maximumAllowedHashValue: ProofOfWorkManager.bigIntToHexString(this.currentMaximumAllowedHashValue),
+        };
+    }
+    /**
+     * Verifies the proof-of-work meets the difficulty requirement.
+     */
+    async verifyProofOfWork(proofOfWork) {
+        const { challengeNonce, responseNonce, requestData } = proofOfWork;
+        if (this.proofOfWorkOfLastMinute.has(responseNonce)) {
+            throw new DwnServerError(DwnServerErrorCode.ProofOfWorkManagerResponseNonceReused, `Not allowed to reused response nonce: ${responseNonce}.`);
+        }
+        // Verify response nonce is a HEX string that represents a 256 bit value.
+        if (!ProofOfWorkManager.isHexString(responseNonce) || responseNonce.length !== 64) {
+            throw new DwnServerError(DwnServerErrorCode.ProofOfWorkManagerInvalidResponseNonceFormat, `Response nonce not a HEX string representing a 256 bit value: ${responseNonce}.`);
+        }
+        // Verify challenge nonce is valid.
+        const { previousChallengeNonce, currentChallengeNonce, nextChallengeNonce } = this.challengeNonces;
+        const acceptableChallengeNonces = [previousChallengeNonce, currentChallengeNonce, nextChallengeNonce].filter(nonce => nonce !== undefined && nonce !== '');
+        if (!acceptableChallengeNonces.includes(challengeNonce)) {
+            throw new DwnServerError(DwnServerErrorCode.ProofOfWorkManagerInvalidChallengeNonce, `Unknown or expired challenge nonce: ${challengeNonce}.`);
+        }
+        const maximumAllowedHashValue = this.currentMaximumAllowedHashValue;
+        ProofOfWork.verifyResponseNonce({ challengeNonce, responseNonce, requestData, maximumAllowedHashValue });
+        this.recordProofOfWork(responseNonce);
+    }
+    /**
+     * Records a successful proof-of-work.
+     * Exposed for testing purposes.
+     */
+    async recordProofOfWork(proofOfWorkId) {
+        this.proofOfWorkOfLastMinute.set(proofOfWorkId, Date.now());
+    }
+    periodicallyRefreshChallengeNonce() {
+        try {
+            this.refreshChallengeNonce();
+        }
+        catch (error) {
+            console.error(`Encountered error while refreshing challenge nonce: ${error}`);
+        }
+        finally {
+            setTimeout(async () => this.periodicallyRefreshChallengeNonce(), this.challengeRefreshFrequencyInSeconds * 1000);
+        }
+    }
+    periodicallyRefreshProofOfWorkDifficulty() {
+        try {
+            this.refreshMaximumAllowedHashValue();
+        }
+        catch (error) {
+            console.error(`Encountered error while updating proof of work difficulty: ${error}`);
+        }
+        finally {
+            setTimeout(async () => this.periodicallyRefreshProofOfWorkDifficulty(), this.difficultyReevaluationFrequencyInSeconds * 1000);
+        }
+    }
+    removeProofOfWorkOlderThanOneMinute() {
+        const oneMinuteAgo = Date.now() - 60 * 1000;
+        for (const proofOfWorkId of this.proofOfWorkOfLastMinute.keys()) {
+            if (this.proofOfWorkOfLastMinute.get(proofOfWorkId) < oneMinuteAgo) {
+                this.proofOfWorkOfLastMinute.delete(proofOfWorkId);
+            }
+        }
+    }
+    refreshChallengeNonce() {
+        // If challenge seed is supplied, use it to deterministically generate the challenge nonces.
+        if (this.challengeSeed !== undefined) {
+            const currentRefreshIntervalId = Math.floor(Date.now() / (this.challengeRefreshFrequencyInSeconds * 1000));
+            const previousRefreshIntervalId = currentRefreshIntervalId - 1;
+            const nextRefreshIntervalId = currentRefreshIntervalId + 1;
+            const previousChallengeNonce = ProofOfWork.hashAsHexString([this.challengeSeed, previousRefreshIntervalId.toString(), this.challengeSeed]);
+            const currentChallengeNonce = ProofOfWork.hashAsHexString([this.challengeSeed, currentRefreshIntervalId.toString(), this.challengeSeed]);
+            const nextChallengeNonce = ProofOfWork.hashAsHexString([this.challengeSeed, nextRefreshIntervalId.toString(), this.challengeSeed]);
+            this.challengeNonces = { previousChallengeNonce, currentChallengeNonce, nextChallengeNonce };
+        }
+        else {
+            const newChallengeNonce = ProofOfWork.generateNonce();
+            this.challengeNonces.previousChallengeNonce = this.challengeNonces.currentChallengeNonce;
+            this.challengeNonces.currentChallengeNonce = newChallengeNonce;
+        }
+    }
+    /**
+     * Refreshes the difficulty by changing the max hash value.
+     * The higher the number, the easier. Scale 1 (hardest) to 2^256 (easiest), represented in HEX.
+     *
+     * If solve rate rate is higher than expected, the difficulty will increase rapidly.
+     * If solve rate is lower than expected, the difficulty will decrease gradually.
+     * The difficulty will never be lower than the initial difficulty.
+     */
+    async refreshMaximumAllowedHashValue() {
+        // Cleanup proof-of-work cache and update solve rate.
+        this.removeProofOfWorkOlderThanOneMinute();
+        const latestSolveCountPerMinute = this.proofOfWorkOfLastMinute.size;
+        // NOTE: bigint arithmetic does NOT work with decimals, so we work with "full numbers" by multiplying by a scale factor.
+        const scaleFactor = 1_000_000;
+        const difficultyEvaluationsPerMinute = 60000 / (this.difficultyReevaluationFrequencyInSeconds * 1000); // assumed to be >= 1;
+        // NOTE: easier difficulty is represented by a larger max allowed hash value
+        //       and harder difficulty is represented by a smaller max allowed hash value.
+        if (latestSolveCountPerMinute > this.desiredSolveCountPerMinute) {
+            // if solve rate is higher than desired, make difficulty harder by making the max allowed hash value smaller
+            const currentSolveRateInFractionOfDesiredSolveRate = latestSolveCountPerMinute / this.desiredSolveCountPerMinute;
+            const newMaximumAllowedHashValueAsBigIntPriorToMultiplierAdjustment = (this.currentMaximumAllowedHashValueAsBigInt * BigInt(scaleFactor)) /
+                (BigInt(Math.floor(currentSolveRateInFractionOfDesiredSolveRate * this.difficultyIncreaseMultiplier * scaleFactor)));
+            const hashValueDecreaseAmountPriorToEvaluationFrequencyAdjustment = (this.currentMaximumAllowedHashValueAsBigInt - newMaximumAllowedHashValueAsBigIntPriorToMultiplierAdjustment) *
+                (BigInt(Math.floor(this.difficultyIncreaseMultiplier * scaleFactor)) / BigInt(scaleFactor));
+            // Adjustment based on the reevaluation frequency to provide more-or-less consistent behavior regardless of the reevaluation frequency.
+            const hashValueDecreaseAmount = hashValueDecreaseAmountPriorToEvaluationFrequencyAdjustment / BigInt(difficultyEvaluationsPerMinute);
+            this.currentMaximumAllowedHashValueAsBigInt -= hashValueDecreaseAmount;
+            // Resetting to allow hash increment to be recalculated when difficulty needs to be reduced (in `else` block below)
+            this.hashValueIncrementPerEvaluation = undefined;
+        }
+        else {
+            // if solve rate is lower than desired, make difficulty easier by making the max allowed hash value larger
+            if (this.currentMaximumAllowedHashValueAsBigInt === this.initialMaximumAllowedHashValueAsBigInt) {
+                // if current difficulty is already at initial difficulty, nothing to do
+                return;
+            }
+            if (this.hashValueIncrementPerEvaluation === undefined) {
+                const backToInitialDifficultyInMinutes = 10;
+                const differenceBetweenInitialAndCurrentDifficulty = this.initialMaximumAllowedHashValueAsBigInt - this.currentMaximumAllowedHashValueAsBigInt;
+                this.hashValueIncrementPerEvaluation
+                    = differenceBetweenInitialAndCurrentDifficulty / BigInt(backToInitialDifficultyInMinutes * difficultyEvaluationsPerMinute);
+            }
+            // if newly calculated difficulty is lower than initial difficulty, just use the initial difficulty
+            const newMaximumAllowedHashValueAsBigInt = this.currentMaximumAllowedHashValueAsBigInt + this.hashValueIncrementPerEvaluation;
+            if (newMaximumAllowedHashValueAsBigInt >= this.initialMaximumAllowedHashValueAsBigInt) {
+                this.currentMaximumAllowedHashValueAsBigInt = this.initialMaximumAllowedHashValueAsBigInt;
+            }
+            else {
+                this.currentMaximumAllowedHashValueAsBigInt = newMaximumAllowedHashValueAsBigInt;
+            }
+        }
+    }
+    /**
+     * Only used by refreshMaximumAllowedHashValue() to reduce the challenge difficulty gradually.
+     */
+    hashValueIncrementPerEvaluation = BigInt(1);
+    /**
+     * Verifies that the supplied string is a HEX string.
+     */
+    static isHexString(str) {
+        const regexp = /^[0-9a-fA-F]+$/;
+        return regexp.test(str);
+    }
+    /**
+     * Converts a BigInt to a 256 bit HEX string with padded preceding zeros (64 characters).
+     */
+    static bigIntToHexString(int) {
+        let hex = int.toString(16).toUpperCase();
+        const stringLength = hex.length;
+        for (let pad = stringLength; pad < 64; pad++) {
+            hex = '0' + hex;
+        }
+        return hex;
+    }
+}
+//# sourceMappingURL=proof-of-work-manager.js.map

package/dist/esm/src/registration/proof-of-work-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proof-of-work-manager.js","sourceRoot":"","sources":["../../../../src/registration/proof-of-work-manager.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAErE,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAEjD;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAC7B,6DAA6D;IACtD,MAAM,CAAU,8BAA8B,GAAG,kEAAkE,CAAC;IAE3H,uDAAuD;IAC/C,eAAe,CAIrB;IAEF,uDAAuD;IACvD,6DAA6D;IACrD,uBAAuB,GAAwB,IAAI,GAAG,EAAE,CAAC,CAAC,8CAA8C;IAEhH,wHAAwH;IAChH,aAAa,CAAU;IACvB,4BAA4B,CAAS;IACrC,sCAAsC,CAAS;IAC/C,sCAAsC,CAAS;IAC/C,0BAA0B,CAAS;IAE3C;;OAEG;IACI,kCAAkC,CAAS;IAElD;;OAEG;IACI,wCAAwC,CAAS;IAExD;;OAEG;IACH,IAAW,8BAA8B;QACvC,OAAO,IAAI,CAAC,sCAAsC,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,IAAW,0BAA0B;QACnC,OAAO,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC;IAC3C,CAAC;IAED,YAAqB,KAOpB;QACC,MAAM,EAAE,0BAA0B,EAAE,8BAA8B,EAAE,GAAG,KAAK,CAAC;QAE7E,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,eAAe,GAAG,EAAE,qBAAqB,EAAE,WAAW,CAAC,aAAa,EAAE,EAAE,CAAC;QAC9E,IAAI,CAAC,sCAAsC,GAAG,MAAM,CAAC,KAAK,8BAA8B,EAAE,CAAC,CAAC;QAC5F,IAAI,CAAC,sCAAsC,GAAG,MAAM,CAAC,KAAK,8BAA8B,EAAE,CAAC,CAAC;QAC5F,IAAI,CAAC,0BAA0B,GAAG,0BAA0B,CAAC;QAC7D,IAAI,CAAC,4BAA4B,GAAG,KAAK,CAAC,4BAA4B,CAAC;QACvE,IAAI,CAAC,kCAAkC,GAAG,KAAK,CAAC,kCAAkC,CAAC;QACnF,IAAI,CAAC,wCAAwC,GAAG,KAAK,CAAC,wCAAwC,CAAC;IACjG,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAQ1B;QACC,MAAM,EAAE,0BAA0B,EAAE,GAAG,KAAK,CAAC;QAE7C,MAAM,8BAA8B,GAAG,KAAK,CAAC,8BAA8B,IAAI,kBAAkB,CAAC,8BAA8B,CAAC;QACjI,MAAM,4BAA4B,GAAG,KAAK,CAAC,4BAA4B,IAAI,CAAC,CAAC,CAAC,aAAa;QAC3F,MAAM,kCAAkC,GAAG,KAAK,CAAC,kCAAkC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,qBAAqB;QACrH,MAAM,wCAAwC,GAAG,KAAK,CAAC,wCAAwC,IAAI,EAAE,CAAC,CAAC,qBAAqB;QAE5H,MAAM,kBAAkB,GAAG,IAAI,kBAAkB,CAAC;YAChD,0BAA0B;YAC1B,8BAA8B;YAC9B,4BAA4B;YAC5B,aAAa,EAAE,KAAK,CAAC,aAAa;YAClC,kCAAkC;YAClC,wCAAwC;SACzC,CAAC,CAAC;QAEH,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACpB,kBAAkB,CAAC,KAAK,EAAE,CAAC;QAC7B,CAAC;QAED,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,iCAAiC,EAAE,CAAC;QACzC,IAAI,CAAC,wCAAwC,EAAE,CAAC;IAClD,CAAC;IAEM,uBAAuB;QAC5B,OAAO;YACL,cAAc,EAAE,IAAI,CAAC,eAAe,CAAC,qBAAqB;YAC1D,uBAAuB,EAAE,kBAAkB,CAAC,iBAAiB,CAAC,IAAI,CAAC,8BAA8B,CAAC;SACnG,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,iBAAiB,CAAC,WAI9B;QACC,MAAM,EAAE,cAAc,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,WAAW,CAAC;QAEnE,IAAI,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,cAAc,CACtB,kBAAkB,CAAC,qCAAqC,EACxD,yCAAyC,aAAa,GAAG,CAC1D,CAAC;QACJ,CAAC;QAED,yEAAyE;QACzE,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;YAClF,MAAM,IAAI,cAAc,CACtB,kBAAkB,CAAC,4CAA4C,EAC/D,iEAAiE,aAAa,GAAG,CAClF,CAAC;QACJ,CAAC;QAED,mCAAmC;QACnC,MAAM,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC;QACnG,MAAM,yBAAyB,GAAG,CAAC,sBAAsB,EAAE,qBAAqB,EAAE,kBAAkB,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;QAC3J,IAAI,CAAC,yBAAyB,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,cAAc,CACtB,kBAAkB,CAAC,uCAAuC,EAC1D,uCAAuC,cAAc,GAAG,CACzD,CAAC;QACJ,CAAC;QAED,MAAM,uBAAuB,GAAG,IAAI,CAAC,8BAA8B,CAAC;QACpE,WAAW,CAAC,mBAAmB,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,WAAW,EAAE,uBAAuB,EAAE,CAAC,CAAC;QAEzG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,iBAAiB,CAAC,aAAqB;QAClD,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IAC9D,CAAC;IAEO,iCAAiC;QACvC,IAAI,CAAC;YACH,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,uDAAuD,KAAK,EAAE,CAAC,CAAC;QAChF,CAAC;gBAAS,CAAC;YACT,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC,IAAI,CAAC,iCAAiC,EAAE,EAAE,IAAI,CAAC,kCAAkC,GAAG,IAAI,CAAC,CAAC;QACnH,CAAC;IACH,CAAC;IAEO,wCAAwC;QAC9C,IAAI,CAAC;YACH,IAAI,CAAC,8BAA8B,EAAE,CAAC;QACxC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,8DAA8D,KAAK,EAAE,CAAC,CAAC;QACvF,CAAC;gBAAS,CAAC;YACT,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC,IAAI,CAAC,wCAAwC,EAAE,EAAE,IAAI,CAAC,wCAAwC,GAAG,IAAI,CAAC,CAAC;QAChI,CAAC;IACH,CAAC;IAEO,mCAAmC;QACzC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QAC5C,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,EAAE,CAAC;YAChE,IAAI,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,YAAY,EAAE,CAAC;gBACnE,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IAEO,qBAAqB;QAC3B,4FAA4F;QAC5F,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,wBAAwB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,kCAAkC,GAAG,IAAI,CAAC,CAAC,CAAC;YAC3G,MAAM,yBAAyB,GAAG,wBAAwB,GAAG,CAAC,CAAC;YAC/D,MAAM,qBAAqB,GAAG,wBAAwB,GAAG,CAAC,CAAC;YAE3D,MAAM,sBAAsB,GAAG,WAAW,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,aAAa,EAAE,yBAAyB,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YAC3I,MAAM,qBAAqB,GAAG,WAAW,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,aAAa,EAAE,wBAAwB,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YACzI,MAAM,kBAAkB,GAAG,WAAW,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,aAAa,EAAE,qBAAqB,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;YAEnI,IAAI,CAAC,eAAe,GAAG,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,CAAC;QAC/F,CAAC;aAAM,CAAC;YACN,MAAM,iBAAiB,GAAG,WAAW,CAAC,aAAa,EAAE,CAAC;YAEtD,IAAI,CAAC,eAAe,CAAC,sBAAsB,GAAG,IAAI,CAAC,eAAe,CAAC,qBAAqB,CAAC;YACzF,IAAI,CAAC,eAAe,CAAC,qBAAqB,GAAG,iBAAiB,CAAC;QACjE,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACK,KAAK,CAAC,8BAA8B;QAC1C,qDAAqD;QACrD,IAAI,CAAC,mCAAmC,EAAE,CAAC;QAE3C,MAAM,yBAAyB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC;QAEpE,wHAAwH;QACxH,MAAM,WAAW,GAAG,SAAS,CAAC;QAC9B,MAAM,8BAA8B,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,wCAAwC,GAAG,IAAI,CAAC,CAAC,CAAC,sBAAsB;QAE7H,4EAA4E;QAC5E,kFAAkF;QAClF,IAAI,yBAAyB,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;YAChE,4GAA4G;YAE5G,MAAM,4CAA4C,GAAG,yBAAyB,GAAG,IAAI,CAAC,0BAA0B,CAAC;YACjH,MAAM,6DAA6D,GAC/D,CAAC,IAAI,CAAC,sCAAsC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;gBACnE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,4CAA4C,GAAG,IAAI,CAAC,4BAA4B,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAEzH,MAAM,2DAA2D,GAC7D,CAAC,IAAI,CAAC,sCAAsC,GAAG,6DAA6D,CAAC;gBAC7G,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,4BAA4B,GAAG,WAAW,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;YAEhG,uIAAuI;YACvI,MAAM,uBAAuB,GAAG,2DAA2D,GAAG,MAAM,CAAC,8BAA8B,CAAC,CAAC;YAErI,IAAI,CAAC,sCAAsC,IAAI,uBAAuB,CAAC;YAEvE,mHAAmH;YACnH,IAAI,CAAC,+BAA+B,GAAG,SAAS,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,0GAA0G;YAE1G,IAAI,IAAI,CAAC,sCAAsC,KAAK,IAAI,CAAC,sCAAsC,EAAE,CAAC;gBAChG,wEAAwE;gBACxE,OAAO;YACT,CAAC;YAED,IAAI,IAAI,CAAC,+BAA+B,KAAK,SAAS,EAAE,CAAC;gBACvD,MAAM,gCAAgC,GAAG,EAAE,CAAC;gBAC5C,MAAM,4CAA4C,GAC9C,IAAI,CAAC,sCAAsC,GAAG,IAAI,CAAC,sCAAsC,CAAC;gBAC9F,IAAI,CAAC,+BAA+B;sBAChC,4CAA4C,GAAG,MAAM,CAAC,gCAAgC,GAAG,8BAA8B,CAAC,CAAC;YAC/H,CAAC;YAED,mGAAmG;YACnG,MAAM,kCAAkC,GAAG,IAAI,CAAC,sCAAsC,GAAG,IAAI,CAAC,+BAA+B,CAAC;YAC9H,IAAI,kCAAkC,IAAI,IAAI,CAAC,sCAAsC,EAAE,CAAC;gBACtF,IAAI,CAAC,sCAAsC,GAAG,IAAI,CAAC,sCAAsC,CAAC;YAC5F,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,sCAAsC,GAAG,kCAAkC,CAAC;YACnF,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,+BAA+B,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEpD;;OAEG;IACI,MAAM,CAAC,WAAW,CAAC,GAAW;QACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC;QAChC,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,iBAAiB,CAAE,GAAW;QAC3C,IAAI,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACzC,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,CAAC;QAChC,KAAK,IAAI,GAAG,GAAG,YAAY,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;YAC7C,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;QAClB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC"}