holosphere 2.0.0-alpha1 → 2.0.0-alpha2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cjs/holosphere.cjs +2 -0
- package/dist/cjs/holosphere.cjs.map +1 -0
- package/dist/esm/holosphere.js +56 -0
- package/dist/esm/holosphere.js.map +1 -0
- package/dist/index-CDfIuXew.js +15974 -0
- package/dist/index-CDfIuXew.js.map +1 -0
- package/dist/index-ifOgtDvd.cjs +3 -0
- package/dist/index-ifOgtDvd.cjs.map +1 -0
- package/dist/indexeddb-storage-CMW4qRQS.js +96 -0
- package/dist/indexeddb-storage-CMW4qRQS.js.map +1 -0
- package/dist/indexeddb-storage-DLZOgetM.cjs +2 -0
- package/dist/indexeddb-storage-DLZOgetM.cjs.map +1 -0
- package/dist/memory-storage-DQzcAZlf.js +47 -0
- package/dist/memory-storage-DQzcAZlf.js.map +1 -0
- package/dist/memory-storage-DmePEP2q.cjs +2 -0
- package/dist/memory-storage-DmePEP2q.cjs.map +1 -0
- package/dist/secp256k1-CP0ZkpAx.cjs +13 -0
- package/dist/secp256k1-CP0ZkpAx.cjs.map +1 -0
- package/dist/secp256k1-vOXp40Fx.js +2281 -0
- package/dist/secp256k1-vOXp40Fx.js.map +1 -0
- package/docs/FOSDEM_PROPOSAL.md +388 -0
- package/docs/LOCALFIRST.md +266 -0
- package/docs/contracts/api-interface.md +793 -0
- package/docs/data-model.md +476 -0
- package/docs/gun-async-usage.md +338 -0
- package/docs/plan.md +349 -0
- package/docs/quickstart.md +674 -0
- package/docs/research.md +362 -0
- package/docs/spec.md +244 -0
- package/docs/storage-backends.md +326 -0
- package/docs/tasks.md +947 -0
- package/package.json +1 -1
- package/tests/unit/ai/aggregation.test.js +0 -295
- package/tests/unit/ai/breakdown.test.js +0 -446
- package/tests/unit/ai/classifier.test.js +0 -294
- package/tests/unit/ai/council.test.js +0 -262
- package/tests/unit/ai/embeddings.test.js +0 -384
- package/tests/unit/ai/federation-ai.test.js +0 -344
- package/tests/unit/ai/h3-ai.test.js +0 -458
- package/tests/unit/ai/index.test.js +0 -304
- package/tests/unit/ai/json-ops.test.js +0 -307
- package/tests/unit/ai/llm-service.test.js +0 -390
- package/tests/unit/ai/nl-query.test.js +0 -383
- package/tests/unit/ai/relationships.test.js +0 -311
- package/tests/unit/ai/schema-extractor.test.js +0 -384
- package/tests/unit/ai/spatial.test.js +0 -279
- package/tests/unit/ai/tts.test.js +0 -279
- package/tests/unit/content.test.js +0 -332
- package/tests/unit/contract/core.test.js +0 -88
- package/tests/unit/contract/crypto.test.js +0 -198
- package/tests/unit/contract/data.test.js +0 -223
- package/tests/unit/contract/federation.test.js +0 -181
- package/tests/unit/contract/hierarchical.test.js +0 -113
- package/tests/unit/contract/schema.test.js +0 -114
- package/tests/unit/contract/social.test.js +0 -217
- package/tests/unit/contract/spatial.test.js +0 -110
- package/tests/unit/contract/subscriptions.test.js +0 -128
- package/tests/unit/contract/utils.test.js +0 -159
- package/tests/unit/core.test.js +0 -152
- package/tests/unit/crypto.test.js +0 -328
- package/tests/unit/federation.test.js +0 -234
- package/tests/unit/gun-async.test.js +0 -252
- package/tests/unit/hierarchical.test.js +0 -399
- package/tests/unit/integration/scenario-01-geographic-storage.test.js +0 -74
- package/tests/unit/integration/scenario-02-federation.test.js +0 -76
- package/tests/unit/integration/scenario-03-subscriptions.test.js +0 -102
- package/tests/unit/integration/scenario-04-validation.test.js +0 -129
- package/tests/unit/integration/scenario-05-hierarchy.test.js +0 -125
- package/tests/unit/integration/scenario-06-social.test.js +0 -135
- package/tests/unit/integration/scenario-07-persistence.test.js +0 -130
- package/tests/unit/integration/scenario-08-authorization.test.js +0 -161
- package/tests/unit/integration/scenario-09-cross-dimensional.test.js +0 -139
- package/tests/unit/integration/scenario-10-cross-holosphere-capabilities.test.js +0 -357
- package/tests/unit/integration/scenario-11-cross-holosphere-federation.test.js +0 -410
- package/tests/unit/integration/scenario-12-capability-federated-read.test.js +0 -719
- package/tests/unit/performance/benchmark.test.js +0 -85
- package/tests/unit/schema.test.js +0 -213
- package/tests/unit/spatial.test.js +0 -158
- package/tests/unit/storage.test.js +0 -195
- package/tests/unit/subscriptions.test.js +0 -328
- package/tests/unit/test-data-permanence-debug.js +0 -197
- package/tests/unit/test-data-permanence.js +0 -340
- package/tests/unit/test-key-persistence-fixed.js +0 -148
- package/tests/unit/test-key-persistence.js +0 -172
- package/tests/unit/test-relay-permanence.js +0 -376
- package/tests/unit/test-second-node.js +0 -95
- package/tests/unit/test-simple-write.js +0 -89
|
@@ -0,0 +1,96 @@
|
|
|
1
|
+
import { P as PersistentStorage } from "./index-CDfIuXew.js";
|
|
2
|
+
class IndexedDBStorage extends PersistentStorage {
|
|
3
|
+
constructor() {
|
|
4
|
+
super();
|
|
5
|
+
this.db = null;
|
|
6
|
+
this.dbName = null;
|
|
7
|
+
this.storeName = "events";
|
|
8
|
+
}
|
|
9
|
+
async init(namespace) {
|
|
10
|
+
this.dbName = `holosphere_${namespace}`;
|
|
11
|
+
return new Promise((resolve, reject) => {
|
|
12
|
+
const request = indexedDB.open(this.dbName, 1);
|
|
13
|
+
request.onerror = () => reject(request.error);
|
|
14
|
+
request.onsuccess = () => {
|
|
15
|
+
this.db = request.result;
|
|
16
|
+
resolve();
|
|
17
|
+
};
|
|
18
|
+
request.onupgradeneeded = (event) => {
|
|
19
|
+
const db = event.target.result;
|
|
20
|
+
if (!db.objectStoreNames.contains(this.storeName)) {
|
|
21
|
+
const objectStore = db.createObjectStore(this.storeName, { keyPath: "key" });
|
|
22
|
+
objectStore.createIndex("key", "key", { unique: false });
|
|
23
|
+
}
|
|
24
|
+
};
|
|
25
|
+
});
|
|
26
|
+
}
|
|
27
|
+
async put(key, event) {
|
|
28
|
+
return new Promise((resolve, reject) => {
|
|
29
|
+
const transaction = this.db.transaction([this.storeName], "readwrite");
|
|
30
|
+
const objectStore = transaction.objectStore(this.storeName);
|
|
31
|
+
const request = objectStore.put({ key, event, timestamp: Date.now() });
|
|
32
|
+
request.onsuccess = () => resolve();
|
|
33
|
+
request.onerror = () => reject(request.error);
|
|
34
|
+
});
|
|
35
|
+
}
|
|
36
|
+
async get(key) {
|
|
37
|
+
return new Promise((resolve, reject) => {
|
|
38
|
+
const transaction = this.db.transaction([this.storeName], "readonly");
|
|
39
|
+
const objectStore = transaction.objectStore(this.storeName);
|
|
40
|
+
const request = objectStore.get(key);
|
|
41
|
+
request.onsuccess = () => {
|
|
42
|
+
const result = request.result;
|
|
43
|
+
resolve(result ? result.event : null);
|
|
44
|
+
};
|
|
45
|
+
request.onerror = () => reject(request.error);
|
|
46
|
+
});
|
|
47
|
+
}
|
|
48
|
+
async getAll(prefix) {
|
|
49
|
+
return new Promise((resolve, reject) => {
|
|
50
|
+
const transaction = this.db.transaction([this.storeName], "readonly");
|
|
51
|
+
const objectStore = transaction.objectStore(this.storeName);
|
|
52
|
+
const results = [];
|
|
53
|
+
const request = objectStore.openCursor();
|
|
54
|
+
request.onsuccess = (event) => {
|
|
55
|
+
const cursor = event.target.result;
|
|
56
|
+
if (cursor) {
|
|
57
|
+
if (cursor.value.key.startsWith(prefix)) {
|
|
58
|
+
results.push(cursor.value.event);
|
|
59
|
+
}
|
|
60
|
+
cursor.continue();
|
|
61
|
+
} else {
|
|
62
|
+
resolve(results);
|
|
63
|
+
}
|
|
64
|
+
};
|
|
65
|
+
request.onerror = () => reject(request.error);
|
|
66
|
+
});
|
|
67
|
+
}
|
|
68
|
+
async delete(key) {
|
|
69
|
+
return new Promise((resolve, reject) => {
|
|
70
|
+
const transaction = this.db.transaction([this.storeName], "readwrite");
|
|
71
|
+
const objectStore = transaction.objectStore(this.storeName);
|
|
72
|
+
const request = objectStore.delete(key);
|
|
73
|
+
request.onsuccess = () => resolve();
|
|
74
|
+
request.onerror = () => reject(request.error);
|
|
75
|
+
});
|
|
76
|
+
}
|
|
77
|
+
async clear() {
|
|
78
|
+
return new Promise((resolve, reject) => {
|
|
79
|
+
const transaction = this.db.transaction([this.storeName], "readwrite");
|
|
80
|
+
const objectStore = transaction.objectStore(this.storeName);
|
|
81
|
+
const request = objectStore.clear();
|
|
82
|
+
request.onsuccess = () => resolve();
|
|
83
|
+
request.onerror = () => reject(request.error);
|
|
84
|
+
});
|
|
85
|
+
}
|
|
86
|
+
async close() {
|
|
87
|
+
if (this.db) {
|
|
88
|
+
this.db.close();
|
|
89
|
+
this.db = null;
|
|
90
|
+
}
|
|
91
|
+
}
|
|
92
|
+
}
|
|
93
|
+
export {
|
|
94
|
+
IndexedDBStorage
|
|
95
|
+
};
|
|
96
|
+
//# sourceMappingURL=indexeddb-storage-CMW4qRQS.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"indexeddb-storage-CMW4qRQS.js","sources":["../src/storage/indexeddb-storage.js"],"sourcesContent":["/**\n * IndexedDB storage adapter for browsers\n * Provides persistent storage with good performance\n */\n\nimport { PersistentStorage } from './persistent-storage.js';\n\nexport class IndexedDBStorage extends PersistentStorage {\n constructor() {\n super();\n this.db = null;\n this.dbName = null;\n this.storeName = 'events';\n }\n\n async init(namespace) {\n this.dbName = `holosphere_${namespace}`;\n\n return new Promise((resolve, reject) => {\n const request = indexedDB.open(this.dbName, 1);\n\n request.onerror = () => reject(request.error);\n request.onsuccess = () => {\n this.db = request.result;\n resolve();\n };\n\n request.onupgradeneeded = (event) => {\n const db = event.target.result;\n\n // Create object store if it doesn't exist\n if (!db.objectStoreNames.contains(this.storeName)) {\n const objectStore = db.createObjectStore(this.storeName, { keyPath: 'key' });\n // Create index for prefix queries\n objectStore.createIndex('key', 'key', { unique: false });\n }\n };\n });\n }\n\n async put(key, event) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readwrite');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.put({ key, event, timestamp: Date.now() });\n\n request.onsuccess = () => resolve();\n request.onerror = () => reject(request.error);\n });\n }\n\n async get(key) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readonly');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.get(key);\n\n request.onsuccess = () => {\n const result = request.result;\n resolve(result ? result.event : null);\n };\n request.onerror = () => reject(request.error);\n });\n }\n\n async getAll(prefix) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readonly');\n const objectStore = transaction.objectStore(this.storeName);\n\n const results = [];\n const request = objectStore.openCursor();\n\n request.onsuccess = (event) => {\n const cursor = event.target.result;\n if (cursor) {\n if (cursor.value.key.startsWith(prefix)) {\n results.push(cursor.value.event);\n }\n cursor.continue();\n } else {\n resolve(results);\n }\n };\n\n request.onerror = () => reject(request.error);\n });\n }\n\n async delete(key) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readwrite');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.delete(key);\n\n request.onsuccess = () => resolve();\n request.onerror = () => reject(request.error);\n });\n }\n\n async clear() {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readwrite');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.clear();\n\n request.onsuccess = () => resolve();\n request.onerror = () => reject(request.error);\n });\n }\n\n async close() {\n if (this.db) {\n this.db.close();\n this.db = null;\n }\n }\n}\n"],"names":[],"mappings":";AAOO,MAAM,yBAAyB,kBAAkB;AAAA,EACtD,cAAc;AACZ,UAAK;AACL,SAAK,KAAK;AACV,SAAK,SAAS;AACd,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,MAAM,KAAK,WAAW;AACpB,SAAK,SAAS,cAAc,SAAS;AAErC,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,UAAU,UAAU,KAAK,KAAK,QAAQ,CAAC;AAE7C,cAAQ,UAAU,MAAM,OAAO,QAAQ,KAAK;AAC5C,cAAQ,YAAY,MAAM;AACxB,aAAK,KAAK,QAAQ;AAClB,gBAAO;AAAA,MACT;AAEA,cAAQ,kBAAkB,CAAC,UAAU;AACnC,cAAM,KAAK,MAAM,OAAO;AAGxB,YAAI,CAAC,GAAG,iBAAiB,SAAS,KAAK,SAAS,GAAG;AACjD,gBAAM,cAAc,GAAG,kBAAkB,KAAK,WAAW,EAAE,SAAS,OAAO;AAE3E,sBAAY,YAAY,OAAO,OAAO,EAAE,QAAQ,OAAO;AAAA,QACzD;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,IAAI,KAAK,OAAO;AACpB,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,cAAc,KAAK,GAAG,YAAY,CAAC,KAAK,SAAS,GAAG,WAAW;AACrE,YAAM,cAAc,YAAY,YAAY,KAAK,SAAS;AAE1D,YAAM,UAAU,YAAY,IAAI,EAAE,KAAK,OAAO,WAAW,KAAK,IAAG,GAAI;AAErE,cAAQ,YAAY,MAAM,QAAO;AACjC,cAAQ,UAAU,MAAM,OAAO,QAAQ,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,IAAI,KAAK;AACb,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,cAAc,KAAK,GAAG,YAAY,CAAC,KAAK,SAAS,GAAG,UAAU;AACpE,YAAM,cAAc,YAAY,YAAY,KAAK,SAAS;AAE1D,YAAM,UAAU,YAAY,IAAI,GAAG;AAEnC,cAAQ,YAAY,MAAM;AACxB,cAAM,SAAS,QAAQ;AACvB,gBAAQ,SAAS,OAAO,QAAQ,IAAI;AAAA,MACtC;AACA,cAAQ,UAAU,MAAM,OAAO,QAAQ,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,OAAO,QAAQ;AACnB,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,cAAc,KAAK,GAAG,YAAY,CAAC,KAAK,SAAS,GAAG,UAAU;AACpE,YAAM,cAAc,YAAY,YAAY,KAAK,SAAS;AAE1D,YAAM,UAAU,CAAA;AAChB,YAAM,UAAU,YAAY,WAAU;AAEtC,cAAQ,YAAY,CAAC,UAAU;AAC7B,cAAM,SAAS,MAAM,OAAO;AAC5B,YAAI,QAAQ;AACV,cAAI,OAAO,MAAM,IAAI,WAAW,MAAM,GAAG;AACvC,oBAAQ,KAAK,OAAO,MAAM,KAAK;AAAA,UACjC;AACA,iBAAO,SAAQ;AAAA,QACjB,OAAO;AACL,kBAAQ,OAAO;AAAA,QACjB;AAAA,MACF;AAEA,cAAQ,UAAU,MAAM,OAAO,QAAQ,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,OAAO,KAAK;AAChB,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,cAAc,KAAK,GAAG,YAAY,CAAC,KAAK,SAAS,GAAG,WAAW;AACrE,YAAM,cAAc,YAAY,YAAY,KAAK,SAAS;AAE1D,YAAM,UAAU,YAAY,OAAO,GAAG;AAEtC,cAAQ,YAAY,MAAM,QAAO;AACjC,cAAQ,UAAU,MAAM,OAAO,QAAQ,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QAAQ;AACZ,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,YAAM,cAAc,KAAK,GAAG,YAAY,CAAC,KAAK,SAAS,GAAG,WAAW;AACrE,YAAM,cAAc,YAAY,YAAY,KAAK,SAAS;AAE1D,YAAM,UAAU,YAAY,MAAK;AAEjC,cAAQ,YAAY,MAAM,QAAO;AACjC,cAAQ,UAAU,MAAM,OAAO,QAAQ,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QAAQ;AACZ,QAAI,KAAK,IAAI;AACX,WAAK,GAAG,MAAK;AACb,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AACF;"}
|
|
@@ -0,0 +1,2 @@
|
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index-ifOgtDvd.cjs");class t extends e.PersistentStorage{constructor(){super(),this.db=null,this.dbName=null,this.storeName="events"}async init(e){return this.dbName=`holosphere_${e}`,new Promise((e,t)=>{const r=indexedDB.open(this.dbName,1);r.onerror=()=>t(r.error),r.onsuccess=()=>{this.db=r.result,e()},r.onupgradeneeded=e=>{const t=e.target.result;if(!t.objectStoreNames.contains(this.storeName)){t.createObjectStore(this.storeName,{keyPath:"key"}).createIndex("key","key",{unique:!1})}}})}async put(e,t){return new Promise((r,s)=>{const o=this.db.transaction([this.storeName],"readwrite").objectStore(this.storeName).put({key:e,event:t,timestamp:Date.now()});o.onsuccess=()=>r(),o.onerror=()=>s(o.error)})}async get(e){return new Promise((t,r)=>{const s=this.db.transaction([this.storeName],"readonly").objectStore(this.storeName).get(e);s.onsuccess=()=>{const e=s.result;t(e?e.event:null)},s.onerror=()=>r(s.error)})}async getAll(e){return new Promise((t,r)=>{const s=this.db.transaction([this.storeName],"readonly").objectStore(this.storeName),o=[],n=s.openCursor();n.onsuccess=r=>{const s=r.target.result;s?(s.value.key.startsWith(e)&&o.push(s.value.event),s.continue()):t(o)},n.onerror=()=>r(n.error)})}async delete(e){return new Promise((t,r)=>{const s=this.db.transaction([this.storeName],"readwrite").objectStore(this.storeName).delete(e);s.onsuccess=()=>t(),s.onerror=()=>r(s.error)})}async clear(){return new Promise((e,t)=>{const r=this.db.transaction([this.storeName],"readwrite").objectStore(this.storeName).clear();r.onsuccess=()=>e(),r.onerror=()=>t(r.error)})}async close(){this.db&&(this.db.close(),this.db=null)}}exports.IndexedDBStorage=t;
|
|
2
|
+
//# sourceMappingURL=indexeddb-storage-DLZOgetM.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"indexeddb-storage-DLZOgetM.cjs","sources":["../src/storage/indexeddb-storage.js"],"sourcesContent":["/**\n * IndexedDB storage adapter for browsers\n * Provides persistent storage with good performance\n */\n\nimport { PersistentStorage } from './persistent-storage.js';\n\nexport class IndexedDBStorage extends PersistentStorage {\n constructor() {\n super();\n this.db = null;\n this.dbName = null;\n this.storeName = 'events';\n }\n\n async init(namespace) {\n this.dbName = `holosphere_${namespace}`;\n\n return new Promise((resolve, reject) => {\n const request = indexedDB.open(this.dbName, 1);\n\n request.onerror = () => reject(request.error);\n request.onsuccess = () => {\n this.db = request.result;\n resolve();\n };\n\n request.onupgradeneeded = (event) => {\n const db = event.target.result;\n\n // Create object store if it doesn't exist\n if (!db.objectStoreNames.contains(this.storeName)) {\n const objectStore = db.createObjectStore(this.storeName, { keyPath: 'key' });\n // Create index for prefix queries\n objectStore.createIndex('key', 'key', { unique: false });\n }\n };\n });\n }\n\n async put(key, event) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readwrite');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.put({ key, event, timestamp: Date.now() });\n\n request.onsuccess = () => resolve();\n request.onerror = () => reject(request.error);\n });\n }\n\n async get(key) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readonly');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.get(key);\n\n request.onsuccess = () => {\n const result = request.result;\n resolve(result ? result.event : null);\n };\n request.onerror = () => reject(request.error);\n });\n }\n\n async getAll(prefix) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readonly');\n const objectStore = transaction.objectStore(this.storeName);\n\n const results = [];\n const request = objectStore.openCursor();\n\n request.onsuccess = (event) => {\n const cursor = event.target.result;\n if (cursor) {\n if (cursor.value.key.startsWith(prefix)) {\n results.push(cursor.value.event);\n }\n cursor.continue();\n } else {\n resolve(results);\n }\n };\n\n request.onerror = () => reject(request.error);\n });\n }\n\n async delete(key) {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readwrite');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.delete(key);\n\n request.onsuccess = () => resolve();\n request.onerror = () => reject(request.error);\n });\n }\n\n async clear() {\n return new Promise((resolve, reject) => {\n const transaction = this.db.transaction([this.storeName], 'readwrite');\n const objectStore = transaction.objectStore(this.storeName);\n\n const request = objectStore.clear();\n\n request.onsuccess = () => resolve();\n request.onerror = () => reject(request.error);\n });\n }\n\n async close() {\n if (this.db) {\n this.db.close();\n this.db = null;\n }\n }\n}\n"],"names":["IndexedDBStorage","PersistentStorage","constructor","super","this","db","dbName","storeName","init","namespace","Promise","resolve","reject","request","indexedDB","open","onerror","error","onsuccess","result","onupgradeneeded","event","target","objectStoreNames","contains","createObjectStore","keyPath","createIndex","unique","put","key","transaction","objectStore","timestamp","Date","now","get","getAll","prefix","results","openCursor","cursor","value","startsWith","push","continue","delete","clear","close"],"mappings":"wHAOO,MAAMA,UAAyBC,EAAAA,kBACpC,WAAAC,GACEC,QACAC,KAAKC,GAAK,KACVD,KAAKE,OAAS,KACdF,KAAKG,UAAY,QACnB,CAEA,UAAMC,CAAKC,GAGT,OAFAL,KAAKE,OAAS,cAAcG,IAErB,IAAIC,QAAQ,CAACC,EAASC,KAC3B,MAAMC,EAAUC,UAAUC,KAAKX,KAAKE,OAAQ,GAE5CO,EAAQG,QAAU,IAAMJ,EAAOC,EAAQI,OACvCJ,EAAQK,UAAY,KAClBd,KAAKC,GAAKQ,EAAQM,OAClBR,KAGFE,EAAQO,gBAAmBC,IACzB,MAAMhB,EAAKgB,EAAMC,OAAOH,OAGxB,IAAKd,EAAGkB,iBAAiBC,SAASpB,KAAKG,WAAY,CAC7BF,EAAGoB,kBAAkBrB,KAAKG,UAAW,CAAEmB,QAAS,QAExDC,YAAY,MAAO,MAAO,CAAEC,QAAQ,GAClD,IAGN,CAEA,SAAMC,CAAIC,EAAKT,GACb,OAAO,IAAIX,QAAQ,CAACC,EAASC,KAC3B,MAGMC,EAHcT,KAAKC,GAAG0B,YAAY,CAAC3B,KAAKG,WAAY,aAC1ByB,YAAY5B,KAAKG,WAErBsB,IAAI,CAAEC,MAAKT,QAAOY,UAAWC,KAAKC,QAE9DtB,EAAQK,UAAY,IAAMP,IAC1BE,EAAQG,QAAU,IAAMJ,EAAOC,EAAQI,QAE3C,CAEA,SAAMmB,CAAIN,GACR,OAAO,IAAIpB,QAAQ,CAACC,EAASC,KAC3B,MAGMC,EAHcT,KAAKC,GAAG0B,YAAY,CAAC3B,KAAKG,WAAY,YAC1ByB,YAAY5B,KAAKG,WAErB6B,IAAIN,GAEhCjB,EAAQK,UAAY,KAClB,MAAMC,EAASN,EAAQM,OACvBR,EAAQQ,EAASA,EAAOE,MAAQ,OAElCR,EAAQG,QAAU,IAAMJ,EAAOC,EAAQI,QAE3C,CAEA,YAAMoB,CAAOC,GACX,OAAO,IAAI5B,QAAQ,CAACC,EAASC,KAC3B,MACMoB,EADc5B,KAAKC,GAAG0B,YAAY,CAAC3B,KAAKG,WAAY,YAC1ByB,YAAY5B,KAAKG,WAE3CgC,EAAU,GACV1B,EAAUmB,EAAYQ,aAE5B3B,EAAQK,UAAaG,IACnB,MAAMoB,EAASpB,EAAMC,OAAOH,OACxBsB,GACEA,EAAOC,MAAMZ,IAAIa,WAAWL,IAC9BC,EAAQK,KAAKH,EAAOC,MAAMrB,OAE5BoB,EAAOI,YAEPlC,EAAQ4B,IAIZ1B,EAAQG,QAAU,IAAMJ,EAAOC,EAAQI,QAE3C,CAEA,YAAM,CAAOa,GACX,OAAO,IAAIpB,QAAQ,CAACC,EAASC,KAC3B,MAGMC,EAHcT,KAAKC,GAAG0B,YAAY,CAAC3B,KAAKG,WAAY,aAC1ByB,YAAY5B,KAAKG,WAErBuC,OAAOhB,GAEnCjB,EAAQK,UAAY,IAAMP,IAC1BE,EAAQG,QAAU,IAAMJ,EAAOC,EAAQI,QAE3C,CAEA,WAAM8B,GACJ,OAAO,IAAIrC,QAAQ,CAACC,EAASC,KAC3B,MAGMC,EAHcT,KAAKC,GAAG0B,YAAY,CAAC3B,KAAKG,WAAY,aAC1ByB,YAAY5B,KAAKG,WAErBwC,QAE5BlC,EAAQK,UAAY,IAAMP,IAC1BE,EAAQG,QAAU,IAAMJ,EAAOC,EAAQI,QAE3C,CAEA,WAAM+B,GACA5C,KAAKC,KACPD,KAAKC,GAAG2C,QACR5C,KAAKC,GAAK,KAEd"}
|
|
@@ -0,0 +1,47 @@
|
|
|
1
|
+
import { P as PersistentStorage } from "./index-CDfIuXew.js";
|
|
2
|
+
class MemoryStorage extends PersistentStorage {
|
|
3
|
+
constructor() {
|
|
4
|
+
super();
|
|
5
|
+
this.data = /* @__PURE__ */ new Map();
|
|
6
|
+
this.namespace = null;
|
|
7
|
+
}
|
|
8
|
+
async init(namespace) {
|
|
9
|
+
this.namespace = namespace;
|
|
10
|
+
if (!MemoryStorage._globalStore) {
|
|
11
|
+
MemoryStorage._globalStore = /* @__PURE__ */ new Map();
|
|
12
|
+
}
|
|
13
|
+
if (!MemoryStorage._globalStore.has(namespace)) {
|
|
14
|
+
MemoryStorage._globalStore.set(namespace, /* @__PURE__ */ new Map());
|
|
15
|
+
}
|
|
16
|
+
this.data = MemoryStorage._globalStore.get(namespace);
|
|
17
|
+
}
|
|
18
|
+
async put(key, event) {
|
|
19
|
+
this.data.set(key, JSON.parse(JSON.stringify(event)));
|
|
20
|
+
}
|
|
21
|
+
async get(key) {
|
|
22
|
+
const data = this.data.get(key);
|
|
23
|
+
return data ? JSON.parse(JSON.stringify(data)) : null;
|
|
24
|
+
}
|
|
25
|
+
async getAll(prefix) {
|
|
26
|
+
const results = [];
|
|
27
|
+
for (const [key, value] of this.data.entries()) {
|
|
28
|
+
if (key.startsWith(prefix)) {
|
|
29
|
+
results.push(JSON.parse(JSON.stringify(value)));
|
|
30
|
+
}
|
|
31
|
+
}
|
|
32
|
+
return results;
|
|
33
|
+
}
|
|
34
|
+
async delete(key) {
|
|
35
|
+
this.data.delete(key);
|
|
36
|
+
}
|
|
37
|
+
async clear() {
|
|
38
|
+
this.data.clear();
|
|
39
|
+
}
|
|
40
|
+
async close() {
|
|
41
|
+
}
|
|
42
|
+
}
|
|
43
|
+
MemoryStorage._globalStore = null;
|
|
44
|
+
export {
|
|
45
|
+
MemoryStorage
|
|
46
|
+
};
|
|
47
|
+
//# sourceMappingURL=memory-storage-DQzcAZlf.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"memory-storage-DQzcAZlf.js","sources":["../src/storage/memory-storage.js"],"sourcesContent":["/**\n * Memory-only storage adapter (fallback, no actual persistence)\n */\n\nimport { PersistentStorage } from './persistent-storage.js';\n\nexport class MemoryStorage extends PersistentStorage {\n constructor() {\n super();\n this.data = new Map();\n this.namespace = null;\n }\n\n async init(namespace) {\n this.namespace = namespace;\n // Check if there's existing data for this namespace\n if (!MemoryStorage._globalStore) {\n MemoryStorage._globalStore = new Map();\n }\n if (!MemoryStorage._globalStore.has(namespace)) {\n MemoryStorage._globalStore.set(namespace, new Map());\n }\n this.data = MemoryStorage._globalStore.get(namespace);\n }\n\n async put(key, event) {\n this.data.set(key, JSON.parse(JSON.stringify(event))); // Deep clone\n }\n\n async get(key) {\n const data = this.data.get(key);\n return data ? JSON.parse(JSON.stringify(data)) : null; // Deep clone\n }\n\n async getAll(prefix) {\n const results = [];\n for (const [key, value] of this.data.entries()) {\n if (key.startsWith(prefix)) {\n results.push(JSON.parse(JSON.stringify(value)));\n }\n }\n return results;\n }\n\n async delete(key) {\n this.data.delete(key);\n }\n\n async clear() {\n this.data.clear();\n }\n\n async close() {\n // Nothing to close for memory storage\n }\n}\n\n// Global store shared across instances with same namespace\nMemoryStorage._globalStore = null;\n"],"names":[],"mappings":";AAMO,MAAM,sBAAsB,kBAAkB;AAAA,EACnD,cAAc;AACZ,UAAK;AACL,SAAK,OAAO,oBAAI,IAAG;AACnB,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,MAAM,KAAK,WAAW;AACpB,SAAK,YAAY;AAEjB,QAAI,CAAC,cAAc,cAAc;AAC/B,oBAAc,eAAe,oBAAI,IAAG;AAAA,IACtC;AACA,QAAI,CAAC,cAAc,aAAa,IAAI,SAAS,GAAG;AAC9C,oBAAc,aAAa,IAAI,WAAW,oBAAI,IAAG,CAAE;AAAA,IACrD;AACA,SAAK,OAAO,cAAc,aAAa,IAAI,SAAS;AAAA,EACtD;AAAA,EAEA,MAAM,IAAI,KAAK,OAAO;AACpB,SAAK,KAAK,IAAI,KAAK,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC,CAAC;AAAA,EACtD;AAAA,EAEA,MAAM,IAAI,KAAK;AACb,UAAM,OAAO,KAAK,KAAK,IAAI,GAAG;AAC9B,WAAO,OAAO,KAAK,MAAM,KAAK,UAAU,IAAI,CAAC,IAAI;AAAA,EACnD;AAAA,EAEA,MAAM,OAAO,QAAQ;AACnB,UAAM,UAAU,CAAA;AAChB,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,WAAW;AAC9C,UAAI,IAAI,WAAW,MAAM,GAAG;AAC1B,gBAAQ,KAAK,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC,CAAC;AAAA,MAChD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,OAAO,KAAK;AAChB,SAAK,KAAK,OAAO,GAAG;AAAA,EACtB;AAAA,EAEA,MAAM,QAAQ;AACZ,SAAK,KAAK,MAAK;AAAA,EACjB;AAAA,EAEA,MAAM,QAAQ;AAAA,EAEd;AACF;AAGA,cAAc,eAAe;"}
|
|
@@ -0,0 +1,2 @@
|
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./index-ifOgtDvd.cjs");class e extends t.PersistentStorage{constructor(){super(),this.data=new Map,this.namespace=null}async init(t){this.namespace=t,e._globalStore||(e._globalStore=new Map),e._globalStore.has(t)||e._globalStore.set(t,new Map),this.data=e._globalStore.get(t)}async put(t,e){this.data.set(t,JSON.parse(JSON.stringify(e)))}async get(t){const e=this.data.get(t);return e?JSON.parse(JSON.stringify(e)):null}async getAll(t){const e=[];for(const[s,a]of this.data.entries())s.startsWith(t)&&e.push(JSON.parse(JSON.stringify(a)));return e}async delete(t){this.data.delete(t)}async clear(){this.data.clear()}async close(){}}e._globalStore=null,exports.MemoryStorage=e;
|
|
2
|
+
//# sourceMappingURL=memory-storage-DmePEP2q.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"memory-storage-DmePEP2q.cjs","sources":["../src/storage/memory-storage.js"],"sourcesContent":["/**\n * Memory-only storage adapter (fallback, no actual persistence)\n */\n\nimport { PersistentStorage } from './persistent-storage.js';\n\nexport class MemoryStorage extends PersistentStorage {\n constructor() {\n super();\n this.data = new Map();\n this.namespace = null;\n }\n\n async init(namespace) {\n this.namespace = namespace;\n // Check if there's existing data for this namespace\n if (!MemoryStorage._globalStore) {\n MemoryStorage._globalStore = new Map();\n }\n if (!MemoryStorage._globalStore.has(namespace)) {\n MemoryStorage._globalStore.set(namespace, new Map());\n }\n this.data = MemoryStorage._globalStore.get(namespace);\n }\n\n async put(key, event) {\n this.data.set(key, JSON.parse(JSON.stringify(event))); // Deep clone\n }\n\n async get(key) {\n const data = this.data.get(key);\n return data ? JSON.parse(JSON.stringify(data)) : null; // Deep clone\n }\n\n async getAll(prefix) {\n const results = [];\n for (const [key, value] of this.data.entries()) {\n if (key.startsWith(prefix)) {\n results.push(JSON.parse(JSON.stringify(value)));\n }\n }\n return results;\n }\n\n async delete(key) {\n this.data.delete(key);\n }\n\n async clear() {\n this.data.clear();\n }\n\n async close() {\n // Nothing to close for memory storage\n }\n}\n\n// Global store shared across instances with same namespace\nMemoryStorage._globalStore = null;\n"],"names":["MemoryStorage","PersistentStorage","constructor","super","this","data","Map","namespace","init","_globalStore","has","set","get","put","key","event","JSON","parse","stringify","getAll","prefix","results","value","entries","startsWith","push","delete","clear","close"],"mappings":"wHAMO,MAAMA,UAAsBC,EAAAA,kBACjC,WAAAC,GACEC,QACAC,KAAKC,SAAWC,IAChBF,KAAKG,UAAY,IACnB,CAEA,UAAMC,CAAKD,GACTH,KAAKG,UAAYA,EAEZP,EAAcS,eACjBT,EAAcS,iBAAmBH,KAE9BN,EAAcS,aAAaC,IAAIH,IAClCP,EAAcS,aAAaE,IAAIJ,EAAW,IAAID,KAEhDF,KAAKC,KAAOL,EAAcS,aAAaG,IAAIL,EAC7C,CAEA,SAAMM,CAAIC,EAAKC,GACbX,KAAKC,KAAKM,IAAIG,EAAKE,KAAKC,MAAMD,KAAKE,UAAUH,IAC/C,CAEA,SAAMH,CAAIE,GACR,MAAMT,EAAOD,KAAKC,KAAKO,IAAIE,GAC3B,OAAOT,EAAOW,KAAKC,MAAMD,KAAKE,UAAUb,IAAS,IACnD,CAEA,YAAMc,CAAOC,GACX,MAAMC,EAAU,GAChB,IAAA,MAAYP,EAAKQ,KAAUlB,KAAKC,KAAKkB,UAC/BT,EAAIU,WAAWJ,IACjBC,EAAQI,KAAKT,KAAKC,MAAMD,KAAKE,UAAUI,KAG3C,OAAOD,CACT,CAEA,YAAM,CAAOP,GACXV,KAAKC,KAAKqB,OAAOZ,EACnB,CAEA,WAAMa,GACJvB,KAAKC,KAAKsB,OACZ,CAEA,WAAMC,GAEN,EAIF5B,EAAcS,aAAe"}
|
|
@@ -0,0 +1,13 @@
|
|
|
1
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t="object"==typeof globalThis&&"crypto"in globalThis?globalThis.crypto:void 0;
|
|
2
|
+
/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */function e(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&"Uint8Array"===t.constructor.name}function n(t){if(!Number.isSafeInteger(t)||t<0)throw new Error("positive integer expected, got "+t)}function r(t,...n){if(!e(t))throw new Error("Uint8Array expected");if(n.length>0&&!n.includes(t.length))throw new Error("Uint8Array expected of length "+n+", got length="+t.length)}function o(t){if("function"!=typeof t||"function"!=typeof t.create)throw new Error("Hash should be wrapped by utils.createHasher");n(t.outputLen),n(t.blockLen)}function i(t,e=!0){if(t.destroyed)throw new Error("Hash instance has been destroyed");if(e&&t.finished)throw new Error("Hash#digest() has already been called")}function s(...t){for(let e=0;e<t.length;e++)t[e].fill(0)}function c(t){return new DataView(t.buffer,t.byteOffset,t.byteLength)}function f(t,e){return t<<32-e|t>>>e}const u=(()=>"function"==typeof Uint8Array.from([]).toHex&&"function"==typeof Uint8Array.fromHex)(),a=Array.from({length:256},(t,e)=>e.toString(16).padStart(2,"0"));function l(t){if(r(t),u)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=a[t[n]];return e}const d=48,h=57,g=65,w=70,p=97,y=102;function m(t){return t>=d&&t<=h?t-d:t>=g&&t<=w?t-(g-10):t>=p&&t<=y?t-(p-10):void 0}function b(t){if("string"!=typeof t)throw new Error("hex string expected, got "+typeof t);if(u)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let o=0,i=0;o<n;o++,i+=2){const e=m(t.charCodeAt(i)),n=m(t.charCodeAt(i+1));if(void 0===e||void 0===n){const e=t[i]+t[i+1];throw new Error('hex string expected, got non-hex character "'+e+'" at index '+i)}r[o]=16*e+n}return r}function E(t){return"string"==typeof t&&(t=function(t){if("string"!=typeof t)throw new Error("string expected");return new Uint8Array((new TextEncoder).encode(t))}(t)),r(t),t}function B(...t){let e=0;for(let o=0;o<t.length;o++){const n=t[o];r(n),e+=n.length}const n=new Uint8Array(e);for(let r=0,o=0;r<t.length;r++){const e=t[r];n.set(e,o),o+=e.length}return n}class v{}function x(t){const e=e=>t().update(E(e)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}function O(e=32){if(t&&"function"==typeof t.getRandomValues)return t.getRandomValues(new Uint8Array(e));if(t&&"function"==typeof t.randomBytes)return Uint8Array.from(t.randomBytes(e));throw new Error("crypto.getRandomValues must be defined")}function R(t,e,n){return t&e^~t&n}function S(t,e,n){return t&e^t&n^e&n}class A extends v{constructor(t,e,n,r){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=e,this.padOffset=n,this.isLE=r,this.buffer=new Uint8Array(t),this.view=c(this.buffer)}update(t){i(this),r(t=E(t));const{view:e,buffer:n,blockLen:o}=this,s=t.length;for(let r=0;r<s;){const i=Math.min(o-this.pos,s-r);if(i===o){const e=c(t);for(;o<=s-r;r+=o)this.process(e,r);continue}n.set(t.subarray(r,r+i),this.pos),this.pos+=i,r+=i,this.pos===o&&(this.process(e,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){i(this),function(t,e){r(t);const n=e.outputLen;if(t.length<n)throw new Error("digestInto() expects output buffer of length at least "+n)}(t,this),this.finished=!0;const{buffer:e,view:n,blockLen:o,isLE:f}=this;let{pos:u}=this;e[u++]=128,s(this.buffer.subarray(u)),this.padOffset>o-u&&(this.process(n,0),u=0);for(let r=u;r<o;r++)e[r]=0;!function(t,e,n,r){if("function"==typeof t.setBigUint64)return t.setBigUint64(e,n,r);const o=BigInt(32),i=BigInt(4294967295),s=Number(n>>o&i),c=Number(n&i),f=r?4:0,u=r?0:4;t.setUint32(e+f,s,r),t.setUint32(e+u,c,r)}(n,o-8,BigInt(8*this.length),f),this.process(n,0);const a=c(t),l=this.outputLen;if(l%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const d=l/4,h=this.get();if(d>h.length)throw new Error("_sha2: outputLen bigger than state");for(let r=0;r<d;r++)a.setUint32(4*r,h[r],f)}digest(){const{buffer:t,outputLen:e}=this;this.digestInto(t);const n=t.slice(0,e);return this.destroy(),n}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:e,buffer:n,length:r,finished:o,destroyed:i,pos:s}=this;return t.destroyed=i,t.finished=o,t.length=r,t.pos=s,r%e&&t.buffer.set(n),t}clone(){return this._cloneInto()}}const I=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),U=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),N=new Uint32Array(64);class F extends A{constructor(t=32){super(64,t,8,!1),this.A=0|I[0],this.B=0|I[1],this.C=0|I[2],this.D=0|I[3],this.E=0|I[4],this.F=0|I[5],this.G=0|I[6],this.H=0|I[7]}get(){const{A:t,B:e,C:n,D:r,E:o,F:i,G:s,H:c}=this;return[t,e,n,r,o,i,s,c]}set(t,e,n,r,o,i,s,c){this.A=0|t,this.B=0|e,this.C=0|n,this.D=0|r,this.E=0|o,this.F=0|i,this.G=0|s,this.H=0|c}process(t,e){for(let f=0;f<16;f++,e+=4)N[f]=t.getUint32(e,!1);for(let l=16;l<64;l++){const t=N[l-15],e=N[l-2],n=f(t,7)^f(t,18)^t>>>3,r=f(e,17)^f(e,19)^e>>>10;N[l]=r+N[l-7]+n+N[l-16]|0}let{A:n,B:r,C:o,D:i,E:s,F:c,G:u,H:a}=this;for(let l=0;l<64;l++){const t=a+(f(s,6)^f(s,11)^f(s,25))+R(s,c,u)+U[l]+N[l]|0,e=(f(n,2)^f(n,13)^f(n,22))+S(n,r,o)|0;a=u,u=c,c=s,s=i+t|0,i=o,o=r,r=n,n=t+e|0}n=n+this.A|0,r=r+this.B|0,o=o+this.C|0,i=i+this.D|0,s=s+this.E|0,c=c+this.F|0,u=u+this.G|0,a=a+this.H|0,this.set(n,r,o,i,s,c,u,a)}roundClean(){s(N)}destroy(){this.set(0,0,0,0,0,0,0,0),s(this.buffer)}}const q=x(()=>new F);class L extends v{constructor(t,e){super(),this.finished=!1,this.destroyed=!1,o(t);const n=E(e);if(this.iHash=t.create(),"function"!=typeof this.iHash.update)throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const r=this.blockLen,i=new Uint8Array(r);i.set(n.length>r?t.create().update(n).digest():n);for(let o=0;o<i.length;o++)i[o]^=54;this.iHash.update(i),this.oHash=t.create();for(let o=0;o<i.length;o++)i[o]^=106;this.oHash.update(i),s(i)}update(t){return i(this),this.iHash.update(t),this}digestInto(t){i(this),r(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:n,finished:r,destroyed:o,blockLen:i,outputLen:s}=this;return t.finished=r,t.destroyed=o,t.blockLen=i,t.outputLen=s,t.oHash=e._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const H=(t,e,n)=>new L(t,e).update(n).digest();H.create=(t,e)=>new L(t,e);
|
|
3
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
4
|
+
const V=BigInt(0),Z=BigInt(1);function k(t,e=""){if("boolean"!=typeof t){throw new Error((e&&`"${e}"`)+"expected boolean, got type="+typeof t)}return t}function C(t,n,r=""){const o=e(t),i=t?.length,s=void 0!==n;if(!o||s&&i!==n){throw new Error((r&&`"${r}" `)+"expected Uint8Array"+(s?` of length ${n}`:"")+", got "+(o?`length=${i}`:"type="+typeof t))}return t}function P(t){const e=t.toString(16);return 1&e.length?"0"+e:e}function K(t){if("string"!=typeof t)throw new Error("hex string expected, got "+typeof t);return""===t?V:BigInt("0x"+t)}function T(t){return K(l(t))}function j(t){return r(t),K(l(Uint8Array.from(t).reverse()))}function D(t,e){return b(t.toString(16).padStart(2*e,"0"))}function Y(t,e){return D(t,e).reverse()}function _(t,n,r){let o;if("string"==typeof n)try{o=b(n)}catch(i){throw new Error(t+" must be hex string or Uint8Array, cause: "+i)}else{if(!e(n))throw new Error(t+" must be hex string or Uint8Array");o=Uint8Array.from(n)}return o.length,o}const z=t=>"bigint"==typeof t&&V<=t;function $(t,e,n,r){if(!function(t,e,n){return z(t)&&z(e)&&z(n)&&e<=t&&t<n}(e,n,r))throw new Error("expected valid "+t+": "+n+" <= n < "+r+", got "+e)}function G(t){let e;for(e=0;t>V;t>>=Z,e+=1);return e}const M=t=>(Z<<BigInt(t))-Z;function X(t,e,n={}){if(!t||"object"!=typeof t)throw new Error("expected valid options object");function r(e,n,r){const o=t[e];if(r&&void 0===o)return;const i=typeof o;if(i!==n||null===o)throw new Error(`param "${e}" is invalid: expected ${n}, got ${i}`)}Object.entries(e).forEach(([t,e])=>r(t,e,!1)),Object.entries(n).forEach(([t,e])=>r(t,e,!0))}function W(t){const e=new WeakMap;return(n,...r)=>{const o=e.get(n);if(void 0!==o)return o;const i=t(n,...r);return e.set(n,i),i}}
|
|
5
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const J=BigInt(0),Q=BigInt(1),tt=BigInt(2),et=BigInt(3),nt=BigInt(4),rt=BigInt(5),ot=BigInt(7),it=BigInt(8),st=BigInt(9),ct=BigInt(16);function ft(t,e){const n=t%e;return n>=J?n:e+n}function ut(t,e,n){let r=t;for(;e-- >J;)r*=r,r%=n;return r}function at(t,e){if(t===J)throw new Error("invert: expected non-zero number");if(e<=J)throw new Error("invert: expected positive modulus, got "+e);let n=ft(t,e),r=e,o=J,i=Q;for(;n!==J;){const t=r%n,e=o-i*(r/n);r=n,n=t,o=i,i=e}if(r!==Q)throw new Error("invert: does not exist");return ft(o,e)}function lt(t,e,n){if(!t.eql(t.sqr(e),n))throw new Error("Cannot find square root")}function dt(t,e){const n=(t.ORDER+Q)/nt,r=t.pow(e,n);return lt(t,r,e),r}function ht(t,e){const n=(t.ORDER-rt)/it,r=t.mul(e,tt),o=t.pow(r,n),i=t.mul(e,o),s=t.mul(t.mul(i,tt),o),c=t.mul(i,t.sub(s,t.ONE));return lt(t,c,e),c}function gt(t){if(t<et)throw new Error("sqrt is not defined for small field");let e=t-Q,n=0;for(;e%tt===J;)e/=tt,n++;let r=tt;const o=Et(t);for(;1===mt(o,r);)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(1===n)return dt;let i=o.pow(r,e);const s=(e+Q)/tt;return function(t,r){if(t.is0(r))return r;if(1!==mt(t,r))throw new Error("Cannot find square root");let o=n,c=t.mul(t.ONE,i),f=t.pow(r,e),u=t.pow(r,s);for(;!t.eql(f,t.ONE);){if(t.is0(f))return t.ZERO;let e=1,n=t.sqr(f);for(;!t.eql(n,t.ONE);)if(e++,n=t.sqr(n),e===o)throw new Error("Cannot find square root");const r=Q<<BigInt(o-e-1),i=t.pow(c,r);o=e,c=t.sqr(i),f=t.mul(f,c),u=t.mul(u,i)}return u}}function wt(t){return t%nt===et?dt:t%it===rt?ht:t%ct===st?function(t){const e=Et(t),n=gt(t),r=n(e,e.neg(e.ONE)),o=n(e,r),i=n(e,e.neg(r)),s=(t+ot)/ct;return(t,e)=>{let n=t.pow(e,s),c=t.mul(n,r);const f=t.mul(n,o),u=t.mul(n,i),a=t.eql(t.sqr(c),e),l=t.eql(t.sqr(f),e);n=t.cmov(n,c,a),c=t.cmov(u,f,l);const d=t.eql(t.sqr(c),e),h=t.cmov(n,c,d);return lt(t,h,e),h}}(t):gt(t)}const pt=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function yt(t,e,n=!1){const r=new Array(e.length).fill(n?t.ZERO:void 0),o=e.reduce((e,n,o)=>t.is0(n)?e:(r[o]=e,t.mul(e,n)),t.ONE),i=t.inv(o);return e.reduceRight((e,n,o)=>t.is0(n)?e:(r[o]=t.mul(e,r[o]),t.mul(e,n)),i),r}function mt(t,e){const n=(t.ORDER-Q)/tt,r=t.pow(e,n),o=t.eql(r,t.ONE),i=t.eql(r,t.ZERO),s=t.eql(r,t.neg(t.ONE));if(!o&&!i&&!s)throw new Error("invalid Legendre symbol result");return o?1:i?0:-1}function bt(t,e){void 0!==e&&n(e);const r=void 0!==e?e:t.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function Et(t,e,n=!1,r={}){if(t<=J)throw new Error("invalid field: expected ORDER > 0, got "+t);let o,i,s,c=!1;if("object"==typeof e&&null!=e){if(r.sqrt||n)throw new Error("cannot specify opts in two arguments");const t=e;t.BITS&&(o=t.BITS),t.sqrt&&(i=t.sqrt),"boolean"==typeof t.isLE&&(n=t.isLE),"boolean"==typeof t.modFromBytes&&(c=t.modFromBytes),s=t.allowedLengths}else"number"==typeof e&&(o=e),r.sqrt&&(i=r.sqrt);const{nBitLength:f,nByteLength:u}=bt(t,o);if(u>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let a;const l=Object.freeze({ORDER:t,isLE:n,BITS:f,BYTES:u,MASK:M(f),ZERO:J,ONE:Q,allowedLengths:s,create:e=>ft(e,t),isValid:e=>{if("bigint"!=typeof e)throw new Error("invalid field element: expected bigint, got "+typeof e);return J<=e&&e<t},is0:t=>t===J,isValidNot0:t=>!l.is0(t)&&l.isValid(t),isOdd:t=>(t&Q)===Q,neg:e=>ft(-e,t),eql:(t,e)=>t===e,sqr:e=>ft(e*e,t),add:(e,n)=>ft(e+n,t),sub:(e,n)=>ft(e-n,t),mul:(e,n)=>ft(e*n,t),pow:(t,e)=>function(t,e,n){if(n<J)throw new Error("invalid exponent, negatives unsupported");if(n===J)return t.ONE;if(n===Q)return e;let r=t.ONE,o=e;for(;n>J;)n&Q&&(r=t.mul(r,o)),o=t.sqr(o),n>>=Q;return r}(l,t,e),div:(e,n)=>ft(e*at(n,t),t),sqrN:t=>t*t,addN:(t,e)=>t+e,subN:(t,e)=>t-e,mulN:(t,e)=>t*e,inv:e=>at(e,t),sqrt:i||(e=>(a||(a=wt(t)),a(l,e))),toBytes:t=>n?Y(t,u):D(t,u),fromBytes:(e,r=!0)=>{if(s){if(!s.includes(e.length)||e.length>u)throw new Error("Field.fromBytes: expected "+s+" bytes, got "+e.length);const t=new Uint8Array(u);t.set(e,n?0:t.length-e.length),e=t}if(e.length!==u)throw new Error("Field.fromBytes: expected "+u+" bytes, got "+e.length);let o=n?j(e):T(e);if(c&&(o=ft(o,t)),!r&&!l.isValid(o))throw new Error("invalid field element: outside of range 0..ORDER");return o},invertBatch:t=>yt(l,t),cmov:(t,e,n)=>n?e:t});return Object.freeze(l)}function Bt(t){if("bigint"!=typeof t)throw new Error("field order must be bigint");const e=t.toString(2).length;return Math.ceil(e/8)}function vt(t){const e=Bt(t);return e+Math.ceil(e/2)}
|
|
6
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
7
|
+
const xt=BigInt(0),Ot=BigInt(1);function Rt(t,e){const n=e.negate();return t?n:e}function St(t,e){const n=yt(t.Fp,e.map(t=>t.Z));return e.map((e,r)=>t.fromAffine(e.toAffine(n[r])))}function At(t,e){if(!Number.isSafeInteger(t)||t<=0||t>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+t)}function It(t,e){At(t,e);const n=2**t;return{windows:Math.ceil(e/t)+1,windowSize:2**(t-1),mask:M(t),maxNumber:n,shiftBy:BigInt(t)}}function Ut(t,e,n){const{windowSize:r,mask:o,maxNumber:i,shiftBy:s}=n;let c=Number(t&o),f=t>>s;c>r&&(c-=i,f+=Ot);const u=e*r;return{nextN:f,offset:u+Math.abs(c)-1,isZero:0===c,isNeg:c<0,isNegF:e%2!=0,offsetF:u}}const Nt=new WeakMap,Ft=new WeakMap;function qt(t){return Ft.get(t)||1}function Lt(t){if(t!==xt)throw new Error("invalid wNAF")}class Ht{constructor(t,e){this.BASE=t.BASE,this.ZERO=t.ZERO,this.Fn=t.Fn,this.bits=e}_unsafeLadder(t,e,n=this.ZERO){let r=t;for(;e>xt;)e&Ot&&(n=n.add(r)),r=r.double(),e>>=Ot;return n}precomputeWindow(t,e){const{windows:n,windowSize:r}=It(e,this.bits),o=[];let i=t,s=i;for(let c=0;c<n;c++){s=i,o.push(s);for(let t=1;t<r;t++)s=s.add(i),o.push(s);i=s.double()}return o}wNAF(t,e,n){if(!this.Fn.isValid(n))throw new Error("invalid scalar");let r=this.ZERO,o=this.BASE;const i=It(t,this.bits);for(let s=0;s<i.windows;s++){const{nextN:t,offset:c,isZero:f,isNeg:u,isNegF:a,offsetF:l}=Ut(n,s,i);n=t,f?o=o.add(Rt(a,e[l])):r=r.add(Rt(u,e[c]))}return Lt(n),{p:r,f:o}}wNAFUnsafe(t,e,n,r=this.ZERO){const o=It(t,this.bits);for(let i=0;i<o.windows&&n!==xt;i++){const{nextN:t,offset:s,isZero:c,isNeg:f}=Ut(n,i,o);if(n=t,!c){const t=e[s];r=r.add(f?t.negate():t)}}return Lt(n),r}getPrecomputes(t,e,n){let r=Nt.get(e);return r||(r=this.precomputeWindow(e,t),1!==t&&("function"==typeof n&&(r=n(r)),Nt.set(e,r))),r}cached(t,e,n){const r=qt(t);return this.wNAF(r,this.getPrecomputes(r,t,n),e)}unsafe(t,e,n,r){const o=qt(t);return 1===o?this._unsafeLadder(t,e,r):this.wNAFUnsafe(o,this.getPrecomputes(o,t,n),e,r)}createCache(t,e){At(e,this.bits),Ft.set(t,e),Nt.delete(t)}hasCache(t){return 1!==qt(t)}}function Vt(t,e,n,r){!function(t,e){if(!Array.isArray(t))throw new Error("array expected");t.forEach((t,n)=>{if(!(t instanceof e))throw new Error("invalid point at index "+n)})}(n,t),function(t,e){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach((t,n)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+n)})}(r,e);const o=n.length,i=r.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const s=t.ZERO,c=G(BigInt(o));let f=1;c>12?f=c-3:c>4?f=c-2:c>0&&(f=2);const u=M(f),a=new Array(Number(u)+1).fill(s);let l=s;for(let d=Math.floor((e.BITS-1)/f)*f;d>=0;d-=f){a.fill(s);for(let e=0;e<i;e++){const t=r[e],o=Number(t>>BigInt(d)&u);a[o]=a[o].add(n[e])}let t=s;for(let e=a.length-1,n=s;e>0;e--)n=n.add(a[e]),t=t.add(n);if(l=l.add(t),0!==d)for(let e=0;e<f;e++)l=l.double()}return l}function Zt(t,e,n){if(e){if(e.ORDER!==t)throw new Error("Field.ORDER must match order: Fp == p, Fn == n");return function(t){X(t,pt.reduce((t,e)=>(t[e]="function",t),{ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"}))}(e),e}return Et(t,{isLE:n})}
|
|
8
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
9
|
+
const kt=(t,e)=>(t+(t>=0?e:-e)/Yt)/e;function Ct(t){if(!["compact","recovered","der"].includes(t))throw new Error('Signature format must be "compact", "recovered", or "der"');return t}function Pt(t,e){const n={};for(let r of Object.keys(e))n[r]=void 0===t[r]?e[r]:t[r];return k(n.lowS,"lowS"),k(n.prehash,"prehash"),void 0!==n.format&&Ct(n.format),n}class Kt extends Error{constructor(t=""){super(t)}}const Tt={Err:Kt,_tlv:{encode:(t,e)=>{const{Err:n}=Tt;if(t<0||t>256)throw new n("tlv.encode: wrong tag");if(1&e.length)throw new n("tlv.encode: unpadded data");const r=e.length/2,o=P(r);if(o.length/2&128)throw new n("tlv.encode: long form length too big");const i=r>127?P(o.length/2|128):"";return P(t)+i+o+e},decode(t,e){const{Err:n}=Tt;let r=0;if(t<0||t>256)throw new n("tlv.encode: wrong tag");if(e.length<2||e[r++]!==t)throw new n("tlv.decode: wrong tlv");const o=e[r++];let i=0;if(!!(128&o)){const t=127&o;if(!t)throw new n("tlv.decode(long): indefinite length not supported");if(t>4)throw new n("tlv.decode(long): byte length is too big");const s=e.subarray(r,r+t);if(s.length!==t)throw new n("tlv.decode: length bytes not complete");if(0===s[0])throw new n("tlv.decode(long): zero leftmost byte");for(const e of s)i=i<<8|e;if(r+=t,i<128)throw new n("tlv.decode(long): not minimal encoding")}else i=o;const s=e.subarray(r,r+i);if(s.length!==i)throw new n("tlv.decode: wrong value length");return{v:s,l:e.subarray(r+i)}}},_int:{encode(t){const{Err:e}=Tt;if(t<jt)throw new e("integer: negative integers are not allowed");let n=P(t);if(8&Number.parseInt(n[0],16)&&(n="00"+n),1&n.length)throw new e("unexpected DER parsing assertion: unpadded hex");return n},decode(t){const{Err:e}=Tt;if(128&t[0])throw new e("invalid signature integer: negative");if(0===t[0]&&!(128&t[1]))throw new e("invalid signature integer: unnecessary leading zero");return T(t)}},toSig(t){const{Err:e,_int:n,_tlv:r}=Tt,o=_("signature",t),{v:i,l:s}=r.decode(48,o);if(s.length)throw new e("invalid signature: left bytes after parsing");const{v:c,l:f}=r.decode(2,i),{v:u,l:a}=r.decode(2,f);if(a.length)throw new e("invalid signature: left bytes after parsing");return{r:n.decode(c),s:n.decode(u)}},hexFromSig(t){const{_tlv:e,_int:n}=Tt,r=e.encode(2,n.encode(t.r))+e.encode(2,n.encode(t.s));return e.encode(48,r)}},jt=BigInt(0),Dt=BigInt(1),Yt=BigInt(2),_t=BigInt(3),zt=BigInt(4);function $t(t,e){const{BYTES:n}=t;let r;if("bigint"==typeof e)r=e;else{let i=_("private key",e);try{r=t.fromBytes(i)}catch(o){throw new Error(`invalid private key: expected ui8a of size ${n}, got ${typeof e}`)}}if(!t.isValidNot0(r))throw new Error("invalid private key: out of range [1..N-1]");return r}function Gt(t,e={}){const n=function(t,e,n={},r){if(void 0===r&&(r="edwards"===t),!e||"object"!=typeof e)throw new Error(`expected valid ${t} CURVE object`);for(const c of["p","n","h"]){const t=e[c];if(!("bigint"==typeof t&&t>xt))throw new Error(`CURVE.${c} must be positive bigint`)}const o=Zt(e.p,n.Fp,r),i=Zt(e.n,n.Fn,r),s=["Gx","Gy","a","b"];for(const c of s)if(!o.isValid(e[c]))throw new Error(`CURVE.${c} must be valid field element of CURVE.Fp`);return{CURVE:e=Object.freeze(Object.assign({},e)),Fp:o,Fn:i}}("weierstrass",t,e),{Fp:r,Fn:o}=n;let i=n.CURVE;const{h:s,n:c}=i;X(e,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:f}=e;if(f&&(!r.is0(i.a)||"bigint"!=typeof f.beta||!Array.isArray(f.basises)))throw new Error('invalid endo: expected "beta": bigint and "basises": array');const u=Xt(r,o);function a(){if(!r.isOdd)throw new Error("compression is not supported: Field does not have .isOdd()")}const d=e.toBytes||function(t,e,n){const{x:o,y:i}=e.toAffine(),s=r.toBytes(o);if(k(n,"isCompressed"),n){a();return B(Mt(!r.isOdd(i)),s)}return B(Uint8Array.of(4),s,r.toBytes(i))},h=e.fromBytes||function(t){C(t,void 0,"Point");const{publicKey:e,publicKeyUncompressed:n}=u,o=t.length,i=t[0],s=t.subarray(1);if(o!==e||2!==i&&3!==i){if(o===n&&4===i){const t=r.BYTES,e=r.fromBytes(s.subarray(0,t)),n=r.fromBytes(s.subarray(t,2*t));if(!w(e,n))throw new Error("bad point: is not on curve");return{x:e,y:n}}throw new Error(`bad point: got length ${o}, expected compressed=${e} or uncompressed=${n}`)}{const t=r.fromBytes(s);if(!r.isValid(t))throw new Error("bad point: is not on curve, wrong x");const e=g(t);let n;try{n=r.sqrt(e)}catch(c){const t=c instanceof Error?": "+c.message:"";throw new Error("bad point: is not on curve, sqrt error"+t)}a();return!(1&~i)!==r.isOdd(n)&&(n=r.neg(n)),{x:t,y:n}}};function g(t){const e=r.sqr(t),n=r.mul(e,t);return r.add(r.add(n,r.mul(t,i.a)),i.b)}function w(t,e){const n=r.sqr(e),o=g(t);return r.eql(n,o)}if(!w(i.Gx,i.Gy))throw new Error("bad curve params: generator point");const p=r.mul(r.pow(i.a,_t),zt),y=r.mul(r.sqr(i.b),BigInt(27));if(r.is0(r.add(p,y)))throw new Error("bad curve params: a or b");function m(t,e,n=!1){if(!r.isValid(e)||n&&r.is0(e))throw new Error(`bad point coordinate ${t}`);return e}function b(t){if(!(t instanceof R))throw new Error("ProjectivePoint expected")}function E(t){if(!f||!f.basises)throw new Error("no endo");return function(t,e,n){const[[r,o],[i,s]]=e,c=kt(s*t,n),f=kt(-o*t,n);let u=t-c*r-f*i,a=-c*o-f*s;const l=u<jt,d=a<jt;l&&(u=-u),d&&(a=-a);const h=M(Math.ceil(G(n)/2))+Dt;if(u<jt||u>=h||a<jt||a>=h)throw new Error("splitScalar (endomorphism): failed, k="+t);return{k1neg:l,k1:u,k2neg:d,k2:a}}(t,f.basises,o.ORDER)}const v=W((t,e)=>{const{X:n,Y:o,Z:i}=t;if(r.eql(i,r.ONE))return{x:n,y:o};const s=t.is0();null==e&&(e=s?r.ONE:r.inv(i));const c=r.mul(n,e),f=r.mul(o,e),u=r.mul(i,e);if(s)return{x:r.ZERO,y:r.ZERO};if(!r.eql(u,r.ONE))throw new Error("invZ was invalid");return{x:c,y:f}}),x=W(t=>{if(t.is0()){if(e.allowInfinityPoint&&!r.is0(t.Y))return;throw new Error("bad point: ZERO")}const{x:n,y:o}=t.toAffine();if(!r.isValid(n)||!r.isValid(o))throw new Error("bad point: x or y not field elements");if(!w(n,o))throw new Error("bad point: equation left != right");if(!t.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0});function O(t,e,n,o,i){return n=new R(r.mul(n.X,t),n.Y,n.Z),e=Rt(o,e),n=Rt(i,n),e.add(n)}class R{constructor(t,e,n){this.X=m("x",t),this.Y=m("y",e,!0),this.Z=m("z",n),Object.freeze(this)}static CURVE(){return i}static fromAffine(t){const{x:e,y:n}=t||{};if(!t||!r.isValid(e)||!r.isValid(n))throw new Error("invalid affine point");if(t instanceof R)throw new Error("projective point not allowed");return r.is0(e)&&r.is0(n)?R.ZERO:new R(e,n,r.ONE)}static fromBytes(t){const e=R.fromAffine(h(C(t,void 0,"point")));return e.assertValidity(),e}static fromHex(t){return R.fromBytes(_("pointHex",t))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(t=8,e=!0){return A.createCache(this,t),e||this.multiply(_t),this}assertValidity(){x(this)}hasEvenY(){const{y:t}=this.toAffine();if(!r.isOdd)throw new Error("Field doesn't support isOdd");return!r.isOdd(t)}equals(t){b(t);const{X:e,Y:n,Z:o}=this,{X:i,Y:s,Z:c}=t,f=r.eql(r.mul(e,c),r.mul(i,o)),u=r.eql(r.mul(n,c),r.mul(s,o));return f&&u}negate(){return new R(this.X,r.neg(this.Y),this.Z)}double(){const{a:t,b:e}=i,n=r.mul(e,_t),{X:o,Y:s,Z:c}=this;let f=r.ZERO,u=r.ZERO,a=r.ZERO,l=r.mul(o,o),d=r.mul(s,s),h=r.mul(c,c),g=r.mul(o,s);return g=r.add(g,g),a=r.mul(o,c),a=r.add(a,a),f=r.mul(t,a),u=r.mul(n,h),u=r.add(f,u),f=r.sub(d,u),u=r.add(d,u),u=r.mul(f,u),f=r.mul(g,f),a=r.mul(n,a),h=r.mul(t,h),g=r.sub(l,h),g=r.mul(t,g),g=r.add(g,a),a=r.add(l,l),l=r.add(a,l),l=r.add(l,h),l=r.mul(l,g),u=r.add(u,l),h=r.mul(s,c),h=r.add(h,h),l=r.mul(h,g),f=r.sub(f,l),a=r.mul(h,d),a=r.add(a,a),a=r.add(a,a),new R(f,u,a)}add(t){b(t);const{X:e,Y:n,Z:o}=this,{X:s,Y:c,Z:f}=t;let u=r.ZERO,a=r.ZERO,l=r.ZERO;const d=i.a,h=r.mul(i.b,_t);let g=r.mul(e,s),w=r.mul(n,c),p=r.mul(o,f),y=r.add(e,n),m=r.add(s,c);y=r.mul(y,m),m=r.add(g,w),y=r.sub(y,m),m=r.add(e,o);let E=r.add(s,f);return m=r.mul(m,E),E=r.add(g,p),m=r.sub(m,E),E=r.add(n,o),u=r.add(c,f),E=r.mul(E,u),u=r.add(w,p),E=r.sub(E,u),l=r.mul(d,m),u=r.mul(h,p),l=r.add(u,l),u=r.sub(w,l),l=r.add(w,l),a=r.mul(u,l),w=r.add(g,g),w=r.add(w,g),p=r.mul(d,p),m=r.mul(h,m),w=r.add(w,p),p=r.sub(g,p),p=r.mul(d,p),m=r.add(m,p),g=r.mul(w,m),a=r.add(a,g),g=r.mul(E,m),u=r.mul(y,u),u=r.sub(u,g),g=r.mul(y,w),l=r.mul(E,l),l=r.add(l,g),new R(u,a,l)}subtract(t){return this.add(t.negate())}is0(){return this.equals(R.ZERO)}multiply(t){const{endo:n}=e;if(!o.isValidNot0(t))throw new Error("invalid scalar: out of range");let r,i;const s=t=>A.cached(this,t,t=>St(R,t));if(n){const{k1neg:e,k1:o,k2neg:c,k2:f}=E(t),{p:u,f:a}=s(o),{p:l,f:d}=s(f);i=a.add(d),r=O(n.beta,u,l,e,c)}else{const{p:e,f:n}=s(t);r=e,i=n}return St(R,[r,i])[0]}multiplyUnsafe(t){const{endo:n}=e,r=this;if(!o.isValid(t))throw new Error("invalid scalar: out of range");if(t===jt||r.is0())return R.ZERO;if(t===Dt)return r;if(A.hasCache(this))return this.multiply(t);if(n){const{k1neg:e,k1:o,k2neg:i,k2:s}=E(t),{p1:c,p2:f}=function(t,e,n,r){let o=e,i=t.ZERO,s=t.ZERO;for(;n>xt||r>xt;)n&Ot&&(i=i.add(o)),r&Ot&&(s=s.add(o)),o=o.double(),n>>=Ot,r>>=Ot;return{p1:i,p2:s}}(R,r,o,s);return O(n.beta,c,f,e,i)}return A.unsafe(r,t)}multiplyAndAddUnsafe(t,e,n){const r=this.multiplyUnsafe(e).add(t.multiplyUnsafe(n));return r.is0()?void 0:r}toAffine(t){return v(this,t)}isTorsionFree(){const{isTorsionFree:t}=e;return s===Dt||(t?t(R,this):A.unsafe(this,c).is0())}clearCofactor(){const{clearCofactor:t}=e;return s===Dt?this:t?t(R,this):this.multiplyUnsafe(s)}isSmallOrder(){return this.multiplyUnsafe(s).is0()}toBytes(t=!0){return k(t,"isCompressed"),this.assertValidity(),d(R,this,t)}toHex(t=!0){return l(this.toBytes(t))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(t=!0){return this.toBytes(t)}_setWindowSize(t){this.precompute(t)}static normalizeZ(t){return St(R,t)}static msm(t,e){return Vt(R,o,t,e)}static fromPrivateKey(t){return R.BASE.multiply($t(o,t))}}R.BASE=new R(i.Gx,i.Gy,r.ONE),R.ZERO=new R(r.ZERO,r.ONE,r.ZERO),R.Fp=r,R.Fn=o;const S=o.BITS,A=new Ht(R,e.endo?Math.ceil(S/2):S);return R.BASE.precompute(8),R}function Mt(t){return Uint8Array.of(t?2:3)}function Xt(t,e){return{secretKey:e.BYTES,publicKey:1+t.BYTES,publicKeyUncompressed:1+2*t.BYTES,publicKeyHasPrefix:!0,signature:2*e.BYTES}}function Wt(t,e={}){const{Fn:n}=t,r=e.randomBytes||O,o=Object.assign(Xt(t.Fp,n),{seed:vt(n.ORDER)});function i(t){try{return!!$t(n,t)}catch(e){return!1}}function s(t=r(o.seed)){return function(t,e,n=!1){const r=t.length,o=Bt(e),i=vt(e);if(r<16||r<i||r>1024)throw new Error("expected "+i+"-1024 bytes of input, got "+r);const s=ft(n?j(t):T(t),e-Q)+Q;return n?Y(s,o):D(s,o)}(C(t,o.seed,"seed"),n.ORDER)}function c(e,r=!0){return t.BASE.multiply($t(n,e)).toBytes(r)}function f(e){if("bigint"==typeof e)return!1;if(e instanceof t)return!0;const{secretKey:r,publicKey:i,publicKeyUncompressed:s}=o;if(n.allowedLengths||r===i)return;const c=_("key",e).length;return c===i||c===s}const u={isValidSecretKey:i,isValidPublicKey:function(e,n){const{publicKey:r,publicKeyUncompressed:i}=o;try{const o=e.length;return(!0!==n||o===r)&&((!1!==n||o===i)&&!!t.fromBytes(e))}catch(s){return!1}},randomSecretKey:s,isValidPrivateKey:i,randomPrivateKey:s,normPrivateKeyToScalar:t=>$t(n,t),precompute:(e=8,n=t.BASE)=>n.precompute(e,!1)};return Object.freeze({getPublicKey:c,getSharedSecret:function(e,r,o=!0){if(!0===f(e))throw new Error("first arg must be private key");if(!1===f(r))throw new Error("second arg must be public key");const i=$t(n,e);return t.fromHex(r).multiply(i).toBytes(o)},keygen:function(t){const e=s(t);return{secretKey:e,publicKey:c(e)}},Point:t,utils:u,lengths:o})}function Jt(t,n,r={}){o(n),X(r,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const i=r.randomBytes||O,s=r.hmac||((t,...e)=>H(n,t,B(...e))),{Fp:c,Fn:f}=t,{ORDER:u,BITS:a}=f,{keygen:d,getPublicKey:h,getSharedSecret:g,utils:w,lengths:p}=Wt(t,r),y={prehash:!1,lowS:"boolean"==typeof r.lowS&&r.lowS,format:void 0,extraEntropy:!1},m="compact";function E(t){return t>u>>Dt}function v(t,e){if(!f.isValidNot0(e))throw new Error(`invalid signature ${t}: out of range 1..Point.Fn.ORDER`);return e}class x{constructor(t,e,n){this.r=v("r",t),this.s=v("s",e),null!=n&&(this.recovery=n),Object.freeze(this)}static fromBytes(t,e=m){let n;if(function(t,e){Ct(e);const n=p.signature;C(t,"compact"===e?n:"recovered"===e?n+1:void 0,`${e} signature`)}(t,e),"der"===e){const{r:e,s:n}=Tt.toSig(C(t));return new x(e,n)}"recovered"===e&&(n=t[0],e="compact",t=t.subarray(1));const r=f.BYTES,o=t.subarray(0,r),i=t.subarray(r,2*r);return new x(f.fromBytes(o),f.fromBytes(i),n)}static fromHex(t,e){return this.fromBytes(b(t),e)}addRecoveryBit(t){return new x(this.r,this.s,t)}recoverPublicKey(e){const n=c.ORDER,{r:r,s:o,recovery:i}=this;if(null==i||![0,1,2,3].includes(i))throw new Error("recovery id invalid");if(u*Yt<n&&i>1)throw new Error("recovery id is ambiguous for h>1 curve");const s=2===i||3===i?r+u:r;if(!c.isValid(s))throw new Error("recovery id 2 or 3 invalid");const a=c.toBytes(s),l=t.fromBytes(B(Mt(!(1&i)),a)),d=f.inv(s),h=S(_("msgHash",e)),g=f.create(-h*d),w=f.create(o*d),p=t.BASE.multiplyUnsafe(g).add(l.multiplyUnsafe(w));if(p.is0())throw new Error("point at infinify");return p.assertValidity(),p}hasHighS(){return E(this.s)}toBytes(t=m){if(Ct(t),"der"===t)return b(Tt.hexFromSig(this));const e=f.toBytes(this.r),n=f.toBytes(this.s);if("recovered"===t){if(null==this.recovery)throw new Error("recovery bit must be present");return B(Uint8Array.of(this.recovery),e,n)}return B(e,n)}toHex(t){return l(this.toBytes(t))}assertValidity(){}static fromCompact(t){return x.fromBytes(_("sig",t),"compact")}static fromDER(t){return x.fromBytes(_("sig",t),"der")}normalizeS(){return this.hasHighS()?new x(this.r,f.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return l(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return l(this.toBytes("compact"))}}const R=r.bits2int||function(t){if(t.length>8192)throw new Error("input is too large");const e=T(t),n=8*t.length-a;return n>0?e>>BigInt(n):e},S=r.bits2int_modN||function(t){return f.create(R(t))},A=M(a);function I(t){return $("num < 2^"+a,t,jt,A),f.toBytes(t)}function U(t,e){return C(t,void 0,"message"),e?C(n(t),void 0,"prehashed message"):t}return Object.freeze({keygen:d,getPublicKey:h,getSharedSecret:g,utils:w,lengths:p,Point:t,sign:function(e,r,o={}){e=_("message",e);const{seed:c,k2sig:u}=function(e,n,r){if(["recovered","canonical"].some(t=>t in r))throw new Error("sign() legacy options not supported");const{lowS:o,prehash:s,extraEntropy:c}=Pt(r,y);e=U(e,s);const u=S(e),a=$t(f,n),l=[I(a),I(u)];if(null!=c&&!1!==c){const t=!0===c?i(p.secretKey):c;l.push(_("extraEntropy",t))}const d=B(...l),h=u;return{seed:d,k2sig:function(e){const n=R(e);if(!f.isValidNot0(n))return;const r=f.inv(n),i=t.BASE.multiply(n).toAffine(),s=f.create(i.x);if(s===jt)return;const c=f.create(r*f.create(h+s*a));if(c===jt)return;let u=(i.x===s?0:2)|Number(i.y&Dt),l=c;return o&&E(c)&&(l=f.neg(c),u^=1),new x(s,l,u)}}}(e,r,o);return function(t,e,n){if("number"!=typeof t||t<2)throw new Error("hashLen must be a number");if("number"!=typeof e||e<2)throw new Error("qByteLen must be a number");if("function"!=typeof n)throw new Error("hmacFn must be a function");const r=t=>new Uint8Array(t),o=t=>Uint8Array.of(t);let i=r(t),s=r(t),c=0;const f=()=>{i.fill(1),s.fill(0),c=0},u=(...t)=>n(s,i,...t),a=(t=r(0))=>{s=u(o(0),t),i=u(),0!==t.length&&(s=u(o(1),t),i=u())},l=()=>{if(c++>=1e3)throw new Error("drbg: tried 1000 values");let t=0;const n=[];for(;t<e;){i=u();const e=i.slice();n.push(e),t+=i.length}return B(...n)};return(t,e)=>{let n;for(f(),a(t);!(n=e(l()));)a();return f(),n}}(n.outputLen,f.BYTES,s)(c,u)},verify:function(n,r,o,i={}){const{lowS:s,prehash:c,format:u}=Pt(i,y);if(o=_("publicKey",o),r=U(_("message",r),c),"strict"in i)throw new Error("options.strict was renamed to lowS");const a=void 0===u?function(t){let n;const r="string"==typeof t||e(t),o=!r&&null!==t&&"object"==typeof t&&"bigint"==typeof t.r&&"bigint"==typeof t.s;if(!r&&!o)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(o)n=new x(t.r,t.s);else if(r){try{n=x.fromBytes(_("sig",t),"der")}catch(i){if(!(i instanceof Tt.Err))throw i}if(!n)try{n=x.fromBytes(_("sig",t),"compact")}catch(s){return!1}}return n||!1}(n):x.fromBytes(_("sig",n),u);if(!1===a)return!1;try{const e=t.fromBytes(o);if(s&&a.hasHighS())return!1;const{r:n,s:i}=a,c=S(r),u=f.inv(i),l=f.create(c*u),d=f.create(n*u),h=t.BASE.multiplyUnsafe(l).add(e.multiplyUnsafe(d));if(h.is0())return!1;return f.create(h.x)===n}catch(l){return!1}},recoverPublicKey:function(t,e,n={}){const{prehash:r}=Pt(n,y);return e=U(e,r),x.fromBytes(t,"recovered").recoverPublicKey(e).toBytes()},Signature:x,hash:n})}function Qt(t){const{CURVE:e,curveOpts:n}=function(t){const e={a:t.a,b:t.b,p:t.Fp.ORDER,n:t.n,h:t.h,Gx:t.Gx,Gy:t.Gy},n=t.Fp;let r=t.allowedPrivateKeyLengths?Array.from(new Set(t.allowedPrivateKeyLengths.map(t=>Math.ceil(t/2)))):void 0;return{CURVE:e,curveOpts:{Fp:n,Fn:Et(e.n,{BITS:t.nBitLength,allowedLengths:r,modFromBytes:t.wrapPrivateKey}),allowInfinityPoint:t.allowInfinityPoint,endo:t.endo,isTorsionFree:t.isTorsionFree,clearCofactor:t.clearCofactor,fromBytes:t.fromBytes,toBytes:t.toBytes}}}(t),r={hmac:t.hmac,randomBytes:t.randomBytes,lowS:t.lowS,bits2int:t.bits2int,bits2int_modN:t.bits2int_modN};return{CURVE:e,curveOpts:n,hash:t.hash,ecdsaOpts:r}}function te(t){const{CURVE:e,curveOpts:n,hash:r,ecdsaOpts:o}=Qt(t);return function(t,e){const n=e.Point;return Object.assign({},e,{ProjectivePoint:n,CURVE:Object.assign({},t,bt(n.Fn.ORDER,n.Fn.BITS))})}(t,Jt(Gt(e,n),r,o))}
|
|
10
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
11
|
+
/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
|
|
12
|
+
const ee={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},ne={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},re=BigInt(2);const oe=Et(ee.p,{sqrt:function(t){const e=ee.p,n=BigInt(3),r=BigInt(6),o=BigInt(11),i=BigInt(22),s=BigInt(23),c=BigInt(44),f=BigInt(88),u=t*t*t%e,a=u*u*t%e,l=ut(a,n,e)*a%e,d=ut(l,n,e)*a%e,h=ut(d,re,e)*u%e,g=ut(h,o,e)*h%e,w=ut(g,i,e)*g%e,p=ut(w,c,e)*w%e,y=ut(p,f,e)*p%e,m=ut(y,c,e)*w%e,b=ut(m,n,e)*a%e,E=ut(b,s,e)*g%e,B=ut(E,r,e)*u%e,v=ut(B,re,e);if(!oe.eql(oe.sqr(v),t))throw new Error("Cannot find square root");return v}}),ie=function(t,e){const n=e=>te({...t,hash:e});return{...n(e),create:n}}({...ee,Fp:oe,lowS:!0,endo:ne},q);exports.secp256k1=ie;
|
|
13
|
+
//# sourceMappingURL=secp256k1-CP0ZkpAx.cjs.map
|