某数还原
本帖最后由 52pojiema 于 2024-10-9 17:56 编辑4位数组数组循环重新对索引进行赋值从====>>>
https://s21.ax1x.com/2024/08/09/pkz4Xn0.jpg
这一个8位是怎生成的，找不到规律思路，求助大佬指点！！！！！！
这8位会对大数组进行重新赋值排列，如果8位正确就能正确切割很多小数组，如果不对切割就会出现问题
https://s21.ax1x.com/2024/08/09/pkz5SNF.jpg
52pojiema 发表于 2024-10-9 09:44
最新瑞数八位数组生成
https://www.52pojie.cn/thread-1970663-1-1.html
(出处: 吾爱破解论坛)
array180 = [
19,
40,
18,
2,
41,
0,
40,
18,
3,
15,
3,
23,
68,
41,
42,
3,
32,
6,
13,
15,
2,
15,
3,
15,
3,
40,
37,
18,
3,
12,
63,
23,
15,
2,
22,
26,
20,
15,
2,
41,
0,
49,
87,
15,
2,
50,
26,
8,
31,
40,
37,
15,
2,
41,
0,
3,
23,
68,
41,
10,
3,
28,
6,
33,
15,
2,
41,
1,
49,
88,
15,
2,
50,
26,
9,
31,
40,
37,
15,
2,
41,
0,
15,
2,
41,
1,
3,
15,
2,
50,
26,
10,
33,
40,
37,
59,
14,
15,
2,
41,
1,
49,
89,
15,
2,
50,
26,
10,
31,
40,
37,
41,
0,
40,
18,
3,
15,
3,
23,
68,
41,
42,
3,
32,
6,
51,
15,
2,
15,
3,
3,
41,
0,
32,
6,
12,
15,
2,
15,
3,
15,
2,
15,
3,
3,
71,
40,
37,
15,
2,
15,
3,
3,
23,
68,
41,
18,
3,
28,
6,
11,
15,
2,
15,
3,
23,
68,
41,
18,
3,
40,
37,
18,
3,
12,
63,
61,
15,
2,
16
] //180数组
array226 = [
24,
1024,
63,
5,
43,
4,
14,
4096,
8192,
31,
10,
15,
48,
36,
134217728,
45,
16,
44,
255,
11,
128,
604800,
27,
192,
6,
224,
42,
9,
240,
52,
13,
32,
46,
200,
40,
1000,
65535,
17,
127,
12,
4294967295,
3,
8,
100,
92,
51,
64,
2,
86,
7,
8388608,
57,
-1,
47,
131072,
134217727,
65536,
20,
18,
58,
256,
268435456,
90,
19,
26,
0.5,
283,
2654435769,
65,
82,
4194304,
39,
28,
55,
23,
93,
5000,
97,
68,
102,
4294967296,
16843008,
8198,
-100,
201,
120,
8195,
32768,
0.01,
2097151,
123,
96,
80,
40960,
34,
126,
16383,
8199,
262144,
257,
0,
2048,
-0.01,
248,
8197,
79,
203,
8196,
1048576,
170,
300,
2000,
122,
2097152,
67108864,
268435455,
59,
89,
30,
180,
60,
56,
512,
21,
98,
100000,
33554432,
8203,
101,
8193,
1000000,
2047,
54,
2531011,
16777215,
84,
110,
20000,
29,
360,
0.6,
3337565984,
1800,
8287,
99,
252,
72,
-180,
16384,
0.9,
4023233417,
0.8,
254,
75,
164,
1518500249,
160,
69,
7560,
111,
6158,
165,
8239,
50000,
3988292384,
0.4,
16843009,
83,
0.2,
55296,
0.35,
8200,
15679,
12288,
88,
0.813264543,
1732584193,
0.1,
2400959708,
8202,
30000,
-0.9,
65537,
91,
81,
56320,
271733878,
8201,
112,
0.26,
8194,
5089,
-4,
1500,
-7,
1048575,
3285377520,
3395469782,
-0.2,
-90,
-2,
86400000,
1001,
643615,
1859775393,
3000,
2562383102,
-0.26,
175,
163,
181,
138,
137,
130,
134,
198,
195,
142,
148,
207,
131,
205,
194,
146,
154,
193
] //226数组
arraylist={
'8': [
44,0, 41,5, 41,2, 40, 37, 44,
0, 41,0, 41,1, 40, 37, 44,0,
41,7, 41,4, 40, 37, 44,0, 41,
2, 50, 26, 21,3, 16
],
'9': [
44,0, 50, 26, 10, 44,0, 50, 26, 11,
41,4,6,8, 44,0, 41,2, 41,3,
40, 37, 41,1,6,5, 41,4, 40, 18,
5, 44,0, 41,2, 41,3, 40, 37, 41,
1, 16
],
'10': [
44,0, 41,7, 41,4, 40, 37, 44,
0, 41,2, 41,3, 40, 37, 44,0,
41,1, 41,6, 40, 37, 44,0, 41,
4, 41,5, 40, 37, 41,2, 16
],
'11': [
41,7, 40, 18,4, 44, 0, 41,
5, 41,2, 40, 25, 44, 0, 41,
39, 41,1, 40, 37, 41, 6, 16
],
'20': [
44,0, 41,2, 41,3, 40, 37, 44, 0,
41,1, 41,6, 40, 37, 44,0, 41, 4,
41,5, 40, 37, 44,0, 41,3, 41, 0,
40, 37, 44,0, 41,6, 50, 26, 21, 3,
16
]
// ,
// '21':[
// 23, 73,23, 62, 41, 25,3,
// 44,0,13, 37, 23, 68, 41,
// 42,3, 102, 16
// ]
} //大数组切割的数组
function _$jB(_$fn, _$bX, _$$x, _$gj, _$_H, _$bb, _$gZ, _$$1) {
var _$hf, _$gH;
_$gj -= _$$x,
_$$x -= _$bX;
try {
_$jR(_$fn, _$bb, _$bb += _$bX, _$$1);
} catch (_$_t) {
_$gZ = _$_t,
_$jR(_$fn, _$bb, _$bb + _$$x, _$$1);
} finally {
_$hf = _$$1,
_$gH = _$$1,
_$$1 = 0,
_$bb += _$$x,
_$jR(_$fn, _$bb, _$bb + _$gj, _$$1),
_$$1 === 0 ? (_$$1 = _$gH,
_$$1 = _$hf) : 0;
}
}
function _$jR(_$dj, _$cZ, _$$j, _$_v) {
var _$au, _$eJ,_$ak, _$dP, _$et, _$ej, _$kC, _$aB, _$fC, _$j$, _$eK, _$$F, _$f4, _$fm,_$ck;
_$kC = _$dj,
_$aB = [],
_$fC = [],
_$j$ = [],
_$j$= _$_v,
_$eK = [],
_$$F = [],
_$f4 = 0;
for (_$au = _$cZ; _$au < _$$j; _$au++) {
_$eJ = _$kC;
if (_$eJ <= 63)
_$eJ <= 15 ? _$eJ <= 3 ? _$eJ <= 0 ? (_$ak = _$kC[++_$au],
_$ck = _$j$) : _$eJ <= 1 ? (_$dP = typeof _$$F[--_$f4],
_$$F = _$dP) : _$eJ <= 2 ? _$$F = true : (_$dP = _$$F[--_$f4],
_$ck = _$$F[--_$f4],
_$$F = _$ck) : _$eJ <= 7 ? _$eJ <= 4 ? (_$jB(_$dj, _$kC[++_$au], _$kC[++_$au], _$ej = _$kC[++_$au], _$kC[++_$au], _$au + 1, _$aB, _$_v),
_$_v ? _$au = _$$j : _$au += _$ej) : _$eJ <= 5 ? (_$f4 -= 2,
_$dP = _$f4,
_$$d(),
_$$F = _$ck(_$$F, _$$F)) : _$eJ <= 6 ? (_$dP = _$$F[--_$f4],
_$ej = _$kC[++_$au],
_$dP ? 0 : _$au += _$ej) : (_$dP = _$$F[--_$f4],
_$$F = !_$dP) : _$eJ <= 11 ? _$eJ <= 8 ? (_$f4 -= 3,
_$dP = _$f4,
_$$d(),
_$ck = _$ck,
_$dP = _$ck(_$$F, _$$F, _$$F)) : _$eJ <= 9 ? (_$et = _$kC[++_$au],
_$ak = _$kC[++_$au],
_$ck = _$fC) : _$eJ <= 10 ? (_$dP = _$$F[--_$f4],
_$ck = _$$F,
_$ck]] = _$dP) : (_$ak = _$kC[++_$au],
_$$F = _$cn(_$dj._$e7, _$_v)) : _$eJ <= 12 ? _$dP = _$ck++ : _$eJ <= 13 ? (_$f4--,
_$dP = _$f4,
_$$d(),
_$$F = _$ck(_$$F)) : _$eJ <= 14 ? (_$f4 -= 2,
_$dP = _$f4,
_$$d(),
_$dP = _$ck(_$$F, _$$F)) : _$$F = _$aB] : _$eJ <= 31 ? _$eJ <= 19 ? _$eJ <= 16 ? (_$dP = _$$F[--_$f4],
// _$_v = 1,
// _$_v = _$dP,
_$au = _$$j) : _$eJ <= 17 ? (_$dP = _$$F[--_$f4],
_$$d(),
_$dP = _$ck += _$dP) : _$eJ <= 18 ? (_$ak = _$kC[++_$au],
_$ck = _$aB) : _$$F = [] : _$eJ <= 23 ? _$eJ <= 20 ? (_$et = _$kC[++_$au],
_$$F = _$eK]) : _$eJ <= 21 ? (_$f4 -= 2,
_$dP = _$f4,
_$$d(),
_$ck = _$ck,
_$dP = _$ck(_$$F, _$$F)) : _$eJ <= 22 ? (_$f4--,
_$dP = _$f4,
_$$d(),
// _$ck = _$ck,
_$dP = _$ck(arraylist,0,arraylist.length,_$$F)) : (_$$F = array226,++_$au) : _$eJ <= 27 ? _$eJ <= 24 ? (_$kC = 41,
_$ak = _$kC[++_$au],
_$dP = _$d0,
_$kC = _$dP,
_$$F = _$dP) : _$eJ <= 25 ? (_$$d(),
_$$F = _$ck()) : _$eJ <= 26 ? (_$ak = _$kC[++_$au],
_$ck = _$jR) : (_$kC = 41,
_$ak = _$kC[++_$au],
_$dP = _$in,
_$kC = _$dP,
_$$F = _$dP) : _$eJ <= 28 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] > _$dP,
_$$F = _$dP) : _$eJ <= 29 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] != _$dP,
_$$F = _$dP) : _$eJ <= 30 ? (_$ak = _$kC[++_$au],
_$dP = _$$F[--_$f4],
_$dP ? (_$au += _$ak,
++_$f4) : 0) : (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] + _$dP,
_$$F = _$dP) : _$eJ <= 47 ? _$eJ <= 35 ? _$eJ <= 32 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] < _$dP,
_$$F = _$dP) : _$eJ <= 33 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] * _$dP,
_$$F = _$dP) : _$eJ <= 34 ? (_$dP = _$$F[--_$f4],
_$ck = _$$F,
_$ck.push(_$dP)) : (_$$d(),
_$ck = _$ck,
_$dP = _$ck()) : _$eJ <= 39 ? _$eJ <= 36 ? (_$f4 -= 2,
_$dP = _$f4,
_$$d(),
_$ck = _$ck,
_$$F = _$ck(_$$F, _$$F)) : _$eJ <= 37 ? (_$ak = _$$F[--_$f4],
_$ck = _$$F[--_$f4]) : _$eJ <= 38 ? (_$kC = 80,
_$ak = _$bK],
_$kC = _$ak,
_$dP = _$$F[--_$f4],
_$$F = _$dP) : (_$kC = 111,
_$ak = _$bK],
_$kC = _$ak,
_$ck = _$$F[--_$f4]) : _$eJ <= 43 ? _$eJ <= 40 ? (_$dP = _$$F[--_$f4],
_$$d(),
_$ck = _$dP) : _$eJ <= 41 ? _$$F = _$kC[++_$au] : _$eJ <= 42 ? (_$et = _$kC[++_$au],
_$$F = _$fC]) : (_$_v = 2,
_$au = _$$j) : _$eJ <= 44 ? _$$F = _$j$] : _$eJ <= 45 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] !== _$dP,
_$$F = _$dP) : _$eJ <= 46 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] === _$dP,
_$$F = _$dP) : _$$F = {} : _$eJ <= 51 ? _$eJ <= 48 ? (_$dP = _$$F[--_$f4],
_$ck = _$$F,
_$ck]] = _$dP) : _$eJ <= 49 ? (_$au==41?(_$au++, _$$F=3): (_$au++, _$$F=153)) : _$eJ <= 50 ? (_$f4--,
_$dP = _$f4,
_$$d(),
// _$ck = _$ck,
_$ak!=21?( _$$F = _$ck(arraylist,0,arraylist.length,_$$F)):(_$f4++)
) : (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] - _$dP,
_$$F = _$dP) : _$eJ <= 55 ? _$eJ <= 52 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] & _$dP,
_$$F = _$dP) : _$eJ <= 53 ? (_$ak = _$kC[++_$au],
_$ck = _$_z) : _$eJ <= 54 ? (_$dP = _$$F[--_$f4],
_$$d(),
_$dP = _$ck |= _$dP) : (_$f4--,
_$dP = _$f4,
_$$d(),
_$dP = _$ck(_$$F)) : _$eJ <= 59 ? _$eJ <= 56 ? (_$ej = _$kC[++_$au],
_$fm = _$$F.slice(_$f4 - _$ej, _$f4),
_$f4 -= _$ej,
_$$d(),
_$$F = _$de(_$ck, _$fm)) : _$eJ <= 57 ? (_$ak = _$kC[++_$au],
_$dP = _$$F[--_$f4],
!_$dP ? (_$au += _$ak,
++_$f4) : 0) : _$eJ <= 58 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4]in _$dP,
_$$F = _$dP) : (_$ej = _$kC[++_$au],
_$au += _$ej) : _$eJ <= 60 ? (_$$d(),
_$ck = _$ck,
_$$F = _$ck()) : _$eJ <= 61 ? _$$F = false : _$eJ <= 62 ? (_$dP = _$$F[--_$f4],
_$dP = _$$F[--_$f4] == _$dP,
_$$F = _$dP) : (_$ej = _$kC[++_$au],
_$au -= _$ej);
}
return(_$dP);
function _$$d() {
var _$dj;
_$dj = _$kC[++_$au],
_$dj <= 26 ? _$dj <= 0 ? (_$ak = _$kC[++_$au],
_$ck = _$j$) : _$dj <= 9 ? (_$et = _$kC[++_$au],
_$ak = _$kC[++_$au],
_$ck = _$fC) : _$dj <= 18 ? (_$ak = _$kC[++_$au],
_$ck = _$aB) : (_$ak = _$kC[++_$au],
_$ck = _$jR) : _$dj <= 82 ? _$dj <= 37 ? (_$ak = _$$F[--_$f4],
_$ck = _$$F[--_$f4]) : _$dj <= 39 ? (_$kC = 111,
_$ak = _$bK],
_$kC = _$ak,
_$ck = _$$F[--_$f4]) : _$dj <= 53 ? (_$ak = _$kC[++_$au],
_$ck = _$_z) : (--_$f4,
_$ck = _$$F,
_$ak = _$f4) : _$dj <= 87 ? (_$kC = 111,
_$ak = _$in],
_$kC = _$ak,
_$ck = _$$F[--_$f4]) : _$dj <= 94 ? (_$et = _$kC[++_$au],
_$ak = _$kC[++_$au],
_$ck = _$eK) : (_$ak = _$kC[++_$au],
_$ck = _$$F[--_$f4]);
}
}
console.log( _$jR(array180, 0, array180.length, []))
你要插桩才能看出规律 你先找出切割的小数组 你就能找到规律了你看看小数组（图片），
大概就是 生成8数组 然后遍历小数组 小数组（44，0，41，索引，41，值，40）里面值41时候 41后面的就是8数组的索引 然后第2个41 后面就是替换的值当然具体还有些细节 你进<=63循环 仔细看看就明白了 本帖最后由 liusf1988 于 2024-8-13 18:15 编辑
先是ts生成大数组 再切割个部分再由切割数组生成多个小数组 然后循环180数组生成后面跳转前面的小数组替换8数组内容 8位数组
你的第一张图片、第二张图片和8数组生成没关系 180 数组 和226 数组是固定的，当然你的代码可能不是180和226，arraylist是由大数组切割而成的多个数组（一般是4个 但不一定是4个，看切割的数组大小）， 然后把那个循环代码全扣 进去就生成了8位数组 liusf1988 发表于 2024-8-13 09:17
先是ts生成大数组 再切割个部分再由切割数组生成多个小数组 然后循环180数组生成后面跳转前面的小 ...
感谢大哥指点 谢谢！ liusf1988 发表于 2024-8-13 17:20
180 数组 和226 数组是固定的，当然你的代码可能不是180和226，arraylist是由大数组切割而成的多个数组（一 ...
感谢大哥指点 谢谢！ 本帖最后由 52pojiema 于 2024-8-14 09:37 编辑
liusf1988 发表于 2024-8-13 17:20
180 数组 和226 数组是固定的，当然你的代码可能不是180和226，arraylist是由大数组切割而成的多个数组（一 ...
这个循环代码有点难扣啊 这个代码入口就是<= 63那个循环 缺少东西比较多啊https://s21.ax1x.com/2024/08/14/pA9ADU0.jpg liusf1988 发表于 2024-8-14 17:10
你要插桩才能看出规律 你先找出切割的小数组 你就能找到规律了你看看小数组（图片），
大概就是 生成8数 ...
这样吗？哥
https://s21.ax1x.com/2024/08/20/pAP7QgK.png 52pojiema 发表于 2024-8-20 11:47
这样吗？哥
arr-list切割的小数组是以对象形式存储，并且第一个切割的数组key是20 ，后面的是8，9，10，递增因为循环里面是按key取小数组，跳转 liusf1988 发表于 2024-8-21 07:52
arr-list切割的小数组是以对象形式存储，并且第一个切割的数组key是20 ，后面的是8，9，10，递增因为循 ...
我能用cb悬赏一份你的8位数组学习下可以吗 大佬