@haneullabs/seal 0.1.0 → 1.1.1

package/dist/shamir.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"shamir.mjs","names":[],"sources":["../src/shamir.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { allEqual, hasDuplicates } from './utils.js';\n\nconst GF256_SIZE = 256;\n\n/**\n * A field element in the Rijndael finite field GF(2⁸) with a fixed generator g = 0x03.\n */\nexport class GF256 {\n\tvalue: number;\n\n\tconstructor(value: number) {\n\t\tif (value < 0 || value >= GF256_SIZE) {\n\t\t\tthrow new Error(`Invalid value ${value} for GF256`);\n\t\t}\n\t\tthis.value = value;\n\t}\n\n\tlog(): number {\n\t\tif (this.value === 0) {\n\t\t\tthrow new Error('Invalid value');\n\t\t}\n\t\treturn LOG[this.value - 1];\n\t}\n\n\tstatic exp(x: number): GF256 {\n\t\treturn new GF256(EXP[x % (GF256_SIZE - 1)]);\n\t}\n\n\tadd(other: GF256): GF256 {\n\t\treturn new GF256(this.value ^ other.value);\n\t}\n\n\tsub(other: GF256): GF256 {\n\t\t// Addition is the same as subtraction in a binary field.\n\t\treturn this.add(other);\n\t}\n\n\tneg(): GF256 {\n\t\t// Negation doesn't change the value in a binary field.\n\t\treturn this;\n\t}\n\n\tmul(other: GF256): GF256 {\n\t\tif (this.value === 0 || other.value === 0) {\n\t\t\treturn new GF256(0);\n\t\t}\n\t\treturn GF256.exp(this.log() + other.log());\n\t}\n\n\tdiv(other: GF256): GF256 {\n\t\treturn this.mul(GF256.exp(GF256_SIZE - other.log() - 1));\n\t}\n\n\tequals(other: GF256): boolean {\n\t\treturn this.value === other.value;\n\t}\n\n\tstatic zero(): GF256 {\n\t\treturn new GF256(0);\n\t}\n\n\tstatic one(): GF256 {\n\t\treturn new GF256(1);\n\t}\n}\n\n/// Table of Eᵢ = gⁱ where g = 0x03 generates the multiplicative group of the field.\nconst EXP: number[] = [\n\t0x01, 0x03, 0x05, 0x0f, 0x11, 0x33, 0x55, 0xff, 0x1a, 0x2e, 0x72, 0x96, 0xa1, 0xf8, 0x13, 0x35,\n\t0x5f, 0xe1, 0x38, 0x48, 0xd8, 0x73, 0x95, 0xa4, 0xf7, 0x02, 0x06, 0x0a, 0x1e, 0x22, 0x66, 0xaa,\n\t0xe5, 0x34, 0x5c, 0xe4, 0x37, 0x59, 0xeb, 0x26, 0x6a, 0xbe, 0xd9, 0x70, 0x90, 0xab, 0xe6, 0x31,\n\t0x53, 0xf5, 0x04, 0x0c, 0x14, 0x3c, 0x44, 0xcc, 0x4f, 0xd1, 0x68, 0xb8, 0xd3, 0x6e, 0xb2, 0xcd,\n\t0x4c, 0xd4, 0x67, 0xa9, 0xe0, 0x3b, 0x4d, 0xd7, 0x62, 0xa6, 0xf1, 0x08, 0x18, 0x28, 0x78, 0x88,\n\t0x83, 0x9e, 0xb9, 0xd0, 0x6b, 0xbd, 0xdc, 0x7f, 0x81, 0x98, 0xb3, 0xce, 0x49, 0xdb, 0x76, 0x9a,\n\t0xb5, 0xc4, 0x57, 0xf9, 0x10, 0x30, 0x50, 0xf0, 0x0b, 0x1d, 0x27, 0x69, 0xbb, 0xd6, 0x61, 0xa3,\n\t0xfe, 0x19, 0x2b, 0x7d, 0x87, 0x92, 0xad, 0xec, 0x2f, 0x71, 0x93, 0xae, 0xe9, 0x20, 0x60, 0xa0,\n\t0xfb, 0x16, 0x3a, 0x4e, 0xd2, 0x6d, 0xb7, 0xc2, 0x5d, 0xe7, 0x32, 0x56, 0xfa, 0x15, 0x3f, 0x41,\n\t0xc3, 0x5e, 0xe2, 0x3d, 0x47, 0xc9, 0x40, 0xc0, 0x5b, 0xed, 0x2c, 0x74, 0x9c, 0xbf, 0xda, 0x75,\n\t0x9f, 0xba, 0xd5, 0x64, 0xac, 0xef, 0x2a, 0x7e, 0x82, 0x9d, 0xbc, 0xdf, 0x7a, 0x8e, 0x89, 0x80,\n\t0x9b, 0xb6, 0xc1, 0x58, 0xe8, 0x23, 0x65, 0xaf, 0xea, 0x25, 0x6f, 0xb1, 0xc8, 0x43, 0xc5, 0x54,\n\t0xfc, 0x1f, 0x21, 0x63, 0xa5, 0xf4, 0x07, 0x09, 0x1b, 0x2d, 0x77, 0x99, 0xb0, 0xcb, 0x46, 0xca,\n\t0x45, 0xcf, 0x4a, 0xde, 0x79, 0x8b, 0x86, 0x91, 0xa8, 0xe3, 0x3e, 0x42, 0xc6, 0x51, 0xf3, 0x0e,\n\t0x12, 0x36, 0x5a, 0xee, 0x29, 0x7b, 0x8d, 0x8c, 0x8f, 0x8a, 0x85, 0x94, 0xa7, 0xf2, 0x0d, 0x17,\n\t0x39, 0x4b, 0xdd, 0x7c, 0x84, 0x97, 0xa2, 0xfd, 0x1c, 0x24, 0x6c, 0xb4, 0xc7, 0x52, 0xf6,\n];\n\n/// Table of Lᵢ = LOG[i + 1] such that g^Lᵢ = i where g = 0x03.\nconst LOG: number[] = [\n\t0x00, 0x19, 0x01, 0x32, 0x02, 0x1a, 0xc6, 0x4b, 0xc7, 0x1b, 0x68, 0x33, 0xee, 0xdf, 0x03, 0x64,\n\t0x04, 0xe0, 0x0e, 0x34, 0x8d, 0x81, 0xef, 0x4c, 0x71, 0x08, 0xc8, 0xf8, 0x69, 0x1c, 0xc1, 0x7d,\n\t0xc2, 0x1d, 0xb5, 0xf9, 0xb9, 0x27, 0x6a, 0x4d, 0xe4, 0xa6, 0x72, 0x9a, 0xc9, 0x09, 0x78, 0x65,\n\t0x2f, 0x8a, 0x05, 0x21, 0x0f, 0xe1, 0x24, 0x12, 0xf0, 0x82, 0x45, 0x35, 0x93, 0xda, 0x8e, 0x96,\n\t0x8f, 0xdb, 0xbd, 0x36, 0xd0, 0xce, 0x94, 0x13, 0x5c, 0xd2, 0xf1, 0x40, 0x46, 0x83, 0x38, 0x66,\n\t0xdd, 0xfd, 0x30, 0xbf, 0x06, 0x8b, 0x62, 0xb3, 0x25, 0xe2, 0x98, 0x22, 0x88, 0x91, 0x10, 0x7e,\n\t0x6e, 0x48, 0xc3, 0xa3, 0xb6, 0x1e, 0x42, 0x3a, 0x6b, 0x28, 0x54, 0xfa, 0x85, 0x3d, 0xba, 0x2b,\n\t0x79, 0x0a, 0x15, 0x9b, 0x9f, 0x5e, 0xca, 0x4e, 0xd4, 0xac, 0xe5, 0xf3, 0x73, 0xa7, 0x57, 0xaf,\n\t0x58, 0xa8, 0x50, 0xf4, 0xea, 0xd6, 0x74, 0x4f, 0xae, 0xe9, 0xd5, 0xe7, 0xe6, 0xad, 0xe8, 0x2c,\n\t0xd7, 0x75, 0x7a, 0xeb, 0x16, 0x0b, 0xf5, 0x59, 0xcb, 0x5f, 0xb0, 0x9c, 0xa9, 0x51, 0xa0, 0x7f,\n\t0x0c, 0xf6, 0x6f, 0x17, 0xc4, 0x49, 0xec, 0xd8, 0x43, 0x1f, 0x2d, 0xa4, 0x76, 0x7b, 0xb7, 0xcc,\n\t0xbb, 0x3e, 0x5a, 0xfb, 0x60, 0xb1, 0x86, 0x3b, 0x52, 0xa1, 0x6c, 0xaa, 0x55, 0x29, 0x9d, 0x97,\n\t0xb2, 0x87, 0x90, 0x61, 0xbe, 0xdc, 0xfc, 0xbc, 0x95, 0xcf, 0xcd, 0x37, 0x3f, 0x5b, 0xd1, 0x53,\n\t0x39, 0x84, 0x3c, 0x41, 0xa2, 0x6d, 0x47, 0x14, 0x2a, 0x9e, 0x5d, 0x56, 0xf2, 0xd3, 0xab, 0x44,\n\t0x11, 0x92, 0xd9, 0x23, 0x20, 0x2e, 0x89, 0xb4, 0x7c, 0xb8, 0x26, 0x77, 0x99, 0xe3, 0xa5, 0x67,\n\t0x4a, 0xed, 0xde, 0xc5, 0x31, 0xfe, 0x18, 0x0d, 0x63, 0x8c, 0x80, 0xc0, 0xf7, 0x70, 0x07,\n];\n\n/**\n * A polynomial over the field GF(2⁸).\n */\nexport class Polynomial {\n\tcoefficients: GF256[];\n\n\t/**\n\t * Construct a new Polynomial over [GF256] from the given coefficients.\n\t * The first coefficient is the constant term.\n\t */\n\tconstructor(coefficients: GF256[]) {\n\t\tthis.coefficients = coefficients.slice();\n\n\t\t// The highest degree coefficient is always non-zero.\n\t\twhile (\n\t\t\tthis.coefficients.length > 0 &&\n\t\t\tthis.coefficients[this.coefficients.length - 1].value === 0\n\t\t) {\n\t\t\tthis.coefficients.pop();\n\t\t}\n\t}\n\n\t/**\n\t * Construct a polynomial from the given bytes.\n\t * Each byte is a coefficient of the polynomial starting from the constant term.\n\t */\n\tstatic fromBytes(bytes: Uint8Array): Polynomial {\n\t\treturn new Polynomial(Array.from(bytes, (b) => new GF256(b)));\n\t}\n\n\tdegree(): number {\n\t\tif (this.coefficients.length === 0) {\n\t\t\treturn 0;\n\t\t}\n\t\treturn this.coefficients.length - 1;\n\t}\n\n\t/** Get the coefficient of the polynomial at the given index. */\n\tgetCoefficient(index: number): GF256 {\n\t\tif (index >= this.coefficients.length) {\n\t\t\treturn GF256.zero();\n\t\t}\n\t\treturn this.coefficients[index];\n\t}\n\n\t/** Add two polynomials. */\n\tadd(other: Polynomial): Polynomial {\n\t\tconst degree = Math.max(this.degree(), other.degree());\n\t\treturn new Polynomial(\n\t\t\tArray.from({ length: degree + 1 }, (_, i) =>\n\t\t\t\tthis.getCoefficient(i).add(other.getCoefficient(i)),\n\t\t\t),\n\t\t);\n\t}\n\n\t/** Multiply two polynomials. */\n\tmul(other: Polynomial): Polynomial {\n\t\tconst degree = this.degree() + other.degree();\n\t\treturn new Polynomial(\n\t\t\tArray.from({ length: degree + 1 }, (_, i) => {\n\t\t\t\tlet sum = GF256.zero();\n\t\t\t\tfor (let j = 0; j <= i; j++) {\n\t\t\t\t\tif (j <= this.degree() && i - j <= other.degree()) {\n\t\t\t\t\t\tsum = sum.add(this.getCoefficient(j).mul(other.getCoefficient(i - j)));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn sum;\n\t\t\t}),\n\t\t);\n\t}\n\n\t/** The polynomial s * this. */\n\tscale(s: GF256): Polynomial {\n\t\treturn new Polynomial(this.coefficients.map((c) => c.mul(s)));\n\t}\n\n\t/** The polynomial (1 / s) * this. */\n\tdiv(s: GF256): Polynomial {\n\t\treturn this.scale(new GF256(1).div(s));\n\t}\n\n\t/** The polynomial x + c. */\n\tstatic monic_linear(c: GF256): Polynomial {\n\t\treturn new Polynomial([c, GF256.one()]);\n\t}\n\n\t/** The zero polynomial. */\n\tstatic zero(): Polynomial {\n\t\treturn new Polynomial([]);\n\t}\n\n\t/** The polynomial 1. */\n\tstatic one(): Polynomial {\n\t\treturn new Polynomial([GF256.one()]);\n\t}\n\n\t/** Given a set of coordinates, interpolate a polynomial. */\n\tstatic interpolate(coordinates: { x: GF256; y: GF256 }[]): Polynomial {\n\t\tif (coordinates.length < 1) {\n\t\t\tthrow new Error('At least one coefficient is required');\n\t\t}\n\n\t\tif (hasDuplicates(coordinates.map(({ x }) => x.value))) {\n\t\t\tthrow new Error('Coefficients must have unique x values');\n\t\t}\n\n\t\treturn coordinates.reduce(\n\t\t\t(sum, { x: x_j, y: y_j }, j) =>\n\t\t\t\tsum.add(\n\t\t\t\t\tcoordinates\n\t\t\t\t\t\t.filter((_, i) => i !== j)\n\t\t\t\t\t\t.reduce(\n\t\t\t\t\t\t\t(product, { x: x_i }) =>\n\t\t\t\t\t\t\t\tproduct.mul(Polynomial.monic_linear(x_i.neg()).div(x_j.sub(x_i))),\n\t\t\t\t\t\t\tPolynomial.one(),\n\t\t\t\t\t\t)\n\t\t\t\t\t\t.scale(y_j),\n\t\t\t\t),\n\t\t\tPolynomial.zero(),\n\t\t);\n\t}\n\n\t/** Given a set of coordinates, interpolate a polynomial and evaluate it at x = 0. */\n\tstatic combine(coordinates: { x: GF256; y: GF256 }[]): GF256 {\n\t\tif (coordinates.length < 1) {\n\t\t\tthrow new Error('At least one coefficient is required');\n\t\t}\n\n\t\tif (hasDuplicates(coordinates.map(({ x }) => x.value))) {\n\t\t\tthrow new Error('Coefficients must have unique x values');\n\t\t}\n\n\t\tconst quotient: GF256 = coordinates.reduce((sum, { x: x_j, y: y_j }, j) => {\n\t\t\tconst denominator = x_j.mul(\n\t\t\t\tcoordinates\n\t\t\t\t\t.filter((_, i) => i !== j)\n\t\t\t\t\t.reduce((product, { x: x_i }) => product.mul(x_i.sub(x_j)), GF256.one()),\n\t\t\t);\n\t\t\treturn sum.add(y_j.div(denominator));\n\t\t}, GF256.zero());\n\n\t\tconst xProduct = coordinates.reduce((product, { x }) => product.mul(x), GF256.one());\n\t\treturn xProduct.mul(quotient);\n\t}\n\n\t/** Evaluate the polynomial at x. */\n\tevaluate(x: GF256): GF256 {\n\t\treturn this.coefficients\n\t\t\t.toReversed()\n\t\t\t.reduce((sum, coefficient) => sum.mul(x).add(coefficient), GF256.zero());\n\t}\n}\n\n/** Representation of a share of a secret. The index is a number between 1 and 255. */\nexport type Share = {\n\tindex: number;\n\tshare: Uint8Array<ArrayBuffer>;\n};\n\nfunction toInternalShare(share: Share): InternalShare {\n\treturn {\n\t\tindex: new GF256(share.index),\n\t\tshare: Array.from(share.share, (byte) => new GF256(byte)),\n\t};\n}\n\n/** Internal representation of a share of a secret. The index is a non-zero GF256. */\ntype InternalShare = {\n\tindex: GF256;\n\tshare: GF256[];\n};\n\nfunction toShare(internalShare: InternalShare): Share {\n\treturn {\n\t\tindex: internalShare.index.value,\n\t\tshare: new Uint8Array(internalShare.share.map((byte) => byte.value)),\n\t};\n}\n\n/**\n * Sample a random polynomial with the given constant and degree.\n *\n * @param constant The constant term of the polynomial.\n * @param degree The degree of the polynomial.\n * @returns A random polynomial with the given constant and degree.\n */\nfunction samplePolynomial(constant: GF256, degree: number): Polynomial {\n\tconst randomCoefficients = new Uint8Array(degree);\n\tcrypto.getRandomValues(randomCoefficients);\n\n\t// The resulting polynomial has degree + 1 coefficients.\n\treturn Polynomial.fromBytes(new Uint8Array([constant.value, ...randomCoefficients]));\n}\n\n/**\n * Split a secret into shares.\n *\n * @param secret The secret to split.\n * @param threshold The minimum number of shares required to reconstruct the secret.\n * @param total The total number of shares to generate.\n * @returns The shares.\n */\nexport function split(secret: Uint8Array, threshold: number, total: number): Share[] {\n\tif (threshold > total || threshold < 1 || total >= GF256_SIZE) {\n\t\tthrow new Error(`Invalid threshold ${threshold} or total ${total}`);\n\t}\n\n\tconst polynomials = Array.from(secret, (s) => samplePolynomial(new GF256(s), threshold - 1));\n\treturn Array.from({ length: total }, (_, i) => {\n\t\t// Indexes start at 1 because 0 is reserved for the constant term (which is also the secret).\n\t\tconst index = new GF256(i + 1);\n\t\tconst share = polynomials.map((p) => p.evaluate(index));\n\t\treturn toShare({ index, share });\n\t});\n}\n\n/** Validate a set of shares and return them in internal shares representation along with the length of the shares. */\nfunction validateShares(shares: Share[]): { internalShares: InternalShare[]; length: number } {\n\tif (shares.length < 1) {\n\t\tthrow new Error('At least one share is required');\n\t}\n\n\tif (!allEqual(shares.map(({ share }) => share.length))) {\n\t\tthrow new Error('All shares must have the same length');\n\t}\n\n\tif (hasDuplicates(shares.map(({ index }) => index))) {\n\t\tthrow new Error('Shares must have unique indices');\n\t}\n\n\tconst internalShares = shares.map(toInternalShare);\n\tconst length = internalShares[0].share.length;\n\n\treturn { internalShares, length };\n}\n\n/**\n * Combine shares into a secret. If fewer than the threshold number of shares are provided,\n * the result will be indistinguishable from random.\n *\n * @param shares The shares to combine.\n * @returns The secret.\n */\nexport function combine(shares: Share[]): Uint8Array<ArrayBuffer> {\n\tconst { internalShares, length } = validateShares(shares);\n\n\treturn new Uint8Array(\n\t\tArray.from(\n\t\t\t{ length },\n\t\t\t(_, i) =>\n\t\t\t\tPolynomial.combine(\n\t\t\t\t\tinternalShares.map(({ index, share }) => ({\n\t\t\t\t\t\tx: index,\n\t\t\t\t\t\ty: share[i],\n\t\t\t\t\t})),\n\t\t\t\t).value,\n\t\t),\n\t);\n}\n\n/**\n * Interpolate a polynomial from the given shares.\n *\n * @param shares The shares to interpolate from.\n * @returns A function that evaluates the polynomial at a given x.\n */\nexport function interpolate(shares: Share[]): (x: number) => Uint8Array {\n\tconst { internalShares, length } = validateShares(shares);\n\n\tconst polynomials = Array.from({ length }, (_, i) =>\n\t\tPolynomial.interpolate(internalShares.map(({ index, share }) => ({ x: index, y: share[i] }))),\n\t);\n\n\treturn (x: number) => {\n\t\treturn new Uint8Array(polynomials.map((p) => p.evaluate(new GF256(x)).value));\n\t};\n}\n"],"mappings":";;;AAKA,MAAM,aAAa;;;;AAKnB,IAAa,QAAb,MAAa,MAAM;CAGlB,YAAY,OAAe;AAC1B,MAAI,QAAQ,KAAK,SAAS,WACzB,OAAM,IAAI,MAAM,iBAAiB,MAAM,YAAY;AAEpD,OAAK,QAAQ;;CAGd,MAAc;AACb,MAAI,KAAK,UAAU,EAClB,OAAM,IAAI,MAAM,gBAAgB;AAEjC,SAAO,IAAI,KAAK,QAAQ;;CAGzB,OAAO,IAAI,GAAkB;AAC5B,SAAO,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI;;CAG5C,IAAI,OAAqB;AACxB,SAAO,IAAI,MAAM,KAAK,QAAQ,MAAM,MAAM;;CAG3C,IAAI,OAAqB;AAExB,SAAO,KAAK,IAAI,MAAM;;CAGvB,MAAa;AAEZ,SAAO;;CAGR,IAAI,OAAqB;AACxB,MAAI,KAAK,UAAU,KAAK,MAAM,UAAU,EACvC,QAAO,IAAI,MAAM,EAAE;AAEpB,SAAO,MAAM,IAAI,KAAK,KAAK,GAAG,MAAM,KAAK,CAAC;;CAG3C,IAAI,OAAqB;AACxB,SAAO,KAAK,IAAI,MAAM,IAAI,aAAa,MAAM,KAAK,GAAG,EAAE,CAAC;;CAGzD,OAAO,OAAuB;AAC7B,SAAO,KAAK,UAAU,MAAM;;CAG7B,OAAO,OAAc;AACpB,SAAO,IAAI,MAAM,EAAE;;CAGpB,OAAO,MAAa;AACnB,SAAO,IAAI,MAAM,EAAE;;;AAKrB,MAAM,MAAgB;CACrB;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CACpF;AAGD,MAAM,MAAgB;CACrB;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAC1F;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CAAM;CACpF;;;;AAKD,IAAa,aAAb,MAAa,WAAW;;;;;CAOvB,YAAY,cAAuB;AAClC,OAAK,eAAe,aAAa,OAAO;AAGxC,SACC,KAAK,aAAa,SAAS,KAC3B,KAAK,aAAa,KAAK,aAAa,SAAS,GAAG,UAAU,EAE1D,MAAK,aAAa,KAAK;;;;;;CAQzB,OAAO,UAAU,OAA+B;AAC/C,SAAO,IAAI,WAAW,MAAM,KAAK,QAAQ,MAAM,IAAI,MAAM,EAAE,CAAC,CAAC;;CAG9D,SAAiB;AAChB,MAAI,KAAK,aAAa,WAAW,EAChC,QAAO;AAER,SAAO,KAAK,aAAa,SAAS;;;CAInC,eAAe,OAAsB;AACpC,MAAI,SAAS,KAAK,aAAa,OAC9B,QAAO,MAAM,MAAM;AAEpB,SAAO,KAAK,aAAa;;;CAI1B,IAAI,OAA+B;EAClC,MAAM,SAAS,KAAK,IAAI,KAAK,QAAQ,EAAE,MAAM,QAAQ,CAAC;AACtD,SAAO,IAAI,WACV,MAAM,KAAK,EAAE,QAAQ,SAAS,GAAG,GAAG,GAAG,MACtC,KAAK,eAAe,EAAE,CAAC,IAAI,MAAM,eAAe,EAAE,CAAC,CACnD,CACD;;;CAIF,IAAI,OAA+B;EAClC,MAAM,SAAS,KAAK,QAAQ,GAAG,MAAM,QAAQ;AAC7C,SAAO,IAAI,WACV,MAAM,KAAK,EAAE,QAAQ,SAAS,GAAG,GAAG,GAAG,MAAM;GAC5C,IAAI,MAAM,MAAM,MAAM;AACtB,QAAK,IAAI,IAAI,GAAG,KAAK,GAAG,IACvB,KAAI,KAAK,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAM,QAAQ,CAChD,OAAM,IAAI,IAAI,KAAK,eAAe,EAAE,CAAC,IAAI,MAAM,eAAe,IAAI,EAAE,CAAC,CAAC;AAGxE,UAAO;IACN,CACF;;;CAIF,MAAM,GAAsB;AAC3B,SAAO,IAAI,WAAW,KAAK,aAAa,KAAK,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;;;CAI9D,IAAI,GAAsB;AACzB,SAAO,KAAK,MAAM,IAAI,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;;;CAIvC,OAAO,aAAa,GAAsB;AACzC,SAAO,IAAI,WAAW,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC;;;CAIxC,OAAO,OAAmB;AACzB,SAAO,IAAI,WAAW,EAAE,CAAC;;;CAI1B,OAAO,MAAkB;AACxB,SAAO,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC;;;CAIrC,OAAO,YAAY,aAAmD;AACrE,MAAI,YAAY,SAAS,EACxB,OAAM,IAAI,MAAM,uCAAuC;AAGxD,MAAI,cAAc,YAAY,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CACrD,OAAM,IAAI,MAAM,yCAAyC;AAG1D,SAAO,YAAY,QACjB,KAAK,EAAE,GAAG,KAAK,GAAG,OAAO,MACzB,IAAI,IACH,YACE,QAAQ,GAAG,MAAM,MAAM,EAAE,CACzB,QACC,SAAS,EAAE,GAAG,UACd,QAAQ,IAAI,WAAW,aAAa,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,EAClE,WAAW,KAAK,CAChB,CACA,MAAM,IAAI,CACZ,EACF,WAAW,MAAM,CACjB;;;CAIF,OAAO,QAAQ,aAA8C;AAC5D,MAAI,YAAY,SAAS,EACxB,OAAM,IAAI,MAAM,uCAAuC;AAGxD,MAAI,cAAc,YAAY,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CACrD,OAAM,IAAI,MAAM,yCAAyC;EAG1D,MAAM,WAAkB,YAAY,QAAQ,KAAK,EAAE,GAAG,KAAK,GAAG,OAAO,MAAM;GAC1E,MAAM,cAAc,IAAI,IACvB,YACE,QAAQ,GAAG,MAAM,MAAM,EAAE,CACzB,QAAQ,SAAS,EAAE,GAAG,UAAU,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,MAAM,KAAK,CAAC,CACzE;AACD,UAAO,IAAI,IAAI,IAAI,IAAI,YAAY,CAAC;KAClC,MAAM,MAAM,CAAC;AAGhB,SADiB,YAAY,QAAQ,SAAS,EAAE,QAAQ,QAAQ,IAAI,EAAE,EAAE,MAAM,KAAK,CAAC,CACpE,IAAI,SAAS;;;CAI9B,SAAS,GAAiB;AACzB,SAAO,KAAK,aACV,YAAY,CACZ,QAAQ,KAAK,gBAAgB,IAAI,IAAI,EAAE,CAAC,IAAI,YAAY,EAAE,MAAM,MAAM,CAAC;;;AAU3E,SAAS,gBAAgB,OAA6B;AACrD,QAAO;EACN,OAAO,IAAI,MAAM,MAAM,MAAM;EAC7B,OAAO,MAAM,KAAK,MAAM,QAAQ,SAAS,IAAI,MAAM,KAAK,CAAC;EACzD;;AASF,SAAS,QAAQ,eAAqC;AACrD,QAAO;EACN,OAAO,cAAc,MAAM;EAC3B,OAAO,IAAI,WAAW,cAAc,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;EACpE;;;;;;;;;AAUF,SAAS,iBAAiB,UAAiB,QAA4B;CACtE,MAAM,qBAAqB,IAAI,WAAW,OAAO;AACjD,QAAO,gBAAgB,mBAAmB;AAG1C,QAAO,WAAW,UAAU,IAAI,WAAW,CAAC,SAAS,OAAO,GAAG,mBAAmB,CAAC,CAAC;;;;;;;;;;AAWrF,SAAgB,MAAM,QAAoB,WAAmB,OAAwB;AACpF,KAAI,YAAY,SAAS,YAAY,KAAK,SAAS,WAClD,OAAM,IAAI,MAAM,qBAAqB,UAAU,YAAY,QAAQ;CAGpE,MAAM,cAAc,MAAM,KAAK,SAAS,MAAM,iBAAiB,IAAI,MAAM,EAAE,EAAE,YAAY,EAAE,CAAC;AAC5F,QAAO,MAAM,KAAK,EAAE,QAAQ,OAAO,GAAG,GAAG,MAAM;EAE9C,MAAM,QAAQ,IAAI,MAAM,IAAI,EAAE;AAE9B,SAAO,QAAQ;GAAE;GAAO,OADV,YAAY,KAAK,MAAM,EAAE,SAAS,MAAM,CAAC;GACxB,CAAC;GAC/B;;;AAIH,SAAS,eAAe,QAAsE;AAC7F,KAAI,OAAO,SAAS,EACnB,OAAM,IAAI,MAAM,iCAAiC;AAGlD,KAAI,CAAC,SAAS,OAAO,KAAK,EAAE,YAAY,MAAM,OAAO,CAAC,CACrD,OAAM,IAAI,MAAM,uCAAuC;AAGxD,KAAI,cAAc,OAAO,KAAK,EAAE,YAAY,MAAM,CAAC,CAClD,OAAM,IAAI,MAAM,kCAAkC;CAGnD,MAAM,iBAAiB,OAAO,IAAI,gBAAgB;AAGlD,QAAO;EAAE;EAAgB,QAFV,eAAe,GAAG,MAAM;EAEN;;;;;;;;;AAUlC,SAAgB,QAAQ,QAA0C;CACjE,MAAM,EAAE,gBAAgB,WAAW,eAAe,OAAO;AAEzD,QAAO,IAAI,WACV,MAAM,KACL,EAAE,QAAQ,GACT,GAAG,MACH,WAAW,QACV,eAAe,KAAK,EAAE,OAAO,aAAa;EACzC,GAAG;EACH,GAAG,MAAM;EACT,EAAE,CACH,CAAC,MACH,CACD;;;;;;;;AASF,SAAgB,YAAY,QAA4C;CACvE,MAAM,EAAE,gBAAgB,WAAW,eAAe,OAAO;CAEzD,MAAM,cAAc,MAAM,KAAK,EAAE,QAAQ,GAAG,GAAG,MAC9C,WAAW,YAAY,eAAe,KAAK,EAAE,OAAO,aAAa;EAAE,GAAG;EAAO,GAAG,MAAM;EAAI,EAAE,CAAC,CAC7F;AAED,SAAQ,MAAc;AACrB,SAAO,IAAI,WAAW,YAAY,KAAK,MAAM,EAAE,SAAS,IAAI,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC"}

package/dist/types.d.mts

@@ -0,0 +1,79 @@
+import { DemType, KemType } from "./encrypt.mjs";
+import { SessionKey } from "./session-key.mjs";
+import { ClientWithExtensions, CoreClient } from "@haneullabs/haneul/client";
+
+//#region src/types.d.ts
+type SealCompatibleClient = ClientWithExtensions<{
+  core: CoreClient;
+}>;
+interface KeyServerConfig {
+  objectId: string;
+  weight: number;
+  apiKeyName?: string;
+  apiKey?: string;
+  /** Must be provided if object ID is for a committee mode server since all fetch key calls go
+   * through an aggregator. */
+  aggregatorUrl?: string;
+}
+/** Configuration options for initializing a SealClient*/
+interface SealClientOptions {
+  haneulClient: SealCompatibleClient;
+  /** Array of key server configs consisting of objectId, weight, optional API key name and API key */
+  serverConfigs: KeyServerConfig[];
+  /** Whether to verify the key servers' authenticity. */
+  verifyKeyServers?: boolean;
+  /** Timeout in milliseconds for network requests. */
+  timeout?: number;
+}
+interface EncryptOptions {
+  /** The type of KEM to use. */
+  kemType?: KemType;
+  /** The type of DEM to use. */
+  demType?: DemType;
+  /** The threshold for the TSS encryption. */
+  threshold: number;
+  /** The packageId namespace. */
+  packageId: string;
+  /** The identity to use. */
+  id: string;
+  /** The data to encrypt. */
+  data: Uint8Array;
+  /** Optional additional authenticated data. */
+  aad?: Uint8Array;
+}
+interface DecryptOptions {
+  /** The encrypted bytes to decrypt. */
+  data: Uint8Array;
+  /** The session key to use. */
+  sessionKey: SessionKey;
+  /** The transaction bytes to use (that calls seal_approve* functions). */
+  txBytes: Uint8Array;
+  /** Whether to check share consistency. */
+  checkShareConsistency?: boolean;
+  /** Whether to check also using an LE encoded nonce. */
+  checkLEEncoding?: boolean;
+}
+interface FetchKeysOptions {
+  /** The ids of the encrypted objects. */
+  ids: string[];
+  /** The transaction bytes to use (that calls seal_approve* functions). */
+  txBytes: Uint8Array;
+  /** The session key to use. */
+  sessionKey: SessionKey;
+  /** The threshold. */
+  threshold: number;
+}
+interface GetDerivedKeysOptions {
+  kemType?: KemType;
+  /** The id of the encrypted object. */
+  id: string;
+  /** The transaction bytes to use (that calls seal_approve* functions). */
+  txBytes: Uint8Array;
+  /** The session key to use. */
+  sessionKey: SessionKey;
+  /** The threshold. */
+  threshold: number;
+}
+//#endregion
+export { DecryptOptions, EncryptOptions, FetchKeysOptions, GetDerivedKeysOptions, KeyServerConfig, SealClientOptions, SealCompatibleClient };
+//# sourceMappingURL=types.d.mts.map

package/dist/types.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.mts","names":[],"sources":["../src/types.ts"],"mappings":";;;;;KAQY,oBAAA,GAAuB,oBAAA;EAClC,IAAA,EAAM,UAAA;AAAA;AAAA,UAcU,eAAA;EAChB,QAAA;EACA,MAAA;EACA,UAAA;EACA,MAAA;EAAA;;EAGA,aAAA;AAAA;AAID;AAAA,UAAiB,iBAAA;EAChB,YAAA,EAAc,oBAAA;EAEgB;EAA9B,aAAA,EAAe,eAAA;EAFD;EAId,gBAAA;EAFe;EAIf,OAAA;AAAA;AAAA,UAGgB,cAAA;EAHT;EAKP,OAAA,GAAU,OAAA;EAFoB;EAI9B,OAAA,GAAU,OAAA;EAFA;EAIV,SAAA;EAMM;EAJN,SAAA;EAMgB;EAJhB,EAAA;EARA;EAUA,IAAA,EAAM,UAAA;EARN;EAUA,GAAA,GAAM,UAAA;AAAA;AAAA,UAGU,cAAA;EAPhB;EASA,IAAA,EAAM,UAAA;EAPA;EASN,UAAA,EAAY,UAAA;EAPN;EASN,OAAA,EAAS,UAAA;EATO;EAWhB,qBAAA;EAR8B;EAU9B,eAAA;AAAA;AAAA,UAGgB,gBAAA;EAPP;EAST,GAAA;EATmB;EAWnB,OAAA,EAAS,UAAA;EAfH;EAiBN,UAAA,EAAY,UAAA;EAfA;EAiBZ,SAAA;AAAA;AAAA,UAGgB,qBAAA;EAChB,OAAA,GAAU,OAAA;EAfK;EAiBf,EAAA;EAdgB;EAgBhB,OAAA,EAAS,UAAA;;EAET,UAAA,EAAY,UAAA;EAhBZ;EAkBA,SAAA;AAAA"}

package/dist/utils.mjs

@@ -0,0 +1,89 @@
+import { UserError } from "./error.mjs";
+import { fromHex, toHex } from "@haneullabs/bcs";
+import { isValidHaneulObjectId } from "@haneullabs/haneul/utils";
+
+//#region src/utils.ts
+/** Maximum value for a u8 (unsigned 8-bit integer). */
+const MAX_U8 = 255;
+/** Length of a Haneul address. */
+const HANEUL_ADDRESS_LENGTH = 32;
+/** Length of an encrypted share. */
+const ENCRYPTED_SHARE_LENGTH = 32;
+/** Length of a key. */
+const KEY_LENGTH = 32;
+function xor(a, b) {
+	if (a.length !== b.length) throw new Error("Invalid input");
+	return xorUnchecked(a, b);
+}
+function xorUnchecked(a, b) {
+	return a.map((ai, i) => ai ^ b[i]);
+}
+/**
+* Create a full ID concatenating package ID || inner ID.
+* @param packageId - The package ID.
+* @param innerId - The inner ID.
+* @returns The full ID.
+*/
+function createFullId(packageId, innerId) {
+	if (!isValidHaneulObjectId(packageId)) throw new UserError(`Invalid package ID ${packageId}`);
+	return toHex(flatten([fromHex(packageId), fromHex(innerId)]));
+}
+/**
+* Flatten an array of Uint8Arrays into a single Uint8Array.
+*
+* @param arrays - An array of Uint8Arrays to flatten.
+* @returns A single Uint8Array containing all the elements of the input arrays in the given order.
+*/
+function flatten(arrays) {
+	const length = arrays.reduce((sum, arr) => sum + arr.length, 0);
+	const result = new Uint8Array(length);
+	arrays.reduce((offset, array) => {
+		result.set(array, offset);
+		return offset + array.length;
+	}, 0);
+	return result;
+}
+/** Count the number of occurrences of a value in an array. */
+function count(array, value) {
+	return array.reduce((count$1, item) => item === value ? count$1 + 1 : count$1, 0);
+}
+/** Check if the array has any duplicate elements. */
+function hasDuplicates(array) {
+	return new Set(array).size !== array.length;
+}
+/** Check if all elements in the array are equal. */
+function allEqual(array) {
+	if (array.length === 0) return true;
+	return array.every((item) => item === array[0]);
+}
+/**
+* Check if two Uint8Arrays are equal.
+* @param a - The first Uint8Array.
+* @param b - The second Uint8Array.
+* @returns True if the two Uint8Arrays are equal, false otherwise.
+*/
+function equals(a, b) {
+	if (a.length !== b.length) return false;
+	return a.every((ai, i) => ai === b[i]);
+}
+/**
+* A simple class to represent a version number of the form x.y.z.
+*/
+var Version = class {
+	constructor(version) {
+		const parts = version.split(".").map(Number);
+		if (parts.length !== 3 || parts.some((part) => isNaN(part) || !Number.isInteger(part) || part < 0)) throw new UserError(`Invalid version format: ${version}`);
+		this.major = parts[0];
+		this.minor = parts[1];
+		this.patch = parts[2];
+	}
+	older_than(other) {
+		if (this.major !== other.major) return this.major < other.major;
+		else if (this.minor !== other.minor) return this.minor < other.minor;
+		return this.patch < other.patch;
+	}
+};
+
+//#endregion
+export { ENCRYPTED_SHARE_LENGTH, HANEUL_ADDRESS_LENGTH, KEY_LENGTH, MAX_U8, Version, allEqual, count, createFullId, equals, flatten, hasDuplicates, xor, xorUnchecked };
+//# sourceMappingURL=utils.mjs.map

package/dist/utils.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.mjs","names":["count"],"sources":["../src/utils.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { fromHex, toHex } from '@haneullabs/bcs';\nimport { isValidHaneulObjectId } from '@haneullabs/haneul/utils';\n\nimport { UserError } from './error.js';\n\n/** Maximum value for a u8 (unsigned 8-bit integer). */\nexport const MAX_U8 = 255;\n\n/** Length of a Haneul address. */\nexport const HANEUL_ADDRESS_LENGTH = 32;\n\n/** Length of an encrypted share. */\nexport const ENCRYPTED_SHARE_LENGTH = 32;\n\n/** Length of a key. */\nexport const KEY_LENGTH = 32;\n\nexport function xor(a: Uint8Array, b: Uint8Array): Uint8Array {\n\tif (a.length !== b.length) {\n\t\tthrow new Error('Invalid input');\n\t}\n\treturn xorUnchecked(a, b);\n}\n\nexport function xorUnchecked(a: Uint8Array, b: Uint8Array): Uint8Array {\n\treturn a.map((ai, i) => ai ^ b[i]);\n}\n\n/**\n * Create a full ID concatenating package ID || inner ID.\n * @param packageId - The package ID.\n * @param innerId - The inner ID.\n * @returns The full ID.\n */\nexport function createFullId(packageId: string, innerId: string): string {\n\tif (!isValidHaneulObjectId(packageId)) {\n\t\tthrow new UserError(`Invalid package ID ${packageId}`);\n\t}\n\tconst fullId = flatten([fromHex(packageId), fromHex(innerId)]);\n\treturn toHex(fullId);\n}\n\n/**\n * Flatten an array of Uint8Arrays into a single Uint8Array.\n *\n * @param arrays - An array of Uint8Arrays to flatten.\n * @returns A single Uint8Array containing all the elements of the input arrays in the given order.\n */\nexport function flatten(arrays: Uint8Array[]): Uint8Array {\n\tconst length = arrays.reduce((sum, arr) => sum + arr.length, 0);\n\tconst result = new Uint8Array(length);\n\tarrays.reduce((offset, array) => {\n\t\tresult.set(array, offset);\n\t\treturn offset + array.length;\n\t}, 0);\n\treturn result;\n}\n\n/** Count the number of occurrences of a value in an array. */\nexport function count<T>(array: T[], value: T): number {\n\treturn array.reduce((count, item) => (item === value ? count + 1 : count), 0);\n}\n\n/** Check if the array has any duplicate elements. */\nexport function hasDuplicates(array: number[]): boolean {\n\treturn new Set(array).size !== array.length;\n}\n\n/** Check if all elements in the array are equal. */\nexport function allEqual(array: number[]): boolean {\n\tif (array.length === 0) {\n\t\treturn true;\n\t}\n\treturn array.every((item) => item === array[0]);\n}\n\n/**\n * Check if two Uint8Arrays are equal.\n * @param a - The first Uint8Array.\n * @param b - The second Uint8Array.\n * @returns True if the two Uint8Arrays are equal, false otherwise.\n */\nexport function equals(a: Uint8Array, b: Uint8Array): boolean {\n\tif (a.length !== b.length) {\n\t\treturn false;\n\t}\n\treturn a.every((ai, i) => ai === b[i]);\n}\n\n/**\n * A simple class to represent a version number of the form x.y.z.\n */\nexport class Version {\n\tmajor: number;\n\tminor: number;\n\tpatch: number;\n\n\tconstructor(version: string) {\n\t\t// Very basic version parsing. Assumes version is in the format x.y.z where x, y, and z are non-negative integers.\n\t\tconst parts = version.split('.').map(Number);\n\t\tif (\n\t\t\tparts.length !== 3 ||\n\t\t\tparts.some((part) => isNaN(part) || !Number.isInteger(part) || part < 0)\n\t\t) {\n\t\t\tthrow new UserError(`Invalid version format: ${version}`);\n\t\t}\n\t\tthis.major = parts[0];\n\t\tthis.minor = parts[1];\n\t\tthis.patch = parts[2];\n\t}\n\n\t// Compare this version with another version. True if this version is older than the other version.\n\tolder_than(other: Version): boolean {\n\t\tif (this.major !== other.major) {\n\t\t\treturn this.major < other.major;\n\t\t} else if (this.minor !== other.minor) {\n\t\t\treturn this.minor < other.minor;\n\t\t}\n\t\treturn this.patch < other.patch;\n\t}\n}\n"],"mappings":";;;;;;AASA,MAAa,SAAS;;AAGtB,MAAa,wBAAwB;;AAGrC,MAAa,yBAAyB;;AAGtC,MAAa,aAAa;AAE1B,SAAgB,IAAI,GAAe,GAA2B;AAC7D,KAAI,EAAE,WAAW,EAAE,OAClB,OAAM,IAAI,MAAM,gBAAgB;AAEjC,QAAO,aAAa,GAAG,EAAE;;AAG1B,SAAgB,aAAa,GAAe,GAA2B;AACtE,QAAO,EAAE,KAAK,IAAI,MAAM,KAAK,EAAE,GAAG;;;;;;;;AASnC,SAAgB,aAAa,WAAmB,SAAyB;AACxE,KAAI,CAAC,sBAAsB,UAAU,CACpC,OAAM,IAAI,UAAU,sBAAsB,YAAY;AAGvD,QAAO,MADQ,QAAQ,CAAC,QAAQ,UAAU,EAAE,QAAQ,QAAQ,CAAC,CAAC,CAC1C;;;;;;;;AASrB,SAAgB,QAAQ,QAAkC;CACzD,MAAM,SAAS,OAAO,QAAQ,KAAK,QAAQ,MAAM,IAAI,QAAQ,EAAE;CAC/D,MAAM,SAAS,IAAI,WAAW,OAAO;AACrC,QAAO,QAAQ,QAAQ,UAAU;AAChC,SAAO,IAAI,OAAO,OAAO;AACzB,SAAO,SAAS,MAAM;IACpB,EAAE;AACL,QAAO;;;AAIR,SAAgB,MAAS,OAAY,OAAkB;AACtD,QAAO,MAAM,QAAQ,SAAO,SAAU,SAAS,QAAQA,UAAQ,IAAIA,SAAQ,EAAE;;;AAI9E,SAAgB,cAAc,OAA0B;AACvD,QAAO,IAAI,IAAI,MAAM,CAAC,SAAS,MAAM;;;AAItC,SAAgB,SAAS,OAA0B;AAClD,KAAI,MAAM,WAAW,EACpB,QAAO;AAER,QAAO,MAAM,OAAO,SAAS,SAAS,MAAM,GAAG;;;;;;;;AAShD,SAAgB,OAAO,GAAe,GAAwB;AAC7D,KAAI,EAAE,WAAW,EAAE,OAClB,QAAO;AAER,QAAO,EAAE,OAAO,IAAI,MAAM,OAAO,EAAE,GAAG;;;;;AAMvC,IAAa,UAAb,MAAqB;CAKpB,YAAY,SAAiB;EAE5B,MAAM,QAAQ,QAAQ,MAAM,IAAI,CAAC,IAAI,OAAO;AAC5C,MACC,MAAM,WAAW,KACjB,MAAM,MAAM,SAAS,MAAM,KAAK,IAAI,CAAC,OAAO,UAAU,KAAK,IAAI,OAAO,EAAE,CAExE,OAAM,IAAI,UAAU,2BAA2B,UAAU;AAE1D,OAAK,QAAQ,MAAM;AACnB,OAAK,QAAQ,MAAM;AACnB,OAAK,QAAQ,MAAM;;CAIpB,WAAW,OAAyB;AACnC,MAAI,KAAK,UAAU,MAAM,MACxB,QAAO,KAAK,QAAQ,MAAM;WAChB,KAAK,UAAU,MAAM,MAC/B,QAAO,KAAK,QAAQ,MAAM;AAE3B,SAAO,KAAK,QAAQ,MAAM"}

package/dist/version.mjs

@@ -0,0 +1,6 @@
+//#region src/version.ts
+const PACKAGE_VERSION = "1.1.1";
+
+//#endregion
+export { PACKAGE_VERSION };
+//# sourceMappingURL=version.mjs.map

package/dist/version.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"version.mjs","names":[],"sources":["../src/version.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\n// This file is generated by genversion.mjs. Do not edit it directly.\n\nexport const PACKAGE_VERSION = '1.1.1';\n"],"mappings":";AAKA,MAAa,kBAAkB"}

package/docs/index.md

@@ -0,0 +1,84 @@
+# Seal SDK
+
+> Decentralized secrets management with threshold encryption on Haneul
+
+> **Note:** This is a beta version of Seal. See https://github.com/GeunhwaJeong/seal for more
+> details.
+
+The Seal SDK provides threshold encryption capabilities for Haneul applications, enabling secure
+data encryption with configurable key servers.
+
+## Installation
+
+```bash npm2yarn
+npm install --save @haneullabs/seal @haneullabs/haneul
+```
+
+## Setup
+
+To use the Seal SDK, create a Haneul client and extend it with the Seal extension:
+
+```ts
+const client = new HaneulGrpcClient({
+	network: 'testnet',
+	baseUrl: 'https://fullnode.testnet.haneul.io:443',
+}).$extend(
+	seal({
+		serverConfigs: [
+			{ objectId: '0x...keyserver1', weight: 1 },
+			{ objectId: '0x...keyserver2', weight: 1 },
+		],
+	}),
+);
+```
+
+## Configuration Options
+
+The `seal()` function accepts the following options:
+
+- **`serverConfigs`** (required) - Array of key server configurations with `objectId` and `weight`
+- **`verifyKeyServers`** (optional) - Whether to verify key server authenticity (default: `true`)
+- **`timeout`** (optional) - Timeout in milliseconds for network requests (default: `10000`)
+
+## Basic Usage
+
+### Encrypting Data
+
+```ts
+const data = new Uint8Array([1, 2, 3]);
+
+const { encryptedObject } = await client.seal.encrypt({
+	threshold: 2, // Number of key servers needed to decrypt
+	packageId: '0x...your-package-id',
+	id: '0x...your-object-id',
+	data,
+});
+```
+
+### Decrypting Data
+
+```ts
+// Create a session key for decryption
+const sessionKey = await SessionKey.create({
+	address: senderAddress,
+	packageId: '0x...your-package-id',
+	ttlMin: 10, // Time-to-live in minutes
+	signer: keypair,
+	haneulClient: client,
+});
+
+// Build transaction bytes that call seal_approve
+const txBytes = await buildApprovalTransaction(/* ... */);
+
+// Decrypt the data
+const decryptedData = await client.seal.decrypt({
+	data: encryptedObject,
+	sessionKey,
+	txBytes,
+});
+```
+
+## Resources
+
+For detailed documentation on threshold encryption and key server setup, see the
+[Seal repository](https://github.com/GeunhwaJeong/seal).

package/docs/llms-index.md

@@ -0,0 +1,6 @@
+# Seal
+
+> Use Seal, a decentralized secrets management service that secures your data using threshold
+> encryption and on-chain access control.
+
+- [Seal SDK](./index.md): Decentralized secrets management with threshold encryption on Haneul

package/package.json

@@ -1,48 +1,52 @@
 {
   "name": "@haneullabs/seal",
-  "version": "0.1.0",
+  "version": "1.1.1",
   "description": "Seal SDK",
   "license": "Apache-2.0",
-  "author": "Haneul Labs <build@haneullabs.com>",
-  "type": "commonjs",
-  "main": "./dist/cjs/index.js",
-  "module": "./dist/esm/index.js",
-  "types": "./dist/cjs/index.d.ts",
+  "author": "Haneul Labs <build@haneul-labs.com>",
+  "type": "module",
+  "main": "./dist/index.mjs",
+  "types": "./dist/index.d.mts",
   "exports": {
     ".": {
-      "import": "./dist/esm/index.js",
-      "require": "./dist/cjs/index.js"
+      "types": "./dist/index.d.mts",
+      "import": "./dist/index.mjs",
+      "default": "./dist/index.mjs"
     }
   },
   "sideEffects": false,
   "files": [
     "CHANGELOG.md",
-    "dist"
+    "dist",
+    "docs"
   ],
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/GeunhwaJeong/haneul-ts-sdks.git"
+    "url": "git+https://github.com/GeunhwaJeong/ts-sdks.git"
   },
   "bugs": {
-    "url": "https://github.com/haneullabs/ts-sdks/issues"
+    "url": "https://github.com/GeunhwaJeong/ts-sdks/issues"
   },
-  "homepage": "https://github.com/MystenLabs/seal#readme",
+  "homepage": "https://github.com/GeunhwaJeong/seal#readme",
   "devDependencies": {
-    "@hey-api/openapi-ts": "^0.88.0",
-    "@types/node": "^24.10.1",
+    "@hey-api/openapi-ts": "^0.90.3",
+    "@types/node": "^25.0.8",
     "typescript": "^5.9.3",
-    "vitest": "^4.0.15",
-    "@haneullabs/build-scripts": "0.1.0"
+    "vitest": "^4.0.17",
+    "@haneullabs/haneul": "^2.13.0"
   },
   "dependencies": {
-    "@noble/curves": "=1.9.4",
-    "@noble/hashes": "^1.8.0",
-    "@haneullabs/haneul": "0.1.0",
-    "@haneullabs/bcs": "0.1.0"
+    "@noble/curves": "^2.0.1",
+    "@noble/hashes": "^2.0.1",
+    "@haneullabs/bcs": "^2.0.3"
+  },
+  "peerDependencies": {
+    "@haneullabs/haneul": "^2.13.0"
   },
   "scripts": {
     "clean": "rm -rf tsconfig.tsbuildinfo ./dist",
-    "build": "node genversion.mjs && build-package",
+    "build": "node genversion.mjs && rm -rf dist && tsc --noEmit && tsdown",
+    "build:docs": "tsx ../docs/scripts/build-docs.ts",
     "codegen:version": "node genversion.mjs",
     "vitest": "vitest",
     "test": "pnpm test:typecheck && pnpm test:unit",
@@ -50,9 +54,9 @@
     "test:unit": "vitest run unit __tests__",
     "prettier:check": "prettier -c --ignore-unknown .",
     "prettier:fix": "prettier -w --ignore-unknown .",
-    "eslint:check": "eslint --max-warnings=0 .",
-    "eslint:fix": "pnpm run eslint:check --fix",
-    "lint": "pnpm run eslint:check && pnpm run prettier:check",
-    "lint:fix": "pnpm run eslint:fix && pnpm run prettier:fix"
+    "oxlint:check": "oxlint  .",
+    "oxlint:fix": "oxlint --fix",
+    "lint": "pnpm run oxlint:check && pnpm run prettier:check",
+    "lint:fix": "pnpm run oxlint:fix && pnpm run prettier:fix"
   }
 }

package/dist/cjs/bcs.d.ts

@@ -1,71 +0,0 @@
-export declare const IBEEncryptions: import("@haneullabs/bcs").BcsEnum<{
-    BonehFranklinBLS12381: import("@haneullabs/bcs").BcsStruct<{
-        nonce: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "bytes[96]">;
-        encryptedShares: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>[], Iterable<Iterable<number>> & {
-            length: number;
-        }, string>;
-        encryptedRandomness: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "bytes[32]">;
-    }, string>;
-}, "IBEEncryptions">;
-export declare const Ciphertext: import("@haneullabs/bcs").BcsEnum<{
-    Aes256Gcm: import("@haneullabs/bcs").BcsStruct<{
-        blob: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "vector<u8>">;
-        aad: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike> | null, Iterable<number> | null | undefined, "Option<vector<u8>>">;
-    }, string>;
-    Hmac256Ctr: import("@haneullabs/bcs").BcsStruct<{
-        blob: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "vector<u8>">;
-        aad: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike> | null, Iterable<number> | null | undefined, "Option<vector<u8>>">;
-        mac: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "bytes[32]">;
-    }, string>;
-    Plain: import("@haneullabs/bcs").BcsStruct<{}, string>;
-}, "Ciphertext">;
-/**
- * The encrypted object format. Should be aligned with the Rust implementation.
- */
-export declare const EncryptedObject: import("@haneullabs/bcs").BcsStruct<{
-    version: import("@haneullabs/bcs").BcsType<number, number, "u8">;
-    packageId: import("@haneullabs/bcs").BcsType<string, string | Uint8Array<ArrayBufferLike>, "bytes[32]">;
-    id: import("@haneullabs/bcs").BcsType<string, string, string>;
-    services: import("@haneullabs/bcs").BcsType<[string, number][], Iterable<readonly [string | Uint8Array<ArrayBufferLike>, number]> & {
-        length: number;
-    }, string>;
-    threshold: import("@haneullabs/bcs").BcsType<number, number, "u8">;
-    encryptedShares: import("@haneullabs/bcs").BcsEnum<{
-        BonehFranklinBLS12381: import("@haneullabs/bcs").BcsStruct<{
-            nonce: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "bytes[96]">;
-            encryptedShares: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>[], Iterable<Iterable<number>> & {
-                length: number;
-            }, string>;
-            encryptedRandomness: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "bytes[32]">;
-        }, string>;
-    }, "IBEEncryptions">;
-    ciphertext: import("@haneullabs/bcs").BcsEnum<{
-        Aes256Gcm: import("@haneullabs/bcs").BcsStruct<{
-            blob: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "vector<u8>">;
-            aad: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike> | null, Iterable<number> | null | undefined, "Option<vector<u8>>">;
-        }, string>;
-        Hmac256Ctr: import("@haneullabs/bcs").BcsStruct<{
-            blob: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "vector<u8>">;
-            aad: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike> | null, Iterable<number> | null | undefined, "Option<vector<u8>>">;
-            mac: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "bytes[32]">;
-        }, string>;
-        Plain: import("@haneullabs/bcs").BcsStruct<{}, string>;
-    }, "Ciphertext">;
-}, string>;
-/**
- * The Move struct for the KeyServerV1 object.
- */
-export declare const KeyServerMoveV1: import("@haneullabs/bcs").BcsStruct<{
-    name: import("@haneullabs/bcs").BcsType<string, string, "string">;
-    url: import("@haneullabs/bcs").BcsType<string, string, "string">;
-    keyType: import("@haneullabs/bcs").BcsType<number, number, "u8">;
-    pk: import("@haneullabs/bcs").BcsType<Uint8Array<ArrayBufferLike>, Iterable<number>, "vector<u8>">;
-}, string>;
-/**
- * The Move struct for the parent object.
- */
-export declare const KeyServerMove: import("@haneullabs/bcs").BcsStruct<{
-    id: import("@haneullabs/bcs").BcsType<string, string | Uint8Array<ArrayBufferLike>, "bytes[32]">;
-    firstVersion: import("@haneullabs/bcs").BcsType<string, string | number | bigint, "u64">;
-    lastVersion: import("@haneullabs/bcs").BcsType<string, string | number | bigint, "u64">;
-}, string>;

package/dist/cjs/bcs.js

@@ -1,74 +0,0 @@
-"use strict";
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var bcs_exports = {};
-__export(bcs_exports, {
-  Ciphertext: () => Ciphertext,
-  EncryptedObject: () => EncryptedObject,
-  IBEEncryptions: () => IBEEncryptions,
-  KeyServerMove: () => KeyServerMove,
-  KeyServerMoveV1: () => KeyServerMoveV1
-});
-module.exports = __toCommonJS(bcs_exports);
-var import_bcs = require("@haneullabs/bcs");
-var import_bcs2 = require("@haneullabs/haneul/bcs");
-const IBEEncryptions = import_bcs2.bcs.enum("IBEEncryptions", {
-  BonehFranklinBLS12381: import_bcs2.bcs.struct("BonehFranklinBLS12381", {
-    nonce: import_bcs2.bcs.bytes(96),
-    encryptedShares: import_bcs2.bcs.vector(import_bcs2.bcs.bytes(32)),
-    encryptedRandomness: import_bcs2.bcs.bytes(32)
-  })
-});
-const Ciphertext = import_bcs2.bcs.enum("Ciphertext", {
-  Aes256Gcm: import_bcs2.bcs.struct("Aes256Gcm", {
-    blob: import_bcs2.bcs.byteVector(),
-    aad: import_bcs2.bcs.option(import_bcs2.bcs.byteVector())
-  }),
-  Hmac256Ctr: import_bcs2.bcs.struct("Hmac256Ctr", {
-    blob: import_bcs2.bcs.byteVector(),
-    aad: import_bcs2.bcs.option(import_bcs2.bcs.byteVector()),
-    mac: import_bcs2.bcs.bytes(32)
-  }),
-  Plain: import_bcs2.bcs.struct("Plain", {})
-});
-const EncryptedObject = import_bcs2.bcs.struct("EncryptedObject", {
-  version: import_bcs2.bcs.u8(),
-  packageId: import_bcs2.bcs.Address,
-  id: import_bcs2.bcs.byteVector().transform({
-    output: (val) => (0, import_bcs.toHex)(val),
-    input: (val) => (0, import_bcs.fromHex)(val)
-  }),
-  services: import_bcs2.bcs.vector(import_bcs2.bcs.tuple([import_bcs2.bcs.Address, import_bcs2.bcs.u8()])),
-  threshold: import_bcs2.bcs.u8(),
-  encryptedShares: IBEEncryptions,
-  ciphertext: Ciphertext
-});
-const KeyServerMoveV1 = import_bcs2.bcs.struct("KeyServerV1", {
-  name: import_bcs2.bcs.string(),
-  url: import_bcs2.bcs.string(),
-  keyType: import_bcs2.bcs.u8(),
-  pk: import_bcs2.bcs.byteVector()
-});
-const KeyServerMove = import_bcs2.bcs.struct("KeyServer", {
-  id: import_bcs2.bcs.Address,
-  firstVersion: import_bcs2.bcs.u64(),
-  // latest version
-  lastVersion: import_bcs2.bcs.u64()
-  // oldest version
-});
-//# sourceMappingURL=bcs.js.map

package/dist/cjs/bcs.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/bcs.ts"],
-  "sourcesContent": ["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { fromHex, toHex } from '@haneullabs/bcs';\nimport { bcs } from '@haneullabs/haneul/bcs';\n\nexport const IBEEncryptions = bcs.enum('IBEEncryptions', {\n\tBonehFranklinBLS12381: bcs.struct('BonehFranklinBLS12381', {\n\t\tnonce: bcs.bytes(96),\n\t\tencryptedShares: bcs.vector(bcs.bytes(32)),\n\t\tencryptedRandomness: bcs.bytes(32),\n\t}),\n});\n\nexport const Ciphertext = bcs.enum('Ciphertext', {\n\tAes256Gcm: bcs.struct('Aes256Gcm', {\n\t\tblob: bcs.byteVector(),\n\t\taad: bcs.option(bcs.byteVector()),\n\t}),\n\tHmac256Ctr: bcs.struct('Hmac256Ctr', {\n\t\tblob: bcs.byteVector(),\n\t\taad: bcs.option(bcs.byteVector()),\n\t\tmac: bcs.bytes(32),\n\t}),\n\tPlain: bcs.struct('Plain', {}),\n});\n\n/**\n * The encrypted object format. Should be aligned with the Rust implementation.\n */\nexport const EncryptedObject = bcs.struct('EncryptedObject', {\n\tversion: bcs.u8(),\n\tpackageId: bcs.Address,\n\tid: bcs.byteVector().transform({\n\t\toutput: (val) => toHex(val),\n\t\tinput: (val: string) => fromHex(val),\n\t}),\n\tservices: bcs.vector(bcs.tuple([bcs.Address, bcs.u8()])),\n\tthreshold: bcs.u8(),\n\tencryptedShares: IBEEncryptions,\n\tciphertext: Ciphertext,\n});\n\n/**\n * The Move struct for the KeyServerV1 object.\n */\nexport const KeyServerMoveV1 = bcs.struct('KeyServerV1', {\n\tname: bcs.string(),\n\turl: bcs.string(),\n\tkeyType: bcs.u8(),\n\tpk: bcs.byteVector(),\n});\n\n/**\n * The Move struct for the parent object.\n */\nexport const KeyServerMove = bcs.struct('KeyServer', {\n\tid: bcs.Address,\n\tfirstVersion: bcs.u64(), // latest version\n\tlastVersion: bcs.u64(), // oldest version\n});\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,iBAA+B;AAC/B,IAAAA,cAAoB;AAEb,MAAM,iBAAiB,gBAAI,KAAK,kBAAkB;AAAA,EACxD,uBAAuB,gBAAI,OAAO,yBAAyB;AAAA,IAC1D,OAAO,gBAAI,MAAM,EAAE;AAAA,IACnB,iBAAiB,gBAAI,OAAO,gBAAI,MAAM,EAAE,CAAC;AAAA,IACzC,qBAAqB,gBAAI,MAAM,EAAE;AAAA,EAClC,CAAC;AACF,CAAC;AAEM,MAAM,aAAa,gBAAI,KAAK,cAAc;AAAA,EAChD,WAAW,gBAAI,OAAO,aAAa;AAAA,IAClC,MAAM,gBAAI,WAAW;AAAA,IACrB,KAAK,gBAAI,OAAO,gBAAI,WAAW,CAAC;AAAA,EACjC,CAAC;AAAA,EACD,YAAY,gBAAI,OAAO,cAAc;AAAA,IACpC,MAAM,gBAAI,WAAW;AAAA,IACrB,KAAK,gBAAI,OAAO,gBAAI,WAAW,CAAC;AAAA,IAChC,KAAK,gBAAI,MAAM,EAAE;AAAA,EAClB,CAAC;AAAA,EACD,OAAO,gBAAI,OAAO,SAAS,CAAC,CAAC;AAC9B,CAAC;AAKM,MAAM,kBAAkB,gBAAI,OAAO,mBAAmB;AAAA,EAC5D,SAAS,gBAAI,GAAG;AAAA,EAChB,WAAW,gBAAI;AAAA,EACf,IAAI,gBAAI,WAAW,EAAE,UAAU;AAAA,IAC9B,QAAQ,CAAC,YAAQ,kBAAM,GAAG;AAAA,IAC1B,OAAO,CAAC,YAAgB,oBAAQ,GAAG;AAAA,EACpC,CAAC;AAAA,EACD,UAAU,gBAAI,OAAO,gBAAI,MAAM,CAAC,gBAAI,SAAS,gBAAI,GAAG,CAAC,CAAC,CAAC;AAAA,EACvD,WAAW,gBAAI,GAAG;AAAA,EAClB,iBAAiB;AAAA,EACjB,YAAY;AACb,CAAC;AAKM,MAAM,kBAAkB,gBAAI,OAAO,eAAe;AAAA,EACxD,MAAM,gBAAI,OAAO;AAAA,EACjB,KAAK,gBAAI,OAAO;AAAA,EAChB,SAAS,gBAAI,GAAG;AAAA,EAChB,IAAI,gBAAI,WAAW;AACpB,CAAC;AAKM,MAAM,gBAAgB,gBAAI,OAAO,aAAa;AAAA,EACpD,IAAI,gBAAI;AAAA,EACR,cAAc,gBAAI,IAAI;AAAA;AAAA,EACtB,aAAa,gBAAI,IAAI;AAAA;AACtB,CAAC;",
-  "names": ["import_bcs"]
-}

package/dist/cjs/bls12381.d.ts

@@ -1,44 +0,0 @@
-import type { Fp2, Fp12 } from '@noble/curves/abstract/tower';
-import type { WeierstrassPoint } from '@noble/curves/abstract/weierstrass';
-export declare class G1Element {
-    point: WeierstrassPoint<bigint>;
-    static readonly SIZE = 48;
-    constructor(point: WeierstrassPoint<bigint>);
-    static generator(): G1Element;
-    static fromBytes(bytes: Uint8Array): G1Element;
-    toBytes(): Uint8Array<ArrayBuffer>;
-    multiply(scalar: Scalar): G1Element;
-    add(other: G1Element): G1Element;
-    subtract(other: G1Element): G1Element;
-    static hashToCurve(data: Uint8Array): G1Element;
-    pairing(other: G2Element): GTElement;
-}
-export declare class G2Element {
-    point: WeierstrassPoint<Fp2>;
-    static readonly SIZE = 96;
-    constructor(point: WeierstrassPoint<Fp2>);
-    static generator(): G2Element;
-    static fromBytes(bytes: Uint8Array): G2Element;
-    toBytes(): Uint8Array<ArrayBuffer>;
-    multiply(scalar: Scalar): G2Element;
-    add(other: G2Element): G2Element;
-    static hashToCurve(data: Uint8Array): G2Element;
-    equals(other: G2Element): boolean;
-}
-export declare class GTElement {
-    element: Fp12;
-    static readonly SIZE = 576;
-    constructor(element: Fp12);
-    toBytes(): Uint8Array<ArrayBuffer>;
-    equals(other: GTElement): boolean;
-}
-export declare class Scalar {
-    scalar: bigint;
-    static readonly SIZE = 32;
-    constructor(scalar: bigint);
-    static fromBigint(scalar: bigint): Scalar;
-    static random(): Scalar;
-    toBytes(): Uint8Array;
-    static fromBytes(bytes: Uint8Array): Scalar;
-    static fromBytesLE(bytes: Uint8Array): Scalar;
-}