@getalby/lightning-tools 8.0.0 → 8.1.1

package/dist/esm/402/x402.js

@@ -10,6 +10,313 @@ const buildX402PaymentSignature = (scheme, network, invoice, requirements) => {
     return btoa(unescape(encodeURIComponent(json)));
 };
 
+function bytes(b, ...lengths) {
+    if (!(b instanceof Uint8Array))
+        throw new Error('Expected Uint8Array');
+    if (lengths.length > 0 && !lengths.includes(b.length))
+        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);
+}
+function exists(instance, checkFinished = true) {
+    if (instance.destroyed)
+        throw new Error('Hash instance has been destroyed');
+    if (checkFinished && instance.finished)
+        throw new Error('Hash#digest() has already been called');
+}
+function output(out, instance) {
+    bytes(out);
+    const min = instance.outputLen;
+    if (out.length < min) {
+        throw new Error(`digestInto() expects output buffer of length at least ${min}`);
+    }
+}
+
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.
+// node.js versions earlier than v19 don't declare it in global scope.
+// For node.js, package.json#exports field mapping rewrites import
+// from `crypto` to `cryptoNode`, which imports native module.
+// Makes the utils un-importable in browsers without a bundler.
+// Once node.js 18 is deprecated, we can just drop the import.
+const u8a = (a) => a instanceof Uint8Array;
+// Cast array to view
+const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
+// The rotate right (circular right shift) operation for uint32
+const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);
+// big-endian hardware is rare. Just in case someone still decides to run hashes:
+// early-throw an error because we don't support BE yet.
+const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;
+if (!isLE)
+    throw new Error('Non little-endian hardware is not supported');
+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))
+        throw new Error('Uint8Array expected');
+    // pre-caching improves the speed 6x
+    let hex = '';
+    for (let i = 0; i < bytes.length; i++) {
+        hex += hexes[bytes[i]];
+    }
+    return hex;
+}
+/**
+ * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
+ */
+function utf8ToBytes(str) {
+    if (typeof str !== 'string')
+        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
+    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
+}
+/**
+ * Normalizes (non-hex) string or Uint8Array to Uint8Array.
+ * Warning: when Uint8Array is passed, it would NOT get copied.
+ * Keep in mind for future mutable operations.
+ */
+function toBytes(data) {
+    if (typeof data === 'string')
+        data = utf8ToBytes(data);
+    if (!u8a(data))
+        throw new Error(`expected Uint8Array, got ${typeof data}`);
+    return data;
+}
+// For runtime check if class implements interface
+class Hash {
+    // Safe version that clones internal state
+    clone() {
+        return this._cloneInto();
+    }
+}
+function wrapConstructor(hashCons) {
+    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
+    const tmp = hashCons();
+    hashC.outputLen = tmp.outputLen;
+    hashC.blockLen = tmp.blockLen;
+    hashC.create = () => hashCons();
+    return hashC;
+}
+
+// Polyfill for Safari 14
+function setBigUint64(view, byteOffset, value, isLE) {
+    if (typeof view.setBigUint64 === 'function')
+        return view.setBigUint64(byteOffset, value, isLE);
+    const _32n = BigInt(32);
+    const _u32_max = BigInt(0xffffffff);
+    const wh = Number((value >> _32n) & _u32_max);
+    const wl = Number(value & _u32_max);
+    const h = isLE ? 4 : 0;
+    const l = isLE ? 0 : 4;
+    view.setUint32(byteOffset + h, wh, isLE);
+    view.setUint32(byteOffset + l, wl, isLE);
+}
+// Base SHA2 class (RFC 6234)
+class SHA2 extends Hash {
+    constructor(blockLen, outputLen, padOffset, isLE) {
+        super();
+        this.blockLen = blockLen;
+        this.outputLen = outputLen;
+        this.padOffset = padOffset;
+        this.isLE = isLE;
+        this.finished = false;
+        this.length = 0;
+        this.pos = 0;
+        this.destroyed = false;
+        this.buffer = new Uint8Array(blockLen);
+        this.view = createView(this.buffer);
+    }
+    update(data) {
+        exists(this);
+        const { view, buffer, blockLen } = this;
+        data = toBytes(data);
+        const len = data.length;
+        for (let pos = 0; pos < len;) {
+            const take = Math.min(blockLen - this.pos, len - pos);
+            // Fast path: we have at least one block in input, cast it to view and process
+            if (take === blockLen) {
+                const dataView = createView(data);
+                for (; blockLen <= len - pos; pos += blockLen)
+                    this.process(dataView, pos);
+                continue;
+            }
+            buffer.set(data.subarray(pos, pos + take), this.pos);
+            this.pos += take;
+            pos += take;
+            if (this.pos === blockLen) {
+                this.process(view, 0);
+                this.pos = 0;
+            }
+        }
+        this.length += data.length;
+        this.roundClean();
+        return this;
+    }
+    digestInto(out) {
+        exists(this);
+        output(out, this);
+        this.finished = true;
+        // Padding
+        // We can avoid allocation of buffer for padding completely if it
+        // was previously not allocated here. But it won't change performance.
+        const { buffer, view, blockLen, isLE } = this;
+        let { pos } = this;
+        // append the bit '1' to the message
+        buffer[pos++] = 0b10000000;
+        this.buffer.subarray(pos).fill(0);
+        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again
+        if (this.padOffset > blockLen - pos) {
+            this.process(view, 0);
+            pos = 0;
+        }
+        // Pad until full block byte with zeros
+        for (let i = pos; i < blockLen; i++)
+            buffer[i] = 0;
+        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that
+        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.
+        // So we just write lowest 64 bits of that value.
+        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
+        this.process(view, 0);
+        const oview = createView(out);
+        const len = this.outputLen;
+        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT
+        if (len % 4)
+            throw new Error('_sha2: outputLen should be aligned to 32bit');
+        const outLen = len / 4;
+        const state = this.get();
+        if (outLen > state.length)
+            throw new Error('_sha2: outputLen bigger than state');
+        for (let i = 0; i < outLen; i++)
+            oview.setUint32(4 * i, state[i], isLE);
+    }
+    digest() {
+        const { buffer, outputLen } = this;
+        this.digestInto(buffer);
+        const res = buffer.slice(0, outputLen);
+        this.destroy();
+        return res;
+    }
+    _cloneInto(to) {
+        to || (to = new this.constructor());
+        to.set(...this.get());
+        const { blockLen, buffer, length, finished, destroyed, pos } = this;
+        to.length = length;
+        to.pos = pos;
+        to.finished = finished;
+        to.destroyed = destroyed;
+        if (length % blockLen)
+            to.buffer.set(buffer);
+        return to;
+    }
+}
+
+// SHA2-256 need to try 2^128 hashes to execute birthday attack.
+// BTC network is doing 2^67 hashes/sec as per early 2023.
+// Choice: a ? b : c
+const Chi = (a, b, c) => (a & b) ^ (~a & c);
+// Majority function, true if any two inpust is true
+const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);
+// Round constants:
+// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)
+// prettier-ignore
+const SHA256_K = /* @__PURE__ */ new Uint32Array([
+    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
+]);
+// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):
+// prettier-ignore
+const IV = /* @__PURE__ */ new Uint32Array([
+    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
+]);
+// Temporary buffer, not used to store anything between runs
+// Named this way because it matches specification.
+const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
+class SHA256 extends SHA2 {
+    constructor() {
+        super(64, 32, 8, false);
+        // We cannot use array here since array allows indexing by variable
+        // which means optimizer/compiler cannot use registers.
+        this.A = IV[0] | 0;
+        this.B = IV[1] | 0;
+        this.C = IV[2] | 0;
+        this.D = IV[3] | 0;
+        this.E = IV[4] | 0;
+        this.F = IV[5] | 0;
+        this.G = IV[6] | 0;
+        this.H = IV[7] | 0;
+    }
+    get() {
+        const { A, B, C, D, E, F, G, H } = this;
+        return [A, B, C, D, E, F, G, H];
+    }
+    // prettier-ignore
+    set(A, B, C, D, E, F, G, H) {
+        this.A = A | 0;
+        this.B = B | 0;
+        this.C = C | 0;
+        this.D = D | 0;
+        this.E = E | 0;
+        this.F = F | 0;
+        this.G = G | 0;
+        this.H = H | 0;
+    }
+    process(view, offset) {
+        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array
+        for (let i = 0; i < 16; i++, offset += 4)
+            SHA256_W[i] = view.getUint32(offset, false);
+        for (let i = 16; i < 64; i++) {
+            const W15 = SHA256_W[i - 15];
+            const W2 = SHA256_W[i - 2];
+            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);
+            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);
+            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;
+        }
+        // Compression function main loop, 64 rounds
+        let { A, B, C, D, E, F, G, H } = this;
+        for (let i = 0; i < 64; i++) {
+            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
+            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
+            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);
+            const T2 = (sigma0 + Maj(A, B, C)) | 0;
+            H = G;
+            G = F;
+            F = E;
+            E = (D + T1) | 0;
+            D = C;
+            C = B;
+            B = A;
+            A = (T1 + T2) | 0;
+        }
+        // Add the compressed chunk to the current hash value
+        A = (A + this.A) | 0;
+        B = (B + this.B) | 0;
+        C = (C + this.C) | 0;
+        D = (D + this.D) | 0;
+        E = (E + this.E) | 0;
+        F = (F + this.F) | 0;
+        G = (G + this.G) | 0;
+        H = (H + this.H) | 0;
+        this.set(A, B, C, D, E, F, G, H);
+    }
+    roundClean() {
+        SHA256_W.fill(0);
+    }
+    destroy() {
+        this.set(0, 0, 0, 0, 0, 0, 0, 0);
+        this.buffer.fill(0);
+    }
+}
+/**
+ * SHA2-256 hash function
+ * @param message - data that would be hashed
+ */
+const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());
+
 var lib = {};
 
 var hasRequiredLib;
@@ -677,515 +984,221 @@ function requireBolt11 () {
 	    letters: 'ln'
 	  });
 
-	  // "bc" section
-	  const bech32Prefix = prefixMatches[1];
-	  let coinNetwork;
-	  if (!network) {
-	    switch (bech32Prefix) {
-	      case DEFAULTNETWORK.bech32:
-	        coinNetwork = DEFAULTNETWORK;
-	        break
-	      case TESTNETWORK.bech32:
-	        coinNetwork = TESTNETWORK;
-	        break
-	      case SIGNETNETWORK.bech32:
-	        coinNetwork = SIGNETNETWORK;
-	        break
-	      case REGTESTNETWORK.bech32:
-	        coinNetwork = REGTESTNETWORK;
-	        break
-	      case SIMNETWORK.bech32:
-	        coinNetwork = SIMNETWORK;
-	        break
-	    }
-	  } else {
-	    if (
-	      network.bech32 === undefined ||
-	      network.pubKeyHash === undefined ||
-	      network.scriptHash === undefined ||
-	      !Array.isArray(network.validWitnessVersions)
-	    )
-	      throw new Error('Invalid network')
-	    coinNetwork = network;
-	  }
-	  if (!coinNetwork || coinNetwork.bech32 !== bech32Prefix) {
-	    throw new Error('Unknown coin bech32 prefix')
-	  }
-	  sections.push({
-	    name: 'coin_network',
-	    letters: bech32Prefix,
-	    value: coinNetwork
-	  });
-
-	  // amount section
-	  const value = prefixMatches[2];
-	  let millisatoshis;
-	  if (value) {
-	    const divisor = prefixMatches[3];
-	    millisatoshis = hrpToMillisat(value + divisor, true);
-	    sections.push({
-	      name: 'amount',
-	      letters: prefixMatches[2] + prefixMatches[3],
-	      value: millisatoshis
-	    });
-	  } else {
-	    millisatoshis = null;
-	  }
-
-	  // "1" separator
-	  sections.push({
-	    name: 'separator',
-	    letters: '1'
-	  });
-
-	  // timestamp
-	  const timestamp = wordsToIntBE(words.slice(0, 7));
-	  words = words.slice(7); // trim off the left 7 words
-	  sections.push({
-	    name: 'timestamp',
-	    letters: letters.slice(0, 7),
-	    value: timestamp
-	  });
-	  letters = letters.slice(7);
-
-	  let tagName, parser, tagLength, tagWords;
-	  // we have no tag count to go on, so just keep hacking off words
-	  // until we have none.
-	  while (words.length > 0) {
-	    const tagCode = words[0].toString();
-	    tagName = TAGNAMES[tagCode] || 'unknown_tag';
-	    parser = TAGPARSERS[tagCode] || getUnknownParser(tagCode);
-	    words = words.slice(1);
-
-	    tagLength = wordsToIntBE(words.slice(0, 2));
-	    words = words.slice(2);
-
-	    tagWords = words.slice(0, tagLength);
-	    words = words.slice(tagLength);
-
-	    sections.push({
-	      name: tagName,
-	      tag: letters[0],
-	      letters: letters.slice(0, 1 + 2 + tagLength),
-	      value: parser(tagWords) // see: parsers for more comments
-	    });
-	    letters = letters.slice(1 + 2 + tagLength);
-	  }
-
-	  // signature
-	  sections.push({
-	    name: 'signature',
-	    letters: letters.slice(0, 104),
-	    value: hex.encode(bech32.fromWordsUnsafe(sigWords))
-	  });
-	  letters = letters.slice(104);
-
-	  // checksum
-	  sections.push({
-	    name: 'checksum',
-	    letters: letters
-	  });
-
-	  let result = {
-	    paymentRequest,
-	    sections,
-
-	    get expiry() {
-	      let exp = sections.find(s => s.name === 'expiry');
-	      if (exp) return getValue('timestamp') + exp.value
-	    },
-
-	    get route_hints() {
-	      return sections.filter(s => s.name === 'route_hint').map(s => s.value)
-	    }
-	  };
-
-	  for (let name in TAGCODES) {
-	    if (name === 'route_hint') {
-	      // route hints can be multiple, so this won't work for them
-	      continue
-	    }
-
-	    Object.defineProperty(result, name, {
-	      get() {
-	        return getValue(name)
-	      }
-	    });
-	  }
-
-	  return result
-
-	  function getValue(name) {
-	    let section = sections.find(s => s.name === name);
-	    return section ? section.value : undefined
-	  }
-	}
-
-	bolt11 = {
-	  decode,
-	  hrpToMillisat
-	};
-	return bolt11;
-}
-
-var bolt11Exports = requireBolt11();
-
-// from https://stackoverflow.com/a/50868276
-const fromHexString = (hexString) => Uint8Array.from(hexString.match(/.{1,2}/g).map((byte) => parseInt(byte, 16)));
-const decodeInvoice = (paymentRequest) => {
-    if (!paymentRequest)
-        return null;
-    try {
-        const decoded = bolt11Exports.decode(paymentRequest);
-        if (!decoded || !decoded.sections)
-            return null;
-        const hashTag = decoded.sections.find((value) => value.name === "payment_hash");
-        if (hashTag?.name !== "payment_hash" || !hashTag.value)
-            return null;
-        const paymentHash = hashTag.value;
-        let satoshi = 0;
-        let millisatoshi = 0;
-        let amountRaw = "0";
-        const amountTag = decoded.sections.find((value) => value.name === "amount");
-        if (amountTag?.name === "amount" && amountTag.value) {
-            amountRaw = amountTag.value;
-            millisatoshi = parseInt(amountTag.value);
-            satoshi = parseInt(amountTag.value) / 1000; // millisats
-        }
-        const timestampTag = decoded.sections.find((value) => value.name === "timestamp");
-        if (timestampTag?.name !== "timestamp" || !timestampTag.value)
-            return null;
-        const timestamp = timestampTag.value;
-        let expiry;
-        const expiryTag = decoded.sections.find((value) => value.name === "expiry");
-        if (expiryTag?.name === "expiry") {
-            expiry = expiryTag.value;
-        }
-        const descriptionTag = decoded.sections.find((value) => value.name === "description");
-        const description = descriptionTag?.name === "description"
-            ? descriptionTag?.value
-            : undefined;
-        return {
-            paymentHash,
-            satoshi,
-            millisatoshi,
-            amountRaw,
-            timestamp,
-            expiry,
-            description,
-        };
-    }
-    catch {
-        return null;
-    }
-};
+	  // "bc" section
+	  const bech32Prefix = prefixMatches[1];
+	  let coinNetwork;
+	  if (!network) {
+	    switch (bech32Prefix) {
+	      case DEFAULTNETWORK.bech32:
+	        coinNetwork = DEFAULTNETWORK;
+	        break
+	      case TESTNETWORK.bech32:
+	        coinNetwork = TESTNETWORK;
+	        break
+	      case SIGNETNETWORK.bech32:
+	        coinNetwork = SIGNETNETWORK;
+	        break
+	      case REGTESTNETWORK.bech32:
+	        coinNetwork = REGTESTNETWORK;
+	        break
+	      case SIMNETWORK.bech32:
+	        coinNetwork = SIMNETWORK;
+	        break
+	    }
+	  } else {
+	    if (
+	      network.bech32 === undefined ||
+	      network.pubKeyHash === undefined ||
+	      network.scriptHash === undefined ||
+	      !Array.isArray(network.validWitnessVersions)
+	    )
+	      throw new Error('Invalid network')
+	    coinNetwork = network;
+	  }
+	  if (!coinNetwork || coinNetwork.bech32 !== bech32Prefix) {
+	    throw new Error('Unknown coin bech32 prefix')
+	  }
+	  sections.push({
+	    name: 'coin_network',
+	    letters: bech32Prefix,
+	    value: coinNetwork
+	  });
 
-function bytes(b, ...lengths) {
-    if (!(b instanceof Uint8Array))
-        throw new Error('Expected Uint8Array');
-    if (lengths.length > 0 && !lengths.includes(b.length))
-        throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);
-}
-function exists(instance, checkFinished = true) {
-    if (instance.destroyed)
-        throw new Error('Hash instance has been destroyed');
-    if (checkFinished && instance.finished)
-        throw new Error('Hash#digest() has already been called');
-}
-function output(out, instance) {
-    bytes(out);
-    const min = instance.outputLen;
-    if (out.length < min) {
-        throw new Error(`digestInto() expects output buffer of length at least ${min}`);
-    }
-}
+	  // amount section
+	  const value = prefixMatches[2];
+	  let millisatoshis;
+	  if (value) {
+	    const divisor = prefixMatches[3];
+	    millisatoshis = hrpToMillisat(value + divisor, true);
+	    sections.push({
+	      name: 'amount',
+	      letters: prefixMatches[2] + prefixMatches[3],
+	      value: millisatoshis
+	    });
+	  } else {
+	    millisatoshis = null;
+	  }
 
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.
-// node.js versions earlier than v19 don't declare it in global scope.
-// For node.js, package.json#exports field mapping rewrites import
-// from `crypto` to `cryptoNode`, which imports native module.
-// Makes the utils un-importable in browsers without a bundler.
-// Once node.js 18 is deprecated, we can just drop the import.
-const u8a = (a) => a instanceof Uint8Array;
-// Cast array to view
-const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);
-// The rotate right (circular right shift) operation for uint32
-const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);
-// big-endian hardware is rare. Just in case someone still decides to run hashes:
-// early-throw an error because we don't support BE yet.
-const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;
-if (!isLE)
-    throw new Error('Non little-endian hardware is not supported');
-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))
-        throw new Error('Uint8Array expected');
-    // pre-caching improves the speed 6x
-    let hex = '';
-    for (let i = 0; i < bytes.length; i++) {
-        hex += hexes[bytes[i]];
-    }
-    return hex;
-}
-/**
- * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])
- */
-function utf8ToBytes(str) {
-    if (typeof str !== 'string')
-        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);
-    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809
-}
-/**
- * Normalizes (non-hex) string or Uint8Array to Uint8Array.
- * Warning: when Uint8Array is passed, it would NOT get copied.
- * Keep in mind for future mutable operations.
- */
-function toBytes(data) {
-    if (typeof data === 'string')
-        data = utf8ToBytes(data);
-    if (!u8a(data))
-        throw new Error(`expected Uint8Array, got ${typeof data}`);
-    return data;
-}
-// For runtime check if class implements interface
-class Hash {
-    // Safe version that clones internal state
-    clone() {
-        return this._cloneInto();
-    }
-}
-function wrapConstructor(hashCons) {
-    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();
-    const tmp = hashCons();
-    hashC.outputLen = tmp.outputLen;
-    hashC.blockLen = tmp.blockLen;
-    hashC.create = () => hashCons();
-    return hashC;
-}
+	  // "1" separator
+	  sections.push({
+	    name: 'separator',
+	    letters: '1'
+	  });
 
-// Polyfill for Safari 14
-function setBigUint64(view, byteOffset, value, isLE) {
-    if (typeof view.setBigUint64 === 'function')
-        return view.setBigUint64(byteOffset, value, isLE);
-    const _32n = BigInt(32);
-    const _u32_max = BigInt(0xffffffff);
-    const wh = Number((value >> _32n) & _u32_max);
-    const wl = Number(value & _u32_max);
-    const h = isLE ? 4 : 0;
-    const l = isLE ? 0 : 4;
-    view.setUint32(byteOffset + h, wh, isLE);
-    view.setUint32(byteOffset + l, wl, isLE);
-}
-// Base SHA2 class (RFC 6234)
-class SHA2 extends Hash {
-    constructor(blockLen, outputLen, padOffset, isLE) {
-        super();
-        this.blockLen = blockLen;
-        this.outputLen = outputLen;
-        this.padOffset = padOffset;
-        this.isLE = isLE;
-        this.finished = false;
-        this.length = 0;
-        this.pos = 0;
-        this.destroyed = false;
-        this.buffer = new Uint8Array(blockLen);
-        this.view = createView(this.buffer);
-    }
-    update(data) {
-        exists(this);
-        const { view, buffer, blockLen } = this;
-        data = toBytes(data);
-        const len = data.length;
-        for (let pos = 0; pos < len;) {
-            const take = Math.min(blockLen - this.pos, len - pos);
-            // Fast path: we have at least one block in input, cast it to view and process
-            if (take === blockLen) {
-                const dataView = createView(data);
-                for (; blockLen <= len - pos; pos += blockLen)
-                    this.process(dataView, pos);
-                continue;
-            }
-            buffer.set(data.subarray(pos, pos + take), this.pos);
-            this.pos += take;
-            pos += take;
-            if (this.pos === blockLen) {
-                this.process(view, 0);
-                this.pos = 0;
-            }
-        }
-        this.length += data.length;
-        this.roundClean();
-        return this;
-    }
-    digestInto(out) {
-        exists(this);
-        output(out, this);
-        this.finished = true;
-        // Padding
-        // We can avoid allocation of buffer for padding completely if it
-        // was previously not allocated here. But it won't change performance.
-        const { buffer, view, blockLen, isLE } = this;
-        let { pos } = this;
-        // append the bit '1' to the message
-        buffer[pos++] = 0b10000000;
-        this.buffer.subarray(pos).fill(0);
-        // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again
-        if (this.padOffset > blockLen - pos) {
-            this.process(view, 0);
-            pos = 0;
-        }
-        // Pad until full block byte with zeros
-        for (let i = pos; i < blockLen; i++)
-            buffer[i] = 0;
-        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that
-        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.
-        // So we just write lowest 64 bits of that value.
-        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);
-        this.process(view, 0);
-        const oview = createView(out);
-        const len = this.outputLen;
-        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT
-        if (len % 4)
-            throw new Error('_sha2: outputLen should be aligned to 32bit');
-        const outLen = len / 4;
-        const state = this.get();
-        if (outLen > state.length)
-            throw new Error('_sha2: outputLen bigger than state');
-        for (let i = 0; i < outLen; i++)
-            oview.setUint32(4 * i, state[i], isLE);
-    }
-    digest() {
-        const { buffer, outputLen } = this;
-        this.digestInto(buffer);
-        const res = buffer.slice(0, outputLen);
-        this.destroy();
-        return res;
-    }
-    _cloneInto(to) {
-        to || (to = new this.constructor());
-        to.set(...this.get());
-        const { blockLen, buffer, length, finished, destroyed, pos } = this;
-        to.length = length;
-        to.pos = pos;
-        to.finished = finished;
-        to.destroyed = destroyed;
-        if (length % blockLen)
-            to.buffer.set(buffer);
-        return to;
-    }
+	  // timestamp
+	  const timestamp = wordsToIntBE(words.slice(0, 7));
+	  words = words.slice(7); // trim off the left 7 words
+	  sections.push({
+	    name: 'timestamp',
+	    letters: letters.slice(0, 7),
+	    value: timestamp
+	  });
+	  letters = letters.slice(7);
+
+	  let tagName, parser, tagLength, tagWords;
+	  // we have no tag count to go on, so just keep hacking off words
+	  // until we have none.
+	  while (words.length > 0) {
+	    const tagCode = words[0].toString();
+	    tagName = TAGNAMES[tagCode] || 'unknown_tag';
+	    parser = TAGPARSERS[tagCode] || getUnknownParser(tagCode);
+	    words = words.slice(1);
+
+	    tagLength = wordsToIntBE(words.slice(0, 2));
+	    words = words.slice(2);
+
+	    tagWords = words.slice(0, tagLength);
+	    words = words.slice(tagLength);
+
+	    sections.push({
+	      name: tagName,
+	      tag: letters[0],
+	      letters: letters.slice(0, 1 + 2 + tagLength),
+	      value: parser(tagWords) // see: parsers for more comments
+	    });
+	    letters = letters.slice(1 + 2 + tagLength);
+	  }
+
+	  // signature
+	  sections.push({
+	    name: 'signature',
+	    letters: letters.slice(0, 104),
+	    value: hex.encode(bech32.fromWordsUnsafe(sigWords))
+	  });
+	  letters = letters.slice(104);
+
+	  // checksum
+	  sections.push({
+	    name: 'checksum',
+	    letters: letters
+	  });
+
+	  let result = {
+	    paymentRequest,
+	    sections,
+
+	    get expiry() {
+	      let exp = sections.find(s => s.name === 'expiry');
+	      if (exp) return getValue('timestamp') + exp.value
+	    },
+
+	    get route_hints() {
+	      return sections.filter(s => s.name === 'route_hint').map(s => s.value)
+	    }
+	  };
+
+	  for (let name in TAGCODES) {
+	    if (name === 'route_hint') {
+	      // route hints can be multiple, so this won't work for them
+	      continue
+	    }
+
+	    Object.defineProperty(result, name, {
+	      get() {
+	        return getValue(name)
+	      }
+	    });
+	  }
+
+	  return result
+
+	  function getValue(name) {
+	    let section = sections.find(s => s.name === name);
+	    return section ? section.value : undefined
+	  }
+	}
+
+	bolt11 = {
+	  decode,
+	  hrpToMillisat
+	};
+	return bolt11;
 }
 
-// SHA2-256 need to try 2^128 hashes to execute birthday attack.
-// BTC network is doing 2^67 hashes/sec as per early 2023.
-// Choice: a ? b : c
-const Chi = (a, b, c) => (a & b) ^ (~a & c);
-// Majority function, true if any two inpust is true
-const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);
-// Round constants:
-// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)
-// prettier-ignore
-const SHA256_K = /* @__PURE__ */ new Uint32Array([
-    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
-    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
-    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
-    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
-    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
-    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
-    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
-    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
-]);
-// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):
-// prettier-ignore
-const IV = /* @__PURE__ */ new Uint32Array([
-    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
-]);
-// Temporary buffer, not used to store anything between runs
-// Named this way because it matches specification.
-const SHA256_W = /* @__PURE__ */ new Uint32Array(64);
-class SHA256 extends SHA2 {
-    constructor() {
-        super(64, 32, 8, false);
-        // We cannot use array here since array allows indexing by variable
-        // which means optimizer/compiler cannot use registers.
-        this.A = IV[0] | 0;
-        this.B = IV[1] | 0;
-        this.C = IV[2] | 0;
-        this.D = IV[3] | 0;
-        this.E = IV[4] | 0;
-        this.F = IV[5] | 0;
-        this.G = IV[6] | 0;
-        this.H = IV[7] | 0;
-    }
-    get() {
-        const { A, B, C, D, E, F, G, H } = this;
-        return [A, B, C, D, E, F, G, H];
-    }
-    // prettier-ignore
-    set(A, B, C, D, E, F, G, H) {
-        this.A = A | 0;
-        this.B = B | 0;
-        this.C = C | 0;
-        this.D = D | 0;
-        this.E = E | 0;
-        this.F = F | 0;
-        this.G = G | 0;
-        this.H = H | 0;
-    }
-    process(view, offset) {
-        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array
-        for (let i = 0; i < 16; i++, offset += 4)
-            SHA256_W[i] = view.getUint32(offset, false);
-        for (let i = 16; i < 64; i++) {
-            const W15 = SHA256_W[i - 15];
-            const W2 = SHA256_W[i - 2];
-            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);
-            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);
-            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;
+var bolt11Exports = requireBolt11();
+
+// from https://stackoverflow.com/a/50868276
+const fromHexString = (hexString) => Uint8Array.from(hexString.match(/.{1,2}/g).map((byte) => parseInt(byte, 16)));
+const decodeInvoice = (paymentRequest) => {
+    if (!paymentRequest)
+        return null;
+    try {
+        const decoded = bolt11Exports.decode(paymentRequest);
+        if (!decoded || !decoded.sections)
+            return null;
+        const hashTag = decoded.sections.find((value) => value.name === "payment_hash");
+        if (hashTag?.name !== "payment_hash" || !hashTag.value)
+            return null;
+        const paymentHash = hashTag.value;
+        let satoshi = 0;
+        let millisatoshi = 0;
+        let amountRaw = "0";
+        const amountTag = decoded.sections.find((value) => value.name === "amount");
+        if (amountTag?.name === "amount" && amountTag.value) {
+            amountRaw = amountTag.value;
+            millisatoshi = parseInt(amountTag.value);
+            satoshi = parseInt(amountTag.value) / 1000; // millisats
         }
-        // Compression function main loop, 64 rounds
-        let { A, B, C, D, E, F, G, H } = this;
-        for (let i = 0; i < 64; i++) {
-            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);
-            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;
-            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);
-            const T2 = (sigma0 + Maj(A, B, C)) | 0;
-            H = G;
-            G = F;
-            F = E;
-            E = (D + T1) | 0;
-            D = C;
-            C = B;
-            B = A;
-            A = (T1 + T2) | 0;
+        const timestampTag = decoded.sections.find((value) => value.name === "timestamp");
+        if (timestampTag?.name !== "timestamp" || !timestampTag.value)
+            return null;
+        const timestamp = timestampTag.value;
+        let expiry;
+        const expiryTag = decoded.sections.find((value) => value.name === "expiry");
+        if (expiryTag?.name === "expiry") {
+            expiry = expiryTag.value;
         }
-        // Add the compressed chunk to the current hash value
-        A = (A + this.A) | 0;
-        B = (B + this.B) | 0;
-        C = (C + this.C) | 0;
-        D = (D + this.D) | 0;
-        E = (E + this.E) | 0;
-        F = (F + this.F) | 0;
-        G = (G + this.G) | 0;
-        H = (H + this.H) | 0;
-        this.set(A, B, C, D, E, F, G, H);
+        const descriptionTag = decoded.sections.find((value) => value.name === "description");
+        const description = descriptionTag?.name === "description"
+            ? descriptionTag?.value
+            : undefined;
+        return {
+            paymentHash,
+            satoshi,
+            millisatoshi,
+            amountRaw,
+            timestamp,
+            expiry,
+            description,
+        };
     }
-    roundClean() {
-        SHA256_W.fill(0);
+    catch {
+        return null;
     }
-    destroy() {
-        this.set(0, 0, 0, 0, 0, 0, 0, 0);
-        this.buffer.fill(0);
+};
+function validatePreimage(preimage, paymentHash) {
+    try {
+        if (!/^[0-9a-fA-F]{64}$/.test(preimage))
+            return false;
+        if (!/^[0-9a-fA-F]{64}$/.test(paymentHash))
+            return false;
+        const preimageHash = bytesToHex(sha256(fromHexString(preimage)));
+        return paymentHash === preimageHash;
+    }
+    catch {
+        return false;
     }
 }
-/**
- * SHA2-256 hash function
- * @param message - data that would be hashed
- */
-const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());
 
 class Invoice {
     constructor(args) {
@@ -1225,13 +1238,7 @@ class Invoice {
     validatePreimage(preimage) {
         if (!preimage || !this.paymentHash)
             return false;
-        try {
-            const preimageHash = bytesToHex(sha256(fromHexString(preimage)));
-            return this.paymentHash === preimageHash;
-        }
-        catch {
-            return false;
-        }
+        return validatePreimage(preimage, this.paymentHash);
     }
     async verifyPayment() {
         try {
@@ -1262,7 +1269,7 @@ class Invoice {
     }
 }
 
-const handleX402Payment = async (x402Header, url, fetchArgs, headers, wallet) => {
+const decodeX402Header = (x402Header) => {
     let parsed;
     try {
         parsed = JSON.parse(decodeURIComponent(escape(atob(x402Header))));
@@ -1273,9 +1280,31 @@ const handleX402Payment = async (x402Header, url, fetchArgs, headers, wallet) =>
     if (!Array.isArray(parsed.accepts) || parsed.accepts.length === 0) {
         throw new Error("x402: PAYMENT-REQUIRED header contains no payment options");
     }
-    const requirements = parsed.accepts.find((e) => {
-        return e.extra?.paymentMethod === "lightning";
-    });
+    return { accepts: parsed.accepts };
+};
+/**
+ * Probe a PAYMENT-REQUIRED header for a lightning-payable offer without
+ * throwing. Returns the matching requirements, or null if the header has no
+ * lightning entry (e.g. USDC-only endpoints) or is malformed. Used by the
+ * top-level fetch402 dispatcher to decide whether to attempt payment or hand
+ * the 402 back to the caller.
+ */
+const findX402LightningRequirements = (x402Header) => {
+    let accepts;
+    try {
+        ({ accepts } = decodeX402Header(x402Header));
+    }
+    catch (_) {
+        return null;
+    }
+    const requirements = accepts.find((e) => e?.extra?.paymentMethod === "lightning");
+    if (!requirements?.extra?.invoice)
+        return null;
+    return requirements;
+};
+const handleX402Payment = async (x402Header, url, fetchArgs, headers, wallet) => {
+    const { accepts } = decodeX402Header(x402Header);
+    const requirements = accepts.find((e) => e?.extra?.paymentMethod === "lightning");
     if (!requirements) {
         throw new Error("x402: unsupported x402 network, only Bitcoin lightning network is supported.");
     }
@@ -1307,5 +1336,5 @@ const fetchWithX402 = async (url, fetchArgs, options) => {
     return handleX402Payment(header, url, fetchArgs, headers, wallet);
 };
 
-export { fetchWithX402 };
+export { fetchWithX402, findX402LightningRequirements };
 //# sourceMappingURL=x402.js.map