@helios-lang/effect 0.1.15 → 0.3.0

package/dist/Crypto/EdDSA.js

@@ -0,0 +1,222 @@
+import { Data, Either } from "effect";
+import { CurveHelper } from "./Curve.js";
+import * as Sha2_512 from "./Sha2_512.js";
+export class BadPrivateKeyLength extends Data.TaggedError("Crypto.EdDSA.BadPrivateKeyLength") {
+    constructor(privateKey) {
+        super({
+            message: `expected extended privateKey with a length of 64 bytes, this privateKey is ${privateKey.length} bytes long (hint: pass hashPrivateKey = true)`
+        });
+    }
+}
+export class BadSignatureLength extends Data.TaggedError("Crypto.EdDSA.BadSignatureLength") {
+    constructor(signature) {
+        super({ message: `unexpected signature length ${signature.length}` });
+    }
+}
+export class BadPublicKeyLength extends Data.TaggedError("Crypto.EdDSA.BadPublicKeyLength") {
+    constructor(publicKey) {
+        super({ message: `unexpected publicKey length ${publicKey.length}` });
+    }
+}
+/**
+ *  Edwards Digital Signing Algorithm
+ *
+ * Symbols based on the book "Elliptic Curves in Cryptography" by I.F. Blake, G. Seroussi and N.P. Smart
+ * See page 4 for an overview of the DSA algorithm.
+ * This book along with the first few sections of "Cryptography: An Introduction" by N.P. Smart are
+ *   recommended reads in order to understand better the concepts of "scalars" and "CurvePoint" and
+ *   their arithmatic over finite fields.
+ *
+ * Notation:
+ *   privateKey: 64 bytes, first 32 bytes form the scalar integer `x`, the latter bytes are used for private nonce generation
+ *   publicKey: 32 bytes
+ *   x: bigint scalar representation of privateKey
+ *   g: generator BASE point
+ *   h: CurvePoint representation of publicKey
+ *   m: (hashed) message, kept as bytes
+ *   k: a practically random number, created by applying a one-way function to the message and part of the private key
+ *   a: first part of signature
+ *   b: second part of signature
+ *   `*`: group multiplication of a CurvePoint by a scalar integer, or multiplication of 2 scalars (depending on context)
+ *   `+`: CurvePoint addition or scalar addition depending on context
+ *   `.`: byte concatenation
+ *   `[n:N]`: slice bytes
+ *   `f(a,h,m)`: a one-way function for publicy known information
+ *   `mod()`: take modulo of a scalar wrt. the order of the Curve
+ *   `hash()`: Sha512 hash function
+ *   `encodeScalar`: turn a scalar integer into bytes
+ *   `decodeScalar`: turn bytes into a scalar integer
+ *   `encodePoint`: turn a CurvePoint into bytes
+ *   `decodePoint`: turn bytes into a CurvePoint
+ *
+ * The algorithm below is approached from an additive perspective.
+ *
+ * 1. Generate 64 random private key bytes
+ *      privateKey = random(64)
+ * 2. Generate the associated scalar `x`:
+ *      x = decodeScalar(privateKey[0:32])
+ * 3. Generate public key CurvePoint:
+ *      h = g*x
+ * 4. Encode public key:
+ *      publicKey = encodePoint(h)
+ * 5. Create first part of a signature:
+ *      k = decodeScalar(hash(privateKey[32:64] . m))
+ *      a = g*k
+ *      signature[0:32] = encodePoint(a)
+ * 6. Create second part of a signature:
+ *      f(a,h,m) = decodeScalar(hash(signature[0:32] . publicKey . m))
+ *      b = mod(k + f(a,h,m)*x)
+ *      signature[32:64] = encodeScalar(b)
+ * 7. Verify a signature:
+ *      a = decodePoint(signature[0:32])
+ *      b = decodeScalar(signature[32:64])
+ *      h = decodePoint(publicKey)
+ *      f(a,h,m) = decodeScalar(hash(signature[0:32] . publicKey . m))
+ *      g*b === a + h*f(a,h,m)
+ *
+ * We can show that this works by substituting the private calculations done upon signing (the arithmatic takes care of the mod() operator):
+ *      g*(k + f(a,h,m)*x) === g*k + h*f(a,h,m)
+ *      g*k + g*x*f(a,h,m) === g*k + h*f(a,h,m)
+ *
+ * We know that `g*x == h`, QED.
+ *
+ * The arithmatic details are handled by the CurvePoint class
+ */
+export class EdDSA {
+    curve;
+    G;
+    Z;
+    codec;
+    /**
+     * @param curve
+     */
+    constructor(curve, G, Z, pointCodec) {
+        this.curve = curve;
+        this.G = G;
+        this.Z = Z;
+        this.codec = pointCodec;
+    }
+    /**
+     * Combination hash and decodeCurveInt
+     * @param bytes
+     * @returns
+     */
+    oneWay(...chunks) {
+        const l = chunks.reduce((prev, chunk) => chunk.length + prev, 0);
+        const bytes = new Uint8Array(l);
+        let offset = 0;
+        chunks.forEach((chunk) => {
+            bytes.set(chunk, offset);
+            offset += chunk.length;
+        });
+        return Either.getOrThrow(this.codec.decodeScalar(Sha2_512.hashSync(bytes)));
+    }
+    /**
+     * @param privateKeyBytes
+     * @param hashPrivateKey
+     * Defaults to true, set to false
+     * when used in Bip32 algorithm
+     * @returns 32 byte public key.
+     */
+    derivePublicKey(privateKeyBytes, hashPrivateKey = true) {
+        if (hashPrivateKey) {
+            privateKeyBytes = Sha2_512.hashSync(privateKeyBytes);
+        }
+        else {
+            if (privateKeyBytes.length != 64) {
+                return Either.left(new BadPrivateKeyLength(privateKeyBytes));
+            }
+        }
+        // we know that `privateKeyBytes` isn't empty, so `decodePrivateKey()` should never throw an error
+        const privateKey = Either.getOrThrow(this.codec.decodePrivateKey(privateKeyBytes));
+        const curveHelper = new CurveHelper(this.curve);
+        const publicKey = curveHelper.scale(this.curve.fromAffine(this.G), privateKey);
+        const publicKeyBytes = this.codec.encodePoint(this.curve.toAffine(publicKey));
+        return Either.right(publicKeyBytes);
+    }
+    /**
+     * Sign the message.
+     * Even though this implementation isn't constant time, it isn't vulnerable to a timing attack (see detailed notes in implementation below)
+     * @param message
+     * @param privateKeyBytes
+     * @param hashPrivateKey
+     * Defaults to true, Bip32 passes this as false
+     * @returns
+     * 64 byte signature.
+     */
+    sign(message, privateKeyBytes, hashPrivateKey = true) {
+        if (hashPrivateKey) {
+            privateKeyBytes = Sha2_512.hashSync(privateKeyBytes);
+        }
+        else {
+            if (privateKeyBytes.length != 64) {
+                return Either.left(new BadPrivateKeyLength(privateKeyBytes));
+            }
+        }
+        // Extract privateKey as integer
+        //   (Not vulnerable to timing attack because there is no mixing with the message,
+        //      so always takes the same amount of time for the same privateKey)
+        const privateKey = Either.getOrThrow(this.codec.decodePrivateKey(privateKeyBytes));
+        const curveHelper = new CurveHelper(this.curve);
+        // For convenience calculate publicKey here
+        //   (Not vulnerable to timing attack because there is no mixing with the message,
+        //      so always takes the same amount of time for the same privateKey)
+        const publicKey = curveHelper.scale(this.curve.fromAffine(this.G), privateKey);
+        const publicKeyBytes = this.codec.encodePoint(this.curve.toAffine(publicKey));
+        // Generate a practically random number
+        //   (Not vulnerable to timing attack because sha2_512 runtime only depends on message length,
+        //     so timing doesn't expose any bytes of the privateKey)
+        const k = this.oneWay(privateKeyBytes.slice(32, 64), message);
+        // First part of the signature
+        //   (Not vulnerable to timing attack because variations in the message create huge random variations in k)
+        const a = curveHelper.scale(this.curve.fromAffine(this.G), k);
+        const aEncoded = this.codec.encodePoint(this.curve.toAffine(a));
+        // Second part of the signature
+        //   (Not vulnerable to timing attack.
+        //      Even though f is known publicly and changes with each message,
+        //      and the f * x operation isn't constant time (bigint ops in JS aren't constant time),
+        //      k also changes with each message, and the [k]BASE operation above
+        //      is much more expensive than multiplying two big ints)
+        const f = this.oneWay(aEncoded, publicKeyBytes, message);
+        const b = this.Z.add(k, f * privateKey);
+        const bEncoded = this.codec.encodeScalar(b);
+        return Either.right(new Uint8Array(Array.from(aEncoded).concat(Array.from(bEncoded))));
+    }
+    /**
+     * Returns `true` if the signature is correct.
+     * Returns `false`:
+     *   * if the signature is incorrect
+     *   * if the signature doesn't lie on the curve,
+     *   * if the publicKey doesn't lie on the curve
+     * Throw an error:
+     *   * signature isn't 64 bytes long
+     *   * publickey isn't 32 bytes long (asserted inside `decodePoint()`)
+     * @param signature
+     * @param message
+     * @param publicKey
+     * @returns
+     */
+    verify(signature, message, publicKey) {
+        if (signature.length != 64) {
+            return Either.left(new BadSignatureLength(signature));
+        }
+        const a = this.curve.fromAffine(Either.getOrThrow(this.codec.decodePoint(signature.slice(0, 32))));
+        if (!this.curve.isValidPoint(a)) {
+            return Either.right(false);
+        }
+        const b = Either.getOrThrow(this.codec.decodeScalar(signature.slice(32, 64)));
+        if (publicKey.length != 32) {
+            return Either.left(new BadPublicKeyLength(publicKey));
+        }
+        const h = this.curve.fromAffine(Either.getOrThrow(this.codec.decodePoint(publicKey)));
+        if (!this.curve.isValidPoint(h)) {
+            return Either.right(false);
+        }
+        const f = this.oneWay(signature.slice(0, 32), publicKey, message);
+        const curveHelper = new CurveHelper(this.curve);
+        const left = curveHelper.scale(this.curve.fromAffine(this.G), b);
+        const right = this.curve.add(a, curveHelper.scale(h, f));
+        return Either.right(this.curve.equals(left, right));
+    }
+}
+//# sourceMappingURL=EdDSA.js.map

package/dist/Crypto/EdDSA.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EdDSA.js","sourceRoot":"","sources":["../../src/Crypto/EdDSA.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,EAAY,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAc,WAAW,EAAgB,MAAM,YAAY,CAAA;AAClE,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAGzC,MAAM,OAAO,mBAAoB,SAAQ,IAAI,CAAC,WAAW,CACvD,kCAAkC,CAGlC;IACA,YAAY,UAAsB;QAChC,KAAK,CAAC;YACJ,OAAO,EAAE,8EAA8E,UAAU,CAAC,MAAM,gDAAgD;SACzJ,CAAC,CAAA;IACJ,CAAC;CACF;AAED,MAAM,OAAO,kBAAmB,SAAQ,IAAI,CAAC,WAAW,CACtD,iCAAiC,CAGjC;IACA,YAAY,SAAqB;QAC/B,KAAK,CAAC,EAAE,OAAO,EAAE,+BAA+B,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;IACvE,CAAC;CACF;AAED,MAAM,OAAO,kBAAmB,SAAQ,IAAI,CAAC,WAAW,CACtD,iCAAiC,CAGjC;IACA,YAAY,SAAqB;QAC/B,KAAK,CAAC,EAAE,OAAO,EAAE,+BAA+B,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;IACvE,CAAC;CACF;AAmBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AACH,MAAM,OAAO,KAAK;IACP,KAAK,CAAkB;IACvB,CAAC,CAA0B;IAC3B,CAAC,CAAe;IAChB,KAAK,CAAO;IAErB;;OAEG;IACH,YACE,KAAuB,EACvB,CAA2B,EAC3B,CAAgB,EAChB,UAAiB;QAEjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,KAAK,GAAG,UAAU,CAAA;IACzB,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,GAAG,MAAoB;QACpC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,CAAA;QAEhE,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;QAE/B,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YACvB,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;YACxB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAA;QACxB,CAAC,CAAC,CAAA;QAEF,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAC7E,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CACb,eAA2B,EAC3B,iBAA0B,IAAI;QAE9B,IAAI,cAAc,EAAE,CAAC;YACnB,eAAe,GAAG,QAAQ,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAA;QACtD,CAAC;aAAM,CAAC;YACN,IAAI,eAAe,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;gBACjC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,eAAe,CAAC,CAAC,CAAA;YAC9D,CAAC;QACH,CAAC;QAED,kGAAkG;QAClG,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAClC,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAC7C,CAAA;QAED,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAE/C,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CACjC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAC7B,UAAU,CACX,CAAA;QACD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAC3C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAC/B,CAAA;QAED,OAAO,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,CAAA;IACrC,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,CACF,OAAmB,EACnB,eAA2B,EAC3B,iBAA0B,IAAI;QAE9B,IAAI,cAAc,EAAE,CAAC;YACnB,eAAe,GAAG,QAAQ,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAA;QACtD,CAAC;aAAM,CAAC;YACN,IAAI,eAAe,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;gBACjC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,eAAe,CAAC,CAAC,CAAA;YAC9D,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,kFAAkF;QAClF,wEAAwE;QACxE,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAClC,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAC7C,CAAA;QAED,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAE/C,2CAA2C;QAC3C,kFAAkF;QAClF,wEAAwE;QACxE,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CACjC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAC7B,UAAU,CACX,CAAA;QACD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAC3C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAC/B,CAAA;QAED,uCAAuC;QACvC,8FAA8F;QAC9F,4DAA4D;QAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,CAAA;QAE7D,8BAA8B;QAC9B,2GAA2G;QAC3G,MAAM,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;QAE/D,+BAA+B;QAC/B,sCAAsC;QACtC,sEAAsE;QACtE,4FAA4F;QAC5F,yEAAyE;QACzE,6DAA6D;QAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;QACxD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAA;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAE3C,OAAO,MAAM,CAAC,KAAK,CACjB,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAClE,CAAA;IACH,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CACJ,SAAqB,EACrB,OAAmB,EACnB,SAAqB;QAErB,IAAI,SAAS,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YAC3B,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAA;QACvD,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAC7B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAClE,CAAA;QAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC5B,CAAC;QAED,MAAM,CAAC,GAAG,MAAM,CAAC,UAAU,CACzB,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CACjD,CAAA;QAED,IAAI,SAAS,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YAC3B,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAA;QACvD,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAC7B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CACrD,CAAA;QAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC5B,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAA;QAEjE,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAE/C,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAExD,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;IACrD,CAAC;CACF"}

package/dist/Crypto/Field.js

@@ -0,0 +1,323 @@
+/**
+ * Positive modulo operator
+ * @param x
+ * @param modulo
+ * @returns
+ */
+export function mod(x, modulo) {
+    const res = x % modulo;
+    if (res < 0n) {
+        return res + modulo;
+    }
+    else {
+        return res;
+    }
+}
+export class ScalarField {
+    /**
+     * Every operation is modulo this number
+     */
+    modulo;
+    constructor(modulo) {
+        this.modulo = modulo;
+    }
+    get ZERO() {
+        return 0n;
+    }
+    get ONE() {
+        return 1n;
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    add(a, ...b) {
+        return mod(b.reduce((sum, b) => sum + b, a), this.modulo);
+    }
+    /**
+     * @param a
+     * @param n
+     * @returns
+     */
+    scale(a, n) {
+        return mod(a * n, this.modulo);
+    }
+    /**
+     * Implemented separately from `scale` because it has a different meaning
+     * @param a
+     * @param b
+     * @returns
+     */
+    multiply(a, b) {
+        return mod(a * b, this.modulo);
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    equals(a, b) {
+        return mod(a, this.modulo) === mod(b, this.modulo);
+    }
+    /**
+     * Invert a number on a field (i.e. calculate n^-1 so that n*n^-1 = 1)
+     * This is an expensive iterative procedure that is only guaranteed to converge if the modulo is a prime number
+     * @param n
+     * @returns
+     */
+    invert(n) {
+        let a = mod(n, this.modulo);
+        let b = this.modulo;
+        let x = 0n;
+        let y = 1n;
+        let u = 1n;
+        let v = 0n;
+        while (a !== 0n) {
+            const q = b / a;
+            const r = b % a;
+            const m = x - u * q;
+            const n = y - v * q;
+            b = a;
+            a = r;
+            x = u;
+            y = v;
+            u = m;
+            v = n;
+        }
+        return mod(x, this.modulo);
+    }
+}
+/**
+ * Defines additional operations on a field (which use the basic operations as building blocks)
+ *   * isZero(a)
+ *   * isOne(a)
+ *   * mod(a)
+ *   * subtract(a, b)
+ *   * negate(a)
+ *   * square(a)
+ *   * cube(a)
+ *   * divide(a, b)
+ *   * pow(a, p)
+ *   * halve(a)
+ */
+export class FieldHelper {
+    F;
+    /**
+     * @param F
+     */
+    constructor(F) {
+        this.F = F;
+    }
+    get ZERO() {
+        return this.F.ZERO;
+    }
+    get ONE() {
+        return this.F.ONE;
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    isZero(a) {
+        return this.equals(a, this.ZERO);
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    isOne(a) {
+        return this.equals(a, this.ONE);
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    mod(a) {
+        return this.F.scale(a, 1n);
+    }
+    /**
+     * @param a
+     * @param bs
+     * @returns
+     */
+    add(a, ...bs) {
+        return this.F.add(a, ...bs);
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    subtract(a, b) {
+        const F = this.F;
+        return F.add(a, F.scale(b, -1n));
+    }
+    /**
+     * @param a
+     * @param s
+     * @returns
+     */
+    scale(a, s) {
+        return this.F.scale(a, s);
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    negate(a) {
+        return this.F.scale(a, -1n);
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    multiply(a, b) {
+        return this.F.multiply(a, b);
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    square(a) {
+        return this.F.multiply(a, a);
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    cube(a) {
+        return this.F.multiply(a, this.F.multiply(a, a));
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    divide(a, b) {
+        return this.F.multiply(a, this.F.invert(b));
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    invert(a) {
+        return this.F.invert(a);
+    }
+    /**
+     * Modular exponent
+     * TODO: would a non-recursive version of this algorithm be faster?
+     * @param a
+     * @param p
+     * @returns
+     */
+    pow(a, p) {
+        if (p == 0n) {
+            return this.F.ONE;
+        }
+        else if (p == 1n) {
+            return a;
+        }
+        else {
+            let t = this.pow(a, p / 2n);
+            t = this.F.multiply(t, t);
+            if (p % 2n != 0n) {
+                t = this.F.multiply(t, a);
+            }
+            return t;
+        }
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    equals(a, b) {
+        return this.F.equals(a, b);
+    }
+    /**
+     * @param a
+     * @returns
+     */
+    halve(a) {
+        return this.divide(a, this.F.scale(this.F.ONE, 2n));
+    }
+}
+export class QuadraticField {
+    /**
+     * Field used for each component
+     */
+    F;
+    /**
+     * We can always replace u^2 by this number (e.g. for complex numbers this is -1)
+     */
+    U2;
+    /**
+     * @param F
+     * Applied to each part separately
+     * @param U2
+     */
+    constructor(F, U2) {
+        this.F = F;
+        this.U2 = U2;
+    }
+    get ZERO() {
+        return [this.F.ZERO, this.F.ZERO];
+    }
+    get ONE() {
+        return [this.F.ONE, this.F.ZERO];
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    add([ax, ay], ...b) {
+        const F = this.F;
+        return [F.add(ax, ...b.map((b) => b[0])), F.add(ay, ...b.map((b) => b[1]))];
+    }
+    /**
+     * @param a
+     * @param s
+     * @returns
+     */
+    scale([ax, ay], s) {
+        const F = this.F;
+        return [F.scale(ax, s), F.scale(ay, s)];
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    multiply([ax, ay], [bx, by]) {
+        const F = this.F;
+        return [
+            F.add(F.multiply(ax, bx), F.multiply(F.multiply(ay, by), this.U2)),
+            F.add(F.multiply(ay, bx), F.multiply(by, ax))
+        ];
+    }
+    /**
+     * @param a
+     * @param b
+     * @returns
+     */
+    equals([ax, ay], [bx, by]) {
+        const F = this.F;
+        return F.equals(ax, bx) && F.equals(ay, by);
+    }
+    /**
+     * Using the following formula we can derive the inverse of complex field element
+     *   (ax + u*ay)*(ax - u*ay) = ax^2 - u^2*ay^2
+     *   (ax + u*ay)^-1 = (ax - u*ay)/(ax^2 - u^2*ay^2)
+     * @param a
+     * @returns
+     */
+    invert([ax, ay]) {
+        const F = new FieldHelper(this.F);
+        const f = F.invert(F.subtract(F.square(ax), F.multiply(F.square(ay), this.U2)));
+        return [F.multiply(ax, f), F.multiply(ay, F.negate(f))];
+    }
+}
+//# sourceMappingURL=Field.js.map

package/dist/Crypto/Field.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Field.js","sourceRoot":"","sources":["../../src/Crypto/Field.ts"],"names":[],"mappings":"AASA;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,MAAc;IAC3C,MAAM,GAAG,GAAG,CAAC,GAAG,MAAM,CAAA;IAEtB,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;QACb,OAAO,GAAG,GAAG,MAAM,CAAA;IACrB,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,CAAA;IACZ,CAAC;AACH,CAAC;AAmCD,MAAM,OAAO,WAAW;IACtB;;OAEG;IACM,MAAM,CAAQ;IAEvB,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACtB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,EAAE,CAAA;IACX,CAAC;IAED,IAAI,GAAG;QACL,OAAO,EAAE,CAAA;IACX,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,CAAS,EAAE,GAAG,CAAW;QAC3B,OAAO,GAAG,CACR,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,EAChC,IAAI,CAAC,MAAM,CACZ,CAAA;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IAChC,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,CAAS,EAAE,CAAS;QAC3B,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IAChC,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,CAAS,EAAE,CAAS;QACzB,OAAO,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IACpD,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,CAAS;QACd,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;QAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;QAEnB,IAAI,CAAC,GAAG,EAAE,CAAA;QACV,IAAI,CAAC,GAAG,EAAE,CAAA;QACV,IAAI,CAAC,GAAG,EAAE,CAAA;QACV,IAAI,CAAC,GAAG,EAAE,CAAA;QAEV,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACf,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACf,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACnB,CAAC,GAAG,CAAC,CAAA;YACL,CAAC,GAAG,CAAC,CAAA;YACL,CAAC,GAAG,CAAC,CAAA;YACL,CAAC,GAAG,CAAC,CAAA;YACL,CAAC,GAAG,CAAC,CAAA;YACL,CAAC,GAAG,CAAC,CAAA;QACP,CAAC;QAED,OAAO,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IAC5B,CAAC;CACF;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,WAAW;IACb,CAAC,CAAU;IAEpB;;OAEG;IACH,YAAY,CAAW;QACrB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;IACZ,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;IACpB,CAAC;IAED,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAA;IACnB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,CAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IAClC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,CAAI;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAA;IACjC,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,CAAI;QACN,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IAC5B,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,CAAI,EAAE,GAAG,EAAO;QAClB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA;IAC7B,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,CAAI,EAAE,CAAI;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAChB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAClC,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,CAAI,EAAE,CAAS;QACnB,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,CAAI;QACT,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7B,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,CAAI,EAAE,CAAI;QACjB,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC9B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,CAAI;QACT,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC9B,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,CAAI;QACP,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAClD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,CAAI,EAAE,CAAI;QACf,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7C,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,CAAI;QACT,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;IACzB,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,CAAI,EAAE,CAAS;QACjB,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAA;QACnB,CAAC;aAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,OAAO,CAAC,CAAA;QACV,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAA;YAC3B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAEzB,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;gBACjB,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC3B,CAAC;YAED,OAAO,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,CAAI,EAAE,CAAI;QACf,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC5B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,CAAI;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;IACrD,CAAC;CACF;AAED,MAAM,OAAO,cAAc;IACzB;;OAEG;IACM,CAAC,CAAU;IAEpB;;OAEG;IACM,EAAE,CAAG;IAEd;;;;OAIG;IACH,YAAY,CAAW,EAAE,EAAK;QAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;IACd,CAAC;IAED,IAAI,IAAI;QACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACnC,CAAC;IAED,IAAI,GAAG;QACL,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAClC,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAS,EAAE,GAAG,CAAW;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAChB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7E,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAS,EAAE,CAAS;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAChB,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,CAAS,EAAE,CAAC,EAAE,EAAE,EAAE,CAAS;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAEhB,OAAO;YACL,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAClE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SAC9C,CAAA;IACH,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAS,EAAE,CAAC,EAAE,EAAE,EAAE,CAAS;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAEhB,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IAC7C,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAS;QACrB,MAAM,CAAC,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAChB,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAC5D,CAAA;QAED,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACzD,CAAC;CACF"}

package/dist/Crypto/Hmac.js

@@ -0,0 +1,51 @@
+import * as Bytes from "../Codecs/Bytes.js";
+import * as Sha2_256 from "./Sha2_256.js";
+import * as Sha2_512 from "./Sha2_512.js";
+/**
+ * Hmac using sha2-256.
+ * @example
+ * bytesToHex(hmacSha2_256(textToBytes("key"), textToBytes("The quick brown fox jumps over the lazy dog"))) == "f7bc83f430538424b13298e6aa6fb143ef4d59a14946175997479dbc2d1a3cd8"
+ * @param key
+ * @param message
+ * @returns
+ */
+export function sha2_256Sync(key, message) {
+    return deriveSyncInternal(Sha2_256.hashSync, 64)(Bytes.toUint8Array(key), Bytes.toUint8Array(message));
+}
+/**
+ * Hmac using sha2-512.
+ * @example
+ * bytesToHex(hmacSha2_512(textToBytes("key"), textToBytes("The quick brown fox jumps over the lazy dog"))) == "b42af09057bac1e2d41708e48a902e09b5ff7f12ab428a4fe86653c73dd248fb82f948a549f7b791a5b41915ee4d1ec3935357e4e2317250d0372afa2ebeeb3a"
+ * @param key
+ * @param message
+ * @returns
+ */
+export function sha2_512Sync(key, message) {
+    return deriveSyncInternal(Sha2_512.hashSync, 128)(Bytes.toUint8Array(key), Bytes.toUint8Array(message));
+}
+/**
+ * Don't use this directly, use hmacSyncSha2_256 or hmacSyncSha2_512 instead
+ * @param algorithm
+ * sync hashing function
+ * @param b
+ * blockSize of algorithm
+ * @returns
+ */
+const deriveSyncInternal = (algorithm, blockSize) => (key, message) => {
+    if (key.length > blockSize) {
+        key = algorithm(key);
+    }
+    else {
+        key = key.slice();
+    }
+    while (key.length < blockSize) {
+        const tmp = new Uint8Array(key.length + 1);
+        tmp.set(key);
+        tmp[key.length] = 0x00;
+        key = tmp;
+    }
+    const iPadded = key.map((k) => k ^ 0x36);
+    const oPadded = key.map((k) => k ^ 0x5c);
+    return algorithm(Bytes.concat(oPadded, algorithm(Bytes.concat(iPadded, message))));
+};
+//# sourceMappingURL=Hmac.js.map

package/dist/Crypto/Hmac.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Hmac.js","sourceRoot":"","sources":["../../src/Crypto/Hmac.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,oBAAoB,CAAA;AAC3C,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAEzC;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAoB,EACpB,OAAwB;IAExB,OAAO,kBAAkB,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAC9C,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,EACvB,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAC5B,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAoB,EACpB,OAAwB;IAExB,OAAO,kBAAkB,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,CAC/C,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,EACvB,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAC5B,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,kBAAkB,GACtB,CAAC,SAAwC,EAAE,SAAiB,EAAE,EAAE,CAChE,CAAC,GAAe,EAAE,OAAmB,EAAc,EAAE;IACnD,IAAI,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QAC3B,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAA;IACtB,CAAC;SAAM,CAAC;QACN,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,CAAA;IACnB,CAAC;IAED,OAAO,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC1C,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACZ,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAA;QACtB,GAAG,GAAG,GAAG,CAAA;IACX,CAAC;IAED,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;IACxC,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;IAExC,OAAO,SAAS,CACd,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CACjE,CAAA;AACH,CAAC,CAAA"}