@subwallet/web-runner 1.3.52-0 → 1.3.54-0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/732-667a56ec348ddf58257d.js +2 -0
- package/index.html +1 -1
- package/locales/en/translation.json +11 -5
- package/locales/ja/translation.json +11 -5
- package/locales/ru/translation.json +11 -5
- package/locales/vi/translation.json +11 -5
- package/locales/zh/translation.json +11 -5
- package/package.json +4 -4
- package/{web-runner-fa8e937ccb5b4ee6b0fa.js → web-runner-8190e7f6c77a8a5fae9b.js} +2 -2
- package/{web-runner-fa8e937ccb5b4ee6b0fa.js.LICENSE.txt → web-runner-8190e7f6c77a8a5fae9b.js.LICENSE.txt} +4 -0
- package/web-runner.zip +0 -0
- package/434-6502b088404192d5d937.js +0 -2
- /package/{434-6502b088404192d5d937.js.LICENSE.txt → 732-667a56ec348ddf58257d.js.LICENSE.txt} +0 -0
@@ -0,0 +1,2 @@
|
|
1
|
+
/*! For license information please see 732-667a56ec348ddf58257d.js.LICENSE.txt */
|
2
|
+
"use strict";(("undefined"!=typeof self?self:this).webpackChunk_subwallet_web_runner=("undefined"!=typeof self?self:this).webpackChunk_subwallet_web_runner||[]).push([[732],{11732:(t,e,n)=>{n.d(e,{secp256k1:()=>Ut});var r=n(18507);function o(t,e,n){return t&e^t&n^e&n}class i extends r.Vw{constructor(t,e,n,o){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=e,this.padOffset=n,this.isLE=o,this.buffer=new Uint8Array(t),this.view=(0,r.O8)(this.buffer)}update(t){(0,r.CC)(this),t=(0,r.ZJ)(t),(0,r.DO)(t);const{view:e,buffer:n,blockLen:o}=this,i=t.length;for(let s=0;s<i;){const f=Math.min(o-this.pos,i-s);if(f!==o)n.set(t.subarray(s,s+f),this.pos),this.pos+=f,s+=f,this.pos===o&&(this.process(e,0),this.pos=0);else{const e=(0,r.O8)(t);for(;o<=i-s;s+=o)this.process(e,s)}}return this.length+=t.length,this.roundClean(),this}digestInto(t){(0,r.CC)(this),(0,r.Ht)(t,this),this.finished=!0;const{buffer:e,view:n,blockLen:o,isLE:i}=this;let{pos:s}=this;e[s++]=128,(0,r.uH)(this.buffer.subarray(s)),this.padOffset>o-s&&(this.process(n,0),s=0);for(let t=s;t<o;t++)e[t]=0;!function(t,e,n,r){if("function"==typeof t.setBigUint64)return t.setBigUint64(e,n,r);const o=BigInt(32),i=BigInt(4294967295),s=Number(n>>o&i),f=Number(n&i),a=r?4:0,u=r?0:4;t.setUint32(e+a,s,r),t.setUint32(e+u,f,r)}(n,o-8,BigInt(8*this.length),i),this.process(n,0);const f=(0,r.O8)(t),a=this.outputLen;if(a%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const u=a/4,c=this.get();if(u>c.length)throw new Error("_sha2: outputLen bigger than state");for(let t=0;t<u;t++)f.setUint32(4*t,c[t],i)}digest(){const{buffer:t,outputLen:e}=this;this.digestInto(t);const n=t.slice(0,e);return this.destroy(),n}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:e,buffer:n,length:r,finished:o,destroyed:i,pos:s}=this;return t.destroyed=i,t.finished=o,t.length=r,t.pos=s,r%e&&t.buffer.set(n),t}clone(){return this._cloneInto()}}const s=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);n(52543);const f=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),a=new Uint32Array(64);class u extends i{constructor(t=32){super(64,t,8,!1),this.A=0|s[0],this.B=0|s[1],this.C=0|s[2],this.D=0|s[3],this.E=0|s[4],this.F=0|s[5],this.G=0|s[6],this.H=0|s[7]}get(){const{A:t,B:e,C:n,D:r,E:o,F:i,G:s,H:f}=this;return[t,e,n,r,o,i,s,f]}set(t,e,n,r,o,i,s,f){this.A=0|t,this.B=0|e,this.C=0|n,this.D=0|r,this.E=0|o,this.F=0|i,this.G=0|s,this.H=0|f}process(t,e){for(let n=0;n<16;n++,e+=4)a[n]=t.getUint32(e,!1);for(let t=16;t<64;t++){const e=a[t-15],n=a[t-2],o=(0,r.Ow)(e,7)^(0,r.Ow)(e,18)^e>>>3,i=(0,r.Ow)(n,17)^(0,r.Ow)(n,19)^n>>>10;a[t]=i+a[t-7]+o+a[t-16]|0}let{A:n,B:i,C:s,D:u,E:c,F:l,G:h,H:d}=this;for(let t=0;t<64;t++){const e=d+((0,r.Ow)(c,6)^(0,r.Ow)(c,11)^(0,r.Ow)(c,25))+((w=c)&l^~w&h)+f[t]+a[t]|0,g=((0,r.Ow)(n,2)^(0,r.Ow)(n,13)^(0,r.Ow)(n,22))+o(n,i,s)|0;d=h,h=l,l=c,c=u+e|0,u=s,s=i,i=n,n=e+g|0}var w;n=n+this.A|0,i=i+this.B|0,s=s+this.C|0,u=u+this.D|0,c=c+this.E|0,l=l+this.F|0,h=h+this.G|0,d=d+this.H|0,this.set(n,i,s,u,c,l,h,d)}roundClean(){(0,r.uH)(a)}destroy(){this.set(0,0,0,0,0,0,0,0),(0,r.uH)(this.buffer)}}const c=(0,r.qj)((()=>new u));class l extends r.Vw{constructor(t,e){super(),this.finished=!1,this.destroyed=!1,(0,r.sd)(t);const n=(0,r.ZJ)(e);if(this.iHash=t.create(),"function"!=typeof this.iHash.update)throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const o=this.blockLen,i=new Uint8Array(o);i.set(n.length>o?t.create().update(n).digest():n);for(let t=0;t<i.length;t++)i[t]^=54;this.iHash.update(i),this.oHash=t.create();for(let t=0;t<i.length;t++)i[t]^=106;this.oHash.update(i),(0,r.uH)(i)}update(t){return(0,r.CC)(this),this.iHash.update(t),this}digestInto(t){(0,r.CC)(this),(0,r.DO)(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:n,finished:r,destroyed:o,blockLen:i,outputLen:s}=this;return t.finished=r,t.destroyed=o,t.blockLen=i,t.outputLen=s,t.oHash=e._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const h=(t,e,n)=>new l(t,e).update(n).digest();h.create=(t,e)=>new l(t,e);const d=BigInt(0),w=BigInt(1);function g(t){return t instanceof Uint8Array||ArrayBuffer.isView(t)&&"Uint8Array"===t.constructor.name}function p(t){if(!g(t))throw new Error("Uint8Array expected")}function y(t,e){if("boolean"!=typeof e)throw new Error(t+" boolean expected, got "+e)}function m(t){const e=t.toString(16);return 1&e.length?"0"+e:e}function E(t){if("string"!=typeof t)throw new Error("hex string expected, got "+typeof t);return""===t?d:BigInt("0x"+t)}const b="function"==typeof Uint8Array.from([]).toHex&&"function"==typeof Uint8Array.fromHex,v=Array.from({length:256},((t,e)=>e.toString(16).padStart(2,"0")));function B(t){if(p(t),b)return t.toHex();let e="";for(let n=0;n<t.length;n++)e+=v[t[n]];return e}const x={_0:48,_9:57,A:65,F:70,a:97,f:102};function A(t){return t>=x._0&&t<=x._9?t-x._0:t>=x.A&&t<=x.F?t-(x.A-10):t>=x.a&&t<=x.f?t-(x.a-10):void 0}function O(t){if("string"!=typeof t)throw new Error("hex string expected, got "+typeof t);if(b)return Uint8Array.fromHex(t);const e=t.length,n=e/2;if(e%2)throw new Error("hex string expected, got unpadded hex of length "+e);const r=new Uint8Array(n);for(let e=0,o=0;e<n;e++,o+=2){const n=A(t.charCodeAt(o)),i=A(t.charCodeAt(o+1));if(void 0===n||void 0===i){const e=t[o]+t[o+1];throw new Error('hex string expected, got non-hex character "'+e+'" at index '+o)}r[e]=16*n+i}return r}function S(t){return E(B(t))}function I(t){return p(t),E(B(Uint8Array.from(t).reverse()))}function R(t,e){return O(t.toString(16).padStart(2*e,"0"))}function N(t,e){return R(t,e).reverse()}function q(t,e,n){let r;if("string"==typeof e)try{r=O(e)}catch(e){throw new Error(t+" must be hex string or Uint8Array, cause: "+e)}else{if(!g(e))throw new Error(t+" must be hex string or Uint8Array");r=Uint8Array.from(e)}const o=r.length;if("number"==typeof n&&o!==n)throw new Error(t+" of length "+n+" expected, got "+o);return r}function H(...t){let e=0;for(let n=0;n<t.length;n++){const r=t[n];p(r),e+=r.length}const n=new Uint8Array(e);for(let e=0,r=0;e<t.length;e++){const o=t[e];n.set(o,r),r+=o.length}return n}const L=t=>"bigint"==typeof t&&d<=t;function C(t,e,n){return L(t)&&L(e)&&L(n)&&e<=t&&t<n}function U(t,e,n,r){if(!C(e,n,r))throw new Error("expected valid "+t+": "+n+" <= n < "+r+", got "+e)}const F=t=>(w<<BigInt(t))-w,k=t=>new Uint8Array(t),z=t=>Uint8Array.from(t),Z={bigint:t=>"bigint"==typeof t,function:t=>"function"==typeof t,boolean:t=>"boolean"==typeof t,string:t=>"string"==typeof t,stringOrUint8Array:t=>"string"==typeof t||g(t),isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>"function"==typeof t&&Number.isSafeInteger(t.outputLen)};function P(t,e,n={}){const r=(e,n,r)=>{const o=Z[n];if("function"!=typeof o)throw new Error("invalid validator function");const i=t[e];if(!(r&&void 0===i||o(i,t)))throw new Error("param "+String(e)+" is invalid. Expected "+n+", got "+i)};for(const[t,n]of Object.entries(e))r(t,n,!1);for(const[t,e]of Object.entries(n))r(t,e,!0);return t}function _(t){const e=new WeakMap;return(n,...r)=>{const o=e.get(n);if(void 0!==o)return o;const i=t(n,...r);return e.set(n,i),i}}const T=BigInt(0),D=BigInt(1),V=BigInt(2),j=BigInt(3),K=BigInt(4),Y=BigInt(5),G=BigInt(8);function M(t,e){const n=t%e;return n>=T?n:e+n}function W(t,e,n){let r=t;for(;e-- >T;)r*=r,r%=n;return r}function J(t,e){if(t===T)throw new Error("invert: expected non-zero number");if(e<=T)throw new Error("invert: expected positive modulus, got "+e);let n=M(t,e),r=e,o=T,i=D,s=D,f=T;for(;n!==T;){const t=r/n,e=r%n,a=o-s*t,u=i-f*t;r=n,n=e,o=s,i=f,s=a,f=u}if(r!==D)throw new Error("invert: does not exist");return M(o,e)}function Q(t,e){const n=(t.ORDER+D)/K,r=t.pow(e,n);if(!t.eql(t.sqr(r),e))throw new Error("Cannot find square root");return r}function X(t,e){const n=(t.ORDER-Y)/G,r=t.mul(e,V),o=t.pow(r,n),i=t.mul(e,o),s=t.mul(t.mul(i,V),o),f=t.mul(i,t.sub(s,t.ONE));if(!t.eql(t.sqr(f),e))throw new Error("Cannot find square root");return f}const $=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function tt(t,e,n=!1){const r=new Array(e.length).fill(n?t.ZERO:void 0),o=e.reduce(((e,n,o)=>t.is0(n)?e:(r[o]=e,t.mul(e,n))),t.ONE),i=t.inv(o);return e.reduceRight(((e,n,o)=>t.is0(n)?e:(r[o]=t.mul(e,r[o]),t.mul(e,n))),i),r}function et(t,e){const n=(t.ORDER-D)/V,r=t.pow(e,n),o=t.eql(r,t.ONE),i=t.eql(r,t.ZERO),s=t.eql(r,t.neg(t.ONE));if(!o&&!i&&!s)throw new Error("invalid Legendre symbol result");return o?1:i?0:-1}function nt(t,e){void 0!==e&&(0,r.Fe)(e);const n=void 0!==e?e:t.toString(2).length;return{nBitLength:n,nByteLength:Math.ceil(n/8)}}function rt(t,e,n=!1,r={}){if(t<=T)throw new Error("invalid field: expected ORDER > 0, got "+t);const{nBitLength:o,nByteLength:i}=nt(t,e);if(i>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let s;const f=Object.freeze({ORDER:t,isLE:n,BITS:o,BYTES:i,MASK:F(o),ZERO:T,ONE:D,create:e=>M(e,t),isValid:e=>{if("bigint"!=typeof e)throw new Error("invalid field element: expected bigint, got "+typeof e);return T<=e&&e<t},is0:t=>t===T,isOdd:t=>(t&D)===D,neg:e=>M(-e,t),eql:(t,e)=>t===e,sqr:e=>M(e*e,t),add:(e,n)=>M(e+n,t),sub:(e,n)=>M(e-n,t),mul:(e,n)=>M(e*n,t),pow:(t,e)=>function(t,e,n){if(n<T)throw new Error("invalid exponent, negatives unsupported");if(n===T)return t.ONE;if(n===D)return e;let r=t.ONE,o=e;for(;n>T;)n&D&&(r=t.mul(r,o)),o=t.sqr(o),n>>=D;return r}(f,t,e),div:(e,n)=>M(e*J(n,t),t),sqrN:t=>t*t,addN:(t,e)=>t+e,subN:(t,e)=>t-e,mulN:(t,e)=>t*e,inv:e=>J(e,t),sqrt:r.sqrt||(e=>{return s||(s=(n=t)%K===j?Q:n%G===Y?X:function(t){if(t<BigInt(3))throw new Error("sqrt is not defined for small field");let e=t-D,n=0;for(;e%V===T;)e/=V,n++;let r=V;const o=rt(t);for(;1===et(o,r);)if(r++>1e3)throw new Error("Cannot find square root: probably non-prime P");if(1===n)return Q;let i=o.pow(r,e);const s=(e+D)/V;return function(t,r){if(t.is0(r))return r;if(1!==et(t,r))throw new Error("Cannot find square root");let o=n,f=t.mul(t.ONE,i),a=t.pow(r,e),u=t.pow(r,s);for(;!t.eql(a,t.ONE);){if(t.is0(a))return t.ZERO;let e=1,n=t.sqr(a);for(;!t.eql(n,t.ONE);)if(e++,n=t.sqr(n),e===o)throw new Error("Cannot find square root");const r=D<<BigInt(o-e-1),i=t.pow(f,r);o=e,f=t.sqr(i),a=t.mul(a,f),u=t.mul(u,i)}return u}}(n)),s(f,e);var n}),toBytes:t=>n?N(t,i):R(t,i),fromBytes:t=>{if(t.length!==i)throw new Error("Field.fromBytes: expected "+i+" bytes, got "+t.length);return n?I(t):S(t)},invertBatch:t=>tt(f,t),cmov:(t,e,n)=>n?e:t});return Object.freeze(f)}function ot(t){if("bigint"!=typeof t)throw new Error("field order must be bigint");const e=t.toString(2).length;return Math.ceil(e/8)}function it(t){const e=ot(t);return e+Math.ceil(e/2)}const st=BigInt(0),ft=BigInt(1);function at(t,e){const n=e.negate();return t?n:e}function ut(t,e){if(!Number.isSafeInteger(t)||t<=0||t>e)throw new Error("invalid window size, expected [1.."+e+"], got W="+t)}function ct(t,e){ut(t,e);const n=2**t;return{windows:Math.ceil(e/t)+1,windowSize:2**(t-1),mask:F(t),maxNumber:n,shiftBy:BigInt(t)}}function lt(t,e,n){const{windowSize:r,mask:o,maxNumber:i,shiftBy:s}=n;let f=Number(t&o),a=t>>s;f>r&&(f-=i,a+=ft);const u=e*r;return{nextN:a,offset:u+Math.abs(f)-1,isZero:0===f,isNeg:f<0,isNegF:e%2!=0,offsetF:u}}const ht=new WeakMap,dt=new WeakMap;function wt(t){return dt.get(t)||1}function gt(t,e,n,r){(function(t,e){if(!Array.isArray(t))throw new Error("array expected");t.forEach(((t,n)=>{if(!(t instanceof e))throw new Error("invalid point at index "+n)}))})(n,t),function(t,e){if(!Array.isArray(t))throw new Error("array of scalars expected");t.forEach(((t,n)=>{if(!e.isValid(t))throw new Error("invalid scalar at index "+n)}))}(r,e);const o=n.length,i=r.length;if(o!==i)throw new Error("arrays of points and scalars must have equal length");const s=t.ZERO,f=function(t){let e;for(e=0;t>d;t>>=w,e+=1);return e}(BigInt(o));let a=1;f>12?a=f-3:f>4?a=f-2:f>0&&(a=2);const u=F(a),c=new Array(Number(u)+1).fill(s);let l=s;for(let t=Math.floor((e.BITS-1)/a)*a;t>=0;t-=a){c.fill(s);for(let e=0;e<i;e++){const o=r[e],i=Number(o>>BigInt(t)&u);c[i]=c[i].add(n[e])}let e=s;for(let t=c.length-1,n=s;t>0;t--)n=n.add(c[t]),e=e.add(n);if(l=l.add(e),0!==t)for(let t=0;t<a;t++)l=l.double()}return l}function pt(t){return P(t.Fp,$.reduce(((t,e)=>(t[e]="function",t)),{ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"})),P(t,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...nt(t.n,t.nBitLength),...t,p:t.Fp.ORDER})}function yt(t){void 0!==t.lowS&&y("lowS",t.lowS),void 0!==t.prehash&&y("prehash",t.prehash)}class mt extends Error{constructor(t=""){super(t)}}const Et={Err:mt,_tlv:{encode:(t,e)=>{const{Err:n}=Et;if(t<0||t>256)throw new n("tlv.encode: wrong tag");if(1&e.length)throw new n("tlv.encode: unpadded data");const r=e.length/2,o=m(r);if(o.length/2&128)throw new n("tlv.encode: long form length too big");const i=r>127?m(o.length/2|128):"";return m(t)+i+o+e},decode(t,e){const{Err:n}=Et;let r=0;if(t<0||t>256)throw new n("tlv.encode: wrong tag");if(e.length<2||e[r++]!==t)throw new n("tlv.decode: wrong tlv");const o=e[r++];let i=0;if(128&o){const t=127&o;if(!t)throw new n("tlv.decode(long): indefinite length not supported");if(t>4)throw new n("tlv.decode(long): byte length is too big");const s=e.subarray(r,r+t);if(s.length!==t)throw new n("tlv.decode: length bytes not complete");if(0===s[0])throw new n("tlv.decode(long): zero leftmost byte");for(const t of s)i=i<<8|t;if(r+=t,i<128)throw new n("tlv.decode(long): not minimal encoding")}else i=o;const s=e.subarray(r,r+i);if(s.length!==i)throw new n("tlv.decode: wrong value length");return{v:s,l:e.subarray(r+i)}}},_int:{encode(t){const{Err:e}=Et;if(t<vt)throw new e("integer: negative integers are not allowed");let n=m(t);if(8&Number.parseInt(n[0],16)&&(n="00"+n),1&n.length)throw new e("unexpected DER parsing assertion: unpadded hex");return n},decode(t){const{Err:e}=Et;if(128&t[0])throw new e("invalid signature integer: negative");if(0===t[0]&&!(128&t[1]))throw new e("invalid signature integer: unnecessary leading zero");return S(t)}},toSig(t){const{Err:e,_int:n,_tlv:r}=Et,o=q("signature",t),{v:i,l:s}=r.decode(48,o);if(s.length)throw new e("invalid signature: left bytes after parsing");const{v:f,l:a}=r.decode(2,i),{v:u,l:c}=r.decode(2,a);if(c.length)throw new e("invalid signature: left bytes after parsing");return{r:n.decode(f),s:n.decode(u)}},hexFromSig(t){const{_tlv:e,_int:n}=Et,r=e.encode(2,n.encode(t.r))+e.encode(2,n.encode(t.s));return e.encode(48,r)}};function bt(t,e){return B(R(t,e))}const vt=BigInt(0),Bt=BigInt(1),xt=(BigInt(2),BigInt(3)),At=BigInt(4);function Ot(t){const e=function(t){const e=pt(t);return P(e,{hash:"hash",hmac:"function",randomBytes:"function"},{bits2int:"function",bits2int_modN:"function",lowS:"boolean"}),Object.freeze({lowS:!0,...e})}(t),{Fp:n,n:r,nByteLength:o,nBitLength:i}=e,s=n.BYTES+1,f=2*n.BYTES+1;function a(t){return M(t,r)}function u(t){return J(t,r)}const{ProjectivePoint:c,normPrivateKeyToScalar:l,weierstrassEquation:h,isWithinCurveOrder:d}=function(t){const e=function(t){const e=pt(t);P(e,{a:"field",b:"field"},{allowInfinityPoint:"boolean",allowedPrivateKeyLengths:"array",clearCofactor:"function",fromBytes:"function",isTorsionFree:"function",toBytes:"function",wrapPrivateKey:"boolean"});const{endo:n,Fp:r,a:o}=e;if(n){if(!r.eql(o,r.ZERO))throw new Error("invalid endo: CURVE.a must be 0");if("object"!=typeof n||"bigint"!=typeof n.beta||"function"!=typeof n.splitScalar)throw new Error('invalid endo: expected "beta": bigint and "splitScalar": function')}return Object.freeze({...e})}(t),{Fp:n}=e,r=rt(e.n,e.nBitLength),o=e.toBytes||((t,e,r)=>{const o=e.toAffine();return H(Uint8Array.from([4]),n.toBytes(o.x),n.toBytes(o.y))}),i=e.fromBytes||(t=>{const e=t.subarray(1);return{x:n.fromBytes(e.subarray(0,n.BYTES)),y:n.fromBytes(e.subarray(n.BYTES,2*n.BYTES))}});function s(t){const{a:r,b:o}=e,i=n.sqr(t),s=n.mul(i,t);return n.add(n.add(s,n.mul(t,r)),o)}function f(t,e){const r=n.sqr(e),o=s(t);return n.eql(r,o)}if(!f(e.Gx,e.Gy))throw new Error("bad curve params: generator point");const a=n.mul(n.pow(e.a,xt),At),u=n.mul(n.sqr(e.b),BigInt(27));if(n.is0(n.add(a,u)))throw new Error("bad curve params: a or b");function c(t){const{allowedPrivateKeyLengths:n,nByteLength:r,wrapPrivateKey:o,n:i}=e;if(n&&"bigint"!=typeof t){if(g(t)&&(t=B(t)),"string"!=typeof t||!n.includes(t.length))throw new Error("invalid private key");t=t.padStart(2*r,"0")}let s;try{s="bigint"==typeof t?t:S(q("private key",t,r))}catch(e){throw new Error("invalid private key, expected hex or "+r+" bytes, got "+typeof t)}return o&&(s=M(s,i)),U("private key",s,Bt,i),s}function l(t){if(!(t instanceof w))throw new Error("ProjectivePoint expected")}const h=_(((t,e)=>{const{px:r,py:o,pz:i}=t;if(n.eql(i,n.ONE))return{x:r,y:o};const s=t.is0();null==e&&(e=s?n.ONE:n.inv(i));const f=n.mul(r,e),a=n.mul(o,e),u=n.mul(i,e);if(s)return{x:n.ZERO,y:n.ZERO};if(!n.eql(u,n.ONE))throw new Error("invZ was invalid");return{x:f,y:a}})),d=_((t=>{if(t.is0()){if(e.allowInfinityPoint&&!n.is0(t.py))return;throw new Error("bad point: ZERO")}const{x:r,y:o}=t.toAffine();if(!n.isValid(r)||!n.isValid(o))throw new Error("bad point: x or y not FE");if(!f(r,o))throw new Error("bad point: equation left != right");if(!t.isTorsionFree())throw new Error("bad point: not in prime-order subgroup");return!0}));class w{constructor(t,e,r){if(null==t||!n.isValid(t))throw new Error("x required");if(null==e||!n.isValid(e)||n.is0(e))throw new Error("y required");if(null==r||!n.isValid(r))throw new Error("z required");this.px=t,this.py=e,this.pz=r,Object.freeze(this)}static fromAffine(t){const{x:e,y:r}=t||{};if(!t||!n.isValid(e)||!n.isValid(r))throw new Error("invalid affine point");if(t instanceof w)throw new Error("projective point not allowed");const o=t=>n.eql(t,n.ZERO);return o(e)&&o(r)?w.ZERO:new w(e,r,n.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(t){const e=tt(n,t.map((t=>t.pz)));return t.map(((t,n)=>t.toAffine(e[n]))).map(w.fromAffine)}static fromHex(t){const e=w.fromAffine(i(q("pointHex",t)));return e.assertValidity(),e}static fromPrivateKey(t){return w.BASE.multiply(c(t))}static msm(t,e){return gt(w,r,t,e)}_setWindowSize(t){E.setWindowSize(this,t)}assertValidity(){d(this)}hasEvenY(){const{y:t}=this.toAffine();if(n.isOdd)return!n.isOdd(t);throw new Error("Field doesn't support isOdd")}equals(t){l(t);const{px:e,py:r,pz:o}=this,{px:i,py:s,pz:f}=t,a=n.eql(n.mul(e,f),n.mul(i,o)),u=n.eql(n.mul(r,f),n.mul(s,o));return a&&u}negate(){return new w(this.px,n.neg(this.py),this.pz)}double(){const{a:t,b:r}=e,o=n.mul(r,xt),{px:i,py:s,pz:f}=this;let a=n.ZERO,u=n.ZERO,c=n.ZERO,l=n.mul(i,i),h=n.mul(s,s),d=n.mul(f,f),g=n.mul(i,s);return g=n.add(g,g),c=n.mul(i,f),c=n.add(c,c),a=n.mul(t,c),u=n.mul(o,d),u=n.add(a,u),a=n.sub(h,u),u=n.add(h,u),u=n.mul(a,u),a=n.mul(g,a),c=n.mul(o,c),d=n.mul(t,d),g=n.sub(l,d),g=n.mul(t,g),g=n.add(g,c),c=n.add(l,l),l=n.add(c,l),l=n.add(l,d),l=n.mul(l,g),u=n.add(u,l),d=n.mul(s,f),d=n.add(d,d),l=n.mul(d,g),a=n.sub(a,l),c=n.mul(d,h),c=n.add(c,c),c=n.add(c,c),new w(a,u,c)}add(t){l(t);const{px:r,py:o,pz:i}=this,{px:s,py:f,pz:a}=t;let u=n.ZERO,c=n.ZERO,h=n.ZERO;const d=e.a,g=n.mul(e.b,xt);let p=n.mul(r,s),y=n.mul(o,f),m=n.mul(i,a),E=n.add(r,o),b=n.add(s,f);E=n.mul(E,b),b=n.add(p,y),E=n.sub(E,b),b=n.add(r,i);let v=n.add(s,a);return b=n.mul(b,v),v=n.add(p,m),b=n.sub(b,v),v=n.add(o,i),u=n.add(f,a),v=n.mul(v,u),u=n.add(y,m),v=n.sub(v,u),h=n.mul(d,b),u=n.mul(g,m),h=n.add(u,h),u=n.sub(y,h),h=n.add(y,h),c=n.mul(u,h),y=n.add(p,p),y=n.add(y,p),m=n.mul(d,m),b=n.mul(g,b),y=n.add(y,m),m=n.sub(p,m),m=n.mul(d,m),b=n.add(b,m),p=n.mul(y,b),c=n.add(c,p),p=n.mul(v,b),u=n.mul(E,u),u=n.sub(u,p),p=n.mul(E,y),h=n.mul(v,h),h=n.add(h,p),new w(u,c,h)}subtract(t){return this.add(t.negate())}is0(){return this.equals(w.ZERO)}wNAF(t){return E.wNAFCached(this,t,w.normalizeZ)}multiplyUnsafe(t){const{endo:r,n:o}=e;U("scalar",t,vt,o);const i=w.ZERO;if(t===vt)return i;if(this.is0()||t===Bt)return this;if(!r||E.hasPrecomputes(this))return E.wNAFCachedUnsafe(this,t,w.normalizeZ);let{k1neg:s,k1:f,k2neg:a,k2:u}=r.splitScalar(t),c=i,l=i,h=this;for(;f>vt||u>vt;)f&Bt&&(c=c.add(h)),u&Bt&&(l=l.add(h)),h=h.double(),f>>=Bt,u>>=Bt;return s&&(c=c.negate()),a&&(l=l.negate()),l=new w(n.mul(l.px,r.beta),l.py,l.pz),c.add(l)}multiply(t){const{endo:r,n:o}=e;let i,s;if(U("scalar",t,Bt,o),r){const{k1neg:e,k1:o,k2neg:f,k2:a}=r.splitScalar(t);let{p:u,f:c}=this.wNAF(o),{p:l,f:h}=this.wNAF(a);u=E.constTimeNegate(e,u),l=E.constTimeNegate(f,l),l=new w(n.mul(l.px,r.beta),l.py,l.pz),i=u.add(l),s=c.add(h)}else{const{p:e,f:n}=this.wNAF(t);i=e,s=n}return w.normalizeZ([i,s])[0]}multiplyAndAddUnsafe(t,e,n){const r=w.BASE,o=(t,e)=>e!==vt&&e!==Bt&&t.equals(r)?t.multiply(e):t.multiplyUnsafe(e),i=o(this,e).add(o(t,n));return i.is0()?void 0:i}toAffine(t){return h(this,t)}isTorsionFree(){const{h:t,isTorsionFree:n}=e;if(t===Bt)return!0;if(n)return n(w,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:t,clearCofactor:n}=e;return t===Bt?this:n?n(w,this):this.multiplyUnsafe(e.h)}toRawBytes(t=!0){return y("isCompressed",t),this.assertValidity(),o(w,this,t)}toHex(t=!0){return y("isCompressed",t),B(this.toRawBytes(t))}}w.BASE=new w(e.Gx,e.Gy,n.ONE),w.ZERO=new w(n.ZERO,n.ONE,n.ZERO);const{endo:p,nBitLength:m}=e,E=(b=w,v=p?Math.ceil(m/2):m,{constTimeNegate:at,hasPrecomputes:t=>1!==wt(t),unsafeLadder(t,e,n=b.ZERO){let r=t;for(;e>st;)e&ft&&(n=n.add(r)),r=r.double(),e>>=ft;return n},precomputeWindow(t,e){const{windows:n,windowSize:r}=ct(e,v),o=[];let i=t,s=i;for(let t=0;t<n;t++){s=i,o.push(s);for(let t=1;t<r;t++)s=s.add(i),o.push(s);i=s.double()}return o},wNAF(t,e,n){let r=b.ZERO,o=b.BASE;const i=ct(t,v);for(let t=0;t<i.windows;t++){const{nextN:s,offset:f,isZero:a,isNeg:u,isNegF:c,offsetF:l}=lt(n,t,i);n=s,a?o=o.add(at(c,e[l])):r=r.add(at(u,e[f]))}return{p:r,f:o}},wNAFUnsafe(t,e,n,r=b.ZERO){const o=ct(t,v);for(let t=0;t<o.windows&&n!==st;t++){const{nextN:i,offset:s,isZero:f,isNeg:a}=lt(n,t,o);if(n=i,!f){const t=e[s];r=r.add(a?t.negate():t)}}return r},getPrecomputes(t,e,n){let r=ht.get(e);return r||(r=this.precomputeWindow(e,t),1!==t&&ht.set(e,n(r))),r},wNAFCached(t,e,n){const r=wt(t);return this.wNAF(r,this.getPrecomputes(r,t,n),e)},wNAFCachedUnsafe(t,e,n,r){const o=wt(t);return 1===o?this.unsafeLadder(t,e,r):this.wNAFUnsafe(o,this.getPrecomputes(o,t,n),e,r)},setWindowSize(t,e){ut(e,v),dt.set(t,e),ht.delete(t)}});var b,v;return{CURVE:e,ProjectivePoint:w,normPrivateKeyToScalar:c,weierstrassEquation:s,isWithinCurveOrder:function(t){return C(t,Bt,e.n)}}}({...e,toBytes(t,e,r){const o=e.toAffine(),i=n.toBytes(o.x),s=H;return y("isCompressed",r),r?s(Uint8Array.from([e.hasEvenY()?2:3]),i):s(Uint8Array.from([4]),i,n.toBytes(o.y))},fromBytes(t){const e=t.length,r=t[0],o=t.subarray(1);if(e!==s||2!==r&&3!==r){if(e===f&&4===r)return{x:n.fromBytes(o.subarray(0,n.BYTES)),y:n.fromBytes(o.subarray(n.BYTES,2*n.BYTES))};throw new Error("invalid Point, expected length of "+s+", or uncompressed "+f+", got "+e)}{const t=S(o);if(!C(t,Bt,n.ORDER))throw new Error("Point is not on curve");const e=h(t);let i;try{i=n.sqrt(e)}catch(t){const e=t instanceof Error?": "+t.message:"";throw new Error("Point is not on curve"+e)}return!(1&~r)!=((i&Bt)===Bt)&&(i=n.neg(i)),{x:t,y:i}}}});function w(t){return t>r>>Bt}const p=(t,e,n)=>S(t.slice(e,n));class m{constructor(t,e,n){U("r",t,Bt,r),U("s",e,Bt,r),this.r=t,this.s=e,null!=n&&(this.recovery=n),Object.freeze(this)}static fromCompact(t){const e=o;return t=q("compactSignature",t,2*e),new m(p(t,0,e),p(t,e,2*e))}static fromDER(t){const{r:e,s:n}=Et.toSig(q("DER",t));return new m(e,n)}assertValidity(){}addRecoveryBit(t){return new m(this.r,this.s,t)}recoverPublicKey(t){const{r,s:o,recovery:i}=this,s=x(q("msgHash",t));if(null==i||![0,1,2,3].includes(i))throw new Error("recovery id invalid");const f=2===i||3===i?r+e.n:r;if(f>=n.ORDER)throw new Error("recovery id 2 or 3 invalid");const l=1&i?"03":"02",h=c.fromHex(l+bt(f,n.BYTES)),d=u(f),w=a(-s*d),g=a(o*d),p=c.BASE.multiplyAndAddUnsafe(h,w,g);if(!p)throw new Error("point at infinify");return p.assertValidity(),p}hasHighS(){return w(this.s)}normalizeS(){return this.hasHighS()?new m(this.r,a(-this.s),this.recovery):this}toDERRawBytes(){return O(this.toDERHex())}toDERHex(){return Et.hexFromSig(this)}toCompactRawBytes(){return O(this.toCompactHex())}toCompactHex(){const t=o;return bt(this.r,t)+bt(this.s,t)}}const E={isValidPrivateKey(t){try{return l(t),!0}catch(t){return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const t=it(e.n);return function(t,e,n=!1){const r=t.length,o=ot(e),i=it(e);if(r<16||r<i||r>1024)throw new Error("expected "+i+"-1024 bytes of input, got "+r);const s=M(n?I(t):S(t),e-D)+D;return n?N(s,o):R(s,o)}(e.randomBytes(t),e.n)},precompute:(t=8,e=c.BASE)=>(e._setWindowSize(t),e.multiply(BigInt(3)),e)};function b(t){if("bigint"==typeof t)return!1;if(t instanceof c)return!0;const r=q("key",t).length,i=n.BYTES,s=i+1,f=2*i+1;return e.allowedPrivateKeyLengths||o===s?void 0:r===s||r===f}const v=e.bits2int||function(t){if(t.length>8192)throw new Error("input is too large");const e=S(t),n=8*t.length-i;return n>0?e>>BigInt(n):e},x=e.bits2int_modN||function(t){return a(v(t))},A=F(i);function L(t){return U("num < 2^"+i,t,vt,A),R(t,o)}const Z={lowS:e.lowS,prehash:!1},T={lowS:e.lowS,prehash:!1};return c.BASE._setWindowSize(8),{CURVE:e,getPublicKey:function(t,e=!0){return c.fromPrivateKey(t).toRawBytes(e)},getSharedSecret:function(t,e,n=!0){if(!0===b(t))throw new Error("first arg must be private key");if(!1===b(e))throw new Error("second arg must be public key");return c.fromHex(e).multiply(l(t)).toRawBytes(n)},sign:function(t,r,o=Z){const{seed:i,k2sig:s}=function(t,r,o=Z){if(["recovered","canonical"].some((t=>t in o)))throw new Error("sign() legacy options not supported");const{hash:i,randomBytes:s}=e;let{lowS:f,prehash:h,extraEntropy:g}=o;null==f&&(f=!0),t=q("msgHash",t),yt(o),h&&(t=q("prehashed msgHash",i(t)));const p=x(t),y=l(r),E=[L(y),L(p)];if(null!=g&&!1!==g){const t=!0===g?s(n.BYTES):g;E.push(q("extraEntropy",t))}const b=H(...E),B=p;return{seed:b,k2sig:function(t){const e=v(t);if(!d(e))return;const n=u(e),r=c.BASE.multiply(e).toAffine(),o=a(r.x);if(o===vt)return;const i=a(n*a(B+o*y));if(i===vt)return;let s=(r.x===o?0:2)|Number(r.y&Bt),l=i;return f&&w(i)&&(l=function(t){return w(t)?a(-t):t}(i),s^=1),new m(o,l,s)}}}(t,r,o),f=e;return function(t,e,n){if("number"!=typeof t||t<2)throw new Error("hashLen must be a number");if("number"!=typeof e||e<2)throw new Error("qByteLen must be a number");if("function"!=typeof n)throw new Error("hmacFn must be a function");let r=k(t),o=k(t),i=0;const s=()=>{r.fill(1),o.fill(0),i=0},f=(...t)=>n(o,r,...t),a=(t=k(0))=>{o=f(z([0]),t),r=f(),0!==t.length&&(o=f(z([1]),t),r=f())},u=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let t=0;const n=[];for(;t<e;){r=f();const e=r.slice();n.push(e),t+=r.length}return H(...n)};return(t,e)=>{let n;for(s(),a(t);!(n=e(u()));)a();return s(),n}}(f.hash.outputLen,f.nByteLength,f.hmac)(i,s)},verify:function(t,n,r,o=T){const i=t;n=q("msgHash",n),r=q("publicKey",r);const{lowS:s,prehash:f,format:l}=o;if(yt(o),"strict"in o)throw new Error("options.strict was renamed to lowS");if(void 0!==l&&"compact"!==l&&"der"!==l)throw new Error("format must be compact or der");const h="string"==typeof i||g(i),d=!h&&!l&&"object"==typeof i&&null!==i&&"bigint"==typeof i.r&&"bigint"==typeof i.s;if(!h&&!d)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let w,p;try{if(d&&(w=new m(i.r,i.s)),h){try{"compact"!==l&&(w=m.fromDER(i))}catch(t){if(!(t instanceof Et.Err))throw t}w||"der"===l||(w=m.fromCompact(i))}p=c.fromHex(r)}catch(t){return!1}if(!w)return!1;if(s&&w.hasHighS())return!1;f&&(n=e.hash(n));const{r:y,s:E}=w,b=x(n),v=u(E),B=a(b*v),A=a(y*v),O=c.BASE.multiplyAndAddUnsafe(p,B,A)?.toAffine();return!!O&&a(O.x)===y},ProjectivePoint:c,Signature:m,utils:E}}function St(t){return{hash:t,hmac:(e,...n)=>h(t,e,(0,r.Id)(...n)),randomBytes:r.po}}const It=BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),Rt=BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),Nt=BigInt(0),qt=BigInt(1),Ht=BigInt(2),Lt=(t,e)=>(t+e/Ht)/e;const Ct=rt(It,void 0,void 0,{sqrt:function(t){const e=It,n=BigInt(3),r=BigInt(6),o=BigInt(11),i=BigInt(22),s=BigInt(23),f=BigInt(44),a=BigInt(88),u=t*t*t%e,c=u*u*t%e,l=W(c,n,e)*c%e,h=W(l,n,e)*c%e,d=W(h,Ht,e)*u%e,w=W(d,o,e)*d%e,g=W(w,i,e)*w%e,p=W(g,f,e)*g%e,y=W(p,a,e)*p%e,m=W(y,f,e)*g%e,E=W(m,n,e)*c%e,b=W(E,s,e)*w%e,v=W(b,r,e)*u%e,B=W(v,Ht,e);if(!Ct.eql(Ct.sqr(B),t))throw new Error("Cannot find square root");return B}}),Ut=function(t,e){const n=e=>Ot({...t,...St(e)});return{...n(e),create:n}}({a:Nt,b:BigInt(7),Fp:Ct,n:Rt,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:t=>{const e=Rt,n=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),r=-qt*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),o=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=n,s=BigInt("0x100000000000000000000000000000000"),f=Lt(i*t,e),a=Lt(-r*t,e);let u=M(t-f*n-a*o,e),c=M(-f*r-a*i,e);const l=u>s,h=c>s;if(l&&(u=e-u),h&&(c=e-c),u>s||c>s)throw new Error("splitScalar: Endomorphism failed, k="+t);return{k1neg:l,k1:u,k2neg:h,k2:c}}}},c)}}]);
|
package/index.html
CHANGED
@@ -1 +1 @@
|
|
1
|
-
<!doctype html><html lang="en"><head><meta charset="utf-8"><title>SubWallet</title><script inline inline-asset="fallback.js$" inline-asset-delete></script><script inline inline-asset="web-runner.js$" inline-asset-delete></script><script defer="defer" src="fallback-a4bb9c5dd9b5093ca29f.js"></script><script defer="defer" src="web-runner-
|
1
|
+
<!doctype html><html lang="en"><head><meta charset="utf-8"><title>SubWallet</title><script inline inline-asset="fallback.js$" inline-asset-delete></script><script inline inline-asset="web-runner.js$" inline-asset-delete></script><script defer="defer" src="fallback-a4bb9c5dd9b5093ca29f.js"></script><script defer="defer" src="web-runner-8190e7f6c77a8a5fae9b.js"></script></head><body><div id="root">SubWallet</div></body></html>
|
@@ -1408,7 +1408,6 @@
|
|
1408
1408
|
"Apply fee": "",
|
1409
1409
|
"Edit fee": "",
|
1410
1410
|
"High": "",
|
1411
|
-
"Coming soon!": "",
|
1412
1411
|
"Process": "",
|
1413
1412
|
"Swap details": "",
|
1414
1413
|
"Stake details": "",
|
@@ -1465,9 +1464,7 @@
|
|
1465
1464
|
"Subnet": "",
|
1466
1465
|
"You can't receive less than {{number}} {{symbol}}": "",
|
1467
1466
|
"Sender available balance": "",
|
1468
|
-
"A staking fee of 0.00005 TAO will be deducted from your stake once the transaction is complete": "",
|
1469
1467
|
"TAO staking fee": "",
|
1470
|
-
"An unstaking fee of 0.00005 TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1471
1468
|
"TAO unstaking fee": "",
|
1472
1469
|
"No swap quote found. Change your network endpoint or adjust amount and try again": "",
|
1473
1470
|
"Best": "",
|
@@ -1588,12 +1585,21 @@
|
|
1588
1585
|
"Nominate": "",
|
1589
1586
|
"Move your stake confirm": "",
|
1590
1587
|
"Change validator confirm": "",
|
1591
|
-
"A fee equivalent of 0.00005 TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1592
1588
|
"Validator change fee": "",
|
1593
1589
|
"Tip: Hit “View process” to view step-by-step details of your swap": "",
|
1594
1590
|
"Swap in process": "",
|
1595
1591
|
"DO NOT close the app!": "",
|
1596
1592
|
"Unable to load data": "",
|
1597
1593
|
"Something went wrong while loading data for this screen.": "",
|
1598
|
-
"<highlight>Reload now</highlight> to get the new data": ""
|
1594
|
+
"<highlight>Reload now</highlight> to get the new data": "",
|
1595
|
+
"No valid accounts found to import": "",
|
1596
|
+
"Max fee cannot be lower than priority fee": "",
|
1597
|
+
"This fee can't be edited with the current RPC connection": "",
|
1598
|
+
"Turn off VPN/ad blocker apps, reload the dApp, and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1599
|
+
"Turn off some networks on the wallet or close any privacy protection apps (e.g. VPN, ad blocker apps) and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1600
|
+
"A staking fee of {{fee}} TAO will be deducted from your stake once the transaction is complete": "",
|
1601
|
+
"A fee equivalent of {{fee}} TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1602
|
+
"An unstaking fee of {{fee}} TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1603
|
+
"Unable to stake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your stake amount or increase slippage and try again": "",
|
1604
|
+
"Unable to unstake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your unstake amount or increase slippage and try again": ""
|
1599
1605
|
}
|
@@ -1408,7 +1408,6 @@
|
|
1408
1408
|
"Apply fee": "",
|
1409
1409
|
"Edit fee": "",
|
1410
1410
|
"High": "",
|
1411
|
-
"Coming soon!": "",
|
1412
1411
|
"Process": "",
|
1413
1412
|
"Swap details": "",
|
1414
1413
|
"Stake details": "",
|
@@ -1465,9 +1464,7 @@
|
|
1465
1464
|
"Subnet": "",
|
1466
1465
|
"You can't receive less than {{number}} {{symbol}}": "",
|
1467
1466
|
"Sender available balance": "",
|
1468
|
-
"A staking fee of 0.00005 TAO will be deducted from your stake once the transaction is complete": "",
|
1469
1467
|
"TAO staking fee": "",
|
1470
|
-
"An unstaking fee of 0.00005 TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1471
1468
|
"TAO unstaking fee": "",
|
1472
1469
|
"No swap quote found. Change your network endpoint or adjust amount and try again": "",
|
1473
1470
|
"Best": "",
|
@@ -1588,12 +1585,21 @@
|
|
1588
1585
|
"Nominate": "",
|
1589
1586
|
"Move your stake confirm": "",
|
1590
1587
|
"Change validator confirm": "",
|
1591
|
-
"A fee equivalent of 0.00005 TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1592
1588
|
"Validator change fee": "",
|
1593
1589
|
"Tip: Hit “View process” to view step-by-step details of your swap": "",
|
1594
1590
|
"Swap in process": "",
|
1595
1591
|
"DO NOT close the app!": "",
|
1596
1592
|
"Unable to load data": "",
|
1597
1593
|
"Something went wrong while loading data for this screen.": "",
|
1598
|
-
"<highlight>Reload now</highlight> to get the new data": ""
|
1594
|
+
"<highlight>Reload now</highlight> to get the new data": "",
|
1595
|
+
"No valid accounts found to import": "",
|
1596
|
+
"Max fee cannot be lower than priority fee": "",
|
1597
|
+
"This fee can't be edited with the current RPC connection": "",
|
1598
|
+
"Turn off VPN/ad blocker apps, reload the dApp, and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1599
|
+
"Turn off some networks on the wallet or close any privacy protection apps (e.g. VPN, ad blocker apps) and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1600
|
+
"A staking fee of {{fee}} TAO will be deducted from your stake once the transaction is complete": "",
|
1601
|
+
"A fee equivalent of {{fee}} TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1602
|
+
"An unstaking fee of {{fee}} TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1603
|
+
"Unable to stake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your stake amount or increase slippage and try again": "",
|
1604
|
+
"Unable to unstake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your unstake amount or increase slippage and try again": ""
|
1599
1605
|
}
|
@@ -1408,7 +1408,6 @@
|
|
1408
1408
|
"Apply fee": "",
|
1409
1409
|
"Edit fee": "",
|
1410
1410
|
"High": "",
|
1411
|
-
"Coming soon!": "",
|
1412
1411
|
"Process": "",
|
1413
1412
|
"Swap details": "",
|
1414
1413
|
"Stake details": "",
|
@@ -1465,9 +1464,7 @@
|
|
1465
1464
|
"Subnet": "",
|
1466
1465
|
"You can't receive less than {{number}} {{symbol}}": "",
|
1467
1466
|
"Sender available balance": "",
|
1468
|
-
"A staking fee of 0.00005 TAO will be deducted from your stake once the transaction is complete": "",
|
1469
1467
|
"TAO staking fee": "",
|
1470
|
-
"An unstaking fee of 0.00005 TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1471
1468
|
"TAO unstaking fee": "",
|
1472
1469
|
"No swap quote found. Change your network endpoint or adjust amount and try again": "",
|
1473
1470
|
"Best": "",
|
@@ -1588,12 +1585,21 @@
|
|
1588
1585
|
"Nominate": "",
|
1589
1586
|
"Move your stake confirm": "",
|
1590
1587
|
"Change validator confirm": "",
|
1591
|
-
"A fee equivalent of 0.00005 TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1592
1588
|
"Validator change fee": "",
|
1593
1589
|
"Tip: Hit “View process” to view step-by-step details of your swap": "",
|
1594
1590
|
"Swap in process": "",
|
1595
1591
|
"DO NOT close the app!": "",
|
1596
1592
|
"Unable to load data": "",
|
1597
1593
|
"Something went wrong while loading data for this screen.": "",
|
1598
|
-
"<highlight>Reload now</highlight> to get the new data": ""
|
1594
|
+
"<highlight>Reload now</highlight> to get the new data": "",
|
1595
|
+
"No valid accounts found to import": "",
|
1596
|
+
"Max fee cannot be lower than priority fee": "",
|
1597
|
+
"This fee can't be edited with the current RPC connection": "",
|
1598
|
+
"Turn off VPN/ad blocker apps, reload the dApp, and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1599
|
+
"Turn off some networks on the wallet or close any privacy protection apps (e.g. VPN, ad blocker apps) and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1600
|
+
"A staking fee of {{fee}} TAO will be deducted from your stake once the transaction is complete": "",
|
1601
|
+
"A fee equivalent of {{fee}} TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1602
|
+
"An unstaking fee of {{fee}} TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1603
|
+
"Unable to stake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your stake amount or increase slippage and try again": "",
|
1604
|
+
"Unable to unstake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your unstake amount or increase slippage and try again": ""
|
1599
1605
|
}
|
@@ -1408,7 +1408,6 @@
|
|
1408
1408
|
"Apply fee": "",
|
1409
1409
|
"Edit fee": "",
|
1410
1410
|
"High": "",
|
1411
|
-
"Coming soon!": "",
|
1412
1411
|
"Process": "",
|
1413
1412
|
"Swap details": "",
|
1414
1413
|
"Stake details": "",
|
@@ -1465,9 +1464,7 @@
|
|
1465
1464
|
"Subnet": "",
|
1466
1465
|
"You can't receive less than {{number}} {{symbol}}": "",
|
1467
1466
|
"Sender available balance": "",
|
1468
|
-
"A staking fee of 0.00005 TAO will be deducted from your stake once the transaction is complete": "",
|
1469
1467
|
"TAO staking fee": "",
|
1470
|
-
"An unstaking fee of 0.00005 TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1471
1468
|
"TAO unstaking fee": "",
|
1472
1469
|
"No swap quote found. Change your network endpoint or adjust amount and try again": "",
|
1473
1470
|
"Best": "",
|
@@ -1588,12 +1585,21 @@
|
|
1588
1585
|
"Nominate": "",
|
1589
1586
|
"Move your stake confirm": "",
|
1590
1587
|
"Change validator confirm": "",
|
1591
|
-
"A fee equivalent of 0.00005 TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1592
1588
|
"Validator change fee": "",
|
1593
1589
|
"Tip: Hit “View process” to view step-by-step details of your swap": "",
|
1594
1590
|
"Swap in process": "",
|
1595
1591
|
"DO NOT close the app!": "",
|
1596
1592
|
"Unable to load data": "",
|
1597
1593
|
"Something went wrong while loading data for this screen.": "",
|
1598
|
-
"<highlight>Reload now</highlight> to get the new data": ""
|
1594
|
+
"<highlight>Reload now</highlight> to get the new data": "",
|
1595
|
+
"No valid accounts found to import": "",
|
1596
|
+
"Max fee cannot be lower than priority fee": "",
|
1597
|
+
"This fee can't be edited with the current RPC connection": "",
|
1598
|
+
"Turn off VPN/ad blocker apps, reload the dApp, and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1599
|
+
"Turn off some networks on the wallet or close any privacy protection apps (e.g. VPN, ad blocker apps) and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1600
|
+
"A staking fee of {{fee}} TAO will be deducted from your stake once the transaction is complete": "",
|
1601
|
+
"A fee equivalent of {{fee}} TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1602
|
+
"An unstaking fee of {{fee}} TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1603
|
+
"Unable to stake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your stake amount or increase slippage and try again": "",
|
1604
|
+
"Unable to unstake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your unstake amount or increase slippage and try again": ""
|
1599
1605
|
}
|
@@ -1408,7 +1408,6 @@
|
|
1408
1408
|
"Apply fee": "",
|
1409
1409
|
"Edit fee": "",
|
1410
1410
|
"High": "",
|
1411
|
-
"Coming soon!": "",
|
1412
1411
|
"Process": "",
|
1413
1412
|
"Swap details": "",
|
1414
1413
|
"Stake details": "",
|
@@ -1465,9 +1464,7 @@
|
|
1465
1464
|
"Subnet": "",
|
1466
1465
|
"You can't receive less than {{number}} {{symbol}}": "",
|
1467
1466
|
"Sender available balance": "",
|
1468
|
-
"A staking fee of 0.00005 TAO will be deducted from your stake once the transaction is complete": "",
|
1469
1467
|
"TAO staking fee": "",
|
1470
|
-
"An unstaking fee of 0.00005 TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1471
1468
|
"TAO unstaking fee": "",
|
1472
1469
|
"No swap quote found. Change your network endpoint or adjust amount and try again": "",
|
1473
1470
|
"Best": "",
|
@@ -1588,12 +1585,21 @@
|
|
1588
1585
|
"Nominate": "",
|
1589
1586
|
"Move your stake confirm": "",
|
1590
1587
|
"Change validator confirm": "",
|
1591
|
-
"A fee equivalent of 0.00005 TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1592
1588
|
"Validator change fee": "",
|
1593
1589
|
"Tip: Hit “View process” to view step-by-step details of your swap": "",
|
1594
1590
|
"Swap in process": "",
|
1595
1591
|
"DO NOT close the app!": "",
|
1596
1592
|
"Unable to load data": "",
|
1597
1593
|
"Something went wrong while loading data for this screen.": "",
|
1598
|
-
"<highlight>Reload now</highlight> to get the new data": ""
|
1594
|
+
"<highlight>Reload now</highlight> to get the new data": "",
|
1595
|
+
"No valid accounts found to import": "",
|
1596
|
+
"Max fee cannot be lower than priority fee": "",
|
1597
|
+
"This fee can't be edited with the current RPC connection": "",
|
1598
|
+
"Turn off VPN/ad blocker apps, reload the dApp, and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1599
|
+
"Turn off some networks on the wallet or close any privacy protection apps (e.g. VPN, ad blocker apps) and try again. If the issue persists, contact support at agent@subwallet.app": "",
|
1600
|
+
"A staking fee of {{fee}} TAO will be deducted from your stake once the transaction is complete": "",
|
1601
|
+
"A fee equivalent of {{fee}} TAO will be deducted from your stake amount on the new validator once the transaction is complete": "",
|
1602
|
+
"An unstaking fee of {{fee}} TAO will be deducted from your unstaked amount once the transaction is complete": "",
|
1603
|
+
"Unable to stake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your stake amount or increase slippage and try again": "",
|
1604
|
+
"Unable to unstake due to a slippage of {{slippage}}%, which exceeds the current slippage set for this transaction. Lower your unstake amount or increase slippage and try again": ""
|
1599
1605
|
}
|
package/package.json
CHANGED
@@ -14,13 +14,13 @@
|
|
14
14
|
},
|
15
15
|
"sideEffects": false,
|
16
16
|
"type": "module",
|
17
|
-
"version": "1.3.
|
17
|
+
"version": "1.3.54-0",
|
18
18
|
"dependencies": {
|
19
19
|
"@babel/runtime": "^7.20.6",
|
20
20
|
"@emurgo/cardano-serialization-lib-browser": "^13.2.0",
|
21
|
-
"@subwallet/extension-base": "^1.3.
|
22
|
-
"@subwallet/extension-inject": "^1.3.
|
23
|
-
"@subwallet/extension-koni-ui": "^1.3.
|
21
|
+
"@subwallet/extension-base": "^1.3.54-0",
|
22
|
+
"@subwallet/extension-inject": "^1.3.54-0",
|
23
|
+
"@subwallet/extension-koni-ui": "^1.3.54-0"
|
24
24
|
},
|
25
25
|
"devDependencies": {
|
26
26
|
"@polkadot/dev": "^0.65.23",
|