quantum-coin-js-sdk 2.0.1 → 2.1.0

package/example/node_modules/quantumcoin/src/abi/js-abi-coder.js

@@ -1,538 +0,0 @@
-/**
- * @fileoverview Pure-JS ABI encoder/decoder (Solidity ABI compatible).
- *
- * This exists as a fallback for ABI surfaces that `quantum-coin-js-sdk` does not
- * currently handle correctly (notably: tuples/structs and complex nested types).
- *
- * Notes:
- * - QuantumCoin addresses are 32 bytes (not 20).
- * - Integers are encoded as 32-byte words (big-endian), with range enforcement.
- */
-
-const { makeError } = require("../errors");
-const { normalizeHex, strip0x, arrayify, bytesToHex, utf8ToBytes, bytesToUtf8 } = require("../internal/hex");
-const { id } = require("../utils/hashing");
-
-const MAX_ABI_DEPTH = 16;
-
-function _isArrayType(type) {
-  return typeof type === "string" && type.endsWith("]");
-}
-
-function _arrayInnerType(type) {
-  return type.slice(0, type.lastIndexOf("["));
-}
-
-function _arrayBracket(type) {
-  return type.slice(type.lastIndexOf("[") + 1, type.length - 1); // "" for dynamic
-}
-
-function _isDynamicArray(type) {
-  return _isArrayType(type) && _arrayBracket(type) === "";
-}
-
-function _isFixedArray(type) {
-  return _isArrayType(type) && _arrayBracket(type) !== "";
-}
-
-function _fixedArrayLength(type) {
-  const n = Number(_arrayBracket(type));
-  return Number.isFinite(n) ? n : 0;
-}
-
-function _isBytesN(type) {
-  return /^bytes(\d+)$/.test(type);
-}
-
-function _bytesNLen(type) {
-  const m = type.match(/^bytes(\d+)$/);
-  const n = m ? Number(m[1]) : 0;
-  return Number.isFinite(n) ? n : 0;
-}
-
-function _isUint(type) {
-  return type === "uint" || /^uint(\d+)$/.test(type);
-}
-
-function _isInt(type) {
-  return type === "int" || /^int(\d+)$/.test(type);
-}
-
-function _intBits(type) {
-  if (type === "uint" || type === "int") return 256;
-  const m = type.match(/^(u?int)(\d+)$/);
-  const n = m ? Number(m[2]) : 0;
-  return Number.isFinite(n) && n > 0 ? n : 256;
-}
-
-function _isDynamicType(param) {
-  const type = String(param && param.type ? param.type : "");
-  if (_isArrayType(type)) {
-    const innerParam = { ...(param || {}), type: _arrayInnerType(type) };
-    return _isDynamicArray(type) || _isDynamicType(innerParam);
-  }
-  if (type === "string" || type === "bytes") return true;
-  if (type === "tuple") {
-    const comps = Array.isArray(param.components) ? param.components : [];
-    return comps.some(_isDynamicType);
-  }
-  return false;
-}
-
-function _staticWords(param) {
-  const type = String(param && param.type ? param.type : "");
-  if (_isDynamicType(param)) return 1; // head word is offset
-  if (_isArrayType(type)) {
-    const innerParam = { ...(param || {}), type: _arrayInnerType(type) };
-    if (_isFixedArray(type)) return _fixedArrayLength(type) * _staticWords(innerParam);
-    // dynamic arrays are dynamic types (handled above)
-  }
-  if (type === "tuple") {
-    const comps = Array.isArray(param.components) ? param.components : [];
-    return comps.reduce((a, c) => a + _staticWords(c), 0);
-  }
-  // elementary static types => 1 word
-  return 1;
-}
-
-function _padRightTo32(bytes) {
-  const pad = (32 - (bytes.length % 32)) % 32;
-  if (pad === 0) return bytes;
-  const out = new Uint8Array(bytes.length + pad);
-  out.set(bytes, 0);
-  return out;
-}
-
-function _concat(parts) {
-  const len = parts.reduce((a, b) => a + b.length, 0);
-  const out = new Uint8Array(len);
-  let off = 0;
-  for (const p of parts) {
-    out.set(p, off);
-    off += p.length;
-  }
-  return out;
-}
-
-function _u256ToWord(bi) {
-  let x = bi;
-  if (x < 0n) throw new Error("uint must be non-negative");
-  if (x >= (1n << 256n)) throw makeError("value exceeds uint256", "INVALID_ARGUMENT", { value: x.toString() });
-  let hex = x.toString(16);
-  hex = hex.padStart(64, "0");
-  return arrayify("0x" + hex);
-}
-
-function _checkUintRange(bi, bits) {
-  const b = BigInt(bits);
-  const max = 1n << b;
-  if (bi < 0n || bi >= max) {
-    throw makeError("uint value out of range", "INVALID_ARGUMENT", { value: bi.toString(), bits });
-  }
-}
-
-function _checkIntRange(bi, bits) {
-  const b = BigInt(bits);
-  const min = -(1n << (b - 1n));
-  const max = (1n << (b - 1n)) - 1n;
-  if (bi < min || bi > max) {
-    throw makeError("int value out of range", "INVALID_ARGUMENT", { value: bi.toString(), bits });
-  }
-}
-
-function _encodeIntWord(bi, bits) {
-  // Solidity ABI sign-extends int<M> to 256 bits.
-  _checkIntRange(bi, bits);
-  const mod256 = 1n << 256n;
-  const x = bi < 0n ? mod256 + bi : bi;
-  return _u256ToWord(x);
-}
-
-function _asBigInt(value) {
-  if (typeof value === "bigint") return value;
-  if (typeof value === "number") {
-    if (!Number.isFinite(value)) throw makeError("invalid number", "INVALID_ARGUMENT", { value });
-    return BigInt(Math.trunc(value));
-  }
-  if (typeof value === "string") {
-    const s = value.trim();
-    if (/^0x[0-9a-fA-F]+$/.test(s)) return BigInt(s);
-    if (/^-?\d+$/.test(s)) return BigInt(s);
-  }
-  throw makeError("invalid bigint-ish value", "INVALID_ARGUMENT", { value });
-}
-
-function _encodeAddress(value) {
-  const h = normalizeHex(String(value));
-  const b = arrayify(h);
-  if (b.length > 32) throw makeError("address too long", "INVALID_ARGUMENT", { value });
-  // Left-pad to 32 bytes.
-  const out = new Uint8Array(32);
-  out.set(b, 32 - b.length);
-  return out;
-}
-
-function _encodeFixedBytes(type, value) {
-  const n = _bytesNLen(type);
-  const b = arrayify(value);
-  if (b.length !== n) throw makeError("invalid fixed bytes length", "INVALID_ARGUMENT", { type, length: b.length });
-  const out = new Uint8Array(32);
-  out.set(b, 0);
-  return out;
-}
-
-function _encodeBytesDynamic(value) {
-  const b = arrayify(value);
-  const lenWord = _u256ToWord(BigInt(b.length));
-  return _concat([lenWord, _padRightTo32(b)]);
-}
-
-function _encodeString(value) {
-  const bytes = utf8ToBytes(String(value));
-  const lenWord = _u256ToWord(BigInt(bytes.length));
-  return _concat([lenWord, _padRightTo32(bytes)]);
-}
-
-function _tupleValues(components, value) {
-  if (Array.isArray(value)) return value;
-  if (value && typeof value === "object") {
-    return components.map((c, i) => {
-      const name = c && typeof c.name === "string" && c.name ? c.name : String(i);
-      if (Object.prototype.hasOwnProperty.call(value, name)) return value[name];
-      if (Object.prototype.hasOwnProperty.call(value, String(i))) return value[String(i)];
-      return undefined;
-    });
-  }
-  return [];
-}
-
-function encodeTupleLike(params, values, depth) {
-  if (depth == null) depth = 0;
-  const ps = Array.isArray(params) ? params : [];
-  const vs = Array.isArray(values) ? values : [];
-
-  const headWords = ps.reduce((a, p) => a + (_isDynamicType(p) ? 1 : _staticWords(p)), 0);
-  const headSize = headWords * 32;
-
-  /** @type {Uint8Array[]} */
-  const headParts = [];
-  /** @type {Uint8Array[]} */
-  const tailParts = [];
-  let tailOffset = 0;
-
-  for (let i = 0; i < ps.length; i++) {
-    const p = ps[i];
-    const v = vs[i];
-    if (_isDynamicType(p)) {
-      const encTail = encodeParam(p, v, depth);
-      headParts.push(_u256ToWord(BigInt(headSize + tailOffset)));
-      tailParts.push(encTail);
-      tailOffset += encTail.length;
-    } else {
-      headParts.push(encodeParam(p, v, depth));
-    }
-  }
-
-  return _concat([...headParts, ...tailParts]);
-}
-
-function encodeParam(param, value, depth) {
-  if (depth == null) depth = 0;
-  if (depth > MAX_ABI_DEPTH) throw makeError("ABI encoding: maximum nesting depth exceeded", "INVALID_ARGUMENT", {});
-  const type = String(param && param.type ? param.type : "");
-
-  if (_isArrayType(type)) {
-    const innerType = _arrayInnerType(type);
-    const innerParam = { ...(param || {}), type: innerType };
-    const arr = Array.isArray(value) ? value : [];
-
-    if (_isDynamicArray(type)) {
-      const lenWord = _u256ToWord(BigInt(arr.length));
-      const elems = encodeTupleLike(Array.from({ length: arr.length }).map(() => innerParam), arr, depth + 1);
-      return _concat([lenWord, elems]);
-    }
-
-    const n = _fixedArrayLength(type);
-    const elems = encodeTupleLike(Array.from({ length: n }).map(() => innerParam), arr.slice(0, n), depth + 1);
-    return elems;
-  }
-
-  if (type === "tuple") {
-    const comps = Array.isArray(param.components) ? param.components : [];
-    const vals = _tupleValues(comps, value);
-    return encodeTupleLike(comps, vals, depth + 1);
-  }
-
-  if (_isUint(type)) {
-    const bits = _intBits(type);
-    const bi = _asBigInt(value);
-    _checkUintRange(bi, bits);
-    return _u256ToWord(bi);
-  }
-  if (_isInt(type)) return _encodeIntWord(_asBigInt(value), _intBits(type));
-  if (type === "bool") return _u256ToWord(value ? 1n : 0n);
-  if (type === "address") return _encodeAddress(value);
-  if (type === "string") return _encodeString(value);
-  if (type === "bytes") return _encodeBytesDynamic(value);
-  if (_isBytesN(type)) return _encodeFixedBytes(type, value);
-
-  throw makeError("unsupported ABI type", "NOT_IMPLEMENTED", { type });
-}
-
-function canonicalType(param) {
-  const type = String(param && param.type ? param.type : "");
-  if (_isArrayType(type)) {
-    const innerType = _arrayInnerType(type);
-    const suffix = type.slice(type.lastIndexOf("["));
-    return canonicalType({ ...(param || {}), type: innerType }) + suffix;
-  }
-  if (type === "tuple") {
-    const comps = Array.isArray(param.components) ? param.components : [];
-    return `(${comps.map((c) => canonicalType(c)).join(",")})`;
-  }
-  return type;
-}
-
-function functionSelectorHex(name, inputs) {
-  const sig = `${name}(${(inputs || []).map((i) => canonicalType(i)).join(",")})`;
-  return normalizeHex(id(sig)).slice(0, 10);
-}
-
-function encodeFunctionData(name, inputs, values) {
-  const selector = functionSelectorHex(name, inputs);
-  const enc = encodeTupleLike(inputs, values || []);
-  return normalizeHex(selector + strip0x(bytesToHex(enc)));
-}
-
-// A 32-byte word must lie fully within the data. Without this check
-// `data.slice(offset, offset + 32)` silently returns a short/empty array, so an
-// out-of-bounds read decodes to `0n` / the zero address — letting a malicious RPC
-// response corrupt static return values (e.g. a balance silently reads as 0).
-function _assertWordInBounds(data, offset) {
-  if (!Number.isInteger(offset) || offset < 0 || offset + 32 > data.length) {
-    throw makeError("ABI decoding: read past end of data", "INVALID_ARGUMENT", {
-      offset,
-      length: data.length,
-    });
-  }
-}
-
-function _readWordAsBigInt(data, offset) {
-  _assertWordInBounds(data, offset);
-  const chunk = data.slice(offset, offset + 32);
-  const hex = bytesToHex(chunk);
-  return BigInt(hex);
-}
-
-function _readWordAsNumber(data, offset) {
-  const bi = _readWordAsBigInt(data, offset);
-  if (bi > BigInt(Number.MAX_SAFE_INTEGER)) throw makeError("offset too large", "INVALID_ARGUMENT", { offset: bi.toString() });
-  return Number(bi);
-}
-
-function _decodeUint(type, data, offset) {
-  void type;
-  return _readWordAsBigInt(data, offset);
-}
-
-function _decodeInt(type, data, offset) {
-  const bits = _intBits(type);
-  const bi = _readWordAsBigInt(data, offset);
-  const mod = 1n << BigInt(bits);
-  const mask = mod - 1n;
-  const trunc = bi & mask; // int<M> is sign-extended; recover the low M bits
-  const signBit = 1n << BigInt(bits - 1);
-  const signed = trunc & signBit ? trunc - mod : trunc;
-  return signed;
-}
-
-function _decodeBool(data, offset) {
-  const bi = _readWordAsBigInt(data, offset);
-  return bi !== 0n;
-}
-
-function _decodeAddress(data, offset) {
-  _assertWordInBounds(data, offset);
-  const chunk = data.slice(offset, offset + 32);
-  return normalizeHex(bytesToHex(chunk));
-}
-
-function _decodeFixedBytes(type, data, offset) {
-  _assertWordInBounds(data, offset);
-  const n = _bytesNLen(type);
-  const chunk = data.slice(offset, offset + 32);
-  return normalizeHex(bytesToHex(chunk.slice(0, n)));
-}
-
-function _decodeBytesDynamic(data, baseOffset) {
-  const len = _readWordAsNumber(data, baseOffset);
-  const start = baseOffset + 32;
-  // The declared length must fit within the available data; otherwise a
-  // malicious response could declare a huge length and cause silent truncation
-  // or oversized allocation.
-  if (start + len > data.length) {
-    throw makeError("ABI decoding: bytes length exceeds available data", "INVALID_ARGUMENT", { length: len });
-  }
-  const out = data.slice(start, start + len);
-  return normalizeHex(bytesToHex(out));
-}
-
-function _decodeString(data, baseOffset) {
-  const len = _readWordAsNumber(data, baseOffset);
-  const start = baseOffset + 32;
-  // The declared length must fit within the available data.
-  if (start + len > data.length) {
-    throw makeError("ABI decoding: string length exceeds available data", "INVALID_ARGUMENT", { length: len });
-  }
-  const out = data.slice(start, start + len);
-  return bytesToUtf8(out);
-}
-
-function decodeTupleLike(params, data, baseOffset, depth) {
-  if (depth == null) depth = 0;
-  const ps = Array.isArray(params) ? params : [];
-
-  const headWords = ps.reduce((a, p) => a + (_isDynamicType(p) ? 1 : _staticWords(p)), 0);
-  const headSize = headWords * 32;
-
-  /** @type {any[]} */
-  const values = [];
-  let headOff = 0;
-
-  for (let i = 0; i < ps.length; i++) {
-    const p = ps[i];
-    if (_isDynamicType(p)) {
-      const rel = _readWordAsNumber(data, baseOffset + headOff);
-      // The dynamic offset is attacker-controlled. In canonical ABI encoding
-      // the tail always starts at or after the head, so reject offsets that point
-      // back into the head region (aliasing) and offsets that fall outside the
-      // available data before following the pointer.
-      if (rel < headSize) {
-        throw makeError("ABI decoding: dynamic offset points into head region", "INVALID_ARGUMENT", {
-          offset: rel,
-          headSize,
-        });
-      }
-      if (baseOffset + rel + 32 > data.length) {
-        throw makeError("ABI decoding: dynamic offset out of bounds", "INVALID_ARGUMENT", {
-          offset: rel,
-          length: data.length,
-        });
-      }
-      values.push(decodeParam(p, data, baseOffset + rel, depth));
-      headOff += 32;
-    } else {
-      values.push(decodeParam(p, data, baseOffset + headOff, depth));
-      headOff += _staticWords(p) * 32;
-    }
-  }
-
-  return values;
-}
-
-function decodeParam(param, data, offset, depth) {
-  if (depth == null) depth = 0;
-  if (depth > MAX_ABI_DEPTH) throw makeError("ABI decoding: maximum nesting depth exceeded", "INVALID_ARGUMENT", {});
-  const type = String(param && param.type ? param.type : "");
-
-  if (_isArrayType(type)) {
-    const innerType = _arrayInnerType(type);
-    const innerParam = { ...(param || {}), type: innerType };
-
-    if (_isDynamicArray(type)) {
-      const len = _readWordAsNumber(data, offset);
-      // Each element consumes at least one 32-byte head word. Reject lengths
-      // that cannot possibly fit in the remaining calldata before allocating an
-      // array of `len` entries (prevents unbounded allocation / OOM from a
-      // hostile ABI response declaring an enormous length).
-      const elemsStart = offset + 32;
-      if (len * 32 > data.length - elemsStart) {
-        throw makeError("ABI decoding: array length exceeds available data", "INVALID_ARGUMENT", { length: len });
-      }
-      const elems = decodeTupleLike(Array.from({ length: len }).map(() => innerParam), data, elemsStart, depth + 1);
-      return elems;
-    }
-
-    const n = _fixedArrayLength(type);
-    // A fixed-array dimension comes from the (attacker-controllable) type
-    // string. Each element occupies at least one 32-byte head word, so reject a
-    // length that cannot possibly fit in the remaining data before allocating an
-    // array of `n` entries (prevents unbounded allocation / OOM from e.g.
-    // `uint256[1000000000]`).
-    if (n * 32 > data.length - offset) {
-      throw makeError("ABI decoding: fixed array length exceeds available data", "INVALID_ARGUMENT", {
-        length: n,
-      });
-    }
-    return decodeTupleLike(Array.from({ length: n }).map(() => innerParam), data, offset, depth + 1);
-  }
-
-  if (type === "tuple") {
-    const comps = Array.isArray(param.components) ? param.components : [];
-    const vals = decodeTupleLike(comps, data, offset, depth + 1);
-    const out = {};
-    for (let i = 0; i < comps.length; i++) {
-      const c = comps[i];
-      const name = c && typeof c.name === "string" && c.name ? c.name : String(i);
-      out[name] = vals[i];
-    }
-    return out;
-  }
-
-  if (_isUint(type)) return _decodeUint(type, data, offset);
-  if (_isInt(type)) return _decodeInt(type, data, offset);
-  if (type === "bool") return _decodeBool(data, offset);
-  if (type === "address") return _decodeAddress(data, offset);
-  if (type === "bytes") return _decodeBytesDynamic(data, offset);
-  if (type === "string") return _decodeString(data, offset);
-  if (_isBytesN(type)) return _decodeFixedBytes(type, data, offset);
-
-  throw makeError("unsupported ABI type", "NOT_IMPLEMENTED", { type });
-}
-
-function decodeFunctionResult(outputs, dataHex) {
-  const data = arrayify(dataHex);
-  return decodeTupleLike(outputs || [], data, 0);
-}
-
-function hasTuple(params) {
-  const ps = Array.isArray(params) ? params : [];
-  for (const p of ps) {
-    const type = String(p && p.type ? p.type : "");
-    if (type === "tuple") return true;
-    if (_isArrayType(type) && hasTuple([{ ...(p || {}), type: _arrayInnerType(type) }])) return true;
-    if (Array.isArray(p && p.components) && hasTuple(p.components)) return true;
-  }
-  return false;
-}
-
-function hasNestedArrays(params) {
-  const ps = Array.isArray(params) ? params : [];
-  for (const p of ps) {
-    const type = String(p && p.type ? p.type : "");
-    if (_isArrayType(type)) {
-      const inner = _arrayInnerType(type);
-      if (_isArrayType(inner)) return true;
-      if (hasNestedArrays([{ ...(p || {}), type: inner }])) return true;
-    }
-    if (type === "tuple" && Array.isArray(p && p.components) && hasNestedArrays(p.components)) return true;
-    if (Array.isArray(p && p.components) && hasNestedArrays(p.components)) return true;
-  }
-  return false;
-}
-
-function needsJsAbi(params) {
-  return hasTuple(params) || hasNestedArrays(params);
-}
-
-module.exports = {
-  hasTuple,
-  hasNestedArrays,
-  needsJsAbi,
-  canonicalType,
-  functionSelectorHex,
-  encodeFunctionData,
-  encodeTupleLike,
-  decodeFunctionResult,
-};
-

package/example/node_modules/quantumcoin/src/constants.d.ts

@@ -1,61 +0,0 @@
-/**
- * The current version of the QuantumCoin.js library.
- * @type {string}
- */
-export const version: string;
-/**
- * The zero address (32 bytes).
- * @type {string}
- */
-export const ZeroAddress: string;
-/**
- * The zero hash (32 bytes).
- * @type {string}
- */
-export const ZeroHash: string;
-/**
- * The maximum value for a uint256.
- * @type {bigint}
- */
-export const MaxUint256: bigint;
-/**
- * The maximum value for a uint160.
- * @type {bigint}
- */
-export const MaxUint160: bigint;
-/**
- * The minimum value for an int256.
- * @type {bigint}
- */
-export const MinInt256: bigint;
-/**
- * The maximum value for an int256.
- * @type {bigint}
- */
-export const MaxInt256: bigint;
-/**
- * Error code for numeric faults.
- * @type {string}
- */
-export const NumericFault: string;
-/**
- * Error code for numeric faults (alias).
- * @type {string}
- */
-export const NumericFaultCode: string;
-/**
- * Wei per coin (1e18).
- * @type {bigint}
- */
-export const WeiPerEther: bigint;
-/**
- * Currency symbol (compat with ethers.js v6).
- * @type {string}
- */
-export const EtherSymbol: string;
-/**
- * BigNumber constant (exported as `N` in ethers.js v6).
- * In QuantumCoin.js, this is a bigint constant.
- * @type {bigint}
- */
-export const N: bigint;

package/example/node_modules/quantumcoin/src/constants.js

@@ -1,94 +0,0 @@
-/**
- * @fileoverview Public constants matching ethers.js v6 naming.
- */
-
-const pkg = require("../package.json");
-
-/**
- * The current version of the QuantumCoin.js library.
- * @type {string}
- */
-const version = pkg.version || "0.0.0";
-
-/**
- * The zero address (32 bytes).
- * @type {string}
- */
-const ZeroAddress = "0x" + "00".repeat(32);
-
-/**
- * The zero hash (32 bytes).
- * @type {string}
- */
-const ZeroHash = "0x" + "00".repeat(32);
-
-/**
- * The maximum value for a uint256.
- * @type {bigint}
- */
-const MaxUint256 = (2n ** 256n) - 1n;
-
-/**
- * The maximum value for a uint160.
- * @type {bigint}
- */
-const MaxUint160 = (2n ** 160n) - 1n;
-
-/**
- * The minimum value for an int256.
- * @type {bigint}
- */
-const MinInt256 = -(2n ** 255n);
-
-/**
- * The maximum value for an int256.
- * @type {bigint}
- */
-const MaxInt256 = (2n ** 255n) - 1n;
-
-/**
- * Error code for numeric faults.
- * @type {string}
- */
-const NumericFault = "NUMERIC_FAULT";
-
-/**
- * Error code for numeric faults (alias).
- * @type {string}
- */
-const NumericFaultCode = "NUMERIC_FAULT";
-
-/**
- * Wei per coin (1e18).
- * @type {bigint}
- */
-const WeiPerEther = 1000000000000000000n;
-
-/**
- * Currency symbol (compat with ethers.js v6).
- * @type {string}
- */
-const EtherSymbol = "Ξ";
-
-/**
- * BigNumber constant (exported as `N` in ethers.js v6).
- * In QuantumCoin.js, this is a bigint constant.
- * @type {bigint}
- */
-const N = 0n;
-
-module.exports = {
-  version,
-  ZeroAddress,
-  ZeroHash,
-  MaxUint256,
-  MaxUint160,
-  MinInt256,
-  MaxInt256,
-  NumericFault,
-  NumericFaultCode,
-  WeiPerEther,
-  EtherSymbol,
-  N,
-};
-