liminal 0.1.0-beta.25

package/src/deps/jsr.io/@std/encoding/1.0.6/_base32_common.ts

@@ -0,0 +1,218 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright (c) 2014 Jameson Little. MIT License.
+// This module is browser compatible.
+
+/**
+ * common code for base32 and base32hex encodings.
+ */
+
+import { validateBinaryLike } from "./_validate_binary_like.js";
+
+const placeHolderPadLookup = [0, 1, , 2, 3, , 4];
+
+function getPadLength(placeHoldersLen: number): number {
+  const maybeLen = placeHolderPadLookup[placeHoldersLen];
+  if (typeof maybeLen !== "number") {
+    throw new Error("Invalid pad length");
+  }
+  return maybeLen;
+}
+
+function getLens(b32: string): [number, number] {
+  const len = b32.length;
+
+  if (len % 8 > 0) {
+    throw new Error(
+      `Cannot decode base32 string as the length must be a multiple of 8: received length ${len}`,
+    );
+  }
+
+  let validLen = b32.indexOf("=");
+  if (validLen === -1) validLen = len;
+
+  const placeHoldersLen = validLen === len ? 0 : 8 - (validLen % 8);
+
+  return [validLen, placeHoldersLen];
+}
+
+function getByteLength(validLen: number, placeHoldersLen: number): number {
+  return ((validLen + placeHoldersLen) * 5) / 8 - getPadLength(placeHoldersLen);
+}
+
+/**
+ * Decodes an encoded string with the given lookup table.
+ *
+ * @param b32 The string to encode.
+ * @param lookup The lookup table
+ * @returns The encoded string.
+ */
+export function decode(b32: string, lookup: ReadonlyArray<string>): Uint8Array {
+  const revLookup: number[] = [];
+  lookup.forEach((c, i) => (revLookup[c.charCodeAt(0)] = i));
+
+  let tmp: number;
+  const [validLen, placeHoldersLen] = getLens(b32);
+
+  const arr = new Uint8Array(getByteLength(validLen, placeHoldersLen));
+
+  let curByte = 0;
+
+  // if there are placeholders, only get up to the last complete 8 chars
+  const len = placeHoldersLen > 0 ? validLen - 8 : validLen;
+
+  let i: number;
+  for (i = 0; i < len; i += 8) {
+    tmp = (revLookup[b32.charCodeAt(i)]! << 20) |
+      (revLookup[b32.charCodeAt(i + 1)]! << 15) |
+      (revLookup[b32.charCodeAt(i + 2)]! << 10) |
+      (revLookup[b32.charCodeAt(i + 3)]! << 5) |
+      revLookup[b32.charCodeAt(i + 4)]!;
+    arr[curByte++] = (tmp >> 17) & 0xff;
+    arr[curByte++] = (tmp >> 9) & 0xff;
+    arr[curByte++] = (tmp >> 1) & 0xff;
+
+    tmp = ((tmp & 1) << 15) |
+      (revLookup[b32.charCodeAt(i + 5)]! << 10) |
+      (revLookup[b32.charCodeAt(i + 6)]! << 5) |
+      revLookup[b32.charCodeAt(i + 7)]!;
+    arr[curByte++] = (tmp >> 8) & 0xff;
+    arr[curByte++] = tmp & 0xff;
+  }
+
+  if (placeHoldersLen === 1) {
+    tmp = (revLookup[b32.charCodeAt(i)]! << 20) |
+      (revLookup[b32.charCodeAt(i + 1)]! << 15) |
+      (revLookup[b32.charCodeAt(i + 2)]! << 10) |
+      (revLookup[b32.charCodeAt(i + 3)]! << 5) |
+      revLookup[b32.charCodeAt(i + 4)]!;
+    arr[curByte++] = (tmp >> 17) & 0xff;
+    arr[curByte++] = (tmp >> 9) & 0xff;
+    arr[curByte++] = (tmp >> 1) & 0xff;
+    tmp = ((tmp & 1) << 7) |
+      (revLookup[b32.charCodeAt(i + 5)]! << 2) |
+      (revLookup[b32.charCodeAt(i + 6)]! >> 3);
+    arr[curByte++] = tmp & 0xff;
+  } else if (placeHoldersLen === 3) {
+    tmp = (revLookup[b32.charCodeAt(i)]! << 19) |
+      (revLookup[b32.charCodeAt(i + 1)]! << 14) |
+      (revLookup[b32.charCodeAt(i + 2)]! << 9) |
+      (revLookup[b32.charCodeAt(i + 3)]! << 4) |
+      (revLookup[b32.charCodeAt(i + 4)]! >> 1);
+    arr[curByte++] = (tmp >> 16) & 0xff;
+    arr[curByte++] = (tmp >> 8) & 0xff;
+    arr[curByte++] = tmp & 0xff;
+  } else if (placeHoldersLen === 4) {
+    tmp = (revLookup[b32.charCodeAt(i)]! << 11) |
+      (revLookup[b32.charCodeAt(i + 1)]! << 6) |
+      (revLookup[b32.charCodeAt(i + 2)]! << 1) |
+      (revLookup[b32.charCodeAt(i + 3)]! >> 4);
+    arr[curByte++] = (tmp >> 8) & 0xff;
+    arr[curByte++] = tmp & 0xff;
+  } else if (placeHoldersLen === 6) {
+    tmp = (revLookup[b32.charCodeAt(i)]! << 3) |
+      (revLookup[b32.charCodeAt(i + 1)]! >> 2);
+    arr[curByte++] = tmp & 0xff;
+  }
+
+  return arr;
+}
+
+function encodeChunk(
+  uint8: Uint8Array,
+  start: number,
+  end: number,
+  lookup: ReadonlyArray<string>,
+): string {
+  let tmp: number;
+  const output = [];
+  for (let i = start; i < end; i += 5) {
+    tmp = ((uint8[i]! << 16) & 0xff0000) |
+      ((uint8[i + 1]! << 8) & 0xff00) |
+      (uint8[i + 2]! & 0xff);
+    output.push(lookup[(tmp >> 19) & 0x1f]);
+    output.push(lookup[(tmp >> 14) & 0x1f]);
+    output.push(lookup[(tmp >> 9) & 0x1f]);
+    output.push(lookup[(tmp >> 4) & 0x1f]);
+    tmp = ((tmp & 0xf) << 16) |
+      ((uint8[i + 3]! << 8) & 0xff00) |
+      (uint8[i + 4]! & 0xff);
+    output.push(lookup[(tmp >> 15) & 0x1f]);
+    output.push(lookup[(tmp >> 10) & 0x1f]);
+    output.push(lookup[(tmp >> 5) & 0x1f]);
+    output.push(lookup[tmp & 0x1f]);
+  }
+  return output.join("");
+}
+
+/**
+ * Encodes the given data using the lookup table.
+ *
+ * @param data The data to encode.
+ * @param lookup The lookup table.
+ * @returns The encoded string.
+ */
+export function encode(
+  data: ArrayBuffer | Uint8Array | string,
+  lookup: ReadonlyArray<string>,
+): string {
+  const uint8 = validateBinaryLike(data);
+
+  let tmp: number;
+  const len = uint8.length;
+  const extraBytes = len % 5;
+  const parts = [];
+  const maxChunkLength = 16385; // must be multiple of 5
+  const len2 = len - extraBytes;
+
+  // go through the array every 5 bytes, we'll deal with trailing stuff later
+  for (let i = 0; i < len2; i += maxChunkLength) {
+    parts.push(
+      encodeChunk(
+        uint8,
+        i,
+        i + maxChunkLength > len2 ? len2 : i + maxChunkLength,
+        lookup,
+      ),
+    );
+  }
+
+  // pad the end with zeros, but make sure to not forget the extra bytes
+  if (extraBytes === 4) {
+    tmp = ((uint8[len2]! & 0xff) << 16) |
+      ((uint8[len2 + 1]! & 0xff) << 8) |
+      (uint8[len2 + 2]! & 0xff);
+    parts.push(lookup[(tmp >> 19) & 0x1f]);
+    parts.push(lookup[(tmp >> 14) & 0x1f]);
+    parts.push(lookup[(tmp >> 9) & 0x1f]);
+    parts.push(lookup[(tmp >> 4) & 0x1f]);
+    tmp = ((tmp & 0xf) << 11) | (uint8[len2 + 3]! << 3);
+    parts.push(lookup[(tmp >> 10) & 0x1f]);
+    parts.push(lookup[(tmp >> 5) & 0x1f]);
+    parts.push(lookup[tmp & 0x1f]);
+    parts.push("=");
+  } else if (extraBytes === 3) {
+    tmp = ((uint8[len2]! & 0xff) << 17) |
+      ((uint8[len2 + 1]! & 0xff) << 9) |
+      ((uint8[len2 + 2]! & 0xff) << 1);
+    parts.push(lookup[(tmp >> 20) & 0x1f]);
+    parts.push(lookup[(tmp >> 15) & 0x1f]);
+    parts.push(lookup[(tmp >> 10) & 0x1f]);
+    parts.push(lookup[(tmp >> 5) & 0x1f]);
+    parts.push(lookup[tmp & 0x1f]);
+    parts.push("===");
+  } else if (extraBytes === 2) {
+    tmp = ((uint8[len2]! & 0xff) << 12) | ((uint8[len2 + 1]! & 0xff) << 4);
+    parts.push(lookup[(tmp >> 15) & 0x1f]);
+    parts.push(lookup[(tmp >> 10) & 0x1f]);
+    parts.push(lookup[(tmp >> 5) & 0x1f]);
+    parts.push(lookup[tmp & 0x1f]);
+    parts.push("====");
+  } else if (extraBytes === 1) {
+    tmp = (uint8[len2]! & 0xff) << 2;
+    parts.push(lookup[(tmp >> 5) & 0x1f]);
+    parts.push(lookup[tmp & 0x1f]);
+    parts.push("======");
+  }
+
+  return parts.join("");
+}

package/src/deps/jsr.io/@std/encoding/1.0.6/_validate_binary_like.ts

@@ -0,0 +1,29 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+
+const encoder = new TextEncoder();
+
+function getTypeName(value: unknown): string {
+  const type = typeof value;
+  if (type !== "object") {
+    return type;
+  } else if (value === null) {
+    return "null";
+  } else {
+    return value?.constructor?.name ?? "object";
+  }
+}
+
+export function validateBinaryLike(source: unknown): Uint8Array {
+  if (typeof source === "string") {
+    return encoder.encode(source);
+  } else if (source instanceof Uint8Array) {
+    return source;
+  } else if (source instanceof ArrayBuffer) {
+    return new Uint8Array(source);
+  }
+  throw new TypeError(
+    `Cannot validate the input as it must be a Uint8Array, a string, or an ArrayBuffer: received a value of the type ${
+      getTypeName(source)
+    }`,
+  );
+}

package/src/deps/jsr.io/@std/encoding/1.0.6/ascii85.ts

@@ -0,0 +1,203 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+
+/**
+ * Utilities for working with {@link https://en.wikipedia.org/wiki/Ascii85 | ascii85} encoding.
+ *
+ * ## Specifying a standard and delimiter
+ *
+ * By default, all functions are using the most popular Adobe version of ascii85
+ * and not adding any delimiter. However, there are three more standards
+ * supported - btoa (different delimiter and additional compression of 4 bytes
+ * equal to 32), {@link https://rfc.zeromq.org/spec/32/ | Z85} and
+ * {@link https://www.rfc-editor.org/rfc/rfc1924.html | RFC 1924}. It's possible to use a
+ * different encoding by specifying it in `options` object as a second parameter.
+ *
+ * Similarly, it's possible to make `encode` add a delimiter (`<~` and `~>` for
+ * Adobe, `xbtoa Begin` and `xbtoa End` with newlines between the delimiters and
+ * encoded data for btoa. Checksums for btoa are not supported. Delimiters are not
+ * supported by other encodings.)
+ *
+ * @module
+ */
+
+import { validateBinaryLike } from "./_validate_binary_like.js";
+
+/**
+ * Supported ascii85 standards for {@linkcode EncodeAscii85Options} and
+ * {@linkcode DecodeAscii85Options}.
+ */
+export type Ascii85Standard = "Adobe" | "btoa" | "RFC 1924" | "Z85";
+
+/** Options for {@linkcode encodeAscii85}. */
+export interface EncodeAscii85Options {
+  /**
+   * Character set and delimiter (if supported and used).
+   *
+   * @default {"Adobe"}
+   */
+  standard?: Ascii85Standard;
+  /**
+   * Whether to use a delimiter (if supported).
+   *
+   * @default {false}
+   */
+  delimiter?: boolean;
+}
+
+const rfc1924 =
+  "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~" as const;
+const Z85 =
+  "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?&<>()[]{}@%$#" as const;
+
+/**
+ * Converts data into an ascii85-encoded string.
+ *
+ * @param data The data to encode.
+ * @param options Options for encoding.
+ *
+ * @returns The ascii85-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeAscii85 } from "@std/encoding/ascii85";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeAscii85("Hello world!"), "87cURD]j7BEbo80");
+ * ```
+ */
+export function encodeAscii85(
+  data: ArrayBuffer | Uint8Array | string,
+  options: EncodeAscii85Options = {},
+): string {
+  let uint8 = validateBinaryLike(data);
+
+  const { standard = "Adobe" } = options;
+
+  let output: string[] = [];
+  let v: number;
+  let n = 0;
+  let difference = 0;
+  if (uint8.length % 4 !== 0) {
+    const tmp = uint8;
+    difference = 4 - (tmp.length % 4);
+    uint8 = new Uint8Array(tmp.length + difference);
+    uint8.set(tmp);
+  }
+  const view = new DataView(uint8.buffer, uint8.byteOffset, uint8.byteLength);
+  for (let i = 0; i < uint8.length; i += 4) {
+    v = view.getUint32(i);
+    // Adobe and btoa standards compress 4 zeroes to single "z" character
+    if (
+      (standard === "Adobe" || standard === "btoa") &&
+      v === 0 &&
+      i < uint8.length - difference - 3
+    ) {
+      output[n++] = "z";
+      continue;
+    }
+    // btoa compresses 4 spaces - that is, bytes equal to 32 - into single "y" character
+    if (standard === "btoa" && v === 538976288) {
+      output[n++] = "y";
+      continue;
+    }
+    for (let j = 4; j >= 0; j--) {
+      output[n + j] = String.fromCharCode((v % 85) + 33);
+      v = Math.trunc(v / 85);
+    }
+    n += 5;
+  }
+  switch (standard) {
+    case "Adobe":
+      if (options?.delimiter) {
+        return `<~${output.slice(0, output.length - difference).join("")}~>`;
+      }
+      break;
+    case "btoa":
+      if (options?.delimiter) {
+        return `xbtoa Begin\n${
+          output
+            .slice(0, output.length - difference)
+            .join("")
+        }\nxbtoa End`;
+      }
+      break;
+    case "RFC 1924":
+      output = output.map((val) => rfc1924[val.charCodeAt(0) - 33]!);
+      break;
+    case "Z85":
+      output = output.map((val) => Z85[val.charCodeAt(0) - 33]!);
+      break;
+  }
+  return output.slice(0, output.length - difference).join("");
+}
+
+/** Options for {@linkcode decodeAscii85}. */
+export type DecodeAscii85Options = Omit<EncodeAscii85Options, "delimiter">;
+
+/**
+ * Decodes a ascii85-encoded string.
+ *
+ * @param ascii85 The ascii85-encoded string to decode.
+ * @param options Options for decoding.
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeAscii85 } from "@std/encoding/ascii85";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeAscii85("87cURD]j7BEbo80"),
+ *   new TextEncoder().encode("Hello world!"),
+ * );
+ * ```
+ */
+export function decodeAscii85(
+  ascii85: string,
+  options: DecodeAscii85Options = {},
+): Uint8Array {
+  const { standard = "Adobe" } = options;
+
+  // translate all encodings to most basic adobe/btoa one and decompress some special characters ("z" and "y")
+  switch (standard) {
+    case "Adobe":
+      ascii85 = ascii85.replaceAll(/(<~|~>)/g, "").replaceAll("z", "!!!!!");
+      break;
+    case "btoa":
+      ascii85 = ascii85
+        .replaceAll(/(xbtoa Begin|xbtoa End|\n)/g, "")
+        .replaceAll("z", "!!!!!")
+        .replaceAll("y", "+<VdL");
+      break;
+    case "RFC 1924":
+      ascii85 = ascii85.replaceAll(
+        /./g,
+        (match) => String.fromCharCode(rfc1924.indexOf(match) + 33),
+      );
+      break;
+    case "Z85":
+      ascii85 = ascii85.replaceAll(
+        /./g,
+        (match) => String.fromCharCode(Z85.indexOf(match) + 33),
+      );
+      break;
+  }
+  // remove all invalid characters
+  ascii85 = ascii85.replaceAll(/[^!-u]/g, "");
+  const len = ascii85.length;
+  const output = new Uint8Array(len + 4 - (len % 4));
+  const view = new DataView(output.buffer);
+  let v = 0;
+  let n = 0;
+  let max = 0;
+  for (let i = 0; i < len;) {
+    for (max += 5; i < max; i++) {
+      v = v * 85 + (i < len ? ascii85.charCodeAt(i) : 117) - 33;
+    }
+    view.setUint32(n, v);
+    v = 0;
+    n += 4;
+  }
+  return output.slice(0, Math.trunc(len * 0.8));
+}

package/src/deps/jsr.io/@std/encoding/1.0.6/base32.ts

@@ -0,0 +1,73 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// Copyright (c) 2014 Jameson Little. MIT License.
+// This module is browser compatible.
+
+/**
+ * Utilities for
+ * {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6 | base32}
+ * encoding and decoding.
+ *
+ * Modified from {@link https://github.com/beatgammit/base64-js}.
+ *
+ * ```ts
+ * import { encodeBase32, decodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeBase32("foobar"), "MZXW6YTBOI======");
+ *
+ * assertEquals(
+ *   decodeBase32("MZXW6YTBOI======"),
+ *   new TextEncoder().encode("foobar")
+ * );
+ * ```
+ *
+ * @module
+ */
+import { decode, encode } from "./_base32_common.js";
+
+const lookup: string[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567".split("");
+const revLookup: number[] = [];
+lookup.forEach((c, i) => (revLookup[c.charCodeAt(0)] = i));
+
+/**
+ * Decodes a base32-encoded string.
+ *
+ * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6}
+ *
+ * @param b32 The base32-encoded string to decode.
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeBase32("GZRTMMDDGA======"),
+ *   new TextEncoder().encode("6c60c0"),
+ * );
+ * ```
+ */
+export function decodeBase32(b32: string): Uint8Array {
+  return decode(b32, lookup);
+}
+
+/**
+ * Converts data into a base32-encoded string.
+ *
+ * @see {@link https://www.rfc-editor.org/rfc/rfc4648.html#section-6}
+ *
+ * @param data The data to encode.
+ * @returns The base32-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeBase32 } from "@std/encoding/base32";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeBase32("6c60c0"), "GZRTMMDDGA======");
+ * ```
+ */
+export function encodeBase32(data: ArrayBuffer | Uint8Array | string): string {
+  return encode(data, lookup);
+}

package/src/deps/jsr.io/@std/encoding/1.0.6/base58.ts

@@ -0,0 +1,173 @@
+// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
+// This module is browser compatible.
+
+/**
+ * Utilities for
+ * {@link https://datatracker.ietf.org/doc/html/draft-msporny-base58-03 | base58}
+ * encoding and decoding.
+ *
+ * ```ts
+ * import { encodeBase58, decodeBase58 } from "@std/encoding/base58";
+ * import { assertEquals } from "@std/assert";
+ *
+ * const hello = new TextEncoder().encode("Hello World!");
+ *
+ * assertEquals(encodeBase58(hello), "2NEpo7TZRRrLZSi2U");
+ *
+ * assertEquals(decodeBase58("2NEpo7TZRRrLZSi2U"), hello);
+ * ```
+ *
+ * @module
+ */
+
+import { validateBinaryLike } from "./_validate_binary_like.js";
+
+// deno-fmt-ignore
+const mapBase58: Record<string, number> = {
+  "1": 0, "2": 1, "3": 2, "4": 3, "5": 4, "6": 5, "7": 6, "8": 7, "9": 8, A: 9,
+  B: 10, C: 11, D: 12, E: 13, F: 14, G: 15, H: 16, J: 17, K: 18, L: 19, M: 20,
+  N: 21, P: 22, Q: 23, R: 24, S: 25, T: 26, U: 27, V: 28, W: 29, X: 30, Y: 31,
+  Z: 32, a: 33, b: 34, c: 35, d: 36, e: 37, f: 38, g: 39, h: 40, i: 41, j: 42,
+  k: 43, m: 44, n: 45, o: 46, p: 47, q: 48, r: 49, s: 50, t: 51, u: 52, v: 53,
+  w: 54, x: 55, y: 56, z: 57
+};
+
+const base58alphabet =
+  "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz".split("");
+
+/**
+ * Converts data into a base58-encoded string.
+ *
+ * @see {@link https://datatracker.ietf.org/doc/html/draft-msporny-base58-03#section-3}
+ *
+ * @param data The data to encode.
+ * @returns The base58-encoded string.
+ *
+ * @example Usage
+ * ```ts
+ * import { encodeBase58 } from "@std/encoding/base58";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(encodeBase58("Hello World!"), "2NEpo7TZRRrLZSi2U");
+ * ```
+ */
+export function encodeBase58(data: ArrayBuffer | Uint8Array | string): string {
+  const uint8tData = validateBinaryLike(data);
+
+  let length = 0;
+  let zeroes = 0;
+
+  // Counting leading zeroes
+  let index = 0;
+  while (uint8tData[index] === 0) {
+    zeroes++;
+    index++;
+  }
+
+  const notZeroUint8Data = uint8tData.slice(index);
+
+  const size = Math.round((uint8tData.length * 138) / 100 + 1);
+  const b58Encoding: number[] = [];
+
+  notZeroUint8Data.forEach((byte) => {
+    let i = 0;
+    let carry = byte;
+
+    for (
+      let reverseIterator = size - 1;
+      (carry > 0 || i < length) && reverseIterator !== -1;
+      reverseIterator--, i++
+    ) {
+      carry += (b58Encoding[reverseIterator] ?? 0) * 256;
+      b58Encoding[reverseIterator] = Math.round(carry % 58);
+      carry = Math.floor(carry / 58);
+    }
+
+    length = i;
+  });
+
+  const strResult: string[] = Array.from({
+    length: b58Encoding.length + zeroes,
+  });
+
+  if (zeroes > 0) {
+    strResult.fill("1", 0, zeroes);
+  }
+
+  b58Encoding.forEach((byteValue) =>
+    strResult.push(base58alphabet[byteValue]!)
+  );
+
+  return strResult.join("");
+}
+
+/**
+ * Decodes a base58-encoded string.
+ *
+ * @see {@link https://datatracker.ietf.org/doc/html/draft-msporny-base58-03#section-4}
+ *
+ * @param b58 The base58-encoded string to decode.
+ * @returns The decoded data.
+ *
+ * @example Usage
+ * ```ts
+ * import { decodeBase58 } from "@std/encoding/base58";
+ * import { assertEquals } from "@std/assert";
+ *
+ * assertEquals(
+ *   decodeBase58("2NEpo7TZRRrLZSi2U"),
+ *   new TextEncoder().encode("Hello World!")
+ * );
+ * ```
+ */
+export function decodeBase58(b58: string): Uint8Array {
+  const splitInput = b58.trim().split("");
+
+  let length = 0;
+  let ones = 0;
+
+  // Counting leading ones
+  let index = 0;
+  while (splitInput[index] === "1") {
+    ones++;
+    index++;
+  }
+
+  const notZeroData = splitInput.slice(index);
+
+  const size = Math.round((b58.length * 733) / 1000 + 1);
+  const output: number[] = [];
+
+  notZeroData.forEach((char, idx) => {
+    let carry = mapBase58[char];
+    let i = 0;
+
+    if (carry === undefined) {
+      throw new TypeError(
+        `Invalid base58 char at index ${idx} with value ${char}`,
+      );
+    }
+
+    for (
+      let reverseIterator = size - 1;
+      (carry > 0 || i < length) && reverseIterator !== -1;
+      reverseIterator--, i++
+    ) {
+      carry += 58 * (output[reverseIterator] ?? 0);
+      output[reverseIterator] = Math.round(carry % 256);
+      carry = Math.floor(carry / 256);
+    }
+
+    length = i;
+  });
+
+  const validOutput = output.filter((item) => item !== undefined);
+
+  if (ones > 0) {
+    const onesResult = Array.from({ length: ones }).fill(0, 0, ones);
+
+    return new Uint8Array([...onesResult, ...validOutput] as number[]);
+  }
+
+  return new Uint8Array(validOutput);
+}