@protontech/openpgp 6.0.0-alpha.0 → 6.0.0-alpha.1.patch.0

package/dist/lightweight/noble_curves.mjs

@@ -1,11 +1,10 @@
-/*! OpenPGP.js v6.0.0-alpha.0 - 2023-12-12 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+/*! OpenPGP.js v6.0.0-alpha.1.patch.0 - 2024-03-01 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
 const globalThis = typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
 
 import { H as Hash, h as hash, t as toBytes, e as exists, b as bytes, c as concatBytes$1, r as randomBytes, s as sha256, a as sha384, d as sha512, w as wrapConstructor, u as utf8ToBytes$1, f as shake256 } from './sha3.mjs';
 import { B as BigInteger } from './interface.mjs';
 import './native.interface.mjs';
 import './bn.interface.mjs';
-import './bn.mjs';
 
 // HMAC (RFC 2104)
 class HMAC extends Hash {
@@ -84,14 +83,22 @@ hmac.create = (hash, key) => new HMAC(hash, key);
 
 // TODOOOOOO use noble-hashes utils instead
 /*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+// 100 lines of code in the file are duplicated from noble-hashes (utils).
+// This is OK: `abstract` directory does not use noble-hashes.
+// User may opt-in into using different hashing library. This way, noble-hashes
+// won't be included into their bundle.
 const _2n$5 = Object.freeze(BigInteger.new(2));
-const u8a = (a) => a instanceof Uint8Array;
+function isBytes(a) {
+    return (a instanceof Uint8Array ||
+        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));
+}
+// Array where index 0xf0 (240) is mapped to string 'f0'
 const hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));
 /**
  * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'
  */
 function bytesToHex(bytes) {
-    if (!u8a(bytes))
+    if (!isBytes(bytes))
         throw new Error('Uint8Array expected');
     // pre-caching improves the speed 6x
     let hex = '';
@@ -110,23 +117,36 @@ function hexToNumber(hex) {
     // Big Endian
     return BigInteger.new(hex === '' ? '0' : `0x${hex}`);
 }
+// We use optimized technique to convert hex string to byte array
+const asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 };
+function asciiToBase16(char) {
+    if (char >= asciis._0 && char <= asciis._9)
+        return char - asciis._0;
+    if (char >= asciis._A && char <= asciis._F)
+        return char - (asciis._A - 10);
+    if (char >= asciis._a && char <= asciis._f)
+        return char - (asciis._a - 10);
+    return;
+}
 /**
  * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])
  */
 function hexToBytes(hex) {
     if (typeof hex !== 'string')
         throw new Error('hex string expected, got ' + typeof hex);
-    const len = hex.length;
-    if (len % 2)
-        throw new Error('padded hex string expected, got unpadded hex of length ' + len);
-    const array = new Uint8Array(len / 2);
-    for (let i = 0; i < array.length; i++) {
-        const j = i * 2;
-        const hexByte = hex.slice(j, j + 2);
-        const byte = Number.parseInt(hexByte, 16);
-        if (Number.isNaN(byte) || byte < 0)
-            throw new Error('Invalid byte sequence');
-        array[i] = byte;
+    const hl = hex.length;
+    const al = hl / 2;
+    if (hl % 2)
+        throw new Error('padded hex string expected, got unpadded hex of length ' + hl);
+    const array = new Uint8Array(al);
+    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {
+        const n1 = asciiToBase16(hex.charCodeAt(hi));
+        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));
+        if (n1 === undefined || n2 === undefined) {
+            const char = hex[hi] + hex[hi + 1];
+            throw new Error('hex string expected, got non-hex character "' + char + '" at index ' + hi);
+        }
+        array[ai] = n1 * 16 + n2;
     }
     return array;
 }
@@ -135,7 +155,7 @@ function bytesToNumberBE(bytes) {
     return BigInteger.new(bytes);
 }
 function bytesToNumberLE(bytes) {
-    if (!u8a(bytes))
+    if (!isBytes(bytes))
         throw new Error('Uint8Array expected');
     return BigInteger.new(bytes.slice().reverse()); // reverse() is in place
 }
@@ -168,7 +188,7 @@ function ensureBytes(title, hex, expectedLength) {
             throw new Error(`${title} must be valid hex string, got "${hex}". Cause: ${e}`);
         }
     }
-    else if (u8a(hex)) {
+    else if (isBytes(hex)) {
         // Uint8Array.from() instead of hash.slice() because node.js Buffer
         // is instance of Uint8Array, and its slice() creates **mutable** copy
         res = new Uint8Array(hex);
@@ -185,24 +205,30 @@ function ensureBytes(title, hex, expectedLength) {
  * Copies several Uint8Arrays into one.
  */
 function concatBytes(...arrays) {
-    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));
-    let pad = 0; // walk through each item, ensure they have proper type
-    arrays.forEach((a) => {
-        if (!u8a(a))
+    let sum = 0;
+    for (let i = 0; i < arrays.length; i++) {
+        const a = arrays[i];
+        if (!isBytes(a))
             throw new Error('Uint8Array expected');
-        r.set(a, pad);
+        sum += a.length;
+    }
+    let res = new Uint8Array(sum);
+    let pad = 0;
+    for (let i = 0; i < arrays.length; i++) {
+        const a = arrays[i];
+        res.set(a, pad);
         pad += a.length;
-    });
-    return r;
+    }
+    return res;
 }
-function equalBytes(b1, b2) {
-    // We don't care about timing attacks here
-    if (b1.length !== b2.length)
+// Compares 2 u8a-s in kinda constant time
+function equalBytes(a, b) {
+    if (a.length !== b.length)
         return false;
-    for (let i = 0; i < b1.length; i++)
-        if (b1[i] !== b2[i])
-            return false;
-    return true;
+    let diff = 0;
+    for (let i = 0; i < a.length; i++)
+        diff |= a[i] ^ b[i];
+    return diff === 0;
 }
 /**
  * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
@@ -306,7 +332,7 @@ const validatorFns = {
     function: (val) => typeof val === 'function',
     boolean: (val) => typeof val === 'boolean',
     string: (val) => typeof val === 'string',
-    stringOrUint8Array: (val) => typeof val === 'string' || val instanceof Uint8Array,
+    stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),
     isSafeInteger: (val) => Number.isSafeInteger(val),
     array: (val) => Array.isArray(val),
     field: (val, object) => object.Fp.isValid(val),
@@ -356,6 +382,7 @@ var ut = /*#__PURE__*/Object.freeze({
     equalBytes: equalBytes,
     hexToBytes: hexToBytes,
     hexToNumber: hexToNumber,
+    isBytes: isBytes,
     numberToBytesBE: numberToBytesBE,
     numberToBytesLE: numberToBytesLE,
     numberToHexUnpadded: numberToHexUnpadded,
@@ -919,7 +946,7 @@ const DER = {
         // parse DER signature
         const { Err: E } = DER;
         const data = typeof hex === 'string' ? h2b(hex) : hex;
-        if (!(data instanceof Uint8Array))
+        if (!isBytes(data))
             throw new Error('ui8a expected');
         let l = data.length;
         if (l < 2 || data[0] != 0x30)
@@ -1001,7 +1028,7 @@ function weierstrassPoints(opts) {
     function normPrivateKeyToScalar(key) {
         const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;
         if (lengths && !(key instanceof BigInteger)) {
-            if (key instanceof Uint8Array)
+            if (isBytes(key))
                 key = bytesToHex(key);
             // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes
             if (typeof key !== 'string' || !lengths.includes(key.length))
@@ -1579,7 +1606,7 @@ function weierstrass(curveDef) {
      * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.
      */
     function isProbPub(item) {
-        const arr = item instanceof Uint8Array;
+        const arr = isBytes(item);
         const str = typeof item === 'string';
         const len = (arr || str) && item.length;
         if (arr)
@@ -1740,7 +1767,7 @@ function weierstrass(curveDef) {
         let _sig = undefined;
         let P;
         try {
-            if (typeof sg === 'string' || sg instanceof Uint8Array) {
+            if (typeof sg === 'string' || isBytes(sg)) {
                 // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).
                 // Since DER can also be 2*nByteLength bytes, we check for it first.
                 try {
@@ -1816,9 +1843,9 @@ const CURVE_A$4 = Fp$7.create(BigInteger.new('-3'));
 const CURVE_B$4 = BigInteger.new('0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b');
 // prettier-ignore
 const p256 = createCurve({
-    a: CURVE_A$4,
+    a: CURVE_A$4, // Equation params: a, b
     b: CURVE_B$4,
-    Fp: Fp$7,
+    Fp: Fp$7, // Field: 2n**224n * (2n**32n-1n) + 2n**192n + 2n**96n-1n
     // Curve order, total count of valid points in the field
     n: BigInteger.new('0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551'),
     // Base (generator) point (x, y)
@@ -1840,9 +1867,9 @@ const CURVE_A$3 = Fp$6.create(BigInteger.new('-3'));
 const CURVE_B$3 = BigInteger.new('0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef');
 // prettier-ignore
 const p384 = createCurve({
-    a: CURVE_A$3,
+    a: CURVE_A$3, // Equation params: a, b
     b: CURVE_B$3,
-    Fp: Fp$6,
+    Fp: Fp$6, // Field: 2n**384n - 2n**128n - 2n**96n + 2n**32n - 1n
     // Curve order, total count of valid points in the field.
     n: BigInteger.new('0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973'),
     // Base (generator) point (x, y)
@@ -1871,12 +1898,12 @@ const CURVE = {
 };
 // prettier-ignore
 const p521 = createCurve({
-    a: CURVE.a,
+    a: CURVE.a, // Equation params: a, b
     b: CURVE.b,
-    Fp: Fp$5,
+    Fp: Fp$5, // Field: 2n**521n - 1n
     // Curve order, total count of valid points in the field
     n: CURVE.n,
-    Gx: CURVE.Gx,
+    Gx: CURVE.Gx, // Base point (x, y) aka generator point
     Gy: CURVE.Gy,
     h: CURVE.h,
     lowS: false,
@@ -1889,7 +1916,7 @@ const CURVE_A$2 = Fp$4.create(BigInteger.new('0x7d5a0975fc2c3057eef67530417affe7
 const CURVE_B$2 = BigInteger.new('0x26dc5c6ce94a4b44f330b5d9bbd77cbf958416295cf7e1ce6bccdc18ff8c07b6');
 // prettier-ignore
 const brainpoolP256r1 = createCurve({
-    a: CURVE_A$2,
+    a: CURVE_A$2, // Equation params: a, b
     b: CURVE_B$2,
     Fp: Fp$4,
     // Curve order (q), total count of valid points in the field
@@ -1907,7 +1934,7 @@ const CURVE_A$1 = Fp$3.create(BigInteger.new('0x7bc382c63d8c150c3c72080ace05afa0
 const CURVE_B$1 = BigInteger.new('0x04a8c7dd22ce28268b39b55416f0447c2fb77de107dcd2a62e880ea53eeb62d57cb4390295dbc9943ab78696fa504c11');
 // prettier-ignore
 const brainpoolP384r1 = createCurve({
-    a: CURVE_A$1,
+    a: CURVE_A$1, // Equation params: a, b
     b: CURVE_B$1,
     Fp: Fp$3,
     // Curve order (q), total count of valid points in the field
@@ -1925,7 +1952,7 @@ const CURVE_A = Fp$2.create(BigInteger.new('0x7830a3318b603b89e2327145ac234cc594
 const CURVE_B = BigInteger.new('0x3df91610a83441caea9863bc2ded5d5aa8253aa10a2ef1c98b9ac8b57f1117a72bf2c7b9e7c1ac4d77fc94cadc083e67984050b75ebae5dd2809bd638016f723');
 // prettier-ignore
 const brainpoolP512r1 = createCurve({
-    a: CURVE_A,
+    a: CURVE_A, // Equation params: a, b
     b: CURVE_B,
     Fp: Fp$2,
     // Curve order (q), total count of valid points in the field
@@ -2591,6 +2618,7 @@ const ED448_DEF = {
     // Subgroup order: how many points curve has;
     // 2n**446n - 13818066809895115352007386748515426880336692474882178609894547503885n
     n: BigInteger.new('181709681073901722637330951972001133588410340171829515070372549795146003961539585716195755291692375963310293709091662304773755859649779'),
+    // RFC 7748 has 56-byte keys, RFC 8032 has 57-byte keys
     nBitLength: 456,
     // Cofactor
     h: BigInteger.new(4),
@@ -2627,6 +2655,7 @@ const x448 = /* @__PURE__ */ (() => montgomery({
     adjustScalarBytes,
     randomBytes,
 }))();
+// TODO: add edwardsToMontgomeryPriv, similar to ed25519 version
 Object.freeze(BigInteger.new(4));
 // Hash To Curve Elligator2 Map
 Fp$1.ORDER.sub(_3n).irightShift(_2n$1); // 1. c1 = (q - 3) / 4         # Integer arithmetic
@@ -2678,15 +2707,15 @@ function sqrtMod(y) {
 }
 const Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });
 const secp256k1 = createCurve({
-    a: BigInteger.new(0),
-    b: BigInteger.new(7),
-    Fp,
-    n: secp256k1N,
+    a: BigInteger.new(0), // equation params: a, b
+    b: BigInteger.new(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975
+    Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n
+    n: secp256k1N, // Curve order, total count of valid points in the field
     // Base point (x, y) aka generator point
     Gx: BigInteger.new('55066263022277343669578718895168534326250603453777594175500187360389116729240'),
     Gy: BigInteger.new('32670510020758816978083085130507043184471273380659243275938904335757337482424'),
-    h: BigInteger.new(1),
-    lowS: true,
+    h: BigInteger.new(1), // Cofactor
+    lowS: true, // Allow only low-S signatures by default in sign() and verify()
     /**
      * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.
      * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.
@@ -2729,9 +2758,9 @@ secp256k1.ProjectivePoint;
 
 
 const nobleCurves = new Map(Object.entries({
-  p256,
-  p384,
-  p521,
+  nistP256: p256,
+  nistP384: p384,
+  nistP521: p521,
   brainpoolP256r1,
   brainpoolP384r1,
   brainpoolP512r1,

package/dist/lightweight/noble_hashes.min.mjs

@@ -1,3 +1,3 @@
-/*! OpenPGP.js v6.0.0-alpha.0 - 2023-12-12 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
-"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self&&self;import{w as t,S as s,g as i,s as h,a as e,d as n,i as r,j as o}from"./sha3.min.mjs";import"./interface.min.mjs";import"./native.interface.min.mjs";import"./bn.interface.min.mjs";import"./bn.min.mjs";const a=(t,s)=>t<<s|t>>>32-s>>>0,l=(t,s,i)=>t&s^t&i^s&i,f=new Uint32Array([1732584193,4023233417,2562383102,271733878,3285377520]),m=new Uint32Array(80);class c extends s{constructor(){super(64,20,8,!1),this.A=0|f[0],this.B=0|f[1],this.C=0|f[2],this.D=0|f[3],this.E=0|f[4]}get(){const{A:t,B:s,C:i,D:h,E:e}=this;return[t,s,i,h,e]}set(t,s,i,h,e){this.A=0|t,this.B=0|s,this.C=0|i,this.D=0|h,this.E=0|e}process(t,s){for(let i=0;i<16;i++,s+=4)m[i]=t.getUint32(s,!1);for(let t=16;t<80;t++)m[t]=a(m[t-3]^m[t-8]^m[t-14]^m[t-16],1);let{A:i,B:h,C:e,D:n,E:r}=this;for(let t=0;t<80;t++){let s,f;t<20?(s=(o=h)&e^~o&n,f=1518500249):t<40?(s=h^e^n,f=1859775393):t<60?(s=l(h,e,n),f=2400959708):(s=h^e^n,f=3395469782);const c=a(i,5)+s+r+f+m[t]|0;r=n,n=e,e=a(h,30),h=i,i=c}var o;i=i+this.A|0,h=h+this.B|0,e=e+this.C|0,n=n+this.D|0,r=r+this.E|0,this.set(i,h,e,n,r)}roundClean(){m.fill(0)}destroy(){this.set(0,0,0,0,0),this.buffer.fill(0)}}const p=t((()=>new c)),d=new Uint8Array([7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8]),u=new Uint8Array(Array(16).fill(0).map(((t,s)=>s)));let w=[u],y=[u.map((t=>(9*t+5)%16))];for(let t=0;t<4;t++)for(let s of[w,y])s.push(s[t].map((t=>d[t])));const A=[[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8],[12,13,11,15,6,9,9,7,12,15,11,13,7,8,7,7],[13,15,14,11,7,7,6,8,13,14,13,12,5,5,6,9],[14,11,12,14,8,6,5,5,15,12,15,14,9,9,8,6],[15,12,13,13,9,5,8,6,14,11,12,11,8,6,5,5]].map((t=>new Uint8Array(t))),U=w.map(((t,s)=>t.map((t=>A[s][t])))),b=y.map(((t,s)=>t.map((t=>A[s][t])))),g=new Uint32Array([0,1518500249,1859775393,2400959708,2840853838]),j=new Uint32Array([1352829926,1548603684,1836072691,2053994217,0]),C=(t,s)=>t<<s|t>>>32-s;function B(t,s,i,h){return 0===t?s^i^h:1===t?s&i|~s&h:2===t?(s|~i)^h:3===t?s&h|i&~h:s^(i|~h)}const D=new Uint32Array(16);class E extends s{constructor(){super(64,20,8,!0),this.h0=1732584193,this.h1=-271733879,this.h2=-1732584194,this.h3=271733878,this.h4=-1009589776}get(){const{h0:t,h1:s,h2:i,h3:h,h4:e}=this;return[t,s,i,h,e]}set(t,s,i,h,e){this.h0=0|t,this.h1=0|s,this.h2=0|i,this.h3=0|h,this.h4=0|e}process(t,s){for(let i=0;i<16;i++,s+=4)D[i]=t.getUint32(s,!0);let i=0|this.h0,h=i,e=0|this.h1,n=e,r=0|this.h2,o=r,a=0|this.h3,l=a,f=0|this.h4,m=f;for(let t=0;t<5;t++){const s=4-t,c=g[t],p=j[t],d=w[t],u=y[t],A=U[t],E=b[t];for(let s=0;s<16;s++){const h=C(i+B(t,e,r,a)+D[d[s]]+c,A[s])+f|0;i=f,f=a,a=0|C(r,10),r=e,e=h}for(let t=0;t<16;t++){const i=C(h+B(s,n,o,l)+D[u[t]]+p,E[t])+m|0;h=m,m=l,l=0|C(o,10),o=n,n=i}}this.set(this.h1+r+l|0,this.h2+a+m|0,this.h3+f+h|0,this.h4+i+n|0,this.h0+e+o|0)}roundClean(){D.fill(0)}destroy(){this.destroyed=!0,this.buffer.fill(0),this.set(0,0,0,0,0)}}const x=new Map(Object.entries({sha1:p,sha224:i,sha256:h,sha384:e,sha512:n,sha3_256:r,sha3_512:o,ripemd160:t((()=>new E))}));export{x as nobleHashes};
+/*! OpenPGP.js v6.0.0-alpha.1.patch.0 - 2024-03-01 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self&&self;import{w as t,S as s,g as i,s as h,a as e,d as n,i as r,j as a}from"./sha3.min.mjs";import"./interface.min.mjs";import"./native.interface.min.mjs";import"./bn.interface.min.mjs";const o=(t,s)=>t<<s|t>>>32-s>>>0,l=(t,s,i)=>t&s^t&i^s&i,f=/* @__PURE__ */new Uint32Array([1732584193,4023233417,2562383102,271733878,3285377520]),c=/* @__PURE__ */new Uint32Array(80);class p extends s{constructor(){super(64,20,8,!1),this.A=0|f[0],this.B=0|f[1],this.C=0|f[2],this.D=0|f[3],this.E=0|f[4]}get(){const{A:t,B:s,C:i,D:h,E:e}=this;return[t,s,i,h,e]}set(t,s,i,h,e){this.A=0|t,this.B=0|s,this.C=0|i,this.D=0|h,this.E=0|e}process(t,s){for(let i=0;i<16;i++,s+=4)c[i]=t.getUint32(s,!1);for(let t=16;t<80;t++)c[t]=o(c[t-3]^c[t-8]^c[t-14]^c[t-16],1);let{A:i,B:h,C:e,D:n,E:r}=this;for(let t=0;t<80;t++){let s,f;t<20?(s=(a=h)&e^~a&n,f=1518500249):t<40?(s=h^e^n,f=1859775393):t<60?(s=l(h,e,n),f=2400959708):(s=h^e^n,f=3395469782);const p=o(i,5)+s+r+f+c[t]|0;r=n,n=e,e=o(h,30),h=i,i=p}var a;i=i+this.A|0,h=h+this.B|0,e=e+this.C|0,n=n+this.D|0,r=r+this.E|0,this.set(i,h,e,n,r)}roundClean(){c.fill(0)}destroy(){this.set(0,0,0,0,0),this.buffer.fill(0)}}const m=/* @__PURE__ */t((()=>new p)),d=/* @__PURE__ */new Uint8Array([7,4,13,1,10,6,15,3,12,0,9,5,2,14,11,8]),u=/* @__PURE__ */new Uint8Array(Array(16).fill(0).map(((t,s)=>s)));let w=[u],y=[/* @__PURE__ */u.map((t=>(9*t+5)%16))];for(let t=0;t<4;t++)for(let s of[w,y])s.push(s[t].map((t=>d[t])));const A=/* @__PURE__ */[[11,14,15,12,5,8,7,9,11,13,14,15,6,7,9,8],[12,13,11,15,6,9,9,7,12,15,11,13,7,8,7,7],[13,15,14,11,7,7,6,8,13,14,13,12,5,5,6,9],[14,11,12,14,8,6,5,5,15,12,15,14,9,9,8,6],[15,12,13,13,9,5,8,6,14,11,12,11,8,6,5,5]].map((t=>new Uint8Array(t))),U=/* @__PURE__ */w.map(((t,s)=>t.map((t=>A[s][t])))),g=/* @__PURE__ */y.map(((t,s)=>t.map((t=>A[s][t])))),C=/* @__PURE__ */new Uint32Array([0,1518500249,1859775393,2400959708,2840853838]),b=/* @__PURE__ */new Uint32Array([1352829926,1548603684,1836072691,2053994217,0]),j=(t,s)=>t<<s|t>>>32-s;function B(t,s,i,h){return 0===t?s^i^h:1===t?s&i|~s&h:2===t?(s|~i)^h:3===t?s&h|i&~h:s^(i|~h)}const D=/* @__PURE__ */new Uint32Array(16);class E extends s{constructor(){super(64,20,8,!0),this.h0=1732584193,this.h1=-271733879,this.h2=-1732584194,this.h3=271733878,this.h4=-1009589776}get(){const{h0:t,h1:s,h2:i,h3:h,h4:e}=this;return[t,s,i,h,e]}set(t,s,i,h,e){this.h0=0|t,this.h1=0|s,this.h2=0|i,this.h3=0|h,this.h4=0|e}process(t,s){for(let i=0;i<16;i++,s+=4)D[i]=t.getUint32(s,!0);let i=0|this.h0,h=i,e=0|this.h1,n=e,r=0|this.h2,a=r,o=0|this.h3,l=o,f=0|this.h4,c=f;for(let t=0;t<5;t++){const s=4-t,p=C[t],m=b[t],d=w[t],u=y[t],A=U[t],E=g[t];for(let s=0;s<16;s++){const h=j(i+B(t,e,r,o)+D[d[s]]+p,A[s])+f|0;i=f,f=o,o=0|j(r,10),r=e,e=h}for(let t=0;t<16;t++){const i=j(h+B(s,n,a,l)+D[u[t]]+m,E[t])+c|0;h=c,c=l,l=0|j(a,10),a=n,n=i}}this.set(this.h1+r+l|0,this.h2+o+c|0,this.h3+f+h|0,this.h4+i+n|0,this.h0+e+a|0)}roundClean(){D.fill(0)}destroy(){this.destroyed=!0,this.buffer.fill(0),this.set(0,0,0,0,0)}}const x=new Map(Object.entries({sha1:m,sha224:i,sha256:h,sha384:e,sha512:n,sha3_256:r,sha3_512:a,ripemd160:/* @__PURE__ */t((()=>new E))}));export{x as nobleHashes};
 //# sourceMappingURL=noble_hashes.min.mjs.map

package/dist/lightweight/noble_hashes.min.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"noble_hashes.min.mjs","sources":["../../node_modules/@openpgp/noble-hashes/esm/sha1.js","../../node_modules/@openpgp/noble-hashes/esm/ripemd160.js","../../src/crypto/hash/noble_hashes.js"],"sourcesContent":["import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// SHA1 was cryptographically broken.\n// It is still widely used in legacy apps. Don't use it for a new protocol.\n// RFC 3174\nconst rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Initial state\nconst IV = /* @__PURE__ */ new Uint32Array([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\nclass SHA1 extends SHA2 {\n    constructor() {\n        super(64, 20, 8, false);\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA1_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 80; i++)\n            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n        // Compression function main loop, 80 rounds\n        let { A, B, C, D, E } = this;\n        for (let i = 0; i < 80; i++) {\n            let F, K;\n            if (i < 20) {\n                F = Chi(B, C, D);\n                K = 0x5a827999;\n            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\n            else {\n                F = B ^ C ^ D;\n                K = 0xca62c1d6;\n            }\n            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n            E = D;\n            D = C;\n            C = rotl(B, 30);\n            B = A;\n            A = T;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        this.set(A, B, C, D, E);\n    }\n    roundClean() {\n        SHA1_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\nexport const sha1 = /* @__PURE__ */ wrapConstructor(() => new SHA1());\n//# sourceMappingURL=sha1.js.map","import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((_, i) => i));\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n    for (let j of [idxL, idxR])\n        j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) | (word >>> (32 - shift));\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    else if (group === 1)\n        return (x & y) | (~x & z);\n    else if (group === 2)\n        return (x | ~y) ^ z;\n    else if (group === 3)\n        return (x & z) | (y & ~z);\n    else\n        return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst BUF = /* @__PURE__ */ new Uint32Array(16);\nexport class RIPEMD160 extends SHA2 {\n    constructor() {\n        super(64, 20, 8, true);\n        this.h0 = 0x67452301 | 0;\n        this.h1 = 0xefcdab89 | 0;\n        this.h2 = 0x98badcfe | 0;\n        this.h3 = 0x10325476 | 0;\n        this.h4 = 0xc3d2e1f0 | 0;\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + f(group, bl, cl, dl) + BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + f(rGroup, br, cr, dr) + BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        BUF.fill(0);\n    }\n    destroy() {\n        this.destroyed = true;\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexport const ripemd160 = /* @__PURE__ */ wrapConstructor(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","/**\n * This file is needed to dynamic import the noble-hashes.\n * Separate dynamic imports are not convenient as they result in too many chunks,\n * which share a lot of code anyway.\n */\n\nimport { sha1 } from '@openpgp/noble-hashes/sha1';\nimport { sha224, sha256 } from '@openpgp/noble-hashes/sha256';\nimport { sha384, sha512 } from '@openpgp/noble-hashes/sha512';\nimport { sha3_256, sha3_512 } from '@openpgp/noble-hashes/sha3';\nimport { ripemd160 } from '@openpgp/noble-hashes/ripemd160';\n\nexport const nobleHashes = new Map(Object.entries({\n  sha1,\n  sha224,\n  sha256,\n  sha384,\n  sha512,\n  sha3_256,\n  sha3_512,\n  ripemd160\n}));\n"],"names":["rotl","word","shift","Maj","a","b","c","IV","Uint32Array","SHA1_W","SHA1","SHA2","constructor","super","this","A","B","C","D","E","get","set","process","view","offset","i","getUint32","F","K","T","roundClean","fill","destroy","buffer","sha1","wrapConstructor","Rho","Uint8Array","Id","Array","map","_","idxL","idxR","j","push","k","shifts","shiftsL","idx","shiftsR","Kl","Kr","f","group","x","y","z","BUF","RIPEMD160","h0","h1","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","tr","destroyed","nobleHashes","Map","Object","entries","sha224","sha256","sha384","sha512","sha3_256","sha3_512","ripemd160"],"mappings":";0SAKA,MAAMA,EAAO,CAACC,EAAMC,IAAWD,GAAQC,EAAWD,IAAU,GAAKC,IAAY,EAIvEC,EAAM,CAACC,EAAGC,EAAGC,IAAOF,EAAIC,EAAMD,EAAIE,EAAMD,EAAIC,EAE5CC,EAAqB,IAAIC,YAAY,CACvC,WAAY,WAAY,WAAY,UAAY,aAI9CC,EAAyB,IAAID,YAAY,IAC/C,MAAME,UAAaC,EACfC,cACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAKC,EAAY,EAARR,EAAG,GACZO,KAAKE,EAAY,EAART,EAAG,GACZO,KAAKG,EAAY,EAARV,EAAG,GACZO,KAAKI,EAAY,EAARX,EAAG,GACZO,KAAKK,EAAY,EAARZ,EAAG,EACf,CACDa,MACI,MAAML,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KAC1B,MAAO,CAACC,EAAGC,EAAGC,EAAGC,EAAGC,EACvB,CACDE,IAAIN,EAAGC,EAAGC,EAAGC,EAAGC,GACZL,KAAKC,EAAQ,EAAJA,EACTD,KAAKE,EAAQ,EAAJA,EACTF,KAAKG,EAAQ,EAAJA,EACTH,KAAKI,EAAQ,EAAJA,EACTJ,KAAKK,EAAQ,EAAJA,CACZ,CACDG,QAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCf,EAAOgB,GAAKF,EAAKG,UAAUF,GAAQ,GACvC,IAAK,IAAIC,EAAI,GAAIA,EAAI,GAAIA,IACrBhB,EAAOgB,GAAKzB,EAAKS,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,IAAMhB,EAAOgB,EAAI,IAAK,GAEtF,IAAIV,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KACxB,IAAK,IAAIW,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAIE,EAAGC,EACHH,EAAI,IACJE,GAxCHvB,EAwCWY,GAAGC,GAxCUb,EAwCPc,EACdU,EAAI,YAECH,EAAI,IACTE,EAAIX,EAAIC,EAAIC,EACZU,EAAI,YAECH,EAAI,IACTE,EAAIxB,EAAIa,EAAGC,EAAGC,GACdU,EAAI,aAGJD,EAAIX,EAAIC,EAAIC,EACZU,EAAI,YAER,MAAMC,EAAK7B,EAAKe,EAAG,GAAKY,EAAIR,EAAIS,EAAInB,EAAOgB,GAAM,EACjDN,EAAID,EACJA,EAAID,EACJA,EAAIjB,EAAKgB,EAAG,IACZA,EAAID,EACJA,EAAIc,CACP,CA7DG,IAACzB,EA+DLW,EAAKA,EAAID,KAAKC,EAAK,EACnBC,EAAKA,EAAIF,KAAKE,EAAK,EACnBC,EAAKA,EAAIH,KAAKG,EAAK,EACnBC,EAAKA,EAAIJ,KAAKI,EAAK,EACnBC,EAAKA,EAAIL,KAAKK,EAAK,EACnBL,KAAKO,IAAIN,EAAGC,EAAGC,EAAGC,EAAGC,EACxB,CACDW,aACIrB,EAAOsB,KAAK,EACf,CACDC,UACIlB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,GACrBP,KAAKmB,OAAOF,KAAK,EACpB,EAEE,MAAMG,EAAuBC,GAAgB,IAAM,IAAIzB,ICjFxD0B,EAAsB,IAAIC,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzFC,EAAqB,IAAID,WAAeE,MAAM,IAAIR,KAAK,GAAGS,KAAI,CAACC,EAAGhB,IAAMA,KAE9E,IAAIiB,EAAO,CAACJ,GACRK,EAAO,CAFgBL,EAAGE,KAAKf,IAAO,EAAIA,EAAI,GAAK,MAGvD,IAAK,IAAIA,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAImB,IAAK,CAACF,EAAMC,GACjBC,EAAEC,KAAKD,EAAEnB,GAAGe,KAAKM,GAAMV,EAAIU,MACnC,MAAMC,EAAyB,CAC3B,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxDP,KAAKf,GAAM,IAAIY,WAAWZ,KACtBuB,EAA0BN,EAAKF,KAAI,CAACS,EAAKxB,IAAMwB,EAAIT,KAAKI,GAAMG,EAAOtB,GAAGmB,OACxEM,EAA0BP,EAAKH,KAAI,CAACS,EAAKxB,IAAMwB,EAAIT,KAAKI,GAAMG,EAAOtB,GAAGmB,OACxEO,EAAqB,IAAI3C,YAAY,CACvC,EAAY,WAAY,WAAY,WAAY,aAE9C4C,EAAqB,IAAI5C,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,IAG9CR,EAAO,CAACC,EAAMC,IAAWD,GAAQC,EAAUD,IAAU,GAAKC,EAEhE,SAASmD,EAAEC,EAAOC,EAAGC,EAAGC,GACpB,OAAc,IAAVH,EACOC,EAAIC,EAAIC,EACA,IAAVH,EACGC,EAAIC,GAAOD,EAAIE,EACR,IAAVH,GACGC,GAAKC,GAAKC,EACH,IAAVH,EACGC,EAAIE,EAAMD,GAAKC,EAEhBF,GAAKC,GAAKC,EACzB,CAEA,MAAMC,EAAsB,IAAIlD,YAAY,IACrC,MAAMmD,UAAkBhD,EAC3BC,cACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAK8C,GAAK,WACV9C,KAAK+C,IAAK,UACV/C,KAAKgD,IAAK,WACVhD,KAAKiD,GAAK,UACVjD,KAAKkD,IAAK,UACb,CACD5C,MACI,MAAMwC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOlD,KAC/B,MAAO,CAAC8C,EAAIC,EAAIC,EAAIC,EAAIC,EAC3B,CACD3C,IAAIuC,EAAIC,EAAIC,EAAIC,EAAIC,GAChBlD,KAAK8C,GAAU,EAALA,EACV9C,KAAK+C,GAAU,EAALA,EACV/C,KAAKgD,GAAU,EAALA,EACVhD,KAAKiD,GAAU,EAALA,EACVjD,KAAKkD,GAAU,EAALA,CACb,CACD1C,QAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCkC,EAAIjC,GAAKF,EAAKG,UAAUF,GAAQ,GAEpC,IAAIyC,EAAe,EAAVnD,KAAK8C,GAAQM,EAAKD,EAAIE,EAAe,EAAVrD,KAAK+C,GAAQO,EAAKD,EAAIE,EAAe,EAAVvD,KAAKgD,GAAQQ,EAAKD,EAAIE,EAAe,EAAVzD,KAAKiD,GAAQS,EAAKD,EAAIE,EAAe,EAAV3D,KAAKkD,GAAQU,EAAKD,EAGvI,IAAK,IAAInB,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMqB,EAAS,EAAIrB,EACbsB,EAAMzB,EAAGG,GAAQuB,EAAMzB,EAAGE,GAC1BwB,EAAKpC,EAAKY,GAAQyB,EAAKpC,EAAKW,GAC5B0B,EAAKhC,EAAQM,GAAQ2B,EAAK/B,EAAQI,GACxC,IAAK,IAAI7B,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMyD,EAAMlF,EAAKiE,EAAKZ,EAAEC,EAAOa,EAAIE,EAAIE,GAAMb,EAAIoB,EAAGrD,IAAMmD,EAAKI,EAAGvD,IAAMgD,EAAM,EAC9ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfvE,EAAKqE,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CAC1D,CAED,IAAK,IAAIzD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM0D,EAAMnF,EAAKkE,EAAKb,EAAEsB,EAAQP,EAAIE,EAAIE,GAAMd,EAAIqB,EAAGtD,IAAMoD,EAAKI,EAAGxD,IAAMiD,EAAM,EAC/ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfxE,EAAKsE,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CAC1D,CACJ,CAEDrE,KAAKO,IAAKP,KAAK+C,GAAKQ,EAAKG,EAAM,EAAI1D,KAAKgD,GAAKS,EAAKG,EAAM,EAAI5D,KAAKiD,GAAKU,EAAKP,EAAM,EAAIpD,KAAKkD,GAAKC,EAAKG,EAAM,EAAItD,KAAK8C,GAAKO,EAAKG,EAAM,EACtI,CACDxC,aACI4B,EAAI3B,KAAK,EACZ,CACDC,UACIlB,KAAKsE,WAAY,EACjBtE,KAAKmB,OAAOF,KAAK,GACjBjB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,EACxB,EAME,MC1FMgE,EAAc,IAAIC,IAAIC,OAAOC,QAAQ,CAChDtD,OACAuD,SACAC,SACAC,SACAC,SACAC,WACAC,WACAC,UDkFuC5D,GAAgB,IAAM,IAAIwB","x_google_ignoreList":[0,1]}
+{"version":3,"file":"noble_hashes.min.mjs","sources":["../../node_modules/@openpgp/noble-hashes/esm/sha1.js","../../node_modules/@openpgp/noble-hashes/esm/ripemd160.js","../../src/crypto/hash/noble_hashes.js"],"sourcesContent":["import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// SHA1 was cryptographically broken.\n// It is still widely used in legacy apps. Don't use it for a new protocol.\n// RFC 3174\nconst rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\n// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n// Initial state\nconst IV = /* @__PURE__ */ new Uint32Array([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\nclass SHA1 extends SHA2 {\n    constructor() {\n        super(64, 20, 8, false);\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA1_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 80; i++)\n            SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n        // Compression function main loop, 80 rounds\n        let { A, B, C, D, E } = this;\n        for (let i = 0; i < 80; i++) {\n            let F, K;\n            if (i < 20) {\n                F = Chi(B, C, D);\n                K = 0x5a827999;\n            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\n            else {\n                F = B ^ C ^ D;\n                K = 0xca62c1d6;\n            }\n            const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n            E = D;\n            D = C;\n            C = rotl(B, 30);\n            B = A;\n            A = T;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        this.set(A, B, C, D, E);\n    }\n    roundClean() {\n        SHA1_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\nexport const sha1 = /* @__PURE__ */ wrapConstructor(() => new SHA1());\n//# sourceMappingURL=sha1.js.map","import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ new Uint8Array(new Array(16).fill(0).map((_, i) => i));\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n    for (let j of [idxL, idxR])\n        j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) | (word >>> (32 - shift));\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    else if (group === 1)\n        return (x & y) | (~x & z);\n    else if (group === 2)\n        return (x | ~y) ^ z;\n    else if (group === 3)\n        return (x & z) | (y & ~z);\n    else\n        return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst BUF = /* @__PURE__ */ new Uint32Array(16);\nexport class RIPEMD160 extends SHA2 {\n    constructor() {\n        super(64, 20, 8, true);\n        this.h0 = 0x67452301 | 0;\n        this.h1 = 0xefcdab89 | 0;\n        this.h2 = 0x98badcfe | 0;\n        this.h3 = 0x10325476 | 0;\n        this.h4 = 0xc3d2e1f0 | 0;\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + f(group, bl, cl, dl) + BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + f(rGroup, br, cr, dr) + BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        BUF.fill(0);\n    }\n    destroy() {\n        this.destroyed = true;\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexport const ripemd160 = /* @__PURE__ */ wrapConstructor(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","/**\n * This file is needed to dynamic import the noble-hashes.\n * Separate dynamic imports are not convenient as they result in too many chunks,\n * which share a lot of code anyway.\n */\n\nimport { sha1 } from '@openpgp/noble-hashes/sha1';\nimport { sha224, sha256 } from '@openpgp/noble-hashes/sha256';\nimport { sha384, sha512 } from '@openpgp/noble-hashes/sha512';\nimport { sha3_256, sha3_512 } from '@openpgp/noble-hashes/sha3';\nimport { ripemd160 } from '@openpgp/noble-hashes/ripemd160';\n\nexport const nobleHashes = new Map(Object.entries({\n  sha1,\n  sha224,\n  sha256,\n  sha384,\n  sha512,\n  sha3_256,\n  sha3_512,\n  ripemd160\n}));\n"],"names":["rotl","word","shift","Maj","a","b","c","IV","Uint32Array","SHA1_W","SHA1","SHA2","constructor","super","this","A","B","C","D","E","get","set","process","view","offset","i","getUint32","F","K","T","roundClean","fill","destroy","buffer","sha1","wrapConstructor","Rho","Uint8Array","Id","Array","map","_","idxL","idxR","j","push","k","shifts","shiftsL","idx","shiftsR","Kl","Kr","f","group","x","y","z","BUF","RIPEMD160","h0","h1","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","tr","destroyed","nobleHashes","Map","Object","entries","sha224","sha256","sha384","sha512","sha3_256","sha3_512","ripemd160"],"mappings":";qRAKA,MAAMA,EAAO,CAACC,EAAMC,IAAWD,GAAQC,EAAWD,IAAU,GAAKC,IAAY,EAIvEC,EAAM,CAACC,EAAGC,EAAGC,IAAOF,EAAIC,EAAMD,EAAIE,EAAMD,EAAIC,EAE5CC,iBAAqB,IAAIC,YAAY,CACvC,WAAY,WAAY,WAAY,UAAY,aAI9CC,iBAAyB,IAAID,YAAY,IAC/C,MAAME,UAAaC,EACf,WAAAC,GACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAKC,EAAY,EAARR,EAAG,GACZO,KAAKE,EAAY,EAART,EAAG,GACZO,KAAKG,EAAY,EAARV,EAAG,GACZO,KAAKI,EAAY,EAARX,EAAG,GACZO,KAAKK,EAAY,EAARZ,EAAG,EACf,CACD,GAAAa,GACI,MAAML,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KAC1B,MAAO,CAACC,EAAGC,EAAGC,EAAGC,EAAGC,EACvB,CACD,GAAAE,CAAIN,EAAGC,EAAGC,EAAGC,EAAGC,GACZL,KAAKC,EAAQ,EAAJA,EACTD,KAAKE,EAAQ,EAAJA,EACTF,KAAKG,EAAQ,EAAJA,EACTH,KAAKI,EAAQ,EAAJA,EACTJ,KAAKK,EAAQ,EAAJA,CACZ,CACD,OAAAG,CAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCf,EAAOgB,GAAKF,EAAKG,UAAUF,GAAQ,GACvC,IAAK,IAAIC,EAAI,GAAIA,EAAI,GAAIA,IACrBhB,EAAOgB,GAAKzB,EAAKS,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,GAAKhB,EAAOgB,EAAI,IAAMhB,EAAOgB,EAAI,IAAK,GAEtF,IAAIV,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,KACxB,IAAK,IAAIW,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAIE,EAAGC,EACHH,EAAI,IACJE,GAxCHvB,EAwCWY,GAAGC,GAxCUb,EAwCPc,EACdU,EAAI,YAECH,EAAI,IACTE,EAAIX,EAAIC,EAAIC,EACZU,EAAI,YAECH,EAAI,IACTE,EAAIxB,EAAIa,EAAGC,EAAGC,GACdU,EAAI,aAGJD,EAAIX,EAAIC,EAAIC,EACZU,EAAI,YAER,MAAMC,EAAK7B,EAAKe,EAAG,GAAKY,EAAIR,EAAIS,EAAInB,EAAOgB,GAAM,EACjDN,EAAID,EACJA,EAAID,EACJA,EAAIjB,EAAKgB,EAAG,IACZA,EAAID,EACJA,EAAIc,CACP,CA7DG,IAACzB,EA+DLW,EAAKA,EAAID,KAAKC,EAAK,EACnBC,EAAKA,EAAIF,KAAKE,EAAK,EACnBC,EAAKA,EAAIH,KAAKG,EAAK,EACnBC,EAAKA,EAAIJ,KAAKI,EAAK,EACnBC,EAAKA,EAAIL,KAAKK,EAAK,EACnBL,KAAKO,IAAIN,EAAGC,EAAGC,EAAGC,EAAGC,EACxB,CACD,UAAAW,GACIrB,EAAOsB,KAAK,EACf,CACD,OAAAC,GACIlB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,GACrBP,KAAKmB,OAAOF,KAAK,EACpB,EAEE,MAAMG,iBAAuBC,GAAgB,IAAM,IAAIzB,ICjFxD0B,iBAAsB,IAAIC,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzFC,iBAAqB,IAAID,WAAeE,MAAM,IAAIR,KAAK,GAAGS,KAAI,CAACC,EAAGhB,IAAMA,KAE9E,IAAIiB,EAAO,CAACJ,GACRK,EAAO,gBAFgBL,EAAGE,KAAKf,IAAO,EAAIA,EAAI,GAAK,MAGvD,IAAK,IAAIA,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAImB,IAAK,CAACF,EAAMC,GACjBC,EAAEC,KAAKD,EAAEnB,GAAGe,KAAKM,GAAMV,EAAIU,MACnC,MAAMC,iBAAyB,CAC3B,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxDP,KAAKf,GAAM,IAAIY,WAAWZ,KACtBuB,iBAA0BN,EAAKF,KAAI,CAACS,EAAKxB,IAAMwB,EAAIT,KAAKI,GAAMG,EAAOtB,GAAGmB,OACxEM,iBAA0BP,EAAKH,KAAI,CAACS,EAAKxB,IAAMwB,EAAIT,KAAKI,GAAMG,EAAOtB,GAAGmB,OACxEO,iBAAqB,IAAI3C,YAAY,CACvC,EAAY,WAAY,WAAY,WAAY,aAE9C4C,iBAAqB,IAAI5C,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,IAG9CR,EAAO,CAACC,EAAMC,IAAWD,GAAQC,EAAUD,IAAU,GAAKC,EAEhE,SAASmD,EAAEC,EAAOC,EAAGC,EAAGC,GACpB,OAAc,IAAVH,EACOC,EAAIC,EAAIC,EACA,IAAVH,EACGC,EAAIC,GAAOD,EAAIE,EACR,IAAVH,GACGC,GAAKC,GAAKC,EACH,IAAVH,EACGC,EAAIE,EAAMD,GAAKC,EAEhBF,GAAKC,GAAKC,EACzB,CAEA,MAAMC,iBAAsB,IAAIlD,YAAY,IACrC,MAAMmD,UAAkBhD,EAC3B,WAAAC,GACIC,MAAM,GAAI,GAAI,GAAG,GACjBC,KAAK8C,GAAK,WACV9C,KAAK+C,IAAK,UACV/C,KAAKgD,IAAK,WACVhD,KAAKiD,GAAK,UACVjD,KAAKkD,IAAK,UACb,CACD,GAAA5C,GACI,MAAMwC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAOlD,KAC/B,MAAO,CAAC8C,EAAIC,EAAIC,EAAIC,EAAIC,EAC3B,CACD,GAAA3C,CAAIuC,EAAIC,EAAIC,EAAIC,EAAIC,GAChBlD,KAAK8C,GAAU,EAALA,EACV9C,KAAK+C,GAAU,EAALA,EACV/C,KAAKgD,GAAU,EAALA,EACVhD,KAAKiD,GAAU,EAALA,EACVjD,KAAKkD,GAAU,EAALA,CACb,CACD,OAAA1C,CAAQC,EAAMC,GACV,IAAK,IAAIC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EACnCkC,EAAIjC,GAAKF,EAAKG,UAAUF,GAAQ,GAEpC,IAAIyC,EAAe,EAAVnD,KAAK8C,GAAQM,EAAKD,EAAIE,EAAe,EAAVrD,KAAK+C,GAAQO,EAAKD,EAAIE,EAAe,EAAVvD,KAAKgD,GAAQQ,EAAKD,EAAIE,EAAe,EAAVzD,KAAKiD,GAAQS,EAAKD,EAAIE,EAAe,EAAV3D,KAAKkD,GAAQU,EAAKD,EAGvI,IAAK,IAAInB,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMqB,EAAS,EAAIrB,EACbsB,EAAMzB,EAAGG,GAAQuB,EAAMzB,EAAGE,GAC1BwB,EAAKpC,EAAKY,GAAQyB,EAAKpC,EAAKW,GAC5B0B,EAAKhC,EAAQM,GAAQ2B,EAAK/B,EAAQI,GACxC,IAAK,IAAI7B,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMyD,EAAMlF,EAAKiE,EAAKZ,EAAEC,EAAOa,EAAIE,EAAIE,GAAMb,EAAIoB,EAAGrD,IAAMmD,EAAKI,EAAGvD,IAAMgD,EAAM,EAC9ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfvE,EAAKqE,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CAC1D,CAED,IAAK,IAAIzD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM0D,EAAMnF,EAAKkE,EAAKb,EAAEsB,EAAQP,EAAIE,EAAIE,GAAMd,EAAIqB,EAAGtD,IAAMoD,EAAKI,EAAGxD,IAAMiD,EAAM,EAC/ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfxE,EAAKsE,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CAC1D,CACJ,CAEDrE,KAAKO,IAAKP,KAAK+C,GAAKQ,EAAKG,EAAM,EAAI1D,KAAKgD,GAAKS,EAAKG,EAAM,EAAI5D,KAAKiD,GAAKU,EAAKP,EAAM,EAAIpD,KAAKkD,GAAKC,EAAKG,EAAM,EAAItD,KAAK8C,GAAKO,EAAKG,EAAM,EACtI,CACD,UAAAxC,GACI4B,EAAI3B,KAAK,EACZ,CACD,OAAAC,GACIlB,KAAKsE,WAAY,EACjBtE,KAAKmB,OAAOF,KAAK,GACjBjB,KAAKO,IAAI,EAAG,EAAG,EAAG,EAAG,EACxB,EAME,MC1FMgE,EAAc,IAAIC,IAAIC,OAAOC,QAAQ,CAChDtD,OACAuD,SACAC,SACAC,SACAC,SACAC,WACAC,WACAC,yBDkFuC5D,GAAgB,IAAM,IAAIwB","x_google_ignoreList":[0,1]}

package/dist/lightweight/noble_hashes.mjs

@@ -1,11 +1,10 @@
-/*! OpenPGP.js v6.0.0-alpha.0 - 2023-12-12 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
+/*! OpenPGP.js v6.0.0-alpha.1.patch.0 - 2024-03-01 - this is LGPL licensed code, see LICENSE/our website https://openpgpjs.org/ for more information. */
 const globalThis = typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
 
 import { w as wrapConstructor, S as SHA2, g as sha224, s as sha256, a as sha384, d as sha512, i as sha3_256, j as sha3_512 } from './sha3.mjs';
 import './interface.mjs';
 import './native.interface.mjs';
 import './bn.interface.mjs';
-import './bn.mjs';
 
 // SHA1 was cryptographically broken.
 // It is still widely used in legacy apps. Don't use it for a new protocol.