diff --git a/.trunk/trunk.yaml b/.trunk/trunk.yaml
index ef756fdfb..326b246da 100644
--- a/.trunk/trunk.yaml
+++ b/.trunk/trunk.yaml
@@ -38,6 +38,7 @@ lint:
paths:
- contracts/audited/burn_zrc2 # eslint barfs on an internal error if you enable it on this directory.
- contracts/reward_control # and again
+ - products/bech32-hex-converter # eslint chokes.
- linters: [ALL]
paths:
- products/airdrop/**
diff --git a/products/bech32-hex-converter/.gitignore b/products/bech32-hex-converter/.gitignore
new file mode 100644
index 000000000..c4ca8366c
--- /dev/null
+++ b/products/bech32-hex-converter/.gitignore
@@ -0,0 +1,4 @@
+*~
+\#*
+.\#*
+
diff --git a/products/bech32-hex-converter/README.md b/products/bech32-hex-converter/README.md
new file mode 100644
index 000000000..83da3bf49
--- /dev/null
+++ b/products/bech32-hex-converter/README.md
@@ -0,0 +1,17 @@
+# zil <-> hex format converter
+
+This is a quick demo of an in-browser Bech32 (`zil1...`) to hex (and back) converter.
+
+Run the web server of your choice on the documents in `content/` and point your browser at `index.html`.
+
+If you want server-side, just grab `content/js/chain.js` and use it (`buffer.js` is just a polyfill for node-js `buffer`).
+
+If you are on Linux:
+
+```sh
+docker compose up
+```
+
+Should get you a copy of nginx on port 3000 which serves the content.
+
+If you have problems please contact your Zilliqa support contact, or [richard@zilliqa.com](mailto:richard@zilliqa.com).
diff --git a/products/bech32-hex-converter/content/index.html b/products/bech32-hex-converter/content/index.html
new file mode 100644
index 000000000..cc70c8763
--- /dev/null
+++ b/products/bech32-hex-converter/content/index.html
@@ -0,0 +1,67 @@
+
+
+ Sample bech32 <-> hex converter
+
+
+
+
+
+
Zil <-> 0x converter
+
+
+ Type a `zil1...` or a hex (`0x..`) address into the box below and hit the
+ convert button to convert to the other format.
+
+
The copy button copies the current contents of the typein
+
+
+ js/chain.js contains the converter code; buttons are registered
+ using addEventListener for purely historical reasons
+
+
+ js/buffer.js is just a browser-based node polyfill used so we can
+ use the same code for node and in browser.
+
+ WARNING! This code just converts address presentation formats. It will not
+ help you send a transaction for a Zilliqa wallet to an EVM contract, or vice
+ versa. If you have questions about this, please contact your Zilliqa support
+ contact or richard@zilliqa.com .
+
+
diff --git a/products/bech32-hex-converter/content/js/buffer.js b/products/bech32-hex-converter/content/js/buffer.js
new file mode 100644
index 000000000..7f0da5ef5
--- /dev/null
+++ b/products/bech32-hex-converter/content/js/buffer.js
@@ -0,0 +1,2309 @@
+/*!
+ * The buffer module from node.js, for the browser.
+ *
+ * @author Feross Aboukhadijeh
+ * @license MIT
+ */
+/* eslint-disable no-proto */
+
+"use strict";
+
+const customInspectSymbol =
+ typeof Symbol === "function" && typeof Symbol["for"] === "function" // eslint-disable-line dot-notation
+ ? Symbol["for"]("nodejs.util.inspect.custom") // eslint-disable-line dot-notation
+ : null;
+
+const K_MAX_LENGTH = 0x7fffffff;
+
+/**
+ * Not used internally, but exported to maintain api compatability
+ * Uses 32-bit implementation value from Node defined in String:kMaxLength
+ *
+ * @see https://github.com/nodejs/node/blob/main/deps/v8/include/v8-primitive.h#L126
+ * @see https://github.com/nodejs/node/blob/main/src/node_buffer.cc#L1298
+ * @see https://github.com/nodejs/node/blob/main/lib/buffer.js#L142
+ */
+const K_STRING_MAX_LENGTH = (1 << 28) - 16;
+/**
+ * If `Buffer.TYPED_ARRAY_SUPPORT`:
+ * === true Use Uint8Array implementation (fastest)
+ * === false Print warning and recommend using `buffer` v4.x which has an Object
+ * implementation (most compatible, even IE6)
+ *
+ * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
+ * Opera 11.6+, iOS 4.2+.
+ *
+ * We report that the browser does not support typed arrays if the are not subclassable
+ * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`
+ * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support
+ * for __proto__ and has a buggy typed array implementation.
+ */
+Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport();
+
+if (
+ !Buffer.TYPED_ARRAY_SUPPORT &&
+ typeof console !== "undefined" &&
+ typeof console.error === "function"
+) {
+ console.error(
+ "This browser lacks typed array (Uint8Array) support which is required by " +
+ "`buffer` v5.x. Use `buffer` v4.x if you require old browser support.",
+ );
+}
+
+function typedArraySupport() {
+ // Can typed array instances be augmented?
+ try {
+ const arr = new Uint8Array(1);
+ const proto = {
+ foo: function () {
+ return 42;
+ },
+ };
+ Object.setPrototypeOf(proto, Uint8Array.prototype);
+ Object.setPrototypeOf(arr, proto);
+ return arr.foo() === 42;
+ } catch (e) {
+ return false;
+ }
+}
+
+Object.defineProperty(Buffer.prototype, "parent", {
+ enumerable: true,
+ get: function () {
+ if (!Buffer.isBuffer(this)) return undefined;
+ return this.buffer;
+ },
+});
+
+Object.defineProperty(Buffer.prototype, "offset", {
+ enumerable: true,
+ get: function () {
+ if (!Buffer.isBuffer(this)) return undefined;
+ return this.byteOffset;
+ },
+});
+
+function createBuffer(length) {
+ if (length > K_MAX_LENGTH) {
+ throw new RangeError(
+ 'The value "' + length + '" is invalid for option "size"',
+ );
+ }
+ // Return an augmented `Uint8Array` instance
+ const buf = new Uint8Array(length);
+ Object.setPrototypeOf(buf, Buffer.prototype);
+ return buf;
+}
+
+/**
+ * The Buffer constructor returns instances of `Uint8Array` that have their
+ * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
+ * `Uint8Array`, so the returned instances will have all the node `Buffer` methods
+ * and the `Uint8Array` methods. Square bracket notation works as expected -- it
+ * returns a single octet.
+ *
+ * The `Uint8Array` prototype remains unmodified.
+ */
+
+function Buffer(arg, encodingOrOffset, length) {
+ // Common case.
+ if (typeof arg === "number") {
+ if (typeof encodingOrOffset === "string") {
+ throw new TypeError(
+ 'The "string" argument must be of type string. Received type number',
+ );
+ }
+ return allocUnsafe(arg);
+ }
+ return from(arg, encodingOrOffset, length);
+}
+
+Buffer.poolSize = 8192; // not used by this implementation
+
+function from(value, encodingOrOffset, length) {
+ if (typeof value === "string") {
+ return fromString(value, encodingOrOffset);
+ }
+
+ if (ArrayBuffer.isView(value)) {
+ return fromArrayView(value);
+ }
+
+ if (value == null) {
+ throw new TypeError(
+ "The first argument must be one of type string, Buffer, ArrayBuffer, Array, " +
+ "or Array-like Object. Received type " +
+ typeof value,
+ );
+ }
+
+ if (
+ isInstance(value, ArrayBuffer) ||
+ (value && isInstance(value.buffer, ArrayBuffer))
+ ) {
+ return fromArrayBuffer(value, encodingOrOffset, length);
+ }
+
+ if (
+ typeof SharedArrayBuffer !== "undefined" &&
+ (isInstance(value, SharedArrayBuffer) ||
+ (value && isInstance(value.buffer, SharedArrayBuffer)))
+ ) {
+ return fromArrayBuffer(value, encodingOrOffset, length);
+ }
+
+ if (typeof value === "number") {
+ throw new TypeError(
+ 'The "value" argument must not be of type number. Received type number',
+ );
+ }
+
+ const valueOf = value.valueOf && value.valueOf();
+ if (valueOf != null && valueOf !== value) {
+ return Buffer.from(valueOf, encodingOrOffset, length);
+ }
+
+ const b = fromObject(value);
+ if (b) return b;
+
+ if (
+ typeof Symbol !== "undefined" &&
+ Symbol.toPrimitive != null &&
+ typeof value[Symbol.toPrimitive] === "function"
+ ) {
+ return Buffer.from(
+ value[Symbol.toPrimitive]("string"),
+ encodingOrOffset,
+ length,
+ );
+ }
+
+ throw new TypeError(
+ "The first argument must be one of type string, Buffer, ArrayBuffer, Array, " +
+ "or Array-like Object. Received type " +
+ typeof value,
+ );
+}
+
+/**
+ * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
+ * if value is a number.
+ * Buffer.from(str[, encoding])
+ * Buffer.from(array)
+ * Buffer.from(buffer)
+ * Buffer.from(arrayBuffer[, byteOffset[, length]])
+ **/
+Buffer.from = function (value, encodingOrOffset, length) {
+ return from(value, encodingOrOffset, length);
+};
+
+// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:
+// https://github.com/feross/buffer/pull/148
+Object.setPrototypeOf(Buffer.prototype, Uint8Array.prototype);
+Object.setPrototypeOf(Buffer, Uint8Array);
+
+function assertSize(size) {
+ if (typeof size !== "number") {
+ throw new TypeError('"size" argument must be of type number');
+ } else if (size < 0) {
+ throw new RangeError(
+ 'The value "' + size + '" is invalid for option "size"',
+ );
+ }
+}
+
+function alloc(size, fill, encoding) {
+ assertSize(size);
+ if (size <= 0) {
+ return createBuffer(size);
+ }
+ if (fill !== undefined) {
+ // Only pay attention to encoding if it's a string. This
+ // prevents accidentally sending in a number that would
+ // be interpreted as a start offset.
+ return typeof encoding === "string"
+ ? createBuffer(size).fill(fill, encoding)
+ : createBuffer(size).fill(fill);
+ }
+ return createBuffer(size);
+}
+
+/**
+ * Creates a new filled Buffer instance.
+ * alloc(size[, fill[, encoding]])
+ **/
+Buffer.alloc = function (size, fill, encoding) {
+ return alloc(size, fill, encoding);
+};
+
+function allocUnsafe(size) {
+ assertSize(size);
+ return createBuffer(size < 0 ? 0 : checked(size) | 0);
+}
+
+/**
+ * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
+ * */
+Buffer.allocUnsafe = function (size) {
+ return allocUnsafe(size);
+};
+/**
+ * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
+ */
+Buffer.allocUnsafeSlow = function (size) {
+ return allocUnsafe(size);
+};
+
+function fromString(string, encoding) {
+ if (typeof encoding !== "string" || encoding === "") {
+ encoding = "utf8";
+ }
+
+ if (!Buffer.isEncoding(encoding)) {
+ throw new TypeError("Unknown encoding: " + encoding);
+ }
+
+ const length = byteLength(string, encoding) | 0;
+ let buf = createBuffer(length);
+
+ const actual = buf.write(string, encoding);
+
+ if (actual !== length) {
+ // Writing a hex string, for example, that contains invalid characters will
+ // cause everything after the first invalid character to be ignored. (e.g.
+ // 'abxxcd' will be treated as 'ab')
+ buf = buf.slice(0, actual);
+ }
+
+ return buf;
+}
+
+function fromArrayLike(array) {
+ const length = array.length < 0 ? 0 : checked(array.length) | 0;
+ const buf = createBuffer(length);
+ for (let i = 0; i < length; i += 1) {
+ buf[i] = array[i] & 255;
+ }
+ return buf;
+}
+
+function fromArrayView(arrayView) {
+ if (isInstance(arrayView, Uint8Array)) {
+ const copy = new Uint8Array(arrayView);
+ return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength);
+ }
+ return fromArrayLike(arrayView);
+}
+
+function fromArrayBuffer(array, byteOffset, length) {
+ if (byteOffset < 0 || array.byteLength < byteOffset) {
+ throw new RangeError('"offset" is outside of buffer bounds');
+ }
+
+ if (array.byteLength < byteOffset + (length || 0)) {
+ throw new RangeError('"length" is outside of buffer bounds');
+ }
+
+ let buf;
+ if (byteOffset === undefined && length === undefined) {
+ buf = new Uint8Array(array);
+ } else if (length === undefined) {
+ buf = new Uint8Array(array, byteOffset);
+ } else {
+ buf = new Uint8Array(array, byteOffset, length);
+ }
+
+ // Return an augmented `Uint8Array` instance
+ Object.setPrototypeOf(buf, Buffer.prototype);
+
+ return buf;
+}
+
+function fromObject(obj) {
+ if (Buffer.isBuffer(obj)) {
+ // Note: Probably not necessary anymore.
+ const len = checked(obj.length) | 0;
+ const buf = createBuffer(len);
+
+ if (buf.length === 0) {
+ return buf;
+ }
+
+ obj.copy(buf, 0, 0, len);
+ return buf;
+ }
+
+ if (obj.length !== undefined) {
+ if (typeof obj.length !== "number" || numberIsNaN(obj.length)) {
+ return createBuffer(0);
+ }
+ return fromArrayLike(obj);
+ }
+
+ if (obj.type === "Buffer" && Array.isArray(obj.data)) {
+ return fromArrayLike(obj.data);
+ }
+}
+
+function checked(length) {
+ // Note: cannot use `length < K_MAX_LENGTH` here because that fails when
+ // length is NaN (which is otherwise coerced to zero.)
+ if (length >= K_MAX_LENGTH) {
+ throw new RangeError(
+ "Attempt to allocate Buffer larger than maximum " +
+ "size: 0x" +
+ K_MAX_LENGTH.toString(16) +
+ " bytes",
+ );
+ }
+ return length | 0;
+}
+
+function SlowBuffer(length) {
+ if (+length != length) {
+ // eslint-disable-line eqeqeq
+ length = 0;
+ }
+ return Buffer.alloc(+length);
+}
+
+Buffer.isBuffer = function isBuffer(b) {
+ return b != null && b._isBuffer === true && b !== Buffer.prototype; // so Buffer.isBuffer(Buffer.prototype) will be false
+};
+
+Buffer.compare = function compare(a, b) {
+ if (!isInstance(a, Uint8Array) || !isInstance(b, Uint8Array)) {
+ throw new TypeError(
+ 'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array',
+ );
+ }
+
+ if (a === b) return 0;
+
+ let x = a.length;
+ let y = b.length;
+
+ for (let i = 0, len = Math.min(x, y); i < len; ++i) {
+ if (a[i] !== b[i]) {
+ x = a[i];
+ y = b[i];
+ break;
+ }
+ }
+
+ if (x < y) return -1;
+ if (y < x) return 1;
+ return 0;
+};
+
+Buffer.isEncoding = function isEncoding(encoding) {
+ switch (String(encoding).toLowerCase()) {
+ case "hex":
+ case "utf8":
+ case "utf-8":
+ case "ascii":
+ case "latin1":
+ case "binary":
+ case "base64":
+ case "ucs2":
+ case "ucs-2":
+ case "utf16le":
+ case "utf-16le":
+ return true;
+ default:
+ return false;
+ }
+};
+
+Buffer.concat = function concat(list, length) {
+ if (!Array.isArray(list)) {
+ throw new TypeError('"list" argument must be an Array of Buffers');
+ }
+
+ if (list.length === 0) {
+ return Buffer.alloc(0);
+ }
+
+ let i;
+ if (length === undefined) {
+ length = 0;
+ for (i = 0; i < list.length; ++i) {
+ length += list[i].length;
+ }
+ }
+
+ const buffer = Buffer.allocUnsafe(length);
+ let pos = 0;
+ for (i = 0; i < list.length; ++i) {
+ const buf = list[i];
+ if (!isInstance(buf, Uint8Array)) {
+ throw new TypeError('"list" argument must be an Array of Buffers');
+ }
+ if (pos + buf.length > buffer.length) {
+ buffer.set(buf.subarray(0, buffer.length - pos), pos);
+ break;
+ }
+ buffer.set(buf, pos);
+ pos += buf.length;
+ }
+ return buffer;
+};
+
+function byteLength(string, encoding) {
+ if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {
+ return string.byteLength;
+ }
+ if (
+ typeof SharedArrayBuffer !== "undefined" &&
+ isInstance(string, SharedArrayBuffer)
+ ) {
+ return string.byteLength;
+ }
+ if (typeof string !== "string") {
+ throw new TypeError(
+ 'The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' +
+ "Received type " +
+ typeof string,
+ );
+ }
+
+ const len = string.length;
+ const mustMatch = arguments.length > 2 && arguments[2] === true;
+ if (!mustMatch && len === 0) return 0;
+
+ // Use a for loop to avoid recursion
+ let loweredCase = false;
+ for (;;) {
+ switch (encoding) {
+ case "ascii":
+ case "latin1":
+ case "binary":
+ return len;
+ case "utf8":
+ case "utf-8":
+ return utf8ToBytes(string).length;
+ case "ucs2":
+ case "ucs-2":
+ case "utf16le":
+ case "utf-16le":
+ return len * 2;
+ case "hex":
+ return len >>> 1;
+ case "base64":
+ return base64ToBytes(string).length;
+ default:
+ if (loweredCase) {
+ return mustMatch ? -1 : utf8ToBytes(string).length; // assume utf8
+ }
+ encoding = ("" + encoding).toLowerCase();
+ loweredCase = true;
+ }
+ }
+}
+Buffer.byteLength = byteLength;
+
+function slowToString(encoding, start, end) {
+ let loweredCase = false;
+
+ // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
+ // property of a typed array.
+
+ // This behaves neither like String nor Uint8Array in that we set start/end
+ // to their upper/lower bounds if the value passed is out of range.
+ // undefined is handled specially as per ECMA-262 6th Edition,
+ // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
+ if (start === undefined || start < 0) {
+ start = 0;
+ }
+ // Return early if start > this.length. Done here to prevent potential uint32
+ // coercion fail below.
+ if (start > this.length) {
+ return "";
+ }
+
+ if (end === undefined || end > this.length) {
+ end = this.length;
+ }
+
+ if (end <= 0) {
+ return "";
+ }
+
+ // Force coercion to uint32. This will also coerce falsey/NaN values to 0.
+ end >>>= 0;
+ start >>>= 0;
+
+ if (end <= start) {
+ return "";
+ }
+
+ if (!encoding) encoding = "utf8";
+
+ while (true) {
+ switch (encoding) {
+ case "hex":
+ return hexSlice(this, start, end);
+
+ case "utf8":
+ case "utf-8":
+ return utf8Slice(this, start, end);
+
+ case "ascii":
+ return asciiSlice(this, start, end);
+
+ case "latin1":
+ case "binary":
+ return latin1Slice(this, start, end);
+
+ case "base64":
+ return base64Slice(this, start, end);
+
+ case "ucs2":
+ case "ucs-2":
+ case "utf16le":
+ case "utf-16le":
+ return utf16leSlice(this, start, end);
+
+ default:
+ if (loweredCase) throw new TypeError("Unknown encoding: " + encoding);
+ encoding = (encoding + "").toLowerCase();
+ loweredCase = true;
+ }
+ }
+}
+
+// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)
+// to detect a Buffer instance. It's not possible to use `instanceof Buffer`
+// reliably in a browserify context because there could be multiple different
+// copies of the 'buffer' package in use. This method works even for Buffer
+// instances that were created from another copy of the `buffer` package.
+// See: https://github.com/feross/buffer/issues/154
+Buffer.prototype._isBuffer = true;
+
+function swap(b, n, m) {
+ const i = b[n];
+ b[n] = b[m];
+ b[m] = i;
+}
+
+Buffer.prototype.swap16 = function swap16() {
+ const len = this.length;
+ if (len % 2 !== 0) {
+ throw new RangeError("Buffer size must be a multiple of 16-bits");
+ }
+ for (let i = 0; i < len; i += 2) {
+ swap(this, i, i + 1);
+ }
+ return this;
+};
+
+Buffer.prototype.swap32 = function swap32() {
+ const len = this.length;
+ if (len % 4 !== 0) {
+ throw new RangeError("Buffer size must be a multiple of 32-bits");
+ }
+ for (let i = 0; i < len; i += 4) {
+ swap(this, i, i + 3);
+ swap(this, i + 1, i + 2);
+ }
+ return this;
+};
+
+Buffer.prototype.swap64 = function swap64() {
+ const len = this.length;
+ if (len % 8 !== 0) {
+ throw new RangeError("Buffer size must be a multiple of 64-bits");
+ }
+ for (let i = 0; i < len; i += 8) {
+ swap(this, i, i + 7);
+ swap(this, i + 1, i + 6);
+ swap(this, i + 2, i + 5);
+ swap(this, i + 3, i + 4);
+ }
+ return this;
+};
+
+Buffer.prototype.toString = function toString() {
+ const length = this.length;
+ if (length === 0) return "";
+ if (arguments.length === 0) return utf8Slice(this, 0, length);
+ return slowToString.apply(this, arguments);
+};
+
+Buffer.prototype.toLocaleString = Buffer.prototype.toString;
+
+Buffer.prototype.equals = function equals(b) {
+ if (this === b) return true;
+ return Buffer.compare(this, b) === 0;
+};
+
+Buffer.prototype.inspect = function inspect() {
+ let str = "";
+ const max = exports.INSPECT_MAX_BYTES;
+ str = this.toString("hex", 0, max)
+ .replace(/(.{2})/g, "$1 ")
+ .trim();
+ if (this.length > max) str += " ... ";
+ return "";
+};
+if (customInspectSymbol) {
+ Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect;
+}
+
+Buffer.prototype.compare = function compare(
+ target,
+ start,
+ end,
+ thisStart,
+ thisEnd,
+) {
+ if (!isInstance(target, Uint8Array)) {
+ throw new TypeError(
+ 'The "target" argument must be one of type Buffer or Uint8Array. ' +
+ "Received type " +
+ typeof target,
+ );
+ }
+
+ if (start === undefined) {
+ start = 0;
+ }
+ if (end === undefined) {
+ end = target ? target.length : 0;
+ }
+ if (thisStart === undefined) {
+ thisStart = 0;
+ }
+ if (thisEnd === undefined) {
+ thisEnd = this.length;
+ }
+
+ if (
+ start < 0 ||
+ end > target.length ||
+ thisStart < 0 ||
+ thisEnd > this.length
+ ) {
+ throw new RangeError("out of range index");
+ }
+
+ if (thisStart >= thisEnd && start >= end) {
+ return 0;
+ }
+ if (thisStart >= thisEnd) {
+ return -1;
+ }
+ if (start >= end) {
+ return 1;
+ }
+
+ start >>>= 0;
+ end >>>= 0;
+ thisStart >>>= 0;
+ thisEnd >>>= 0;
+
+ if (this === target) return 0;
+
+ let x = thisEnd - thisStart;
+ let y = end - start;
+ const len = Math.min(x, y);
+
+ for (let i = 0; i < len; ++i) {
+ if (this[thisStart + i] !== target[start + i]) {
+ x = this[thisStart + i];
+ y = target[start + i];
+ break;
+ }
+ }
+
+ if (x < y) return -1;
+ if (y < x) return 1;
+ return 0;
+};
+
+// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,
+// OR the last index of `val` in `buffer` at offset <= `byteOffset`.
+//
+// Arguments:
+// - buffer - a Buffer to search
+// - val - a string, Buffer, or number
+// - byteOffset - an index into `buffer`; will be clamped to an int32
+// - encoding - an optional encoding, relevant is val is a string
+// - dir - true for indexOf, false for lastIndexOf
+function bidirectionalIndexOf(buffer, val, byteOffset, encoding, dir) {
+ // Empty buffer means no match
+ if (buffer.length === 0) return -1;
+
+ // Normalize byteOffset
+ if (typeof byteOffset === "string") {
+ encoding = byteOffset;
+ byteOffset = 0;
+ } else if (byteOffset > 0x7fffffff) {
+ byteOffset = 0x7fffffff;
+ } else if (byteOffset < -0x80000000) {
+ byteOffset = -0x80000000;
+ }
+ byteOffset = +byteOffset; // Coerce to Number.
+ if (numberIsNaN(byteOffset)) {
+ // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer
+ byteOffset = dir ? 0 : buffer.length - 1;
+ }
+
+ // Normalize byteOffset: negative offsets start from the end of the buffer
+ if (byteOffset < 0) byteOffset = buffer.length + byteOffset;
+ if (byteOffset >= buffer.length) {
+ if (dir) return -1;
+ else byteOffset = buffer.length - 1;
+ } else if (byteOffset < 0) {
+ if (dir) byteOffset = 0;
+ else return -1;
+ }
+
+ // Normalize val
+ if (typeof val === "string") {
+ val = Buffer.from(val, encoding);
+ }
+
+ // Finally, search either indexOf (if dir is true) or lastIndexOf
+ if (Buffer.isBuffer(val)) {
+ // Special case: looking for empty string/buffer always fails
+ if (val.length === 0) {
+ return -1;
+ }
+ return arrayIndexOf(buffer, val, byteOffset, encoding, dir);
+ } else if (typeof val === "number") {
+ val = val & 0xff; // Search for a byte value [0-255]
+ if (typeof Uint8Array.prototype.indexOf === "function") {
+ if (dir) {
+ return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset);
+ } else {
+ return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset);
+ }
+ }
+ return arrayIndexOf(buffer, [val], byteOffset, encoding, dir);
+ }
+
+ throw new TypeError("val must be string, number or Buffer");
+}
+
+function arrayIndexOf(arr, val, byteOffset, encoding, dir) {
+ let indexSize = 1;
+ let arrLength = arr.length;
+ let valLength = val.length;
+
+ if (encoding !== undefined) {
+ encoding = String(encoding).toLowerCase();
+ if (
+ encoding === "ucs2" ||
+ encoding === "ucs-2" ||
+ encoding === "utf16le" ||
+ encoding === "utf-16le"
+ ) {
+ if (arr.length < 2 || val.length < 2) {
+ return -1;
+ }
+ indexSize = 2;
+ arrLength /= 2;
+ valLength /= 2;
+ byteOffset /= 2;
+ }
+ }
+
+ function read(buf, i) {
+ if (indexSize === 1) {
+ return buf[i];
+ } else {
+ return buf.readUInt16BE(i * indexSize);
+ }
+ }
+
+ let i;
+ if (dir) {
+ let foundIndex = -1;
+ for (i = byteOffset; i < arrLength; i++) {
+ if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
+ if (foundIndex === -1) foundIndex = i;
+ if (i - foundIndex + 1 === valLength) return foundIndex * indexSize;
+ } else {
+ if (foundIndex !== -1) i -= i - foundIndex;
+ foundIndex = -1;
+ }
+ }
+ } else {
+ if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;
+ for (i = byteOffset; i >= 0; i--) {
+ let found = true;
+ for (let j = 0; j < valLength; j++) {
+ if (read(arr, i + j) !== read(val, j)) {
+ found = false;
+ break;
+ }
+ }
+ if (found) return i;
+ }
+ }
+
+ return -1;
+}
+
+Buffer.prototype.includes = function includes(val, byteOffset, encoding) {
+ return this.indexOf(val, byteOffset, encoding) !== -1;
+};
+
+Buffer.prototype.indexOf = function indexOf(val, byteOffset, encoding) {
+ return bidirectionalIndexOf(this, val, byteOffset, encoding, true);
+};
+
+Buffer.prototype.lastIndexOf = function lastIndexOf(val, byteOffset, encoding) {
+ return bidirectionalIndexOf(this, val, byteOffset, encoding, false);
+};
+
+function hexWrite(buf, string, offset, length) {
+ offset = Number(offset) || 0;
+ const remaining = buf.length - offset;
+ if (!length) {
+ length = remaining;
+ } else {
+ length = Number(length);
+ if (length > remaining) {
+ length = remaining;
+ }
+ }
+
+ const strLen = string.length;
+
+ if (length > strLen >>> 1) {
+ length = strLen >>> 1;
+ }
+
+ for (let i = 0; i < length; ++i) {
+ const a = string.charCodeAt(i * 2 + 0);
+ const b = string.charCodeAt(i * 2 + 1);
+ const hi = hexCharValueTable[a & 0x7f];
+ const lo = hexCharValueTable[b & 0x7f];
+
+ if ((a | b | hi | lo) & ~0x7f) {
+ return i;
+ }
+
+ buf[offset + i] = (hi << 4) | lo;
+ }
+
+ return length;
+}
+
+function utf8Write(buf, string, offset, length) {
+ return blitBuffer(
+ utf8ToBytes(string, buf.length - offset),
+ buf,
+ offset,
+ length,
+ );
+}
+
+function asciiWrite(buf, string, offset, length) {
+ return blitBuffer(asciiToBytes(string), buf, offset, length);
+}
+
+function base64Write(buf, string, offset, length) {
+ return blitBuffer(base64ToBytes(string), buf, offset, length);
+}
+
+function ucs2Write(buf, string, offset, length) {
+ return blitBuffer(
+ utf16leToBytes(string, buf.length - offset),
+ buf,
+ offset,
+ length,
+ );
+}
+
+Buffer.prototype.write = function write(string, offset, length, encoding) {
+ // Buffer#write(string)
+ if (offset === undefined) {
+ encoding = "utf8";
+ length = this.length;
+ offset = 0;
+ // Buffer#write(string, encoding)
+ } else if (length === undefined && typeof offset === "string") {
+ encoding = offset;
+ length = this.length;
+ offset = 0;
+ // Buffer#write(string, offset[, length][, encoding])
+ } else if (isFinite(offset)) {
+ offset = offset >>> 0;
+ if (isFinite(length)) {
+ length = length >>> 0;
+ if (encoding === undefined) encoding = "utf8";
+ } else {
+ encoding = length;
+ length = undefined;
+ }
+ } else {
+ throw new Error(
+ "Buffer.write(string, encoding, offset[, length]) is no longer supported",
+ );
+ }
+
+ const remaining = this.length - offset;
+ if (length === undefined || length > remaining) length = remaining;
+
+ if (
+ (string.length > 0 && (length < 0 || offset < 0)) ||
+ offset > this.length
+ ) {
+ throw new RangeError("Attempt to write outside buffer bounds");
+ }
+
+ if (!encoding) encoding = "utf8";
+
+ let loweredCase = false;
+ for (;;) {
+ switch (encoding) {
+ case "hex":
+ return hexWrite(this, string, offset, length);
+
+ case "utf8":
+ case "utf-8":
+ return utf8Write(this, string, offset, length);
+
+ case "ascii":
+ case "latin1":
+ case "binary":
+ return asciiWrite(this, string, offset, length);
+
+ case "base64":
+ // Warning: maxLength not taken into account in base64Write
+ return base64Write(this, string, offset, length);
+
+ case "ucs2":
+ case "ucs-2":
+ case "utf16le":
+ case "utf-16le":
+ return ucs2Write(this, string, offset, length);
+
+ default:
+ if (loweredCase) throw new TypeError("Unknown encoding: " + encoding);
+ encoding = ("" + encoding).toLowerCase();
+ loweredCase = true;
+ }
+ }
+};
+
+Buffer.prototype.toJSON = function toJSON() {
+ return {
+ type: "Buffer",
+ data: Array.prototype.slice.call(this, 0),
+ };
+};
+
+function base64Slice(buf, start, end) {
+ if (start === 0 && end === buf.length) {
+ return base64.fromByteArray(buf);
+ } else {
+ return base64.fromByteArray(buf.slice(start, end));
+ }
+}
+
+function utf8Slice(buf, start, end) {
+ end = Math.min(buf.length, end);
+ const res = [];
+
+ let i = start;
+ while (i < end) {
+ const firstByte = buf[i];
+ let codePoint = null;
+ let bytesPerSequence =
+ firstByte > 0xef ? 4 : firstByte > 0xdf ? 3 : firstByte > 0xbf ? 2 : 1;
+
+ if (i + bytesPerSequence <= end) {
+ let secondByte, thirdByte, fourthByte, tempCodePoint;
+
+ switch (bytesPerSequence) {
+ case 1:
+ if (firstByte < 0x80) {
+ codePoint = firstByte;
+ }
+ break;
+ case 2:
+ secondByte = buf[i + 1];
+ if ((secondByte & 0xc0) === 0x80) {
+ tempCodePoint = ((firstByte & 0x1f) << 0x6) | (secondByte & 0x3f);
+ if (tempCodePoint > 0x7f) {
+ codePoint = tempCodePoint;
+ }
+ }
+ break;
+ case 3:
+ secondByte = buf[i + 1];
+ thirdByte = buf[i + 2];
+ if ((secondByte & 0xc0) === 0x80 && (thirdByte & 0xc0) === 0x80) {
+ tempCodePoint =
+ ((firstByte & 0xf) << 0xc) |
+ ((secondByte & 0x3f) << 0x6) |
+ (thirdByte & 0x3f);
+ if (
+ tempCodePoint > 0x7ff &&
+ (tempCodePoint < 0xd800 || tempCodePoint > 0xdfff)
+ ) {
+ codePoint = tempCodePoint;
+ }
+ }
+ break;
+ case 4:
+ secondByte = buf[i + 1];
+ thirdByte = buf[i + 2];
+ fourthByte = buf[i + 3];
+ if (
+ (secondByte & 0xc0) === 0x80 &&
+ (thirdByte & 0xc0) === 0x80 &&
+ (fourthByte & 0xc0) === 0x80
+ ) {
+ tempCodePoint =
+ ((firstByte & 0xf) << 0x12) |
+ ((secondByte & 0x3f) << 0xc) |
+ ((thirdByte & 0x3f) << 0x6) |
+ (fourthByte & 0x3f);
+ if (tempCodePoint > 0xffff && tempCodePoint < 0x110000) {
+ codePoint = tempCodePoint;
+ }
+ }
+ }
+ }
+
+ if (codePoint === null) {
+ // we did not generate a valid codePoint so insert a
+ // replacement char (U+FFFD) and advance only 1 byte
+ codePoint = 0xfffd;
+ bytesPerSequence = 1;
+ } else if (codePoint > 0xffff) {
+ // encode to utf16 (surrogate pair dance)
+ codePoint -= 0x10000;
+ res.push(((codePoint >>> 10) & 0x3ff) | 0xd800);
+ codePoint = 0xdc00 | (codePoint & 0x3ff);
+ }
+
+ res.push(codePoint);
+ i += bytesPerSequence;
+ }
+
+ return decodeCodePointsArray(res);
+}
+
+// Based on http://stackoverflow.com/a/22747272/680742, the browser with
+// the lowest limit is Chrome, with 0x10000 args.
+// We go 1 magnitude less, for safety
+const MAX_ARGUMENTS_LENGTH = 0x1000;
+
+function decodeCodePointsArray(codePoints) {
+ const len = codePoints.length;
+ if (len <= MAX_ARGUMENTS_LENGTH) {
+ return String.fromCharCode.apply(String, codePoints); // avoid extra slice()
+ }
+
+ // Decode in chunks to avoid "call stack size exceeded".
+ let res = "";
+ let i = 0;
+ while (i < len) {
+ res += String.fromCharCode.apply(
+ String,
+ codePoints.slice(i, (i += MAX_ARGUMENTS_LENGTH)),
+ );
+ }
+ return res;
+}
+
+function asciiSlice(buf, start, end) {
+ let ret = "";
+ end = Math.min(buf.length, end);
+
+ for (let i = start; i < end; ++i) {
+ ret += String.fromCharCode(buf[i] & 0x7f);
+ }
+ return ret;
+}
+
+function latin1Slice(buf, start, end) {
+ let ret = "";
+ end = Math.min(buf.length, end);
+
+ for (let i = start; i < end; ++i) {
+ ret += String.fromCharCode(buf[i]);
+ }
+ return ret;
+}
+
+function hexSlice(buf, start, end) {
+ const len = buf.length;
+
+ if (!start || start < 0) start = 0;
+ if (!end || end < 0 || end > len) end = len;
+
+ let out = "";
+ for (let i = start; i < end; ++i) {
+ out += hexSliceLookupTable[buf[i]];
+ }
+ return out;
+}
+
+function utf16leSlice(buf, start, end) {
+ const bytes = buf.slice(start, end);
+ let res = "";
+ // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)
+ for (let i = 0; i < bytes.length - 1; i += 2) {
+ res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);
+ }
+ return res;
+}
+
+Buffer.prototype.slice = function slice(start, end) {
+ const len = this.length;
+ start = ~~start;
+ end = end === undefined ? len : ~~end;
+
+ if (start < 0) {
+ start += len;
+ if (start < 0) start = 0;
+ } else if (start > len) {
+ start = len;
+ }
+
+ if (end < 0) {
+ end += len;
+ if (end < 0) end = 0;
+ } else if (end > len) {
+ end = len;
+ }
+
+ if (end < start) end = start;
+
+ const newBuf = this.subarray(start, end);
+ // Return an augmented `Uint8Array` instance
+ Object.setPrototypeOf(newBuf, Buffer.prototype);
+
+ return newBuf;
+};
+
+/*
+ * Need to make sure that buffer isn't trying to write out of bounds.
+ */
+function checkOffset(offset, ext, length) {
+ if (offset % 1 !== 0 || offset < 0)
+ throw new RangeError("offset is not uint");
+ if (offset + ext > length)
+ throw new RangeError("Trying to access beyond buffer length");
+}
+
+Buffer.prototype.readUintLE = Buffer.prototype.readUIntLE = function readUIntLE(
+ offset,
+ byteLength,
+ noAssert,
+) {
+ offset = offset >>> 0;
+ byteLength = byteLength >>> 0;
+ if (!noAssert) checkOffset(offset, byteLength, this.length);
+
+ let val = this[offset];
+ let mul = 1;
+ let i = 0;
+ while (++i < byteLength && (mul *= 0x100)) {
+ val += this[offset + i] * mul;
+ }
+
+ return val;
+};
+
+Buffer.prototype.readUintBE = Buffer.prototype.readUIntBE = function readUIntBE(
+ offset,
+ byteLength,
+ noAssert,
+) {
+ offset = offset >>> 0;
+ byteLength = byteLength >>> 0;
+ if (!noAssert) {
+ checkOffset(offset, byteLength, this.length);
+ }
+
+ let val = this[offset + --byteLength];
+ let mul = 1;
+ while (byteLength > 0 && (mul *= 0x100)) {
+ val += this[offset + --byteLength] * mul;
+ }
+
+ return val;
+};
+
+Buffer.prototype.readUint8 = Buffer.prototype.readUInt8 = function readUInt8(
+ offset,
+ noAssert,
+) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 1, this.length);
+ return this[offset];
+};
+
+Buffer.prototype.readUint16LE = Buffer.prototype.readUInt16LE =
+ function readUInt16LE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 2, this.length);
+ return this[offset] | (this[offset + 1] << 8);
+ };
+
+Buffer.prototype.readUint16BE = Buffer.prototype.readUInt16BE =
+ function readUInt16BE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 2, this.length);
+ return (this[offset] << 8) | this[offset + 1];
+ };
+
+Buffer.prototype.readUint32LE = Buffer.prototype.readUInt32LE =
+ function readUInt32LE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 4, this.length);
+
+ return (
+ (this[offset] | (this[offset + 1] << 8) | (this[offset + 2] << 16)) +
+ this[offset + 3] * 0x1000000
+ );
+ };
+
+Buffer.prototype.readUint32BE = Buffer.prototype.readUInt32BE =
+ function readUInt32BE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 4, this.length);
+
+ return (
+ this[offset] * 0x1000000 +
+ ((this[offset + 1] << 16) | (this[offset + 2] << 8) | this[offset + 3])
+ );
+ };
+
+Buffer.prototype.readBigUInt64LE = defineBigIntMethod(
+ function readBigUInt64LE(offset) {
+ offset = offset >>> 0;
+ validateNumber(offset, "offset");
+ const first = this[offset];
+ const last = this[offset + 7];
+ if (first === undefined || last === undefined) {
+ boundsError(offset, this.length - 8);
+ }
+
+ const lo =
+ first +
+ this[++offset] * 2 ** 8 +
+ this[++offset] * 2 ** 16 +
+ this[++offset] * 2 ** 24;
+
+ const hi =
+ this[++offset] +
+ this[++offset] * 2 ** 8 +
+ this[++offset] * 2 ** 16 +
+ last * 2 ** 24;
+
+ return BigInt(lo) + (BigInt(hi) << BigInt(32));
+ },
+);
+
+Buffer.prototype.readBigUInt64BE = defineBigIntMethod(
+ function readBigUInt64BE(offset) {
+ offset = offset >>> 0;
+ validateNumber(offset, "offset");
+ const first = this[offset];
+ const last = this[offset + 7];
+ if (first === undefined || last === undefined) {
+ boundsError(offset, this.length - 8);
+ }
+
+ const hi =
+ first * 2 ** 24 +
+ this[++offset] * 2 ** 16 +
+ this[++offset] * 2 ** 8 +
+ this[++offset];
+
+ const lo =
+ this[++offset] * 2 ** 24 +
+ this[++offset] * 2 ** 16 +
+ this[++offset] * 2 ** 8 +
+ last;
+
+ return (BigInt(hi) << BigInt(32)) + BigInt(lo);
+ },
+);
+
+Buffer.prototype.readIntLE = function readIntLE(offset, byteLength, noAssert) {
+ offset = offset >>> 0;
+ byteLength = byteLength >>> 0;
+ if (!noAssert) checkOffset(offset, byteLength, this.length);
+
+ let val = this[offset];
+ let mul = 1;
+ let i = 0;
+ while (++i < byteLength && (mul *= 0x100)) {
+ val += this[offset + i] * mul;
+ }
+ mul *= 0x80;
+
+ if (val >= mul) val -= Math.pow(2, 8 * byteLength);
+
+ return val;
+};
+
+Buffer.prototype.readIntBE = function readIntBE(offset, byteLength, noAssert) {
+ offset = offset >>> 0;
+ byteLength = byteLength >>> 0;
+ if (!noAssert) checkOffset(offset, byteLength, this.length);
+
+ let i = byteLength;
+ let mul = 1;
+ let val = this[offset + --i];
+ while (i > 0 && (mul *= 0x100)) {
+ val += this[offset + --i] * mul;
+ }
+ mul *= 0x80;
+
+ if (val >= mul) val -= Math.pow(2, 8 * byteLength);
+
+ return val;
+};
+
+Buffer.prototype.readInt8 = function readInt8(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 1, this.length);
+ if (!(this[offset] & 0x80)) return this[offset];
+ return (0xff - this[offset] + 1) * -1;
+};
+
+Buffer.prototype.readInt16LE = function readInt16LE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 2, this.length);
+ const val = this[offset] | (this[offset + 1] << 8);
+ return val & 0x8000 ? val | 0xffff0000 : val;
+};
+
+Buffer.prototype.readInt16BE = function readInt16BE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 2, this.length);
+ const val = this[offset + 1] | (this[offset] << 8);
+ return val & 0x8000 ? val | 0xffff0000 : val;
+};
+
+Buffer.prototype.readInt32LE = function readInt32LE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 4, this.length);
+
+ return (
+ this[offset] |
+ (this[offset + 1] << 8) |
+ (this[offset + 2] << 16) |
+ (this[offset + 3] << 24)
+ );
+};
+
+Buffer.prototype.readInt32BE = function readInt32BE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 4, this.length);
+
+ return (
+ (this[offset] << 24) |
+ (this[offset + 1] << 16) |
+ (this[offset + 2] << 8) |
+ this[offset + 3]
+ );
+};
+
+Buffer.prototype.readBigInt64LE = defineBigIntMethod(
+ function readBigInt64LE(offset) {
+ offset = offset >>> 0;
+ validateNumber(offset, "offset");
+ const first = this[offset];
+ const last = this[offset + 7];
+ if (first === undefined || last === undefined) {
+ boundsError(offset, this.length - 8);
+ }
+
+ const val =
+ this[offset + 4] +
+ this[offset + 5] * 2 ** 8 +
+ this[offset + 6] * 2 ** 16 +
+ (last << 24); // Overflow
+
+ return (
+ (BigInt(val) << BigInt(32)) +
+ BigInt(
+ first +
+ this[++offset] * 2 ** 8 +
+ this[++offset] * 2 ** 16 +
+ this[++offset] * 2 ** 24,
+ )
+ );
+ },
+);
+
+Buffer.prototype.readBigInt64BE = defineBigIntMethod(
+ function readBigInt64BE(offset) {
+ offset = offset >>> 0;
+ validateNumber(offset, "offset");
+ const first = this[offset];
+ const last = this[offset + 7];
+ if (first === undefined || last === undefined) {
+ boundsError(offset, this.length - 8);
+ }
+
+ const val =
+ (first << 24) + // Overflow
+ this[++offset] * 2 ** 16 +
+ this[++offset] * 2 ** 8 +
+ this[++offset];
+
+ return (
+ (BigInt(val) << BigInt(32)) +
+ BigInt(
+ this[++offset] * 2 ** 24 +
+ this[++offset] * 2 ** 16 +
+ this[++offset] * 2 ** 8 +
+ last,
+ )
+ );
+ },
+);
+
+Buffer.prototype.readFloatLE = function readFloatLE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 4, this.length);
+ return ieee754.read(this, offset, true, 23, 4);
+};
+
+Buffer.prototype.readFloatBE = function readFloatBE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 4, this.length);
+ return ieee754.read(this, offset, false, 23, 4);
+};
+
+Buffer.prototype.readDoubleLE = function readDoubleLE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 8, this.length);
+ return ieee754.read(this, offset, true, 52, 8);
+};
+
+Buffer.prototype.readDoubleBE = function readDoubleBE(offset, noAssert) {
+ offset = offset >>> 0;
+ if (!noAssert) checkOffset(offset, 8, this.length);
+ return ieee754.read(this, offset, false, 52, 8);
+};
+
+function checkInt(buf, value, offset, ext, max, min) {
+ if (!Buffer.isBuffer(buf))
+ throw new TypeError('"buffer" argument must be a Buffer instance');
+ if (value > max || value < min)
+ throw new RangeError('"value" argument is out of bounds');
+ if (offset + ext > buf.length) throw new RangeError("Index out of range");
+}
+
+Buffer.prototype.writeUintLE = Buffer.prototype.writeUIntLE =
+ function writeUIntLE(value, offset, byteLength, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ byteLength = byteLength >>> 0;
+ if (!noAssert) {
+ const maxBytes = Math.pow(2, 8 * byteLength) - 1;
+ checkInt(this, value, offset, byteLength, maxBytes, 0);
+ }
+
+ let mul = 1;
+ let i = 0;
+ this[offset] = value & 0xff;
+ while (++i < byteLength && (mul *= 0x100)) {
+ this[offset + i] = (value / mul) & 0xff;
+ }
+
+ return offset + byteLength;
+ };
+
+Buffer.prototype.writeUintBE = Buffer.prototype.writeUIntBE =
+ function writeUIntBE(value, offset, byteLength, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ byteLength = byteLength >>> 0;
+ if (!noAssert) {
+ const maxBytes = Math.pow(2, 8 * byteLength) - 1;
+ checkInt(this, value, offset, byteLength, maxBytes, 0);
+ }
+
+ let i = byteLength - 1;
+ let mul = 1;
+ this[offset + i] = value & 0xff;
+ while (--i >= 0 && (mul *= 0x100)) {
+ this[offset + i] = (value / mul) & 0xff;
+ }
+
+ return offset + byteLength;
+ };
+
+Buffer.prototype.writeUint8 = Buffer.prototype.writeUInt8 = function writeUInt8(
+ value,
+ offset,
+ noAssert,
+) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);
+ this[offset] = value & 0xff;
+ return offset + 1;
+};
+
+Buffer.prototype.writeUint16LE = Buffer.prototype.writeUInt16LE =
+ function writeUInt16LE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);
+ this[offset] = value & 0xff;
+ this[offset + 1] = value >>> 8;
+ return offset + 2;
+ };
+
+Buffer.prototype.writeUint16BE = Buffer.prototype.writeUInt16BE =
+ function writeUInt16BE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);
+ this[offset] = value >>> 8;
+ this[offset + 1] = value & 0xff;
+ return offset + 2;
+ };
+
+Buffer.prototype.writeUint32LE = Buffer.prototype.writeUInt32LE =
+ function writeUInt32LE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);
+ this[offset + 3] = value >>> 24;
+ this[offset + 2] = value >>> 16;
+ this[offset + 1] = value >>> 8;
+ this[offset] = value & 0xff;
+ return offset + 4;
+ };
+
+Buffer.prototype.writeUint32BE = Buffer.prototype.writeUInt32BE =
+ function writeUInt32BE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);
+ this[offset] = value >>> 24;
+ this[offset + 1] = value >>> 16;
+ this[offset + 2] = value >>> 8;
+ this[offset + 3] = value & 0xff;
+ return offset + 4;
+ };
+
+function wrtBigUInt64LE(buf, value, offset, min, max) {
+ checkIntBI(value, min, max, buf, offset, 7);
+
+ let lo = Number(value & BigInt(0xffffffff));
+ buf[offset++] = lo;
+ lo = lo >> 8;
+ buf[offset++] = lo;
+ lo = lo >> 8;
+ buf[offset++] = lo;
+ lo = lo >> 8;
+ buf[offset++] = lo;
+ let hi = Number((value >> BigInt(32)) & BigInt(0xffffffff));
+ buf[offset++] = hi;
+ hi = hi >> 8;
+ buf[offset++] = hi;
+ hi = hi >> 8;
+ buf[offset++] = hi;
+ hi = hi >> 8;
+ buf[offset++] = hi;
+ return offset;
+}
+
+function wrtBigUInt64BE(buf, value, offset, min, max) {
+ checkIntBI(value, min, max, buf, offset, 7);
+
+ let lo = Number(value & BigInt(0xffffffff));
+ buf[offset + 7] = lo;
+ lo = lo >> 8;
+ buf[offset + 6] = lo;
+ lo = lo >> 8;
+ buf[offset + 5] = lo;
+ lo = lo >> 8;
+ buf[offset + 4] = lo;
+ let hi = Number((value >> BigInt(32)) & BigInt(0xffffffff));
+ buf[offset + 3] = hi;
+ hi = hi >> 8;
+ buf[offset + 2] = hi;
+ hi = hi >> 8;
+ buf[offset + 1] = hi;
+ hi = hi >> 8;
+ buf[offset] = hi;
+ return offset + 8;
+}
+
+Buffer.prototype.writeBigUInt64LE = defineBigIntMethod(
+ function writeBigUInt64LE(value, offset = 0) {
+ return wrtBigUInt64LE(
+ this,
+ value,
+ offset,
+ BigInt(0),
+ BigInt("0xffffffffffffffff"),
+ );
+ },
+);
+
+Buffer.prototype.writeBigUInt64BE = defineBigIntMethod(
+ function writeBigUInt64BE(value, offset = 0) {
+ return wrtBigUInt64BE(
+ this,
+ value,
+ offset,
+ BigInt(0),
+ BigInt("0xffffffffffffffff"),
+ );
+ },
+);
+
+Buffer.prototype.writeIntLE = function writeIntLE(
+ value,
+ offset,
+ byteLength,
+ noAssert,
+) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) {
+ const limit = Math.pow(2, 8 * byteLength - 1);
+
+ checkInt(this, value, offset, byteLength, limit - 1, -limit);
+ }
+
+ let i = 0;
+ let mul = 1;
+ let sub = 0;
+ this[offset] = value & 0xff;
+ while (++i < byteLength && (mul *= 0x100)) {
+ if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
+ sub = 1;
+ }
+ this[offset + i] = (((value / mul) >> 0) - sub) & 0xff;
+ }
+
+ return offset + byteLength;
+};
+
+Buffer.prototype.writeIntBE = function writeIntBE(
+ value,
+ offset,
+ byteLength,
+ noAssert,
+) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) {
+ const limit = Math.pow(2, 8 * byteLength - 1);
+
+ checkInt(this, value, offset, byteLength, limit - 1, -limit);
+ }
+
+ let i = byteLength - 1;
+ let mul = 1;
+ let sub = 0;
+ this[offset + i] = value & 0xff;
+ while (--i >= 0 && (mul *= 0x100)) {
+ if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
+ sub = 1;
+ }
+ this[offset + i] = (((value / mul) >> 0) - sub) & 0xff;
+ }
+
+ return offset + byteLength;
+};
+
+Buffer.prototype.writeInt8 = function writeInt8(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);
+ if (value < 0) value = 0xff + value + 1;
+ this[offset] = value & 0xff;
+ return offset + 1;
+};
+
+Buffer.prototype.writeInt16LE = function writeInt16LE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);
+ this[offset] = value & 0xff;
+ this[offset + 1] = value >>> 8;
+ return offset + 2;
+};
+
+Buffer.prototype.writeInt16BE = function writeInt16BE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);
+ this[offset] = value >>> 8;
+ this[offset + 1] = value & 0xff;
+ return offset + 2;
+};
+
+Buffer.prototype.writeInt32LE = function writeInt32LE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);
+ this[offset] = value & 0xff;
+ this[offset + 1] = value >>> 8;
+ this[offset + 2] = value >>> 16;
+ this[offset + 3] = value >>> 24;
+ return offset + 4;
+};
+
+Buffer.prototype.writeInt32BE = function writeInt32BE(value, offset, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);
+ if (value < 0) value = 0xffffffff + value + 1;
+ this[offset] = value >>> 24;
+ this[offset + 1] = value >>> 16;
+ this[offset + 2] = value >>> 8;
+ this[offset + 3] = value & 0xff;
+ return offset + 4;
+};
+
+Buffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE(
+ value,
+ offset = 0,
+) {
+ return wrtBigUInt64LE(
+ this,
+ value,
+ offset,
+ -BigInt("0x8000000000000000"),
+ BigInt("0x7fffffffffffffff"),
+ );
+});
+
+Buffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE(
+ value,
+ offset = 0,
+) {
+ return wrtBigUInt64BE(
+ this,
+ value,
+ offset,
+ -BigInt("0x8000000000000000"),
+ BigInt("0x7fffffffffffffff"),
+ );
+});
+
+function checkIEEE754(buf, value, offset, ext, max, min) {
+ if (offset + ext > buf.length) throw new RangeError("Index out of range");
+ if (offset < 0) throw new RangeError("Index out of range");
+}
+
+function writeFloat(buf, value, offset, littleEndian, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) {
+ checkIEEE754(
+ buf,
+ value,
+ offset,
+ 4,
+ 3.4028234663852886e38,
+ -3.4028234663852886e38,
+ );
+ }
+ ieee754.write(buf, value, offset, littleEndian, 23, 4);
+ return offset + 4;
+}
+
+Buffer.prototype.writeFloatLE = function writeFloatLE(value, offset, noAssert) {
+ return writeFloat(this, value, offset, true, noAssert);
+};
+
+Buffer.prototype.writeFloatBE = function writeFloatBE(value, offset, noAssert) {
+ return writeFloat(this, value, offset, false, noAssert);
+};
+
+function writeDouble(buf, value, offset, littleEndian, noAssert) {
+ value = +value;
+ offset = offset >>> 0;
+ if (!noAssert) {
+ checkIEEE754(
+ buf,
+ value,
+ offset,
+ 8,
+ 1.7976931348623157e308,
+ -1.7976931348623157e308,
+ );
+ }
+ ieee754.write(buf, value, offset, littleEndian, 52, 8);
+ return offset + 8;
+}
+
+Buffer.prototype.writeDoubleLE = function writeDoubleLE(
+ value,
+ offset,
+ noAssert,
+) {
+ return writeDouble(this, value, offset, true, noAssert);
+};
+
+Buffer.prototype.writeDoubleBE = function writeDoubleBE(
+ value,
+ offset,
+ noAssert,
+) {
+ return writeDouble(this, value, offset, false, noAssert);
+};
+
+// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
+Buffer.prototype.copy = function copy(target, targetStart, start, end) {
+ if (!isInstance(target, Uint8Array))
+ throw new TypeError("argument should be a Buffer");
+ if (!start) start = 0;
+ if (!end && end !== 0) end = this.length;
+ if (targetStart >= target.length) targetStart = target.length;
+ if (!targetStart) targetStart = 0;
+ if (end > 0 && end < start) end = start;
+
+ // Copy 0 bytes; we're done
+ if (end === start) return 0;
+ if (target.length === 0 || this.length === 0) return 0;
+
+ // Fatal error conditions
+ if (targetStart < 0) {
+ throw new RangeError("targetStart out of bounds");
+ }
+ if (start < 0 || start >= this.length)
+ throw new RangeError("Index out of range");
+ if (end < 0) throw new RangeError("sourceEnd out of bounds");
+
+ // Are we oob?
+ if (end > this.length) end = this.length;
+ if (target.length - targetStart < end - start) {
+ end = target.length - targetStart + start;
+ }
+
+ const len = end - start;
+
+ if (
+ this === target &&
+ typeof Uint8Array.prototype.copyWithin === "function"
+ ) {
+ // Use built-in when available, missing from IE11
+ this.copyWithin(targetStart, start, end);
+ } else {
+ Uint8Array.prototype.set.call(
+ target,
+ this.subarray(start, end),
+ targetStart,
+ );
+ }
+
+ return len;
+};
+
+// Usage:
+// buffer.fill(number[, offset[, end]])
+// buffer.fill(buffer[, offset[, end]])
+// buffer.fill(string[, offset[, end]][, encoding])
+Buffer.prototype.fill = function fill(val, start, end, encoding) {
+ // Handle string cases:
+ if (typeof val === "string") {
+ if (typeof start === "string") {
+ encoding = start;
+ start = 0;
+ end = this.length;
+ } else if (typeof end === "string") {
+ encoding = end;
+ end = this.length;
+ }
+ if (encoding !== undefined && typeof encoding !== "string") {
+ throw new TypeError("encoding must be a string");
+ }
+ if (typeof encoding === "string" && !Buffer.isEncoding(encoding)) {
+ throw new TypeError("Unknown encoding: " + encoding);
+ }
+ if (val.length === 1) {
+ const code = val.charCodeAt(0);
+ if ((encoding === "utf8" && code < 128) || encoding === "latin1") {
+ // Fast path: If `val` fits into a single byte, use that numeric value.
+ val = code;
+ }
+ }
+ } else if (typeof val === "number") {
+ val = val & 255;
+ } else if (typeof val === "boolean") {
+ val = Number(val);
+ }
+
+ // Invalid ranges are not set to a default, so can range check early.
+ if (start < 0 || this.length < start || this.length < end) {
+ throw new RangeError("Out of range index");
+ }
+
+ if (end <= start) {
+ return this;
+ }
+
+ start = start >>> 0;
+ end = end === undefined ? this.length : end >>> 0;
+
+ if (!val) val = 0;
+
+ let i;
+ if (typeof val === "number") {
+ for (i = start; i < end; ++i) {
+ this[i] = val;
+ }
+ } else {
+ const bytes = isInstance(val, Uint8Array)
+ ? val
+ : Buffer.from(val, encoding);
+ const len = bytes.length;
+ if (len === 0) {
+ throw new TypeError(
+ 'The value "' + val + '" is invalid for argument "value"',
+ );
+ }
+ for (i = 0; i < end - start; ++i) {
+ this[i + start] = bytes[i % len];
+ }
+ }
+
+ return this;
+};
+
+// CUSTOM ERRORS
+// =============
+
+// Simplified versions from Node, changed for Buffer-only usage
+const errors = {};
+function E(sym, getMessage, Base) {
+ function NodeError() {
+ const err = new Base(getMessage.apply(null, arguments));
+
+ Object.setPrototypeOf(err, NodeError.prototype);
+
+ // Node.js `err.code` properties are own/enumerable properties.
+ err.code = sym;
+ // Add the error code to the name to include it in the stack trace.
+ err.name = `${err.name} [${sym}]`;
+ // Remove NodeError from the stack trace.
+ if (Error.captureStackTrace) {
+ Error.captureStackTrace(err, NodeError);
+ }
+ // Access the stack to generate the error message including the error code
+ // from the name.
+ err.stack; // eslint-disable-line no-unused-expressions
+ // Reset the name to the actual name.
+ delete err.name;
+
+ return err;
+ }
+
+ Object.setPrototypeOf(NodeError.prototype, Base.prototype);
+ Object.setPrototypeOf(NodeError, Base);
+
+ NodeError.prototype.toString = function toString() {
+ return `${this.name} [${sym}]: ${this.message}`;
+ };
+
+ errors[sym] = NodeError;
+}
+
+E(
+ "ERR_BUFFER_OUT_OF_BOUNDS",
+ function (name) {
+ if (name) {
+ return `${name} is outside of buffer bounds`;
+ }
+
+ return "Attempt to access memory outside buffer bounds";
+ },
+ RangeError,
+);
+E(
+ "ERR_INVALID_ARG_TYPE",
+ function (name, actual) {
+ return `The "${name}" argument must be of type number. Received type ${typeof actual}`;
+ },
+ TypeError,
+);
+E(
+ "ERR_OUT_OF_RANGE",
+ function (str, range, input) {
+ let msg = `The value of "${str}" is out of range.`;
+ let received = input;
+ if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {
+ received = addNumericalSeparator(String(input));
+ } else if (typeof input === "bigint") {
+ received = String(input);
+ if (
+ input > BigInt(2) ** BigInt(32) ||
+ input < -(BigInt(2) ** BigInt(32))
+ ) {
+ received = addNumericalSeparator(received);
+ }
+ received += "n";
+ }
+ msg += ` It must be ${range}. Received ${received}`;
+ return msg;
+ },
+ RangeError,
+);
+
+function addNumericalSeparator(val) {
+ let res = "";
+ let i = val.length;
+ const start = val[0] === "-" ? 1 : 0;
+ for (; i >= start + 4; i -= 3) {
+ res = `_${val.slice(i - 3, i)}${res}`;
+ }
+ return `${val.slice(0, i)}${res}`;
+}
+
+// CHECK FUNCTIONS
+// ===============
+
+function checkBounds(buf, offset, byteLength) {
+ validateNumber(offset, "offset");
+ if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {
+ boundsError(offset, buf.length - (byteLength + 1));
+ }
+}
+
+function checkIntBI(value, min, max, buf, offset, byteLength) {
+ if (value > max || value < min) {
+ const n = typeof min === "bigint" ? "n" : "";
+ let range;
+ if (byteLength > 3) {
+ if (min === 0 || min === BigInt(0)) {
+ range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`;
+ } else {
+ range =
+ `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +
+ `${(byteLength + 1) * 8 - 1}${n}`;
+ }
+ } else {
+ range = `>= ${min}${n} and <= ${max}${n}`;
+ }
+ throw new errors.ERR_OUT_OF_RANGE("value", range, value);
+ }
+ checkBounds(buf, offset, byteLength);
+}
+
+function validateNumber(value, name) {
+ if (typeof value !== "number") {
+ throw new errors.ERR_INVALID_ARG_TYPE(name, "number", value);
+ }
+}
+
+function boundsError(value, length, type) {
+ if (Math.floor(value) !== value) {
+ validateNumber(value, type);
+ throw new errors.ERR_OUT_OF_RANGE(type || "offset", "an integer", value);
+ }
+
+ if (length < 0) {
+ throw new errors.ERR_BUFFER_OUT_OF_BOUNDS();
+ }
+
+ throw new errors.ERR_OUT_OF_RANGE(
+ type || "offset",
+ `>= ${type ? 1 : 0} and <= ${length}`,
+ value,
+ );
+}
+
+// HELPER FUNCTIONS
+// ================
+
+const INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;
+
+function base64clean(str) {
+ // Node takes equal signs as end of the Base64 encoding
+ str = str.split("=")[0];
+ // Node strips out invalid characters like \n and \t from the string, base64-js does not
+ str = str.trim().replace(INVALID_BASE64_RE, "");
+ // Node converts strings with length < 2 to ''
+ if (str.length < 2) return "";
+ // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
+ while (str.length % 4 !== 0) {
+ str = str + "=";
+ }
+ return str;
+}
+
+function utf8ToBytes(string, units) {
+ units = units || Infinity;
+ let codePoint;
+ const length = string.length;
+ let leadSurrogate = null;
+ const bytes = [];
+
+ for (let i = 0; i < length; ++i) {
+ codePoint = string.charCodeAt(i);
+
+ // is surrogate component
+ if (codePoint > 0xd7ff && codePoint < 0xe000) {
+ // last char was a lead
+ if (!leadSurrogate) {
+ // no lead yet
+ if (codePoint > 0xdbff) {
+ // unexpected trail
+ if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);
+ continue;
+ } else if (i + 1 === length) {
+ // unpaired lead
+ if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);
+ continue;
+ }
+
+ // valid lead
+ leadSurrogate = codePoint;
+
+ continue;
+ }
+
+ // 2 leads in a row
+ if (codePoint < 0xdc00) {
+ if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);
+ leadSurrogate = codePoint;
+ continue;
+ }
+
+ // valid surrogate pair
+ codePoint =
+ (((leadSurrogate - 0xd800) << 10) | (codePoint - 0xdc00)) + 0x10000;
+ } else if (leadSurrogate) {
+ // valid bmp char, but last char was a lead
+ if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);
+ }
+
+ leadSurrogate = null;
+
+ // encode utf8
+ if (codePoint < 0x80) {
+ if ((units -= 1) < 0) break;
+ bytes.push(codePoint);
+ } else if (codePoint < 0x800) {
+ if ((units -= 2) < 0) break;
+ bytes.push((codePoint >> 0x6) | 0xc0, (codePoint & 0x3f) | 0x80);
+ } else if (codePoint < 0x10000) {
+ if ((units -= 3) < 0) break;
+ bytes.push(
+ (codePoint >> 0xc) | 0xe0,
+ ((codePoint >> 0x6) & 0x3f) | 0x80,
+ (codePoint & 0x3f) | 0x80,
+ );
+ } else if (codePoint < 0x110000) {
+ if ((units -= 4) < 0) break;
+ bytes.push(
+ (codePoint >> 0x12) | 0xf0,
+ ((codePoint >> 0xc) & 0x3f) | 0x80,
+ ((codePoint >> 0x6) & 0x3f) | 0x80,
+ (codePoint & 0x3f) | 0x80,
+ );
+ } else {
+ throw new Error("Invalid code point");
+ }
+ }
+
+ return bytes;
+}
+
+function asciiToBytes(str) {
+ const byteArray = [];
+ for (let i = 0; i < str.length; ++i) {
+ // Node's code seems to be doing this and not & 0x7F..
+ byteArray.push(str.charCodeAt(i) & 0xff);
+ }
+ return byteArray;
+}
+
+function utf16leToBytes(str, units) {
+ let c, hi, lo;
+ const byteArray = [];
+ for (let i = 0; i < str.length; ++i) {
+ if ((units -= 2) < 0) break;
+
+ c = str.charCodeAt(i);
+ hi = c >> 8;
+ lo = c % 256;
+ byteArray.push(lo);
+ byteArray.push(hi);
+ }
+
+ return byteArray;
+}
+
+function base64ToBytes(str) {
+ return base64.toByteArray(base64clean(str));
+}
+
+function blitBuffer(src, dst, offset, length) {
+ let i;
+ for (i = 0; i < length; ++i) {
+ if (i + offset >= dst.length || i >= src.length) break;
+ dst[i + offset] = src[i];
+ }
+ return i;
+}
+
+// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass
+// the `instanceof` check but they should be treated as of that type.
+// See: https://github.com/feross/buffer/issues/166
+function isInstance(obj, type) {
+ return (
+ obj instanceof type ||
+ (obj != null &&
+ obj.constructor != null &&
+ obj.constructor.name != null &&
+ obj.constructor.name === type.name) ||
+ (type === Uint8Array && Buffer.isBuffer(obj))
+ );
+}
+function numberIsNaN(obj) {
+ // For IE11 support
+ return obj !== obj; // eslint-disable-line no-self-compare
+}
+
+// Create lookup table for `toString('hex')`
+// See: https://github.com/feross/buffer/issues/219
+const hexSliceLookupTable = (function () {
+ const alphabet = "0123456789abcdef";
+ const table = new Array(256);
+ for (let i = 0; i < 16; ++i) {
+ const i16 = i * 16;
+ for (let j = 0; j < 16; ++j) {
+ table[i16 + j] = alphabet[i] + alphabet[j];
+ }
+ }
+ return table;
+})();
+
+// hex lookup table for Buffer.from(x, 'hex')
+/* eslint-disable no-multi-spaces, indent */
+const hexCharValueTable = [
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, -1,
+ -1, -1, -1, -1, -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 10,
+ 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+];
+/* eslint-enable no-multi-spaces, indent */
+
+// Return not function with Error if BigInt not supported
+function defineBigIntMethod(fn) {
+ return typeof BigInt === "undefined" ? BufferBigIntNotDefined : fn;
+}
+
+function BufferBigIntNotDefined() {
+ throw new Error("BigInt not supported");
+}
diff --git a/products/bech32-hex-converter/content/js/chain.js b/products/bech32-hex-converter/content/js/chain.js
new file mode 100644
index 000000000..6007ed6c6
--- /dev/null
+++ b/products/bech32-hex-converter/content/js/chain.js
@@ -0,0 +1,240 @@
+const isBech32 = (raw) => {
+ return !!raw.match(/^zil1[qpzry9x8gf2tvdw0s3jn54khce6mua7l]{38}$/);
+};
+
+const CHARSET = "qpzry9x8gf2tvdw0s3jn54khce6mua7l";
+const GENERATOR = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];
+
+const isByteString = function (str, len) {
+ return !!str.replace("0x", "").match(`^[0-9a-fA-F]{${len}}$`);
+};
+
+const isAddress = function (address) {
+ return isByteString(address, 40);
+};
+
+const convertBits = function (data, fromWidth, toWidth, pad) {
+ let acc = 0;
+ let bits = 0;
+ const ret = [];
+ const maxv = (1 << toWidth) - 1;
+ for (let p = 0; p < data.length; ++p) {
+ const value = data[p];
+ if (value < 0 || value >> fromWidth !== 0) {
+ return null;
+ }
+ acc = (acc << fromWidth) | value;
+ bits += fromWidth;
+ while (bits >= toWidth) {
+ bits -= toWidth;
+ ret.push((acc >> bits) & maxv);
+ }
+ }
+
+ if (pad) {
+ if (bits > 0) {
+ ret.push((acc << (toWidth - bits)) & maxv);
+ }
+ } else if (bits >= fromWidth || (acc << (toWidth - bits)) & maxv) {
+ return null;
+ }
+
+ return Buffer.from(ret);
+};
+
+const polymod = function (values) {
+ let chk = 1;
+ for (let p = 0; p < values.length; ++p) {
+ const top = chk >> 25;
+ chk = ((chk & 0x1ffffff) << 5) ^ values[p];
+ for (let i = 0; i < 5; ++i) {
+ if ((top >> i) & 1) {
+ chk ^= GENERATOR[i];
+ }
+ }
+ }
+ return chk;
+};
+
+const hrpExpand = function (hrp) {
+ const ret = [];
+ let p;
+ for (p = 0; p < hrp.length; ++p) {
+ ret.push(hrp.charCodeAt(p) >> 5);
+ }
+ ret.push(0);
+ for (p = 0; p < hrp.length; ++p) {
+ ret.push(hrp.charCodeAt(p) & 31);
+ }
+ return Buffer.from(ret);
+};
+
+function verifyChecksum(hrp, data) {
+ return polymod(Buffer.concat([hrpExpand(hrp), data])) === 1;
+}
+
+function createChecksum(hrp, data) {
+ const values = Buffer.concat([
+ Buffer.from(hrpExpand(hrp)),
+ data,
+ Buffer.from([0, 0, 0, 0, 0, 0]),
+ ]);
+ // var values = hrpExpand(hrp).concat(data).concat([0, 0, 0, 0, 0, 0]);
+ const mod = polymod(values) ^ 1;
+ const ret = [];
+ for (let p = 0; p < 6; ++p) {
+ ret.push((mod >> (5 * (5 - p))) & 31);
+ }
+ return Buffer.from(ret);
+}
+
+const encode = function (hrp, data) {
+ const combined = Buffer.concat([data, createChecksum(hrp, data)]);
+ let ret = hrp + "1";
+ for (let p = 0; p < combined.length; ++p) {
+ ret += CHARSET.charAt(combined[p]);
+ }
+ return ret;
+};
+
+const decode = function (bechString) {
+ let p;
+ let hasLower = false;
+ let hasUpper = false;
+ for (p = 0; p < bechString.length; ++p) {
+ if (bechString.charCodeAt(p) < 33 || bechString.charCodeAt(p) > 126) {
+ return null;
+ }
+ if (bechString.charCodeAt(p) >= 97 && bechString.charCodeAt(p) <= 122) {
+ hasLower = true;
+ }
+ if (bechString.charCodeAt(p) >= 65 && bechString.charCodeAt(p) <= 90) {
+ hasUpper = true;
+ }
+ }
+ if (hasLower && hasUpper) {
+ return null;
+ }
+ bechString = bechString.toLowerCase();
+ const pos = bechString.lastIndexOf("1");
+ if (pos < 1 || pos + 7 > bechString.length || bechString.length > 90) {
+ return null;
+ }
+ const hrp = bechString.substring(0, pos);
+ const data = [];
+ for (p = pos + 1; p < bechString.length; ++p) {
+ const d = CHARSET.indexOf(bechString.charAt(p));
+ if (d === -1) {
+ return null;
+ }
+ data.push(d);
+ }
+
+ if (!verifyChecksum(hrp, Buffer.from(data))) {
+ return null;
+ }
+
+ return { hrp, data: Buffer.from(data.slice(0, data.length - 6)) };
+};
+
+// HRP is the human-readable part of zilliqa bech32 addresses
+const HRP = "zil";
+
+/**
+ * toBech32Address
+ *
+ * Encodes a canonical 20-byte Ethereum-style address as a bech32 zilliqa
+ * address.
+ *
+ * The expected format is zil1 where address and checksum
+ * are the result of bech32 encoding a Buffer containing the address bytes.
+ *
+ * @param {string} 20 byte canonical address
+ * @returns {string} 38 char bech32 encoded zilliqa address
+ */
+const toBech32Address = function (address) {
+ if (!isAddress(address)) {
+ throw new Error("Invalid address format.");
+ }
+
+ const addrBz = convertBits(
+ Buffer.from(address.replace("0x", ""), "hex"),
+ 8,
+ 5,
+ );
+
+ if (addrBz === null) {
+ throw new Error("Could not convert byte Buffer to 5-bit Buffer");
+ }
+
+ return encode(HRP, addrBz);
+};
+
+/**
+ * fromBech32Address
+ *
+ * @param {string} address - a valid Zilliqa bech32 address
+ * @returns {string} a canonical 20-byte Ethereum-style address
+ */
+const fromBech32Address = function (address) {
+ const res = decode(address);
+
+ if (res === null) {
+ throw new Error("Invalid bech32 address");
+ }
+
+ const { hrp, data } = res;
+
+ const shouldBe = HRP;
+ if (hrp !== shouldBe) {
+ throw new Error(`Expected hrp to be ${shouldBe} but got ${hrp}`);
+ }
+
+ const buf = convertBits(data, 5, 8, false);
+
+ if (buf === null) {
+ throw new Error("Could not convert buffer to bytes");
+ }
+
+ return buf.toString("hex");
+};
+
+function convertAddress(id) {
+ let addressInput = document.getElementById(id);
+ let addressValue = addressInput.value;
+ try {
+ if (isBech32(addressValue)) {
+ result = fromBech32Address(addressValue);
+ } else {
+ result = toBech32Address(addressValue);
+ }
+ addressInput.value = result;
+ } catch (error) {
+ alert("Cannot convert " + error);
+ }
+}
+
+function copyValue(id) {
+ let addressInput = document.getElementById(id);
+ addressInput.select();
+ addressInput.setSelectionRange(0, 99999);
+ navigator.clipboard.writeText(addressInput.value);
+}
+
+// Fill in dynamically because mkdocs removes onclick handlers.
+document.addEventListener("DOMContentLoaded", function () {
+ var ids = document.getElementsByClassName("hexconverter");
+ for (let i = 0; i < ids.length; i++) {
+ let elem = ids[i];
+ elem.onclick = function () {
+ convertAddress("address");
+ };
+ }
+ var ids2 = document.getElementsByClassName("hexcopy");
+ for (let i = 0; i < ids2.length; i++) {
+ let elem = ids2[i];
+ elem.onclick = function () {
+ copyValue("address");
+ };
+ }
+});
diff --git a/products/bech32-hex-converter/content/trivial.css b/products/bech32-hex-converter/content/trivial.css
new file mode 100644
index 000000000..e102470d7
--- /dev/null
+++ b/products/bech32-hex-converter/content/trivial.css
@@ -0,0 +1,24 @@
+body {
+ font-family: "sans-serif";
+ font-size: 16pt;
+}
+
+input {
+ font-family: "sans-serif";
+ font-size: 16pt;
+}
+
+button {
+ vertical-align: middle;
+}
+
+.warning {
+ font-weight: bold;
+ font-size: 12pt;
+}
+
+.example {
+ font-family: "monospace";
+ align: center;
+ font-size: 12pt;
+}
diff --git a/products/bech32-hex-converter/docker-compose.yaml b/products/bech32-hex-converter/docker-compose.yaml
new file mode 100644
index 000000000..0bb10dc39
--- /dev/null
+++ b/products/bech32-hex-converter/docker-compose.yaml
@@ -0,0 +1,8 @@
+version: "3"
+services:
+ runner:
+ image: nginx:latest
+ volumes:
+ - "./content:/usr/share/nginx/html"
+ ports:
+ - "3000:80"