@iden3/js-merkletree
Version:
javascript sparse merkle tree library
21 lines (20 loc) • 558 B
JavaScript
import { HASH_BYTES_LENGTH } from '../../constants';
export const bigint2Array = (bigNum, radix) => {
return bigNum
.toString(radix ? radix : 10)
.split('')
.map((n) => {
return parseInt(n);
});
};
export const bigIntToUINT8Array = (bigNum) => {
const n256 = BigInt(256);
const bytes = new Uint8Array(HASH_BYTES_LENGTH);
let i = 0;
while (bigNum > BigInt(0)) {
bytes[HASH_BYTES_LENGTH - 1 - i] = Number(bigNum % n256);
bigNum = bigNum / n256;
i += 1;
}
return bytes;
};