diff --git a/protocol/src/main/java/com/zfoo/protocol/serializer/typescript/GenerateTsUtils.java b/protocol/src/main/java/com/zfoo/protocol/serializer/typescript/GenerateTsUtils.java
index 55eecda0..7a5c2472 100644
--- a/protocol/src/main/java/com/zfoo/protocol/serializer/typescript/GenerateTsUtils.java
+++ b/protocol/src/main/java/com/zfoo/protocol/serializer/typescript/GenerateTsUtils.java
@@ -88,7 +88,7 @@ public abstract class GenerateTsUtils {
     }
 
     public static void createProtocolManager(List<IProtocolRegistration> protocolList) throws IOException {
-        var list = List.of("typescript/buffer/ByteBuffer.ts", "typescript/buffer/long.js", "typescript/buffer/longbits.js");
+        var list = List.of("typescript/buffer/ByteBuffer.ts", "typescript/buffer/Long.ts", "typescript/buffer/Longbits.ts");
         for (var fileName : list) {
             var fileInputStream = ClassUtils.getFileFromClassPath(fileName);
             var createFile = new File(StringUtils.format("{}/{}", protocolOutputPath, StringUtils.substringAfterFirst(fileName, "typescript/")));
diff --git a/protocol/src/main/resources/typescript/buffer/ByteBuffer.ts b/protocol/src/main/resources/typescript/buffer/ByteBuffer.ts
index 77946a5a..ffc52a1f 100644
--- a/protocol/src/main/resources/typescript/buffer/ByteBuffer.ts
+++ b/protocol/src/main/resources/typescript/buffer/ByteBuffer.ts
@@ -1,6 +1,6 @@
 import ProtocolManager from "../ProtocolManager";
 
-const Longbits = require('./longbits.js');
+import {writeInt64, readInt64} from "./Longbits";
 
 const empty_str = '';
 const initSize = 128;
@@ -13,8 +13,8 @@ const maxInt = 2147483647;
 const minInt = -2147483648;
 
 // UTF-8编码与解码
-const encoder = new TextEncoder('utf-8');
-const decoder = new TextDecoder('utf-8');
+const encoder = new TextEncoder();
+const decoder = new TextDecoder();
 
 // nodejs的测试环境需要用以下方式特殊处理
 // const util = require('util');
@@ -238,7 +238,7 @@ class ByteBuffer {
         }
         this.ensureCapacity(9);
 
-        Longbits.writeInt64(this, value);
+        writeInt64(this, value);
     }
 
     readLong(): number {
@@ -280,7 +280,7 @@ class ByteBuffer {
                 }
             }
         }
-        return Longbits.readInt64(new Uint8Array(buffer.slice(0, count))).toString();
+        return readInt64(new Uint8Array(buffer.slice(0, count))).toNumber();
     }
 
     writeFloat(value: number): void {
@@ -378,7 +378,7 @@ class ByteBuffer {
     };
 
     readBooleanArray(): any {
-        const array = [];
+        const array: boolean[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -400,7 +400,7 @@ class ByteBuffer {
     };
 
     readByteArray(): any {
-        const array = [];
+        const array: number[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -422,7 +422,7 @@ class ByteBuffer {
     };
 
     readShortArray(): any {
-        const array = [];
+        const array: number[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -444,7 +444,7 @@ class ByteBuffer {
     };
 
     readIntArray(): any {
-        const array = [];
+        const array: number[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -466,7 +466,7 @@ class ByteBuffer {
     };
 
     readLongArray(): any {
-        const array = [];
+        const array: number[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -488,7 +488,7 @@ class ByteBuffer {
     };
 
     readFloatArray(): any {
-        const array = [];
+        const array: number[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -510,7 +510,7 @@ class ByteBuffer {
     };
 
     readDoubleArray(): any {
-        const array = [];
+        const array: number[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -532,7 +532,7 @@ class ByteBuffer {
     };
 
     readStringArray(): any {
-        const array = [];
+        const array: string[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -554,7 +554,7 @@ class ByteBuffer {
     };
 
     readCharArray(): any {
-        const array = [];
+        const array: string[] = [];
         const length = this.readInt();
         if (length > 0) {
             for (let index = 0; index < length; index++) {
@@ -577,7 +577,7 @@ class ByteBuffer {
     };
 
     readPacketArray(protocolId: number): any {
-        const array = [];
+        const array: any[] = [];
         const length = this.readInt();
         if (length > 0) {
             const protocolRegistration = ProtocolManager.getProtocol(protocolId);
diff --git a/protocol/src/main/resources/typescript/buffer/Long.ts b/protocol/src/main/resources/typescript/buffer/Long.ts
new file mode 100644
index 00000000..0276f32e
--- /dev/null
+++ b/protocol/src/main/resources/typescript/buffer/Long.ts
@@ -0,0 +1,1067 @@
+const INT_CACHE: Record<number, Long> = {};
+const UINT_CACHE: Record<number, Long> = {};
+
+type WasmExports = {
+  mul: (low: number, high: number, mLow: number, mHigh: number) => number;
+  div_s: (low: number, high: number, dLow: number, dHigh: number) => number;
+  div_u: (low: number, high: number, dLow: number, dHigh: number) => number;
+  rem_s: (low: number, high: number, dLow: number, dHigh: number) => number;
+  rem_u: (low: number, high: number, dLow: number, dHigh: number) => number;
+  get_high: () => number;
+};
+
+let wasm: WasmExports;
+
+try {
+  wasm = new WebAssembly.Instance(
+    new WebAssembly.Module(
+      new Uint8Array([
+        0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127,
+        127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11,
+        7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5,
+        100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114,
+        101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0,
+        10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173,
+        66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4,
+        66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32,
+        1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127,
+        34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0,
+        173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134,
+        132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126,
+        32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66,
+        32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36,
+        1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3,
+        173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167,
+        11,
+      ])
+    ),
+    {}
+  ).exports as WasmExports;
+} catch {
+  // no wasm support
+}
+
+export class Long {
+  /**
+   * Signed zero.
+   */
+  static readonly ZERO = Long.fromInt(0);
+
+  /**
+   * Unsigned zero.
+   */
+  static readonly UZERO = Long.fromInt(0, true);
+
+  /**
+   * Signed one.
+   */
+  static readonly ONE = Long.fromInt(1);
+
+  /**
+   * Unsigned one.
+   */
+  static readonly UONE = Long.fromInt(1, true);
+
+  /**
+   * Signed negative one.
+   */
+  static readonly NEG_ONE = Long.fromInt(-1);
+
+  /**
+   * Maximum signed value.
+   */
+  static readonly MAX_VALUE = Long.fromBits(
+    0xffffffff | 0,
+    0x7fffffff | 0,
+    false
+  );
+
+  /**
+   * Maximum unsigned value.
+   */
+  static readonly MAX_UNSIGNED_VALUE = Long.fromBits(
+    0xffffffff | 0,
+    0xffffffff | 0,
+    true
+  );
+
+  /**
+   * Minimum signed value.
+   */
+  static readonly MIN_VALUE = Long.fromBits(0, 0x80000000 | 0, false);
+
+  /**
+   * The low 32 bits as a signed value.
+   */
+  low: number;
+
+  /**
+   * The high 32 bits as a signed value.
+   */
+  high: number;
+
+  /**
+   * Whether unsigned or not.
+   */
+  unsigned: boolean;
+
+  /**
+   * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as signed integers. See the from* functions below for more convenient ways of constructing Longs.
+   */
+  constructor(low: number, high: number, unsigned = false) {
+    this.low = low | 0;
+    this.high = high | 0;
+    this.unsigned = unsigned;
+  }
+
+  /**
+   * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.
+   */
+  toInt() {
+    return this.unsigned ? this.low >>> 0 : this.low;
+  }
+
+  /**
+   * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).
+   */
+  toNumber() {
+    if (this.unsigned) {
+      return (this.high >>> 0) * TWO_PWR_32_DBL + (this.low >>> 0);
+    }
+    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);
+  }
+
+  /**
+   * Converts the Long to a string written in the specified radix.
+   */
+  toString(radix = 10): string {
+    if (radix < 2 || 36 < radix) {
+      throw RangeError("radix");
+    }
+    if (this.isZero()) {
+      return "0";
+    }
+    if (this.isNegative()) {
+      // Unsigned Longs are never negative
+      if (this.equals(Long.MIN_VALUE)) {
+        // We need to change the Long value before it can be negated, so we remove
+        // the bottom-most digit in this base and then recurse to do the rest.
+        const radixLong = Long.fromNumber(radix);
+        const div = this.divide(radixLong);
+        const rem1 = div.multiply(radixLong).subtract(this);
+        return div.toString(radix) + rem1.toInt().toString(radix);
+      } else {
+        return "-" + this.negate().toString(radix);
+      }
+    }
+
+    // Do several (6) digits each time through the loop, so as to
+    // minimize the calls to the very expensive emulated div.
+    const radixToPower = Long.fromNumber(Math.pow(radix, 6), this.unsigned);
+    let result = "";
+    let rem = this as Long;
+    while (true) {
+      const remDiv = rem.divide(radixToPower);
+      const intval = rem.subtract(remDiv.multiply(radixToPower)).toInt() >>> 0;
+      let digits = intval.toString(radix);
+      rem = remDiv;
+      if (rem.isZero()) {
+        return digits + result;
+      } else {
+        while (digits.length < 6) {
+          digits = "0" + digits;
+        }
+        result = "" + digits + result;
+      }
+    }
+  }
+
+  /**
+   * Gets the high 32 bits as a signed integer.
+   */
+  getHighBits() {
+    return this.high;
+  }
+
+  /**
+   * Gets the high 32 bits as an unsigned integer.
+   */
+  getHighBitsUnsigned() {
+    return this.high >>> 0;
+  }
+
+  /**
+   * Gets the low 32 bits as a signed integer.
+   */
+  getLowBits() {
+    return this.low;
+  }
+
+  /**
+   * Gets the low 32 bits as an unsigned integer.
+   */
+  getLowBitsUnsigned() {
+    return this.low >>> 0;
+  }
+
+  /**
+   * Gets the number of bits needed to represent the absolute value of this Long.
+   */
+  getNumBitsAbs(): number {
+    if (this.isNegative()) {
+      // Unsigned Longs are never negative
+      return this.equals(Long.MIN_VALUE) ? 64 : this.negate().getNumBitsAbs();
+    }
+    const val = this.high != 0 ? this.high : this.low;
+    let bit;
+    for (bit = 31; bit > 0; bit--) {
+      if ((val & (1 << bit)) != 0) {
+        break;
+      }
+    }
+    return this.high != 0 ? bit + 33 : bit + 1;
+  }
+
+  /**
+   * Tests if this Long's value equals zero.
+   */
+  isZero() {
+    return this.high === 0 && this.low === 0;
+  }
+
+  /**
+   * Tests if this Long's value is negative.
+   */
+  isNegative() {
+    return !this.unsigned && this.high < 0;
+  }
+
+  /**
+   * Tests if this Long's value is positive.
+   */
+  isPositive() {
+    return this.unsigned || this.high >= 0;
+  }
+
+  /**
+   * Tests if this Long's value is odd.
+   */
+  isOdd() {
+    return (this.low & 1) === 1;
+  }
+
+  /**
+   * Tests if this Long's value is even.
+   */
+  isEven() {
+    return (this.low & 1) === 0;
+  }
+
+  /**
+   * Tests if this Long's value equals the specified's.
+   */
+  equals(other: Long | number | string) {
+    if (!(other instanceof Long)) {
+      other = Long.fromValue(other);
+    }
+    if (
+      this.unsigned !== other.unsigned &&
+      this.high >>> 31 === 1 &&
+      other.high >>> 31 === 1
+    ) {
+      return false;
+    }
+    return this.high === other.high && this.low === other.low;
+  }
+
+  /**
+   * Tests if this Long's value differs from the specified's.
+   */
+  notEquals(other: Long | number | string) {
+    return !this.equals(other);
+  }
+
+  /**
+   * Tests if this Long's value is less than the specified's.
+   */
+  lessThan(other: Long | number | string) {
+    return this.compare(other) < 0;
+  }
+
+  /**
+   * Tests if this Long's value is less than or equal the specified's.
+   */
+  lessThanOrEqual(other: Long | number | string) {
+    return this.compare(other) <= 0;
+  }
+
+  /**
+   * Tests if this Long's value is greater than the specified's.
+   */
+  greaterThan(other: Long | number | string) {
+    return this.compare(other) > 0;
+  }
+
+  /**
+   * Tests if this Long's value is greater than or equal the specified's.
+   */
+  greaterThanOrEqual(other: Long | number | string) {
+    return this.compare(other) >= 0;
+  }
+
+  /**
+   * Compares this Long's value with the specified's.
+   */
+  compare(other: Long | number | string) {
+    if (!(other instanceof Long)) {
+      other = Long.fromValue(other);
+    }
+    if (this.equals(other)) {
+      return 0;
+    }
+    const thisNeg = this.isNegative();
+    const otherNeg = other.isNegative();
+    if (thisNeg && !otherNeg) {
+      return -1;
+    }
+    if (!thisNeg && otherNeg) {
+      return 1;
+    }
+    // At this point the sign bits are the same
+    if (!this.unsigned) {
+      return this.subtract(other).isNegative() ? -1 : 1;
+    }
+    // Both are positive if at least one is unsigned
+    return other.high >>> 0 > this.high >>> 0 ||
+    (other.high === this.high && other.low >>> 0 > this.low >>> 0)
+      ? -1
+      : 1;
+  }
+
+  /**
+   * Negates this Long's value.
+   */
+  negate() {
+    if (!this.unsigned && this.equals(Long.MIN_VALUE)) {
+      return Long.MIN_VALUE;
+    }
+    return this.not().add(Long.ONE);
+  }
+
+  /**
+   * Returns the sum of this and the specified Long.
+   */
+  add(addend: Long | number | string) {
+    if (!(addend instanceof Long)) {
+      addend = Long.fromValue(addend);
+    }
+
+    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
+
+    const a48 = this.high >>> 16;
+    const a32 = this.high & 0xffff;
+    const a16 = this.low >>> 16;
+    const a00 = this.low & 0xffff;
+
+    const b48 = addend.high >>> 16;
+    const b32 = addend.high & 0xffff;
+    const b16 = addend.low >>> 16;
+    const b00 = addend.low & 0xffff;
+
+    let c48 = 0;
+    let c32 = 0;
+    let c16 = 0;
+    let c00 = 0;
+    c00 += a00 + b00;
+    c16 += c00 >>> 16;
+    c00 &= 0xffff;
+    c16 += a16 + b16;
+    c32 += c16 >>> 16;
+    c16 &= 0xffff;
+    c32 += a32 + b32;
+    c48 += c32 >>> 16;
+    c32 &= 0xffff;
+    c48 += a48 + b48;
+    c48 &= 0xffff;
+    return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
+  }
+
+  /**
+   * Returns the difference of this and the specified Long.
+   */
+  subtract(subtrahend: Long | number | string) {
+    if (!(subtrahend instanceof Long)) {
+      subtrahend = Long.fromValue(subtrahend);
+    }
+    return this.add(subtrahend.negate());
+  }
+
+  /**
+   * Returns the product of this and the specified Long.
+   */
+  multiply(multiplier: Long | number | string): Long {
+    if (this.isZero()) {
+      return Long.ZERO;
+    }
+    if (!(multiplier instanceof Long)) {
+      multiplier = Long.fromValue(multiplier);
+    }
+
+    if (wasm) {
+      const low = wasm.mul(
+        this.low,
+        this.high,
+        multiplier.low,
+        multiplier.high
+      );
+      return Long.fromBits(low, wasm.get_high(), this.unsigned);
+    }
+
+    if (multiplier.isZero()) {
+      return Long.ZERO;
+    }
+    if (this.equals(Long.MIN_VALUE)) {
+      return multiplier.isOdd() ? Long.MIN_VALUE : Long.ZERO;
+    }
+    if (multiplier.equals(Long.MIN_VALUE)) {
+      return this.isOdd() ? Long.MIN_VALUE : Long.ZERO;
+    }
+
+    if (this.isNegative()) {
+      if (multiplier.isNegative()) {
+        return this.negate().multiply(multiplier.negate());
+      } else {
+        return this.negate().multiply(multiplier).negate();
+      }
+    } else if (multiplier.isNegative()) {
+      return this.multiply(multiplier.negate()).negate();
+    }
+
+    // If both longs are small, use float multiplication
+    if (this.lessThan(TWO_PWR_24) && multiplier.lessThan(TWO_PWR_24)) {
+      return Long.fromNumber(
+        this.toNumber() * multiplier.toNumber(),
+        this.unsigned
+      );
+    }
+
+    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
+    // We can skip products that would overflow.
+
+    const a48 = this.high >>> 16;
+    const a32 = this.high & 0xffff;
+    const a16 = this.low >>> 16;
+    const a00 = this.low & 0xffff;
+
+    const b48 = multiplier.high >>> 16;
+    const b32 = multiplier.high & 0xffff;
+    const b16 = multiplier.low >>> 16;
+    const b00 = multiplier.low & 0xffff;
+
+    let c48 = 0;
+    let c32 = 0;
+    let c16 = 0;
+    let c00 = 0;
+    c00 += a00 * b00;
+    c16 += c00 >>> 16;
+    c00 &= 0xffff;
+    c16 += a16 * b00;
+    c32 += c16 >>> 16;
+    c16 &= 0xffff;
+    c16 += a00 * b16;
+    c32 += c16 >>> 16;
+    c16 &= 0xffff;
+    c32 += a32 * b00;
+    c48 += c32 >>> 16;
+    c32 &= 0xffff;
+    c32 += a16 * b16;
+    c48 += c32 >>> 16;
+    c32 &= 0xffff;
+    c32 += a00 * b32;
+    c48 += c32 >>> 16;
+    c32 &= 0xffff;
+    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
+    c48 &= 0xffff;
+    return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
+  }
+
+  /**
+   * Returns this Long divided by the specified. The result is signed if this Long is signed or unsigned if this Long is unsigned.
+   */
+  divide(divisor: Long | number | string): Long {
+    if (!(divisor instanceof Long)) {
+      divisor = Long.fromValue(divisor);
+    }
+    if (divisor.isZero()) {
+      throw Error("division by zero");
+    }
+
+    if (wasm) {
+      // guard against signed division overflow: the largest
+      // negative number / -1 would be 1 larger than the largest
+      // positive number, due to two's complement.
+      if (
+        !this.unsigned &&
+        this.high === -0x80000000 &&
+        divisor.low === -1 &&
+        divisor.high === -1
+      ) {
+        // be consistent with non-wasm code path
+        return this;
+      }
+      const low = (this.unsigned ? wasm.div_u : wasm.div_s)(
+        this.low,
+        this.high,
+        divisor.low,
+        divisor.high
+      );
+      return Long.fromBits(low, wasm.get_high(), this.unsigned);
+    }
+
+    if (this.isZero()) {
+      return this.unsigned ? Long.UZERO : Long.ZERO;
+    }
+    let approx;
+    let rem;
+    let res;
+    if (!this.unsigned) {
+      // This section is only relevant for signed longs and is derived from the
+      // closure library as a whole.
+      if (this.equals(Long.MIN_VALUE)) {
+        if (divisor.equals(Long.ONE) || divisor.equals(Long.NEG_ONE)) {
+          return Long.MIN_VALUE;
+        }
+        // recall that -MIN_VALUE == MIN_VALUE
+        else if (divisor.equals(Long.MIN_VALUE)) {
+          return Long.ONE;
+        } else {
+          // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
+          const halfThis = this.shiftRight(1);
+          approx = halfThis.divide(divisor).shiftLeft(1);
+          if (approx.equals(Long.ZERO)) {
+            return divisor.isNegative() ? Long.ONE : Long.NEG_ONE;
+          } else {
+            rem = this.subtract(divisor.multiply(approx));
+            res = approx.add(rem.divide(divisor));
+            return res;
+          }
+        }
+      } else if (divisor.equals(Long.MIN_VALUE)) {
+        return this.unsigned ? Long.UZERO : Long.ZERO;
+      }
+      if (this.isNegative()) {
+        if (divisor.isNegative()) {
+          return this.negate().divide(divisor.negate());
+        }
+        return this.negate().divide(divisor).negate();
+      } else if (divisor.isNegative()) {
+        return this.divide(divisor.negate()).negate();
+      }
+      res = Long.ZERO;
+    } else {
+      // The algorithm below has not been made for unsigned longs. It's therefore
+      // required to take special care of the MSB prior to running it.
+      if (!divisor.unsigned) {
+        divisor = divisor.toUnsigned();
+      }
+      if (divisor.greaterThan(this)) {
+        return Long.UZERO;
+      }
+      if (divisor.greaterThan(this.shiftRightUnsigned(1))) {
+        // 15 >>> 1 = 7 ; with divisor = 8 ; true
+        return Long.UONE;
+      }
+      res = Long.UZERO;
+    }
+
+    // Repeat the following until the remainder is less than other:  find a
+    // floating-point that approximates remainder / other *from below*, add this
+    // into the result, and subtract it from the remainder.  It is critical that
+    // the approximate value is less than or equal to the real value so that the
+    // remainder never becomes negative.
+    rem = this;
+    while (rem.greaterThanOrEqual(divisor)) {
+      // Approximate the result of division. This may be a little greater or
+      // smaller than the actual value.
+      approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));
+
+      // We will tweak the approximate result by changing it in the 48-th digit or
+      // the smallest non-fractional digit, whichever is larger.
+      const log2 = Math.ceil(Math.log(approx) / Math.LN2);
+      const delta = log2 <= 48 ? 1 : Math.pow(2, log2 - 48);
+      // Decrease the approximation until it is smaller than the remainder.  Note
+      // that if it is too large, the product overflows and is negative.
+      let approxRes = Long.fromNumber(approx);
+      let approxRem = approxRes.multiply(divisor);
+      while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+        approx -= delta;
+        approxRes = Long.fromNumber(approx, this.unsigned);
+        approxRem = approxRes.multiply(divisor);
+      }
+
+      // We know the answer can't be zero... and actually, zero would cause
+      // infinite recursion since we would make no progress.
+      if (approxRes.isZero()) {
+        approxRes = Long.ONE;
+      }
+
+      res = res.add(approxRes);
+      rem = rem.subtract(approxRem);
+    }
+    return res;
+  }
+
+  /**
+   * Returns this Long modulo the specified.
+   */
+  modulo(divisor: Long | number | string) {
+    if (!(divisor instanceof Long)) {
+      divisor = Long.fromValue(divisor);
+    }
+
+    if (wasm) {
+      const low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(
+        this.low,
+        this.high,
+        divisor.low,
+        divisor.high
+      );
+      return Long.fromBits(low, wasm.get_high(), this.unsigned);
+    }
+
+    return this.subtract(this.divide(divisor).multiply(divisor));
+  }
+
+  /**
+   * Returns the bitwise NOT of this Long.
+   */
+  not() {
+    return Long.fromBits(~this.low, ~this.high, this.unsigned);
+  }
+
+  /**
+   * Returns the bitwise AND of this Long and the specified.
+   */
+  and(other: Long | number | string) {
+    if (!(other instanceof Long)) {
+      other = Long.fromValue(other);
+    }
+    return Long.fromBits(
+      this.low & other.low,
+      this.high & other.high,
+      this.unsigned
+    );
+  }
+
+  /**
+   * Returns the bitwise OR of this Long and the specified.
+   */
+  or(other: Long | number | string) {
+    if (!(other instanceof Long)) {
+      other = Long.fromValue(other);
+    }
+    return Long.fromBits(
+      this.low | other.low,
+      this.high | other.high,
+      this.unsigned
+    );
+  }
+
+  /**
+   * Returns the bitwise XOR of this Long and the given one.
+   */
+  xor(other: Long | number | string) {
+    if (!(other instanceof Long)) {
+      other = Long.fromValue(other);
+    }
+    return Long.fromBits(
+      this.low ^ other.low,
+      this.high ^ other.high,
+      this.unsigned
+    );
+  }
+
+  /**
+   * Returns this Long with bits shifted to the left by the given amount.
+   */
+  shiftLeft(numBits: number | Long) {
+    if (numBits instanceof Long) {
+      numBits = numBits.toInt();
+    }
+    if ((numBits &= 63) === 0) {
+      return this;
+    } else if (numBits < 32) {
+      return Long.fromBits(
+        this.low << numBits,
+        (this.high << numBits) | (this.low >>> (32 - numBits)),
+        this.unsigned
+      );
+    } else {
+      return Long.fromBits(0, this.low << (numBits - 32), this.unsigned);
+    }
+  }
+
+  /**
+   * Returns this Long with bits arithmetically shifted to the right by the given amount.
+   */
+  shiftRight(numBits: number | Long) {
+    if (numBits instanceof Long) {
+      numBits = numBits.toInt();
+    }
+    if ((numBits &= 63) === 0) {
+      return this;
+    } else if (numBits < 32) {
+      return Long.fromBits(
+        (this.low >>> numBits) | (this.high << (32 - numBits)),
+        this.high >> numBits,
+        this.unsigned
+      );
+    } else {
+      return Long.fromBits(
+        this.high >> (numBits - 32),
+        this.high >= 0 ? 0 : -1,
+        this.unsigned
+      );
+    }
+  }
+
+  /**
+   * Returns this Long with bits logically shifted to the right by the given amount.
+   */
+  shiftRightUnsigned(numBits: number | Long) {
+    if (numBits instanceof Long) {
+      numBits = numBits.toInt();
+    }
+    if ((numBits &= 63) === 0) {
+      return this;
+    }
+    if (numBits < 32) {
+      return Long.fromBits(
+        (this.low >>> numBits) | (this.high << (32 - numBits)),
+        this.high >>> numBits,
+        this.unsigned
+      );
+    }
+    if (numBits === 32) {
+      return Long.fromBits(this.high, 0, this.unsigned);
+    }
+    return Long.fromBits(this.high >>> (numBits - 32), 0, this.unsigned);
+  }
+
+  /**
+   * Returns this Long with bits rotated to the left by the given amount.
+   */
+  rotateLeft(numBits: number | Long) {
+    let b;
+    if (numBits instanceof Long) {
+      numBits = numBits.toInt();
+    }
+    if ((numBits &= 63) === 0) {
+      return this;
+    }
+    if (numBits === 32) {
+      return Long.fromBits(this.high, this.low, this.unsigned);
+    }
+    if (numBits < 32) {
+      b = 32 - numBits;
+      return Long.fromBits(
+        (this.low << numBits) | (this.high >>> b),
+        (this.high << numBits) | (this.low >>> b),
+        this.unsigned
+      );
+    }
+    numBits -= 32;
+    b = 32 - numBits;
+    return Long.fromBits(
+      (this.high << numBits) | (this.low >>> b),
+      (this.low << numBits) | (this.high >>> b),
+      this.unsigned
+    );
+  }
+
+  /**
+   * Returns this Long with bits rotated to the right by the given amount.
+   */
+  rotateRight(numBits: number | Long) {
+    let b;
+    if (numBits instanceof Long) {
+      numBits = numBits.toInt();
+    }
+    if ((numBits &= 63) === 0) {
+      return this;
+    }
+    if (numBits === 32) {
+      return Long.fromBits(this.high, this.low, this.unsigned);
+    }
+    if (numBits < 32) {
+      b = 32 - numBits;
+      return Long.fromBits(
+        (this.high << b) | (this.low >>> numBits),
+        (this.low << b) | (this.high >>> numBits),
+        this.unsigned
+      );
+    }
+    numBits -= 32;
+    b = 32 - numBits;
+    return Long.fromBits(
+      (this.low << b) | (this.high >>> numBits),
+      (this.high << b) | (this.low >>> numBits),
+      this.unsigned
+    );
+  }
+
+  /**
+   * Converts this Long to signed.
+   */
+  toSigned() {
+    if (!this.unsigned) {
+      return this;
+    }
+    return Long.fromBits(this.low, this.high, false);
+  }
+
+  /**
+   * Converts this Long to unsigned.
+   */
+  toUnsigned() {
+    if (this.unsigned) {
+      return this;
+    }
+    return Long.fromBits(this.low, this.high, true);
+  }
+
+  /**
+   * Converts this Long to its byte representation.
+   */
+  toBytes(le?: boolean) {
+    return le ? this.toBytesLE() : this.toBytesBE();
+  }
+
+  /**
+   * Converts this Long to its little endian byte representation.
+   */
+  toBytesLE() {
+    const hi = this.high;
+    const lo = this.low;
+    return [
+      lo & 0xff,
+      (lo >>> 8) & 0xff,
+      (lo >>> 16) & 0xff,
+      lo >>> 24,
+      hi & 0xff,
+      (hi >>> 8) & 0xff,
+      (hi >>> 16) & 0xff,
+      hi >>> 24,
+    ];
+  }
+
+  /**
+   * Converts this Long to its big endian byte representation.
+   */
+  toBytesBE() {
+    const hi = this.high;
+    const lo = this.low;
+    return [
+      hi >>> 24,
+      (hi >>> 16) & 0xff,
+      (hi >>> 8) & 0xff,
+      hi & 0xff,
+      lo >>> 24,
+      (lo >>> 16) & 0xff,
+      (lo >>> 8) & 0xff,
+      lo & 0xff,
+    ];
+  }
+
+  /**
+   * Creates a Long from its byte representation.
+   */
+  static fromBytes(bytes: number[], unsigned?: boolean, le?: boolean) {
+    return le
+      ? Long.fromBytesLE(bytes, unsigned)
+      : Long.fromBytesBE(bytes, unsigned);
+  }
+
+  /**
+   * Creates a Long from its little endian byte representation.
+   */
+  static fromBytesLE(bytes: number[], unsigned?: boolean) {
+    return new Long(
+      bytes[0] | (bytes[1] << 8) | (bytes[2] << 16) | (bytes[3] << 24),
+      bytes[4] | (bytes[5] << 8) | (bytes[6] << 16) | (bytes[7] << 24),
+      unsigned
+    );
+  }
+
+  /**
+   * Creates a Long from its big endian byte representation.
+   */
+  static fromBytesBE(bytes: number[], unsigned?: boolean) {
+    return new Long(
+      (bytes[4] << 24) | (bytes[5] << 16) | (bytes[6] << 8) | bytes[7],
+      (bytes[0] << 24) | (bytes[1] << 16) | (bytes[2] << 8) | bytes[3],
+      unsigned
+    );
+  }
+
+  /**
+   * Returns a Long representing the given 32 bit integer value.
+   */
+  static fromInt(value: number, unsigned?: boolean) {
+    let cache;
+    if (unsigned) {
+      value >>>= 0;
+      if ((cache = 0 <= value && value < 256)) {
+        const cachedObj = UINT_CACHE[value];
+        if (cachedObj) {
+          return cachedObj;
+        }
+      }
+      const obj = Long.fromBits(value, (value | 0) < 0 ? -1 : 0, true);
+      if (cache) {
+        UINT_CACHE[value] = obj;
+      }
+      return obj;
+    } else {
+      value |= 0;
+      if ((cache = -128 <= value && value < 128)) {
+        const cachedObj = INT_CACHE[value];
+        if (cachedObj) {
+          return cachedObj;
+        }
+      }
+      const obj = Long.fromBits(value, value < 0 ? -1 : 0, false);
+      if (cache) {
+        INT_CACHE[value] = obj;
+      }
+      return obj;
+    }
+  }
+
+  /**
+   * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
+   */
+  static fromNumber(value: number, unsigned?: boolean): Long {
+    if (isNaN(value)) {
+      return unsigned ? Long.UZERO : Long.ZERO;
+    }
+    if (unsigned) {
+      if (value < 0) {
+        return Long.UZERO;
+      }
+      if (value >= TWO_PWR_64_DBL) {
+        return Long.MAX_UNSIGNED_VALUE;
+      }
+    } else {
+      if (value <= -TWO_PWR_63_DBL) {
+        return Long.MIN_VALUE;
+      }
+      if (value + 1 >= TWO_PWR_63_DBL) {
+        return Long.MAX_VALUE;
+      }
+    }
+    if (value < 0) {
+      return Long.fromNumber(-value, unsigned).negate();
+    }
+    return Long.fromBits(
+      value % TWO_PWR_32_DBL | 0,
+      (value / TWO_PWR_32_DBL) | 0,
+      unsigned
+    );
+  }
+
+  /**
+   * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is assumed to use 32 bits.
+   */
+  static fromBits(lowBits: number, highBits: number, unsigned?: boolean) {
+    return new Long(lowBits, highBits, unsigned);
+  }
+
+  /**
+   * Returns a Long representation of the given string, written using the specified radix.
+   */
+  static fromString(
+    str: string,
+    unsigned?: boolean | number,
+    radix?: number
+  ): Long {
+    if (str.length === 0) {
+      throw Error("empty string");
+    }
+    if (
+      str === "NaN" ||
+      str === "Infinity" ||
+      str === "+Infinity" ||
+      str === "-Infinity"
+    ) {
+      return Long.ZERO;
+    }
+    if (typeof unsigned === "number") {
+      // For goog.math.long compatibility
+      (radix = unsigned), (unsigned = false);
+    } else {
+      unsigned = !!unsigned;
+    }
+    radix = radix || 10;
+    if (radix < 2 || 36 < radix) {
+      throw RangeError("radix");
+    }
+
+    let p;
+    if ((p = str.indexOf("-")) > 0) {
+      throw Error("interior hyphen");
+    } else if (p === 0) {
+      return Long.fromString(str.substring(1), unsigned, radix).negate();
+    }
+
+    // Do several (8) digits each time through the loop, so as to
+    // minimize the calls to the very expensive emulated div.
+    const radixToPower = Long.fromNumber(Math.pow(radix, 8));
+
+    let result = Long.ZERO;
+    for (let i = 0; i < str.length; i += 8) {
+      const size = Math.min(8, str.length - i);
+      const value = parseInt(str.substring(i, i + size), radix);
+      if (size < 8) {
+        const power = Long.fromNumber(Math.pow(radix, size));
+        result = result.multiply(power).add(Long.fromNumber(value));
+      } else {
+        result = result.multiply(radixToPower);
+        result = result.add(Long.fromNumber(value));
+      }
+    }
+    result.unsigned = unsigned;
+    return result;
+  }
+
+  /**
+   * Converts the specified value to a Long using the appropriate from* function for its type.
+   */
+  static fromValue(
+    val:
+      | Long
+      | number
+      | string
+      | { low: number; high: number; unsigned: boolean },
+    unsigned?: boolean
+  ) {
+    if (typeof val === "number") {
+      return Long.fromNumber(val, unsigned);
+    }
+    if (typeof val === "string") {
+      return Long.fromString(val, unsigned);
+    }
+    return Long.fromBits(
+      val.low,
+      val.high,
+      typeof unsigned === "boolean" ? unsigned : val.unsigned
+    );
+  }
+}
+
+const TWO_PWR_16_DBL = 1 << 16;
+const TWO_PWR_24_DBL = 1 << 24;
+const TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;
+const TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;
+const TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;
+const TWO_PWR_24 = Long.fromInt(TWO_PWR_24_DBL);
diff --git a/protocol/src/main/resources/typescript/buffer/longbits.js b/protocol/src/main/resources/typescript/buffer/Longbits.ts
similarity index 61%
rename from protocol/src/main/resources/typescript/buffer/longbits.js
rename to protocol/src/main/resources/typescript/buffer/Longbits.ts
index 23f759ad..a3115e58 100644
--- a/protocol/src/main/resources/typescript/buffer/longbits.js
+++ b/protocol/src/main/resources/typescript/buffer/Longbits.ts
@@ -1,7 +1,6 @@
-// from protobuf
-const Long = require('./long.js')
+// from https://github.com/hornta/long-ts
+import {Long} from "./Long";
 
-module.exports = LongBits;
 
 /**
  * Constructs new long bits.
@@ -11,101 +10,92 @@ module.exports = LongBits;
  * @param {number} lo Low 32 bits, unsigned
  * @param {number} hi High 32 bits, unsigned
  */
-function LongBits(lo, hi) {
-    // note that the casts below are theoretically unnecessary as of today, but older statically
-    // generated converter code might still call the ctor with signed 32bits. kept for compat.
+class Longbits {
+  lo: number;
+  hi: number;
 
-    /**
-     * Low bits.
-     * @type {number}
-     */
+  constructor(lo:number, hi:number) {
     this.lo = lo >>> 0;
-
-    /**
-     * High bits.
-     * @type {number}
-     */
     this.hi = hi >>> 0;
-}
+  }
 
-/**
- * Zig-zag encodes this long bits.
- * @returns {util.LongBits} `this`
- */
-LongBits.prototype.zzEncode = function zzEncode() {
+  /**
+   * Zig-zag encodes this long bits.
+   */
+  zzEncode(): Longbits {
     const mask = this.hi >> 31;
     this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;
     this.lo = (this.lo << 1 ^ mask) >>> 0;
     return this;
-};
+  };
 
-/**
- * Zig-zag decodes this long bits.
- * @returns {util.LongBits} `this`
- */
-LongBits.prototype.zzDecode = function zzDecode() {
+  /**
+   * Zig-zag decodes this long bits.
+   */
+  zzDecode(): Longbits {
     const mask = -(this.lo & 1);
     this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;
     this.hi = (this.hi >>> 1 ^ mask) >>> 0;
     return this;
-};
+  };
 
-/**
- * Converts this long bits to a long.
- * @param {boolean} [unsigned=false] Whether unsigned or not
- * @returns {Long} Long
- */
-LongBits.prototype.toLong = function toLong(unsigned) {
+
+  /**
+   * Converts this long bits to a long.
+   */
+  toLong(unsigned): Long {
     return new Long(this.lo | 0, this.hi | 0, Boolean(unsigned));
-};
+  };
 
-/**
- * Zero bits.
- * @memberof util.LongBits
- * @type {util.LongBits}
- */
-const zero = LongBits.zero = new LongBits(0, 0);
-
-function from(value) {
+  /**
+   * Constructs new long bits from the specified number.
+   */
+  static from(value) {
     if (typeof value === 'number') {
-        return fromNumber(value);
+      return Longbits.fromNumber(value);
     }
     if (typeof value === 'string' || value instanceof String) {
-        value = Long.fromString(value);
+      value = Long.fromString(value);
     }
-    return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;
-}
+    return value.low || value.high ? new Longbits(value.low >>> 0, value.high >>> 0) : zero;
+  }
 
-
-/**
- * Constructs new long bits from the specified number.
- * @param {number} value Value
- * @returns {util.LongBits} Instance
- */
-function fromNumber(value) {
+  /**
+   * Constructs new long bits from the specified number.
+   */
+  static fromNumber(value): Longbits {
     if (value === 0) {
-        return zero;
+      return zero;
     }
     const sign = value < 0;
     if (sign) {
-        value = -value;
+      value = -value;
     }
     let lo = value >>> 0;
     let hi = (value - lo) / 4294967296 >>> 0;
     if (sign) {
-        hi = ~hi >>> 0;
-        lo = ~lo >>> 0;
-        if (++lo > 4294967295) {
-            lo = 0;
-            if (++hi > 4294967295) {
-                hi = 0;
-            }
+      hi = ~hi >>> 0;
+      lo = ~lo >>> 0;
+      if (++lo > 4294967295) {
+        lo = 0;
+        if (++hi > 4294967295) {
+          hi = 0;
         }
+      }
     }
-    return new LongBits(lo, hi);
+    return new Longbits(lo, hi);
+  }
 }
 
-function writeVarint64(byteBuffer, value) {
+
+
+/**
+ * Zero bits.
+ */
+const zero = new Longbits(0, 0);
+
+
+function writeVarint64(byteBuffer: any, value: Longbits) {
     let count = 0;
     while (value.hi) {
         byteBuffer.writeByte(value.lo & 127 | 128);
@@ -125,9 +115,9 @@ function writeVarint64(byteBuffer, value) {
     byteBuffer.writeByte(value.lo);
 }
 
-function readLongVarint(buffer) {
+function readLongVarint(buffer: any) {
     // tends to deopt with local vars for octet etc.
-    const bits = new LongBits(0, 0);
+    const bits = new Longbits(0, 0);
     let i = 0;
     const len = buffer.length;
     let pos = 0;
@@ -175,15 +165,11 @@ function readLongVarint(buffer) {
     return bits;
 }
 
-function writeInt64(byteBuffer, value) {
-    const bits = from(value).zzEncode();
+export function writeInt64(byteBuffer: any, value: any) {
+    const bits = Longbits.from(value).zzEncode();
     writeVarint64(byteBuffer, bits);
 }
 
-function readInt64(buffer) {
+export function readInt64(buffer: any): Long {
     return readLongVarint(buffer).zzDecode().toLong(false);
 }
-
-LongBits.writeInt64 = writeInt64;
-
-LongBits.readInt64 = readInt64;
diff --git a/protocol/src/main/resources/typescript/buffer/long.js b/protocol/src/main/resources/typescript/buffer/long.js
deleted file mode 100644
index dbe065ec..00000000
--- a/protocol/src/main/resources/typescript/buffer/long.js
+++ /dev/null
@@ -1,1325 +0,0 @@
-/* eslint-disable */
-// from https://github.com/dcodeIO/long.js
-module.exports = Long;
-
-/**
- * wasm optimizations, to do native i64 multiplication and divide
- */
-var wasm = null;
-
-try {
-    wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
-        0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11
-    ])), {}).exports;
-} catch (e) {
-    // no wasm support :(
-}
-
-/**
- * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.
- *  See the from* functions below for more convenient ways of constructing Longs.
- * @exports Long
- * @class A Long class for representing a 64 bit two's-complement integer value.
- * @param {number} low The low (signed) 32 bits of the long
- * @param {number} high The high (signed) 32 bits of the long
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @constructor
- */
-function Long(low, high, unsigned) {
-
-    /**
-     * The low 32 bits as a signed value.
-     * @type {number}
-     */
-    this.low = low | 0;
-
-    /**
-     * The high 32 bits as a signed value.
-     * @type {number}
-     */
-    this.high = high | 0;
-
-    /**
-     * Whether unsigned or not.
-     * @type {boolean}
-     */
-    this.unsigned = !!unsigned;
-}
-
-// The internal representation of a long is the two given signed, 32-bit values.
-// We use 32-bit pieces because these are the size of integers on which
-// Javascript performs bit-operations.  For operations like addition and
-// multiplication, we split each number into 16 bit pieces, which can easily be
-// multiplied within Javascript's floating-point representation without overflow
-// or change in sign.
-//
-// In the algorithms below, we frequently reduce the negative case to the
-// positive case by negating the input(s) and then post-processing the result.
-// Note that we must ALWAYS check specially whether those values are MIN_VALUE
-// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
-// a positive number, it overflows back into a negative).  Not handling this
-// case would often result in infinite recursion.
-//
-// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*
-// methods on which they depend.
-
-/**
- * An indicator used to reliably determine if an object is a Long or not.
- * @type {boolean}
- * @const
- * @private
- */
-Long.prototype.__isLong__;
-
-Object.defineProperty(Long.prototype, "__isLong__", {value: true});
-
-/**
- * @function
- * @param {*} obj Object
- * @returns {boolean}
- * @inner
- */
-function isLong(obj) {
-    return (obj && obj["__isLong__"]) === true;
-}
-
-/**
- * Tests if the specified object is a Long.
- * @function
- * @param {*} obj Object
- * @returns {boolean}
- */
-Long.isLong = isLong;
-
-/**
- * A cache of the Long representations of small integer values.
- * @type {!Object}
- * @inner
- */
-var INT_CACHE = {};
-
-/**
- * A cache of the Long representations of small unsigned integer values.
- * @type {!Object}
- * @inner
- */
-var UINT_CACHE = {};
-
-/**
- * @param {number} value
- * @param {boolean=} unsigned
- * @returns {!Long}
- * @inner
- */
-function fromInt(value, unsigned) {
-    var obj, cachedObj, cache;
-    if (unsigned) {
-        value >>>= 0;
-        if (cache = (0 <= value && value < 256)) {
-            cachedObj = UINT_CACHE[value];
-            if (cachedObj)
-                return cachedObj;
-        }
-        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);
-        if (cache)
-            UINT_CACHE[value] = obj;
-        return obj;
-    } else {
-        value |= 0;
-        if (cache = (-128 <= value && value < 128)) {
-            cachedObj = INT_CACHE[value];
-            if (cachedObj)
-                return cachedObj;
-        }
-        obj = fromBits(value, value < 0 ? -1 : 0, false);
-        if (cache)
-            INT_CACHE[value] = obj;
-        return obj;
-    }
-}
-
-/**
- * Returns a Long representing the given 32 bit integer value.
- * @function
- * @param {number} value The 32 bit integer in question
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @returns {!Long} The corresponding Long value
- */
-Long.fromInt = fromInt;
-
-/**
- * @param {number} value
- * @param {boolean=} unsigned
- * @returns {!Long}
- * @inner
- */
-function fromNumber(value, unsigned) {
-    if (isNaN(value))
-        return unsigned ? UZERO : ZERO;
-    if (unsigned) {
-        if (value < 0)
-            return UZERO;
-        if (value >= TWO_PWR_64_DBL)
-            return MAX_UNSIGNED_VALUE;
-    } else {
-        if (value <= -TWO_PWR_63_DBL)
-            return MIN_VALUE;
-        if (value + 1 >= TWO_PWR_63_DBL)
-            return MAX_VALUE;
-    }
-    if (value < 0)
-        return fromNumber(-value, unsigned).neg();
-    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);
-}
-
-/**
- * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
- * @function
- * @param {number} value The number in question
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @returns {!Long} The corresponding Long value
- */
-Long.fromNumber = fromNumber;
-
-/**
- * @param {number} lowBits
- * @param {number} highBits
- * @param {boolean=} unsigned
- * @returns {!Long}
- * @inner
- */
-function fromBits(lowBits, highBits, unsigned) {
-    return new Long(lowBits, highBits, unsigned);
-}
-
-/**
- * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is
- *  assumed to use 32 bits.
- * @function
- * @param {number} lowBits The low 32 bits
- * @param {number} highBits The high 32 bits
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @returns {!Long} The corresponding Long value
- */
-Long.fromBits = fromBits;
-
-/**
- * @function
- * @param {number} base
- * @param {number} exponent
- * @returns {number}
- * @inner
- */
-var pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)
-
-/**
- * @param {string} str
- * @param {(boolean|number)=} unsigned
- * @param {number=} radix
- * @returns {!Long}
- * @inner
- */
-function fromString(str, unsigned, radix) {
-    if (str.length === 0)
-        throw Error('empty string');
-    if (str === "NaN" || str === "Infinity" || str === "+Infinity" || str === "-Infinity")
-        return ZERO;
-    if (typeof unsigned === 'number') {
-        // For goog.math.long compatibility
-        radix = unsigned,
-            unsigned = false;
-    } else {
-        unsigned = !!unsigned;
-    }
-    radix = radix || 10;
-    if (radix < 2 || 36 < radix)
-        throw RangeError('radix');
-
-    var p;
-    if ((p = str.indexOf('-')) > 0)
-        throw Error('interior hyphen');
-    else if (p === 0) {
-        return fromString(str.substring(1), unsigned, radix).neg();
-    }
-
-    // Do several (8) digits each time through the loop, so as to
-    // minimize the calls to the very expensive emulated div.
-    var radixToPower = fromNumber(pow_dbl(radix, 8));
-
-    var result = ZERO;
-    for (var i = 0; i < str.length; i += 8) {
-        var size = Math.min(8, str.length - i),
-            value = parseInt(str.substring(i, i + size), radix);
-        if (size < 8) {
-            var power = fromNumber(pow_dbl(radix, size));
-            result = result.mul(power).add(fromNumber(value));
-        } else {
-            result = result.mul(radixToPower);
-            result = result.add(fromNumber(value));
-        }
-    }
-    result.unsigned = unsigned;
-    return result;
-}
-
-/**
- * Returns a Long representation of the given string, written using the specified radix.
- * @function
- * @param {string} str The textual representation of the Long
- * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed
- * @param {number=} radix The radix in which the text is written (2-36), defaults to 10
- * @returns {!Long} The corresponding Long value
- */
-Long.fromString = fromString;
-
-/**
- * @function
- * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val
- * @param {boolean=} unsigned
- * @returns {!Long}
- * @inner
- */
-function fromValue(val, unsigned) {
-    if (typeof val === 'number')
-        return fromNumber(val, unsigned);
-    if (typeof val === 'string')
-        return fromString(val, unsigned);
-    // Throws for non-objects, converts non-instanceof Long:
-    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);
-}
-
-/**
- * Converts the specified value to a Long using the appropriate from* function for its type.
- * @function
- * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @returns {!Long}
- */
-Long.fromValue = fromValue;
-
-// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be
-// no runtime penalty for these.
-
-/**
- * @type {number}
- * @const
- * @inner
- */
-var TWO_PWR_16_DBL = 1 << 16;
-
-/**
- * @type {number}
- * @const
- * @inner
- */
-var TWO_PWR_24_DBL = 1 << 24;
-
-/**
- * @type {number}
- * @const
- * @inner
- */
-var TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;
-
-/**
- * @type {number}
- * @const
- * @inner
- */
-var TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;
-
-/**
- * @type {number}
- * @const
- * @inner
- */
-var TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;
-
-/**
- * @type {!Long}
- * @const
- * @inner
- */
-var TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);
-
-/**
- * @type {!Long}
- * @inner
- */
-var ZERO = fromInt(0);
-
-/**
- * Signed zero.
- * @type {!Long}
- */
-Long.ZERO = ZERO;
-
-/**
- * @type {!Long}
- * @inner
- */
-var UZERO = fromInt(0, true);
-
-/**
- * Unsigned zero.
- * @type {!Long}
- */
-Long.UZERO = UZERO;
-
-/**
- * @type {!Long}
- * @inner
- */
-var ONE = fromInt(1);
-
-/**
- * Signed one.
- * @type {!Long}
- */
-Long.ONE = ONE;
-
-/**
- * @type {!Long}
- * @inner
- */
-var UONE = fromInt(1, true);
-
-/**
- * Unsigned one.
- * @type {!Long}
- */
-Long.UONE = UONE;
-
-/**
- * @type {!Long}
- * @inner
- */
-var NEG_ONE = fromInt(-1);
-
-/**
- * Signed negative one.
- * @type {!Long}
- */
-Long.NEG_ONE = NEG_ONE;
-
-/**
- * @type {!Long}
- * @inner
- */
-var MAX_VALUE = fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0, false);
-
-/**
- * Maximum signed value.
- * @type {!Long}
- */
-Long.MAX_VALUE = MAX_VALUE;
-
-/**
- * @type {!Long}
- * @inner
- */
-var MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF | 0, 0xFFFFFFFF | 0, true);
-
-/**
- * Maximum unsigned value.
- * @type {!Long}
- */
-Long.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;
-
-/**
- * @type {!Long}
- * @inner
- */
-var MIN_VALUE = fromBits(0, 0x80000000 | 0, false);
-
-/**
- * Minimum signed value.
- * @type {!Long}
- */
-Long.MIN_VALUE = MIN_VALUE;
-
-/**
- * @alias Long.prototype
- * @inner
- */
-var LongPrototype = Long.prototype;
-
-/**
- * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.
- * @returns {number}
- */
-LongPrototype.toInt = function toInt() {
-    return this.unsigned ? this.low >>> 0 : this.low;
-};
-
-/**
- * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).
- * @returns {number}
- */
-LongPrototype.toNumber = function toNumber() {
-    if (this.unsigned)
-        return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);
-    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);
-};
-
-/**
- * Converts the Long to a string written in the specified radix.
- * @param {number=} radix Radix (2-36), defaults to 10
- * @returns {string}
- * @override
- * @throws {RangeError} If `radix` is out of range
- */
-LongPrototype.toString = function toString(radix) {
-    radix = radix || 10;
-    if (radix < 2 || 36 < radix)
-        throw RangeError('radix');
-    if (this.isZero())
-        return '0';
-    if (this.isNegative()) { // Unsigned Longs are never negative
-        if (this.eq(MIN_VALUE)) {
-            // We need to change the Long value before it can be negated, so we remove
-            // the bottom-most digit in this base and then recurse to do the rest.
-            var radixLong = fromNumber(radix),
-                div = this.div(radixLong),
-                rem1 = div.mul(radixLong).sub(this);
-            return div.toString(radix) + rem1.toInt().toString(radix);
-        } else
-            return '-' + this.neg().toString(radix);
-    }
-
-    // Do several (6) digits each time through the loop, so as to
-    // minimize the calls to the very expensive emulated div.
-    var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),
-        rem = this;
-    var result = '';
-    while (true) {
-        var remDiv = rem.div(radixToPower),
-            intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,
-            digits = intval.toString(radix);
-        rem = remDiv;
-        if (rem.isZero())
-            return digits + result;
-        else {
-            while (digits.length < 6)
-                digits = '0' + digits;
-            result = '' + digits + result;
-        }
-    }
-};
-
-/**
- * Gets the high 32 bits as a signed integer.
- * @returns {number} Signed high bits
- */
-LongPrototype.getHighBits = function getHighBits() {
-    return this.high;
-};
-
-/**
- * Gets the high 32 bits as an unsigned integer.
- * @returns {number} Unsigned high bits
- */
-LongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {
-    return this.high >>> 0;
-};
-
-/**
- * Gets the low 32 bits as a signed integer.
- * @returns {number} Signed low bits
- */
-LongPrototype.getLowBits = function getLowBits() {
-    return this.low;
-};
-
-/**
- * Gets the low 32 bits as an unsigned integer.
- * @returns {number} Unsigned low bits
- */
-LongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {
-    return this.low >>> 0;
-};
-
-/**
- * Gets the number of bits needed to represent the absolute value of this Long.
- * @returns {number}
- */
-LongPrototype.getNumBitsAbs = function getNumBitsAbs() {
-    if (this.isNegative()) // Unsigned Longs are never negative
-        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();
-    var val = this.high != 0 ? this.high : this.low;
-    for (var bit = 31; bit > 0; bit--)
-        if ((val & (1 << bit)) != 0)
-            break;
-    return this.high != 0 ? bit + 33 : bit + 1;
-};
-
-/**
- * Tests if this Long's value equals zero.
- * @returns {boolean}
- */
-LongPrototype.isZero = function isZero() {
-    return this.high === 0 && this.low === 0;
-};
-
-/**
- * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.
- * @returns {boolean}
- */
-LongPrototype.eqz = LongPrototype.isZero;
-
-/**
- * Tests if this Long's value is negative.
- * @returns {boolean}
- */
-LongPrototype.isNegative = function isNegative() {
-    return !this.unsigned && this.high < 0;
-};
-
-/**
- * Tests if this Long's value is positive.
- * @returns {boolean}
- */
-LongPrototype.isPositive = function isPositive() {
-    return this.unsigned || this.high >= 0;
-};
-
-/**
- * Tests if this Long's value is odd.
- * @returns {boolean}
- */
-LongPrototype.isOdd = function isOdd() {
-    return (this.low & 1) === 1;
-};
-
-/**
- * Tests if this Long's value is even.
- * @returns {boolean}
- */
-LongPrototype.isEven = function isEven() {
-    return (this.low & 1) === 0;
-};
-
-/**
- * Tests if this Long's value equals the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.equals = function equals(other) {
-    if (!isLong(other))
-        other = fromValue(other);
-    if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)
-        return false;
-    return this.high === other.high && this.low === other.low;
-};
-
-/**
- * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.eq = LongPrototype.equals;
-
-/**
- * Tests if this Long's value differs from the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.notEquals = function notEquals(other) {
-    return !this.eq(/* validates */ other);
-};
-
-/**
- * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.neq = LongPrototype.notEquals;
-
-/**
- * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.ne = LongPrototype.notEquals;
-
-/**
- * Tests if this Long's value is less than the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.lessThan = function lessThan(other) {
-    return this.comp(/* validates */ other) < 0;
-};
-
-/**
- * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.lt = LongPrototype.lessThan;
-
-/**
- * Tests if this Long's value is less than or equal the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {
-    return this.comp(/* validates */ other) <= 0;
-};
-
-/**
- * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.lte = LongPrototype.lessThanOrEqual;
-
-/**
- * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.le = LongPrototype.lessThanOrEqual;
-
-/**
- * Tests if this Long's value is greater than the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.greaterThan = function greaterThan(other) {
-    return this.comp(/* validates */ other) > 0;
-};
-
-/**
- * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.gt = LongPrototype.greaterThan;
-
-/**
- * Tests if this Long's value is greater than or equal the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {
-    return this.comp(/* validates */ other) >= 0;
-};
-
-/**
- * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.gte = LongPrototype.greaterThanOrEqual;
-
-/**
- * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {boolean}
- */
-LongPrototype.ge = LongPrototype.greaterThanOrEqual;
-
-/**
- * Compares this Long's value with the specified's.
- * @param {!Long|number|string} other Other value
- * @returns {number} 0 if they are the same, 1 if the this is greater and -1
- *  if the given one is greater
- */
-LongPrototype.compare = function compare(other) {
-    if (!isLong(other))
-        other = fromValue(other);
-    if (this.eq(other))
-        return 0;
-    var thisNeg = this.isNegative(),
-        otherNeg = other.isNegative();
-    if (thisNeg && !otherNeg)
-        return -1;
-    if (!thisNeg && otherNeg)
-        return 1;
-    // At this point the sign bits are the same
-    if (!this.unsigned)
-        return this.sub(other).isNegative() ? -1 : 1;
-    // Both are positive if at least one is unsigned
-    return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;
-};
-
-/**
- * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.
- * @function
- * @param {!Long|number|string} other Other value
- * @returns {number} 0 if they are the same, 1 if the this is greater and -1
- *  if the given one is greater
- */
-LongPrototype.comp = LongPrototype.compare;
-
-/**
- * Negates this Long's value.
- * @returns {!Long} Negated Long
- */
-LongPrototype.negate = function negate() {
-    if (!this.unsigned && this.eq(MIN_VALUE))
-        return MIN_VALUE;
-    return this.not().add(ONE);
-};
-
-/**
- * Negates this Long's value. This is an alias of {@link Long#negate}.
- * @function
- * @returns {!Long} Negated Long
- */
-LongPrototype.neg = LongPrototype.negate;
-
-/**
- * Returns the sum of this and the specified Long.
- * @param {!Long|number|string} addend Addend
- * @returns {!Long} Sum
- */
-LongPrototype.add = function add(addend) {
-    if (!isLong(addend))
-        addend = fromValue(addend);
-
-    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
-
-    var a48 = this.high >>> 16;
-    var a32 = this.high & 0xFFFF;
-    var a16 = this.low >>> 16;
-    var a00 = this.low & 0xFFFF;
-
-    var b48 = addend.high >>> 16;
-    var b32 = addend.high & 0xFFFF;
-    var b16 = addend.low >>> 16;
-    var b00 = addend.low & 0xFFFF;
-
-    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-    c00 += a00 + b00;
-    c16 += c00 >>> 16;
-    c00 &= 0xFFFF;
-    c16 += a16 + b16;
-    c32 += c16 >>> 16;
-    c16 &= 0xFFFF;
-    c32 += a32 + b32;
-    c48 += c32 >>> 16;
-    c32 &= 0xFFFF;
-    c48 += a48 + b48;
-    c48 &= 0xFFFF;
-    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
-};
-
-/**
- * Returns the difference of this and the specified Long.
- * @param {!Long|number|string} subtrahend Subtrahend
- * @returns {!Long} Difference
- */
-LongPrototype.subtract = function subtract(subtrahend) {
-    if (!isLong(subtrahend))
-        subtrahend = fromValue(subtrahend);
-    return this.add(subtrahend.neg());
-};
-
-/**
- * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.
- * @function
- * @param {!Long|number|string} subtrahend Subtrahend
- * @returns {!Long} Difference
- */
-LongPrototype.sub = LongPrototype.subtract;
-
-/**
- * Returns the product of this and the specified Long.
- * @param {!Long|number|string} multiplier Multiplier
- * @returns {!Long} Product
- */
-LongPrototype.multiply = function multiply(multiplier) {
-    if (this.isZero())
-        return ZERO;
-    if (!isLong(multiplier))
-        multiplier = fromValue(multiplier);
-
-    // use wasm support if present
-    if (wasm) {
-        var low = wasm.mul(this.low,
-            this.high,
-            multiplier.low,
-            multiplier.high);
-        return fromBits(low, wasm.get_high(), this.unsigned);
-    }
-
-    if (multiplier.isZero())
-        return ZERO;
-    if (this.eq(MIN_VALUE))
-        return multiplier.isOdd() ? MIN_VALUE : ZERO;
-    if (multiplier.eq(MIN_VALUE))
-        return this.isOdd() ? MIN_VALUE : ZERO;
-
-    if (this.isNegative()) {
-        if (multiplier.isNegative())
-            return this.neg().mul(multiplier.neg());
-        else
-            return this.neg().mul(multiplier).neg();
-    } else if (multiplier.isNegative())
-        return this.mul(multiplier.neg()).neg();
-
-    // If both longs are small, use float multiplication
-    if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))
-        return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);
-
-    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
-    // We can skip products that would overflow.
-
-    var a48 = this.high >>> 16;
-    var a32 = this.high & 0xFFFF;
-    var a16 = this.low >>> 16;
-    var a00 = this.low & 0xFFFF;
-
-    var b48 = multiplier.high >>> 16;
-    var b32 = multiplier.high & 0xFFFF;
-    var b16 = multiplier.low >>> 16;
-    var b00 = multiplier.low & 0xFFFF;
-
-    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-    c00 += a00 * b00;
-    c16 += c00 >>> 16;
-    c00 &= 0xFFFF;
-    c16 += a16 * b00;
-    c32 += c16 >>> 16;
-    c16 &= 0xFFFF;
-    c16 += a00 * b16;
-    c32 += c16 >>> 16;
-    c16 &= 0xFFFF;
-    c32 += a32 * b00;
-    c48 += c32 >>> 16;
-    c32 &= 0xFFFF;
-    c32 += a16 * b16;
-    c48 += c32 >>> 16;
-    c32 &= 0xFFFF;
-    c32 += a00 * b32;
-    c48 += c32 >>> 16;
-    c32 &= 0xFFFF;
-    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
-    c48 &= 0xFFFF;
-    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
-};
-
-/**
- * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.
- * @function
- * @param {!Long|number|string} multiplier Multiplier
- * @returns {!Long} Product
- */
-LongPrototype.mul = LongPrototype.multiply;
-
-/**
- * Returns this Long divided by the specified. The result is signed if this Long is signed or
- *  unsigned if this Long is unsigned.
- * @param {!Long|number|string} divisor Divisor
- * @returns {!Long} Quotient
- */
-LongPrototype.divide = function divide(divisor) {
-    if (!isLong(divisor))
-        divisor = fromValue(divisor);
-    if (divisor.isZero())
-        throw Error('division by zero');
-
-    // use wasm support if present
-    if (wasm) {
-        // guard against signed division overflow: the largest
-        // negative number / -1 would be 1 larger than the largest
-        // positive number, due to two's complement.
-        if (!this.unsigned &&
-            this.high === -0x80000000 &&
-            divisor.low === -1 && divisor.high === -1) {
-            // be consistent with non-wasm code path
-            return this;
-        }
-        var low = (this.unsigned ? wasm.div_u : wasm.div_s)(
-            this.low,
-            this.high,
-            divisor.low,
-            divisor.high
-        );
-        return fromBits(low, wasm.get_high(), this.unsigned);
-    }
-
-    if (this.isZero())
-        return this.unsigned ? UZERO : ZERO;
-    var approx, rem, res;
-    if (!this.unsigned) {
-        // This section is only relevant for signed longs and is derived from the
-        // closure library as a whole.
-        if (this.eq(MIN_VALUE)) {
-            if (divisor.eq(ONE) || divisor.eq(NEG_ONE))
-                return MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
-            else if (divisor.eq(MIN_VALUE))
-                return ONE;
-            else {
-                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
-                var halfThis = this.shr(1);
-                approx = halfThis.div(divisor).shl(1);
-                if (approx.eq(ZERO)) {
-                    return divisor.isNegative() ? ONE : NEG_ONE;
-                } else {
-                    rem = this.sub(divisor.mul(approx));
-                    res = approx.add(rem.div(divisor));
-                    return res;
-                }
-            }
-        } else if (divisor.eq(MIN_VALUE))
-            return this.unsigned ? UZERO : ZERO;
-        if (this.isNegative()) {
-            if (divisor.isNegative())
-                return this.neg().div(divisor.neg());
-            return this.neg().div(divisor).neg();
-        } else if (divisor.isNegative())
-            return this.div(divisor.neg()).neg();
-        res = ZERO;
-    } else {
-        // The algorithm below has not been made for unsigned longs. It's therefore
-        // required to take special care of the MSB prior to running it.
-        if (!divisor.unsigned)
-            divisor = divisor.toUnsigned();
-        if (divisor.gt(this))
-            return UZERO;
-        if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true
-            return UONE;
-        res = UZERO;
-    }
-
-    // Repeat the following until the remainder is less than other:  find a
-    // floating-point that approximates remainder / other *from below*, add this
-    // into the result, and subtract it from the remainder.  It is critical that
-    // the approximate value is less than or equal to the real value so that the
-    // remainder never becomes negative.
-    rem = this;
-    while (rem.gte(divisor)) {
-        // Approximate the result of division. This may be a little greater or
-        // smaller than the actual value.
-        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));
-
-        // We will tweak the approximate result by changing it in the 48-th digit or
-        // the smallest non-fractional digit, whichever is larger.
-        var log2 = Math.ceil(Math.log(approx) / Math.LN2),
-            delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),
-
-            // Decrease the approximation until it is smaller than the remainder.  Note
-            // that if it is too large, the product overflows and is negative.
-            approxRes = fromNumber(approx),
-            approxRem = approxRes.mul(divisor);
-        while (approxRem.isNegative() || approxRem.gt(rem)) {
-            approx -= delta;
-            approxRes = fromNumber(approx, this.unsigned);
-            approxRem = approxRes.mul(divisor);
-        }
-
-        // We know the answer can't be zero... and actually, zero would cause
-        // infinite recursion since we would make no progress.
-        if (approxRes.isZero())
-            approxRes = ONE;
-
-        res = res.add(approxRes);
-        rem = rem.sub(approxRem);
-    }
-    return res;
-};
-
-/**
- * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.
- * @function
- * @param {!Long|number|string} divisor Divisor
- * @returns {!Long} Quotient
- */
-LongPrototype.div = LongPrototype.divide;
-
-/**
- * Returns this Long modulo the specified.
- * @param {!Long|number|string} divisor Divisor
- * @returns {!Long} Remainder
- */
-LongPrototype.modulo = function modulo(divisor) {
-    if (!isLong(divisor))
-        divisor = fromValue(divisor);
-
-    // use wasm support if present
-    if (wasm) {
-        var low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(
-            this.low,
-            this.high,
-            divisor.low,
-            divisor.high
-        );
-        return fromBits(low, wasm.get_high(), this.unsigned);
-    }
-
-    return this.sub(this.div(divisor).mul(divisor));
-};
-
-/**
- * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.
- * @function
- * @param {!Long|number|string} divisor Divisor
- * @returns {!Long} Remainder
- */
-LongPrototype.mod = LongPrototype.modulo;
-
-/**
- * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.
- * @function
- * @param {!Long|number|string} divisor Divisor
- * @returns {!Long} Remainder
- */
-LongPrototype.rem = LongPrototype.modulo;
-
-/**
- * Returns the bitwise NOT of this Long.
- * @returns {!Long}
- */
-LongPrototype.not = function not() {
-    return fromBits(~this.low, ~this.high, this.unsigned);
-};
-
-/**
- * Returns the bitwise AND of this Long and the specified.
- * @param {!Long|number|string} other Other Long
- * @returns {!Long}
- */
-LongPrototype.and = function and(other) {
-    if (!isLong(other))
-        other = fromValue(other);
-    return fromBits(this.low & other.low, this.high & other.high, this.unsigned);
-};
-
-/**
- * Returns the bitwise OR of this Long and the specified.
- * @param {!Long|number|string} other Other Long
- * @returns {!Long}
- */
-LongPrototype.or = function or(other) {
-    if (!isLong(other))
-        other = fromValue(other);
-    return fromBits(this.low | other.low, this.high | other.high, this.unsigned);
-};
-
-/**
- * Returns the bitwise XOR of this Long and the given one.
- * @param {!Long|number|string} other Other Long
- * @returns {!Long}
- */
-LongPrototype.xor = function xor(other) {
-    if (!isLong(other))
-        other = fromValue(other);
-    return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);
-};
-
-/**
- * Returns this Long with bits shifted to the left by the given amount.
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shiftLeft = function shiftLeft(numBits) {
-    if (isLong(numBits))
-        numBits = numBits.toInt();
-    if ((numBits &= 63) === 0)
-        return this;
-    else if (numBits < 32)
-        return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);
-    else
-        return fromBits(0, this.low << (numBits - 32), this.unsigned);
-};
-
-/**
- * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.
- * @function
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shl = LongPrototype.shiftLeft;
-
-/**
- * Returns this Long with bits arithmetically shifted to the right by the given amount.
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shiftRight = function shiftRight(numBits) {
-    if (isLong(numBits))
-        numBits = numBits.toInt();
-    if ((numBits &= 63) === 0)
-        return this;
-    else if (numBits < 32)
-        return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);
-    else
-        return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);
-};
-
-/**
- * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.
- * @function
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shr = LongPrototype.shiftRight;
-
-/**
- * Returns this Long with bits logically shifted to the right by the given amount.
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {
-    if (isLong(numBits))
-        numBits = numBits.toInt();
-    numBits &= 63;
-    if (numBits === 0)
-        return this;
-    else {
-        var high = this.high;
-        if (numBits < 32) {
-            var low = this.low;
-            return fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, this.unsigned);
-        } else if (numBits === 32)
-            return fromBits(high, 0, this.unsigned);
-        else
-            return fromBits(high >>> (numBits - 32), 0, this.unsigned);
-    }
-};
-
-/**
- * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.
- * @function
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shru = LongPrototype.shiftRightUnsigned;
-
-/**
- * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.
- * @function
- * @param {number|!Long} numBits Number of bits
- * @returns {!Long} Shifted Long
- */
-LongPrototype.shr_u = LongPrototype.shiftRightUnsigned;
-
-/**
- * Converts this Long to signed.
- * @returns {!Long} Signed long
- */
-LongPrototype.toSigned = function toSigned() {
-    if (!this.unsigned)
-        return this;
-    return fromBits(this.low, this.high, false);
-};
-
-/**
- * Converts this Long to unsigned.
- * @returns {!Long} Unsigned long
- */
-LongPrototype.toUnsigned = function toUnsigned() {
-    if (this.unsigned)
-        return this;
-    return fromBits(this.low, this.high, true);
-};
-
-/**
- * Converts this Long to its byte representation.
- * @param {boolean=} le Whether little or big endian, defaults to big endian
- * @returns {!Array.<number>} Byte representation
- */
-LongPrototype.toBytes = function toBytes(le) {
-    return le ? this.toBytesLE() : this.toBytesBE();
-};
-
-/**
- * Converts this Long to its little endian byte representation.
- * @returns {!Array.<number>} Little endian byte representation
- */
-LongPrototype.toBytesLE = function toBytesLE() {
-    var hi = this.high,
-        lo = this.low;
-    return [
-        lo & 0xff,
-        lo >>> 8 & 0xff,
-        lo >>> 16 & 0xff,
-        lo >>> 24,
-        hi & 0xff,
-        hi >>> 8 & 0xff,
-        hi >>> 16 & 0xff,
-        hi >>> 24
-    ];
-};
-
-/**
- * Converts this Long to its big endian byte representation.
- * @returns {!Array.<number>} Big endian byte representation
- */
-LongPrototype.toBytesBE = function toBytesBE() {
-    var hi = this.high,
-        lo = this.low;
-    return [
-        hi >>> 24,
-        hi >>> 16 & 0xff,
-        hi >>> 8 & 0xff,
-        hi & 0xff,
-        lo >>> 24,
-        lo >>> 16 & 0xff,
-        lo >>> 8 & 0xff,
-        lo & 0xff
-    ];
-};
-
-/**
- * Creates a Long from its byte representation.
- * @param {!Array.<number>} bytes Byte representation
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @param {boolean=} le Whether little or big endian, defaults to big endian
- * @returns {Long} The corresponding Long value
- */
-Long.fromBytes = function fromBytes(bytes, unsigned, le) {
-    return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);
-};
-
-/**
- * Creates a Long from its little endian byte representation.
- * @param {!Array.<number>} bytes Little endian byte representation
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @returns {Long} The corresponding Long value
- */
-Long.fromBytesLE = function fromBytesLE(bytes, unsigned) {
-    return new Long(
-        bytes[0] |
-        bytes[1] << 8 |
-        bytes[2] << 16 |
-        bytes[3] << 24,
-        bytes[4] |
-        bytes[5] << 8 |
-        bytes[6] << 16 |
-        bytes[7] << 24,
-        unsigned
-    );
-};
-
-/**
- * Creates a Long from its big endian byte representation.
- * @param {!Array.<number>} bytes Big endian byte representation
- * @param {boolean=} unsigned Whether unsigned or not, defaults to signed
- * @returns {Long} The corresponding Long value
- */
-Long.fromBytesBE = function fromBytesBE(bytes, unsigned) {
-    return new Long(
-        bytes[4] << 24 |
-        bytes[5] << 16 |
-        bytes[6] << 8 |
-        bytes[7],
-        bytes[0] << 24 |
-        bytes[1] << 16 |
-        bytes[2] << 8 |
-        bytes[3],
-        unsigned
-    );
-};
diff --git a/test.md b/test.md
new file mode 100644
index 00000000..af23b88b
--- /dev/null
+++ b/test.md
@@ -0,0 +1,6 @@
+A级电报  04/06 21:40
+💥【白糖现货价格创五年来新高 业内预计短期易涨难跌】
+
+受国内连续两年减产、加工糖利润倒挂，印度减产落地，以及国内消费恢复预期强劲等因素推动，近期国内白糖现货价格持续走高，基准价直逼6500元/吨，创近五年新高。财联社记者近日多方采访获悉，短期看，白糖价格在巴西尚未开榨前将继续维持高位，缺乏明显利空因素或将易涨难跌。长远来看，现货价格则可能呈现近强远弱，但未来走弱幅度要看消费恢复情况。有业内人士表示，在目前糖价持续高位之下，叠加二季度消费恢复预期较强，行业盈利或会有较大改善。（财联社记者 刘建 王平安）
+
+💧热词：期货市场情报  白糖