capacitor-shamir
Version:
Provides Shamir's Secret Sharing (SSS) functionality for secure splitting and recovering secrets natively on iOS, Android, and Web.
646 lines (634 loc) • 26.7 kB
JavaScript
var capacitorShamir = (function (exports, core) {
'use strict';
const Shamir = core.registerPlugin('Shamir', {
web: () => Promise.resolve().then(function () { return web; }).then((m) => new m.ShamirWeb()),
});
const updateShamirWebFsIndexedDbConfig = (config) => {
Shamir.updateShamirWebFsIndexedDbConfig(config);
};
const toBase64 = (input) => {
const isBrowser = typeof btoa !== 'undefined';
return isBrowser
? btoa(decodeLatin1(input))
: Buffer.from(decodeLatin1(input), 'latin1').toString('base64');
};
const fromBase64 = (input) => {
const isBrowser = typeof btoa !== 'undefined';
return isBrowser
? encodeLatin1(atob(input))
: encodeLatin1(Buffer.from(input, 'base64').toString('latin1'));
};
const encodeLatin1 = (data) => {
const result = new Uint8Array(data.length);
for (let i = 0; i < data.length; i++) {
const c = data.charCodeAt(i);
if ((c & 0xff) !== c)
throw { message: 'Cannot encode string in Latin1', str: data };
result[i] = c & 0xff;
}
return result;
};
const decodeLatin1 = (data) => {
const encoded = [];
for (const byte of data) {
encoded.push(String.fromCharCode(byte));
}
return encoded.join('');
};
/**
* Simple IndexedDB Key-Value Storage
*
* IndexedDB, as a transactional database, has a somewhat clunky API.
* This service provides a localStorage-like interface for IndexedDB, wrapped in promises.
*
* localStorage has a very low storage limit (5MB), so during development it may not be
* sufficient to store all the data required for the app to function properly.
*/
class IndexedDbFileStorage {
constructor() {
this.config = {
dbName: 'Disc',
version: 1,
storeName: 'FileStorage',
};
}
async setItem(data) {
const db = await this.openDB();
const tx = db.transaction(this.config.storeName, 'readwrite');
const store = tx.objectStore(this.config.storeName);
const request = store.put(data);
await this.handleDBRequest(request, db);
}
async getItem(path) {
const db = await this.openDB();
const tx = db.transaction(this.config.storeName, 'readonly');
const store = tx.objectStore(this.config.storeName);
const request = store.get(path);
const result = await this.handleDBRequest(request, db);
if (result === undefined) {
return null;
}
return result;
}
async removeItem(path) {
const db = await this.openDB();
const tx = db.transaction(this.config.storeName, 'readwrite');
const store = tx.objectStore(this.config.storeName);
const request = store.delete(path);
await this.handleDBRequest(request, db);
}
updateIndexedDbConfig(config) {
this.config = Object.assign(Object.assign({}, this.config), config);
}
async openDB() {
return new Promise((resolve, reject) => {
const request = indexedDB.open(this.config.dbName, this.config.version);
request.onupgradeneeded = () => {
const db = request.result;
if (!db.objectStoreNames.contains(this.config.storeName)) {
db.createObjectStore(this.config.storeName, { keyPath: 'path' });
}
};
request.onsuccess = () => resolve(request.result);
request.onerror = () => reject(request.error);
});
}
/**
* Handle database request promise with proper cleanup
* @param request The database request to handle
* @param db The database instance to close
*/
handleDBRequest(request, db) {
return new Promise((resolve, reject) => {
request.onsuccess = () => {
db.close();
resolve(request.result);
};
request.onerror = () => {
db.close();
reject(request.error);
};
});
}
}
class FileSystemMock {
constructor() {
this.indexedStorage = new IndexedDbFileStorage();
}
static getInstance() {
if (!FileSystemMock.instance) {
FileSystemMock.instance = new FileSystemMock();
}
return FileSystemMock.instance;
}
async read(path, offset, count) {
path = this.removeExtraSlashes(path);
const foundFile = await this.indexedStorage.getItem(path);
if (!foundFile) {
throw new Error('[FilesystemMock] File not found');
}
let content = fromBase64(foundFile.content);
// cut everything up to offset
if (offset) {
content = content.slice(offset);
}
// cut everything after count
if (count) {
content = content.slice(undefined, count);
}
return content;
}
async write(path, data, append) {
path = this.removeExtraSlashes(path);
let file = await this.indexedStorage.getItem(path);
if (file) {
if (append) {
const currentData = fromBase64(file.content);
const appended = new Uint8Array(currentData.length + data.length);
appended.set(currentData);
appended.set(data, currentData.length);
file.content = toBase64(appended);
}
else {
file.content = toBase64(data);
}
}
else {
file = {
path: path,
mtime: new Date().getTime(),
content: toBase64(data),
};
}
await this.indexedStorage.setItem(file);
}
async remove(path) {
path = this.removeExtraSlashes(path);
await this.indexedStorage.removeItem(path);
}
updateIndexedDbConfig(config) {
this.indexedStorage.updateIndexedDbConfig(config);
}
removeExtraSlashes(path) {
return path.replace(new RegExp('/{2,}', 'g'), '/');
}
}
/*
* This file includes code derived from https://github.com/simbo1905/shamir licensed under the Apache License, Version 2.0.
* You may obtain a copy of the license at http://www.apache.org/licenses/LICENSE-2.0
*
* Modifications:
* - translated to TypeScript
* - added partIdx parameter to interpolate function
*/
function add(a, b) {
return a ^ b;
}
/* The Laws of Cryptograhy with Java Code by Neal R. Wagner
http://www.cs.utsa.edu/~wagner/lawsbookcolor/laws.pdf
Page 120 (134) section "20.3 Addition in GP(2^n)" is equal \
to subtraction.
*/
function sub(a, b) {
return add(a, b);
}
const LOG = new Uint8Array([
0xff, 0x00, 0x19, 0x01, 0x32, 0x02, 0x1a,
0xc6, 0x4b, 0xc7, 0x1b, 0x68, 0x33, 0xee,
0xdf, 0x03, 0x64, 0x04, 0xe0, 0x0e, 0x34,
0x8d, 0x81, 0xef, 0x4c, 0x71, 0x08, 0xc8,
0xf8, 0x69, 0x1c, 0xc1, 0x7d, 0xc2, 0x1d,
0xb5, 0xf9, 0xb9, 0x27, 0x6a, 0x4d, 0xe4,
0xa6, 0x72, 0x9a, 0xc9, 0x09, 0x78, 0x65,
0x2f, 0x8a, 0x05, 0x21, 0x0f, 0xe1, 0x24,
0x12, 0xf0, 0x82, 0x45, 0x35, 0x93, 0xda,
0x8e, 0x96, 0x8f, 0xdb, 0xbd, 0x36, 0xd0,
0xce, 0x94, 0x13, 0x5c, 0xd2, 0xf1, 0x40,
0x46, 0x83, 0x38, 0x66, 0xdd, 0xfd, 0x30,
0xbf, 0x06, 0x8b, 0x62, 0xb3, 0x25, 0xe2,
0x98, 0x22, 0x88, 0x91, 0x10, 0x7e, 0x6e,
0x48, 0xc3, 0xa3, 0xb6, 0x1e, 0x42, 0x3a,
0x6b, 0x28, 0x54, 0xfa, 0x85, 0x3d, 0xba,
0x2b, 0x79, 0x0a, 0x15, 0x9b, 0x9f, 0x5e,
0xca, 0x4e, 0xd4, 0xac, 0xe5, 0xf3, 0x73,
0xa7, 0x57, 0xaf, 0x58, 0xa8, 0x50, 0xf4,
0xea, 0xd6, 0x74, 0x4f, 0xae, 0xe9, 0xd5,
0xe7, 0xe6, 0xad, 0xe8, 0x2c, 0xd7, 0x75,
0x7a, 0xeb, 0x16, 0x0b, 0xf5, 0x59, 0xcb,
0x5f, 0xb0, 0x9c, 0xa9, 0x51, 0xa0, 0x7f,
0x0c, 0xf6, 0x6f, 0x17, 0xc4, 0x49, 0xec,
0xd8, 0x43, 0x1f, 0x2d, 0xa4, 0x76, 0x7b,
0xb7, 0xcc, 0xbb, 0x3e, 0x5a, 0xfb, 0x60,
0xb1, 0x86, 0x3b, 0x52, 0xa1, 0x6c, 0xaa,
0x55, 0x29, 0x9d, 0x97, 0xb2, 0x87, 0x90,
0x61, 0xbe, 0xdc, 0xfc, 0xbc, 0x95, 0xcf,
0xcd, 0x37, 0x3f, 0x5b, 0xd1, 0x53, 0x39,
0x84, 0x3c, 0x41, 0xa2, 0x6d, 0x47, 0x14,
0x2a, 0x9e, 0x5d, 0x56, 0xf2, 0xd3, 0xab,
0x44, 0x11, 0x92, 0xd9, 0x23, 0x20, 0x2e,
0x89, 0xb4, 0x7c, 0xb8, 0x26, 0x77, 0x99,
0xe3, 0xa5, 0x67, 0x4a, 0xed, 0xde, 0xc5,
0x31, 0xfe, 0x18, 0x0d, 0x63, 0x8c, 0x80,
0xc0, 0xf7, 0x70, 0x07,
]);
/* https://crypto.stackexchange.com/a/21174/13860
*/
const EXP = new Uint8Array([
0x01, 0x03, 0x05, 0x0f, 0x11, 0x33, 0x55,
0xff, 0x1a, 0x2e, 0x72, 0x96, 0xa1, 0xf8,
0x13, 0x35, 0x5f, 0xe1, 0x38, 0x48, 0xd8,
0x73, 0x95, 0xa4, 0xf7, 0x02, 0x06, 0x0a,
0x1e, 0x22, 0x66, 0xaa, 0xe5, 0x34, 0x5c,
0xe4, 0x37, 0x59, 0xeb, 0x26, 0x6a, 0xbe,
0xd9, 0x70, 0x90, 0xab, 0xe6, 0x31, 0x53,
0xf5, 0x04, 0x0c, 0x14, 0x3c, 0x44, 0xcc,
0x4f, 0xd1, 0x68, 0xb8, 0xd3, 0x6e, 0xb2,
0xcd, 0x4c, 0xd4, 0x67, 0xa9, 0xe0, 0x3b,
0x4d, 0xd7, 0x62, 0xa6, 0xf1, 0x08, 0x18,
0x28, 0x78, 0x88, 0x83, 0x9e, 0xb9, 0xd0,
0x6b, 0xbd, 0xdc, 0x7f, 0x81, 0x98, 0xb3,
0xce, 0x49, 0xdb, 0x76, 0x9a, 0xb5, 0xc4,
0x57, 0xf9, 0x10, 0x30, 0x50, 0xf0, 0x0b,
0x1d, 0x27, 0x69, 0xbb, 0xd6, 0x61, 0xa3,
0xfe, 0x19, 0x2b, 0x7d, 0x87, 0x92, 0xad,
0xec, 0x2f, 0x71, 0x93, 0xae, 0xe9, 0x20,
0x60, 0xa0, 0xfb, 0x16, 0x3a, 0x4e, 0xd2,
0x6d, 0xb7, 0xc2, 0x5d, 0xe7, 0x32, 0x56,
0xfa, 0x15, 0x3f, 0x41, 0xc3, 0x5e, 0xe2,
0x3d, 0x47, 0xc9, 0x40, 0xc0, 0x5b, 0xed,
0x2c, 0x74, 0x9c, 0xbf, 0xda, 0x75, 0x9f,
0xba, 0xd5, 0x64, 0xac, 0xef, 0x2a, 0x7e,
0x82, 0x9d, 0xbc, 0xdf, 0x7a, 0x8e, 0x89,
0x80, 0x9b, 0xb6, 0xc1, 0x58, 0xe8, 0x23,
0x65, 0xaf, 0xea, 0x25, 0x6f, 0xb1, 0xc8,
0x43, 0xc5, 0x54, 0xfc, 0x1f, 0x21, 0x63,
0xa5, 0xf4, 0x07, 0x09, 0x1b, 0x2d, 0x77,
0x99, 0xb0, 0xcb, 0x46, 0xca, 0x45, 0xcf,
0x4a, 0xde, 0x79, 0x8b, 0x86, 0x91, 0xa8,
0xe3, 0x3e, 0x42, 0xc6, 0x51, 0xf3, 0x0e,
0x12, 0x36, 0x5a, 0xee, 0x29, 0x7b, 0x8d,
0x8c, 0x8f, 0x8a, 0x85, 0x94, 0xa7, 0xf2,
0x0d, 0x17, 0x39, 0x4b, 0xdd, 0x7c, 0x84,
0x97, 0xa2, 0xfd, 0x1c, 0x24, 0x6c, 0xb4,
0xc7, 0x52, 0xf6, 0x01, 0x03, 0x05, 0x0f,
0x11, 0x33, 0x55, 0xff, 0x1a, 0x2e, 0x72,
0x96, 0xa1, 0xf8, 0x13, 0x35, 0x5f, 0xe1,
0x38, 0x48, 0xd8, 0x73, 0x95, 0xa4, 0xf7,
0x02, 0x06, 0x0a, 0x1e, 0x22, 0x66, 0xaa,
0xe5, 0x34, 0x5c, 0xe4, 0x37, 0x59, 0xeb,
0x26, 0x6a, 0xbe, 0xd9, 0x70, 0x90, 0xab,
0xe6, 0x31, 0x53, 0xf5, 0x04, 0x0c, 0x14,
0x3c, 0x44, 0xcc, 0x4f, 0xd1, 0x68, 0xb8,
0xd3, 0x6e, 0xb2, 0xcd, 0x4c, 0xd4, 0x67,
0xa9, 0xe0, 0x3b, 0x4d, 0xd7, 0x62, 0xa6,
0xf1, 0x08, 0x18, 0x28, 0x78, 0x88, 0x83,
0x9e, 0xb9, 0xd0, 0x6b, 0xbd, 0xdc, 0x7f,
0x81, 0x98, 0xb3, 0xce, 0x49, 0xdb, 0x76,
0x9a, 0xb5, 0xc4, 0x57, 0xf9, 0x10, 0x30,
0x50, 0xf0, 0x0b, 0x1d, 0x27, 0x69, 0xbb,
0xd6, 0x61, 0xa3, 0xfe, 0x19, 0x2b, 0x7d,
0x87, 0x92, 0xad, 0xec, 0x2f, 0x71, 0x93,
0xae, 0xe9, 0x20, 0x60, 0xa0, 0xfb, 0x16,
0x3a, 0x4e, 0xd2, 0x6d, 0xb7, 0xc2, 0x5d,
0xe7, 0x32, 0x56, 0xfa, 0x15, 0x3f, 0x41,
0xc3, 0x5e, 0xe2, 0x3d, 0x47, 0xc9, 0x40,
0xc0, 0x5b, 0xed, 0x2c, 0x74, 0x9c, 0xbf,
0xda, 0x75, 0x9f, 0xba, 0xd5, 0x64, 0xac,
0xef, 0x2a, 0x7e, 0x82, 0x9d, 0xbc, 0xdf,
0x7a, 0x8e, 0x89, 0x80, 0x9b, 0xb6, 0xc1,
0x58, 0xe8, 0x23, 0x65, 0xaf, 0xea, 0x25,
0x6f, 0xb1, 0xc8, 0x43, 0xc5, 0x54, 0xfc,
0x1f, 0x21, 0x63, 0xa5, 0xf4, 0x07, 0x09,
0x1b, 0x2d, 0x77, 0x99, 0xb0, 0xcb, 0x46,
0xca, 0x45, 0xcf, 0x4a, 0xde, 0x79, 0x8b,
0x86, 0x91, 0xa8, 0xe3, 0x3e, 0x42, 0xc6,
0x51, 0xf3, 0x0e, 0x12, 0x36, 0x5a, 0xee,
0x29, 0x7b, 0x8d, 0x8c, 0x8f, 0x8a, 0x85,
0x94, 0xa7, 0xf2, 0x0d, 0x17, 0x39, 0x4b,
0xdd, 0x7c, 0x84, 0x97, 0xa2, 0xfd, 0x1c,
0x24, 0x6c, 0xb4, 0xc7, 0x52, 0xf6,
]);
function mul(a, b) {
if (a === 0 || b === 0) {
return 0;
}
return EXP[LOG[a] + LOG[b]];
}
function div(a, b) {
// multiply by the inverse of b
return mul(a, EXP[255 - LOG[b]]);
}
function degree(p) {
for (let i = p.length - 1; i >= 1; i--) {
if (p[i] !== 0) {
return i;
}
}
return 0;
}
/**
* Calculates f(partIdx) of the given points using Lagrangian interpolation.
* @param {Uint8Array} points The supplied point.
* @param {Number} partIdx The index to interpolate at.
*/
function interpolate(points, partIdx = 0) {
const x = partIdx;
let y = 0;
for (let i = 0; i < points.length; i++) {
const aX = points[i][0];
const aY = points[i][1];
let li = 1;
for (let j = 0; j < points.length; j++) {
const bX = points[j][0];
if (i !== j) {
li = mul(li, div(sub(x, bX), sub(aX, bX)));
}
}
y = add(y, mul(li, aY));
}
return y;
}
/**
* Generates a random polynomal of the correct degree and sets x as the first coefficient.
* @param {(number) => Uint8Array} randomBytes Takes a length and returns a
* Uint8Array of that length.
* @param {number} d The degree of the polynomial driven by the number shares and join threshold.
* @param {number} x The point to hide.
* @return {Uint8Array} The random polynomial with x as the fist coefficient.
*/
function generate(randomBytes, d, x) {
let p = null;
// generate random polynomials until we find one of the given degree
do {
p = randomBytes(d + 1);
} while (degree(p) !== d);
// set y intercept
p[0] = x;
return p;
}
/**
* Evaluates a polynomal at point x using Horner's method.
* @param {Uint8Array} p The polynomial
* @return {Number} x The point to evaluate.
*/
function evaluate(p, x) {
let result = 0;
for (let i = p.length - 1; i >= 0; i--) {
result = add(mul(result, x), p[i]);
}
return result;
}
/*
* This file includes code derived from https://github.com/simbo1905/shamir licensed under the Apache License, Version 2.0.
* You may obtain a copy of the license at http://www.apache.org/licenses/LICENSE-2.0
*
* Modifications:
* - translated to TypeScript
* - added restorePart function to restore a part with a given index
*/
/**
* Splits the given secret into {@code n} parts, of which any {@code k} or more can be combined to
* recover the original secret.
* @param {(number) => Uint8Array} randomBytes Takes a length and returns a random
* Uint8Array of that length
* @param {number} n the number of parts to produce (must be `>1`)
* @param {number} k the threshold of joinable parts (must be `<= n`})
* @param {Uint8Array} secret The secret to split as an array of bytes
* @return {Parts} an map of `n` parts that are arrays of bytes of the
* secret length
*/
function split(randomBytes, n, k, secret) {
if (k <= 1)
throw new Error('K must be > 1');
if (n < k)
throw new Error('N must be >= K');
if (n > 255)
throw new Error('N must be <= 255');
const values = new Array(n)
.fill(0)
.map(() => new Uint8Array(secret.length).fill(0));
for (let i = 0; i < secret.length; i++) {
const p = generate(randomBytes, k - 1, secret[i]);
for (let x = 1; x <= n; x++) {
values[x - 1][i] = evaluate(p, x);
}
}
const parts = {};
for (let i = 0; i < values.length; i++) {
const part = `${i + 1}`;
parts[part] = values[i];
}
return parts;
}
/**
* Joins the given parts to recover the original secret.
*
* <p><b>N.B.:</b> There is no way to determine whether or not the returned value is actually the
* original secret. If the parts are incorrect, or are under the threshold value used to split the
* secret, a random value will be returned.
*
* @param {Parts} parts an map of {@code n} parts that are arrays of bytes
* of the secret length
* @return {Uint8Array} the original secret
*
*/
function join(parts) {
if (Object.keys(parts).length === 0)
throw new Error('No parts provided');
const lengths = Object.values(parts).map(x => x.length);
const max = Math.max.apply(null, lengths);
const min = Math.min.apply(null, lengths);
if (max !== min) {
throw new Error(`Varying lengths of part values. Min ${min}, Max ${max}`);
}
const secret = new Uint8Array(max);
for (let i = 0; i < secret.length; i++) {
const keys = Object.keys(parts);
const points = new Array(keys.length)
.fill(0)
.map(() => new Uint8Array(2).fill(0));
for (let j = 0; j < keys.length; j++) {
const key = keys[j];
const k = Number(key);
points[j][0] = k;
points[j][1] = parts[key][i];
}
secret[i] = interpolate(points);
}
return secret;
}
/**
* Restores a part given a map of parts and a new index.
*
* @param {Parts} parts a map of part IDs to part values
* @param {number} partIdx the new index for the part
* @return {Uint8Array} the restored part
* @throws {Error} if parts is empty or contains values of varying lengths
*/
function restorePart(parts, partIdx) {
if (Object.keys(parts).length <= 1)
throw new Error('Need at least two parts');
const lengths = Object.values(parts).map(x => x.length);
const max = Math.max.apply(null, lengths);
const min = Math.min.apply(null, lengths);
if (max !== min) {
throw new Error(`Parts have varying lengths. Min ${min}, Max ${max}`);
}
const restoredPart = new Uint8Array(max);
for (let i = 0; i < restoredPart.length; i++) {
const keys = Object.keys(parts);
const points = new Array(keys.length)
.fill(0)
.map(() => new Uint8Array(2).fill(0));
for (let j = 0; j < keys.length; j++) {
const key = keys[j];
const k = Number(key);
points[j][0] = k;
points[j][1] = parts[key][i];
}
restoredPart[i] = interpolate(points, partIdx);
}
return restoredPart;
}
class ShamirWeb extends core.WebPlugin {
constructor() {
super(...arguments);
this.fs = FileSystemMock.getInstance();
}
async generateShards({ totalShards, threshold, inputDataBase64 }, callback) {
const randomBytes = (len) => crypto.getRandomValues(new Uint8Array(len));
const parts = split(randomBytes, totalShards, threshold, fromBase64(inputDataBase64));
const shards = Object.entries(parts).map(([shardIdx, shardData]) => {
const shardIdxBytes = new Uint8Array([parseInt(shardIdx)]);
const shardBytes = new Uint8Array(1 + shardData.length);
shardBytes.set(shardIdxBytes);
shardBytes.set(shardData, shardIdxBytes.length);
return shardBytes;
});
callback({ progress: 100, shardsBase64: shards.map(shard => toBase64(shard)) });
}
async restoreFromShards({ inputShardsBase64 }, callback) {
const inputShards = inputShardsBase64.map(shardBase64 => fromBase64(shardBase64));
const parts = inputShards.reduce((acc, shardBytes) => {
const shardIdx = shardBytes.subarray(0, 1)[0];
const shardData = shardBytes.subarray(1);
acc[shardIdx] = shardData;
return acc;
}, {});
const result = join(parts);
callback({ progress: 100, dataBase64: toBase64(result) });
}
async restoreShard({ shardIndex, inputShardsBase64 }, callback) {
const inputShards = inputShardsBase64.map(shardBase64 => fromBase64(shardBase64));
const parts = inputShards.reduce((acc, shardBytes) => {
const shardIdx = shardBytes.subarray(0, 1)[0];
const shardData = shardBytes.subarray(1);
acc[shardIdx] = shardData;
return acc;
}, {});
const restoredPart = restorePart(parts, shardIndex);
const restoredShard = new Uint8Array(1 + restoredPart.length);
const shardIdxBytes = new Uint8Array([shardIndex]);
restoredShard.set(shardIdxBytes);
restoredShard.set(restoredPart, shardIdxBytes.length);
callback({ progress: 100, dataBase64: toBase64(restoredShard) });
}
async generateFileShards({ totalShards, threshold, srcPath, dstPathRoot }, callback) {
const inputData = await this.fs.read(srcPath);
const inputDataBase64 = toBase64(inputData);
await this.generateShardsToFiles({ totalShards, threshold, inputDataBase64, dstPathRoot }, callback);
}
async generateShardsToFiles({ totalShards, threshold, inputDataBase64, dstPathRoot }, callback) {
await new Promise((resolve, reject) => {
this.generateShards({ totalShards, threshold, inputDataBase64 }, async ({ progress, shardsBase64 }, error) => {
if (error) {
reject(error);
}
else {
const shards = shardsBase64.map(shardBase64 => fromBase64(shardBase64));
const id = this.generateJobId();
const shardsPaths = [];
for (let i = 0; i < shards.length; i++) {
const path = this.formatShardPath(dstPathRoot, id, i);
shardsPaths.push(path);
await this.fs.write(path, shards[i]);
}
callback({ progress, shardsPaths });
resolve();
}
});
});
}
async restoreFromFileShards({ shardsPaths, dstPath }, callback) {
await new Promise((resolve, reject) => {
this.restoreFromFileShardsToData({ shardsPaths }, async ({ progress, dataBase64 }, error) => {
if (error) {
reject(error);
}
else {
await this.fs.write(dstPath, fromBase64(dataBase64));
callback({ progress, dstPath });
resolve();
}
});
});
}
async restoreFromFileShardsToData({ shardsPaths }, callback) {
const shardsBase64 = [];
for (const path of shardsPaths) {
const data = await this.fs.read(path);
shardsBase64.push(toBase64(data));
}
await new Promise((resolve, reject) => {
this.restoreFromShards({ inputShardsBase64: shardsBase64 }, async ({ progress, dataBase64 }, error) => {
if (error) {
reject(error);
}
else {
callback({ progress, dataBase64 });
resolve();
}
});
});
}
async restoreFileShard({ shardIndex, shardsPaths, dstPathRoot }, callback) {
const shardsBase64 = [];
for (const shardPath of shardsPaths) {
const data = await this.fs.read(shardPath);
shardsBase64.push(toBase64(data));
}
await new Promise((resolve, reject) => {
this.restoreShard({ shardIndex, inputShardsBase64: shardsBase64 }, async ({ progress, dataBase64 }, error) => {
if (error) {
reject(error);
}
else {
const id = this.generateJobId();
const shardPath = this.formatShardPath(dstPathRoot, id, shardIndex);
await this.fs.write(shardPath, fromBase64(dataBase64));
callback({ progress, shardPath });
resolve();
}
});
});
}
formatShardPath(dirPath, id, index) {
return `${dirPath}/${id}_${index}.bin`;
}
generateJobId() {
return Math.random().toString(36).substring(2, 15);
}
/** Web Filesystem Configuration */
updateShamirWebFsIndexedDbConfig(config) {
this.fs.updateIndexedDbConfig(config);
}
}
var web = /*#__PURE__*/Object.freeze({
__proto__: null,
ShamirWeb: ShamirWeb
});
exports.Shamir = Shamir;
exports.updateShamirWebFsIndexedDbConfig = updateShamirWebFsIndexedDbConfig;
return exports;
})({}, capacitorExports);
//# sourceMappingURL=plugin.js.map