@mimicprotocol/lib-ts 0.0.1-rc.10

package/src/types/BigInt.ts

@@ -0,0 +1,781 @@
+// eslint-disable-next-line no-secrets/no-secrets
+// This file is based on code from "The Graph Tooling" (https://github.com/graphprotocol/graph-tooling/tree/7faa3098b2e6c61f09fc81b8b2d333e66b0080d1).
+// Licensed under the MIT License.
+// Copyright (c) 2018 Graph Protocol, Inc. and contributors.
+// Modified by Mimic Protocol, 2025.
+
+import { areAllZeros, bytesToHexString, isHex, normalizeScientificNotation } from '../helpers'
+
+import { ByteArray } from './ByteArray'
+import { Bytes } from './Bytes'
+
+const ZERO_ASCII = '0'.charCodeAt(0)
+
+/**
+ * Represents an arbitrary-precision integer stored as a byte array.
+ */
+export class BigInt extends Uint8Array {
+  /**
+   * Returns a BigInt initialized to zero.
+   */
+  static zero(): BigInt {
+    return BigInt.fromI32(0)
+  }
+
+  /**
+   * Creates a BigInt from a signed 8-bit integer (i8).
+   */
+  static fromI8(x: i8): BigInt {
+    return BigInt.fromByteArray(ByteArray.fromI8(x))
+  }
+
+  /**
+   * Creates a BigInt from an unsigned 8-bit integer (u8).
+   */
+  static fromU8(x: u8): BigInt {
+    return BigInt.fromByteArray(ByteArray.fromU8(x))
+  }
+
+  /**
+   * Creates a BigInt from a signed 16-bit integer (i16).
+   */
+  static fromI16(x: i16): BigInt {
+    return BigInt.fromByteArray(ByteArray.fromI16(x))
+  }
+
+  /**
+   * Creates a BigInt from an unsigned 16-bit integer (u16).
+   */
+  static fromU16(x: u16): BigInt {
+    return BigInt.fromByteArray(ByteArray.fromU16(x))
+  }
+
+  /**
+   * Creates a BigInt from a signed 32-bit integer (i32).
+   */
+  static fromI32(x: i32): BigInt {
+    return BigInt.fromByteArray(ByteArray.fromI32(x))
+  }
+
+  /**
+   * Creates a BigInt from an unsigned 32-bit integer (u32).
+   */
+  static fromU32(x: u32): BigInt {
+    return BigInt.fromUnsignedBytes(ByteArray.fromU32(x))
+  }
+
+  /**
+   * Creates a BigInt from a signed 64-bit integer (i64).
+   */
+  static fromI64(x: i64): BigInt {
+    return BigInt.fromByteArray(ByteArray.fromI64(x))
+  }
+
+  /**
+   * Creates a BigInt from an unsigned 64-bit integer (u64).
+   */
+  static fromU64(x: u64): BigInt {
+    return BigInt.fromUnsignedBytes(ByteArray.fromU64(x))
+  }
+
+  /**
+   * Converts a Bytes instance containing a signed integer to a BigInt.
+   */
+  static fromSignedBytes(bytes: Bytes): BigInt {
+    return BigInt.fromByteArray(changetype<ByteArray>(bytes))
+  }
+
+  /**
+   * Converts a ByteArray to a BigInt.
+   */
+  static fromByteArray(byteArray: ByteArray): BigInt {
+    return changetype<BigInt>(byteArray)
+  }
+
+  /**
+   * Converts an unsigned ByteArray to a BigInt, appending a zero byte for sign extension.
+   */
+  static fromUnsignedBytes(bytes: ByteArray): BigInt {
+    const signedBytes = new BigInt(bytes.length + 1)
+    for (let i = 0; i < bytes.length; i++) signedBytes[i] = bytes[i]
+    signedBytes[bytes.length] = 0
+    return signedBytes
+  }
+
+  /**
+   * Parses a string representation of a number and converts it to a BigInt.
+   * Supports decimal and scientific notation formats.
+   */
+  static fromString(str: string): BigInt {
+    const hexIndex = str.toLowerCase().indexOf('0x')
+    if (hexIndex == 0 || hexIndex == 1) return BigInt.fromHexString(str)
+    return this.fromStringDecimal(str, 0)
+  }
+
+  /**
+   * Parses a string representation of a number with precision and converts it to a BigInt.
+   * Supports decimal and scientific notation formats.
+   */
+  static fromStringDecimal(str: string, precision: u8): BigInt {
+    if (str === '0') return this.zero()
+    str = normalizeScientificNotation(str)
+
+    const parts = str.split('.')
+    if (parts.length > 2) throw new Error(`Invalid string. Received: ${str}`)
+
+    const isNegative = parts[0].startsWith('-')
+    const wholePart = isNegative ? parts[0].substring(1) : parts[0]
+    let result = BigInt.fromStringRaw(wholePart).upscale(precision)
+
+    if (parts.length > 1 && parts[1].length > 0) {
+      const decimalDigits = parts[1]
+      if (decimalDigits.length > <i32>precision && !areAllZeros(decimalDigits)) {
+        throw new Error(`Too many decimal places. Max allowed: ${precision}, found: ${decimalDigits.length}`)
+      }
+      const decimalPart = parts[1].padEnd(precision, '0')
+      result = result.plus(BigInt.fromString(decimalPart))
+    }
+
+    return isNegative ? result.neg() : result
+  }
+
+  /**
+   * Parses a hexadecimal string representation of a number and converts it to a BigInt.
+   */
+  static fromHexString(hex: string): BigInt {
+    hex = hex.toLowerCase()
+    if (!hex || hex === '0x' || hex === '-0x') return BigInt.zero()
+
+    // Remove prefix
+    const isNegative = hex.startsWith('-')
+    if (isNegative) hex = hex.substring(1)
+    else if (hex.startsWith('+')) hex = hex.substring(1)
+    if (hex.startsWith('0x')) hex = hex.substring(2)
+
+    if (!isHex(hex)) throw new Error(`Invalid hex string: '${hex}'`)
+
+    // ByteArray will still assert even length
+    const bytes = ByteArray.fromHexString(hex)
+    const result = BigInt.fromUnsignedBytes(bytes)
+    return isNegative && !result.isZero() ? result.neg() : result
+  }
+
+  private static fromStringRaw(str: string): BigInt {
+    if (str.length == 0) throw new Error('Received invalid empty string')
+    let result = BigInt.zero()
+    for (let i = 0; i < str.length; i++) {
+      const c = str.charCodeAt(i)
+      if (c < 48 || c > 57) throw new Error(`Invalid digit '${str.charAt(i)}'`)
+      result = result.times(BigInt.fromI32(10)).plus(BigInt.fromI32(c - 48))
+    }
+    return result
+  }
+
+  private static addUnsigned(a: BigInt, b: BigInt): BigInt {
+    if (a.isZero()) return b.clone()
+    if (b.isZero()) return a.clone()
+
+    const maxLen = max(a.length, b.length)
+    const result = new BigInt(maxLen + 1)
+    let carry: u32 = 0
+    for (let i = 0; i < maxLen; i++) {
+      const ai = i < a.length ? a[i] : 0
+      const bi = i < b.length ? b[i] : 0
+      const sum = <u32>ai + <u32>bi + carry
+      result[i] = <u8>(sum & 0xff)
+      carry = sum >> 8
+    }
+    if (carry != 0) result[maxLen] = <u8>carry
+    return result
+  }
+
+  private static subUnsigned(a: BigInt, b: BigInt): BigInt {
+    const result = new BigInt(a.length)
+    let borrow: i32 = 0
+    for (let i = 0; i < a.length; i++) {
+      const ai = <i32>(i < a.length ? a[i] : 0)
+      const bi = <i32>(i < b.length ? b[i] : 0)
+      let diff = ai - bi - borrow
+      borrow = 0
+      if (diff < 0) {
+        diff += 256
+        borrow = 1
+      }
+      result[i] = <u8>(diff & 0xff)
+    }
+    return result
+  }
+
+  private static mulUnsigned(a: BigInt, b: BigInt): BigInt {
+    if (a.length < b.length) return BigInt.mulUnsigned(b, a)
+    if (b.length === 1 && b[0] === 2) return a.leftShift(1)
+
+    const result = new BigInt(a.length + b.length)
+    for (let i = 0; i < a.length; i++) {
+      let carry: u32 = 0
+      for (let j = 0; j < b.length || carry != 0; j++) {
+        const bj = j < b.length ? b[j] : 0
+        const sum = <u32>result[i + j] + <u32>a[i] * <u32>bj + carry
+        result[i + j] = <u8>(sum & 0xff)
+        carry = sum >> 8
+      }
+    }
+    return result
+  }
+
+  private static divUnsigned(a: BigInt, b: BigInt): BigInt {
+    assert(!b.isZero(), 'Trying to divide by zero')
+    if (BigInt.compare(a, b) < 0) return BigInt.zero()
+
+    let quotient = BigInt.zero()
+    let remainder = BigInt.zero()
+
+    for (let i = a.length - 1; i >= 0; i--) {
+      remainder = remainder.leftShift(8)
+      remainder = BigInt.addUnsigned(remainder, BigInt.fromI32(a[i]))
+
+      let digit = BigInt.zero()
+      while (BigInt.compare(remainder, b) >= 0) {
+        remainder = BigInt.subUnsigned(remainder, b)
+        digit = BigInt.addUnsigned(digit, BigInt.fromI32(1))
+      }
+
+      quotient = quotient.leftShift(8)
+      quotient = BigInt.addUnsigned(quotient, digit)
+    }
+    return quotient
+  }
+
+  /**
+   * Compares two BigInt values.
+   * @param a - The first BigInt to compare
+   * @param b - The second BigInt to compare
+   * @returns -1 if a < b, 0 if a == b, 1 if a > b
+   */
+  static compare(a: BigInt, b: BigInt): i32 {
+    const aIsNeg = a.length > 0 && a[a.length - 1] >> 7 == 1
+    const bIsNeg = b.length > 0 && b[b.length - 1] >> 7 == 1
+    if (!aIsNeg && bIsNeg) return 1
+    if (aIsNeg && !bIsNeg) return -1
+
+    let aRelevantBytes = a.length
+    while (
+      aRelevantBytes > 0 &&
+      ((!aIsNeg && a[aRelevantBytes - 1] == 0) || (aIsNeg && a[aRelevantBytes - 1] == 255))
+    ) {
+      aRelevantBytes -= 1
+    }
+
+    let bRelevantBytes = b.length
+    while (
+      bRelevantBytes > 0 &&
+      ((!bIsNeg && b[bRelevantBytes - 1] == 0) || (bIsNeg && b[bRelevantBytes - 1] == 255))
+    ) {
+      bRelevantBytes -= 1
+    }
+
+    if (aRelevantBytes > bRelevantBytes) return aIsNeg ? -1 : 1
+    if (bRelevantBytes > aRelevantBytes) return aIsNeg ? 1 : -1
+
+    const relevantBytes = aRelevantBytes
+    for (let i = 1; i <= relevantBytes; i++) {
+      if (a[relevantBytes - i] < b[relevantBytes - i]) return -1
+      if (a[relevantBytes - i] > b[relevantBytes - i]) return 1
+    }
+
+    return 0
+  }
+
+  /**
+   * Checks if this BigInt represents a negative number.
+   * @returns True if the number is negative, false otherwise
+   */
+  isNegative(): boolean {
+    return this.length > 0 && (this[this.length - 1] & 0x80) == 0x80
+  }
+
+  /**
+   * Checks if this BigInt represents zero.
+   * @returns True if the number is zero, false otherwise
+   */
+  isZero(): boolean {
+    if (this.length == 0) return true
+    for (let i = 0; i < this.length; i++) if (this[i] !== 0) return false
+    return true
+  }
+
+  /**
+   * Checks if this BigInt can fit within the range of a signed 32-bit integer.
+   * @returns True if the value fits in i32 range, false otherwise
+   */
+  isI32(): boolean {
+    return BigInt.fromI32(i32.MIN_VALUE) <= this && this <= BigInt.fromI32(i32.MAX_VALUE)
+  }
+
+  /**
+   * Tells the absolute value of this BigInt.
+   * @returns A new BigInt representing the absolute value
+   */
+  abs(): BigInt {
+    return this.isNegative() ? this.neg() : this
+  }
+
+  /**
+   * Raises this BigInt to the power of the given exponent.
+   * @param exp - The exponent (unsigned 8-bit integer)
+   * @returns A new BigInt representing this^exp
+   */
+  pow(exp: u8): BigInt {
+    if (exp === 0) return BigInt.fromI32(1)
+    if (exp === 1) return this.clone()
+    if (exp === 2) return this.times(this)
+
+    let base = this.clone()
+    let e = exp
+    let result = BigInt.fromI32(1)
+
+    while (e > 0) {
+      if ((e & 1) == 1) result = result.times(base)
+      base = base.times(base)
+      e >>= 1
+    }
+    return result
+  }
+
+  /**
+   * Multiplies this BigInt by 10^precision (moves decimal point right).
+   * @param precision - Number of decimal places to scale up
+   * @returns A new BigInt scaled up by the specified precision
+   */
+  upscale(precision: u8): BigInt {
+    return this.times(BigInt.fromI32(10).pow(precision))
+  }
+
+  /**
+   * Divides this BigInt by 10^precision (moves decimal point left).
+   * @param precision - Number of decimal places to scale down
+   * @returns A new BigInt scaled down by the specified precision
+   */
+  downscale(precision: u8): BigInt {
+    return this.div(BigInt.fromI32(10).pow(precision))
+  }
+
+  /**
+   * Creates a deep copy of this BigInt.
+   * @returns A new BigInt instance with the same value
+   */
+  clone(): BigInt {
+    const clone = new BigInt(this.length)
+    memory.copy(clone.dataStart, this.dataStart, this.length)
+    return clone
+  }
+
+  /**
+   * Creates a new BigInt from a portion of this BigInt's byte array.
+   * @param start - Starting index (inclusive)
+   * @param end - Ending index (exclusive)
+   * @returns A new BigInt containing the specified byte range
+   */
+  subarray(start: i32, end: i32): BigInt {
+    const length = end - start
+    const result = new BigInt(length)
+    memory.copy(result.dataStart, this.dataStart + start, length)
+    return result
+  }
+
+  /**
+   * Adds another BigInt to this BigInt.
+   * @param other - The BigInt to add
+   * @returns A new BigInt representing the sum
+   */
+  @operator('+')
+  plus(other: BigInt): BigInt {
+    const aIsNeg = this.isNegative()
+    const bIsNeg = other.isNegative()
+    if (aIsNeg === bIsNeg) {
+      const resultAbs = BigInt.addUnsigned(this.abs(), other.abs())
+      return aIsNeg ? resultAbs.neg() : resultAbs
+    }
+    const cmp = BigInt.compare(this.abs(), other.abs())
+    if (cmp === 0) {
+      return BigInt.zero()
+    } else if (cmp > 0) {
+      const resultAbs = BigInt.subUnsigned(this.abs(), other.abs())
+      return this.isNegative() ? resultAbs.neg() : resultAbs
+    } else {
+      const resultAbs = BigInt.subUnsigned(other.abs(), this.abs())
+      return other.isNegative() ? resultAbs.neg() : resultAbs
+    }
+  }
+
+  /**
+   * Subtracts another BigInt from this BigInt.
+   * @param other - The BigInt to subtract
+   * @returns A new BigInt representing the difference
+   */
+  @operator('-')
+  minus(other: BigInt): BigInt {
+    return this.plus(other.neg())
+  }
+
+  /**
+   * Multiplies this BigInt by another BigInt.
+   * @param other - The BigInt to multiply by
+   * @returns A new BigInt representing the product
+   */
+  @operator('*')
+  times(other: BigInt): BigInt {
+    if (other.isZero() || this.isZero()) return BigInt.zero()
+
+    if (other.length == 1) {
+      if (other[0] == 1) return this.clone()
+      if (other[0] == 2) return this.leftShift(1)
+      if (other[0] == 4) return this.leftShift(2)
+      if (other[0] == 8) return this.leftShift(3)
+    }
+
+    const aIsNeg = this.isNegative()
+    const bIsNeg = other.isNegative()
+    const signIsNeg = (aIsNeg && !bIsNeg) || (!aIsNeg && bIsNeg)
+    const resultAbs = BigInt.mulUnsigned(this.abs(), other.abs())
+    return signIsNeg ? resultAbs.neg() : resultAbs
+  }
+
+  /**
+   * Divides this BigInt by another BigInt.
+   * @param other - The BigInt to divide by (cannot be zero)
+   * @returns A new BigInt representing the quotient
+   */
+  @operator('/')
+  div(other: BigInt): BigInt {
+    assert(!other.isZero(), 'Trying to divide by zero')
+    const aIsNeg = this.isNegative()
+    const bIsNeg = other.isNegative()
+    const signIsNeg = (aIsNeg && !bIsNeg) || (!aIsNeg && bIsNeg)
+    const resultAbs = BigInt.divUnsigned(this.abs(), other.abs())
+    return signIsNeg ? resultAbs.neg() : resultAbs
+  }
+
+  /**
+   * Calculates the remainder when dividing this BigInt by another BigInt.
+   * @param other - The BigInt to divide by (cannot be zero)
+   * @returns A new BigInt representing the remainder
+   */
+  @operator('%')
+  mod(other: BigInt): BigInt {
+    assert(!other.isZero(), '')
+    return this.minus(this.div(other).times(other))
+  }
+
+  /**
+   * Checks if this BigInt is equal to another BigInt.
+   * @param other - The BigInt to compare with
+   * @returns True if both BigInts have the same value
+   */
+  @operator('==')
+  equals(other: BigInt): boolean {
+    return BigInt.compare(this, other) == 0
+  }
+
+  /**
+   * Checks if this BigInt is not equal to another BigInt.
+   * @param other - The BigInt to compare with
+   * @returns True if the BigInts have different values
+   */
+  @operator('!=')
+  notEqual(other: BigInt): boolean {
+    return !(this == other)
+  }
+
+  /**
+   * Checks if this BigInt is less than another BigInt.
+   * @param other - The BigInt to compare with
+   * @returns True if this BigInt is smaller
+   */
+  @operator('<')
+  lt(other: BigInt): boolean {
+    return BigInt.compare(this, other) == -1
+  }
+
+  /**
+   * Checks if this BigInt is greater than another BigInt.
+   * @param other - The BigInt to compare with
+   * @returns True if this BigInt is larger
+   */
+  @operator('>')
+  gt(other: BigInt): boolean {
+    return BigInt.compare(this, other) == 1
+  }
+
+  /**
+   * Checks if this BigInt is less than or equal to another BigInt.
+   * @param other - The BigInt to compare with
+   * @returns True if this BigInt is smaller or equal
+   */
+  @operator('<=')
+  le(other: BigInt): boolean {
+    return !(this > other)
+  }
+
+  /**
+   * Checks if this BigInt is greater than or equal to another BigInt.
+   * @param other - The BigInt to compare with
+   * @returns True if this BigInt is larger or equal
+   */
+  @operator('>=')
+  ge(other: BigInt): boolean {
+    return !(this < other)
+  }
+
+  /**
+   * Tells the negation (opposite sign) of this BigInt.
+   * @returns A new BigInt with the opposite sign
+   */
+  @operator.prefix('-')
+  neg(): BigInt {
+    const result = new BigInt(this.length)
+    for (let i = 0; i < this.length; i++) {
+      result[i] = ~this[i]
+    }
+    let carry: u32 = 1
+    for (let i = 0; i < result.length && carry != 0; i++) {
+      const sum = <u32>result[i] + carry
+      result[i] = <u8>(sum & 0xff)
+      carry = sum >> 8
+    }
+    return result
+  }
+
+  /**
+   * Performs a bitwise OR operation with another BigInt.
+   * @param other - The BigInt to perform bitwise OR with
+   * @returns A new BigInt representing the bitwise OR result
+   */
+  @operator('|')
+  bitOr(other: BigInt): BigInt {
+    const maxLen = max(this.length, other.length)
+    const result = new BigInt(maxLen)
+    for (let i = 0; i < maxLen; i++) {
+      const aByte = i < this.length ? this[i] : this.isNegative() ? 0xff : 0x00
+      const bByte = i < other.length ? other[i] : other.isNegative() ? 0xff : 0x00
+      result[i] = aByte | bByte
+    }
+    return result
+  }
+
+  /**
+   * Performs a bitwise AND operation with another BigInt.
+   * @param other - The BigInt to perform bitwise AND with
+   * @returns A new BigInt representing the bitwise AND result
+   */
+  @operator('&')
+  bitAnd(other: BigInt): BigInt {
+    const maxLen = max(this.length, other.length)
+    const result = new BigInt(maxLen)
+    for (let i = 0; i < maxLen; i++) {
+      const aByte = i < this.length ? this[i] : this.isNegative() ? 0xff : 0x00
+      const bByte = i < other.length ? other[i] : other.isNegative() ? 0xff : 0x00
+      result[i] = aByte & bByte
+    }
+    return result
+  }
+
+  /**
+   * Shifts this BigInt left by the specified number of bits.
+   * @param bits - Number of bits to shift left
+   * @returns A new BigInt shifted left (equivalent to multiplying by 2^bits)
+   */
+  @operator('<<')
+  leftShift(bits: u8): BigInt {
+    if (bits == 0) return this
+    const byteShift = bits / 8
+    const bitShift = bits % 8
+    const newLen = this.length + <i32>byteShift + 1
+    const result = new BigInt(newLen)
+    let carry = 0
+    for (let i = 0; i < this.length; i++) {
+      const cur = (this[i] << bitShift) | carry
+      result[i + byteShift] = <u8>(cur & 0xff)
+      carry = (cur >> 8) & 0xff
+    }
+    if (carry != 0) {
+      result[this.length + byteShift] = <u8>carry
+    }
+    return result
+  }
+
+  /**
+   * Shifts this BigInt right by the specified number of bits.
+   * @param bits - Number of bits to shift right
+   * @returns A new BigInt shifted right (equivalent to dividing by 2^bits)
+   */
+  @operator('>>')
+  rightShift(bits: u8): BigInt {
+    if (bits == 0) return this
+
+    const byteShift = (bits >> 3) as i32
+    const bitShift = bits & 0b111
+    const negative = this.isNegative()
+    const result = new BigInt(this.length)
+
+    if (byteShift >= this.length) {
+      for (let i = 0; i < this.length; i++) {
+        result[i] = negative ? 0xff : 0x00
+      }
+      return result
+    }
+
+    let carry: u16 = 0
+    for (let i = this.length - 1; i >= 0; i--) {
+      let cur = <u16>(this[i] & 0xff)
+
+      if (negative && i == this.length - 1) {
+        cur |= 0xff00
+      }
+
+      cur |= carry << 8
+      carry = cur & ((1 << bitShift) - 1)
+      cur = cur >> bitShift
+      const pos = i - byteShift
+
+      if (pos >= 0) {
+        result[pos] = <u8>(cur & 0xff)
+      }
+      if (i == 0) break
+    }
+
+    for (let i = this.length - 1; i >= this.length - byteShift; i--) {
+      if (i >= 0 && i < result.length) {
+        result[i] = negative ? 0xff : 0x00
+      }
+      if (i == 0) break
+    }
+
+    return result
+  }
+
+  /**
+   * Converts this BigInt to a Bytes representation.
+   * @returns A new Bytes instance containing the raw byte data
+   */
+  toBytes(): Bytes {
+    return Bytes.fromUint8Array(changetype<Uint8Array>(this))
+  }
+
+  /**
+   * Converts this BigInt to a signed 32-bit integer.
+   * @returns The i32 representation (behavior undefined if value doesn't fit)
+   */
+  toI32(): i32 {
+    const byteArray = this.toBytes()
+    return byteArray.toI32()
+  }
+
+  /**
+   * Converts this BigInt to an unsigned 32-bit integer.
+   * @returns The u32 representation (behavior undefined if value doesn't fit)
+   */
+  toU32(): u32 {
+    const byteArray = this.toBytes()
+    return byteArray.toU32()
+  }
+
+  /**
+   * Converts this BigInt to a signed 64-bit integer.
+   * @returns The i64 representation (behavior undefined if value doesn't fit)
+   */
+  toI64(): i64 {
+    const byteArray = this.toBytes()
+    return byteArray.toI64()
+  }
+
+  /**
+   * Converts this BigInt to an unsigned 64-bit integer.
+   * @returns The u64 representation (behavior undefined if value doesn't fit)
+   */
+  toU64(): u64 {
+    const byteArray = this.toBytes()
+    return byteArray.toU64()
+  }
+
+  /**
+   * Converts this BigInt to a hexadecimal string representation.
+   * @returns Hex string with '0x' prefix, or '0x' for zero
+   */
+  toHexString(): string {
+    if (this.isZero()) return '0x'
+    const abs = this.isNegative() ? this.neg() : this
+    let end = abs.length
+    while (end > 1 && abs[end - 1] === 0) end--
+    const trimmed = abs.subarray(0, end)
+    const hex = bytesToHexString(trimmed)
+    return this.isNegative() ? '-' + hex : hex
+  }
+
+  /**
+   * Converts this BigInt to a decimal string representation.
+   * @returns Decimal string representation of the number
+   */
+  toString(): string {
+    if (this.isZero()) return '0'
+
+    let absValue = this.isNegative() ? this.neg() : this.clone()
+    const digits = new Array<i32>()
+    while (!absValue.isZero()) {
+      let carry = 0
+
+      for (let i = absValue.length - 1; i >= 0; i--) {
+        const current = (carry << 8) + absValue[i]
+        absValue[i] = <u8>(current / 10)
+        carry = current % 10
+      }
+
+      digits.push(ZERO_ASCII + carry)
+
+      while (absValue.length > 1 && absValue[absValue.length - 1] == 0) {
+        absValue = absValue.subarray(0, absValue.length - 1)
+      }
+    }
+
+    if (this.isNegative()) digits.push('-'.charCodeAt(0))
+    digits.reverse()
+    return String.fromCharCodes(digits)
+  }
+
+  /**
+   * Converts this BigInt to a decimal string with specified precision.
+   * @param precision - Number of decimal places to format
+   * @returns Decimal string with the specified precision, trailing zeros removed
+   */
+  toStringDecimal(precision: u8): string {
+    if (this.isZero()) return '0'
+
+    const isNegative = this.isNegative()
+    const absAmount = this.abs()
+
+    const str = absAmount.toString()
+    if (str.length <= (precision as i32)) {
+      let decimalPart = str.padStart(precision, '0')
+
+      let lastNonZero = decimalPart.length - 1
+      while (lastNonZero >= 0 && decimalPart.charCodeAt(lastNonZero) === ZERO_ASCII) lastNonZero--
+
+      decimalPart = decimalPart.substring(0, lastNonZero + 1)
+      return (isNegative ? '-' : '') + '0' + (decimalPart.length ? '.' + decimalPart : '')
+    }
+
+    const wholePart = str.slice(0, str.length - precision)
+    let decimalPart = str.slice(str.length - precision)
+
+    // Remove trailing zeros manually
+    let lastNonZero = decimalPart.length - 1
+    while (lastNonZero >= 0 && decimalPart.charCodeAt(lastNonZero) === ZERO_ASCII) lastNonZero--
+
+    decimalPart = decimalPart.substring(0, lastNonZero + 1)
+
+    // If the decimal part is empty, return only the whole part
+    return decimalPart.length > 0
+      ? `${isNegative ? '-' : ''}${wholePart}.${decimalPart}`
+      : `${isNegative ? '-' : ''}${wholePart}`
+  }
+}