blockcore-notes/911.d8294359b5074446.js

1 line
128 KiB
JavaScript
Raw Normal View History

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