blockcore-notes/472.61355b12e1e319d1.js

1 line
119 KiB
JavaScript
Raw Normal View History

(()=>{var a,se,Xn={5521:(se,a)=>{"use strict";function _(l){if(!Number.isSafeInteger(l))throw new Error(`Wrong integer: ${l}`)}function N(...l){const u=(j,A)=>Z=>j(A(Z));return{encode:Array.from(l).reverse().reduce((j,A)=>j?u(j,A.encode):A.encode,void 0),decode:l.reduce((j,A)=>j?u(j,A.decode):A.decode,void 0)}}function d(l){return{encode:u=>{if(!Array.isArray(u)||u.length&&"number"!=typeof u[0])throw new Error("alphabet.encode input should be an array of numbers");return u.map(y=>{if(_(y),y<0||y>=l.length)throw new Error(`Digit index outside alphabet: ${y} (alphabet: ${l.length})`);return l[y]})},decode:u=>{if(!Array.isArray(u)||u.length&&"string"!=typeof u[0])throw new Error("alphabet.decode input should be array of strings");return u.map(y=>{if("string"!=typeof y)throw new Error(`alphabet.decode: not string element=${y}`);const L=l.indexOf(y);if(-1===L)throw new Error(`Unknown letter: "${y}". Allowed: ${l}`);return L})}}}function U(l=""){if("string"!=typeof l)throw new Error("join separator should be string");return{encode:u=>{if(!Array.isArray(u)||u.length&&"string"!=typeof u[0])throw new Error("join.encode input should be array of strings");for(let y of u)if("string"!=typeof y)throw new Error(`join.encode: non-string input=${y}`);return u.join(l)},decode:u=>{if("string"!=typeof u)throw new Error("join.decode input should be string");return u.split(l)}}}function X(l,u="="){if(_(l),"string"!=typeof u)throw new Error("padding chr should be string");return{encode(y){if(!Array.isArray(y)||y.length&&"string"!=typeof y[0])throw new Error("padding.encode input should be array of strings");for(let L of y)if("string"!=typeof L)throw new Error(`padding.encode: non-string input=${L}`);for(;y.length*l%8;)y.push(u);return y},decode(y){if(!Array.isArray(y)||y.length&&"string"!=typeof y[0])throw new Error("padding.encode input should be array of strings");for(let j of y)if("string"!=typeof j)throw new Error(`padding.decode: non-string input=${j}`);let L=y.length;if(L*l%8)throw new Error("Invalid padding: string should have whole number of bytes");for(;L>0&&y[L-1]===u;L--)if(!((L-1)*l%8))throw new Error("Invalid padding: string has too much padding");return y.slice(0,L)}}}function ee(l){if("function"!=typeof l)throw new Error("normalize fn should be function");return{encode:u=>u,decode:u=>l(u)}}function x(l,u,y){if(u<2)throw new Error(`convertRadix: wrong from=${u}, base cannot be less than 2`);if(y<2)throw new Error(`convertRadix: wrong to=${y}, base cannot be less than 2`);if(!Array.isArray(l))throw new Error("convertRadix: data should be array");if(!l.length)return[];let L=0;const j=[],A=Array.from(l);for(A.forEach(Z=>{if(_(Z),Z<0||Z>=u)throw new Error(`Wrong integer: ${Z}`)});;){let Z=0,le=!0;for(let he=L;he<A.length;he++){const be=A[he],q=u*Z+be;if(!Number.isSafeInteger(q)||u*Z/u!==Z||q-be!=u*Z)throw new Error("convertRadix: carry overflow");if(Z=q%y,A[he]=Math.floor(q/y),!Number.isSafeInteger(A[he])||A[he]*y+Z!==q)throw new Error("convertRadix: carry overflow");le&&(A[he]?le=!1:L=he)}if(j.push(Z),le)break}for(let Z=0;Z<l.length-1&&0===l[Z];Z++)j.push(0);return j.reverse()}Object.defineProperty(a,"__esModule",{value:!0}),a.bytes=a.stringToBytes=a.str=a.bytesToString=a.hex=a.utf8=a.bech32m=a.bech32=a.base58check=a.base58xmr=a.base58xrp=a.base58flickr=a.base58=a.base64url=a.base64=a.base32crockford=a.base32hex=a.base32=a.base16=a.utils=a.assertNumber=void 0,a.assertNumber=_;const w=(l,u)=>u?w(u,l%u):l,O=(l,u)=>l+(u-w(l,u));function M(l,u,y,L){if(!Array.isArray(l))throw new Error("convertRadix2: data should be array");if(u<=0||u>32)throw new Error(`convertRadix2: wrong from=${u}`);if(y<=0||y>32)throw new Error(`convertRadix2: wrong to=${y}`);if(O(u,y)>32)throw new Error(`convertRadix2: carry overflow from=${u} to=${y} carryBits=${O(u,y)}`);let j=0,A=0;const Z=2**y-1,le=[];for(const he of l){if(_(he),he>=2**u)throw new Error(`convertRadix2: invalid data word=${he} from=${u}`);if(j=j<<u|he,A+u>32)throw new Error(`convertRadix2: carry overflow pos=${A} from=${u}`);for(A+=u;A>=y;A-=y)le.push((j>>A-y&Z)>>>0);j&=2**A-1}if(j=j<<y-A&Z,!L&