mslxdff 0.1.231 → 0.1.232
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/bin/mslxdff.js +3 -3
- package/package.json +1 -1
- package/src/auto.js +254 -254
- package/src/bench/cline-bench.js +42 -42
- package/src/bench/probe.js +70 -70
- package/src/bench/report.js +162 -162
- package/src/bench/runner.js +77 -77
- package/src/bench/via-probe.js +124 -124
- package/src/bench/via-routes.js +87 -87
- package/src/bench/workbuddy-bench.js +54 -54
- package/src/chat/engine.js +160 -160
- package/src/chat/gateway.js +163 -163
- package/src/chat/orchestrator.js +234 -234
- package/src/chat/prompt.js +70 -70
- package/src/chat/repl.js +88 -88
- package/src/chat/terminal.js +135 -135
- package/src/chat/tools.js +306 -306
- package/src/chat-pipeline/index.js +145 -145
- package/src/chat-pipeline/policy.js +84 -84
- package/src/cli/commands/group.js +266 -266
- package/src/cli/commands/model/picks.js +50 -50
- package/src/cli/commands/provider/bench-via.js +247 -247
- package/src/cli/commands/provider/bench.js +141 -141
- package/src/cli/commands/provider/index.js +139 -139
- package/src/cli/commands/provider/models.js +149 -149
- package/src/cli/commands/provider/qwenwork-login.js +119 -119
- package/src/cli/commands/provider/raccoon-quota.js +156 -156
- package/src/cli/commands/sync.js +310 -310
- package/src/cli/status.js +279 -279
- package/src/daemon.js +246 -246
- package/src/model-capabilities/enrich.js +86 -86
- package/src/model-capabilities/index.js +183 -183
- package/src/model-capabilities/parse.js +70 -70
- package/src/models.js +225 -225
- package/src/peers.js +345 -345
- package/src/providers/agentrouter.js +238 -238
- package/src/providers/base.js +164 -164
- package/src/providers/cline/auth.js +228 -228
- package/src/providers/cline/chat.js +307 -307
- package/src/providers/cline.js +2 -2
- package/src/providers/codearts/chat.js +207 -207
- package/src/providers/dispatcher.js +147 -147
- package/src/providers/globalqwenwork/cosy.js +123 -123
- package/src/providers/globalqwenwork/crypto.js +218 -218
- package/src/providers/globalqwenwork/http.js +20 -20
- package/src/providers/globalqwenwork/rsa.js +54 -54
- package/src/providers/globalqwenwork/sse.js +268 -268
- package/src/providers/globalqwenwork/stream.js +130 -130
- package/src/providers/globalqwenwork/upstream.js +122 -122
- package/src/providers/keyring.js +60 -60
- package/src/providers/qoder/chat.js +203 -203
- package/src/providers/qoder/index.js +249 -249
- package/src/providers/qoder/sse.js +145 -145
- package/src/providers/qwenwork/account-store.js +133 -133
- package/src/providers/qwenwork/constants.js +67 -67
- package/src/providers/qwenwork/cosy.js +120 -120
- package/src/providers/qwenwork/crypto.js +218 -218
- package/src/providers/qwenwork/http.js +20 -20
- package/src/providers/qwenwork/index.js +337 -337
- package/src/providers/qwenwork/payload.js +144 -144
- package/src/providers/qwenwork/rsa.js +54 -54
- package/src/providers/qwenwork/sse.js +268 -268
- package/src/providers/qwenwork/stream.js +130 -130
- package/src/providers/qwenwork/upstream.js +120 -120
- package/src/providers/qwenwork.js +1 -1
- package/src/providers/raccoon/const.js +202 -202
- package/src/providers/raccoon/credits.js +285 -285
- package/src/providers/registry.js +89 -89
- package/src/providers/workbuddy/auth.js +16 -0
- package/src/providers/workbuddy/chat.js +298 -264
- package/src/providers/workbuddy/client-headers.js +148 -0
- package/src/providers/workbuddy/desktop-info.js +17 -1
- package/src/providers/workbuddy/models.js +8 -20
- package/src/providers/workbuddy/reshape.js +152 -152
- package/src/providers/workbuddy.js +2 -2
- package/src/reasoning.js +32 -32
- package/src/routes/chat/broadband-handler.js +80 -80
- package/src/routes/chat/gateway.js +46 -46
- package/src/routes/chat/relay-pipeline.js +282 -282
- package/src/routes/chat/via-route-handler.js +156 -156
- package/src/routes/hedge.js +260 -260
- package/src/routes/models-route.js +167 -167
- package/src/routes/peers.js +373 -373
- package/src/routes/stream.js +347 -347
- package/src/runtime/bootstrap.js +75 -75
- package/src/runtime/keep-warm.js +135 -135
- package/src/runtime/provider-gate.js +75 -75
- package/src/runtime/providers-setup.js +187 -187
- package/src/runtime/raccoon-checkin.js +175 -175
- package/src/server.js +85 -85
- package/src/state/schemas/allowlist.js +92 -92
- package/src/sync-opencode.js +280 -280
- package/src/transport/index.js +244 -244
- package/src/transport/pool.js +56 -56
- package/src/transport/retry.js +24 -24
- package/src/transport/sse.js +93 -93
- package/src/upstream-probe/display.js +52 -52
- package/src/upstream-probe/probe.js +49 -49
- package/src/upstream-probe/rotate.js +110 -110
- package/src/upstream-probe/start.js +45 -45
- package/src/upstream.js +355 -355
- package/docs/cli_help_mini.md +0 -148
- package/src/providers/AGENTS.md +0 -49
- package/src/routes/AGENTS.md +0 -37
|
@@ -1,220 +1,220 @@
|
|
|
1
|
-
// vendor 自 qwenwork2api-makers 的 edge-functions/_shared/crypto.js(逐字搬,仅加 webcrypto 兜底)。
|
|
2
|
-
// 原作者手写 AES/RSA/MD5 是因为 Cloudflare Workers 无 node:crypto;**不要**"顺手优化"成原生实现 ——
|
|
3
|
-
// 实测换成 node:crypto 后上游回 `code 101 Signature invalid`(RSA/AES 材料与上游期望不等价)。
|
|
4
|
-
// Node 侧需要 globalThis.crypto(getRandomValues / subtle.digest);<19 用 node:crypto 的 webcrypto 兜底。
|
|
5
|
-
if (!globalThis.crypto || !globalThis.crypto.subtle) {
|
|
6
|
-
const { webcrypto } = await import("node:crypto");
|
|
7
|
-
globalThis.crypto = webcrypto;
|
|
8
|
-
}
|
|
9
|
-
|
|
10
|
-
const SBOX = (() => {
|
|
11
|
-
const s = new Uint8Array(256);
|
|
12
|
-
let p = 1;
|
|
13
|
-
let q = 1;
|
|
14
|
-
do {
|
|
15
|
-
p = p ^ ((p << 1) & 0xff) ^ (p & 0x80 ? 0x1b : 0);
|
|
16
|
-
q ^= q << 1;
|
|
17
|
-
q ^= q << 2;
|
|
18
|
-
q ^= q << 4;
|
|
19
|
-
if (q & 0x80) q ^= 0x09;
|
|
20
|
-
q &= 0xff;
|
|
21
|
-
const x = q ^ ((q << 1) | (q >> 7)) ^ ((q << 2) | (q >> 6)) ^ ((q << 3) | (q >> 5)) ^ ((q << 4) | (q >> 4));
|
|
22
|
-
s[p] = (x ^ 0x63) & 0xff;
|
|
23
|
-
} while (p !== 1);
|
|
24
|
-
s[0] = 0x63;
|
|
25
|
-
return s;
|
|
26
|
-
})();
|
|
27
|
-
|
|
28
|
-
const RCON = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
|
|
29
|
-
|
|
30
|
-
export function utf8(str) {
|
|
31
|
-
return new TextEncoder().encode(str);
|
|
32
|
-
}
|
|
33
|
-
|
|
34
|
-
export function hex(bytes) {
|
|
35
|
-
let out = "";
|
|
36
|
-
for (let i = 0; i < bytes.length; i++) out += bytes[i].toString(16).padStart(2, "0");
|
|
37
|
-
return out;
|
|
38
|
-
}
|
|
39
|
-
|
|
40
|
-
export function b64(bytes) {
|
|
41
|
-
let s = "";
|
|
42
|
-
for (let i = 0; i < bytes.length; i++) s += String.fromCharCode(bytes[i]);
|
|
43
|
-
return btoa(s);
|
|
44
|
-
}
|
|
45
|
-
|
|
46
|
-
export function unb64(str) {
|
|
47
|
-
const s = atob(str);
|
|
48
|
-
const out = new Uint8Array(s.length);
|
|
49
|
-
for (let i = 0; i < s.length; i++) out[i] = s.charCodeAt(i);
|
|
50
|
-
return out;
|
|
51
|
-
}
|
|
52
|
-
|
|
53
|
-
export function b64url(bytes) {
|
|
54
|
-
return b64(bytes).replace(/\+/g, "-").replace(/\//g, "_").replace(/=+$/, "");
|
|
55
|
-
}
|
|
56
|
-
|
|
57
|
-
export function uuid() {
|
|
58
|
-
const r = new Uint8Array(16);
|
|
59
|
-
crypto.getRandomValues(r);
|
|
60
|
-
r[6] = (r[6] & 0x0f) | 0x40;
|
|
61
|
-
r[8] = (r[8] & 0x3f) | 0x80;
|
|
62
|
-
const h = hex(r);
|
|
63
|
-
return `${h.slice(0, 8)}-${h.slice(8, 12)}-${h.slice(12, 16)}-${h.slice(16, 20)}-${h.slice(20)}`;
|
|
64
|
-
}
|
|
65
|
-
|
|
66
|
-
const MD5_S = [
|
|
67
|
-
7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
|
|
68
|
-
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,
|
|
69
|
-
];
|
|
70
|
-
|
|
71
|
-
const MD5_K = new Int32Array(64);
|
|
72
|
-
for (let i = 0; i < 64; i++) MD5_K[i] = Math.floor(Math.abs(Math.sin(i + 1)) * 4294967296) | 0;
|
|
73
|
-
|
|
74
|
-
function rotl(x, n) {
|
|
75
|
-
return (x << n) | (x >>> (32 - n));
|
|
76
|
-
}
|
|
77
|
-
|
|
78
|
-
export function md5(input) {
|
|
79
|
-
const msg = typeof input === "string" ? utf8(input) : input;
|
|
80
|
-
const len = msg.length;
|
|
81
|
-
const bitLen = len * 8;
|
|
82
|
-
const padLen = (56 - ((len + 1) % 64) + 64) % 64;
|
|
83
|
-
const total = len + 1 + padLen + 8;
|
|
84
|
-
const buf = new Uint8Array(total);
|
|
85
|
-
buf.set(msg, 0);
|
|
86
|
-
buf[len] = 0x80;
|
|
87
|
-
const view = new DataView(buf.buffer);
|
|
88
|
-
view.setUint32(total - 8, bitLen >>> 0, true);
|
|
89
|
-
view.setUint32(total - 4, Math.floor(bitLen / 4294967296), true);
|
|
90
|
-
|
|
91
|
-
let a0 = 0x67452301;
|
|
92
|
-
let b0 = 0xefcdab89;
|
|
93
|
-
let c0 = 0x98badcfe;
|
|
94
|
-
let d0 = 0x10325476;
|
|
95
|
-
|
|
96
|
-
for (let i = 0; i < total; i += 64) {
|
|
97
|
-
const m = new Int32Array(16);
|
|
98
|
-
for (let j = 0; j < 16; j++) m[j] = view.getInt32(i + j * 4, true);
|
|
99
|
-
let a = a0;
|
|
100
|
-
let b = b0;
|
|
101
|
-
let c = c0;
|
|
102
|
-
let d = d0;
|
|
103
|
-
for (let j = 0; j < 64; j++) {
|
|
104
|
-
let f;
|
|
105
|
-
let g;
|
|
106
|
-
if (j < 16) {
|
|
107
|
-
f = (b & c) | (~b & d);
|
|
108
|
-
g = j;
|
|
109
|
-
} else if (j < 32) {
|
|
110
|
-
f = (d & b) | (~d & c);
|
|
111
|
-
g = (5 * j + 1) % 16;
|
|
112
|
-
} else if (j < 48) {
|
|
113
|
-
f = b ^ c ^ d;
|
|
114
|
-
g = (3 * j + 5) % 16;
|
|
115
|
-
} else {
|
|
116
|
-
f = c ^ (b | ~d);
|
|
117
|
-
g = (7 * j) % 16;
|
|
118
|
-
}
|
|
119
|
-
f = (f + a + MD5_K[j] + m[g]) | 0;
|
|
120
|
-
a = d;
|
|
121
|
-
d = c;
|
|
122
|
-
c = b;
|
|
123
|
-
b = (b + rotl(f, MD5_S[j])) | 0;
|
|
124
|
-
}
|
|
125
|
-
a0 = (a0 + a) | 0;
|
|
126
|
-
b0 = (b0 + b) | 0;
|
|
127
|
-
c0 = (c0 + c) | 0;
|
|
128
|
-
d0 = (d0 + d) | 0;
|
|
129
|
-
}
|
|
130
|
-
|
|
131
|
-
const out = new Uint8Array(16);
|
|
132
|
-
const ov = new DataView(out.buffer);
|
|
133
|
-
ov.setInt32(0, a0, true);
|
|
134
|
-
ov.setInt32(4, b0, true);
|
|
135
|
-
ov.setInt32(8, c0, true);
|
|
136
|
-
ov.setInt32(12, d0, true);
|
|
137
|
-
return hex(out);
|
|
138
|
-
}
|
|
139
|
-
|
|
140
|
-
function xtime(a) {
|
|
141
|
-
return ((a << 1) ^ (a & 0x80 ? 0x1b : 0)) & 0xff;
|
|
142
|
-
}
|
|
143
|
-
|
|
144
|
-
function keyExpansion(key) {
|
|
145
|
-
const w = new Uint8Array(176);
|
|
146
|
-
w.set(key, 0);
|
|
147
|
-
for (let i = 4; i < 44; i++) {
|
|
148
|
-
const t = [w[(i - 1) * 4], w[(i - 1) * 4 + 1], w[(i - 1) * 4 + 2], w[(i - 1) * 4 + 3]];
|
|
149
|
-
if (i % 4 === 0) {
|
|
150
|
-
const r = t[0];
|
|
151
|
-
t[0] = t[1];
|
|
152
|
-
t[1] = t[2];
|
|
153
|
-
t[2] = t[3];
|
|
154
|
-
t[3] = r;
|
|
155
|
-
for (let j = 0; j < 4; j++) t[j] = SBOX[t[j]];
|
|
156
|
-
t[0] ^= RCON[i / 4 - 1];
|
|
157
|
-
}
|
|
158
|
-
for (let j = 0; j < 4; j++) w[i * 4 + j] = w[(i - 4) * 4 + j] ^ t[j];
|
|
159
|
-
}
|
|
160
|
-
return w;
|
|
161
|
-
}
|
|
162
|
-
|
|
163
|
-
function addRoundKey(state, w, round) {
|
|
164
|
-
for (let c = 0; c < 4; c++) {
|
|
165
|
-
for (let r = 0; r < 4; r++) state[c * 4 + r] ^= w[round * 16 + c * 4 + r];
|
|
166
|
-
}
|
|
167
|
-
}
|
|
168
|
-
|
|
169
|
-
function subBytes(state) {
|
|
170
|
-
for (let i = 0; i < 16; i++) state[i] = SBOX[state[i]];
|
|
171
|
-
}
|
|
172
|
-
|
|
173
|
-
function shiftRows(s) {
|
|
174
|
-
const t = s.slice();
|
|
175
|
-
const map = [0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, 1, 6, 11];
|
|
176
|
-
for (let i = 0; i < 16; i++) s[i] = t[map[i]];
|
|
177
|
-
}
|
|
178
|
-
|
|
179
|
-
function mixColumns(s) {
|
|
180
|
-
for (let c = 0; c < 4; c++) {
|
|
181
|
-
const i = c * 4;
|
|
182
|
-
const a0 = s[i];
|
|
183
|
-
const a1 = s[i + 1];
|
|
184
|
-
const a2 = s[i + 2];
|
|
185
|
-
const a3 = s[i + 3];
|
|
186
|
-
s[i] = xtime(a0) ^ (xtime(a1) ^ a1) ^ a2 ^ a3;
|
|
187
|
-
s[i + 1] = a0 ^ xtime(a1) ^ (xtime(a2) ^ a2) ^ a3;
|
|
188
|
-
s[i + 2] = a0 ^ a1 ^ xtime(a2) ^ (xtime(a3) ^ a3);
|
|
189
|
-
s[i + 3] = (xtime(a0) ^ a0) ^ a1 ^ a2 ^ xtime(a3);
|
|
190
|
-
}
|
|
191
|
-
}
|
|
192
|
-
|
|
193
|
-
export function aesCbcEncrypt(plain, key) {
|
|
194
|
-
const w = keyExpansion(key);
|
|
195
|
-
const padLen = 16 - (plain.length % 16);
|
|
196
|
-
const data = new Uint8Array(plain.length + padLen);
|
|
197
|
-
data.set(plain, 0);
|
|
198
|
-
for (let i = plain.length; i < data.length; i++) data[i] = padLen;
|
|
199
|
-
const out = new Uint8Array(data.length);
|
|
200
|
-
const block = new Uint8Array(16);
|
|
201
|
-
let prev = key.slice(0, 16);
|
|
202
|
-
for (let off = 0; off < data.length; off += 16) {
|
|
203
|
-
for (let i = 0; i < 16; i++) block[i] = data[off + i] ^ prev[i];
|
|
204
|
-
addRoundKey(block, w, 0);
|
|
205
|
-
for (let round = 1; round < 10; round++) {
|
|
206
|
-
subBytes(block);
|
|
207
|
-
shiftRows(block);
|
|
208
|
-
mixColumns(block);
|
|
209
|
-
addRoundKey(block, w, round);
|
|
210
|
-
}
|
|
211
|
-
subBytes(block);
|
|
212
|
-
shiftRows(block);
|
|
213
|
-
addRoundKey(block, w, 10);
|
|
214
|
-
out.set(block, off);
|
|
215
|
-
prev = block.slice(0, 16);
|
|
216
|
-
}
|
|
217
|
-
return out;
|
|
218
|
-
}
|
|
1
|
+
// vendor 自 qwenwork2api-makers 的 edge-functions/_shared/crypto.js(逐字搬,仅加 webcrypto 兜底)。
|
|
2
|
+
// 原作者手写 AES/RSA/MD5 是因为 Cloudflare Workers 无 node:crypto;**不要**"顺手优化"成原生实现 ——
|
|
3
|
+
// 实测换成 node:crypto 后上游回 `code 101 Signature invalid`(RSA/AES 材料与上游期望不等价)。
|
|
4
|
+
// Node 侧需要 globalThis.crypto(getRandomValues / subtle.digest);<19 用 node:crypto 的 webcrypto 兜底。
|
|
5
|
+
if (!globalThis.crypto || !globalThis.crypto.subtle) {
|
|
6
|
+
const { webcrypto } = await import("node:crypto");
|
|
7
|
+
globalThis.crypto = webcrypto;
|
|
8
|
+
}
|
|
9
|
+
|
|
10
|
+
const SBOX = (() => {
|
|
11
|
+
const s = new Uint8Array(256);
|
|
12
|
+
let p = 1;
|
|
13
|
+
let q = 1;
|
|
14
|
+
do {
|
|
15
|
+
p = p ^ ((p << 1) & 0xff) ^ (p & 0x80 ? 0x1b : 0);
|
|
16
|
+
q ^= q << 1;
|
|
17
|
+
q ^= q << 2;
|
|
18
|
+
q ^= q << 4;
|
|
19
|
+
if (q & 0x80) q ^= 0x09;
|
|
20
|
+
q &= 0xff;
|
|
21
|
+
const x = q ^ ((q << 1) | (q >> 7)) ^ ((q << 2) | (q >> 6)) ^ ((q << 3) | (q >> 5)) ^ ((q << 4) | (q >> 4));
|
|
22
|
+
s[p] = (x ^ 0x63) & 0xff;
|
|
23
|
+
} while (p !== 1);
|
|
24
|
+
s[0] = 0x63;
|
|
25
|
+
return s;
|
|
26
|
+
})();
|
|
27
|
+
|
|
28
|
+
const RCON = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
|
|
29
|
+
|
|
30
|
+
export function utf8(str) {
|
|
31
|
+
return new TextEncoder().encode(str);
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
export function hex(bytes) {
|
|
35
|
+
let out = "";
|
|
36
|
+
for (let i = 0; i < bytes.length; i++) out += bytes[i].toString(16).padStart(2, "0");
|
|
37
|
+
return out;
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
export function b64(bytes) {
|
|
41
|
+
let s = "";
|
|
42
|
+
for (let i = 0; i < bytes.length; i++) s += String.fromCharCode(bytes[i]);
|
|
43
|
+
return btoa(s);
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
export function unb64(str) {
|
|
47
|
+
const s = atob(str);
|
|
48
|
+
const out = new Uint8Array(s.length);
|
|
49
|
+
for (let i = 0; i < s.length; i++) out[i] = s.charCodeAt(i);
|
|
50
|
+
return out;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
export function b64url(bytes) {
|
|
54
|
+
return b64(bytes).replace(/\+/g, "-").replace(/\//g, "_").replace(/=+$/, "");
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
export function uuid() {
|
|
58
|
+
const r = new Uint8Array(16);
|
|
59
|
+
crypto.getRandomValues(r);
|
|
60
|
+
r[6] = (r[6] & 0x0f) | 0x40;
|
|
61
|
+
r[8] = (r[8] & 0x3f) | 0x80;
|
|
62
|
+
const h = hex(r);
|
|
63
|
+
return `${h.slice(0, 8)}-${h.slice(8, 12)}-${h.slice(12, 16)}-${h.slice(16, 20)}-${h.slice(20)}`;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
const MD5_S = [
|
|
67
|
+
7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
|
|
68
|
+
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,
|
|
69
|
+
];
|
|
70
|
+
|
|
71
|
+
const MD5_K = new Int32Array(64);
|
|
72
|
+
for (let i = 0; i < 64; i++) MD5_K[i] = Math.floor(Math.abs(Math.sin(i + 1)) * 4294967296) | 0;
|
|
73
|
+
|
|
74
|
+
function rotl(x, n) {
|
|
75
|
+
return (x << n) | (x >>> (32 - n));
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
export function md5(input) {
|
|
79
|
+
const msg = typeof input === "string" ? utf8(input) : input;
|
|
80
|
+
const len = msg.length;
|
|
81
|
+
const bitLen = len * 8;
|
|
82
|
+
const padLen = (56 - ((len + 1) % 64) + 64) % 64;
|
|
83
|
+
const total = len + 1 + padLen + 8;
|
|
84
|
+
const buf = new Uint8Array(total);
|
|
85
|
+
buf.set(msg, 0);
|
|
86
|
+
buf[len] = 0x80;
|
|
87
|
+
const view = new DataView(buf.buffer);
|
|
88
|
+
view.setUint32(total - 8, bitLen >>> 0, true);
|
|
89
|
+
view.setUint32(total - 4, Math.floor(bitLen / 4294967296), true);
|
|
90
|
+
|
|
91
|
+
let a0 = 0x67452301;
|
|
92
|
+
let b0 = 0xefcdab89;
|
|
93
|
+
let c0 = 0x98badcfe;
|
|
94
|
+
let d0 = 0x10325476;
|
|
95
|
+
|
|
96
|
+
for (let i = 0; i < total; i += 64) {
|
|
97
|
+
const m = new Int32Array(16);
|
|
98
|
+
for (let j = 0; j < 16; j++) m[j] = view.getInt32(i + j * 4, true);
|
|
99
|
+
let a = a0;
|
|
100
|
+
let b = b0;
|
|
101
|
+
let c = c0;
|
|
102
|
+
let d = d0;
|
|
103
|
+
for (let j = 0; j < 64; j++) {
|
|
104
|
+
let f;
|
|
105
|
+
let g;
|
|
106
|
+
if (j < 16) {
|
|
107
|
+
f = (b & c) | (~b & d);
|
|
108
|
+
g = j;
|
|
109
|
+
} else if (j < 32) {
|
|
110
|
+
f = (d & b) | (~d & c);
|
|
111
|
+
g = (5 * j + 1) % 16;
|
|
112
|
+
} else if (j < 48) {
|
|
113
|
+
f = b ^ c ^ d;
|
|
114
|
+
g = (3 * j + 5) % 16;
|
|
115
|
+
} else {
|
|
116
|
+
f = c ^ (b | ~d);
|
|
117
|
+
g = (7 * j) % 16;
|
|
118
|
+
}
|
|
119
|
+
f = (f + a + MD5_K[j] + m[g]) | 0;
|
|
120
|
+
a = d;
|
|
121
|
+
d = c;
|
|
122
|
+
c = b;
|
|
123
|
+
b = (b + rotl(f, MD5_S[j])) | 0;
|
|
124
|
+
}
|
|
125
|
+
a0 = (a0 + a) | 0;
|
|
126
|
+
b0 = (b0 + b) | 0;
|
|
127
|
+
c0 = (c0 + c) | 0;
|
|
128
|
+
d0 = (d0 + d) | 0;
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
const out = new Uint8Array(16);
|
|
132
|
+
const ov = new DataView(out.buffer);
|
|
133
|
+
ov.setInt32(0, a0, true);
|
|
134
|
+
ov.setInt32(4, b0, true);
|
|
135
|
+
ov.setInt32(8, c0, true);
|
|
136
|
+
ov.setInt32(12, d0, true);
|
|
137
|
+
return hex(out);
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
function xtime(a) {
|
|
141
|
+
return ((a << 1) ^ (a & 0x80 ? 0x1b : 0)) & 0xff;
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
function keyExpansion(key) {
|
|
145
|
+
const w = new Uint8Array(176);
|
|
146
|
+
w.set(key, 0);
|
|
147
|
+
for (let i = 4; i < 44; i++) {
|
|
148
|
+
const t = [w[(i - 1) * 4], w[(i - 1) * 4 + 1], w[(i - 1) * 4 + 2], w[(i - 1) * 4 + 3]];
|
|
149
|
+
if (i % 4 === 0) {
|
|
150
|
+
const r = t[0];
|
|
151
|
+
t[0] = t[1];
|
|
152
|
+
t[1] = t[2];
|
|
153
|
+
t[2] = t[3];
|
|
154
|
+
t[3] = r;
|
|
155
|
+
for (let j = 0; j < 4; j++) t[j] = SBOX[t[j]];
|
|
156
|
+
t[0] ^= RCON[i / 4 - 1];
|
|
157
|
+
}
|
|
158
|
+
for (let j = 0; j < 4; j++) w[i * 4 + j] = w[(i - 4) * 4 + j] ^ t[j];
|
|
159
|
+
}
|
|
160
|
+
return w;
|
|
161
|
+
}
|
|
162
|
+
|
|
163
|
+
function addRoundKey(state, w, round) {
|
|
164
|
+
for (let c = 0; c < 4; c++) {
|
|
165
|
+
for (let r = 0; r < 4; r++) state[c * 4 + r] ^= w[round * 16 + c * 4 + r];
|
|
166
|
+
}
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
function subBytes(state) {
|
|
170
|
+
for (let i = 0; i < 16; i++) state[i] = SBOX[state[i]];
|
|
171
|
+
}
|
|
172
|
+
|
|
173
|
+
function shiftRows(s) {
|
|
174
|
+
const t = s.slice();
|
|
175
|
+
const map = [0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12, 1, 6, 11];
|
|
176
|
+
for (let i = 0; i < 16; i++) s[i] = t[map[i]];
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
function mixColumns(s) {
|
|
180
|
+
for (let c = 0; c < 4; c++) {
|
|
181
|
+
const i = c * 4;
|
|
182
|
+
const a0 = s[i];
|
|
183
|
+
const a1 = s[i + 1];
|
|
184
|
+
const a2 = s[i + 2];
|
|
185
|
+
const a3 = s[i + 3];
|
|
186
|
+
s[i] = xtime(a0) ^ (xtime(a1) ^ a1) ^ a2 ^ a3;
|
|
187
|
+
s[i + 1] = a0 ^ xtime(a1) ^ (xtime(a2) ^ a2) ^ a3;
|
|
188
|
+
s[i + 2] = a0 ^ a1 ^ xtime(a2) ^ (xtime(a3) ^ a3);
|
|
189
|
+
s[i + 3] = (xtime(a0) ^ a0) ^ a1 ^ a2 ^ xtime(a3);
|
|
190
|
+
}
|
|
191
|
+
}
|
|
192
|
+
|
|
193
|
+
export function aesCbcEncrypt(plain, key) {
|
|
194
|
+
const w = keyExpansion(key);
|
|
195
|
+
const padLen = 16 - (plain.length % 16);
|
|
196
|
+
const data = new Uint8Array(plain.length + padLen);
|
|
197
|
+
data.set(plain, 0);
|
|
198
|
+
for (let i = plain.length; i < data.length; i++) data[i] = padLen;
|
|
199
|
+
const out = new Uint8Array(data.length);
|
|
200
|
+
const block = new Uint8Array(16);
|
|
201
|
+
let prev = key.slice(0, 16);
|
|
202
|
+
for (let off = 0; off < data.length; off += 16) {
|
|
203
|
+
for (let i = 0; i < 16; i++) block[i] = data[off + i] ^ prev[i];
|
|
204
|
+
addRoundKey(block, w, 0);
|
|
205
|
+
for (let round = 1; round < 10; round++) {
|
|
206
|
+
subBytes(block);
|
|
207
|
+
shiftRows(block);
|
|
208
|
+
mixColumns(block);
|
|
209
|
+
addRoundKey(block, w, round);
|
|
210
|
+
}
|
|
211
|
+
subBytes(block);
|
|
212
|
+
shiftRows(block);
|
|
213
|
+
addRoundKey(block, w, 10);
|
|
214
|
+
out.set(block, off);
|
|
215
|
+
prev = block.slice(0, 16);
|
|
216
|
+
}
|
|
217
|
+
return out;
|
|
218
|
+
}
|
|
219
219
|
|
|
220
220
|
// globalqwenwork 变体:国际站 gateway.qwenwork.ai,协议与 cn 逐字同构(2026-10-01 现网取证),仅命名空间与常量不同 — 见 docs/adr/0041-globalqwenwork-international-provider.md
|
|
@@ -1,22 +1,22 @@
|
|
|
1
|
-
// vendor 自 src/providers/qwenwork/http.js(只保留本 provider 用得上的部分;CORS/preflight 属原项目的边缘层,不带)。
|
|
2
|
-
export function cleanErrorText(value) {
|
|
3
|
-
let s = String(value === undefined || value === null ? "" : value);
|
|
4
|
-
s = s
|
|
5
|
-
.replace(/<script[\s\S]*?<\/script>/gi, " ")
|
|
6
|
-
.replace(/<style[\s\S]*?<\/style>/gi, " ")
|
|
7
|
-
.replace(/<[^>]*>/g, " ")
|
|
8
|
-
.replace(/[\r\n\t]+/g, " ")
|
|
9
|
-
.replace(/[^\S ]+/g, "")
|
|
10
|
-
.replace(/\s+/g, " ")
|
|
11
|
-
.trim();
|
|
12
|
-
if (s.length > 200) s = s.slice(0, 200);
|
|
13
|
-
return s;
|
|
14
|
-
}
|
|
15
|
-
|
|
16
|
-
export function timeoutSignal(ms) {
|
|
17
|
-
const controller = new AbortController();
|
|
18
|
-
const timer = setTimeout(() => controller.abort(), ms);
|
|
19
|
-
return { signal: controller.signal, done: () => clearTimeout(timer) };
|
|
20
|
-
}
|
|
1
|
+
// vendor 自 src/providers/qwenwork/http.js(只保留本 provider 用得上的部分;CORS/preflight 属原项目的边缘层,不带)。
|
|
2
|
+
export function cleanErrorText(value) {
|
|
3
|
+
let s = String(value === undefined || value === null ? "" : value);
|
|
4
|
+
s = s
|
|
5
|
+
.replace(/<script[\s\S]*?<\/script>/gi, " ")
|
|
6
|
+
.replace(/<style[\s\S]*?<\/style>/gi, " ")
|
|
7
|
+
.replace(/<[^>]*>/g, " ")
|
|
8
|
+
.replace(/[\r\n\t]+/g, " ")
|
|
9
|
+
.replace(/[^\S ]+/g, "")
|
|
10
|
+
.replace(/\s+/g, " ")
|
|
11
|
+
.trim();
|
|
12
|
+
if (s.length > 200) s = s.slice(0, 200);
|
|
13
|
+
return s;
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
export function timeoutSignal(ms) {
|
|
17
|
+
const controller = new AbortController();
|
|
18
|
+
const timer = setTimeout(() => controller.abort(), ms);
|
|
19
|
+
return { signal: controller.signal, done: () => clearTimeout(timer) };
|
|
20
|
+
}
|
|
21
21
|
|
|
22
22
|
// globalqwenwork 变体:国际站 gateway.qwenwork.ai,协议与 cn 逐字同构(2026-10-01 现网取证),仅命名空间与常量不同 — 见 docs/adr/0041-globalqwenwork-international-provider.md
|
|
@@ -1,56 +1,56 @@
|
|
|
1
|
-
// vendor 自 src/providers/qwenwork/crypto.js 的 RSA 段(BigInt modPow + PKCS#1 v1.5 type-2),逐字搬。
|
|
2
|
-
// 模数取 constants.js 的 RSA_MODULUS_HEX(与上游一致,勿改)。
|
|
3
|
-
import { b64, utf8 } from "./crypto.js";
|
|
4
|
-
import { RSA_MODULUS_HEX, RSA_EXPONENT } from "./constants.js";
|
|
5
|
-
|
|
6
|
-
export const RSA_N = BigInt("0x" + RSA_MODULUS_HEX);
|
|
7
|
-
export const RSA_E = BigInt(RSA_EXPONENT);
|
|
8
|
-
|
|
9
|
-
function modPow(base, exp, mod) {
|
|
10
|
-
let result = 1n;
|
|
11
|
-
let b = base % mod;
|
|
12
|
-
let e = exp;
|
|
13
|
-
while (e > 0n) {
|
|
14
|
-
if (e & 1n) result = (result * b) % mod;
|
|
15
|
-
b = (b * b) % mod;
|
|
16
|
-
e >>= 1n;
|
|
17
|
-
}
|
|
18
|
-
return result;
|
|
19
|
-
}
|
|
20
|
-
|
|
21
|
-
export function rsaPkcs1Encrypt(data, n = RSA_N, e = RSA_E, k = 128) {
|
|
22
|
-
const psLen = k - data.length - 3;
|
|
23
|
-
if (psLen < 8) throw new Error("rsa: message too long");
|
|
24
|
-
const ps = new Uint8Array(psLen);
|
|
25
|
-
for (;;) {
|
|
26
|
-
crypto.getRandomValues(ps);
|
|
27
|
-
let ok = true;
|
|
28
|
-
for (let i = 0; i < psLen; i++) {
|
|
29
|
-
if (ps[i] === 0) {
|
|
30
|
-
ok = false;
|
|
31
|
-
break;
|
|
32
|
-
}
|
|
33
|
-
}
|
|
34
|
-
if (ok) break;
|
|
35
|
-
}
|
|
36
|
-
const em = new Uint8Array(k);
|
|
37
|
-
em[0] = 0x00;
|
|
38
|
-
em[1] = 0x02;
|
|
39
|
-
em.set(ps, 2);
|
|
40
|
-
em[2 + psLen] = 0x00;
|
|
41
|
-
em.set(data, 3 + psLen);
|
|
42
|
-
let m = 0n;
|
|
43
|
-
for (let i = 0; i < k; i++) m = (m << 8n) | BigInt(em[i]);
|
|
44
|
-
const c = modPow(m, e, n);
|
|
45
|
-
const out = new Uint8Array(k);
|
|
46
|
-
let v = c;
|
|
47
|
-
for (let i = k - 1; i >= 0; i--) {
|
|
48
|
-
out[i] = Number(v & 0xffn);
|
|
49
|
-
v >>= 8n;
|
|
50
|
-
}
|
|
51
|
-
return b64(out);
|
|
52
|
-
}
|
|
53
|
-
|
|
54
|
-
export { b64, utf8 };
|
|
1
|
+
// vendor 自 src/providers/qwenwork/crypto.js 的 RSA 段(BigInt modPow + PKCS#1 v1.5 type-2),逐字搬。
|
|
2
|
+
// 模数取 constants.js 的 RSA_MODULUS_HEX(与上游一致,勿改)。
|
|
3
|
+
import { b64, utf8 } from "./crypto.js";
|
|
4
|
+
import { RSA_MODULUS_HEX, RSA_EXPONENT } from "./constants.js";
|
|
5
|
+
|
|
6
|
+
export const RSA_N = BigInt("0x" + RSA_MODULUS_HEX);
|
|
7
|
+
export const RSA_E = BigInt(RSA_EXPONENT);
|
|
8
|
+
|
|
9
|
+
function modPow(base, exp, mod) {
|
|
10
|
+
let result = 1n;
|
|
11
|
+
let b = base % mod;
|
|
12
|
+
let e = exp;
|
|
13
|
+
while (e > 0n) {
|
|
14
|
+
if (e & 1n) result = (result * b) % mod;
|
|
15
|
+
b = (b * b) % mod;
|
|
16
|
+
e >>= 1n;
|
|
17
|
+
}
|
|
18
|
+
return result;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
export function rsaPkcs1Encrypt(data, n = RSA_N, e = RSA_E, k = 128) {
|
|
22
|
+
const psLen = k - data.length - 3;
|
|
23
|
+
if (psLen < 8) throw new Error("rsa: message too long");
|
|
24
|
+
const ps = new Uint8Array(psLen);
|
|
25
|
+
for (;;) {
|
|
26
|
+
crypto.getRandomValues(ps);
|
|
27
|
+
let ok = true;
|
|
28
|
+
for (let i = 0; i < psLen; i++) {
|
|
29
|
+
if (ps[i] === 0) {
|
|
30
|
+
ok = false;
|
|
31
|
+
break;
|
|
32
|
+
}
|
|
33
|
+
}
|
|
34
|
+
if (ok) break;
|
|
35
|
+
}
|
|
36
|
+
const em = new Uint8Array(k);
|
|
37
|
+
em[0] = 0x00;
|
|
38
|
+
em[1] = 0x02;
|
|
39
|
+
em.set(ps, 2);
|
|
40
|
+
em[2 + psLen] = 0x00;
|
|
41
|
+
em.set(data, 3 + psLen);
|
|
42
|
+
let m = 0n;
|
|
43
|
+
for (let i = 0; i < k; i++) m = (m << 8n) | BigInt(em[i]);
|
|
44
|
+
const c = modPow(m, e, n);
|
|
45
|
+
const out = new Uint8Array(k);
|
|
46
|
+
let v = c;
|
|
47
|
+
for (let i = k - 1; i >= 0; i--) {
|
|
48
|
+
out[i] = Number(v & 0xffn);
|
|
49
|
+
v >>= 8n;
|
|
50
|
+
}
|
|
51
|
+
return b64(out);
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
export { b64, utf8 };
|
|
55
55
|
|
|
56
56
|
// globalqwenwork 变体:国际站 gateway.qwenwork.ai,协议与 cn 逐字同构(2026-10-01 现网取证),仅命名空间与常量不同 — 见 docs/adr/0041-globalqwenwork-international-provider.md
|