shamir-mnemonic-ts 1.0.0

package/dist/src/utils.js

@@ -0,0 +1,97 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MnemonicError = void 0;
+exports.bitsToBytes = bitsToBytes;
+exports.bitsToWords = bitsToWords;
+exports.intToIndices = intToIndices;
+var MnemonicError = /** @class */ (function (_super) {
+    __extends(MnemonicError, _super);
+    function MnemonicError(message) {
+        var _this = _super.call(this, message) || this;
+        _this.name = 'MnemonicError';
+        return _this;
+    }
+    return MnemonicError;
+}(Error));
+exports.MnemonicError = MnemonicError;
+function _roundBits(n, radixBits) {
+    /** Get the number of `radixBits`-sized digits required to store a `n`-bit value. */
+    return Math.ceil(n / radixBits);
+}
+function bitsToBytes(n) {
+    /** Round up bit count to whole bytes. */
+    return _roundBits(n, 8);
+}
+function bitsToWords(n) {
+    /** Round up bit count to a multiple of word size. */
+    // Import constants here to handle circular dependency
+    // This will work as long as calls to bitsToWords only happen *after* RADIX_BITS are declared
+    var RADIX_BITS = require('./constants').RADIX_BITS;
+    if (!RADIX_BITS) {
+        throw new Error('Declare RADIX_BITS *before* calling this');
+    }
+    return _roundBits(n, RADIX_BITS);
+}
+function intToIndices(value, length, radixBits) {
+    var mask, i;
+    return __generator(this, function (_a) {
+        switch (_a.label) {
+            case 0:
+                mask = (1 << radixBits) - 1;
+                i = length - 1;
+                _a.label = 1;
+            case 1:
+                if (!(i >= 0)) return [3 /*break*/, 4];
+                return [4 /*yield*/, (value >> (i * radixBits)) & mask];
+            case 2:
+                _a.sent();
+                _a.label = 3;
+            case 3:
+                i--;
+                return [3 /*break*/, 1];
+            case 4: return [2 /*return*/];
+        }
+    });
+}

package/dist/src/wordlist.js

@@ -0,0 +1,136 @@
+"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;
+    };
+})();
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.wordsFromIndices = wordsFromIndices;
+exports.mnemonicFromIndices = mnemonicFromIndices;
+exports.mnemonicToIndices = mnemonicToIndices;
+var fs = __importStar(require("fs"));
+var path = __importStar(require("path"));
+var constants_1 = require("./constants");
+var utils_1 = require("./utils");
+function _loadWordlist() {
+    // Try multiple possible paths for wordlist.txt
+    var wordlistPath = path.join(__dirname, 'wordlist.txt');
+    if (!fs.existsSync(wordlistPath)) {
+        // Fallback: try parent directory (for compiled output)
+        wordlistPath = path.join(__dirname, '..', 'src', 'wordlist.txt');
+    }
+    if (!fs.existsSync(wordlistPath)) {
+        // Another fallback: try current directory
+        wordlistPath = path.join(process.cwd(), 'src', 'wordlist.txt');
+    }
+    var wordlistContent = fs.readFileSync(wordlistPath, 'utf8');
+    var wordlist = wordlistContent
+        .split('\n')
+        .map(function (word) { return word.trim(); })
+        .filter(function (word) { return word.length > 0; });
+    if (wordlist.length !== constants_1.RADIX) {
+        throw new Error("The wordlist should contain ".concat(constants_1.RADIX, " words, but it contains ").concat(wordlist.length, " words."));
+    }
+    var wordIndexMap = new Map();
+    wordlist.forEach(function (word, index) {
+        wordIndexMap.set(word, index);
+    });
+    return [wordlist, wordIndexMap];
+}
+var _a = _loadWordlist(), WORDLIST = _a[0], WORD_INDEX_MAP = _a[1];
+function wordsFromIndices(indices) {
+    var _i, indices_1, i;
+    return __generator(this, function (_a) {
+        switch (_a.label) {
+            case 0:
+                _i = 0, indices_1 = indices;
+                _a.label = 1;
+            case 1:
+                if (!(_i < indices_1.length)) return [3 /*break*/, 4];
+                i = indices_1[_i];
+                return [4 /*yield*/, WORDLIST[i]];
+            case 2:
+                _a.sent();
+                _a.label = 3;
+            case 3:
+                _i++;
+                return [3 /*break*/, 1];
+            case 4: return [2 /*return*/];
+        }
+    });
+}
+function mnemonicFromIndices(indices) {
+    return Array.from(wordsFromIndices(indices)).join(' ');
+}
+function mnemonicToIndices(mnemonic) {
+    try {
+        return mnemonic.split(/\s+/).map(function (word) {
+            var index = WORD_INDEX_MAP.get(word.toLowerCase());
+            if (index === undefined) {
+                throw new utils_1.MnemonicError("Invalid mnemonic word ".concat(word, "."));
+            }
+            return index;
+        });
+    }
+    catch (error) {
+        if (error instanceof utils_1.MnemonicError) {
+            throw error;
+        }
+        throw new utils_1.MnemonicError("Invalid mnemonic word.");
+    }
+}

package/dist/test-manual.js

@@ -0,0 +1,78 @@
+"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 });
+var crypto = __importStar(require("crypto"));
+var shamir = __importStar(require("./index"));
+// Exemple 1 : Partage basique sans passphrase
+console.log('=== Test 1 : Partage basique ===');
+var masterSecret = Buffer.from('ABCDEFGHIJKLMNOP', 'utf8');
+var mnemonics = shamir.generateMnemonics(1, // group threshold (1 groupe requis)
+[[3, 5]], // (member threshold, member count) = 3 sur 5 parts nécessaires
+masterSecret);
+console.log('Mnemonics générés:');
+mnemonics[0].forEach(function (mnemonic, index) {
+    console.log("  Part ".concat(index + 1, ": ").concat(mnemonic));
+});
+// Récupération avec 3 parts (minimum requis)
+var recovered1 = shamir.combineMnemonics(mnemonics[0].slice(0, 3));
+console.log('\nSecret récupéré (avec parts 1-3):', recovered1.toString('utf8'));
+console.log('Égal au secret original?', recovered1.equals(masterSecret));
+// Récupération avec 3 autres parts
+var recovered2 = shamir.combineMnemonics(mnemonics[0].slice(2, 5));
+console.log('\nSecret récupéré (avec parts 3-5):', recovered2.toString('utf8'));
+console.log('Égal au secret original?', recovered2.equals(masterSecret));
+// Exemple 2 : Avec passphrase
+console.log('\n=== Test 2 : Avec passphrase ===');
+var passphrase = Buffer.from('mon-mot-de-passe', 'utf8');
+var mnemonicsWithPass = shamir.generateMnemonics(1, [[3, 5]], masterSecret, passphrase);
+console.log('Mnemonics avec passphrase:');
+mnemonicsWithPass[0].slice(0, 3).forEach(function (mnemonic, index) {
+    console.log("  Part ".concat(index + 1, ": ").concat(mnemonic));
+});
+var recoveredWithPass = shamir.combineMnemonics(mnemonicsWithPass[0].slice(0, 3), passphrase);
+console.log('\nSecret récupéré avec passphrase:', recoveredWithPass.toString('utf8'));
+console.log('Égal au secret original?', recoveredWithPass.equals(masterSecret));
+// Exemple 3 : Secret aléatoire
+console.log('\n=== Test 3 : Secret aléatoire ===');
+var randomSecret = crypto.randomBytes(16);
+var randomMnemonics = shamir.generateMnemonics(1, [[2, 3]], randomSecret)[0];
+console.log('Secret aléatoire (hex):', randomSecret.toString('hex'));
+console.log('Mnemonics:');
+randomMnemonics.forEach(function (mnemonic, index) {
+    console.log("  Part ".concat(index + 1, ": ").concat(mnemonic));
+});
+var recoveredRandom = shamir.combineMnemonics(randomMnemonics.slice(0, 2));
+console.log('\nSecret récupéré (hex):', recoveredRandom.toString('hex'));
+console.log('Égal au secret original?', recoveredRandom.equals(randomSecret));

package/dist/utils.d.ts

@@ -0,0 +1,7 @@
+export declare class MnemonicError extends Error {
+    constructor(message?: string);
+}
+export declare function bitsToBytes(n: number): number;
+export declare function bitsToWords(n: number): number;
+export declare function intToIndices(value: number, length: number, radixBits: number): Generator<number>;
+//# sourceMappingURL=utils.d.ts.map

package/dist/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA,qBAAa,aAAc,SAAQ,KAAK;gBAC1B,OAAO,CAAC,EAAE,MAAM;CAI7B;AAOD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAG7C;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAW7C;AAED,wBAAiB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAMjG"}

package/dist/utils.js

@@ -0,0 +1,39 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MnemonicError = void 0;
+exports.bitsToBytes = bitsToBytes;
+exports.bitsToWords = bitsToWords;
+exports.intToIndices = intToIndices;
+class MnemonicError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'MnemonicError';
+    }
+}
+exports.MnemonicError = MnemonicError;
+function _roundBits(n, radixBits) {
+    /** Get the number of `radixBits`-sized digits required to store a `n`-bit value. */
+    return Math.ceil(n / radixBits);
+}
+function bitsToBytes(n) {
+    /** Round up bit count to whole bytes. */
+    return _roundBits(n, 8);
+}
+function bitsToWords(n) {
+    /** Round up bit count to a multiple of word size. */
+    // Import constants here to handle circular dependency
+    // This will work as long as calls to bitsToWords only happen *after* RADIX_BITS are declared
+    const { RADIX_BITS } = require('./constants');
+    if (!RADIX_BITS) {
+        throw new Error('Declare RADIX_BITS *before* calling this');
+    }
+    return _roundBits(n, RADIX_BITS);
+}
+function* intToIndices(value, length, radixBits) {
+    /** Convert an integer value to indices in big endian order. */
+    const mask = (1 << radixBits) - 1;
+    for (let i = length - 1; i >= 0; i--) {
+        yield (value >> (i * radixBits)) & mask;
+    }
+}
+//# sourceMappingURL=utils.js.map

package/dist/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":";;;AAYA,kCAGC;AAED,kCAWC;AAED,oCAMC;AApCD,MAAa,aAAc,SAAQ,KAAK;IACtC,YAAY,OAAgB;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC;IAC9B,CAAC;CACF;AALD,sCAKC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,SAAiB;IAC9C,oFAAoF;IACpF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;AAClC,CAAC;AAED,SAAgB,WAAW,CAAC,CAAS;IACnC,yCAAyC;IACzC,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,SAAgB,WAAW,CAAC,CAAS;IACnC,qDAAqD;IACrD,sDAAsD;IACtD,6FAA6F;IAC7F,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;IAE9C,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;AACnC,CAAC;AAED,QAAe,CAAC,CAAC,YAAY,CAAC,KAAa,EAAE,MAAc,EAAE,SAAiB;IAC5E,+DAA+D;IAC/D,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC;IAC1C,CAAC;AACH,CAAC"}

package/dist/wordlist.d.ts

@@ -0,0 +1,4 @@
+export declare function wordsFromIndices(indices: Iterable<number>): Generator<string>;
+export declare function mnemonicFromIndices(indices: Iterable<number>): string;
+export declare function mnemonicToIndices(mnemonic: string): number[];
+//# sourceMappingURL=wordlist.d.ts.map

package/dist/wordlist.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"wordlist.d.ts","sourceRoot":"","sources":["../src/wordlist.ts"],"names":[],"mappings":"AAohCA,wBAAiB,gBAAgB,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAI9E;AAED,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,MAAM,CAErE;AAED,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAe5D"}