-
Notifications
You must be signed in to change notification settings - Fork 1.4k
/
utils.ts
129 lines (105 loc) · 3.73 KB
/
utils.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
import type { BytesLike } from '@ethersproject/bytes';
import { arrayify } from '@ethersproject/bytes';
import { sha256 } from '@ethersproject/sha2';
/* Mnemonic phrase composed by words from the provided wordlist it can be a text or a array of words */
export type MnemonicPhrase = string | Array<string>;
export function toUtf8Bytes(stri: string): Uint8Array {
const str = stri.normalize('NFKD');
const result = [];
for (let i = 0; i < str.length; i += 1) {
const c = str.charCodeAt(i);
if (c < 0x80) {
result.push(c);
} else if (c < 0x800) {
result.push((c >> 6) | 0xc0);
result.push((c & 0x3f) | 0x80);
} else if ((c & 0xfc00) === 0xd800) {
i += 1;
const c2 = str.charCodeAt(i);
if (i >= str.length || (c2 & 0xfc00) !== 0xdc00) {
throw new Error('invalid utf-8 string');
}
// Surrogate Pair
const pair = 0x10000 + ((c & 0x03ff) << 10) + (c2 & 0x03ff);
result.push((pair >> 18) | 0xf0);
result.push(((pair >> 12) & 0x3f) | 0x80);
result.push(((pair >> 6) & 0x3f) | 0x80);
result.push((pair & 0x3f) | 0x80);
} else {
result.push((c >> 12) | 0xe0);
result.push(((c >> 6) & 0x3f) | 0x80);
result.push((c & 0x3f) | 0x80);
}
}
return arrayify(result);
}
// Returns a byte with the LSB bits set
function getLowerMask(bits: number): number {
return (1 << bits) - 1;
}
// Returns a byte with the MSB bits set
function getUpperMask(bits: number): number {
return ((1 << bits) - 1) << (8 - bits);
}
export function getWords(mnemonic: MnemonicPhrase): Array<string> {
if (!Array.isArray(mnemonic)) {
return mnemonic.split(' ');
}
return mnemonic;
}
export function getPhrase(mnemonic: MnemonicPhrase): string {
if (Array.isArray(mnemonic)) {
return mnemonic.join(' ');
}
return mnemonic;
}
export function entropyToMnemonicIndices(entropy: Uint8Array): Array<number> {
const indices: Array<number> = [0];
let remainingBits = 11;
for (let i = 0; i < entropy.length; i += 1) {
if (remainingBits > 8) {
indices[indices.length - 1] <<= 8;
indices[indices.length - 1] |= entropy[i];
remainingBits -= 8;
// This byte will complete an 11-bit index
} else {
indices[indices.length - 1] <<= remainingBits;
indices[indices.length - 1] |= entropy[i] >> (8 - remainingBits);
// Start the next word
indices.push(entropy[i] & getLowerMask(8 - remainingBits));
remainingBits += 3;
}
}
// Compute the checksum bits
const checksumBits = entropy.length / 4;
const checksum = arrayify(sha256(entropy))[0] & getUpperMask(checksumBits);
// Shift the checksum into the word indices
indices[indices.length - 1] <<= checksumBits;
indices[indices.length - 1] |= checksum >> (8 - checksumBits);
return indices;
}
export function mnemonicWordsToEntropy(words: Array<string>, wordlist: Array<string>): BytesLike {
const size = Math.ceil((11 * words.length) / 8);
const entropy = arrayify(new Uint8Array(size));
let offset = 0;
for (let i = 0; i < words.length; i += 1) {
const index = wordlist.indexOf(words[i].normalize('NFKD'));
if (index === -1) {
throw new Error('invalid mnemonic');
}
for (let bit = 0; bit < 11; bit += 1) {
if (index & (1 << (10 - bit))) {
entropy[offset >> 3] |= 1 << (7 - (offset % 8));
}
offset += 1;
}
}
const entropyBits = (32 * words.length) / 3;
const checksumBits = words.length / 3;
const checksumMask = getUpperMask(checksumBits);
const checksum = arrayify(sha256(entropy.slice(0, entropyBits / 8)))[0] & checksumMask;
if (checksum !== (entropy[entropy.length - 1] & checksumMask)) {
throw new Error('invalid checksum');
}
return entropy.slice(0, entropyBits / 8);
}