shamir-mnemonic-ts 1.0.0

package/dist/share.js

@@ -0,0 +1,194 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Share = void 0;
+const rs1024 = __importStar(require("./rs1024"));
+const wordlist = __importStar(require("./wordlist"));
+const constants_1 = require("./constants");
+const utils_1 = require("./utils");
+function _intToWordIndices(value, length) {
+    /** Converts an integer value to a list of base 1024 indices in big endian order. */
+    return Array.from((0, utils_1.intToIndices)(value, length, constants_1.RADIX_BITS));
+}
+function _intFromWordIndices(indices) {
+    /** Converts a list of base 1024 indices in big endian order to an integer value. */
+    let value = 0;
+    for (const index of indices) {
+        value = value * constants_1.RADIX + index;
+    }
+    return value;
+}
+function _customizationString(extendable) {
+    return extendable ? constants_1.CUSTOMIZATION_STRING_EXTENDABLE : constants_1.CUSTOMIZATION_STRING_ORIG;
+}
+class Share {
+    constructor(identifier, extendable, iterationExponent, groupIndex, groupThreshold, groupCount, index, memberThreshold, value) {
+        this.identifier = identifier;
+        this.extendable = extendable;
+        this.iterationExponent = iterationExponent;
+        this.groupIndex = groupIndex;
+        this.groupThreshold = groupThreshold;
+        this.groupCount = groupCount;
+        this.index = index;
+        this.memberThreshold = memberThreshold;
+        this.value = value;
+    }
+    commonParameters() {
+        /** Return values that uniquely identify a matching set of shares. */
+        return {
+            identifier: this.identifier,
+            extendable: this.extendable,
+            iterationExponent: this.iterationExponent,
+            groupThreshold: this.groupThreshold,
+            groupCount: this.groupCount,
+        };
+    }
+    groupParameters() {
+        /** Return values that uniquely identify shares belonging to the same group. */
+        return {
+            identifier: this.identifier,
+            extendable: this.extendable,
+            iterationExponent: this.iterationExponent,
+            groupIndex: this.groupIndex,
+            groupThreshold: this.groupThreshold,
+            groupCount: this.groupCount,
+            memberThreshold: this.memberThreshold,
+        };
+    }
+    _encodeIdExp() {
+        let idExpInt = this.identifier << (constants_1.ITERATION_EXP_LENGTH_BITS + constants_1.EXTENDABLE_FLAG_LENGTH_BITS);
+        idExpInt += (this.extendable ? 1 : 0) << constants_1.ITERATION_EXP_LENGTH_BITS;
+        idExpInt += this.iterationExponent;
+        return _intToWordIndices(idExpInt, constants_1.ID_EXP_LENGTH_WORDS);
+    }
+    _encodeShareParams() {
+        // each value is 4 bits, for 20 bits total
+        let val = this.groupIndex;
+        val <<= 4;
+        val += this.groupThreshold - 1;
+        val <<= 4;
+        val += this.groupCount - 1;
+        val <<= 4;
+        val += this.index;
+        val <<= 4;
+        val += this.memberThreshold - 1;
+        // group parameters are 2 words
+        return _intToWordIndices(val, 2);
+    }
+    words() {
+        /** Convert share data to a share mnemonic. */
+        const valueWordCount = (0, utils_1.bitsToWords)(this.value.length * 8);
+        // Convert Buffer to big-endian integer (using BigInt to handle large values)
+        let valueInt = 0n;
+        for (let i = 0; i < this.value.length; i++) {
+            valueInt = (valueInt << 8n) | BigInt(this.value[i]);
+        }
+        // Convert BigInt to number array for _intToWordIndices
+        // For very large values, we need to handle this differently
+        const valueData = [];
+        let tempValue = valueInt;
+        for (let i = 0; i < valueWordCount; i++) {
+            valueData.unshift(Number(tempValue & 1023n));
+            tempValue = tempValue >> 10n;
+        }
+        const shareData = this._encodeIdExp().concat(this._encodeShareParams()).concat(valueData);
+        const checksum = rs1024.createChecksum(shareData, _customizationString(this.extendable));
+        return Array.from(wordlist.wordsFromIndices(shareData.concat(checksum)));
+    }
+    mnemonic() {
+        /** Convert share data to a share mnemonic. */
+        return this.words().join(' ');
+    }
+    static fromMnemonic(mnemonic) {
+        /** Convert a share mnemonic to share data. */
+        const mnemonicData = wordlist.mnemonicToIndices(mnemonic);
+        if (mnemonicData.length < constants_1.MIN_MNEMONIC_LENGTH_WORDS) {
+            throw new utils_1.MnemonicError(`Invalid mnemonic length. The length of each mnemonic ` +
+                `must be at least ${constants_1.MIN_MNEMONIC_LENGTH_WORDS} words.`);
+        }
+        const paddingLen = (constants_1.RADIX_BITS * (mnemonicData.length - constants_1.METADATA_LENGTH_WORDS)) % 16;
+        if (paddingLen > 8) {
+            throw new utils_1.MnemonicError('Invalid mnemonic length.');
+        }
+        const idExpData = mnemonicData.slice(0, constants_1.ID_EXP_LENGTH_WORDS);
+        const idExpInt = _intFromWordIndices(idExpData);
+        const identifier = idExpInt >> (constants_1.EXTENDABLE_FLAG_LENGTH_BITS + constants_1.ITERATION_EXP_LENGTH_BITS);
+        const extendable = Boolean((idExpInt >> constants_1.ITERATION_EXP_LENGTH_BITS) & 1);
+        const iterationExponent = idExpInt & ((1 << constants_1.ITERATION_EXP_LENGTH_BITS) - 1);
+        if (!rs1024.verifyChecksum(mnemonicData, _customizationString(extendable))) {
+            const prefix = mnemonic.split(/\s+/).slice(0, constants_1.ID_EXP_LENGTH_WORDS + 2).join(' ');
+            throw new utils_1.MnemonicError(`Invalid mnemonic checksum for "${prefix} ...".`);
+        }
+        const shareParamsData = mnemonicData.slice(constants_1.ID_EXP_LENGTH_WORDS, constants_1.ID_EXP_LENGTH_WORDS + 2);
+        const shareParamsInt = _intFromWordIndices(shareParamsData);
+        const shareParams = Array.from((0, utils_1.intToIndices)(shareParamsInt, 5, 4));
+        const [groupIndex, groupThreshold, groupCount, index, memberThreshold,] = shareParams;
+        if (groupCount < groupThreshold) {
+            const prefix = mnemonic.split(/\s+/).slice(0, constants_1.ID_EXP_LENGTH_WORDS + 2).join(' ');
+            throw new utils_1.MnemonicError(`Invalid mnemonic "${prefix} ...". Group threshold cannot be greater than group count.`);
+        }
+        const valueData = mnemonicData.slice(constants_1.ID_EXP_LENGTH_WORDS + 2, mnemonicData.length - rs1024.CHECKSUM_LENGTH_WORDS);
+        const valueByteCount = (0, utils_1.bitsToBytes)(constants_1.RADIX_BITS * valueData.length - paddingLen);
+        // Convert word indices to BigInt (base 1024)
+        let valueInt = 0n;
+        for (const index of valueData) {
+            valueInt = valueInt * 1024n + BigInt(index);
+        }
+        // Convert BigInt to Buffer in big-endian format
+        let value;
+        try {
+            value = Buffer.allocUnsafe(valueByteCount);
+            let tempValue = valueInt;
+            for (let i = valueByteCount - 1; i >= 0; i--) {
+                value[i] = Number(tempValue & 0xffn);
+                tempValue = tempValue >> 8n;
+            }
+            if (tempValue !== 0n) {
+                const prefix = mnemonic.split(/\s+/).slice(0, constants_1.ID_EXP_LENGTH_WORDS + 2).join(' ');
+                throw new utils_1.MnemonicError(`Invalid mnemonic padding for "${prefix} ...".`);
+            }
+        }
+        catch (error) {
+            if (error instanceof utils_1.MnemonicError) {
+                throw error;
+            }
+            const prefix = mnemonic.split(/\s+/).slice(0, constants_1.ID_EXP_LENGTH_WORDS + 2).join(' ');
+            throw new utils_1.MnemonicError(`Invalid mnemonic padding for "${prefix} ...".`);
+        }
+        return new Share(identifier, extendable, iterationExponent, groupIndex, groupThreshold + 1, groupCount + 1, index, memberThreshold + 1, value);
+    }
+}
+exports.Share = Share;
+//# sourceMappingURL=share.js.map

package/dist/share.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"share.js","sourceRoot":"","sources":["../src/share.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,iDAAmC;AACnC,qDAAuC;AACvC,2CAUqB;AACrB,mCAAgF;AAIhF,SAAS,iBAAiB,CAAC,KAAa,EAAE,MAAc;IACtD,oFAAoF;IACpF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAA,oBAAY,EAAC,KAAK,EAAE,MAAM,EAAE,sBAAU,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,mBAAmB,CAAC,OAA4B;IACvD,oFAAoF;IACpF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,KAAK,GAAG,KAAK,GAAG,iBAAK,GAAG,KAAK,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,oBAAoB,CAAC,UAAmB;IAC/C,OAAO,UAAU,CAAC,CAAC,CAAC,2CAA+B,CAAC,CAAC,CAAC,qCAAyB,CAAC;AAClF,CAAC;AAsBD,MAAa,KAAK;IAWhB,YACE,UAAkB,EAClB,UAAmB,EACnB,iBAAyB,EACzB,UAAkB,EAClB,cAAsB,EACtB,UAAkB,EAClB,KAAa,EACb,eAAuB,EACvB,KAAa;QAEb,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,gBAAgB;QACd,qEAAqE;QACrE,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;IACJ,CAAC;IAED,eAAe;QACb,+EAA+E;QAC/E,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,eAAe,EAAE,IAAI,CAAC,eAAe;SACtC,CAAC;IACJ,CAAC;IAED,YAAY;QACV,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,qCAAyB,GAAG,uCAA2B,CAAC,CAAC;QAC5F,QAAQ,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,qCAAyB,CAAC;QACnE,QAAQ,IAAI,IAAI,CAAC,iBAAiB,CAAC;QACnC,OAAO,iBAAiB,CAAC,QAAQ,EAAE,+BAAmB,CAAC,CAAC;IAC1D,CAAC;IAED,kBAAkB;QAChB,0CAA0C;QAC1C,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,GAAG,KAAK,CAAC,CAAC;QACV,GAAG,IAAI,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QAC/B,GAAG,KAAK,CAAC,CAAC;QACV,GAAG,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QAC3B,GAAG,KAAK,CAAC,CAAC;QACV,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC;QAClB,GAAG,KAAK,CAAC,CAAC;QACV,GAAG,IAAI,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QAChC,+BAA+B;QAC/B,OAAO,iBAAiB,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,KAAK;QACH,8CAA8C;QAC9C,MAAM,cAAc,GAAG,IAAA,mBAAW,EAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1D,6EAA6E;QAC7E,IAAI,QAAQ,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,QAAQ,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;QACD,uDAAuD;QACvD,4DAA4D;QAC5D,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,IAAI,SAAS,GAAG,QAAQ,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC;YAC7C,SAAS,GAAG,SAAS,IAAI,GAAG,CAAC;QAC/B,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC1F,MAAM,QAAQ,GAAG,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAEzF,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,QAAQ;QACN,8CAA8C;QAC9C,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,CAAC,YAAY,CAAC,QAAgB;QAClC,8CAA8C;QAC9C,MAAM,YAAY,GAAG,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAE1D,IAAI,YAAY,CAAC,MAAM,GAAG,qCAAyB,EAAE,CAAC;YACpD,MAAM,IAAI,qBAAa,CACrB,uDAAuD;gBACvD,oBAAoB,qCAAyB,SAAS,CACvD,CAAC;QACJ,CAAC;QAED,MAAM,UAAU,GAAG,CAAC,sBAAU,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,iCAAqB,CAAC,CAAC,GAAG,EAAE,CAAC;QACrF,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,qBAAa,CAAC,0BAA0B,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,+BAAmB,CAAC,CAAC;QAC7D,MAAM,QAAQ,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAEhD,MAAM,UAAU,GAAG,QAAQ,IAAI,CAAC,uCAA2B,GAAG,qCAAyB,CAAC,CAAC;QACzF,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,QAAQ,IAAI,qCAAyB,CAAC,GAAG,CAAC,CAAC,CAAC;QACxE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,qCAAyB,CAAC,GAAG,CAAC,CAAC,CAAC;QAE5E,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,EAAE,oBAAoB,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;YAC3E,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,+BAAmB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjF,MAAM,IAAI,qBAAa,CACrB,kCAAkC,MAAM,QAAQ,CACjD,CAAC;QACJ,CAAC;QAED,MAAM,eAAe,GAAG,YAAY,CAAC,KAAK,CAAC,+BAAmB,EAAE,+BAAmB,GAAG,CAAC,CAAC,CAAC;QACzF,MAAM,cAAc,GAAG,mBAAmB,CAAC,eAAe,CAAC,CAAC;QAC5D,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,IAAA,oBAAY,EAAC,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,CACJ,UAAU,EACV,cAAc,EACd,UAAU,EACV,KAAK,EACL,eAAe,EAChB,GAAG,WAAW,CAAC;QAEhB,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,+BAAmB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjF,MAAM,IAAI,qBAAa,CACrB,qBAAqB,MAAM,4DAA4D,CACxF,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,CAClC,+BAAmB,GAAG,CAAC,EACvB,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC,qBAAqB,CACnD,CAAC;QACF,MAAM,cAAc,GAAG,IAAA,mBAAW,EAAC,sBAAU,GAAG,SAAS,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;QAE/E,6CAA6C;QAC7C,IAAI,QAAQ,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,QAAQ,GAAG,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QAED,gDAAgD;QAChD,IAAI,KAAa,CAAC;QAClB,IAAI,CAAC;YACH,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;YAC3C,IAAI,SAAS,GAAG,QAAQ,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC;gBACrC,SAAS,GAAG,SAAS,IAAI,EAAE,CAAC;YAC9B,CAAC;YAED,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;gBACrB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,+BAAmB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjF,MAAM,IAAI,qBAAa,CACrB,iCAAiC,MAAM,QAAQ,CAChD,CAAC;YACJ,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,qBAAa,EAAE,CAAC;gBACnC,MAAM,KAAK,CAAC;YACd,CAAC;YACD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,+BAAmB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjF,MAAM,IAAI,qBAAa,CACrB,iCAAiC,MAAM,QAAQ,CAChD,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,KAAK,CACd,UAAU,EACV,UAAU,EACV,iBAAiB,EACjB,UAAU,EACV,cAAc,GAAG,CAAC,EAClB,UAAU,GAAG,CAAC,EACd,KAAK,EACL,eAAe,GAAG,CAAC,EACnB,KAAK,CACN,CAAC;IACJ,CAAC;CACF;AA7MD,sBA6MC"}

package/dist/src/cipher.js

@@ -0,0 +1,90 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.encrypt = encrypt;
+exports.decrypt = decrypt;
+var crypto = __importStar(require("crypto"));
+var constants_1 = require("./constants");
+var utils_1 = require("./utils");
+function _xor(a, b) {
+    var result = Buffer.alloc(a.length);
+    for (var i = 0; i < a.length; i++) {
+        result[i] = a[i] ^ b[i];
+    }
+    return result;
+}
+function _roundFunction(i, passphrase, e, salt, r) {
+    /** The round function used internally by the Feistel cipher. */
+    return crypto.pbkdf2Sync(Buffer.concat([Buffer.from([i]), passphrase]), Buffer.concat([salt, r]), (constants_1.BASE_ITERATION_COUNT << e) / constants_1.ROUND_COUNT, r.length, 'sha256');
+}
+function _getSalt(identifier, extendable) {
+    if (extendable) {
+        return Buffer.alloc(0);
+    }
+    var identifierLen = (0, utils_1.bitsToBytes)(constants_1.ID_LENGTH_BITS);
+    var identifierBuf = Buffer.allocUnsafe(identifierLen);
+    identifierBuf.writeUIntBE(identifier, 0, identifierLen);
+    return Buffer.concat([constants_1.CUSTOMIZATION_STRING_ORIG, identifierBuf]);
+}
+function encrypt(masterSecret, passphrase, iterationExponent, identifier, extendable) {
+    if (masterSecret.length % 2 !== 0) {
+        throw new Error('The length of the master secret in bytes must be an even number.');
+    }
+    var l = masterSecret.slice(0, masterSecret.length / 2);
+    var r = masterSecret.slice(masterSecret.length / 2);
+    var salt = _getSalt(identifier, extendable);
+    for (var i = 0; i < constants_1.ROUND_COUNT; i++) {
+        var f = _roundFunction(i, passphrase, iterationExponent, salt, r);
+        var temp = l;
+        l = r;
+        r = _xor(temp, f);
+    }
+    return Buffer.concat([r, l]);
+}
+function decrypt(encryptedMasterSecret, passphrase, iterationExponent, identifier, extendable) {
+    if (encryptedMasterSecret.length % 2 !== 0) {
+        throw new Error('The length of the encrypted master secret in bytes must be an even number.');
+    }
+    var l = encryptedMasterSecret.slice(0, encryptedMasterSecret.length / 2);
+    var r = encryptedMasterSecret.slice(encryptedMasterSecret.length / 2);
+    var salt = _getSalt(identifier, extendable);
+    for (var i = constants_1.ROUND_COUNT - 1; i >= 0; i--) {
+        var f = _roundFunction(i, passphrase, iterationExponent, salt, r);
+        var temp = l;
+        l = r;
+        r = _xor(temp, f);
+    }
+    return Buffer.concat([r, l]);
+}

package/dist/src/constants.js

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DIGEST_INDEX = exports.SECRET_INDEX = exports.ROUND_COUNT = exports.BASE_ITERATION_COUNT = exports.MIN_MNEMONIC_LENGTH_WORDS = exports.MIN_STRENGTH_BITS = exports.METADATA_LENGTH_WORDS = exports.GROUP_PREFIX_LENGTH_WORDS = exports.CUSTOMIZATION_STRING_EXTENDABLE = exports.CUSTOMIZATION_STRING_ORIG = exports.DIGEST_LENGTH_BYTES = exports.CHECKSUM_LENGTH_WORDS = exports.MAX_SHARE_COUNT = exports.ID_EXP_LENGTH_WORDS = exports.ITERATION_EXP_LENGTH_BITS = exports.EXTENDABLE_FLAG_LENGTH_BITS = exports.ID_LENGTH_BITS = exports.RADIX = exports.RADIX_BITS = void 0;
+var utils_1 = require("./utils");
+exports.RADIX_BITS = 10;
+/** The length of the radix in bits. */
+exports.RADIX = Math.pow(2, exports.RADIX_BITS);
+/** The number of words in the wordlist. */
+exports.ID_LENGTH_BITS = 15;
+/** The length of the random identifier in bits. */
+exports.EXTENDABLE_FLAG_LENGTH_BITS = 1;
+/** The length of the extendable backup flag in bits. */
+exports.ITERATION_EXP_LENGTH_BITS = 4;
+/** The length of the iteration exponent in bits. */
+exports.ID_EXP_LENGTH_WORDS = (0, utils_1.bitsToWords)(exports.ID_LENGTH_BITS + exports.EXTENDABLE_FLAG_LENGTH_BITS + exports.ITERATION_EXP_LENGTH_BITS);
+/** The length of the random identifier, extendable backup flag and iteration exponent in words. */
+exports.MAX_SHARE_COUNT = 16;
+/** The maximum number of shares that can be created. */
+exports.CHECKSUM_LENGTH_WORDS = 3;
+/** The length of the RS1024 checksum in words. */
+exports.DIGEST_LENGTH_BYTES = 4;
+/** The length of the digest of the shared secret in bytes. */
+exports.CUSTOMIZATION_STRING_ORIG = Buffer.from('shamir', 'utf8');
+/** The customization string used in the RS1024 checksum and in the PBKDF2 salt for
+shares _without_ the extendable backup flag. */
+exports.CUSTOMIZATION_STRING_EXTENDABLE = Buffer.from('shamir_extendable', 'utf8');
+/** The customization string used in the RS1024 checksum for
+shares _with_ the extendable backup flag. */
+exports.GROUP_PREFIX_LENGTH_WORDS = exports.ID_EXP_LENGTH_WORDS + 1;
+/** The length of the prefix of the mnemonic that is common to a share group. */
+exports.METADATA_LENGTH_WORDS = exports.ID_EXP_LENGTH_WORDS + 2 + exports.CHECKSUM_LENGTH_WORDS;
+/** The length of the mnemonic in words without the share value. */
+exports.MIN_STRENGTH_BITS = 128;
+/** The minimum allowed entropy of the master secret. */
+exports.MIN_MNEMONIC_LENGTH_WORDS = exports.METADATA_LENGTH_WORDS + (0, utils_1.bitsToWords)(exports.MIN_STRENGTH_BITS);
+/** The minimum allowed length of the mnemonic in words. */
+exports.BASE_ITERATION_COUNT = 10000;
+/** The minimum number of iterations to use in PBKDF2. */
+exports.ROUND_COUNT = 4;
+/** The number of rounds to use in the Feistel cipher. */
+exports.SECRET_INDEX = 255;
+/** The index of the share containing the shared secret. */
+exports.DIGEST_INDEX = 254;
+/** The index of the share containing the digest of the shared secret. */

package/dist/src/index.js

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UNDETERMINED = exports.RecoveryState = exports.MnemonicError = exports.Share = exports.RANDOM_BYTES = exports.recoverEms = exports.splitEms = exports.generateMnemonics = exports.decodeMnemonics = exports.combineMnemonics = exports.ShareGroup = exports.EncryptedMasterSecret = exports.decrypt = exports.encrypt = void 0;
+var cipher_1 = require("./cipher");
+Object.defineProperty(exports, "encrypt", { enumerable: true, get: function () { return cipher_1.encrypt; } });
+Object.defineProperty(exports, "decrypt", { enumerable: true, get: function () { return cipher_1.decrypt; } });
+var shamir_1 = require("./shamir");
+Object.defineProperty(exports, "EncryptedMasterSecret", { enumerable: true, get: function () { return shamir_1.EncryptedMasterSecret; } });
+Object.defineProperty(exports, "ShareGroup", { enumerable: true, get: function () { return shamir_1.ShareGroup; } });
+Object.defineProperty(exports, "combineMnemonics", { enumerable: true, get: function () { return shamir_1.combineMnemonics; } });
+Object.defineProperty(exports, "decodeMnemonics", { enumerable: true, get: function () { return shamir_1.decodeMnemonics; } });
+Object.defineProperty(exports, "generateMnemonics", { enumerable: true, get: function () { return shamir_1.generateMnemonics; } });
+Object.defineProperty(exports, "splitEms", { enumerable: true, get: function () { return shamir_1.splitEms; } });
+Object.defineProperty(exports, "recoverEms", { enumerable: true, get: function () { return shamir_1.recoverEms; } });
+Object.defineProperty(exports, "RANDOM_BYTES", { enumerable: true, get: function () { return shamir_1.RANDOM_BYTES; } });
+var share_1 = require("./share");
+Object.defineProperty(exports, "Share", { enumerable: true, get: function () { return share_1.Share; } });
+var utils_1 = require("./utils");
+Object.defineProperty(exports, "MnemonicError", { enumerable: true, get: function () { return utils_1.MnemonicError; } });
+var recovery_1 = require("./recovery");
+Object.defineProperty(exports, "RecoveryState", { enumerable: true, get: function () { return recovery_1.RecoveryState; } });
+Object.defineProperty(exports, "UNDETERMINED", { enumerable: true, get: function () { return recovery_1.UNDETERMINED; } });

package/dist/src/recovery.js

@@ -0,0 +1,127 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecoveryState = exports.UNDETERMINED = void 0;
+var constants_1 = require("./constants");
+var shamir_1 = require("./shamir");
+var share_1 = require("./share");
+var utils_1 = require("./utils");
+exports.UNDETERMINED = -1;
+var RecoveryState = /** @class */ (function () {
+    function RecoveryState() {
+        /** Object for keeping track of running Shamir recovery. */
+        this.lastShare = null;
+        this.groups = new Map();
+        this.parameters = null;
+    }
+    RecoveryState.prototype.groupPrefix = function (groupIndex) {
+        /** Return three starting words of a given group. */
+        if (!this.lastShare) {
+            throw new Error('Add at least one share first');
+        }
+        // Create a fake share with the requested group index
+        var fakeShare = new share_1.Share(this.lastShare.identifier, this.lastShare.extendable, this.lastShare.iterationExponent, groupIndex, this.lastShare.groupThreshold, this.lastShare.groupCount, this.lastShare.index, this.lastShare.memberThreshold, this.lastShare.value);
+        return fakeShare.words().slice(0, constants_1.GROUP_PREFIX_LENGTH_WORDS).join(' ');
+    };
+    RecoveryState.prototype.groupStatus = function (groupIndex) {
+        /** Return completion status of given group.
+         *
+         * Result consists of the number of shares already entered, and the threshold
+         * for recovering the group.
+         */
+        var group = this.groups.get(groupIndex);
+        if (!group || group.isEmpty) {
+            return [0, exports.UNDETERMINED];
+        }
+        return [group.length, group.memberThreshold()];
+    };
+    RecoveryState.prototype.groupIsComplete = function (groupIndex) {
+        /** Check whether a given group is already complete. */
+        var group = this.groups.get(groupIndex);
+        return group ? group.isComplete() : false;
+    };
+    RecoveryState.prototype.groupsComplete = function () {
+        /** Return the number of groups that are already complete. */
+        if (this.parameters === null) {
+            return 0;
+        }
+        var count = 0;
+        for (var i = 0; i < this.parameters.groupCount; i++) {
+            if (this.groupIsComplete(i)) {
+                count++;
+            }
+        }
+        return count;
+    };
+    RecoveryState.prototype.isComplete = function () {
+        /** Check whether the recovery set is complete.
+         *
+         * That is, at least M groups must be complete, where M is the global threshold.
+         */
+        if (this.parameters === null) {
+            return false;
+        }
+        return this.groupsComplete() >= this.parameters.groupThreshold;
+    };
+    RecoveryState.prototype.matches = function (share) {
+        /** Check whether the provided share matches the current set, i.e., has the same
+         * common parameters.
+         */
+        if (this.parameters === null) {
+            return true;
+        }
+        var shareParams = share.commonParameters();
+        return (shareParams.identifier === this.parameters.identifier &&
+            shareParams.extendable === this.parameters.extendable &&
+            shareParams.iterationExponent === this.parameters.iterationExponent &&
+            shareParams.groupThreshold === this.parameters.groupThreshold &&
+            shareParams.groupCount === this.parameters.groupCount);
+    };
+    RecoveryState.prototype.addShare = function (share) {
+        /** Add a share to the recovery set. */
+        if (!this.matches(share)) {
+            throw new utils_1.MnemonicError('This mnemonic is not part of the current set. Please try again.');
+        }
+        if (!this.groups.has(share.groupIndex)) {
+            this.groups.set(share.groupIndex, new shamir_1.ShareGroup());
+        }
+        var group = this.groups.get(share.groupIndex);
+        group.add(share);
+        this.lastShare = share;
+        if (this.parameters === null) {
+            this.parameters = share.commonParameters();
+        }
+        return true;
+    };
+    RecoveryState.prototype.has = function (obj) {
+        if (!this.matches(obj)) {
+            return false;
+        }
+        if (this.groups.size === 0) {
+            return false;
+        }
+        var group = this.groups.get(obj.groupIndex);
+        return group ? group.has(obj) : false;
+    };
+    RecoveryState.prototype.recover = function (passphrase) {
+        /** Recover the master secret, given a passphrase. */
+        // Select a subset of shares which meets the thresholds.
+        var reducedGroups = new Map();
+        for (var _i = 0, _a = this.groups.entries(); _i < _a.length; _i++) {
+            var _b = _a[_i], groupIndex = _b[0], group = _b[1];
+            if (group.isComplete()) {
+                reducedGroups.set(groupIndex, group.getMinimalGroup());
+            }
+            // some groups have been added so parameters must be known
+            if (this.parameters === null) {
+                throw new Error('Parameters should be known at this point');
+            }
+            if (reducedGroups.size >= this.parameters.groupThreshold) {
+                break;
+            }
+        }
+        var encryptedMasterSecret = (0, shamir_1.recoverEms)(reducedGroups);
+        return encryptedMasterSecret.decrypt(passphrase);
+    };
+    return RecoveryState;
+}());
+exports.RecoveryState = RecoveryState;

package/dist/src/rs1024.js

@@ -0,0 +1,55 @@
+"use strict";
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CHECKSUM_LENGTH_WORDS = void 0;
+exports.createChecksum = createChecksum;
+exports.verifyChecksum = verifyChecksum;
+var constants_1 = require("./constants");
+Object.defineProperty(exports, "CHECKSUM_LENGTH_WORDS", { enumerable: true, get: function () { return constants_1.CHECKSUM_LENGTH_WORDS; } });
+function _polymod(values) {
+    var GEN = [
+        0xE0E040,
+        0x1C1C080,
+        0x3838100,
+        0x7070200,
+        0xE0E0009,
+        0x1C0C2412,
+        0x38086C24,
+        0x3090FC48,
+        0x21B1F890,
+        0x3F3F120,
+    ];
+    var chk = 1;
+    for (var _i = 0, values_1 = values; _i < values_1.length; _i++) {
+        var v = values_1[_i];
+        var b = chk >> 20;
+        chk = ((chk & 0xFFFFF) << 10) ^ v;
+        for (var i = 0; i < 10; i++) {
+            if ((b >> i) & 1) {
+                chk ^= GEN[i];
+            }
+        }
+    }
+    return chk;
+}
+function createChecksum(data, customizationString) {
+    var values = __spreadArray(__spreadArray(__spreadArray([], Array.from(customizationString), true), Array.from(data), true), Array(constants_1.CHECKSUM_LENGTH_WORDS).fill(0), true);
+    var polymod = _polymod(values) ^ 1;
+    var checksum = [];
+    for (var i = constants_1.CHECKSUM_LENGTH_WORDS - 1; i >= 0; i--) {
+        checksum.push((polymod >> (10 * i)) & 1023);
+    }
+    return checksum;
+}
+function verifyChecksum(data, customizationString) {
+    var values = __spreadArray(__spreadArray([], Array.from(customizationString), true), Array.from(data), true);
+    return _polymod(values) === 1;
+}