LZMA压缩,求大神修改一下原始JS,让它可以本地运行

diudiut · 发表于 2019-2-14 23:41:04

js地址: https://www.blgj04.com/static/public/js/lib/lzma/lzma-c.js

发起的JS

submit_bet:function (params,callBack) {
         if(!params['lottery_id']){
            callBack(get_result('彩票ID不能为空！'));
            return;
         }
         if(!params['issue']){
            callBack(get_result('期号不能为空！'));
            return;
         }
         params.command_id = 521;
         params = JSON.stringify(params);
         if(params.length > 4096){                      //应该是从这里开始,好像意思是文本长度大于4096,就会进行压缩...然后就会执行上面的JS
            LZMA.compress(params, lottery_util.lzma_compression_mode, function (compress_params) {
                  compress_params.splice(5, 8);
                  compress_params = lottery_util.convert_lzma_binary_to_formated_hex(compress_params);
                  lottery_util.submit_bet(compress_params,callBack);
            }, function (a) {});
         }else{
            lottery_util.submit_bet(params,callBack);
         }
      },


..因为是网站,所以中途还有验证登录没有之类的,希望能去除掉这些验证.就本地运行,主要目的是获取它的LZMA加密压缩的结果.并不需要网络..

希望结果就像

这样..输入参数,就能直接返回结果..这个是我网上找的,虽然原理一样,但是压缩出来的结果和我需要的这个网站的结果有些不一样..个人不太懂JS.希望大神能帮忙.谢谢

diudiut · 发表于 2019-2-14 23:49:22

这个是JS代码:

var e = function () {
"use strict";
function r(e) {
      function r() {
      }

      return rt = r.prototype = e || new ft, r
}

function t(e, r) {
      postMessage({action: nt, cbn: r, result: e})
}

function n(e) {
      return Array(e)
}

function s(e, r) {
      var t, n;
      return t = e[1] + r[1], n = e[0] + r[0], _(n, t)
}

function o(e, r) {
      return m(~~Math.max(Math.min(e[1] / ot, 2147483647), -2147483648) & ~~Math.max(Math.min(r[1] / ot, 2147483647), -2147483648), u(e) & u(r))
}

function i(e, r) {
      var t, n;
      return e[0] == r[0] && e[1] == r[1] ? 0 : (t = 0 > e[1], n = 0 > r[1], t && !n ? -1 : !t && n ? 1 : v(e, r)[1] < 0 ? -1 : 1)
}

function _(e, r) {
      var t, n;
      for (r %= 0x10000000000000000, e %= 0x10000000000000000, t = r % ot, n = Math.floor(e / ot) * ot, r = r - t + n, e = e - n + t; 0 > e;)e += ot, r -= ot;
      for (; e > 4294967295;)e -= ot, r += ot;
      for (r %= 0x10000000000000000; r > 0x7fffffff00000000;)r -= 0x10000000000000000;
      for (; -0x8000000000000000 > r;)r += 0x10000000000000000;
      return [e, r]
}

function a(e, r) {
      return e[0] == r[0] && e[1] == r[1]
}

function c(e) {
      var r, t;
      return e > -129 && 128 > e ? (r = e + 128, t = ut[r], null == t && (t = ut[r] = f(e)), t) : f(e)
}

function f(e) {
      return e >= 0 ? [e, 0] : [e + ot, -ot]
}

function u(e) {
      return e[0] >= 2147483648 ? ~~Math.max(Math.min(e[0] - ot, 2147483647), -2147483648) : ~~Math.max(Math.min(e[0], 2147483647), -2147483648)
}

function m(e, r) {
      var t, n;
      return t = e * ot, n = r, 0 > r && (n += ot), [n, t]
}

function p(e) {
      var r, t;
      return a(e, _t) ? _t : (r = -e[1], t = -e[0], t > 4294967295 && (t -= ot, r += ot), 0 > t && (t += ot, r -= ot), [t, r])
}

function d(e) {
      return 30 >= e ? 1 << e : d(30) * d(e - 30)
}

function h(e, r) {
      var t, n, s, o;
      return r &= 63, a(e, _t) ? 0 == r ? e : at : 0 > e[1] ? p(h(p(e), r)) : (o = d(r), n = e[1] * o % 0x10000000000000000, s = e[0] * o, t = s - s % ot, n += t, s -= t, n >= 0x8000000000000000 && (n -= 0x10000000000000000), [s, n])
}

function P(e, r) {
      var t, n, s;
      return r &= 63, s = d(r), t = e[1] / s, n = Math.floor(e[0] / s), _(n, t)
}

function l(e, r) {
      var t;
      return r &= 63, t = P(e, r), 0 > e[1] && (t = s(t, h([2, 0], 63 - r))), t
}

function v(e, r) {
      var t, n;
      return t = e[1] - r[1], n = e[0] - r[0], _(n, t)
}

function B(e, r) {
      return e.gc = r, e.dc = 0, e.Cb = r.length, e
}

function S(e, r, t, n) {
      return e.dc >= e.Cb ? -1 : (n = Math.min(n, e.Cb - e.dc), y(e.gc, e.dc, r, t, n), e.dc += n, n)
}

function k(e) {
      return e.gc = n(32), e
}

function b(e) {
      var r = e.gc;
      return r.length = e.Cb, r
}

function M(e, r) {
      e.gc[e.Cb++] = r << 24 >> 24
}

function E(e, r, t, n) {
      y(r, t, e.gc, e.Cb, n), e.Cb += n
}

function g(e, r, t, n, s) {
      var o;
      for (o = r; t > o; ++o)n[s++] = e.charCodeAt(o)
}

function y(e, r, t, n, s) {
      for (var o = 0; s > o; ++o)t[n + o] = e[r + o]
}

function R(e, r) {
      pr(r, 1 << e.ds), r.i = e.fb, hr(r, e.mf), dr(r, e.lc, e.lp, e.pb)
}

function L(e, r, t, n, s) {
      var o, _;
      if (i(n, it) < 0)throw Error("invalid length " + n);
      for (e.hc = n, o = er(new Mt), R(s, o), o.Yb = !0, Pr(o, t), _ = 0; 64 > _; _ += 8)M(t, 255 & u(P(n, _)));
      e.ac = (o.Q = !1, o.Mb = r, o.Lb = !1, $(o), o.d.fc = t, ar(o), tr(o), rr(o), o.T.$ = o.i + 1 - 2, Rr(o.T, 1 << o.D), o.h.$ = o.i + 1 - 2, Rr(o.h, 1 << o.D), void(o.w = at), j(new kt, o))
}

function F(e, r, t) {
      return e.ec = k(new ht), L(e, B(new pt, r), e.ec, c(r.length), t), e
}

function w(e, r, t, s) {
      var o;
      e.zb = r, e.qb = t, o = r + t + s, (null == e.c || e.nb != o) && (e.c = null, e.nb = o, e.c = n(e.nb)), e.z = e.nb - t
}

function z(e, r) {
      return e.c[e.e + e.v + r]
}

function C(e, r, t, n) {
      var s, o;
      for (e.S && e.v + r + n > e.q && (n = e.q - (e.v + r)), ++t, o = e.e + e.v + r, s = 0; n > s && e.c[o + s] == e.c[o + s - t]; ++s);
      return s
}

function x(e) {
      return e.q - e.v
}

function D(e) {
      var r, t, n;
      for (n = e.e + e.v - e.zb, n > 0 && --n, t = e.e + e.q - n, r = 0; t > r; ++r)e.c[r] = e.c[n + r];
      e.e -= n
}

function A(e) {
      var r;
      ++e.v, e.v > e.eb && (r = e.e + e.v, r > e.z && D(e), O(e))
}

function O(e) {
      var r, t, n;
      if (!e.S)for (; ;) {
         if (n = -e.e + e.nb - e.q, 0 == n)return;
         if (r = S(e.bc, e.c, e.e + e.q, n), -1 == r)return e.eb = e.q, t = e.e + e.eb, t > e.z && (e.eb = e.z - e.e), void(e.S = 1);
         e.q += r, e.q >= e.v + e.qb && (e.eb = e.q - e.qb)
      }
}

function I(e, r) {
      e.e += r, e.eb -= r, e.v -= r, e.q -= r
}

function H(e, r, t, s, o) {
      var i, _, a;
      1073741567 > r && (e.Nb = 16 + (s >> 1), a = ~~((r + t + s + o) / 2) + 256, w(e, r + t, s + o, a), e.hb = s, i = r + 1, e.k != i && (e.J = n(2 * (e.k = i))), _ = 65536, e._ && (_ = r - 1, _ |= _ >> 1, _ |= _ >> 2, _ |= _ >> 4, _ |= _ >> 8, _ >>= 1, _ |= 65535, _ > 16777216 && (_ >>= 1), e.Xb = _, ++_, _ += e.E), _ != e.ub && (e.ib = n(e.ub = _)))
}

function N(e, r) {
      var t, n, s, o, i, _, a, c, f, u, m, p, d, h, P, l, v, B, S, k, b;
      if (e.q >= e.v + e.hb)h = e.hb; else if (h = e.q - e.v, e.Z > h)return T(e), 0;
      for (v = 0, P = e.v > e.k ? e.v - e.k : 0, n = e.e + e.v, l = 1, c = 0, f = 0, e._ ? (b = Bt[255 & e.c[n]] ^ 255 & e.c[n + 1], c = 1023 & b, b ^= (255 & e.c[n + 2]) << 8, f = 65535 & b, u = (b ^ Bt[255 & e.c[n + 3]] << 5) & e.Xb) : u = 255 & e.c[n] ^ (255 & e.c[n + 1]) << 8, s = e.ib[e.E + u] || 0, e._ && (o = e.ib[c] || 0, i = e.ib[1024 + f] || 0, e.ib[c] = e.v, e.ib[1024 + f] = e.v, o > P && e.c[e.e + o] == e.c[n] && (r[v++] = l = 2, r[v++] = e.v - o - 1), i > P && e.c[e.e + i] == e.c[n] && (i == o && (v -= 2), r[v++] = l = 3, r[v++] = e.v - i - 1, o = i), 0 != v && o == s && (v -= 2, l = 1)), e.ib[e.E + u] = e.v, S = (e.g << 1) + 1, k = e.g << 1, p = d = e.p, 0 != e.p && s > P && e.c[e.e + s + e.p] != e.c[n + e.p] && (r[v++] = l = e.p, r[v++] = e.v - s - 1), t = e.Nb; ;) {
         if (P >= s || 0 == t--) {
            e.J[S] = e.J[k] = 0;
            break
         }
         if (a = e.v - s, _ = (e.g >= a ? e.g - a : e.g - a + e.k) << 1, B = e.e + s, m = d > p ? p : d, e.c[B + m] == e.c[n + m]) {
            for (; ++m != h && e.c[B + m] == e.c[n + m];);
            if (m > l && (r[v++] = l = m, r[v++] = a - 1, m == h)) {
                  e.J[k] = e.J[_], e.J[S] = e.J[_ + 1];
                  break
            }
         }
         (255 & e.c[n + m]) > (255 & e.c[B + m]) ? (e.J[k] = s, k = _ + 1, s = e.J[k], d = m) : (e.J[S] = s, S = _, s = e.J[S], p = m)
      }
      return T(e), v
}

function G(e) {
      e.e = 0, e.v = 0, e.q = 0, e.S = 0, O(e), e.g = 0, I(e, -1)
}

function T(e) {
      var r;
      ++e.g >= e.k && (e.g = 0), A(e), 1073741823 == e.v && (r = e.v - e.k, W(e.J, 2 * e.k, r), W(e.ib, e.ub, r), I(e, r))
}

function W(e, r, t) {
      var n, s;
      for (n = 0; r > n; ++n)s = e[n] || 0, t >= s ? s = 0 : s -= t, e[n] = s
}

function Y(e, r) {
      e._ = r > 2, e._ ? (e.p = 0, e.Z = 4, e.E = 66560) : (e.p = 2, e.Z = 3, e.E = 0)
}

function Z(e, r) {
      var t, n, s, o, i, _, a, c, f, u, m, p, d, h, P, l, v;
      do {
         if (e.q >= e.v + e.hb)p = e.hb; else if (p = e.q - e.v, e.Z > p) {
            T(e);
            continue
         }
         for (d = e.v > e.k ? e.v - e.k : 0, n = e.e + e.v, e._ ? (v = Bt[255 & e.c[n]] ^ 255 & e.c[n + 1], _ = 1023 & v, e.ib[_] = e.v, v ^= (255 & e.c[n + 2]) << 8, a = 65535 & v, e.ib[1024 + a] = e.v, c = (v ^ Bt[255 & e.c[n + 3]] << 5) & e.Xb) : c = 255 & e.c[n] ^ (255 & e.c[n + 1]) << 8, s = e.ib[e.E + c], e.ib[e.E + c] = e.v, P = (e.g << 1) + 1, l = e.g << 1, u = m = e.p, t = e.Nb; ;) {
            if (d >= s || 0 == t--) {
                  e.J[P] = e.J[l] = 0;
                  break
            }
            if (i = e.v - s, o = (e.g >= i ? e.g - i : e.g - i + e.k) << 1, h = e.e + s, f = m > u ? u : m, e.c[h + f] == e.c[n + f]) {
                  for (; ++f != p && e.c[h + f] == e.c[n + f];);
                  if (f == p) {
                     e.J[l] = e.J[o], e.J[P] = e.J[o + 1];
                     break
                  }
            }
            (255 & e.c[n + f]) > (255 & e.c[h + f]) ? (e.J[l] = s, l = o + 1, s = e.J[l], m = f) : (e.J[P] = s, P = o, s = e.J[P], u = f)
         }
         T(e)
      } while (0 != --r)
}

function V(e) {
      return e -= 2, 4 > e ? e : 3
}

function J(e) {
      return 4 > e ? 0 : 10 > e ? e - 3 : e - 6
}

function j(e, r) {
      return e.gb = r, e.ic = null, e.cc = !0, e
}

function K(e) {
      if (!e.cc)throw Error("bad state");
      if (!e.gb)throw Error("No decoding");
      return q(e), e.cc
}

function q(e) {
      X(e.gb, e.gb.Ab, e.gb.Qb, e.gb.Zb), e.Rb = e.gb.Ab[0], e.gb.Zb[0] && (mr(e.gb), e.cc = !1)
}

function Q(e, r) {
      var t, n, s, o;
      e.P = r, s = e.a[r].n, n = e.a[r].f;
      do e.a[r].r && (Ar(e.a[s]), e.a[s].n = s - 1, e.a[r].Sb && (e.a[s - 1].r = 0, e.a[s - 1].n = e.a[r].n2, e.a[s - 1].f = e.a[r].f2)), o = s, t = n, n = e.a[o].f, s = e.a[o].n, e.a[o].f = t, e.a[o].n = r, r = o; while (r > 0);
      return e.fb = e.a[0].f, e.l = e.a[0].n
}

function U(e) {
      var r;
      for (e.j = 0, e.C = 0, r = 0; 4 > r; ++r)e.s[r] = 0
}

function X(e, r, t, n) {
      var o, _, f, m, p, d, h, P, l, B, S, k, b, M, E;
      if (r[0] = at, t[0] = at, n[0] = !0, e.Mb && (e.b.bc = e.Mb, G(e.b), e.Q = !0, e.Mb = null), !e.Lb) {
         if (e.Lb = !0, M = e.w, a(e.w, at)) {
            if (0 == x(e.b))return void nr(e, u(e.w));
            fr(e), b = u(e.w) & e.t, Vr(e.d, e.A, (e.j << 4) + b, 0), e.j = J(e.j), f = z(e.b, -e.o), zr(Fr(e.y, u(e.w), e.C), e.d, f), e.C = f, --e.o, e.w = s(e.w, ct)
         }
         if (0 == x(e.b))return void nr(e, u(e.w));
         for (; ;) {
            if (h = sr(e, u(e.w)), B = e.fb, b = u(e.w) & e.t, _ = (e.j << 4) + b, 1 == h && -1 == B)Vr(e.d, e.A, _, 0), f = z(e.b, -e.o), E = Fr(e.y, u(e.w), e.C), 7 > e.j ? zr(E, e.d, f) : (l = z(e.b, -e.s[0] - 1 - e.o), Cr(E, e.d, l, f)), e.C = f, e.j = J(e.j); else {
                  if (Vr(e.d, e.A, _, 1), 4 > B) {
                     if (Vr(e.d, e.X, e.j, 1), 0 == B ? (Vr(e.d, e.db, e.j, 0), 1 == h ? Vr(e.d, e.U, _, 0) : Vr(e.d, e.U, _, 1)) : (Vr(e.d, e.db, e.j, 1), 1 == B ? Vr(e.d, e.xb, e.j, 0) : (Vr(e.d, e.xb, e.j, 1), Vr(e.d, e.Pb, e.j, B - 2))), 1 == h ? e.j = 7 > e.j ? 9 : 11 : (Er(e.h, e.d, h - 2, b), e.j = 7 > e.j ? 8 : 11), m = e.s[B], 0 != B) {
                        for (d = B; d >= 1; --d)e.s[d] = e.s[d - 1];
                        e.s[0] = m
                     }
                  } else {
                     for (Vr(e.d, e.X, e.j, 0), e.j = 7 > e.j ? 7 : 10, Er(e.T, e.d, h - 2, b), B -= 4, k = vr(B), P = V(h), Hr(e.H[P], e.d, k), k >= 4 && (p = (k >> 1) - 1, o = (2 | 1 & k) << p, S = B - o, 14 > k ? Wr(e.vb, o - k - 1, e.d, p, S) : (Jr(e.d, S >> 4, p - 4), Gr(e.O, e.d, 15 & S), ++e.ab)), m = B, d = 3; d >= 1; --d)e.s[d] = e.s[d - 1];
                     e.s[0] = m, ++e.cb
                  }
                  e.C = z(e.b, h - 1 - e.o)
            }
            if (e.o -= h, e.w = s(e.w, c(h)), 0 == e.o) {
                  if (e.cb >= 128 && tr(e), e.ab >= 16 && rr(e), r[0] = e.w, t[0] = Kr(e.d), 0 == x(e.b))return void nr(e, u(e.w));
                  if (i(v(e.w, M), [4096, 0]) >= 0)return e.Lb = !1, void(n[0] = !1)
            }
         }
      }
}

function $(e) {
      var r, t;
      e.b || (r = new St, t = 4, 0 == e.R && (t = 2), Y(r, t), e.b = r), Lr(e.y, e.F, e.K), (e.I != e.V || e.sb != e.i) && (H(e.b, e.I, 4096, e.i, 274), e.V = e.I, e.sb = e.i)
}

function er(e) {
      var r;
      for (e.s = [0, 0, 0, 0], e.a = n(4096), e.d = new zt, e.A = n(192), e.X = n(12), e.db = n(12), e.xb = n(12), e.Pb = n(12), e.U = n(192), e.H = [0, 0, 0, 0], e.vb = n(114), e.O = Ir(new Ft, 4), e.T = gr(new gt), e.h = gr(new gt), e.y = new yt, e.m = n(548), e.M = n(256), e.bb = n(512), e.Jb = n(16), e.x = [0, 0, 0, 0], e.L = [0, 0, 0, 0], e.Ab = [at], e.Qb = [at], e.Zb = [!1], e.Ib = n(5), e.Tb = n(128), r = 0; 4096 > r; ++r)e.a[r] = new Lt;
      for (r = 0; 4 > r; ++r)e.H[r] = Ir(new Ft, 6);
      return e
}

function rr(e) {
      var r;
      for (r = 0; 16 > r; ++r)e.Jb[r] = Tr(e.O, r);
      e.ab = 0
}

function tr(e) {
      var r, t, n, s, o, i, _, a;
      for (s = 4; 128 > s; ++s)i = vr(s), n = (i >> 1) - 1, r = (2 | 1 & i) << n, e.Tb[s] = Yr(e.vb, r - i - 1, n, s - r);
      for (o = 0; 4 > o; ++o) {
         for (t = e.H[o], _ = o << 6, i = 0; e.pb > i; ++i)e.M[_ + i] = Nr(t, i);
         for (i = 14; e.pb > i; ++i)e.M[_ + i] += (i >> 1) - 1 - 4 << 6;
         for (a = 128 * o, s = 0; 4 > s; ++s)e.bb[a + s] = e.M[_ + s];
         for (; 128 > s; ++s)e.bb[a + s] = e.M[_ + vr(s)] + e.Tb[s]
      }
      e.cb = 0
}

function nr(e, r) {
      ur(e), lr(e, r & e.t), jr(e.d)
}

function sr(e, r) {
      var t, n, s, o, i, _, a, c, f, u, m, p, d, h, P, l, v, B, S, k, b, M, E, g, y, R, L, F, w, D, A, O, I, H, N, G, T, W, Y, Z, V, j, K, q, U, X, $, er, rr, tr;
      if (e.P != e.l)return d = e.a[e.l].n - e.l, e.fb = e.a[e.l].f, e.l = e.a[e.l].n, d;
      if (e.l = e.P = 0, e.N ? (p = e.ob, e.N = !1) : p = fr(e), L = e.B, y = x(e.b) + 1, 2 > y)return e.fb = -1, 1;
      for (y > 273 && (y = 273), Z = 0, f = 0; 4 > f; ++f)e.x[f] = e.s[f], e.L[f] = C(e.b, -1, e.x[f], 273), e.L[f] > e.L[Z] && (Z = f);
      if (e.L[Z] >= e.i)return e.fb = Z, d = e.L[Z], cr(e, d - 1), d;
      if (p >= e.i)return e.fb = e.m[L - 1] + 4, cr(e, p - 1), p;
      if (a = z(e.b, -1), v = z(e.b, -e.s[0] - 1 - 1), 2 > p && a != v && 2 > e.L[Z])return e.fb = -1, 1;
      if (e.a[0].Ub = e.j, H = r & e.t, e.a[1].u = wt[e.A[(e.j << 4) + H] >>> 2] + Dr(Fr(e.y, r, e.C), e.j >= 7, v, a), Ar(e.a[1]), B = wt[2048 - e.A[(e.j << 4) + H] >>> 2], Y = B + wt[2048 - e.X[e.j] >>> 2], v == a && (V = Y + _r(e, e.j, H), e.a[1].u > V && (e.a[1].u = V, Or(e.a[1]))), m = p >= e.L[Z] ? p : e.L[Z], 2 > m)return e.fb = e.a[1].f, 1;
      e.a[1].n = 0, e.a[0].tb = e.x[0], e.a[0].wb = e.x[1], e.a[0].yb = e.x[2], e.a[0].Fb = e.x[3], u = m;
      do e.a[u--].u = 268435455; while (u >= 2);
      for (f = 0; 4 > f; ++f)if (W = e.L[f], !(2 > W)) {
         G = Y + ir(e, f, e.j, H);
         do o = G + yr(e.h, W - 2, H), A = e.a[W], A.u > o && (A.u = o, A.n = 0, A.f = f, A.r = 0); while (--W >= 2)
      }
      if (g = B + wt[e.X[e.j] >>> 2], u = e.L[0] >= 2 ? e.L[0] + 1 : 2, p >= u) {
         for (F = 0; u > e.m[F];)F += 2;
         for (; c = e.m[F + 1], o = g + or(e, c, u, H), A = e.a[u], A.u > o && (A.u = o, A.n = 0, A.f = c + 4, A.r = 0), u != e.m[F] || (F += 2, F != L); ++u);
      }
      for (t = 0; ;) {
         if (++t, t == m)return Q(e, t);
         if (S = fr(e), L = e.B, S >= e.i)return e.ob = S, e.N = !0, Q(e, t);
         if (++r, I = e.a[t].n, e.a[t].r ? (--I, e.a[t].Sb ? (K = e.a[e.a[t].n2].Ub, K = 4 > e.a[t].f2 ? 7 > K ? 8 : 11 : 7 > K ? 7 : 10) : K = e.a[I].Ub, K = J(K)) : K = e.a[I].Ub, I == t - 1 ? K = 0 == e.a[t].f ? 7 > K ? 9 : 11 : J(K) : (e.a[t].r && e.a[t].Sb ? (I = e.a[t].n2, O = e.a[t].f2, K = 7 > K ? 8 : 11) : (O = e.a[t].f, K = 4 > O ? 7 > K ? 8 : 11 : 7 > K ? 7 : 10), D = e.a[I], 4 > O ? 0 == O ? (e.x[0] = D.tb, e.x[1] = D.wb, e.x[2] = D.yb, e.x[3] = D.Fb) : 1 == O ? (e.x[0] = D.wb, e.x[1] = D.tb, e.x[2] = D.yb, e.x[3] = D.Fb) : 2 == O ? (e.x[0] = D.yb, e.x[1] = D.tb, e.x[2] = D.wb, e.x[3] = D.Fb) : (e.x[0] = D.Fb, e.x[1] = D.tb, e.x[2] = D.wb, e.x[3] = D.yb) : (e.x[0] = O - 4, e.x[1] = D.tb, e.x[2] = D.wb, e.x[3] = D.yb)), e.a[t].Ub = K, e.a[t].tb = e.x[0], e.a[t].wb = e.x[1], e.a[t].yb = e.x[2], e.a[t].Fb = e.x[3], _ = e.a[t].u, a = z(e.b, -1), v = z(e.b, -e.x[0] - 1 - 1), H = r & e.t, n = _ + wt[e.A[(K << 4) + H] >>> 2] + Dr(Fr(e.y, r, z(e.b, -2)), K >= 7, v, a), M = e.a[t + 1], k = !1, M.u > n && (M.u = n, M.n = t, M.f = -1, M.r = 0, k = !0), B = _ + wt[2048 - e.A[(K << 4) + H] >>> 2], Y = B + wt[2048 - e.X[K] >>> 2], v != a || t > M.n && 0 == M.f || (V = Y + (wt[e.db[K] >>> 2] + wt[e.U[(K << 4) + H] >>> 2]), M.u >= V && (M.u = V, M.n = t, M.f = 0, M.r = 0, k = !0)), R = x(e.b) + 1, R = R > 4095 - t ? 4095 - t : R, y = R, !(2 > y)) {
            if (y > e.i && (y = e.i), !k && v != a && (U = Math.min(R - 1, e.i), P = C(e.b, 0, e.x[0], U), P >= 2)) {
                  for (q = J(K), N = r + 1 & e.t, E = n + wt[2048 - e.A[(q << 4) + N] >>> 2] + wt[2048 - e.X[q] >>> 2], w = t + 1 + P; w > m;)e.a[++m].u = 268435455;
                  o = E + (X = yr(e.h, P - 2, N), X + ir(e, 0, q, N)), A = e.a[w], A.u > o && (A.u = o, A.n = t + 1, A.f = 0, A.r = 1, A.Sb = 0)
            }
            for (j = 2, T = 0; 4 > T; ++T)if (h = C(e.b, -1, e.x[T], y), !(2 > h)) {
                  l = h;
                  do {
                     for (; t + h > m;)e.a[++m].u = 268435455;
                     o = Y + ($ = yr(e.h, h - 2, H), $ + ir(e, T, K, H)), A = e.a[t + h], A.u > o && (A.u = o, A.n = t, A.f = T, A.r = 0)
                  } while (--h >= 2);
                  if (h = l, 0 == T && (j = h + 1), R > h && (U = Math.min(R - 1 - h, e.i), P = C(e.b, h, e.x[T], U), P >= 2)) {
                     for (q = 7 > K ? 8 : 11, N = r + h & e.t, s = Y + (er = yr(e.h, h - 2, H), er + ir(e, T, K, H)) + wt[e.A[(q << 4) + N] >>> 2] + Dr(Fr(e.y, r + h, z(e.b, h - 1 - 1)), !0, z(e.b, h - 1 - (e.x[T] + 1)), z(e.b, h - 1)), q = J(q), N = r + h + 1 & e.t, b = s + wt[2048 - e.A[(q << 4) + N] >>> 2], E = b + wt[2048 - e.X[q] >>> 2], w = h + 1 + P; t + w > m;)e.a[++m].u = 268435455;
                     o = E + (rr = yr(e.h, P - 2, N), rr + ir(e, 0, q, N)), A = e.a[t + w], A.u > o && (A.u = o, A.n = t + h + 1, A.f = 0, A.r = 1, A.Sb = 1, A.n2 = t, A.f2 = T)
                  }
            }
            if (S > y) {
                  for (S = y, L = 0; S > e.m[L]; L += 2);
                  e.m[L] = S, L += 2
            }
            if (S >= j) {
                  for (g = B + wt[e.X[K] >>> 2]; t + S > m;)e.a[++m].u = 268435455;
                  for (F = 0; j > e.m[F];)F += 2;
                  for (h = j; ; ++h)if (i = e.m[F + 1], o = g + or(e, i, h, H), A = e.a[t + h], A.u > o && (A.u = o, A.n = t, A.f = i + 4, A.r = 0), h == e.m[F]) {
                     if (R > h && (U = Math.min(R - 1 - h, e.i), P = C(e.b, h, i, U), P >= 2)) {
                        for (q = 7 > K ? 7 : 10, N = r + h & e.t, s = o + wt[e.A[(q << 4) + N] >>> 2] + Dr(Fr(e.y, r + h, z(e.b, h - 1 - 1)), !0, z(e.b, h - (i + 1) - 1), z(e.b, h - 1)), q = J(q), N = r + h + 1 & e.t, b = s + wt[2048 - e.A[(q << 4) + N] >>> 2], E = b + wt[2048 - e.X[q] >>> 2], w = h + 1 + P; t + w > m;)e.a[++m].u = 268435455;
                        o = E + (tr = yr(e.h, P - 2, N), tr + ir(e, 0, q, N)), A = e.a[t + w], A.u > o && (A.u = o, A.n = t + h + 1, A.f = 0, A.r = 1, A.Sb = 1, A.n2 = t, A.f2 = i + 4)
                     }
                     if (F += 2, F == L)break
                  }
            }
         }
      }
}

function or(e, r, t, n) {
      var s, o;
      return s = V(t), o = 128 > r ? e.bb[128 * s + r] : e.M[(s << 6) + Br(r)] + e.Jb[15 & r], o + yr(e.T, t - 2, n)
}

function ir(e, r, t, n) {
      var s;
      return 0 == r ? (s = wt[e.db[t] >>> 2], s += wt[2048 - e.U[(t << 4) + n] >>> 2]) : (s = wt[2048 - e.db[t] >>> 2], 1 == r ? s += wt[e.xb[t] >>> 2] : (s += wt[2048 - e.xb[t] >>> 2], s += Ur(e.Pb[t], r - 2))), s
}

function _r(e, r, t) {
      return wt[e.db[r] >>> 2] + wt[e.U[(r << 4) + t] >>> 2]
}

function ar(e) {
      var r;
      for (U(e), qr(e.d), Zr(e.A), Zr(e.U), Zr(e.X), Zr(e.db), Zr(e.xb), Zr(e.Pb), Zr(e.vb), wr(e.y), r = 0; 4 > r; ++r)Zr(e.H[r].kb);
      br(e.T, 1 << e.D), br(e.h, 1 << e.D), Zr(e.O.kb), e.N = !1, e.P = 0, e.l = 0, e.o = 0
}

function cr(e, r) {
      r > 0 && (Z(e.b, r), e.o += r)
}

function fr(e) {
      var r;
      return r = 0, e.B = N(e.b, e.m), e.B > 0 && (r = e.m[e.B - 2], r == e.i && (r += C(e.b, r - 1, e.m[e.B - 1], 273 - r))), ++e.o, r
}

function ur(e) {
      e.b && e.Q && (e.b.bc = null, e.Q = !1)
}

function mr(e) {
      ur(e), e.d.fc = null
}

function pr(e, r) {
      e.I = r;
      for (var t = 0; r > 1 << t; ++t);
      e.pb = 2 * t
}

function dr(e, r, t, n) {
      e.F = t, e.K = r, e.D = n, e.t = (1 << e.D) - 1
}

function hr(e, r) {
      var t = e.R;
      e.R = r, e.b && t != e.R && (e.V = -1, e.b = null)
}

function Pr(e, r) {
      var t;
      for (e.Ib[0] = 9 * (5 * e.D + e.F) + e.K << 24 >> 24, t = 0; 4 > t; ++t)e.Ib[1 + t] = e.I >> 8 * t << 24 >> 24;
      E(r, e.Ib, 0, 5)
}

function lr(e, r) {
      var t;
      e.Yb && (Vr(e.d, e.A, (e.j << 4) + r, 1), Vr(e.d, e.X, e.j, 0), e.j = 7 > e.j ? 7 : 10, Er(e.T, e.d, 0, r), t = V(2), Hr(e.H[t], e.d, 63), Jr(e.d, 67108863, 26), Gr(e.O, e.d, 15))
}

function vr(e) {
      return 2048 > e ? bt[e] : 2097152 > e ? bt[e >> 10] + 20 : bt[e >> 20] + 40
}

function Br(e) {
      return 131072 > e ? bt[e >> 6] + 12 : 134217728 > e ? bt[e >> 16] + 32 : bt[e >> 26] + 52
}

function Sr(e, r, t, n) {
      8 > t ? (Vr(r, e.Y, 0, 0), Hr(e.Eb[n], r, t)) : (t -= 8, Vr(r, e.Y, 0, 1), 8 > t ? (Vr(r, e.Y, 1, 0), Hr(e.Bb[n], r, t)) : (Vr(r, e.Y, 1, 1), Hr(e.Gb, r, t - 8)))
}

function kr(e) {
      var r;
      for (e.Y = [0, 0], e.Eb = n(16), e.Bb = n(16), e.Gb = Ir(new Ft, 8), r = 0; 16 > r; ++r)e.Eb[r] = Ir(new Ft, 3), e.Bb[r] = Ir(new Ft, 3);
      return e
}

function br(e, r) {
      var t;
      for (Zr(e.Y), t = 0; r > t; ++t)Zr(e.Eb[t].kb), Zr(e.Bb[t].kb);
      Zr(e.Gb.kb)
}

function Mr(e, r, t, n, s) {
      var o, i, _, a, c;
      for (o = wt[e.Y[0] >>> 2], i = wt[2048 - e.Y[0] >>> 2], _ = i + wt[e.Y[1] >>> 2], a = i + wt[2048 - e.Y[1] >>> 2], c = 0, c = 0; 8 > c; ++c) {
         if (c >= t)return;
         n[s + c] = o + Nr(e.Eb[r], c)
      }
      for (; 16 > c; ++c) {
         if (c >= t)return;
         n[s + c] = _ + Nr(e.Bb[r], c - 8)
      }
      for (; t > c; ++c)n[s + c] = a + Nr(e.Gb, c - 8 - 8)
}

function Er(e, r, t, n) {
      Sr(e, r, t, n), 0 == --e.Kb[n] && (Mr(e, n, e.$, e.Vb, 272 * n), e.Kb[n] = e.$)
}

function gr(e) {
      return kr(e), e.Vb = n(4352), e.Kb = n(16), e
}

function yr(e, r, t) {
      return e.Vb[272 * t + r]
}

function Rr(e, r) {
      var t;
      for (t = 0; r > t; ++t)Mr(e, t, e.$, e.Vb, 272 * t), e.Kb[t] = e.$
}

function Lr(e, r, t) {
      var s, o;
      if (null == e.Hb || e.G != t || e.lb != r)for (e.lb = r, e.Wb = (1 << r) - 1, e.G = t, o = 1 << e.G + e.lb, e.Hb = n(o), s = 0; o > s; ++s)e.Hb[s] = xr(new Rt)
}

function Fr(e, r, t) {
      return e.Hb[((r & e.Wb) << e.G) + ((255 & t) >>> 8 - e.G)]
}

function wr(e) {
      var r, t;
      for (t = 1 << e.G + e.lb, r = 0; t > r; ++r)Zr(e.Hb[r].mb)
}

function zr(e, r, t) {
      var n, s, o;
      for (s = 1, o = 7; o >= 0; --o)n = t >> o & 1, Vr(r, e.mb, s, n), s = s << 1 | n
}

function Cr(e, r, t, n) {
      var s, o, i, _, a, c;
      for (o = 1, a = !0, i = 7; i >= 0; --i)s = n >> i & 1, c = o, a && (_ = t >> i & 1, c += 1 + _ << 8, a = _ == s), Vr(r, e.mb, c, s), o = o << 1 | s
}

function xr(e) {
      return e.mb = n(768), e
}

function Dr(e, r, t, n) {
      var s, o, i, _, a;
      if (a = 0, o = 1, i = 7, r)for (; i >= 0; --i)if (_ = t >> i & 1, s = n >> i & 1, a += Ur(e.mb[(1 + _ << 8) + o], s), o = o << 1 | s, _ != s) {
         --i;
         break
      }
      for (; i >= 0; --i)s = n >> i & 1, a += Ur(e.mb[o], s), o = o << 1 | s;
      return a
}

function Ar(e) {
      e.f = -1, e.r = 0
}

function Or(e) {
      e.f = 0, e.r = 0
}

function Ir(e, r) {
      return e.W = r, e.kb = n(1 << r), e
}

function Hr(e, r, t) {
      var n, s, o;
      for (o = 1, s = e.W; 0 != s;)--s, n = t >>> s & 1, Vr(r, e.kb, o, n), o = o << 1 | n
}

function Nr(e, r) {
      var t, n, s, o;
      for (o = 0, s = 1, n = e.W; 0 != n;)--n, t = r >>> n & 1, o += Ur(e.kb[s], t), s = (s << 1) + t;
      return o
}

function Gr(e, r, t) {
      var n, s, o;
      for (o = 1, s = 0; e.W > s; ++s)n = 1 & t, Vr(r, e.kb, o, n), o = o << 1 | n, t >>= 1
}

function Tr(e, r) {
      var t, n, s, o;
      for (o = 0, s = 1, n = e.W; 0 != n; --n)t = 1 & r, r >>>= 1, o += Ur(e.kb[s], t), s = s << 1 | t;
      return o
}

function Wr(e, r, t, n, s) {
      var o, i, _;
      for (_ = 1, i = 0; n > i; ++i)o = 1 & s, Vr(t, e, r + _, o), _ = _ << 1 | o, s >>= 1
}

function Yr(e, r, t, n) {
      var s, o, i, _;
      for (_ = 0, i = 1, o = t; 0 != o; --o)s = 1 & n, n >>>= 1, _ += wt[(2047 & (e[r + i] - s ^ -s)) >>> 2], i = i << 1 | s;
      return _
}

function Zr(e) {
      var r;
      for (r = e.length - 1; r >= 0; --r)e[r] = 1024
}

function Vr(e, r, t, n) {
      var i, _;
      _ = r[t], i = (e.rb >>> 11) * _, 0 == n ? (e.rb = i, r[t] = _ + (2048 - _ >>> 5) << 16 >> 16) : (e.Ob = s(e.Ob, o(c(i), [4294967295, 0])), e.rb -= i, r[t] = _ - (_ >>> 5) << 16 >> 16), 0 == (-16777216 & e.rb) && (e.rb <<= 8, Qr(e))
}

function Jr(e, r, t) {
      var n;
      for (n = t - 1; n >= 0; --n)e.rb >>>= 1, 1 == (r >>> n & 1) && (e.Ob = s(e.Ob, c(e.rb))), 0 == (-16777216 & e.rb) && (e.rb <<= 8, Qr(e))
}

function jr(e) {
      var r;
      for (r = 0; 5 > r; ++r)Qr(e)
}

function Kr(e) {
      return s(s(c(e.jb), e.Db), [4, 0])
}

function qr(e) {
      e.Db = at, e.Ob = at, e.rb = -1, e.jb = 1, e.$b = 0
}

function Qr(e) {
      var r, t;
      if (r = u(l(e.Ob, 32)), 0 != r || i(e.Ob, [4278190080, 0]) < 0) {
         e.Db = s(e.Db, c(e.jb)), t = e.$b;
         do M(e.fc, t + r), t = 255; while (0 != --e.jb);
         e.$b = u(e.Ob) >>> 24
      }
      ++e.jb, e.Ob = h(o(e.Ob, [16777215, 0]), 8)
}

function Ur(e, r) {
      return wt[(2047 & (e - r ^ -r)) >>> 2]
}

function Xr(e) {
      var r, t, s, o = [], i = 0, _ = e.length;
      if ("object" == typeof e) {
         if (e instanceof Array)o = e; else if (e.toJSON)o = e.toJSON(); else for (s = 0; _ > s; s += 1)o[s] = e[s];
         return o
      }
      for (g(e, 0, _, o, 0), s = 0; _ > s; ++s)r = o[s], r >= 1 && 127 >= r ? ++i : i += 0 == r || r >= 128 && 2047 >= r ? 2 : 3;
      for (t = n(i), i = 0, s = 0; _ > s; ++s)r = o[s], r >= 1 && 127 >= r ? t[i++] = r << 24 >> 24 : 0 == r || r >= 128 && 2047 >= r ? (t[i++] = (192 | r >> 6 & 31) << 24 >> 24, t[i++] = (128 | 63 & r) << 24 >> 24) : (t[i++] = (224 | r >> 12 & 15) << 24 >> 24, t[i++] = (128 | r >> 6 & 63) << 24 >> 24, t[i++] = (128 | 63 & r) << 24 >> 24);
      return t
}

function $r(e) {
      return e[1] + e[0]
}

function et(e, r, n, s) {
      function o() {
         for (var e, r = (new Date).getTime(); K(a.c.ac);){
            if (i = $r(a.c.ac.Rb) / $r(a.c.hc), (new Date).getTime() - r > 200){
                  return s ? s(i) : void 0 !== _ && t(i, _), st(o, 0), !1;
            }
         }
         s ? s(1) : void 0 !== _ && t(1, _),
            e = b(a.c.ec),
            n ? n(e) : void 0 !== _ && postMessage({
            action: tt,
            cbn: _,
            result: e.slice(0)
         })
      }

      var i, _, a = {};
      "function" != typeof n && (_ = n, n = s = 0),
         a.c = F(new lt, Xr(e), Ct(r)),
         s ? s(0) : void 0 !== _ && t(0, _),
         st(o, 0)
}

var rt, tt = 1, nt = 3, st = "function" == typeof setImmediate ? setImmediate : setTimeout, ot = 4294967296, it = [4294967295, -ot], _t = [0, -0x8000000000000000], at = [0, 0], ct = [1, 0], ft = r({}), ut = n(256), mt = r(), pt = r(new mt);
rt.Cb = 0, rt.dc = 0;
var dt = r(), ht = r(new dt);
rt.Cb = 0;
var Pt = r(), lt = r(new Pt), vt = r();
rt.nb = 0, rt.e = 0, rt.qb = 0, rt.zb = 0, rt.z = 0, rt.v = 0, rt.eb = 0, rt.q = 0;
var Bt = function () {
      var e, r, t, s = n(256);
      for (e = 0; 256 > e; ++e) {
         for (t = e, r = 0; 8 > r; ++r)0 != (1 & t) ? t = t >>> 1 ^ -306674912 : t >>>= 1;
         s[e] = t
      }
      return s
}(), St = r(new vt);
rt._ = !0, rt.Nb = 255, rt.g = 0, rt.k = 0, rt.ub = 0, rt.E = 66560, rt.Z = 4, rt.p = 0;
var kt = r(), bt = function () {
      var e, r, t, s, o = n(2048);
      for (e = 2, o[0] = 0, o[1] = 1, s = 2; 22 > s; ++s)for (t = 1 << (s >> 1) - 1, r = 0; t > r; ++r, ++e)o[e] = s << 24 >> 24;
      return o
}(), Mt = r();
rt.o = 0, rt.ab = 0, rt.I = 4194304, rt.V = -1, rt.pb = 44, rt.ob = 0, rt.R = 1, rt.cb = 0, rt.B = 0, rt.i = 32, rt.sb = -1, rt.K = 3, rt.F = 0, rt.l = 0, rt.P = 0, rt.D = 2, rt.t = 3, rt.C = 0, rt.j = 0, rt.fb = 0, rt.w = at;
var Et = r(), gt = r(new Et);
rt.$ = 0;
var yt = r();
rt.lb = 0, rt.G = 0, rt.Wb = 0;
var Rt = r(), Lt = r();
rt.f = 0, rt.f2 = 0, rt.tb = 0, rt.wb = 0, rt.yb = 0, rt.Fb = 0, rt.n = 0, rt.n2 = 0, rt.u = 0, rt.Ub = 0;
var Ft = r();
rt.W = 0;
var wt = function () {
      var e, r, t, s, o = n(512);
      for (r = 8; r >= 0; --r)for (s = 1 << 9 - r - 1, e = 1 << 9 - r, t = s; e > t; ++t)o[t] = (r << 6) + (e - t << 6 >>> 9 - r - 1);
      return o
}(), zt = r();
rt.Ob = at, rt.rb = 0, rt.$b = 0, rt.jb = 0, rt.Db = at;
var Ct = function () {
      var e = [
         {ds: 16, fb: 64, mf: 0, lc: 3, lp: 0, pb: 2},
         {ds: 20, fb: 64, mf: 0, lc: 3, lp: 0, pb: 2},
         {ds: 19, fb: 64, mf: 1, lc: 3, lp: 0, pb: 2},
         {ds: 20, fb: 64, mf: 1, lc: 3, lp: 0, pb: 2},
         {ds: 21, fb: 128, mf: 1, lc: 3, lp: 0, pb: 2},
         {ds: 22, fb: 128, mf: 1, lc: 3, lp: 0, pb: 2},
         {ds: 23, fb: 128, mf: 1, lc: 3, lp: 0, pb: 2},
         {ds: 24, fb: 255, mf: 1, lc: 3, lp: 0, pb: 2},
         {ds: 25, fb: 255, mf: 1, lc: 3, lp: 0, pb: 2}
      ];
      return function (r) {
         return e[r - 1] || e[6]
      }
}();
return "undefined" == typeof onmessage || "undefined" != typeof window && void 0 !== window.document || !function () {
      onmessage = function (r) {
         r && r._b && r._b.action == tt && e.compress(r._b._b, r._b.jc, r._b.cbn)
      }
}(), {compress: et}
}();
this.LZMA = this.LZMA_WORKER = e;

diudiut · 发表于 2019-2-15 02:38:02

有没有大神啊?

Mr.Yang · 发表于 2019-2-15 05:42:40

明文:234242342
密文:5d00000800090000000000000000190cc2dcbcc332599ad7ffffd82200002482c3659b7255c02176f2d88c779e2b

这个结果是不是你要的?

diudiut · 发表于 2019-2-15 13:26:38

Mr.Yang 发表于 2019-2-15 05:42
明文:234242342
密文:5d00000800090000000000000000190cc2dcbcc332599ad7ffffd82200002482c3659b7255c0217 ...

你的这个,我用我的加密后密文:5d00000800090000000000000000190cc2dcbcc332599ad7ffffd8220000是这样....你看下附加,加密后是不是一样

		自动登录	找回密码
密码			注册

[求助] LZMA压缩,求大神修改一下原始JS,让它可以本地运行

点评