SnowCat 雪猫底层全源码：NapCat 4.18.28 底座 + SnowLuma 能力移植 + V8 通道适配 9.9.37

26 包 monorepo（TS 全源码）：
- snowcat-core: NT 内核 API 封装 + listener（含 9.9.37 六回调适配）+ Packet 发包
- snowcat-onebot: OneBot v11 全动作 + MCP Streamable HTTP 适配器 + 稳定线
- snowcat-webui-frontend/backend: 雪猫控制台（React+HeroUI）
- snowcat-shell: 单文件 bundle 出口（vite inlineDynamicImports）
- snowcat-native: napi2native / MoeHoo / ffmpeg / pty 运行时
- 56 项 SnowLuma 独门动作移植（qzone 全家桶/群相册/装扮/闪照/收藏）
- 工具件: 解包器/启动器/便携制作器/doctor

GitHub 关联已全量指向 DandanLLab/SnowCatQQ

packages/snowcat-qrcode/vendor/QRCode/QRPolynomial.ts

@@ -0,0 +1,65 @@
+import QRMath from './QRMath';
+
+class QRPolynomial {
+  private num: number[];
+
+  constructor (num: number[], shift: number) {
+    if (num.length === undefined) {
+      throw new Error(num.length + '/' + shift);
+    }
+
+    let offset = 0;
+
+    while (offset < num.length && num[offset] === 0) {
+      offset++;
+    }
+
+    this.num = new Array(num.length - offset + shift);
+    for (let i = 0; i < num.length - offset; i++) {
+      this.num[i] = num[i + offset]!;
+    }
+  }
+
+  get (index: number): number {
+    return this.num[index]!;
+  }
+
+  getLength (): number {
+    return this.num.length;
+  }
+
+  multiply (e: QRPolynomial): QRPolynomial {
+    const num = new Array(this.getLength() + e.getLength() - 1);
+
+    for (let i = 0; i < this.getLength(); i++) {
+      for (let j = 0; j < e.getLength(); j++) {
+        num[i + j] ^= QRMath.gexp(QRMath.glog(this.get(i)) + QRMath.glog(e.get(j)));
+      }
+    }
+
+    return new QRPolynomial(num, 0);
+  }
+
+  mod (e: QRPolynomial): QRPolynomial {
+    if (this.getLength() - e.getLength() < 0) {
+      return this;
+    }
+
+    const ratio = QRMath.glog(this.get(0)) - QRMath.glog(e.get(0));
+
+    const num = new Array(this.getLength());
+
+    for (let i = 0; i < this.getLength(); i++) {
+      num[i] = this.get(i);
+    }
+
+    for (let x = 0; x < e.getLength(); x++) {
+      num[x] ^= QRMath.gexp(QRMath.glog(e.get(x)) + ratio);
+    }
+
+    // recursive call
+    return new QRPolynomial(num, 0).mod(e);
+  }
+}
+
+export default QRPolynomial;